非常好的JAVA书籍

java2参考大全第四版-java2 fourth reference Daquan

code for ks0108 use for reference

H323协议培训材料，希望对H323的初学者更带来一点帮助-training materials, H323 hope to bring more beginners 1:00! !

USB2.0 protocol file, doc and pdf file useful file to develope USB product. should download and view if develope USB1.1 or USB2.0

2006单片机研讨会，关于51单片机的论文集-2006 51 doc

C++编程思想,为从事或学习C++的有关人员提供了一个很好的辅助资料，值得学习！-C++ programming ideas for those engaged in or learning about C++ provides a good supporting information, it is worth learning!

基于FPGA的电子钟，实验利用cyclone-clock

virginia tech EE内部DATABASE 的一篇关于MIMO-OFDM的论文，写的很不错，评分是A+-virginia tech EE internal DATABASE an MIMO-OFDM on the papers, written in a very good score is A+

这是Adobe公司发布的PhotoShop 6.0 SDK开发包，可对PS进行二次开发。其中也含有大量关于PS的内部资料，很有参考价值。（-This is the Adobe company released PhotoShop 6.0 SDK development kit can be carried out on the secondary development of PS. Which also contains a lot of internal information on the PS, could very well refer. (

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