IMM_csdn

对GPRmax的数据进行成图的一些matlab程序(Some data on GPRmax programs into graphs)

主成分分析用于进行煮成分析的程序高效有序简单快捷没有bug(zhuchengfen)

分数阶傅里叶变换 Matlab仿真实现 单分量的LFM信号的检测和参数估计(Fractional Fourier Transform Matlab simulation to achieve a single-component LFM signal detection and parameter estimation)

calculates the fibonacci serial of a number

用盲源分离的方法处理脑电信号!!!!!!!!!!!!!!!!!!!!!!!!!(Blind source separation method using EEG signal processing)

好东西，虽然不是很难，但是这样可以节省不少时间，可以把精力投入到难度较大的改进以及应用上了，而不用在大家都会的基本程序上花挺多时间(Good things, though not difficult, but it saves a lot of time can focus into the more difficult to improve as well as the application, and not everyone will be in the basic procedures for the time spent挺多)

implimentation de l histograme et l equalization sous matlab

自适应反步控制一类vanderpol-duffing机电耦合混沌系统，(AdaptiveBacksteppingControlofaNonlinearElectromechanicalSystemwithUnknownParameters)

说明：  《精通Matlab与C/C++混合程序设计》（ 第二章） 刘维编著("proficient Matlab and C/C mixed Program Design" (Chapter II) Liu compilation)

最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.(Minimum cost maximum flow algorithm general Matlab functions The basic idea of ​ ​ the shortest path algorithm of Ford and Fulkerson superposition algorithm based on Floyd: the cost of unit flow on the arc as a certain length of Floyd and the shortest path method to determine the one percent self-V1 to the Vn the most short-circuit and then the this Article is the most short-circuit as a can be the expansion Lu, to use solving the method of the the the problem of the maximum flow will its on the stream the amount of increased to the maximum possible values while the the the the flow of of this Article of the shortest on the road increase, the costs of the unit of flow on each arc sure, so many iterations, the final minimum cost maximum flow.)