vc++6.0语言参考手册。介绍vc相关信息

ping 的程序，支持多种设置，包大小，时长-ping procedures, to support a variety of settings, packet size, length of time

这是一个非常基本的http服务器。这个服务器支持一次多重请求。目前，它仅仅支持GET请求。-This is a very basic http server. The server supports a multiple requests. Currently, it only supports GET request.

应用背景电脑上的时间有时会不正确，有时也想知道自己开机多长时间了。那么这个软件可以帮助你实现这一切。更新时间,并显示开机多久的软件，它可以开多个线程去多个时间服务器上查找合适的服务器更新时间,并显示开机多久的软件，它可以开多个线程去多个时间服务器上查找合适的服务器更新时间,并显示开机多久的软件，它可以开多个线程去多个时间服务器上查找合适的服务器关键技术多线程，时间服务器，更新时间，mfc更新时间,并显示它可以开多个线程去多个时间服务器上查找合适的服务器

mars加密算法aes候选分组密码128位输入可变密钥大小

VB6加sqlservr2000的案例教程 比较详细介绍了如何操作数据库的过程 案例较多 值得一看-VB6 increase sqlservr2000 cases more detailed tutorial on how to operate a database of more cases of eye-catcher

B-Tree Filer is a fast library of file-based database routines for Borland Turbo Pascal & Delphi. B-Tree Filer supports stand-alone programs or those running on Microsoft-compatible networks including Novell Netware.-B-Tree Filer is a fast library of file-based database routines for Borland Turbo Pascal Delphi. B-Tree Filer supports stand-alone programs or those running on Microsoft-compatible networks including Novell Netware.

用于简单管道的水击计算，采用的特征线法。可自行修改管道参数。-For a simple pipeline water hammer calculation, using the characteristic line method. Pipeline can modify the parameters.

很久以前从网上找到的咚咚。对于ASP编程者可能有用，一个自动生成目录树的脚本-long time ago from the Internet to find the behind. For ASP programmers may be useful automatically generate a script tree

扩频通信仿真，给出了仿真平台，通过仿真可以了解扩频通信原理-Spread spectrum communication simulation, the simulation platform, the simulation can understand the principle of spread spectrum communication

一凸8 边形P 的顶点顺时针为{v1，v2，… ，v8}，任意两顶点间的线段的权重由矩阵D 给出。 若vi 与vj 是P 上不相邻的两个顶点，则线段vivj 称为P 的一条弦。求P 的一个弦的集合T， 使得T 中所有的弦恰好将P 分割成互不重迭的三角形，且各三角形的权重之和为最小（一 个三角形的权重是其各边的权重之和）。-A convex 8-gon P, vertex clockwise of (v1, v2, ..., v8), any two vertices of the segment between the weight given by the matrix D. If vi and vj is the P is not adjacent to two vertices, then the line segment vivj known as P, a string. Seeking P, a set of strings T, makes the T all the strings just to P divided into non-overlapping triangles, and the weight of each triangle and for the minimum (the weight of a triangle is its weight of each side and) .