PID_Control_DC_Motor

MATLAB经典GUI源程序,适合初学者入门学习(MATLAB classic GUI source code, suitable for beginners learning portal)

说明：  MATLAB在中值滤波改进算法中的应用,这里有一个关于自适应中值滤波的简单程序。(MATLAB in the median filter to improve the algorithm, there is an adaptive median filter on a simple procedure.)

计算机视觉领域中的lbp特征提取的matlab代码(the matlab code of the lbp feature extraction in the computer vision domain)

Human - The Science Behind What Makes Us Unique. FMRI(Human- The Science Behind What Makes Us Unique. FMRI)

here is the matlab code for sixty four qam modulation

对信号进行EEMD分解，消除模式混叠，并对本征模函数进行FFT变换，求出幅度谱(EEMD decomposition of the signal eliminate Mode aliasing, FFT transform and intrinsic mode functions obtained amplitude spectrum )

This paper helps in Blind Identification and Equalization of MIMO FIR Channels Based on Subspace Decomposition and Independent Component Analysis

说明：  基于matlab的概率网络模拟，源码均是matlab的.m文件，实现了一些有用的算法。(Based on the probability of network simulation matlab, matlab source are the. M file, to achieve some useful algorithms.)

数字通信系统仿真，包括整个系统各个模块，十分详细(The digital communication system simulation, including the whole system.A module, very detailed)

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