monitoring program is the use of the underlying drive to achieve, and can monito...

电子学英语词汇，比较好的词汇书，希望有所帮助-E-learning English vocabulary, a better vocabulary and hopes help

一些简单的JAVA源码，供大家分享，大家互相学习-some simple Java source code for all to share, we learn from each other

两个子对话框之间实现数据访问，子对话框与主对话框之间数据访问-two- dialog between data access, and the son of the dialog between the main dialog Data Access

Prim algorithm to find shortest path in graph

把任意的EXE嵌入到自己程序中的演示-put arbitrary EXE embedded into its own procedures for the demonstration

代码有一个函数 ，实现截屏功能。然后得到一个bmp格式的文件-Code has a function, the realization of the functional screen.

资源描述在线考试系统的使用今天，在线考试系统，已成为一个快速增长检查方法，因为它的速度和准确性。它也需要更少人力执行考试。几乎所有的组织都是现在，通过在线考试系统进行考试的客观考试，它节省了学生考试时间。组织也可以轻松地检查学生在考试中的表现。作为一个结果这，组织释放的结果，在更短的时间。它也有助于通过节约纸张的环境。根据今天的要求， ； 在PHP在线考试项目；非常有用的学习它。

支持邮寄/回复/编辑信息，可设置个人信息、个人论坛、用户和匿名邮件、讨论主题等，通过提交或其它的特殊的顺序排队用户，可定义管理，排队等功能，具有很高的可配置性，能够完全定制出相当个性化的论坛.-Support the post/reply/edit information, personal information can be set, personal forum, users and anonymous e-mail to discuss the theme and so on, by submitting or other order of the special queue users, definable management features such as queuing, are highly configurable , and can be completely customized personalized considerable forums.

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

下棋类小游戏，通过源程序的编译实现对弈。可以在任一环境下运行！-chess-like game, the compiler source code to achieve a chessboard. In an environment where the operation!