cA-diffusion

this file is project for tsp with pso algoritm

噪声中正弦信号的现代法频谱分析，自己写的matlab程序一份，包括现代法谱估计中AR模型的自相关法，Burg法，协方差法，改进的协方差法四种估计算法(Modern methods of spectrum analysis)

在动态环境中使用Q学习优化算法进行优化，仿真软件为Matlab(Q-learning optimization algorithm is used to optimize in dynamic environment. The simulation software is MATLAB)

5/10/15/20阶的语音信号LPC 预测及其功率谱，并绘制误差函数图像(5/10/15/20 LPC prediction order of the voice signal and the power spectrum, and the mapping of the image error function)

ofdm系统噪声增加部分matlab仿真，希望有用，相互交流(ofdm matlab simulation system noise increase for some, hope useful, exchange)

香农能量算法用于提取心音信号的包络。同时还有一个用来对信号进行训练用的程序，主要是提取信号的特征值，以实现信号的分类识别(Shannon energy algorithm is used to extract the heart sound signal envelope. As well as a training signal is used for the procedure used mainly to extract the value of the signal characteristics in order to achieve signal classification and recognition)

Discrete-Time Kalman Filters5

石墨烯因其出色的电学、力学、热学、光学特性引起了全球研究热潮。作为超材料和变换光学平台，我们有必要计算它的电导率。(Because of Graphene s excellent electrical, mechanical, thermal and optical properties,it caused the global research boom. As the platform of metamaterials and transformation optics , we need to calculate its conductivity.)

基于多种群遗传算法的MATLAB程序，解决无线传感器网络布局优化问题。(Based on multi-population genetic algorithm MATLAB program to solve the problem of wireless sensor network layout.)

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