原型窗口，可以基于该包开发仿真的windows桌面系统UI。

windows media player ATL com控件例子

C#读XML文件小例子-C# XML document read small example

我在c builder中制作的这个计算器将帮助您进行任何操作。例如like+/-/*。

MSChart使用 里面详细说明了MSChart控件的各种使用方法，属性，事件等等，并且还有例子可参考-MSChart use inside the detailed description of the various use MSChart control methods, properties, events, etc., and there are examples of reference

得到本地机器的主机名，以及ip地址，自己看看吧-Get the local machine host name, as well as ip address, let" s see it themselves

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

操作系统的内存管理模拟，用C++编写，不是可视化界面，但是十分方便实用~-operating system memory management simulation, C preparation, not visual interface, but very convenient and practical ~

32 bit cpu designed and simulated

windows moblie入门大有帮助，大家快下载噢！！ ！！ １-windows moblie

次系统包括项目的流程管理，文档管理，项目测试管理，项目验收等功能，可以运用到实际工作中去-meeting of the system, including workflow management, document management, project management testing, project acceptance, and other functions, can be used in practical work to