Turning to Renewable Energy Sources (RES) is the most logical politics in securing the modern society from critical changes in earth increasing temperature. However, Distributed Generation (DG) sources could lead to new challenges in electricity network, mainly allocation of DG sources in distribution level of power system will set the existing network under stress of power flow parameters. The...

Conventional passive distribution networks are changing to modern active distribution networks which are not radial. Conventional load flow methods should be modified for new distribution networks analysis. In modern distribution networks distributed generation (DG) units are embedded with conventional and/or renewable resources. DG units are generally modeled as PV or PQ nodes which inject ...

this research examines the association between co-authorship network centrality (degree, closeness, betweenness, eigenvector, bonacich flow betweenness) and productivity of information science researchers. the research population includes all those researchers who have published at least one record in one of the twenty journals of information science which has an impact factor of 0.635 as a min...

Keeping the density of traffic flow and air pollution in an acceptable level and developing a good capacity for transit in the high priority areas of the city, is really a big deal in large and crowded cities. To address this problem, a new method of intersection signal optimization is presented in this paper. Based on network fundamental diagrams, an Internal–External Traffic Metering Strategy...

Centrality measures, or at least popular interpretations of these measures, make implicit assumptions about the manner in which traffic flows through a network. For example, some measures count only geodesic paths, apparently assuming that whatever flows through the network only moves along the shortest possible paths. This paper lays out a typology of network flows based on two dimensions of v...

The algebraic framework introduced in [4] gives an algebraic condition for the feasibility of a set of multicast connections in a network, that is equivalent to the max-flow min-cut condition of [1]. The algebraic condition also checks the validity of a linear coding solution to a given multicast connection problem. We present two alternative formulations of this condition that are closely tied...

The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...

The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...

Numerical simulations of a three-dimensional model of impingement and film cooling on a flat plate are presented and validated with the available experimental data. Four different turbulence models were utilized for simulation, in which SST  had the highest precision, resulting in less than 4% maximum error in temperature estimation. A simplified geometry with periodic boundary conditions is de...