这个源代码扫描一个unicode漏洞,但是可以很容易地继续添加扫描漏洞。...

经更改后的CUM 代码 来自天津 第3部分-CUM after the modified code from Tianjin Part 3

它是基于java的学生信息系统，非常有用

实例03-网络聊天室客户端-03-network chat room client

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

水准计算程序，输入高差，程序自动平差，并计算闭合差-Standard computer program, enter the height difference, the program auto-adjustment, and calculate the difference closure

Marvell WIFI CF8381P labtool.zip

windows下创建process的程序-windows process created under the procedures

Arcengine 属性表Join attribute table -Arcengine Attribute Table Join attribute table

网络电话netphone的源代码供即时通讯爱好者学习-Netphone telephone network source code

Automated subject classification of textual Web documents