神经网络的源代码，关于字符识别的一些东西-Neural network source code, something about character recognition

模式识别分类程序，贝叶斯，神经网络分类训练程序，很不错啊-the classification procedures, Bayesian neural network classifier training procedures, and it is very responds :

蚂蚁社区的源代码，用C++开发，很直观的演示-ant communities of source code, development using C, a very visual demonstration

人工神经网络技术在智能分布式检索系统中应用- The artificial nerve network technology applies in the intelligent distributional retrieval system

很好的分类程序。。。。C++语言编写。。。VC开发环境-good classification procedure. . . . C language. . . VC development environment.

开发owl的API,提供了W3C规定标准接口,是目前比较少的API.-development owl API provides a standard interface W3C, is the relatively small API.

本人调试的大作业（源程序模型+论文），主要包括PID控制、模糊控制、神经网络控制、遗传算法优化神经网络控制（使用了遗传工具箱GAOT）对同一系统所作的仿真比较，并加入饱和、死区、时滞等非线性后的响应，具体的分析比较过程论文中写的很详细。-I debug a big operation (source model+ Thesis), including PID control, fuzzy control, neural network control, genetic algorithm optimization of neural network control (using a genetic toolbox GAOT) on the same system simulation by the comparison, and to join saturation, dead zones, such as nonlinear time-delay after the response, the specific analysis of the comparison process paper written in great detail.

10。《用于最优化的计算智能》，Nirwan Ansali，Edwin Hou着，李军，边肇棋译 清华大学出版社 1999年第一版 本书从讨论组合优化中的基本问题――NP问题入手，系统地讲述了近年来所发展起来的智能最优化的各种技术和方法，其中包括启发式搜索、Hopfield神经网络、模拟退火和随机机、均场退火以及遗传算法等；并在此基础上，通过一些典型的应用问题，如旅行商问题、模式识别中的点模式匹配问题、通信和任务调度等问题进一步阐明以上一些基本方法怎样用来解决这些原来具有NP性质的困难问题。本书是作者在美国新泽西州理工学院多年讲授有关课程的基础上写成的。全书深入浅出，理论联系实际。为帮助学生掌握基本概念，提高学习能动性，各章编写了习题。本书可作为通信、计算机、控制各专业的高年级学生和研究生学习有关课程的教材。它对于广大科研工作者也是一本很有实际价值的参考书。 -10. "Optimal for Computational Intelligence," Nirwan Ansali, with Edwin Hou, Li Jun, Pin Zhaoxing chess translation Tsinghua University Press in 1999 the first book version of combinatorial optimization from the discussion of basic questions-- NP problem start, the system described in recent years to develop the intelligent optimization of the technology and methods, These include heuristic search, Hopfield networks, simulated annealing and random machine, mean field annealing and genetic algorithms; and on this basis and through some typical applications, such as the traveling salesman probl

首先采用某种编码方式将解空间映射到编码空间，每个编码对应问题的一个解，称为染色体或个体。一般通过随机方法确定起始的一群个体，称为种群，在种群中根据适应值或某种竞争机制选择个体，使用各种遗传操作算子产生下一代如此进化下去，直到满足期望的终止条件。-begin using some form of coding mapping to the solution space coding space, each encoding a corresponding solution to the problem, known as chromosome or individual. General randomly determined by the initial group of individuals, called stocks, the stocks based on fitness or some mechanism to choose the individual competition, the use of genetic Operator evolution of the next generation so on, until the termination meet expectations conditions.

网上一直没有Harris算法的VC程序 无奈 自己写一个吧 用了两个小时就写好了 非常简陋 大家凑合着看 2005年11月15日-Harris algorithm VC procedures helpless himself wrote it with a two hour written a very simple you can make do with a November 15, 2005