This is the VB6 code for DAQ Industrial system, must see.

windows通讯实例，内容比较全，学习通讯编程的好参考-windows communication example

根据机关食堂消费流水生成各种业务统计报表-Water canteen consumption in accordance with authority to generate a variety of business statistics

端口通话，Windows下演示直接I/O端口操作，详细说明见http://www.beyondlogic.org/porttalk/porttalk.htm

爱立信R380s模拟器.-Ericsson R380s simulator.

我所写的一个c++类,可以得到目录,只要复制过去就可以直接运行.-I wrote a category c can be directory, as long as the copies on the past can be directly run.

0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一部分而装满背包。由此得到的价值是 右子树中解的上界。-0-l knapsack problem is selected subset of the problem. Under normal circumstances, 0-1 knapsack problem is NP-hard. 0-1 knapsack problem the solution space available subset of the tree said. Xie 0-1 knapsack problem with the law retroactively loading the retroactive law very similar. The search solution space trees, as long as their son left node is a viable nodes, the search entered its left subtree. When the right subtree is the optimal solution may contain only son into the right tree search. It will cut right subtrees. Suppose that r is the total value of the remaining items; Cp is the current value; Bestp is currently the best value. When cp r bestp, they can cut right subtrees. Calculation right

掌握CDC的文字处理程序的编写，如何产生自定义字体和自定义插入符，熟悉对CString类的使用。通过对卡拉OK程序的编写，讲解定时器的使用和DrawText函数的巧妙运用。讲解如何使用CDC的裁减功能。-grasp of word processing procedures for the preparation, how to customize fonts and custom insert website. CString familiar with the right kind of use. By karaoke program, the timer on the use and DrawText function cleverly use. CDC on how to use the reduction of function.

拓扑排序--- 打印输出计算机本科专业4年每学期的课表-Computer printout of topological sorting------ 4-year undergraduate course per semester Timetable

The Stern-Brocot Number System The Stern-Brocot tree is a beautiful way for constructing the set of all nonnegative fractions m / n where m and n are relatively prime.-The Stern-Brocot tree is a beautiful way for constructing the set of all nonnegative fractions m/n where m and n are relatively prime.

winamp player visual c++ souce code-unusual player visual c souce code