这本电子书是讲述关于c++编译器原理方面的书籍原著作也是出自国外非常好噢...

FAT文件系统完整性规范。详细记录每一个细节。

MapX培训资料,ppt格式，学习后可以迅速掌握MapX的使用。-MapX training materials, ppt format, after learning can be quickly mastered the use MapX.

MFC程序员的WTL指南+程序+示例。希望对初学者有用。-WTL for MFC Programmers Guide+ Procedures+ Sample. Hope useful for beginners.

本书是我所看过的写的最好的剖析MFC源码的书，这本书其实出版的比台湾侯俊杰的《深入浅出MFC》要早，可现在网上把侯俊杰的那本书都炒作的上天了(其实侯俊杰的书写的并不怎么样,看完本书后你会同意我的说法)。 两者相比，李进久老师的这本《MFC深入浅出》除了文字更加的通俗易懂(没有台湾人那么多的废话,真搞不懂台湾人总是无故的自大是为什么!)，所分析的东西更多，而且价格也只要二十几元，真的是不知道哪里可以买到，否则我一定会买一本的。-This book is what I have seen written in MFC source code analysis of the best books, in fact, this book published in Taiwan侯俊杰than the

VC下ATL开发的书

背包问题动态规划算法JAVA 给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

JAVA程序员必读，这是一本适合java初学者看的书，希望大家支持-JAVA programmers must-read, this is a suitable java book for beginners to see I hope you will support

《MATLAB时尚百例实例》实例1-13

非线性光学原理 上(沈元壤)：同学赠送的、很难找的非线性光学书籍，-On nonlinear optics (Shen Yuan soil): Students donated, it is difficult to find books on nonlinear optics,

自主移动机器人导论英文版 自主移动机器人导论英文版-Introduction to Autonomous Mobile Robots