MATLAB70ch6

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源程序。(Feature selection based on rough set.)

采用CP算法求解分形维数(Using CP algorithm to solve fractal dimension)

这个程序是通信系统的信道仿真，完成了某些信道仿真的功能(This program is the communication channel simulation system, complete channel emulation of some functions)

曹梦龙 仿真大实验 实验五 包括所有有用数据(Caomeng Long simulation experiment in Experiment 5, including all useful data)

EMD(earth mover distance)

Intel e752x Memory Controller kernel module.

说明：  Matlab实现的图像配准程序，运用互信息，PSO等进行了优化。 (Matlab to achieve image registration procedures, the use of mutual information, PSO, etc. were optimized.)

It is a three dimensional interpolation with tricubic convolution interpolation,which is the method used in Matlab.But, it is more useful and faster the the code implement by Matlab.

this program describes the extended kalman filter