Java编程与垃圾收集器 不错的技术文档，对垃圾收集器的说明解释...

作为轻量级的容器，Spring常常被认为是EJB的替代品。我们也相信，对于很多 （不一定是绝大多数）应用和用例，相对于通过EJB容器来实现相同的功能而言， Sping作为容器，加上它在事务，ORM和JDBC存取这些领域中丰富的功能支持， Spring的确是更好的选择。-As a lightweight container, Spring is often considered an alternative to EJB. We also believe that for many (not necessarily the overwhelming majority of) applications and use cases, as opposed to through the EJB container to achieve the same functionality in terms of, Sping as containers, together with its affairs, ORM and JDBC access to these areas of rich the function of support, Spring is indeed a better choice.

数据挖掘的另一个方面知识的认识，使你更全面的认识它-Another aspect of data mining knowledge to enable you a more comprehensive understanding of it

lzo compression algorithm

研发项目管理培训-research project management training

详细的结束了MP3的硬件，软件的实际过程，已经在设计中应该注意的问题！对设计我维修有很大的帮助-In detail the end of the MP3 hardware and software of the actual process has been in the design should pay attention to the problem! Maintenance of design I have a lot of help

某网络专业人士笔记(非常值得收藏)，能帮助网络学习者快速学习网络知识。-a network of professionals Notes (very worthwhile collection), the network will help learners fast learning network knowledge.

c54变成指南，包括c语言编程风格，汇编的混合编程，以及代码优化-c54 into guidelines, including c programming language style, a compilation of mixed programming, and code optimization

毕业找工作的重要参考资料，各个单位的题目这里都有。-Important reference for graduate looking for work, here are the subject of various units.

IBM培训资料，主要是存储方面的-IBM training materials, mainly storage

This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.-This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may fail. Given the demand d, we try to evaluate the system reliability that the maximum#ow of the network is not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then the system reliability can be calculated in terms of such points. One computer example is shown to illustrate the solution procedure.