GRAPH-THEORETIC ANALYSIS OF GRADUALLY VARIED UNSTEADY FLOWS IN RIVER CHANNEL NETWORKS

Gradually-varied Flows in Open-channel Networks

− Reported here are some results obtained, from a calculus algorithm application that, based on known equation analytical solutions of water flow profiles, allows the study of steady-state, gradually varied flow in open channel networks. The procedure allows to calculate, in the case of slow water flow into gradually downward slope channels, in the direction of motion, the florates and water le...

Integral turbulent scales in unsteady rapidly varied open channel flows

Gradually Varied Surfaces and Gradually Varied Functions

The gradually varied surface was introduced and studied in digital and discrete spaces by Chen. The basic idea of introducing gradually varied surfaces is to employ a purely discrete interpolation algorithm to fit a discrete surface when the desired surface is not required to be “smooth.” In this paper, we generalize the concept of gradually varied surfaces. A digital surface is defined as a ma...

Chaotic Analysis and Prediction of River Flows

Analyses and investigations on river flow behavior are major issues in design, operation and studies related to water engineering. Thus, recently the application of chaos theory and new techniques, such as chaos theory, has been considered in hydrology and water resources due to relevant innovations and ability. This paper compares the performance of chaos theory with Anfis model and discusses ...

A Graph Theoretic Approach for Channel Assignment in Cellular Networks

We define a cellular assignment graph to model the channel assignment problem in a cellular network where overlapping cell segments are included in the model. Our main result is the Capacity-Demand Theorem which shows a channel assignment function is always possible unless there is a connected subregion of cells and overlap segments containing more channel requests then the total capacity of al...