+ All Categories
Home > Documents > By Behzod Gaybullaev -...

By Behzod Gaybullaev -...

Date post: 26-Feb-2021
Category:
Upload: others
View: 2 times
Download: 0 times
Share this document with a friend
34
By Behzod Gaybullaev
Transcript
Page 1: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

By Behzod Gaybullaev

Page 2: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

IntroductionStudy areaMethodsResultsConclusion

Page 3: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Vulnerability of river channels to urbanization has beenlessened by the extensive construction of artificial watercontrol improvements.

Traditional engineering practices on isolated parts of ariver may disturb the hydrologic continuity and interruptthe natural state of ecosystems.

Taking the Xiaoqinghe River basin as a whole, wedeveloped a river channel network design to mitigate riverrisks while sustaining the river in a state as natural aspossible.

Page 4: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

The river channel risk from drought during low-flowperiods and flood during high-flow periods as well as thepotential for water diversion were articulated in detail.

A network with ‘‘nodes’’ and ‘‘edges’’ could bedesigned to relieve drought hazard and flood riskrespectively.

Page 5: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

The objective of this study is:

propose river channel network scenarios for low-flowand high-flow periods;

introduce the shortest path algorithm of graph theory tooptimize the low-flow network;

evaluate the risk-relieving capacity of the networksdesigned for low-flow and high-flow periods.

Page 6: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Rose and Peters, (2001).

Urbanization affects the processes that control stream flow of river channels;

Bledsoe (2001), White (2006),

Greater runoff, higher peak discharges, more rapid response times,and variations in sediment production often occur duringurbanization;

Gregory, (2002) Posing great risks on ecology and flood control for river managers;Lo´ pez-Moreno et al., (2008)

The risks are further exacerbated by the river flow fluctuations overtime, typically with cyclic variations on a seasonal, annual and interannual basis;

Smakhtin, (2001) During low-flow periods, on-going water resources abstractionresults in gradual reduction of flow available for instream uses,which, in turn, trigger a number of environmental effects, includingincreased sedimentation, aggravated water pollution, decreasedaquatic biota, and declined recreational landscape;

(Muller, 2007); (Browning-Aiken et al., 2007; Mujumdar, 2008).

During high flow periods, intense rainfall increases river runoff andpeak discharges, posing more challenges on flood protection.

Page 7: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Harper 1999; Gregory, 2002, Brouwer 2004

Most of the engineering projects have generally been appliedin a piecemeal manner over relatively short reaches, without asound understanding of the broader spatial context;

Benda et al., 2004, When taken in the context of a river network as a population ofchannels and their confluences;

Moussa, 2008 Discussing the relationship between river channel networkmorphometry and river reach hydrologic and geomorphiccharacteristics;

Benda et al., 2004 Exploring how river channel network structure imposes effects onecological patterns, such as riverine habitat organization;

Hitt and Angermeier, 2008

Fish assemble structure;

Shaw and Cooper, 2008

riparian vegetation distribution;

Poulter et al 2008, Young et al., 2000; Liu and Weller, 2008

However, combining structures of graphs and algorithms to findoptimal network paths or predicting stream flow statistics withriver channel network models have also been explored.

Ren et al. (2008), due to climate change, since 1950s, especially after 1990,limitation of water supply has been largely intensified during low-flow periods; meanwhile, flood frequency and intensity alsoincrease apparently during high-flow periods in east China.

Page 8: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Jinan is bordered by the Tai Mountain to south and Yellow River to the north;

Altitude within the area ranges from 23 m to 975 m above sea level, with ahighly contrasting relief;

The semi-humid continental monsoon climate throughout the city ischaracterized by cold, dry winters and hot, wet summers;

The average annual precipitation is 636 mm, with 75% during the high-flowperiods.

The average annual temperature is 14 0C. The average monthly temperaturerises to the highest point in July, ranging from 26 0C to 27 0C, and drops to thelowest point in January, ranging from -3 0C to - 1.5 0C.

Page 9: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

The rivers flowing via this city belong tothe Yellow River basin in the southwest, theXiaoqinghe (XQH) River basin in the centraldistrict, and the Haihe River basin in thenortheast.

