-
chapitre5V6
commande vectorielle de la machine asynchrone
- 2010-01-01 03:30:43下载
- 积分:1
-
Optimal-Control-of-postgraduate
最优控制内容,关于找到最优解的问题:主要是对极小值原理、动态规划、线性二次型的应用。(Find the optimal solution for the problem,about minimum principle, dynamic programming, linear quadratic applications)
- 2014-01-04 10:06:52下载
- 积分:1
-
zhicha
本人对载波同步方面深有研究,这是研究生期间做的用插值算法实现载波估计算法,算法性能很好,接近MCRB。(I have a deep respect for carrier synchronization study, which is done during graduate interpolation algorithm used carrier estimation algorithm, algorithm performance is very good, close to MCRB.)
- 2014-06-14 11:37:43下载
- 积分:1
-
m12062
Using serial port with Matlab GUI.
- 2012-05-09 04:02:44下载
- 积分:1
-
采用8PSK调制,用因子图进行均衡,系统无编码,加性高斯白噪声FGfig4jin
采用8PSK调制,用因子图进行均衡,系统无编码,加性高斯白噪声(Using 8PSK modulation, equalization of factor graph, the system without coding, additive white Gaussian noise)
- 2020-07-05 13:28:59下载
- 积分:1
-
FourSeriesairfoil
naca翼型坐标生成程序(Matlab)(naca airfoil coordinates generating program (Matlab))
- 2009-11-26 19:06:15下载
- 积分:1
-
FuzzyClusteringAnalysis
模糊聚类分析的实现算法 部分为matlab源码(Fuzzy Cluster Analysis algorithm matlab source part)
- 2008-05-10 09:39:35下载
- 积分:1
-
triangle
是平面三角形单元分析的Matlab源码,是我自己编写的,运行成功,希望对大家有所帮助。(Is a plane triangular element analysis Matlab source code is written in my own running success, we want to help.)
- 2010-12-04 10:25:45下载
- 积分:1
-
Matlab
包含了matlab编程基本教程及多个编程实验内容(Contains the experimental content of the basic matlab programming tutorial and multiple programming
)
- 2012-04-13 11:32:44下载
- 积分:1
-
Matlab_zuixiaoerchengfa
最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路:把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
- 2012-07-27 14:54:17下载
- 积分:1