DLL

说明：  根据域名获得IP地址列表 根据域名获得IP地址列表(under the name list of IP addresses under the domain of IP address list)

单片机控制。关于按轨迹行驶的自动小车案例。(Single chip microcomputer control)

使用R-tree和分支限界方法解决N维NN问题，带报告。带数据生成器和R-TREE模板。(The use of R-tree and branch and bound method to solve N-dimensional NN problem with the report. With the data generator and R-TREE template.)

open source of aducity, (aducity of open source.)

这是一个简单的socket编程例子，非常适合刚接触socket编程者。程序简单、可用、易于理解。是个很好的socket范例。(A simple socket programming examples. Suitable for beginners. Program is simple, available, easy to understand. Is a good example of socket programming.)

应用于windows 平台下的vc编程，主要是windows socket 下的网络编程(windows socket programming, including basic knowledge of the single-threaded, multi-threaded. Development and application in the windows platform)

MFC获取网页的utf-8中文源码 适用于VS2013 可以查看源码,同样适用于VS2008(i Can t speak english...)

The manuscript describes performance comparison of nearest-neighbor interpolation and bilinear to reduce the complexity of decoder WZVC.

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

串口转以太网通信的例子,有需要的可以参考参考,vc6写的.(Examples of serial to Ethernet communications, we need to refer to reference, vc6 written.)