MS_final

求解一维热方程。空间方向采用四阶差分格式，时间方向采用bvm法(Solving one-dimensional heat equation. Spatial orientation difference scheme with fourth order, the time direction by bvm method)

用于识别目标轨迹的算法，没有解压密码，可以直接使用(trajectory for target identification algorithm, without extracting passwords can be used directly)

在状态转移规则的基础上，局部更新规则和全局更新的蚁群算法的规则，我们提出一个IM证明蚂蚁的最低成本的服务质量蚁群算法（QoS）的路径用于解决网络路由问题与延迟以及背包约束中进行模拟。约52.33％蚂蚁找到成功的QoS路由。并收敛到最佳。(based on the state transition rule，the local updating rule and the global updating rule of ant colony algorithm ，we propose an im proved ant colony algorithm of the least cost quality of service(QoS)unicast routing．The algorithm is used for solving the routing problem with delay．delay jitter．bandwidth，and packet lOSS constrained． In the simulation，about 52．33 ants find the Successful QoS routing ．and converge to the best． It is proved that the algorithm is efficient and effective．)

处理一段语音的卡尔曼滤波，配合以LPC模型求转移矩阵参数(Processing a voice of Kalman filtering, in line with the LPC model parameters seeking transfer matrix)

基于粒子群优化算法的ELM，很稳，自己写的亲测可用(ELM based on particle swarm optimization algorithm)

广义有序统计类恒虚警检测器（GOS-CFAR），包括广义有序平均检测（GOSCA）和广义有序最值检测（GOSGO和GOSSO）(detectors based on the general ordered statistic constant false alarm rate (GOS-CFAR) technique.)

16－QAM基带传输系统的Matlab仿真 实现了主要模块二进制信息源输入，16QAM调制，发射滤波器，接收滤波器，采样，均衡，信号检测，16QAM解调，信息还原输出，产生BER曲线图。(16-QAM base-band transmission system Matlab simulation to achieve the main source of information input module binary, 16QAM modulation, fired filter, receiver filter, sampling, balance, signal detection, 16QAM demodulator, information to restore the output, resulting BER curves.)

自己编写的小波去噪原程序,使用的是轶值降噪的方法，和大家一起学习一下。(I have written the original wavelet denoising procedure, using a method of noise reduction Yi value, and the community together to learn about.)

说明：  根据签名骨架和二值签名，提取了签名图像的笔划宽度直方图。(extracte the stroke width historgram of signature images)

用计算机语言编写图的连通性判断算法，可输入图的邻接矩阵，判断图是否连通以及确定连通分支的个数，掌握Warshell算法或矩阵幂算法的实现方法。(Written in a computer language to determine the connectivity graph algorithms, you can enter the adjacency matrix to determine whether the connectivity map and determining the number of branch connectivity, master implementation Warshell algorithm or matrix power algorithm.)