AS3Cookbook Flex AS3.0 参考电子图书

中科院图像识别的代码，有关图像识别的基础知识，大家新手认真学习啊-Chinese Academy of Sciences of the code image recognition, the image recognition of the basic knowledge, everyone novice to seriously study ah

形状上下文是形状区域的良好特征，用于解决形状匹配问题。所得结果对描述器的设计具有重要意义

实现飞机飞行的模拟，利用空气动力学原理实现飞机飞行时，空气流的模拟。-Of aircraft flight simulation, the use of aerodynamics to achieve flight, air flow simulation.

一个实现远程关机和发消息等功能的小程序，开发环境VC-a remote shutdown functions and distributed small procedures, the development of environmental VC

一个用于生成文本文件的小程序，很浅显的C++程序-Text file used to generate a small program, it is simple C++ Procedures

读写Excel文件- Read-write Excel document

tu xing

C#语言 邮件 C#语言编写的自动发送邮件程序-C# Language C# language, e-mail automatically sent the e-mail program

first in first out technique.

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