-
123456
haar小波分解与重构 用matlab实现的(haar )
- 2010-06-22 08:24:30下载
- 积分：1
-
active_contour_usage
主动轮廓模型（蛇模型）及应用MATLAB源码，(Active Contour Model (Snake Model) and application of MATLAB source,)
- 2008-01-11 15:06:13下载
- 积分：1
-
ztwdjs
计算暂态稳定问题，应用隐式梯形算法，算出各时刻发电机角度(Calculation of transient stability problem, apply the implicit trapezoidal method
)
- 2010-12-29 17:04:29下载
- 积分：1
-
Dijkstra
说明： 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。
Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。
(The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)
- 2008-11-26 22:27:45下载
- 积分：1
-
AN995
MPLAB IDE 7 MCC18 SPI Library
- 2011-05-06 05:45:02下载
- 积分：1
-
chaoliujisuan
潮流计算程序，初始值使用高斯赛德尔法迭代所得，具有很高的精度和求解效率。(Flow calculation procedures, the initial value of iteration proceeds using high Sisaideer method with high accuracy and solution efficiency.)
- 2012-05-09 10:50:02下载
- 积分：1
-
AverageInterpolation
It interpol the averager .......very usefull if you know how to use it, it will help you alot
- 2013-02-02 18:32:30下载
- 积分：1
-
Fresnel
fresnel衍射传播函数，可以计算光波衍射过程(fresnel diffraction spread function can be calculated light wave diffraction process)
- 2015-01-12 19:03:03下载
- 积分：1
-
d_014_dyn_l10
14 bus power flow analysis with fault using psat
- 2013-05-10 18:11:10下载
- 积分：1
-
fusion
说明： 配电网规划必须满足辐射性和连通性，配电网扩展规划问题随机产生的初始群体中往往存在大量不可行解，采用根节点融合法可确保方案的可行性。(Distribution network planning must meet radiation and connectivity, distribution network expansion planning problem with randomly generated initial population there is often a large number of infeasible solutions, use of root fusion method to ensure feasibility.)
- 2010-05-04 09:37:43下载
- 积分：1
