纯SDK API的方式实现各种控件,值得学习,新手可以下载

利用api直接获取本机的计算机名 和IP地址 在开发中值得一用 -Use api direct access to the local computer name and IP address in the development of worthy one with

简单演示用VC怎样实现“关闭计算机”、“重新启动计算机”、“打开CD-ROM”、“关闭CD-ROM”。 -VC with a simple demonstration of how to achieve shut down your computer , restart your computer , open the CD-ROM , close the CD-ROM .

网络编程 （1）系统用户由三类组成：学生、企业和管理员； （2）管理员负责的主要功能：  招聘信息审核，应聘信息统计；  用户管理（删除和修改）  系统管理（实现注册功能开放和禁止、招聘应聘输入开放和禁止） （3）学生注册账号，通过验证后可以登录。然后可以修改个人信息、修改密码、浏览招聘信息，以及相关企业的信息，并可以发出求职信息和应聘信息。 （4）企业注册账号，通过验证后可以登录，然后可以修改企业信息、修改密码、浏览学生信息、发布招聘信息、接受学生的应聘信息，并发送邮件。 -javaweb

浙江家教网教学系统根据现在流行的教学模式开发成功-The Zhejiang family education network teaching system develops successfully according to the present popular educational model

WIN2000的虚拟内存的原理机制的完全仿真与实现,没有用MFC,完全用WIN32和DDK实现.设计思想非常漂亮.-WIN2000 the principle of virtual memory mechanism simulation and fully realize without using MFC, Win32 and entirely DDK achieve. Design thinking is very beautiful.

基本功能高效的CAN通讯应用.同样,CAN232 不仅适应基本CAN-bus产品,也满足基于高层协议如ModBUS、DeviceNet...之间可选 3. RS232接口,波特率在1200bps -basic functions of CAN efficient communications applications. Similarly, the CAN232 not only meet the basic CAN-bus products, but also to meet for high-level protocols such as ModBUS, DeviceNet ... between three options. RS232 interface, baud rate in 1200

开源呼叫中心语音平台源码，目前支持三汇、东进语音卡-Open source call center voice platform, currently supports three sinks, east Voice Card

用C语言编写的马步图；比较简单，思路是采用把象棋先转换成矩阵，然后再检索图找哈密顿回路-Written in C language with Bu map relatively simple idea is used to convert the first matrix of chess, and then retrieve the map to find the Hamiltonian circuit

Windows Registry Guide：深入了解windows注册表-Windows Registry Guide: in-depth understanding of windows registry

BM 算法是一个较优的模式匹配算法。一般，如果不考虑模式串的长度，一个具有时间复杂度O(n)的算法应该是最优的了，但是事实不是如此。BM算法可以实现更高效率的模式匹配。分析和实验说明，BM匹配算法对于那些字符集比较大，而模式串中出现的字符比较少的时候，工作效率最快。而且，考虑KMP匹配方式的优化，可以结合KMP匹配和BM匹配，进一步提高效率。 -BM algorithm is a better pattern matching algorithm. General, if we do not consider the length of pattern, a time complexity O (n) algorithm should be optimal, but the fact is not the case. BM algorithm can achieve higher efficiency of pattern matching. Analysis and experiments, BM-matching algorithm for those relatively large character set, and the mode string of characters appearing in less time, the efficiency of the fastest. Moreover, consider the KMP matching optimization, you can match the combination of KMP and BM match, and further improve efficiency.