-
mli0000
MLI vectorielle Simple
- 2012-11-11 04:33:15下载
- 积分：1
-
zhuangtaizhuanyi
传递函数转换为状态方程的通用程序，编程环境为matlab(Transfer function into the general program for the equation of state)
- 2012-06-09 10:20:27下载
- 积分：1
-
chaos-time-series-prediction
混沌时间序列多步自适应预测方法，非常有用，采用自适应算法，比局部算法要准确(chaos time series prediction)
- 2013-12-15 19:49:46下载
- 积分：1
-
HFJH
摄影测量实习：重要章节，学好摄影测量必备(The photogrammetry Practice: important chapter to learn photogrammetry essential)
- 2012-10-28 18:05:36下载
- 积分：1
-
openGL
分别用普通构建方式和显示列表对物体进行绘制，实现各种复杂的交互控制(Were built with ordinary ways and display a list of objects to draw, to achieve a variety of complex interactive control)
- 2014-02-17 20:00:17下载
- 积分：1
-
signal_reconstruction
数字图像处理中的经典问题之一——图像重构的matlab程序。(Digital image processing in one of the classic- the matlab image reconstruction process.)
- 2010-06-28 16:39:45下载
- 积分：1
-
MATLAB-Programing
说明： 该资源是MATLAB程序设计，对MATLAB初学者入门MATLAB程序设计有很大的帮助，通过该课件能够基本使用MATLAB进行简单的编程(The resources are the MATLAB programming, Introduction to MATLAB on the MATLAB programming beginners have a lot of help, through the basic use of MATLAB software can be a simple programming)
- 2009-08-14 10:08:11下载
- 积分：1
-
SALEH
功率放大器的线性化技术研究的无记忆SALEH模型(mummemory SALEH model
)
- 2012-03-30 18:22:49下载
- 积分：1
-
pmsys
Phase Modulation matlab code
- 2014-09-04 11:05:40下载
- 积分：1
-
Matlab_zuixiaofeiyong
最小费用最大流算法通用Matlab函数
基于Floyd最短路算法的Ford和Fulkerson迭加算法 基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条 自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流 量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新 确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)
- 2012-07-27 14:55:22下载
- 积分：1
