MemoryRun是一个提供了在内存中运行可执行文件功能的单元.用Delphi7编写, 没有用任何内镶汇编....

用递归求出二叉树的深度-derived using recursive depth of the binary tree

这是一个用asp.net编写的实用登陆验证源码，利用它可以很好的检测web登陆用户名等。-Asp. Net with the practical preparation of the landing certification source, it can be a very good landing detection web users, etc..

收集的FTP传输程序，希望能给初学者带来一点帮助！-Collection of FTP transfer process, could bring some help for beginners!

VB的关于物流编程的配送，需要用到SQLserver数据库，有完整的说明，是VB数据库编程中的比较好的例子，物流管理编程人员或仓管编程的好例子。-VB Programming on the logistics of distribution and need to resort to SQL server database, a complete explanation. VB Database Programming is the relatively good example, logistics management program or 420,000 Programming good example.

一个huffman 树的完整算法。用链表实现的c＋＋源程序-Integrity of a huffman tree algorithm. List realize with the c source code

linux下CVS的WEB界面，版本控制软件，linux开发环境-under the CVS Web interface, version control software, Linux Development Environment

操作系统课程设计，关于操作系统经典问题读者写者问题的演示!-courses on operating system design, operating system classic problem of the readers who write the demo!

一个用C做的教师工作量计算软件-a C workload of the teachers do Calculation Software

软件介绍：新天堂单用户相册之巴巴变 v1.0 Alpha新巴变相册系统是一套使用PERL写的单用户相册，使用了稀饭相册系统的模板，有良好的显示效果。它基于巴巴变开放的API接口，所有的图片和数据都存放在巴巴变的服务器上，因而对于你的服务器而言不需要什么的存储空间，也不需要有大的带宽，最大限度的降低了安装和运行成本。免去了换空间时的数据转存的问题,你要做的就是把文件从这台服务器拷贝到另一台服务器，而这一切不过分分钟就解决。-Software Description: The new album of the single-user heaven Bababian v1.0 Alpha Bus Change album System is a single-user to use PERL to write albums, using the template system, rice porridge album, there is a good display. It is based on an open API interface Baba change all the pictures and data are stored in the Baba changing servers, so no need for you in terms of what the server storage space and does not require large bandwidth, the maximum reduced installation and operation costs. Eliminates the need for space maintained by the data transfer problem, you have to do is to copy the file from server to another server, and all this, but for every minute to resolve.

寻最小支配集,用DP,复杂度是2^8 比2^150次方快多了-find the smallest dominating set with the DP, complexity is 2 ^ 2 ^ than eight 150-th power much quicker