Final-Project--Codeareport1

用matlab进行图像处理 对车牌号码进行识别 非常具有实用价值(Matlab image processing used to identify the plate number of very practical value)

此文章为基于在线聚类的雷达辐射源分类，它发展了新算法来在线更新分类。内附详细流程图，及功能介绍。可供用matlab做聚类和在线更新的所有人参考。(This article is based on online clustering of Radar Emitter classification, it has developed a new algorithm to update the classification of online. Containing a detailed flow chart, and functions of introduction. Available for use matlab to do clustering and online update of all reference.)

Avi Manipulation Program

Adaptive Electric Vehicle Charging Coordination on Distribution Network

matlab纠错码编译原理之程序1 做实验时免去了手工输入的繁琐 和避免出错(matlab compiler theory of error-correcting code program 1)

QPSK在多径衰落和加性高斯白噪声下的性能仿真，对于通信方面比较有用！(QPSK simulation with Gray coding and simple Rayleigh multipath fading channel and AWGN added)

以实际所测随机中子脉冲数据的自相关函数为研究对象，借助仿真实验，开展Elman神经网络对不同浓度核材料进行识别的研究。在实测数据的基础上，通过叠加随机噪声，模拟产生了不同浓度核材料的相关函数样本用于神经网络的训练与测试，实验结果表明，(Calculating the stochastic neutron pulse autocorrelation function with the actually measured data as the research object, we carry out different simulate experiments in concentration identification of varied nuclear materials using Elman neural network. Superimposing random noise on the measured data, we get correlation function samples simulating the different concentrations of nuclear material for training and testing the neural network.)

说明：  对地震计录进行fk滤波，适用于初学者，可以下载学习(fk filter,FK filtering for seismometer recording is suitable for beginners and can be downloaded for learning)

基于拉格朗日插值法的可变分数延时滤波器比较图，通过比较不同的分数时延时的滤波器特性来观察分数延时滤波器的性质与限制(Lagrange interpolation method based on variable fractional delay filter comparison chart, filter characteristics by comparing the scores of different delay time to observe nature and limitations of fractional delay filter)

提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。 (Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)