鲁棒控制理论的经典著作，由Carsten Scherer写。

Struts in Action Struts in Action Struts in Action

这是个mysql 手册是中文版的 开发网站时必要的一个武器。-This is a Chinese version of mysql manual is necessary for the development of a weapons site.

统计自然语言处理的课件,哈尔宾工业大学的-Statistical Natural Language Processing Courseware

Ext2 核心 API 中文详解 有比较详细的Ext2 的说明，适合有一定Ext经验的开发人员-Ext2 explain the core API Chinese Ext2 a more detailed description of the experience for some of the developers Ext

基于MATLAB的BP人工神经网络设计,希望对大家有用-MATLAB-based BP artificial neural network design, we hope to useful

《Visual C++实验与案例分析》(张文祥)电子教案.rar 源程序和课件

Java Cryptography 应用 Java 实现加密，英文版。-Java Cryptography Application Java encryption and English.

本节包括主要元素：EJB体系结构：EJB体系结构。为什么要使用EJB容器

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

This brief introduce a kind of the framework construction to materialize the system. And an example was given with the discussion on the performence.