-
power_wind_dfig
随机风速下并网型双馈风力发电机simulink模型(Random wind speed and grid simulink model of doubly fed wind power generator)
- 2011-05-15 15:04:11下载
- 积分：1
-
PocklingtonPulseSolution
PocklingtonPulseSolution calculates the solution to Pocklington s Integral Equation for a straight wire along z-axis.Delta-gap source and Theta-polarized incident plane wave, both types of excitation are optional.
- 2012-10-23 17:06:36下载
- 积分：1
-
5
说明： sinhviendt.info_matlab.zip
- 2011-12-17 05:21:38下载
- 积分：1
-
matlab-gui-example
一些经典的matlab GUI 制作例子，值得一看(some examples of matlab gui)
- 2013-05-05 15:36:04下载
- 积分：1
-
lorenz
this code will run Lorenz attractor. the function file is lorenz.m and the call file is lorenz1.m
- 2012-01-24 13:47:52下载
- 积分：1
-
R_S01
说明： R/S分析，matlab程序，虽然比较繁琐，但还好使，请多多关注(R/S)
- 2009-08-08 10:45:54下载
- 积分：1
-
IEEE14
IEEE14节点系统参数的matlab程序，可以用于计算14节点系统潮流。(IEEE14 node system parameters matlab procedures can be used to calculate the 14-node system trends.)
- 2013-11-15 22:10:38下载
- 积分：1
-
target-tracking-using-kalman
用卡尔曼滤波算法实现的目标跟踪，本MATLAB程序已在MATLAB2010经过成功验证。(Kalman filtering algorithm is used to implement the target tracking, the MATLAB has been MATLAB2010 after successful validation.
)
- 2015-03-12 09:26:45下载
- 积分：1
-
Periodogram
利用周期图法对序列进行功率谱估计，数据窗采用汉明窗(Sequences using periodogram method for power spectrum estimation, the data window with Hamming window)
- 2010-01-10 20:01:34下载
- 积分：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
