该软件实现了粒子滤波和基于Rao-Blackwellised粒子滤波…

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.

仿真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

这是蚁群算法的一个模拟的软件,可以看到整个蚁群觅食的具体过程,对算法的理解很有帮助.-This is the ant colony algorithm, a simulation software, can see the whole ant colony foraging specific process, the understanding of the algorithm very helpful.

《生物信息学》现在模式识别应用的一个重要方向。希望可以给大家有点作用！- Bioinformatics is an important direction of pattern recognition applications. Wish to give you a little Role!

HOPFIELD的一个经典用例，解决TSP问题，代码完整，是我自己编写的哦-HOPFILED cases with a classic, TSP solution, code integrity, I was prepared oh

无约束条件的模拟退火算法 -Unconstrained conditions of simulated annealing algorithm

用最小二乘法计算分形图案的维数。试试看怎么样。请多包涵！！ -least squares method used fractal pattern dimension. Try how kind. I feel apologetic for this! !

本程序用国外流行的NetLogo开发，模拟蚂蚁群寻食-this program popular with foreign NetLogo development, simulation Ant group ants

This code is to estimate the parameter of model of Mixture Gauss which is popular model used in pattern classification . JAVA 写的估计复合高斯模型中的参数 -This code is to estimate the parameter of model of Jian Gauss which is popular model used in pattern classification. Java was estimated composite Gaussian model parameters

纯方位跟踪：目标为匀速直线运动模型，可以迅速收敛。-Bearing_only tracking