ClassicalSnakesAlgorithm

各种聚类方法的比较，突出每一种聚类方法的优点，有助于不同目的者使用(Comparison of various clustering methods, highlighting the advantages of each clustering method can help to use a variety of purposes)

实验： 有两个个矩阵a和b，均为2行3列。 重载运算符“+”， （1）使之能用于矩阵的相加。如c=a+b。 （2）如果参与运算的两个操作数中一个是整数即矩阵+3或3+矩阵形式，进行加法运算也能得出和。 （3）定义自减运算符的前置（i++）和后置（++i）重载编写相应程序并验证它的正确性。 (i think it s a goog for many people)

this program used to acquire data through pc mic with 8khz sampling frequency. it collects data upto 2sec s duration, (can be varied) and reprodued

该实例是基于MATLAB的人脸识别例子，代码有说明注释。其中使用的人脸库为15个人每人11张图片。(This example is a face recognition based on MATLAB examples, the code has explanatory notes. Which uses face database of 15 individuals each 11 pictures.)

一个基于遗传算法与mp的外文文献，讲的很清楚明了，有参考价值(VOICED/UNVOICED SPEECH DISCRIMINATION IN NOISE USING GABORATOMIC DECOMPOSITION)

蕞优分组周游路线问题是一类物流智能调度问题，是众多的计算难度极大的组合爆炸问题之一。自从运输问题最早是由Hitchcock在1941年提出的[2][4]后，人们对这一类问题给予了极大的关注并进行了大量的研究，提出了有效解决问题的优化算法——单纯形法的变形[2]。但由于问题规模的扩大，纯数学方法在允许的时间和空间上都很难找到问题的最优解，于是人们开始转向寻找问题的近似最优解，遗传算法以其在求解最优化问题中的独特的自组织性、自适应性很快进入人们的视野。 经典的遗传算法对于求解多目标的NP完全性问题非常有效，但对于有多个限制条件的多目标最优化问题缺显得有点力不从心，很难得到稳定度较高、收敛较快的解。本文提出的双层遗传算法模型给这一类问题提供了一个很好的解决方法，虽然建模条件限制了描述的问题的通用性，有待推广，但它能有效利用问题的领域知识，提高了求解效率，保证了解的可行性和最优性，算法思想极具推广潜力，可在其它物流智能调度问题求解算法设计中借鉴。(The most optimal packet travel route problem is a kind of intelligent logistic scheduling problem is one of combinatorial calculation difficult problem many. Since the transportation problem was first proposed by Hitchcock in 1941 after the [2][4], the people of this class of problems given great attention and made a lot of research, the deformation of [2] optimization, simplex method algorithm is effective to solve the problem of. But due to the expansion of the scale of the problem, the pure mathematical methods in the allowed time and space are very difficult to find the optimal solution of the problem, so people begin to turn to the approximate optimal solution for the problem, genetic algorithm in solving optimization problems with its unique in the self-organizing, adaptive soon entered people s field of vision. Very effective classical genetic algorithm for solving multi-objective NP complete problems, but for the multi-objective optimization problem with multiple constraints. I)

一种在盲源分离中用到的互信息最大化Ica算法的matlab程序(Mutual information maximization Ica used a blind source separation algorithm matlab program)

Matlab image encryption

LDPC码，译码算法的matlab实现程序。。。。(LDCP code ,the matlab software for LDPC)

利用matlab编程，从现有5种补货策略选取最优的策略，并对策略进一步优化。文件中包含问题的描述及优化过程。(The use of matlab programming, from the existing five kinds of replenishment strategy for selecting the optimal strategy, and strategy was further optimized. File contains a description of the problem and the optimization process.)