详细的介绍了匈牙利命名法，利于我们的代码规范

用C++编写的遗传算法，涵盖较多内容，有文档-prepared by the genetic algorithm, covering more content, documents

蚁群遗传算法的实现，VC++源代码！蚁 群遗传算法的实现，VC++源代码！蚁群遗传算法的实现，VC++源代码！-Ant Colony Genetic Algorithm, VC++ Source code! Ant Colony Genetic Algorithm, VC++ Source code! Ant Colony Genetic Algorithm, VC++ Source code!

这个是用来进行基频检测的，目前做的最好的应该数Paul的基频提取算法了，误差可以小于万分之五。该源代码的算法是我根据Paul的算法修改得到，省略了插值部分，所以误差在百分之五以内，但是在实际工作中已经足够了。-is for the frequency of detection, so the best should be the number of frequency Paul extraction algorithm, can be less than prior error. The source code for the algorithm is based on the algorithm Paul to be amended, omitted the interpolation part, the error within 5%, but the actual work has been sufficient.

一种新型径向基神经网络，里面有具体的程序，希望对大家有用-A novel RBF neural network, which has the specific procedure, in the hope that useful to everybody

支持向量机(5)libSVM-Support vector machines (5) libsvm

灰度变换的实例程序，其中的CDib类可以直接应用于其他的图像处理程序。-gray transform examples procedures, which the CDib categories can be directly applied to other image processing.

本人编写的incremental 随机神经元网络算法，该算法最大的特点是可以保证approximation特性，而且速度快效果不错，可以作为学术上的比较和分析。目前只适合benchmark的regression问题。 具体效果可参考 G.-B. Huang, L. Chen and C.-K. Siew, “Universal Approximation Using Incremental Constructive Feedforward Networks with Random Hidden Nodes”, IEEE Transactions on Neural Networks, vol. 17, no. 4, pp. 879-892, 2006. -I prepared by incremental random neural network algorithm, which is characterized by the largest approximation properties can be guaranteed, and fast good results can be used as an academic comparison and analysis. The current benchmark is only suitable for the regression problem. Specific effects may refer G.-B. Huang, L. Chen and C.-K. Siew,

针对TSP问题，使用蚂蚁演算法求最佳解！程式还满美观唷！-against TSP, the use of the ant algorithm for the optimal solution! Program was one of appearance Police!

这个程序是人工智能里字句归结的一个程序，它采用了线性归结策略和删除策略相结合的方法-the procedure is artificial intelligence Lane words attributed to the procedure, which uses the linear sum strategies and strategy to delete a combination of methods

PSOt为PSO的工具箱，该工具箱将PSO算法的核心部分封装起来，提供给用户的为算法的可调参数，用户只需要定义好自己需要优化的函数(计算最小值或者最大值)，并设置好函数自变量的取值范围、每步迭代允许的最大变化量(称为最大速度，Max_V)等，即可自行优化。