Codes

说明：  就是搭建的一个逆变器采用了CPS的控制方式(hvdc is good tool to analyse the function of the work)

Matlab的创始人 C. Moler编写，网上鲜见。 诚乃大家之作，为英文版，内附70多个M文件实例解释，对于编码的品质提高很有好处(Matlab' s founder C. Moler preparation, on-line rare. We shall be sincere is for English, included more than 70 instances of M documents to explain, for improving the quality of coding is very good for)

本程序为蚁群算法在图像分类中的应用的源程序。（图像的大小为30*30）(This procedure for the ant colony algorithm in the Image Classification of the source. (Image size is 30* 30))

Gauss Seidal Load Flow Analysis

Simple model of FSK decoder

信道是多径信道,升余弦滚降 ，取样时间无偏差的信道特性,与波形功率谱,与误码率仿真(Channel is multipath channel or Cosine, sampling time without deviation channel characteristics, and power spectral waveform, with BER simulation)

利用光滑牛顿法求解二次规划子问题，以下为代码(Smooth Newton method using quadratic programming sub-problems, the following code)

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

this explains about the concept of channel and fading related to it and about the ofdm concept.

Applied Numerical Methods Using MATLAB - Yang Cao Chung and Morris