基于粒子滤波原理，选取纹理特征对目标进行描述，实现视频目标的跟踪。

用c++ 开发的中国象棋，其中有网络版和单机版 ，但由于水平有下限，单机版做得很差，电脑智商较低，党调整到很难实几分钟 电脑才能走一步。其中参考了Pc gameing这本书，这本书讲得真好。-with the development of the Chinese chess, which is the network version and the single version, but a lower level. has done a poor job of a single computer, computer lower IQ, and the party to be very difficult to adjust a few minutes a computer can go one step further. With reference to the Pc gameing this book, this book put a shot.

使用遗传算法求解通信网链路容量和流量联合优化分配问题!-Communications network using genetic algorithm for solving the joint optimization of link capacity and flow allocation problem!

FAST apriori.cpp 基于数组和为运算的apriori算法实现,采用为运算来测试子集的存在性，把测试子集存在性的复杂度由O(n^2)降低为O(n)-FAST apriori.cpp array-based computing and for the apriori algorithm, adopted as the operator to test the existence of a subset to test the existence of a subset of the complexity from O (n ^ 2) reduced to O (n)

指纹识别程序，大家看看吧，也许有用，不用客气-fingerprint identification procedures, we look at it, perhaps useful, not polite

用vc写的，同时有用bp算法和用rbf神经网络进行训练和识别的程序，可以看到两种不同方法得到的结果-vc used to write, while useful bp algorithm and the use of rbf neural network training and identification procedures, we can see the two different methods to obtain the result

文件中包含某老师关于人工神经网络控制系统的PPT，较详细的介绍了人工神经网络及应用于控制的相关内容。-File contains a teacher on the artificial neural network control system of PPT, a more detailed introduction to the artificial neural network and applied to the control of relevant content.

SPEA2源码，效果相当好 ZIZTLER系列复杂函数只有第三个效果不太好-SPEA2 source, the effect ZIZTLER very good series of complex functions, only the third effect is not a good

仿真1：首先把网络温度参数T固定在100，按工作规则共进行1000次状态更新,把这1000次状态转移中网络中的各个状态出现的次数Si（i＝1，2，…，16）记录下来 按下式计算各个状态出现的实际频率： Pi=Si/∑i=1,NSi=Si/M 同时按照Bo1tzmann分布计算网络各个状态出现概率的理论值： Q（Ei）=（1/Z）exp（-Ei/T） 仿真2：实施降温方案，重新计算 采用快速降温方案：T（t）= T0/（1+t） T从1000降到0.01，按工作规则更新网络状态 当T=0.01时结束降温，再让T保持在0.01进行1000次状态转移，比较两种概率-a simulation : First of all network parameters temperature T fixed at 100 and, according to the rules for a total of 1000 to update the state, this state of the 1000 network transfer of all states for the number of Si (i = 1, 2, ..., 16) all recorded determined by the formula state-of the actual frequency : Pi = Si/i = 1, NSi = Si/M in accordance with Bo1tzmann distributed computing network of states all probability the theoretical value : Q (Ei) = (1/Z) exp (- Ei/T) Simulation 2 : implementation of cooling, re-using rapid cooling programs : T (t) = T0/(1 t) T dropped to 0.01 from 1000 and, according to the rules updated network state when T = 0.01 at the end of cooling, let T at 0.01 for the 1000 state tran

用蚁群算法求解TSP（旅行商）问题，按照TSP.m中要求的格式输入程序参数即可运行！-Using Ant Colony Algorithm for TSP (traveling salesman) problems, in accordance with the format requested TSP.m input process parameters to run!

这是一个聚类代码，里面有分类数据，有MAKEFILE，可以实现模式的分类中-This is a clustering source code which contains classfication data and MAKEFILE.It can be used in classifying pattens.