RGB_Extractor

dsb调制与解调的MATLAB的M文件实现(dsb modulation and demodulation realize MATLAB M-files)

无线传感器网络加权质心自定位算法中加权质心算法仿真(Centroid algorithm simulation in wsn)

matlab的仿真模拟书中的源码，大部分较为基础，可以当做参考(matlab simulation source code in the book, most of the foundation, can be used as reference)

快速解耦法5节点网络的潮流计算程序,结果运行正确无误(Fast decoupled method 5 node network power flow calculation program)

************内存结构五大区***************(*********** Five regions of memory structure)

算法的研究基于matlab模糊神经网络的预测算法-嘉陵江水质评价(A fuzzy neural network prediction algorithm )

A brief code to calculate the state variable feedback controller gain and the observer gain

徕卡1200数据传输很好用的格式文件，供大家参考使用 (Excellent Leica 1200 data transmission format used for your reference to use)

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).

扩展卡尔曼的代码,非常有用的，希望多多下载(Extended Kalman code, very useful, and I hope a lot of download)