introduction flood is an inevitable natural phenomenon occurring from time to time in all rivers and natural drainage systems, which not only damages the lives, natural resources and environment, but also causes the loss of economy and health. so estimation and prediction flood hazard is very important spatially in the watersheds without measurement station. there are many models in the water a...

The bounded diameter minimum spanning tree (BDMST) problem is NP-hard and appears e.g. in communication network design when considering certain quality of service requirements. Prior exact approaches for the BDMST problem mostly rely on network flow-based mixed integer linear programming and Miller-Tucker-Zemlin-based formulations. This article presents a new, compact 0–1 integer linear program...

In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...

Today’s network processor utilize parallel processing in order to cope with the traffic growth and wire-speed of current and future network technologies. In this paper, we study two important parallel programming models for network processors: run to completion and pipelining. In particular, the packet flow of a standard network application, IPv4 Forwarding, through two examined network process...

in order to determine hydrological behavior and water management of sepidroud river (north of iran-guilan) the present study has focused on stream flow prediction by using artificial neural network. ten years observed inflow data (2000-2009) of sepidroud river were selected; then these data have been forecasted by using neural network. finally, predicted results are compared to the observed dat...

Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of efficient constraint propagation algorithms for problem solving. Many of the most common global constraints used in constraint programming use filtering algorithms based on network flow theory. We show how we can form...

This paper presents a network reconfiguration method for power flow optimization and, consequently, loss reduction in distribution networks with Distributed Generation (DG). The network reconfiguration problem is formulated and solved using a simple linear programming approach. Optimal configurations are determined by considering the effects of DG outputs, load variations, and various other con...

This paper addresses the globally optimal solution of the network-constrained unit commitment (NCUC) problem incorporating a nonlinear alternating current (AC) model of the transmission network. We formulate the NCUC as a mixed-integer quadratically constrained quadratic programming (MIQCQP) problem. A global optimization algorithm is developed based on a multi-tree approach that iterates betwe...

This paper initiates the study of scaling laws for vehicular ad hoc networks (VANET)s. It provides a general framework to study VANETs. The fundamental capacity limits of these networks are investigated and we show how the road geometry affects this capacity. The VANET capacity is calculated for different road structures. The need for new capacity metrics is discussed. These results are obtaine...

Various methods have been used to economically design wastewater and stormwater collection systems. In this article, Discrete Differential Dynamic Programming (DDDP) which is a subsection of dynamic programming (DP) was used. For each pipe network, various alternatives such as depth and slope of pipe laying and various diameters could be considered to satisfy hydraulic and engineering constrain...