高效益项目的七个习惯。rar优秀项目经理…

一个实用的交通灯模拟设计-a practical design simulation of traffic lights

good doc good doc good doc -good docgood docgood docgood docgood docgood doc

vc编写，关于班级管理的-vc prepared on the management classes

这是一个挺有用的查电脑故障以及你需要什么软件支持你的系统的一个 教程，很不错-This is a quite a search using computer failures and what software you need to support your system a guide, very good

关于非线性动力学方程高精度研究的论文，写的很好！-on nonlinear dynamics equations precision research papers and writing good!

长江是中国最大河流，干流全长6300公里，流域集水总面积180万平方公里，年平均入海量约9600余亿立方米。从干流长度和入海水量论，长江均居世界第三位。 三峡水利枢纽坝址位于长江干流上游的分界处，坝址控制流域面积100万平方公里，多年平均迳流量4510亿立方米，在世界上已建和在建水利枢纽中，与葛洲坝工程同属坝址年迳流量最大的水利枢纽。 -Yangtze is China"s largest river, a total length of 6,300 km of the mainstream. Basin catchment area of 1.8 million square kilometers, with the average into the sea is about 9,600 billion cubic meters. Length from the mainstream and into the sea on the Yangtze River has leaped to third place in the world. TGP dam in the upper reaches of the Yangtze River boundaries, control dam basin area of one million square kilometers, average runoff 451 billion cubic meters, the existed in the world of water conservancy hub. the same with the Gezhouba Dam project, the runoff largest water conservancy hub.

S3C2410完全开发流程,都是关于硬件的帮助信息，通俗易懂，适合初学者！-S3C2410 fully developed flow, the hardware is on the help message, easily understood, for beginners!

该书籍提供了典型的商业智能任务的端到端指导，主要分数据入库和多维数据分析两部分。通过学习可以了解怎样使用“DB2控制中心”和“数据仓库中心”创建仓库数据库以及运用OLAP Starter Kit 对关系数据进行多维分析。-the books of a typical business intelligence to the task of end-to-end guide, The major data warehousing and multidimensional data analysis in two parts. Through the study can understand how to use "DB2 control center" and "data warehouse centers" to create databases and storage operation Starter Kit with OLAP data related to the multi-dimensional analysis.

中兴C#语言的编程规范，主要包括基本原则、布局、注释、命名规则、声明、表达式与语句、类与接口等-ZTE C# Programming language specification, including the basic principles, layout, notes, naming rules, statements, expressions and statements, class and interface, etc.

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.