-
gngauss
matlab编程:主要是对gngauss函数定义介绍(matlab Program:Mainly for gngauss function definitions introduced)
- 2010-05-27 14:12:03下载
- 积分:1
-
getfolpd
可以用多种算法拟和系统模型,用来求取系统的一阶模型.(many algorithms can be used to model and system, the system used to strike a band model.)
- 2006-11-02 19:57:24下载
- 积分:1
-
carriermodulation
This is used for carrier modulation
- 2014-02-08 18:42:40下载
- 积分:1
-
watermark
基于小波变换的数字水印算法matlab代码,含有各种攻击的效果对比,对做毕设的同学应该有帮助。(Digital Watermarking Based on Wavelet Transform algorithm matlab code, containing a variety of attacks on the effect of contrast on the Bi-based students should do help.)
- 2010-01-16 15:35:56下载
- 积分:1
-
MBinPSO
Modified binary PSO
PSO with mutation tools of genetic method combined
- 2014-11-17 08:22:20下载
- 积分:1
-
peizhun
实现图像的配准 并画MI曲线,直接运行 很好用(2D image registration it is very helpful for us)
- 2010-10-13 14:47:33下载
- 积分:1
-
TrafficFlow
数值模拟交通流模型Payne-weber压缩流体,可以看到许多交通现象 (numerical simulation model of traffic flow Payne-Weber's law compressed fluid, we can see that many transport phenomena)
- 2007-06-01 22:47:55下载
- 积分:1
-
Desktop
This project gives the design of control system and
speaker recognition code using matlab. Matlab’s straightforward
programming interface makes it an ideal tool for speech analysis
projects. For the current project, experience was gained in
general matlab programming and the design of control system. A
basic speaker recognition algorithm has been written to sort
through a rule base in matlab and choose the one most likely
match based on the pre define time frame of the speech
utterance.
- 2013-03-05 22:34:22下载
- 积分: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
-
matlabxiti2
matlab要求编写函数,并画出图的matlab习题,供大家参考(prepared Matlab functions, and draws a plan of Matlab Exercise, for your reference! !)
- 2006-05-28 13:22:13下载
- 积分:1