1、设置自己计算机的开、关机时间 2、控制自己计算机的工作时间 3、记录违规使用计算机人员的使用的次数...

Delphi资源文件生成工具 我经常要在程序中加入许多资源，比如：声音、位图、光标等，这样可以使自己 软件更具特色。可以自己建立一个.RC的文件，然后再用DelphiBinBrcc32.EXE来 编译生成一个.RES的文件，有了这个文件才能把资源编译到软件中去。 可是如果要加入一大批资源，要加入30个位图和20个光标的话，就要在.RC文件中一 行行加入要用的资源，比较麻烦。我是个懒人，所以自已写了这个能自动批量帮你完 成这个任务的工具，可以非常方便的生成.RES资源文件。 注意：由于Borland的Brcc32.EXE不能识别包含有空格和汉字的路径，所以你的资源来 源路径和保存路径不要带有空格和汉字，否则不能建立.RES的文件。-Delphi resources to generate tool I often join in the proceedings of many resources, for example : voice, bitmaps, cursors, etc., can make more software features. One can establish their own. RC paper, and then spend the Delphi bin Brcc32.EXE to build a generation. RES document, the document can have the resources to build software. But if a large number of resources to join, to join the 30-bit map and the cursor 20, then we should. RC paper lines to join with the resources, and trouble. I was lazy, so own writing this volume will automatically help you complete this task tool, it is easy generation. RES resource files. Note : Due to Borland"s Brcc32.EXE not include

此程式为利用opencv产生色彩模型(gamut)-this program for the use of opencv produce color model (roadmap)

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

银行家算法的各种实现，里面包括源代码和报告-A variety of banker" s algorithm implementation, which includes source code and reports

在 c + + 的泛型堆栈的 implementatioon 堆栈被定义作为泛型堆栈和它可以做为 int 或 double 类型的需求

新的DELPHI学习LUA的代码,在学习LUA的朋友可以-The new DELPHI learning LUA code, in learning LUA" s friends can see

VFP的经典案例，方便实用，很多学生找不到好的案例，这个既小又实用-Classic case of VFP, convenient and practical, many students could not find a good case, this small and practical

VC下调用IE扩展类-VC called IE extension of the class

C++ 写成的用视窗winsock2 api做成的 样品程序-C++ socket using windows api and winsock

模仿msn的局域网聊天工具，有服务器端，可以实现事务提醒功能-An chat tool in LAN simulating MSN. This tool has sever version and have affair informing ability