The XQH River has a total length of 237km and a catchment area of 10,572 km2, ofwhich 70.3 km and 2824.1 km2 are in theurban districts of Jinan City.

There are 27 tributary streams flowinginto/out of the XQH River

Rainfall is the main water source of thestreams. The streams to the north of XQHRiver are mostly flood discharging channels.

Page 10: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Fig.1 . (A) Location of the City of Jinan;(B) Location of the Xiaoqinghe River basin thatcovers half of the whole urban district;(C) Natural river channel network within thebasin of Xiaoqinghe River (N-n).1) Meili Wetlands; 2) Yangjuan Wetlands;3) Shanghuashan Wetlands; 4) XiahuashanWetlands; 5) Jiangshuiquan Reservoir;6) Mengjia Reservoir; 7) Xiaoguan Reservoir; 8)Ganggou Reservoir; 9) Langmaoshan Reservoir;10) Duzhang Reservoir; 11) Baiyun Lake; 12)Duozhuang Reservoir; 13) Dazhan Reservoir;14) Xinglin Reservoir; 15) Yazhuang Lake. a)Beitaiping Stream; b) Hongxigan Stream; c)Nantaiping Stream; d) Lashan Stream; e) XingjiStream; f) Gongshang Stream; g) the moat; h)Xiluo Stream; i) Dongluo Stream; j) LiuhangStream; k) Quanfu Stream; l) Daxinshi Stream;m) Hancang Stream; n) Liugong Stream; o)Yangjia Stream; p) Juye Stream; q) XiujiangStream; r) Luohe Stream; s) Dashaliu Stream.

Using the digitalization method of ArcViewGIS 3.2, (2006) provided by the Waterresources Bureau of Jinan City (WRBJC).

Page 11: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

The instream flow requirements (IFR) were calculated for tributaries toinvestigate their risks to drought. IFR is calculated using the following formula (Wang et al., 2007):

Qh = min {Qi} (1)

where Qh is the minimum IFR (108 m3), Qi is the flow discharge during low-flow periods in the year of i (108 m3); i is the statistic year, i = 1970, 1971, .,2006.

Page 12: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

A directed graph Gd is a pair of (V, E), where V is a set of nodes and Ea set of unordered pair of (i, j) that denote the directed edges.The i and j are initial and terminal nodes respectively, which togetherare called endpoints of (i, j) (Chen, 1976). If each edge of Gd isweighted with one or more real numbers, then the directed graph canbe called a directed network, or simply a network.Therefore, a directed network N is defined as:

N = (V, E, W) (2)

where V ={1,., n} is the set of n nodes, E ⊂ N x N is the set of edges,and associated with each edge (i, j) ∈ E is a vector weight W ij ∈ W.

Page 13: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

In the above network N, the path from origin edge to destination edge p (u,v) consists of a group of edge series (e0..., ek), in which u = e0, v = ek.

The shortest path model can be described as follows (Xie and Xing, 2000):

min ∑ WijXij(ij)∈A

1, i = s∑ Xij - ∑ Xji = -1, i = t (3)

j:(ij)∈A j:(ji)∈A 0, i ≠ s,tXij ≥ 0,

where the decision variable xij is a 0–1 variable. If xij = 1, the edge (i, j) is onthe route s–t; if xij = 0, the edge (i, j) is not on the route s–t.

Page 14: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

To solve the above optimization model, lengths have to be assigned to edgesfirstly (Rinaldo et al., 2004), which can be seen from the Manning Equationthat states flow velocity within an individual open channel (Lin, 2008):

v = (1/n) R2/3 j1/2 (4)where v is the mean velocity in section, n is the Manning roughnesscoefficient, R is the hydraulic radius of the channel, and i is the friction(force) slope, under steady flow conditions, the friction slope is assumed tobe equal to bed slope (Chow et al., 1988). Actually this is understandablefrom the equation as follows:

t = l/v = l x n x R -2/3 x i -1/2 (5)

where t is time period of flow movement along the channel, l is the channel length.

Page 15: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

The “integrative resistance” was then explained as:W = l x n x R-2/3 x i-1/2, (6)

(7)

