comunication

matlab编程实例，合适初学者学习，参考，编程，仿真，很有价值的(matlab programming examples, suitable for beginners to learn, reference, programming, simulation, great value)

matlab的很多图像处理的实用程序，如图像区域处理、图像颜色处置等.(matlab image processing a lot of utilities, such as image region processing, image color disposal.)

finite element using matlab

相参脉冲串，学习雷达有帮助，参数可自行设置，很方便。(Coherent pulse train, to learn radar help, the parameters can be set easily.)

数字基带系统的仿真，包含信号源的产生和眼图，已经仿真调试通过。(Simulation of digital baseband system, and the eye diagram contains the signal source, has been debugging through.)

这是一篇介绍matlab函数使用手册的文章，通过它可以快速查找函数的功能等。(This is a matlab function to introduce the use of manual article, which can quickly find the function function.)

basics of matlab in ppt

《精通MATLAB与C/C++混合程序设计》刘维第二版( Proficient in MATLAB and C/C++ mixed programming design second edition of Liu Wei)

传统的kmeans聚类算法不能保证时间序列聚类结果的时序性；基于warp-kmeans聚类算法可以有效处理时间序列的聚类问题，而且复杂度低，迭代次数少。 ，输出有目标函数在每次迭代后的值，聚类中心以及聚类区间。内有测试数据和相关文献，点击 test.m 可以完美运行(The traditional kmeans clustering algorithm can not guarantee the time series of the time series clustering results. The warp-kmeans clustering algorithm can effectively deal with the clustering problem of time series, and the complexity is low, and the number of iterations is less. The output has the value of the target function after each iteration, the clustering center and the clustering interval. There are test data and related documents, click test.m can be perfect operation.)

“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)