zTree

ftp服务器编程，采用VC-ftp server programming, using VC

VB 网络传输，方便的网络传输功能，第三放空间(vb)

广播源代码，可做参考-radio source code, reference can do

支持库安装工具源码，轻松安装易语言指出库。( Installation tools support library source code, easy to install and easy language noted library.)

说明：  简单的集合的并与交集运算程序，由c语言编写。(Simple set of procedures with the intersection operator by c language.)

CVI 虚拟仪器设计与应用下的事例代码,网上很少有,上传一些供大家参考(labWindows/CVI exmapel lesson four)

关于数字模型机理研究的几篇重要学位论文，欢迎下载。(Digital model of the mechanism on several critical dissertation research are welcome to download.)

绘制应力场云图，其中还提供了一个解释如何调用程序的文件(plot stress field contour)

本程序为一个LAMP的投票系统，用户能够通过该系统参与在线投票，发起投票，进行投票内容管理等。投票方式支持单选和多选两种，同时，能够进行投票结果的统计，并用图形化方式显示结果。-The LAMP program is a voting system, users can participate in online voting through the system, create polls, vote on content management. Voted to support two kinds of radio and multi-select the same time, be able to vote on the results of the statistics and graphically display the results with.

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. )