汇编语言大作业，实现的学生信息管理系统，实现多种功能

一个关于扫雷的原代码-a mine on the original code

有关ENVI软件中的波段运算，通过IDL实现功能-About bandmath in ENVI

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

一个界面整洁的五子棋，很实用，建议大家下载试试看-wuziqi

下面给出的小程序程序用TC2.0编写。变化时边缘细胞不参与变化。随着迭代次数的不同，在屏幕显示的图案精彩纷呈，象万花筒般引人入胜-Below is a small program procedures used to prepare WITH TC 2.0. Changes in marginal cells do not change. With the number of iterations different, the screen shows the logo brilliant, as attractive as Kaleidoscope

精密计时器多媒体制作半透明效果计时器源，Borland C Builder 6

很有用的网络客户端与服务端接口，在实验中比较使用-very using

此程序通过多次调试 已经被证实可以调试通过 只要大家下载完后根据自己的硬件电路改写I/P口就是-This procedure has been proven through multiple debugger to debug through as long as we can download the exhausted according to their own hardware circuit rewritten I/P port is

一个用VC实现的简单的代理服务器源码,用SOCKET实现.-With VC realize a simple proxy server source code, using SOCKET realize.

黑白道小游戏，源代码，大家互相学习一下。-Black and White Road, a small game, source code, we learn from each other about.