where W is the ‘‘integrative resistance’’, A is the cross-sectional area of thechannel, X is the wetted perimeter, b is the channel width, and h is the waterdepth, m is the slope coefficient. The channel roughness can also beneglected. For a rectangular channel, m = 0, the hydraulic radius R can besimplified as:

(8)

B = α x h = α x β x Q1/3 (9)

where α is the ratio of channel width to water depth, β is an empirical coefficient, Q is the flow discharge of channel (m3/s).

Page 16: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

This study then defined Wij as the length of edge (i, j), the values of Wij weremeasured on the digitalized map. For convenience of calculation anddescription, Wij was classified into six levels; basically one level containedtwo kilometers for hilly areas and three kilometers for plains (Table 3). Thelabel-setting algorithm was then employed to calculate the least length withthe Bellman Formula (Xie and Xing, 2000):

Us = 0Uj = min {ui + W ij}, (10)

i ≠ j

where s is the initial node, and uj the length of the shortest path betweennodes i and j. Finally, the remaining nodes and edges formed theoptimized river channel network.

Page 17: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

This study employed the ‘‘gamma index of connectivity’’, the ratio of thenumber of links in a network to the maximum number of links possible as givenin the following formula (Forman and Godron, 1986; Cook, 2002):

γ = L/Lmax = L/3(V-2) (V ≥ 3, V ∈ N) (11)where γ is the gamma index of connectivity, L the number of linkages, and Vthe number of nodes. This study used ‘‘alpha index of circuitry’’, whichmeasures the number of loops present divided by the maximum number ofloops possible as in the following formula (Forman and Godron, 1986; Cook,2002):

α = (L – V + 1) / (2V – 5) ( V ≥ 3, V ∈ N) (12)

where α is the degree of network circuitry. The indices of α and γ werecalculated for analysis of the natural, respectively.

Page 18: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

3.2.1. Designing river channel networkWithin the basin, XQH River,Xingji Stream, and Xiujiang Streamare particularly vulnerable to floodrisks during high-flow periods (Table1, red colour). The designing stepsare similar to those for low-flowperiods, while the results aredifferent. Only one artificial channel isavailable to divert storm water fromthe Lashan Stream, Xingji Streamand Xiujiang Stream (blue colour),respectively.

Page 19: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

we used four variables to represent flood-control capacity as in the followingformula:

E = C/ (P x 3600t);C = Cw + Cr + Fl X 3600t + Fc X 3600t, (13)

where E is the ratio of flood-control capability to target flood level; t is floodduration, hour; 3600 is a coefficient of unit conversion, an hour is 3600 s; C isthe total flood-control capability of the designed network which incorporates allpossible flood-protection works (104 m3); P is the target peak discharge (m3/s);Cw is the flood storage capacity of retention wetlands (104 m3); Cr is the floodstorage capacity of reservoirs (104 m3); Fl is the flood-withstand standard oflevees (m3/s); and Fc is flow rate of river channels diverting flood directly toother river reaches (m3/s).

Page 20: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Nine streams were selected as water replenishing from Yellow river basinafter calculation on the min IFR (table 2, red colour).In table 2, (yellow colour) all have reservoirs on their upper reach (see table4), the other two streams (black colour) both have small enough IFR to beneglected.

Stream IFR(108 m3)

Flow rate of IFR (m3/s)

Stream IFR(108 m3)

Flow rate of IFRa (m3/s)

LashanXingjiGongshangThe MoatXiluoDongluoLiuhangQuanfu

0.1290.2370.1990.1100.3510.1220.1840.198

0.6221.1440.9590.5321.6920.5870.8890.953

DaxinshiHancangLiugongYangjiaJuyeXiujiangLuohe

0.1320.0040.0150.0020.0720.0990.071

0.6380.0190.0730.0110.3470.4790.341

Table 2. Calculation of the minimum IFR for tributaries of the Xiaoqinghe river

a Flow rate of the IFR is the IFR divided by time interval of low-flow period.

