MATLABCORD

it helps ı s to get data in paralel

说明：  MATLAB仿真ofdm的经典例子，上边的注解很详细(the example of ofdm)

lwz编码的多个示例程序，用于教学，有大量的注释，方便学生自学。(lwz coding)

模式识别中的K均值算法，对数据进行归类。程序中，使用了二维数据进行分类。通过修改参数，也可以支持三维或是更高维数的分类。(the K-means algorithm for Pattern Recognition )

An Artificial Neural Networks Lab

Take an image window and place it in a squared window such that it s size is maximized without distortion.

unsupervised local discriminative analysis each column is a data

HVDC MMC PSCADE EMTDC

仿真SMI（DMI）算法性能，观察采样快拍数对波束图的影响、接收信号中不包含、包含信号功率逐渐加大对波束图的影响(Simulation SMI (DMI) algorithm performance, the number of snapshots observed sampling effects on the beam diagram, the received signal does not contain, include the gradual increase of the signal power of the beam map)

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