bengfie

哈工大matlab讲义 绘图 基础 再加上单独五讲内容(matlab)

high boost filter for frequency domain

说明：  MATLAB的课件，大学上课老师的课件，是ppt形式的，比较全面。(MATLAB courseware, courseware University of class teachers)

Voltage source inverter (VSI) with six-step mode and its induction motor (IM) drive simulation in MATLAB/Simulink environment

图像去噪声，图像中有噪声，可去除噪！！！！！！！！！！(image remove noise )

這是一個 Matlab的（和獨立應用）端口的出色的機器學習算法，隨機森林` - 由Leo布賴曼等。從 R -源由Andy鴻等。 http://cran.r-project.org/web/packages/randomForest/index.html（Fortran的原由Leo布賴曼和Adele卡特勒，研究港口安迪鴻和馬修維納。）當前的代碼版本是基於 4.5-29從來源 randomForest包。(This is a Matlab (and Standalone application) port for the excellent machine learning algorithm `Random Forests - By Leo Breiman et al. from the R-source by Andy Liaw et al. http://cran.r-project.org/web/packages/randomForest/index.html ( Fortran original by Leo Breiman and Adele Cutler, R port by Andy Liaw and Matthew Wiener.) Current code version is based on 4.5-29 from source of randomForest package.)

《MATLAB电机仿真精华50例》一书中的所有matlab源程序(" MATLAB essence of 50 cases of motor simulation," a book of all the matlab source code)

用matlab实现短时能量和过零率的端点检测，并显示波形(using Matlab to achieve short-term energy and zero rate of endpoint detection and waveform display)

小波变换去除基线漂移 小波变换去除基线漂移 小波变换去除基线漂移(Wavelet transform to remove baseline drift removal wavelet transform to remove baseline drift baseline drift)

最小费用最大流算法通用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.)