matlab

说明：  bpsk仿真中间有两个方面的内容，很好的仿真软件(There are two files in the zip folder. bpsk_spread.m and jakesmodel.m Steps for simulation: 1] Run jakesmodel.m first 2] Then run bpsk_spread.m . 3] Note that during the first run bpsk_spread.m has no rayleigh fading.This is because the corresponding code has been commented 4] The resulting performance is stored in BER_awgn. 5] Now uncomment the Rayleigh Fading code in bpsk_spread.m file. 6] Same time comment BER_awgn (line 112) and uncomment BER_ray variable. 7] Run the simulation. )

对一段振动信号emd分解后，求每个分量的峭度值，选取峭度最大的分量，求其包络谱，能够明显看出特征频率。(After a period of vibration signal emd decomposition, seeking kurtosis value of each component, the largest component of kurtosis, seeking its envelope spectrum, can obviously see that the characteristic frequency.)

南京大学的多类标签KNN分类器，对模式识别十分重要的作用，有着较好的分类效果，可以充分利用类别信息。(Nanjing university class label KNN classifier, the pattern recognition is an important role, has a good classification effect, can make full use of class information.)

matlab在科学计算中的应用的相关课件(matlab in scientific computing application courseware)

matlab环境下的delete函数的用法，以及colormap函数的用法简介(the use of the function delete in matlab)

A 3-Phase ac Induction Motor Control System Based on the MC68HC908MR32

多电平逆变器仿真，不错的matlab仿真模型，适于研究(multilevel inverter)

这个压缩文件主要是一些图像特征提取的实例，具有很强的借鉴意义。(This compressed file is the image feature extraction instance, has a strong reference.)

“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)

大地测量学原理坐标转换程序，能实现大地坐标到平面的互相转换(The geodetic coordinate conversion program principle, can realize the earth coordinate to plane conversion to each other )