JavaScript语言参考手册，程序员可以方便地访问

arm嵌入式软件系统开发，高效的C,C++编程-arm embedded software systems development, efficient C, C++ Programming

图像的边缘检测，图像处理爱好者下载看看，还可以。-image edge detection, image processing lovers download see also.

Java - Borland JBuilder - Developing Database Applications-Java- Borland JBuilder- Developing Database Applications

此文章为vb的条码编程详细介绍及具体的编程实例-This article for barcode vb programming details and specific examples of programming

南航的DSP课件与周建江老师《TMS320C54X DSP结构、原理及应用》.rar-China Southern

编写优美代码的名著，获得了jot大奖的，很精彩-Write beautiful code famous obtained jot winning, it is wonderful

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

德塞特

经典教材cprimer习题集的答案，可供参考。-Exercise Set cprimer classic textbook answer to this question, for reference.

JSP网络应用教程2003 18-JSP Network Application Guide 2003 18