UC/OS电子书籍，笔记及其源代码注释，包括程序的流程图,

致精永恒团队 高质量C++编程笔试题.doc-To fine quality permanent team C++ Programming document questions. Doc

在.net环境下,怎样开发javascript的学习资料-In. Net environment, how to develop the learning materials javascript

支持向量机 张鑫.ppt，比较容易懂，属于入门级的-SVM Zhang Xin. Ppt, it was relatively easy to understand, is the entry-level

信息检索高级课题，一本介绍信息检索研究课题的很好的教材，好不容易才找到的，值得-Advanced information retrieval issues, a description is a good information retrieval research materials are not easy to find, and worth a look

本资料是一本详细的二级C考试资料千万不要错过哦！-This information is a detailed examination of the two C information should not miss Oh!

背包问题动态规划算法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++程序设计》(清华大学出版社出版)一书中各章的全部习题的参考解答。 为了帮助读者更好地理解程序，我们在有的程序中加了必要的注释。对有的题目，我们提供了几种不同的解法和程序，供读者比较分析。 -In this section provided by the authoring Hao Qiang

Towards a psychophysical evaluation of colour constancy algorithms

LabView讲义,很全-LabView notes, it all

感到很反对回复经国家富豪和 东方鼓腹含和超负荷红-Reply by the state was very much opposed to the rich and East is Red