aspnet学习相关的一些例子

模拟3D城市的VB小游戏，大家可以参考一下，学习学习！-Simulation of 3D city VB game, we can look, learn!

制作个性化界面以及实现制作多国语言切换-create personalized interface and the achievement of producing a language switch

包含分配DOS存储段,改变数据段空间分配,分配主存储器,从远堆中释放一块 ,重新分配主存, 改变数据段空间位置-include DOS memory allocation, data change of space allocation, distribution main memory, far from the rubble release of a redistribution of the main deposit, change of the spatial data, etc.

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

专门编写PLUGIN的控件-specialized preparation of Control PLUGIN

支持便携式网络图形格式的参考库-support the Portable Network Graphics format reference library

python rmi codes,just give u a example to use RMI in python.

在Linux下，xwininfo可以抓取Linux运行窗口界面的信息，但windows系统没有。为此原创此工具用来抓取windows运行窗口信息。 此代码为ahk语言代码，使用ahk2exe工具可以编译为exe文件

sqlite数据库的源代码，用于设计小型数据库-Source code of sqlite database, which is used for designing minitype database.

模拟二进制机器计算的示例程序，已经将二进制串封装好-simulate binary calculation