-
ExtendedMie
Extended Mie Scatting Computatian By Matlab Code.密散射数值计算的Matlab代码，(Extended Mie Scatting Computatian By Matlab Code.)
- 2009-11-24 00:00:00下载
- 积分：1
-
bian-cheng
m、W序列的产生及仿真，扩频复合系统的源程序(m and W sequence generation and simulation, source of spread spectrum composite systems)
- 2012-05-09 10:21:53下载
- 积分：1
-
61946495power_HEV_powertrain
混合动力汽车建模与仿真模型，详细建立了混合动力汽车里面的模型，可以参考一下!(Hybrid Vehicle Modeling and Simulation Model)
- 2020-10-05 21:27:38下载
- 积分：1
-
mat3
learning matlab software for simulation
- 2010-07-29 14:43:06下载
- 积分：1
-
Wishart_distribution
an elaborate discription of the wisahrt distrbution
- 2010-10-22 03:37:10下载
- 积分：1
-
water
水纹干涉图样. 可以自由设置两个波源的位置,振幅以及频率.形成水纹干涉图样并动画展示.(Waterlines interference pattern. the two wave source location, amplitude and frequency can be set freely . )
- 2013-10-13 10:33:50下载
- 积分：1
-
Nonlinear-Finite-Elements
Nonlinear Finite Elements for Continua and Structures英文原版第二版和代码，介绍非线性有限元的基本方法，以及非线性有限元的前沿研究(Nonlinear Finite Elements for Continua and Structures original English version and the second code, the basic nonlinear finite element method described, as well as cutting-edge research in nonlinear finite element)
- 2020-10-08 21:27:36下载
- 积分：1
-
zhixin
基于Matlab的RSSI质心定位算法源码(Centroid localization algorithm source code based on Matlab RSSI)
- 2021-04-15 09:08:54下载
- 积分：1
-
sag
Sags in energy industry
- 2014-02-04 19:52:17下载
- 积分：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
