Can be obtained from the camera video and image data, and saved to the computer.

资源描述非IE浏览器插件框架SDK， 支持chrome, firefox, mac浏览器。 SDK为C语言编写， 方便移植修改， 内含windows工程项目， 方便使用。简单易用， 快速开发属于自己的浏览器音视频等插件。

DirectX 源代码:MoviePlay-source code of DirectX:MoviePlay

这是一个报表控件包，For Borland Delphi Versions 3,4,5,6.100% 源码.-This is a statement of control packets, For Borland Delphi Versions 3,4,5,6.100% source.

调试说明，各种调试结果 介绍的很详细很好哦-DDS debugging shows that the results presented in a variety of debugging detail Oh well

dissecting MFC 2e part.pdf

一个简单的五子棋程序-a simple procedure Gobang

经典的指针应用编程(作者是C语言的开发者Kernighan和Ritch)-classic indicators Application Programming (The writer is a C language developers Kernighan and Ritch)

一个利用Listctrl控件做在程序.我自己在程序也是在此基础上经过简单修改而成的-Listctrl use of a control procedure done. I also own procedures on the basis of a simple The revisions

卫星干扰源定位方面的算法程序，包括三星及四星定位-Algorithm process of satellite interference location , including three-star and the four-star position

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