Vc++.net技术内幕，内容介绍的比较全面，而且通俗易懂

第二版介绍WDM模型的英文原版书，对于进行usb驱动编程有相当大的作用-WDM model to introduce the second edition of the original book in English is fundamental to the usb driver programming there is a substantial role

Qbasic 教程 -Qbasic Guide

Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book -Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book Javacc book

OReilly Asterisk The Future of Telephony

vc下利用gpu实现火焰的实时模拟！ -vc using GPU to achieve real-time simulation of the flame!

课程设计自己编写的一个进程调度演示程序，界面很好，但是只有就绪和执行的调度，没有做等待状态的调度，毕竟时间太短-design their own curriculum prepared by the process of scheduling a demo program, a good interface, but only in place and implementation of the scheduling, do not wait for the activation state, after all, the time is too short

如何快速有效实现Sock5代理，请大家阅读并评论，期待大家的共同参与-how quickly and efficiently achieve Sock5 agents, please read and comment on, we expect the participants.

这个文档听不错的。大家可以 好好学习 一下

0_1背包问题,回溯法解背包问题 0-l背包问题是子集选取问题。一般情况下，0-1背包问题是NP难题。0-1背包 问题的解空间可用子集树表示。解0-1背包问题的回溯法与装载问题的回溯法十分类 似。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入其左子树。当 右子树有可能包含最优解时才进入右子树搜索。否则将右子树剪去。设r是当前剩余 物品价值总和；cp是当前价值；bestp是当前最优价值。当cp+r≤bestp时，可剪去右 子树。计算右子树中解的上界的更好方法是将剩余物品依其单位重量价值排序，然后 依次装入物品，直至装不下时，再装入该物品的一

难得一见的好书呀，本人才开始研究的-a rare books see it, the people started to study the