登录
首页 » Project Manage » 长江是中国最大河流,干流全长6300公里,流域集水总面积180万平方公里,年平均入海量约9600余亿立方米。从干流长度和入海水量论,长江均居世界第三位。 三...

长江是中国最大河流,干流全长6300公里,流域集水总面积180万平方公里,年平均入海量约9600余亿立方米。从干流长度和入海水量论,长江均居世界第三位。 三...

于 2022-01-26 发布 文件大小:1.02 MB
0 173
下载积分: 2 下载次数: 1

代码说明:

长江是中国最大河流,干流全长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.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • Standard
    标准库异常安全bjarne StroustrupTexas A
    2022-07-01 00:34:17下载
    积分:1
  • Based on the OPNET network simulation program, useful for beginners to help grou...
    基于opnet的网络仿真程序,对初学者很有帮组-Based on the OPNET network simulation program, useful for beginners to help group
    2022-12-11 07:25:03下载
    积分:1
  • 介绍了基本内容,尤其对初学的学生来说,这是一个很好的顾…
    介绍ASP的基本内容,特别对初学的同学来讲,是一个很好的教程来的,希望大家-introduced the basic contents, especially for novice students, this is a good guide to the We hope to s
    2022-08-11 17:48:47下载
    积分:1
  • ZTE C# Programming language specification, including the basic principles, layou...
    中兴C#语言的编程规范,主要包括基本原则、布局、注释、命名规则、声明、表达式与语句、类与接口等-ZTE C# Programming language specification, including the basic principles, layout, notes, naming rules, statements, expressions and statements, class and interface, etc.
    2022-02-12 18:45:25下载
    积分:1
  • 热广告你离开急哦而分对话框联合防空拉好iotjporjkofjdlkrioiojesito破irer i...
    热广告你离开急哦而分对话框联合防空拉好iotjporjkofjdlkrioiojesito破irer i-oshgvilnlcvm ew,rt-9384b09 go ksa[] lr ogpoibjpofjv[pfdhg
    2022-09-21 23:15:03下载
    积分:1
  • This paper addresses a stochastic
    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.
    2022-02-04 18:52:39下载
    积分:1
  • AUTOSTAR-改变你对飞思卡尔芯片使用方式-AUTOSTAR-change you use Freescale chips
    2022-04-12 03:25:04下载
    积分:1
  • 通信软件架构开发通信软件的经验…
    通信软件的体系结构 开发通信软件的经验之谈-Communication software architecture to develop communications software experiences
    2022-07-24 19:59:57下载
    积分:1
  • ASP loophole Keys
    ASP漏洞全接触――入门篇 ASP数据库问题安全之我见 如何解决登陆漏洞问题-ASP loophole Keys-- Introduction Part ASP database security issues, I see how to solve the problem of landing loopholes
    2022-02-13 01:22:05下载
    积分:1
  • This paper addresses a stochastic
    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.
    2023-01-15 15:10:04下载
    积分:1
  • 696518资源总数
  • 105549会员总数
  • 12今日下载