shuangkui002

一个相当不错的matlab_GUI界面用于绘制复杂图形(Matlab_GUI a fairly good interface for rendering complex graphics)

产生轨迹，可以产生直线轨迹，直线加速轨迹，转弯轨迹，得到的物体真实运动的轨迹，并且显示出来。(Have a track, you can have a straight-line trajectory, a straight-line speed up the track, turning the track has been real movement of the object trajectory, and displayed.)

Satellite Communication System application and Problem solving

OFDM系统仿真，信号采用卷积编码和交织技术、采用16-QAM和QPSK两种调制方式，干扰分别采用多径衰落和瑞利衰落两种。(OFDM system simulation, signal the use of convolutional coding and intertwined technology, using 16-QAM and QPSK modulation in two ways, interference were used to multipath fading and Rayleigh fading two.)

用MATLAB编程，进行二维图像的哈夫变换直线检测(Using MATLAB programming for two-dimensional image of the Hough transform line detection)

CDMA 仿真程序 将txt改回m即可使用 主要是链路级的方针程序(CDMA simulation program will txt back to m is to use the principle of link-level procedures)

Analysis Skin Color by PCA and Relations in YCbCr Color Space

说明：  matlab实例精讲，适用于新手上路，非常全面(matlab examples Jingjiang, suitable for beginners on the road, very comprehensive)

说明：  小推力航天器转移轨道程序，包括matlab源码和说明文档(Small thrust spacecraft transfer orbit procedures, including source and documentation matlab)

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