-
pso_more
说明： 将标准微粒群算法进行改进，从而解决标准PSO算法的容易陷入局部最优解的情况。(The standard particle swarm algorithm is improved so as to solve the standard PSO algorithm is easy to fall into local optimal solution of the situation.)
- 2011-04-05 17:27:47下载
- 积分：1
-
overvoltage
电系统过电压仿真程序，基于matlab和vc的混合编程，matlab动态仿真(Over-voltage power system simulation program, based on matlab and vc mixed programming, matlab dynamic simulation)
- 2008-03-16 01:52:16下载
- 积分：1
-
QPSKAWGN
无线通信，信号通过qpsk调制，在高斯白噪声环境下的传输(Wireless communications, signal modulation by qpsk, white Gaussian noise environment in the transmission)
- 2010-09-14 14:57:50下载
- 积分：1
-
MATLAB-7.0User-Guide1
Matlab的编程指南,常用的Matlab入门教程,比较详细非常好用的哈!(Matlab programming guide, commonly used Matlab Tutorial, detail very easy to use Ha!)
- 2012-02-15 09:53:52下载
- 积分：1
-
biot
用于多孔介质中波的传播，分析波的传播速度随入射角的变化，消除频散的特性(wave propogation in porous media)
- 2014-06-18 11:59:07下载
- 积分：1
-
ComputerPVisionP-PLindaPShapiro(1)
Using a progressive intuitive/mathematical approach, this introduction to computer vision provides necessary theory and examples for practitioners who work in fields where significant information must be extracted automatically from images-- including those interested in multimedia, art and design, geographic information systems, and image databases, in addition to the traditional areas of automation, image science, medical imaging, remote sensing and computer cartography. The book provides a basic (Computer Vision- Linda Shapiro.pdf)
- 2014-09-24 15:58:04下载
- 积分：1
-
FIR_CS
滤波器的程序，是属于数字滤波器的，非常好好(Filter procedure, belongs to the digital filter, very good)
- 2014-09-16 15:13:53下载
- 积分：1
-
Recursive_integer_division
递归法求解整数划分。
整数划分，是指把一个正整数n写成如下形式：
n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分：1
-
Necessary-60-matlab-code
~~~~~~~为初级学者使用的遗传算法~~~~~~~~~~~~(Genetic Algorithms for Primary learner)
- 2012-04-29 15:19:46下载
- 积分：1
-
chamfermatching
Description of the file: template matching source of Chamfer matching algorithm. It s OpenCV implementation
- 2013-11-25 23:42:19下载
- 积分：1
