DS18B20 and MCU interface process, contains the initialization and read

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

获得主机硬件信息-access mainframe hardware information

利用三次样条插值法求曲线在某个点处的函数值-Using cubic spline interpolation method demand curve at some point of the function values

在屏幕上用控制台库在控制台模式下

Windows下的TC，很不错的，欢迎大家使用，-Windows TC, very good and you are welcome to use,

游戏脚本npcsay编辑器，使用于骑士游戏脚本编辑，功能齐全！-Npcsay game script editor, use the Script Editor in the Cavalier games, full-featured!

本人不才,当初还不知道OPENH323的时候,用DX写的一个关于网络电话的东东.也许VC开发时间长一些的朋友,有可能都已经见过了,呵呵.希望对大家有用-I Incompetent, when OPENH323 do not know when DX was made using a telephone network on the Eastern. VC development time, perhaps longer friends. might have seen, Ha ha. We hope that the right useful

FlappyBird C++实现源代码本项目仅限VS2012或更高版本编译。非VS2012需要自行重新编译fancy2d。本源码仅作学习交流之用，源代码可以任意引用，对于其中潜在的BUG本人概不负责。游戏中资源来自原版安卓游戏，若需使用请联系原作者。===== 项目文件夹 =====fancy2d      f2d底层图形库FlappyBird   游戏源代码by CHU 2014/2/16

利用c语言编写程序，程序的功能是：创建一个链表-Create a List

由浅入深的Wince源码.rar 适合新手学习的 WinCE 源码，共 13 章-Progressive approach to the Wince source. Rar suitable for novice to learn WinCE source code, a total of 13 chapters