一个很不错的介绍JAVA的解释语言的电子书

gui 编程手册。qt图形编程，嵌入式开发-gui programming manual. graphical programming qt

基于ZigBee技术的无线个人网络实时健康监控的文章，有一定的实用价值。-ZigBee-based wireless personal network technology, real-time health monitoring of the article, there are certain practical value.

医院无线局域网设计方案 医院无线局域网设计方案-Hospital wireless LAN design Hospital wireless LAN design

包含DSP Builder reference manual与DSP Builder advanced blockset reference manual2个文件-DSP Builder reference manual included with the DSP Builder advanced blockset reference manual2 files

留言板代码-there are some gustbook code source exempale dddddddddddddddddddddddddddddddddddddddddddddd

动画窗口的实现方法~！~1-animation window method ~! ~ 1

gnu make 的中文用户手册，适用gcc编译器-gnu make the Chinese user manual applies to gcc compiler

asp.net与webservice实例剖析-asp.net examples of analysis and webservice

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

eBook Nonparametric and Semiparametric Models