这是有关2进制数的算法

ofdm rayleigh channerl-ofdm rayleigh channerl

可实验0.5KHZ到10KHZ的简单测频,并由数码管显示出来!-Experimental 0.5KHZ can be simple to 10KHz frequency measurement by digital tube display!

windows main class function 实例3-windows main class function Example 3

键盘和鼠标操作宏记录器-operated keyboard and mouse macro recorder

介绍在VC框架中，如何加入CanBus的实现方法，程序中用简单的红灯演示程序，展示了添加的过程。-introduced in VC framework, how to join the realization Canbus methods, and procedures used simple red demo program, and it demonstrated the added process.

GDI水波效果(DELPHI源码)GDI水波效果(DELPHI源码)GDI水波效果(DELPHI源码)

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

ZIP压缩源码，原来少了一些库的也找到，大家可以放心下载-ZIP compression source, less the original library also find, we can be assured that download

可以同时实现高精度阶乘、乘方、排列组合运算，非常实用！-can also achieve high precision factorial, involution, permutations and combinations Operational very practical!

很好的java版记事本喔！是我课程设计的一部分！供大家学习，交流！-A good java version of Notepad Oh! Part of the design of my course! For everyone to learn to share!