that the procedure was an integral version of the PSO procedures. The procedure...

神经网络模式识别及其实现，第四章。 内含：ALOPEX和BACKPROP程序。-pattern recognition and neural network to achieve, the fourth chapter. Intron : ALOPEX BACKPROP and procedures.

扩展的Infomax算法，具有比较快的收敛速度！而且程序非常简洁,明了-expansion of Infomax algorithm, with a faster rate of convergence! The procedure is very simple, straightforward

本文采用红外光电传感器技术, 建立了一个基于神经网络的客流计数系统, 与传 统的仅利用光电传感器计数方法相比, 该方法提高了实时客流计数准确率。为了更好的分 类识别计数, 针对采集的连续的时空序列客流数据特点, 改进了已有的分割方法和针对客 流实际情况的特征提取方法。最后经过稀疏和密集客流模拟仿真测试, 结果表明, 本文所 提出的模型能够识别多人并排的情况, 误差率较低, 具有理论和实际意义。-RBF

c语言版基本粒子群算法源程序-c-language version of elementary particles algorithm source code

模式识别中关于C均值的聚类算法的程序,输入点进行聚类.-pattern recognition on the C-means clustering algorithm procedures input cluster.

这个程序对快速实现模糊逻辑控制很有用。假设这个逻辑控制有两个输入和一个输出，用各种选择来实现它。-This procedure is the rapid realization of the usefulness of fuzzy logic control. Assuming that there are two logic control inputs and one output, with various options to achieve it.

用MATLAB编写的支持向量机，实现了线性可分与线性不可分的情况，还有非线性支持向量机，里面部分常用的核函数。-Prepared using MATLAB support vector machine, to achieve a linearly separable and linear indivisible, it is still non-linear support vector machine, which part of the kernel function used.

遗传算法和神经网络的结合应用，通过Visual C++环境来实现该功能，使计算能力更强-Genetic algorithms and neural networks combination of applications, through the Visual C++ environment to achieve this feature, so that more computing power

一个神经网络原型代码，针对的例子为《Perceptron Learning》 (Russell & Norvig， 第742页)-A neural network prototype code, for example for

用遗传算法求解背包问题是南京航空航天大学信息与计算科学专业编写的.本程序利用遗传算法来求解背包问题.采用二进制字符串编码,1表示选择物体,0则不选择. 背包问题描述:在M件物品取出若干件放在空间为W的背包里，每件物品的重量为W1，W・2……Wn，与之相对应的价值为P1,P2……Pn。求出获得最大价值的方案。注意：在本题中，所有的重量值均为整数。-genetic algorithm knapsack problem is the Nanjing University of Aeronautics and Astronautics, Information and Computing Science prepared. The procedure the use of genetic algorithms to solve knapsack problem. binary string encoding, an option objects, 0 no choice. Knapsack Problem Description : M items removed several pieces on the space-W backpack, Each of the weight W1, W 2 ... Wn, the corresponding value of P1, P2 ... Pn. Sought to gain maximum value of the program. NOTE : In this issue, all the weight values are integers.