dadi2zhijiao (3)

模拟退火算法，模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。(Simulated annealing algorithm, simulated annealing algorithm derived from the principle of solid annealing, heating the solid to the full high, let it slowly cooling, heating, the solid particles with the internal temperature rise to disorder symptoms, which can be increased, and slowly gradually cooling particles in an orderly manner, at each temperature to reach equilibrium, and finally at room temperature reaches the ground state, which can be reduced to a minimum.)

matlab电机仿真50例，电机仿真必备教材，你值得拥有。(matlab simulation of 50 cases of motor, motor simulation necessary materials, you deserve to have.)

GMSK系统在MATLAB下的仿真，包括G函数的实现，仿真眼图，积分路径等(GMSK implementation in the MATLAB environment)

本人收集的关于遗传算法方面的matlab程序，量很大，一定有您想要的东西(genetic algorithm collenction)

DC MOTOR SPEED CONTROL mcc

前馈ANC系统的模型，但是，不详细，可以参考！(the model of two earphone active noise control)

Independent Component Analysis Play a Role in Unmixing Hyperspectral Data(This paper studies the impact of hyperspectral source statistical dependence on ICA and IFA performances)

用混合粒子群算法求解TSP问题，自带GUI界面，共有９中算法，可解决各种TSP问题，效果不错。(Using hybrid particle swarm algorithm to solve TSP problems, bring their own GUI interface, a total of 9 in the algorithm, to resolve the various TSP problems, good results.)

“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)

说明：  A algorithm for gray image binarization