SVM的一个源程序，功能很强大，实现的结构很巧妙

用visual basic语言开发的进行RSA加密的代码，无限位.-using visual basic language for the development of the RSA encryption code, unlimited spaces.

模式识别以及重要问题，很好的内容，千万不要错过-Pattern recognition, as well as important issues, very good content, do not miss

这是bs球队的仿真2D比赛程序，其中的智能算法和强化学习算法值得借鉴。-This is bs tournament team 2D simulation procedure, in which intelligent algorithms and reinforcement learning algorithm is worth learning from.

由 Visual C++ 编译过，可以求解任何个数城市的tsp问题，只要输入城市坐标即可。-By Visual C++ Compiled, you can to solve any number of cities tsp, so long as you enter the city coordinates.

条码技术-barcode technology

9。《遗传算法原理及应用》，周明，孙树栋编着 国防工业出版社 1999年第一版 本书全面系统的介绍了遗传算法的基本原理、数学基础、各种主要实现技术，并给出了一些应用实例，同时还简单的介绍了进化计算的基本内容。本书具有系统性强、可读性强、可操作性强的特点。本书可供智能计算、自动控制、系统工程、优化计算、经济管理、运筹学、计算机等专业的研究人员、研究生、高年级大学生参考。 -9. "Genetic Algorithm Theory and Application", Zhou, Sun Shudong compile defense industry publisher in 1999 the first book version of the comprehensive and systematic introduction to the genetic algorithm to the basic principles mathematical basis, the major techniques, and gives some examples, also introduced a simple evolutionary computation of the basic elements. The book is systemic strong, readable, and it can be operational characteristics. The book smart, automatic control, systems engineering, optimization, economic management, and operations. computer and other professional researchers, graduate students and students of high-grade reference.

一种基本的模式识别方法，进行了部分改进，简单实用，采用matlab仿真，经编译后无误。供大家学习参考-A basic pattern recognition methods, partially improved, simple and practical, the use of matlab simulation, as compiled correctly. Reference for everyone to learn

针对现有遗传算法在多维非线性优选方面的不足，本文提出了一种基于小生境进化算法（NEA）的非线性优选模型，探讨了NEA算法的参数选择原则。通过大量仿真和比较，表明算法在复杂非线性优选中具有快速、高效、鲁棒性强的特点，并能在全局范围内有效搜索所有最优解。 -against existing genetic algorithms in three-dimensional nonlinear optimization for the shortage, the paper presents a niche evolutionary algorithm (NEA) nonlinear optimization model, the NEA on the parameters chosen algorithm principle. Through simulation and large, the algorithm shown in a complex nonlinear optimization is fast, efficient, robust features of the strong, and the global scope effective search all the optimal solution.

cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.

用人工神经网络实现格林码的编码，通过对网络的训练实现，输入一串0/1码得到其格林码-using artificial neural networks Green codes, the network through training, input string of 0/1 yards code to be its Green