kalman_pu

粒子群算法优化函数求解极值的问题。通过该程序我们可以看到粒子群优化算法的优化过程。(Particle Swarm Optimization for Solving Extremum problems. Through this program we can see that PSO optimization process.)

说明：  说明了遗传算法的原理和优越性，通过程序讲解了遗传算法的实际运用。(Describes the principles and advantages of the genetic algorithm, through the program to explain the practical application of genetic algorithms.)

说明：  浮点数的定义及计算方法，可用于初级学习之用(floap contral)

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).

应用MATLAB基于元胞自动机实现沙堆规则，应用了margoulus仿真(sand pile)

quadrature phase shift keying demodulation technique

16进制转浮点的SIMULINK模型。 希望对大家有用！(16 SIMULINK model of binary floating point turn. Hope to be useful!)

说明：  该源代码是图片切割的详细源代码，是2006年实现的(The source code is a detailed picture cutting the source code, implemented in 2006)

文件给出了运动失真或噪声干扰的图像恢复修复源代码(Documents given movement distortion or noise source image restoration repair)

HYBRID MULTILEVEL CONVERTERHYBRID MULTILEVEL CONVERTERHYBRID MULTILEVEL CONVERTERHYBRID MULTILEVEL CONVERTERHYBRID MULTILEVEL CONVERTERHYBRID MULTILEVEL CONVERTER