Water level updating model for flow calculation of river networks

Complex water movement and insufficient observation stations are the unfavorable factors in improving the accuracy of flow calculation of river networks. A water level updating model for river networks was set up based on a three-step method at key nodes, and model correction values were collected from gauge stations. To improve the accuracy of water level and discharge forecasts for the entire network, the discrete coefficients of the Saint-Venant equations for river sections were regarded as the media carrying the correction values from observation locations to other cross-sections of the river network system. To examine the applicability, the updating model was applied to flow calculation of an ideal river network and the Chengtong section of the Yangtze River. Comparison of the forecast results with the observed data demonstrates that this updating model can improve the forecast accuracy in both ideal and real river networks.

DISTRIBUTED OPTIMAL LOCAL DOUBLE LOOP NETWORK

A distibuted optimal local double loop(DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter (d) and average hop distance (a) for this class of networks are [square-root 3N -2] less-than-or-equal-to d less-than-or-equal-to [square-root 3N+1] and (5N/9(N-1)) (square-root 3N-1.8) < a < (5N/9 (N-1)). (square-root 3N - 0.23), respectively (N is the number of nodes in the network. (3 less-than-or-equal-to N less-than-or-equal-to 10(4)). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed. The correctness of the algorithm has been also verified by simulating.

Study on Optimal Topology for Computer Local Double Loop Networks

A dist ributed optimal local double loop (DOLDL) network is presented. Emphasis is laid on the topology and distributed routing algorithms for the DOLDL. On the basis of building an abstract model, a set of definitions and theorems are described and proved. An algorithm which can optimize the double loop networks is presented. The optimal values of the topologic parameters for the DOLDL have been obtained by the algorithm, and these numerical results are analyzed. The study shows that the bounds of the optimal diameter d and average hop distance a for this class of networks are [3N- 2]≤d≤[3N ] and (5N/9 (N-1))-(3N -1.8)<a<(5N/9(N-1)) (3N -0.9),respectively (N is the number of nodes in the network ). A class of the distributed routing algorithms for the DOLDL and the implementation procedure of an adaptive fault-tolerant algorithm are proposed and analyzed. The correctness of the algorithm has also been verified by simulating.

Research of Electric Cable Path Planning Based on Heuristic Optimization Algorithm in Mixed-Land Scenario

In order to improve the reliability of power supply,the sophisticated design of the structure of electric cable network has become an important issue for modern urban distribution networks.In this paper,an electric cable path planning model based on heuristic optimization algorithm considering mixed-land scenario is proposed.Firstly,based on different land samples,the kernel density estimation(KDE)and the analytic hierarchy process(AHP)are used to estimate the construction cost of each unit grid,in order to construct the objective function of comprehensive investment for electric cable loop network.Then,the ant colony optimization(ACO)was improved in pheromone concentration,factor increment and search direction to accelerate the solving speed,and the cable path planning result with minimum construction cost is obtained.Finally,the feeder’s tie line of the cable loop network is planned by the genetic algorithm(GA)to achieve the minimum operating cost.In the case analysis,compared with the traditional method,not only the subjective factors in the process of investment estimation can be avoided,but also the speed of model solving and the quality of the optimal solution are improved.

A COUPLED 1-D AND 2-D CHANNEL NETWORK MATHEMATICAL MODEL USED FOR FLOW CALCULATIONS IN THE MIDDLE REACHES OF THE YANGTZE RIVER

A coupled one-dimensional （1-D） and two-dimensional （2-D） channel network mathematical model is proposed for flow calculations at nodes in a channel network system in this article. For the 1-D model, the finite difference method is used to discretize the Saint-Venant equations in all channels of a looped network. The Alternating Direction Implicit （ADI） method is adopted for the 2-D model at the nodes. In the coupled model, the 1-D model provides a good approximation with small computational effort, while the 2-D model is applied for complex topography to achieve a high accuracy. An Artificial Neural Network （ANN.） method is used for the data exchange and the connectivity between the 1-D and 2-D models. The coupled model is applied to the Jingjiang-Dongting Lake region, to simulate the tremendous looped channel network system, and the results are compared with field data. The good agreement shows that the coupled hydraulic model is more effective than the conventional 1-D model.

The construction of infinite families of any k-tight optimal and singular k-tight optimal directed double loop networks

The double loop network(DLN)is a circulant digraph with n nodes and outdegree 2.It is an important topological structure of computer interconnection networks and has been widely used in the designing of local area networks and distributed systems.Given the number n of nodes,how to construct a DLN which has minimum diameter?This problem has attracted great attention.A related and longtime unsolved problem is:for any given non-negative integer k,is there an infinite family of k-tight optimal DLN?In this paper,two main results are obtained:(1)for any k≥0,the infinite families of k-tight optimal DLN can be constructed,where the number n(k,e,c)of their nodes is a polynomial of degree 2 in e with integral coefficients containing a parameter c.(2)for any k≥0, an infinite family of singular k-tight optimal DLN can be constructed.

COOPERATIVE DYNAMICS OF LOYAL CUSTOMERS IN QUEUEING NETWORKS

We consider queueing networks （QN＇s） with feedback loops roamed by ＂intelligent＂ agents, able to select their routing on the basis of their measured waiting times at the QN nodes. This is an idealized model to discuss the dynamics of customers who stay loyal to a service supplier, provided their service time remains below a critical threshold. For these QN＇s, we show that the traffic flows may exhibit collective patterns typically encountered in multi-agent systems. In simple network topologies, the emergent cooperative behaviors manifest themselves via stable macroscopic temporal oscillations, synchronization of the queue contents and stabilization by noise phenomena. For a wide range of control parameters, the underlying presence of the law of large numbers enables us to use deterministic evolution laws to analytically characterize the cooperative evolution of our multi-agent systems. In particular, we study the case where the servers are sporadically subject, to failures altering their ordinary behavior.

A Fault-tolerant Routing Control for Double Loop Networks

This paper divides the vertex set into several disjoined subsets and provides an optimal fault-tolerance routing algorithm based on the vertex set partition. This algorithm is efficient and convergent, in polynomial time, we can get the output if the vertex is given.