登录
首页 » MathCAD » Mitigation-of-voltage-unbalance

Mitigation-of-voltage-unbalance

于 2013-12-31 发布 文件大小:281KB
0 111
下载积分: 1 下载次数: 3

代码说明:

  matlab description unbalanced voltage

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • ellipsefit
    椭圆图线拟合,输入x y,可拟合出椭圆图线(tuoyuantuxiannihe)
    2010-05-30 21:50:00下载
    积分:1
  • Wood-EMBS-2005
    target tracking codes
    2011-11-01 19:23:00下载
    积分:1
  • parameter-estimation-problem
    国外信号处理图书《参数估计与逆问题》的配套程序(<parameter estimation and inverse problem> 2nd Edition Author:Richard C Aster)
    2013-12-30 15:02:12下载
    积分:1
  • PSO-Fuzzy-Modeler-for-MATLAB
    说明:  详细给定了模糊PSO模型算法,可以用于matlab工具箱(PSO Fuzzy Modeler for MATLAB)
    2011-03-25 23:41:53下载
    积分:1
  • houzhiboshuxingcheng
    麦克风阵列的后置波束形成,实现了信噪比的提高。(Rear beamforming)
    2012-04-06 10:01:55下载
    积分:1
  • zuida
    用matalb进行ofdm的仿真,这个程序可以运行,简单明了(matalb used for the ofdm simulation, the process can run simple and clear)
    2007-06-04 19:39:46下载
    积分:1
  • NOUMP
    不考虑不平衡磁拉力(UMP),转子系统在自身的质量、阻尼、弹簧等作用下,轴心轨迹求解方法(unbalanced magnetic pull is not considerated and rotor center orbit is gotten)
    2013-11-23 20:10:57下载
    积分:1
  • WPAnalysis
    WPanalysis Function for wavelet processing
    2013-05-09 02:37:12下载
    积分:1
  • CMTF_Toolbox_v1_0
    CMTF工具箱包含了耦合矩阵和张量矩阵的分解的matlab编码(Coupled Matrix and Tensor Factorization for Matlab)
    2014-01-23 15:17:24下载
    积分:1
  • maxcost
    “基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法,其基本思路为:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条自V1至Vn的最短路;再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流量增至最大可能值;而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新确定,如此多次迭代,最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
    2010-12-22 17:27:32下载
    积分:1
  • 696524资源总数
  • 103920会员总数
  • 65今日下载