语音控制窗口

how to create your own mouse

一个很好的开源的播放器，应该没什么问题的

网络树型控件控制，show network resources only when the user wants to access them-Network Tree Control control, show network resources only when the user wants to access them

文件扫描工具 开发工具vc6 可以实现内核文件扫描-document scanning Tools vc6 can achieve kernel document scanning

ODBC读写Excel表，使用前请安装Excel驱动程序， 请添加#include  #include 到stdafx.h,两个按钮事件和一个listbox控件

Bezier曲线的可执行程序，注：vc语言编写的；3次4个顶点-Bezier curves of the executable program, note: vc languages 3 4 vertex

Wpfword转PDF，很简单的一个小功能，呵呵O(∩_∩)O~ 希望给大家可以分享一下！有点简陋，╭(╯3╰)╮！

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

cuda product of sums algorithm on the gpu

绝对的好资料，大家一定要注意哦！！ 绝对的好资料，大家一定要注意哦-Absolute good information, we must pay attention to Oh! ! Absolute good information, we must pay attention to Oh! ! Absolute good information, we must pay attention to Oh! !