VB程序员开发指南，从入门到精通，请用华康阅读器打开

我自己搜集的关于swt的电子书，pdf格式，虽然是英文，但是写的非常好-my own research on swt of e-books, pdf format, although English, but writing is very good

download this java book. it helps to understand java and other information also.-download this java book. it helps to understand java and other information also.

2009年协作通信顶级巨作《Cooperative communication and networking》cambridge-《Cooperative communication and networking》cambridge

介绍PPT的基础知识如用途，常用名词解释，启动，退出等技巧（转载的），大家可以参考下-PPT introduced the basic knowledge such as the use, common terminology, start with skills (reproduced), we can refer to the next

VFP电子书籍,很全面的.-VFP electronic books, is very comprehensive.

背包问题动态规划算法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.

C++Builder函数查询器-C Builder function for inquiries

The Art of Assembly Language (Chapter1-Chapter10)

数据通讯与网络教程是进行网络编程和数据通信人员的一本圣经，共分为十部分，这是第八部分，尤其对准备从事网络编程、数据通信编程的工程人员具有指导意义。-data communication and network Guide is network programming and data communications staff of a Bible, is divided into 10 parts, This is the eighth part, in particular the right to engage in network programming, data communications programming staff is instructive.

优化问题中的直接搜索法，相比其他方法，有不需要梯度就可以的算-Optimization problem in the direct search method, compared with other methods, the gradient can have no need for the operator