3DCUT

包含了MATLAB编写的关于自适应算法的MATLAB程序，运行正确(Includes adaptive algorithms written in MATLAB on the MATLAB program, run right)

基于星座图的QPSK仿真，易于理解QPSK的原理(QPSK constellation based on simulation, and easy to understand the principles of QPSK)

异步电动机的矢量控制仿真，用simulink做的，里面还有一个讲解用的PPT。(Induction motor vector control simulation, simulink do, there is also a narrator with the PPT.)

单件模块，包括单件类和单件宏，使用单件宏能够从一个类(orgClassName)派生出一个单件类(newClassName)，并保持基类的功能。 (Single module, including a single category and single-hong, the use of a single category from a macro (orgClassName) derived from a single category (newClassName), and maintain the functions of base class.)

这是我们的课程作业，有自适应DBF和LCMV的DBF(This is our course work, there are adaptive for DBF DBF and LCMV)

线性系统作业，系统辨识，运用极点配置，LQR，H∞设计状态反馈控制器(Linear system operation, system identification, using pole placement, LQR, H ∞ state feedback controller design)

使用小波包变换分析信号的MATLAB程序(The use of wavelet packet transform analysis of signals in MATLAB program)

MATLAB与VB的集成在电力系统潮流计算中的应用

This is matlab simulink svpwm model just copy and paste it in work and simulate.this is powerful modulation technique to reduce harmonics.the THD compared to other modulation techniques is also low .This technique includes analysis of sectors and determination of reference voltage vector and also angle calculation finally it is fed to two-level inverter

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