Page 21: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to
Page 22: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Fig. 2. Designed channel network for low-flow periods. The subnetwork in the rectangle is relatively complex and needs to be optimizedwith the shortest path model. 1) Fenshuiling Waterworks; 2) headwater of Xingji Stream; 5) a turning point on the Xingji Stream; 6)WohushanReservoir; 7) headwater of the moat; 8) headwater of Liuhang Stream; 9) a turning point on the Yufu Stream; 10) headwater ofLashan Stream; 11) another turning point on the Xingji Stream; 12) Fenghuang Sluice on the Gongshang Stream; 13) confluence of XiluoStream and the moat; 14) confluence of Dongluo Stream and the moat; 15) a turning point on the Liuhang Stream; 16) a turning point on theQuanfu Stream; 17) a turning point on the Daxinshi Stream; 22) a turning point on the Yangjia Stream; 23) a turning point on the LiugongStream; 24) a water intake on the Hancang Stream; 27) a water intake on the Xiujiang Stream.

We selected nodes and linked them to design a river channel network based on the natural network (Fig. 2). Water-drawing structures are to be built at all of the nodes except 12, 25, 26, 29, 30.

Page 23: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

According to the original design, almost all tributaries, especially those in the urban districts, have more than one flow path to receive water diverted from other water bodies (see Table 5)

Network optimization was performed for the subnetwork in the rectangle in Fig. 2, which is relatively complex (Table 5). The originally proposed river channel subnetwork in Fig. 3 was optimized to a simpler one in Fig. 4.

Exploitable water sources and water-transferring scenarios of target streams were then investigated (Table 5). Yufu Stream and its upstream Wohushan Reservoir have been developed as a flow path recharging water into the XQH River.

Page 24: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to
Page 25: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Fig. 3. Optimization of the subnetwork Edges of (4, 8), (6, 10), (10, 11), (11, 12), (14, 15), (15, 16), (16, 17) were excluded from the originally designed subnetwork using the shortest path model.

Page 26: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Fig. 4. Optimized channel network for low-flow periods (N-o). N-o contains less nodes andedges than N-dl.

Page 27: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Using formulas (11) and (12), the indices of α and γ were calculated andcompared between natural, designed and optimized networks for low-flowperiods (Table 6). The two indices both rise up in artificial networks, implicatingthe improved linkage effectiveness.

In N-n, 32 nodes and 37 edges translate into a nearly loopless network withrelatively high connectivity. N-dl is characterized by much higher connectivityand circuitry than N-n. N-o is produced by 49 nodes and 68 edges, with α and γat 0.22 and 0.48 respectively, which are slightly smaller than that of N-dl,resulting from the exclusion of edges and nodes from N-dl by the shortest pathmodel. Compared to N-n, the added 17 nodes and 31 edges of N-o give theintensified connectivity and especially improved circuitry.

4.1.3. Assessing the network linkage effectiveness

Page 28: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

4.2.1. Designing river channel networkFlood-retainable wetlands and reservoirs, and available flood relievingscenarios were first investigated (Table 7), and then nodes were selected andlinked to divert flood from the four river reaches to other waters during high-flow periods (Fig. 5). According to Xiong (2005), sluices are needed tocontrol flow rate at water inlet and outlet of water bodies, in other words, inactual engineering design, sluices are needed at nodes in Fig. 5.

Page 29: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to
Page 30: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

4.2.2. Assessing the network flood-relieving effectUsing formula (13), the index of E was calculated for N-dh (Table 8).Results show that the designed network is notably effective to relieve peakdischarges for all river reaches imperiled by flood. Flood risk reduces to atleast half of its original level, even to zero for the Xiujiang Stream.

At least, half of the possible flood risk shall be calmed (e.g. the Xingji Stream and Segment 3 of the XQH River); even for Xiujiang Stream and Segment 1 of the XQH River, the potential flood risk shall be removed completely.

Page 31: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

We applied graph theory to a channel network methodology to designand identify major flow paths that provide unique managementopportunities.

Our approach represents a close-to nature (ecological river) and cost-effective method for designing large river channel networks.

The designed river channel network is implemented in atransportation-oriented manner and permits relatively large engineeringquantity, its better to be applied to basins of stream networks and regularnetwork structure, such as, artificial system of irrigation ditches.

Page 32: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

To find the optimal flow path, we consider hydraulic and economicproperties of a path conceptually, but only channel length is involvedpractically, because the objective of this paper is network design but notchannel design.

