chapter2

“基于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.)

无线传感器网络里的定位经典dvhop算法实现(Wireless sensor networks where the positioning of dvhop Algorithm)

用两种方法对图像进行增强，并且对比增强后的效果。(image inhance)

前推潮流算法，非常使用，方便新人学习，常用的潮流计算算法(forward flow algorithm, very used to facilitate new learning, commonly used power flow calculation algorithm)

it may be worth to see here is a matlab example code

data set for clustering

Beginning Example for matlab simulink

CDMA系统仿真，包括CDMA基本原理及cdma2000通信系统仿真。(cdma system simulation, include princple of cdma and cdma 2000 system simulation)

simulation of electromagnetic by 1d FDTD

语音发音动作，画唇和舌头的正面侧面图的matlab程序。(draw the picture of lip and tongue.)