播放wav文件的VB控件

打雷的DELPHI版，在操作上高度模拟WINODWS游戏里的打雷，处理各种事件。-Thunder of the DELPHI version of a high degree of simulation in the operation of the thunder WINODWS game to deal with events.

一个vc下编写socket的小例子-a vc prepared socket small examples

主要完成图像的旋转，平移，和一些常用的变换-The main image rotation, translation, and some commonly used transform

详细解析了C++的原理，并且深入机理结合应用，很值得看一看-good，sorry，my english is poor！

与自然语言理解结合的算盘源码，相信会有用的。-With the combination of natural language understanding source calculations, I believe will be useful.

八皇后问题可以有多种解法，再次通过找寻棋盘上各个棋子之间的斜率来解决-eight Queen"s problems can have multiple solutions, which again find chessboard through various pieces of the slope to solve

配置Visual Studio的颜色应该说，很有必要。合适的颜色配置可以让coding时代码书写的错误降低很多，而且比起默认界面的颜色更加赏心悦目。 本资源内置15种配色方案 方便大家使用！-Configure Visual Studio" s color should be said that it is necessary. The right color scheme can coding mistakes when writing code to reduce a lot, but compared to the default interface is more pleasing colors. The built-in 15 kinds of resources to facilitate you to use color scheme!

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

电梯调度程序,支持电梯与电梯之间的同步与互斥-Elevator scheduler to support the elevator and the elevator synchronization and mutual exclusion between

vs2005开发。 广度搜索求解分油问题。 分油问题：两个小孩去打油，一人带了一个一斤的空瓶，另一个带了一个七两和一个三两的空瓶。原计划各打一斤油，可是由于所带的钱不够，只好合打了一斤油，在回家的路上，二人想平分这一斤油，可是又没有其它工具。现只用这三个瓶子(一斤、七两、三两)精确地分出两个半斤油来。-VS2005 development. Breadth of search for solving the issue of sub-oil. Oil sub-issues: two children to play oil, one with a pound of the empty bottles, and the other with a 72 and a couple of empty bottles. Originally planned to play the catty oil, but because of the money raised, they played together catty oil, in the way home, they would like to share this small amount of oil, but no other tools. Are only three bottles (catty, 72, 32) precisely half a catty of oil is used for the separation of the two.