This optimization procedure can be better applied to river basins wherethe topography, such as slope, elevation, and distance, is detailed by digitalelevation models, and necessary hydrological data are available.

The shortest path algorithm we have used to optimize network links canalso be modified to select or design other fluvial routes if the length of theshortest path algorithm is designed in a multi-category and numericallybased manner.

Page 33: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Benda, L., Poff, N.L., Miller, D., Dunne, T., Reeves, G., Pess, G., Pollock, M., 2004. The network dynamics hypothesis: how channel networks structureriverine habitats. BioScience 54, 413–427. Bledsoe, B.P., Watson, C.C., 2001. Effects of urbanization on channel instability. Journal of the American Water Resources Association 37, 255–270. Browning-Aiken, A., Morehouse, B., Davis, A., Wilder, M., Varady, R., Goodrich, D., Carter, R., Moreno, D., McGovern, E.D., 2007. Climate, watermanagement, and policy in the San Pedro Basin: results of a survey of Mexican stakeholders near the U.S. Mexico border. Climatic Change 85, 323–341. Chen, W.K., 1976. Applied Graph Theory. North-Holland Publishing Company, Amsterdam. Chow, V.T., Maidment, D.R., Mays, L.W., 1988. Applied Hydrology. McGraw-Hill, New York, USA. Forman, R.T.T., Godron, M., 1986. Landscape Ecology. Wiley, New York. Gregory, K.J., 2002. Urban channel adjustments in a management context: an Australian example. Environmental Management 29, 620–633. Harper, D.M., Ebrahimnezhad, M., Taylor, E., Dickinson, S., Decamp, O., Verniers, G., Balbif, T., 1999. A catchment-scale approach to the physicalrestoration of lowland UK rivers. Aquatic Conservation: Marine and Freshwater Ecosystems 9, 141–157. Hitt, N.P., Angermeier, P.L., 2008. Evidence for fish dispersal from spatial analysis of stream network topology. Journal of the North AmericanBenthological Society 27, 304–320. Lin, Z.X., 2008. Error analysis of flow computation by Manning equation. Water Resources and Power 26, 93–96 (in Chinese). Lo´ pez-Moreno, J.I., Beniston, M., Garcı´a-Ruiz, J.M., 2008. Environmental change and water management in the Pyrenees: facts and future perspectivesfor Mediterranean mountains. Global and Planetary Change 61, 300–312. Muller, M., 2007. Adapting to climate change: water management for urban resilience. Environment and Urbanization 19, 99–113. Poulter, B., Goodall, J.L., Halpin, P.N., 2008. Applications of network analysis for adaptive management of artificial drainage systems in landscapesvulnerable to sea level rise. Journal of Hydrology 357, 207–217. Ren, G.Y., Jiang, T., Li, W.J., Zhai, P.M., Luo, Y., Ma, Z.G., 2008. An integrated assessment of climate change impacts on China’s water resources.Advances in Water Science 19, 772–779 (in Chinese). Rose, S., Peters, N.E., 2001. Effects of urbanization on streamflow in the Atlanta area (Georgia, USA): a comparative hydrological approach. HydrologicalProcesses 15, 1441–1457. Shaw, J.R., Cooper, D.J., 2008. Linkages among watersheds, stream reaches, and riparian vegetation in dryland ephemeral stream networks. Journal ofHydrology 350, 68–82. Smakhtin, V.U., 2001. Lowflowhydrology: a review. Journal ofHydrology 240,147–186. Wang, X.Q., Zhang, Y., Liu, C.M., 2007. Estimation of eco-water requirement in the Liaohe River Basin. Geographical Research 26, 22–28 (in Chinese). Xie, J.X., Xing,W.X., 2000. Network Optimization. Tsinghua University Press, Beijing, China (in Chinese). Xiong, Z.P., 2005. Introduction to Flood Control of Rivers. Wuhan University Press, Wuhan, China (in Chinese).

Page 34: By Behzod Gaybullaev - 國立中興大學swcdis.nchu.edu.tw/AllDataPos/AdvancePos/8097042009/River... · 2015. 9. 11. · However, combining structures of graphs and algorithms to

Thank you for your attention!!!


Recommended