书上的代码大全，一个完整的PDF版本，软件开发者不可或缺的太…

JPEG 2000 FINAL COMMITTEE DRAFT VERSION 1.0, 16 MARCH 2000

Basis for CSharp programming.

JFIF标准文档-JFIF standard documents

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

讲解MFC，从入门到精通的课件，很好，不妨学习一下。-On the MFC, from entry to master the courseware, well, you may wish to study.

详细的介绍了risc技术，是不可多得的入门读物-detailed account of the RISC technology, is a rare primer

软件工程――――实训医院患者监护管理系统0层图-Soft-care management system for public hospital patients 0 layer diagram

calculator with assembly avrs51

MPEG-2 AAC算法的定点化、查表法的应用以及所采用的C程序和汇编应用等内容。-MPEG-2 AAC algorithm for fixed-point, and look-up table method used by the applications, as well as the C program and compile the contents of the application.

OpenSceneGraph基本渲染理论 任何一个人，只要他需要在计算机中组织他所要渲染的场景，而这些场景在现实中又是非常复杂的，他首先要面临的是效率问题，故明思议：需要在计算机中合理组织，高效显示的用户，关心场景图。-OpenSceneGraph rendering the basic theory of any one person, as long as he needs the computer to organize his rendering of the scene, and these scenes are in reality very complex, he must first face the problem of efficiency, so you Ming: the need for computer rational organization, and efficient display of the user, concerned about the scene graph.