涉及：启动总线功能，总线功能结束，字节数据传输…

这款应用可以帮助您计算你的命理数。可以用于更改拼写。基于cheiro的方法。

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

Perl最佳实践英文版。很完整的Perl学习用书。-Perl Best Practices By Damian Conway Pub Date: July 2005 Pages: 542

在vc++环境中，实现一个简单的电子表程序-in vc environment, the realization of a simple electronic watches procedures

hufffmancode的完整实例分析!代码简易!通过min函数 select函数来实现huffmancode的全过程!

ajax+chat聊天室程序，适合新手练习用-ajax+ chat chat room program

web服务安全技术与原理，介绍非常详细！~-web services security technology and theory, introduced in great detail! ~

获取windows用户帐户及密码 包括foxmail、outlook等

此为网络程序设计的课件，可以作为初学者的学习教材！-This is the courseware network programming can be used as study material for beginners!

本源码实现了树这个数据结构。可以直接拿来用-Realize the source of the data structure of the tree. Can be directly used by