转的一个单纯形源代码，基于C++边的，本人觉得比较不错，大家试试！...

多智能体系统，用的粒子群算法。这个例子是机组组合，适于用多智能体求解电力系统相关问题的朋友们借鉴。

介绍com应用的源代码-introduced com application source code

GDI, MCI, Math, Registry, Windows info, Transparent, Path & Files Function 这些功能类库-GDI, MCI, Math, Registry, Windows info, Transparent, Path Files Function functional Class

一个在windows下的飞彪游戏-one of the windows fly-biao game

vb开发的简单学生成绩查询系统，具备简单的查询，修改，增加，删除等功能。-vb development of student achievement simple query system with a simple query, modify, add, delete functions.

要监视一个进程，如果它停止工作 （无响应），它杀死进程和重新启动它，如果它没有运行它将运行它。有点像一个看门狗

DLL的文件调用，可以在原有的基础上加以修改就可以监测系统的情况！-DLL called the document, the original basis, but the system could monitor the situation!

使用子像素的方法来减轻图像系统的负荷已经是目前主流3D程序中的必用方法。比如知道Sin函数的特性，就只需要计算0~pi/2的点就可以了，剩下的pi/2~pi可以通过子像素来画出，在图形量大的情况下可以减轻至少一半的系统压力。 这个程序不光可以加速Sin函数的显示，还可以加速所有函数的显示。 -The use of sub-pixel image of the ways to reduce the load on the system is already the existing procedures of the mainstream 3D methods will be used. For example, to know the characteristics of Sin function, we only need to calculate 0 ~ pi/2 could be the point, and the rest of pi/2 ~ pi can be sub-pixels to draw, in the graphic case of a large quantity can be reduced at least half of the system pressure. This process not only speed up the Sin function can be shown that all functions can also speed up the display.

给定的字母表A 由26 个小 写英文字母组成A={a,b,…,z}。该字母表产生的升序字符串是指字符串中字母按照从左到 右出现的次序与字母在字母表中出现的次序相同，且每个字符最多出现1 次。例如， a,b,ab,bc,xyz 等字符串都是升序字符串。现在对字母表A 产生的所有长度不超过6 的升序 字符串按照字典序排列并编码如下。 1 2 … 26 27 28 … a b … z ab ac … 对于任意长度不超过6 的升序字符串，迅速计算出它在上述字典中的编码。 -Given the alphabet A by the 26 lowercase letters of the alphabet composed of A = (a, b, ..., z). Generated by the alphabet ascending string refers to the letter string in accordance with the order from left to right appears in the alphabet and letters appearing in the same order, and each character appears a maximum of 1 times. For example, a, b, ab, bc, xyz, etc. are ascending string string. Alphabet A have now all the length of not more than 6 strings of ascending order in accordance with the dictionary and coding sequence is as follows. 1 2 ... 26 27 28 ... ab ... z ab ac ... for any length of not more than 6 strings of ascending quickly calculate it in the dictionary encoding.