bus

说明：  关于组播的客户端代码,实现了简单的组播通信和TCP/IP通信.(On the multicast client code, the realization of a simple multicast communications and TCP/IP communications.)

说明：  2. 该程序可以将随机生成的0，1序列经过卷积编码器产生（4，1，4）卷积码，然后将卷积码经过4*8的删余矩阵，有三种速率（1/3,2/3,1/2）可供选择， 3. 在编码端利用维特比译码方法进行译码 (viterbi)

MFC编程实例，分为上下两份,这是（下） 基础知识，用户界面实例，内部处理实例，打包实例，附录(MFC programming examples, divided into upper and lower two basics of user interface instance, instances of internal processing, packaging instance, Appendix)

listctrl控件，用回调函数进行排序(listctrl controls, using a callback function Ranking)

7级级联H桥逆变器 多电平大功率电力电子 中高压无功补偿 变频器 matlab仿真模型(7 cascaded H-bridge inverter multi-level high-power electronic converter high voltage reactive power compensation)

DEM中提取地形特征的一个新算法，简单实用(DEM to extract topographical features of a new algorithm, simple and practical)

只是一个课堂上做的九九乘法表，可能很多人做过(Just a class to do multiplication table, many people may have done)

北京大学ACM POJ1007题 实现了对字符串按逆序排列(Peking ACM POJ1007 title achieved by reverse order of string)

DDE服务器编写例程，实用DDEML类库实现，简单易用。(DDE server to prepare routines, practical implementation DDEML class, easy to use.)

zoj094 Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. (Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. )