paomadeng

说明：  Estimating the positions of sensor nodes is a fundamental and crucial problem in ad hoc wireless sensor networks (WSNs). In this paper, an accurate node localization method for WSNs is devised based on the weighted least squares technique with the use of time-of-arrival measurements. Computer simulations are included to evaluate the performance of the proposed approach by comparing with the classical multidimensional scaling method and Cram´ er-Rao lower bound.

这是一个正交交叉的量子行为粒子群算法的matlab程序（MOQPSO）,用户可以根据需求自己更换目标函数(this is an multi-collapse Orthogonal cross quantum-behaved particle swarm optimization program of matlab，the user can revise the Object function for your need.)

增广拉格朗日乘子法，用于解决有损低质矩阵的恢复(The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices)

matlab函数表，对学习matlab很有帮助的东西。(matlab function tables, to learn matlab useful things.)

802.16的信道建模和仿真，在Matlab上的原代码(802.16 channel modeling and simulation in Matlab on the original code)

程序6：遗传算法工具箱使用例子； 程序7：多种群遗传算法的函数优化； 程序8：基于量子遗传算法的函数寻优； 程序9：基于遗传算法的多目标优化算法； 程序10：基于粒子群算法的多目标搜索算法(Program 6: examples of the use of genetic algorithm toolbox Program 7: multi-population genetic algorithm function optimization Program 8: a function based on quantum genetic algorithm optimization Program 9: Based on the genetic algorithm for multi-objective optimization algorithm Program 10: Based on the particle swarm optimization algorithm for multi-objective search)

MATLAB关于图像配准的，包括图像的关键点筛选和配准的效果展示。(MATLAB on image registration, including the image of the key points of the effect of screening and registration display.)

About denoising of ECG signals using matlab

元胞自动机的生命游戏用matlab实现，非常好的一个程序(Coway s Life is a very good program)

说明：  最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 　　Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。 (The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)