Hierarchicality of trade flow networks reveals complexity of products.

PubMed

Shi, Peiteng; Zhang, Jiang; Yang, Bo; Luo, Jingfei

2014-01-01

With globalization, countries are more connected than before by trading flows, which amounts to at least 36 trillion dollars today. Interestingly, around 30-60 percents of exports consist of intermediate products in global. Therefore, the trade flow network of particular product with high added values can be regarded as value chains. The problem is weather we can discriminate between these products from their unique flow network structure? This paper applies the flow analysis method developed in ecology to 638 trading flow networks of different products. We claim that the allometric scaling exponent η can be used to characterize the degree of hierarchicality of a flow network, i.e., whether the trading products flow on long hierarchical chains. Then, it is pointed out that the flow networks of products with higher added values and complexity like machinary, transport equipment etc. have larger exponents, meaning that their trade flow networks are more hierarchical. As a result, without the extra data like global input-output table, we can identify the product categories with higher complexity, and the relative importance of a country in the global value chain by the trading network solely.

Hierarchicality of Trade Flow Networks Reveals Complexity of Products

PubMed Central

Shi, Peiteng; Zhang, Jiang; Yang, Bo; Luo, Jingfei

2014-01-01

With globalization, countries are more connected than before by trading flows, which amounts to at least trillion dollars today. Interestingly, around percents of exports consist of intermediate products in global. Therefore, the trade flow network of particular product with high added values can be regarded as value chains. The problem is weather we can discriminate between these products from their unique flow network structure? This paper applies the flow analysis method developed in ecology to 638 trading flow networks of different products. We claim that the allometric scaling exponent can be used to characterize the degree of hierarchicality of a flow network, i.e., whether the trading products flow on long hierarchical chains. Then, it is pointed out that the flow networks of products with higher added values and complexity like machinary, transport equipment etc. have larger exponents, meaning that their trade flow networks are more hierarchical. As a result, without the extra data like global input-output table, we can identify the product categories with higher complexity, and the relative importance of a country in the global value chain by the trading network solely. PMID:24905753

Two problems in multiphase biological flows: Blood flow and particulate transport in microvascular network, and pseudopod-driven motility of amoeboid cells

NASA Astrophysics Data System (ADS)

Bagchi, Prosenjit

2016-11-01

In this talk, two problems in multiphase biological flows will be discussed. The first is the direct numerical simulation of whole blood and drug particulates in microvascular networks. Blood in microcirculation behaves as a dense suspension of heterogeneous cells. The erythrocytes are extremely deformable, while inactivated platelets and leukocytes are nearly rigid. A significant progress has been made in recent years in modeling blood as a dense cellular suspension. However, many of these studies considered the blood flow in simple geometry, e.g., straight tubes of uniform cross-section. In contrast, the architecture of a microvascular network is very complex with bifurcating, merging and winding vessels, posing a further challenge to numerical modeling. We have developed an immersed-boundary-based method that can consider blood cell flow in physiologically realistic and complex microvascular network. In addition to addressing many physiological issues related to network hemodynamics, this tool can be used to optimize the transport properties of drug particulates for effective organ-specific delivery. Our second problem is pseudopod-driven motility as often observed in metastatic cancer cells and other amoeboid cells. We have developed a multiscale hydrodynamic model to simulate such motility. We study the effect of cell stiffness on motility as the former has been considered as a biomarker for metastatic potential. Funded by the National Science Foundation.

New computer program solves wide variety of heat flow problems

NASA Technical Reports Server (NTRS)

Almond, J. C.

1966-01-01

Boeing Engineering Thermal Analyzer /BETA/ computer program uses numerical methods to provide accurate heat transfer solutions to a wide variety of heat flow problems. The program solves steady-state and transient problems in almost any situation that can be represented by a resistance-capacitance network.

Numerical Leak Detection in a Pipeline Network of Complex Structure with Unsteady Flow

NASA Astrophysics Data System (ADS)

Aida-zade, K. R.; Ashrafova, E. R.

2017-12-01

An inverse problem for a pipeline network of complex loopback structure is solved numerically. The problem is to determine the locations and amounts of leaks from unsteady flow characteristics measured at some pipeline points. The features of the problem include impulse functions involved in a system of hyperbolic differential equations, the absence of classical initial conditions, and boundary conditions specified as nonseparated relations between the states at the endpoints of adjacent pipeline segments. The problem is reduced to a parametric optimal control problem without initial conditions, but with nonseparated boundary conditions. The latter problem is solved by applying first-order optimization methods. Results of numerical experiments are presented.

E-Learning Technologies: Employing Matlab Web Server to Facilitate the Education of Mathematical Programming

ERIC Educational Resources Information Center

Karagiannis, P.; Markelis, I.; Paparrizos, K.; Samaras, N.; Sifaleras, A.

2006-01-01

This paper presents new web-based educational software (webNetPro) for "Linear Network Programming." It includes many algorithms for "Network Optimization" problems, such as shortest path problems, minimum spanning tree problems, maximum flow problems and other search algorithms. Therefore, webNetPro can assist the teaching process of courses such…

Optimal Water-Power Flow Problem: Formulation and Distributed Optimal Solution

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall-Anese, Emiliano; Zhao, Changhong; Zamzam, Admed S.

This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally managed to satisfy water demand while improving power grid operations; {for the power network, an AC optimal power flow formulation is augmented to accommodate the controllability of water pumps.} Unfortunately, the physics governing the operation of the two infrastructures and coupling constraints lead to a nonconvex (and, in fact, NP-hard) problem; however, after reformulating OWPF as a nonconvex, quadratically-constrained quadratic problem, a feasible point pursuit-successivemore » convex approximation approach is used to identify feasible and optimal solutions. In addition, a distributed solver based on the alternating direction method of multipliers enables water and power operators to pursue individual objectives while respecting the couplings between the two networks. The merits of the proposed approach are demonstrated for the case of a distribution feeder coupled with a municipal water distribution network.« less

Exploiting Bounded Signal Flow for Graph Orientation Based on Cause-Effect Pairs

NASA Astrophysics Data System (ADS)

Dorn, Britta; Hüffner, Falk; Krüger, Dominikus; Niedermeier, Rolf; Uhlmann, Johannes

We consider the following problem: Given an undirected network and a set of sender-receiver pairs, direct all edges such that the maximum number of "signal flows" defined by the pairs can be routed respecting edge directions. This problem has applications in communication networks and in understanding protein interaction based cell regulation mechanisms. Since this problem is NP-hard, research so far concentrated on polynomial-time approximation algorithms and tractable special cases. We take the viewpoint of parameterized algorithmics and examine several parameters related to the maximum signal flow over vertices or edges. We provide several fixed-parameter tractability results, and in one case a sharp complexity dichotomy between a linear-time solvable case and a slightly more general NP-hard case. We examine the value of these parameters for several real-world network instances. For many relevant cases, the NP-hard problem can be solved to optimality. In this way, parameterized analysis yields both deeper insight into the computational complexity and practical solving strategies.

Deep learning beyond Lefschetz thimbles

NASA Astrophysics Data System (ADS)

Alexandru, Andrei; Bedaque, Paulo F.; Lamm, Henry; Lawrence, Scott

2017-11-01

The generalized thimble method to treat field theories with sign problems requires repeatedly solving the computationally expensive holomorphic flow equations. We present a machine learning technique to bypass this problem. The central idea is to obtain a few field configurations via the flow equations to train a feed-forward neural network. The trained network defines a new manifold of integration which reduces the sign problem and can be rapidly sampled. We present results for the 1 +1 dimensional Thirring model with Wilson fermions on sizable lattices. In addition to the gain in speed, the parametrization of the integration manifold we use avoids the "trapping" of Monte Carlo chains which plagues large-flow calculations, a considerable shortcoming of the previous attempts.

Propagation of Disturbances in Traffic Flow

DOT National Transportation Integrated Search

1977-09-01

The system-optimized static traffic-assignment problem in a freeway corridor network is the problem of choosing a distribution of vehicles in the network to minimize average travel time. It is of interest to know how sensitive the optimal steady-stat...

Simplifications for hydronic system models in modelica

DOE PAGES

Jorissen, F.; Wetter, M.; Helsen, L.

2018-01-12

Building systems and their heating, ventilation and air conditioning flow networks, are becoming increasingly complex. Some building energy simulation tools simulate these flow networks using pressure drop equations. These flow network models typically generate coupled algebraic nonlinear systems of equations, which become increasingly more difficult to solve as their sizes increase. This leads to longer computation times and can cause the solver to fail. These problems also arise when using the equation-based modelling language Modelica and Annex 60-based libraries. This may limit the applicability of the library to relatively small problems unless problems are restructured. This paper discusses two algebraicmore » loop types and presents an approach that decouples algebraic loops into smaller parts, or removes them completely. The approach is applied to a case study model where an algebraic loop of 86 iteration variables is decoupled into smaller parts with a maximum of five iteration variables.« less

Output-feedback control of combined sewer networks through receding horizon control with moving horizon estimation

NASA Astrophysics Data System (ADS)

Joseph-Duran, Bernat; Ocampo-Martinez, Carlos; Cembrano, Gabriela

2015-10-01

An output-feedback control strategy for pollution mitigation in combined sewer networks is presented. The proposed strategy provides means to apply model-based predictive control to large-scale sewer networks, in-spite of the lack of measurements at most of the network sewers. In previous works, the authors presented a hybrid linear control-oriented model for sewer networks together with the formulation of Optimal Control Problems (OCP) and State Estimation Problems (SEP). By iteratively solving these problems, preliminary Receding Horizon Control with Moving Horizon Estimation (RHC/MHE) results, based on flow measurements, were also obtained. In this work, the RHC/MHE algorithm has been extended to take into account both flow and water level measurements and the resulting control loop has been extensively simulated to assess the system performance according different measurement availability scenarios and rain events. All simulations have been carried out using a detailed physically based model of a real case-study network as virtual reality.

A multi-scale network method for two-phase flow in porous media

DOE Office of Scientific and Technical Information (OSTI.GOV)

Khayrat, Karim, E-mail: khayratk@ifd.mavt.ethz.ch; Jenny, Patrick

Pore-network models of porous media are useful in the study of pore-scale flow in porous media. In order to extract macroscopic properties from flow simulations in pore-networks, it is crucial the networks are large enough to be considered representative elementary volumes. However, existing two-phase network flow solvers are limited to relatively small domains. For this purpose, a multi-scale pore-network (MSPN) method, which takes into account flow-rate effects and can simulate larger domains compared to existing methods, was developed. In our solution algorithm, a large pore network is partitioned into several smaller sub-networks. The algorithm to advance the fluid interfaces withinmore » each subnetwork consists of three steps. First, a global pressure problem on the network is solved approximately using the multiscale finite volume (MSFV) method. Next, the fluxes across the subnetworks are computed. Lastly, using fluxes as boundary conditions, a dynamic two-phase flow solver is used to advance the solution in time. Simulation results of drainage scenarios at different capillary numbers and unfavourable viscosity ratios are presented and used to validate the MSPN method against solutions obtained by an existing dynamic network flow solver.« less

Cell transmission model of dynamic assignment for urban rail transit networks.

PubMed

Xu, Guangming; Zhao, Shuo; Shi, Feng; Zhang, Feilian

2017-01-01

For urban rail transit network, the space-time flow distribution can play an important role in evaluating and optimizing the space-time resource allocation. For obtaining the space-time flow distribution without the restriction of schedules, a dynamic assignment problem is proposed based on the concept of continuous transmission. To solve the dynamic assignment problem, the cell transmission model is built for urban rail transit networks. The priority principle, queuing process, capacity constraints and congestion effects are considered in the cell transmission mechanism. Then an efficient method is designed to solve the shortest path for an urban rail network, which decreases the computing cost for solving the cell transmission model. The instantaneous dynamic user optimal state can be reached with the method of successive average. Many evaluation indexes of passenger flow can be generated, to provide effective support for the optimization of train schedules and the capacity evaluation for urban rail transit network. Finally, the model and its potential application are demonstrated via two numerical experiments using a small-scale network and the Beijing Metro network.

Cascade phenomenon against subsequent failures in complex networks

NASA Astrophysics Data System (ADS)

Jiang, Zhong-Yuan; Liu, Zhi-Quan; He, Xuan; Ma, Jian-Feng

2018-06-01

Cascade phenomenon may lead to catastrophic disasters which extremely imperil the network safety or security in various complex systems such as communication networks, power grids, social networks and so on. In some flow-based networks, the load of failed nodes can be redistributed locally to their neighboring nodes to maximally preserve the traffic oscillations or large-scale cascading failures. However, in such local flow redistribution model, a small set of key nodes attacked subsequently can result in network collapse. Then it is a critical problem to effectively find the set of key nodes in the network. To our best knowledge, this work is the first to study this problem comprehensively. We first introduce the extra capacity for every node to put up with flow fluctuations from neighbors, and two extra capacity distributions including degree based distribution and average distribution are employed. Four heuristic key nodes discovering methods including High-Degree-First (HDF), Low-Degree-First (LDF), Random and Greedy Algorithms (GA) are presented. Extensive simulations are realized in both scale-free networks and random networks. The results show that the greedy algorithm can efficiently find the set of key nodes in both scale-free and random networks. Our work studies network robustness against cascading failures from a very novel perspective, and methods and results are very useful for network robustness evaluations and protections.

Solving the influence maximization problem reveals regulatory organization of the yeast cell cycle.

PubMed

Gibbs, David L; Shmulevich, Ilya

2017-06-01

The Influence Maximization Problem (IMP) aims to discover the set of nodes with the greatest influence on network dynamics. The problem has previously been applied in epidemiology and social network analysis. Here, we demonstrate the application to cell cycle regulatory network analysis for Saccharomyces cerevisiae. Fundamentally, gene regulation is linked to the flow of information. Therefore, our implementation of the IMP was framed as an information theoretic problem using network diffusion. Utilizing more than 26,000 regulatory edges from YeastMine, gene expression dynamics were encoded as edge weights using time lagged transfer entropy, a method for quantifying information transfer between variables. By picking a set of source nodes, a diffusion process covers a portion of the network. The size of the network cover relates to the influence of the source nodes. The set of nodes that maximizes influence is the solution to the IMP. By solving the IMP over different numbers of source nodes, an influence ranking on genes was produced. The influence ranking was compared to other metrics of network centrality. Although the top genes from each centrality ranking contained well-known cell cycle regulators, there was little agreement and no clear winner. However, it was found that influential genes tend to directly regulate or sit upstream of genes ranked by other centrality measures. The influential nodes act as critical sources of information flow, potentially having a large impact on the state of the network. Biological events that affect influential nodes and thereby affect information flow could have a strong effect on network dynamics, potentially leading to disease. Code and data can be found at: https://github.com/gibbsdavidl/miergolf.

Visualization and Hierarchical Analysis of Flow in Discrete Fracture Network Models

NASA Astrophysics Data System (ADS)

Aldrich, G. A.; Gable, C. W.; Painter, S. L.; Makedonska, N.; Hamann, B.; Woodring, J.

2013-12-01

Flow and transport in low permeability fractured rock is primary in interconnected fracture networks. Prediction and characterization of flow and transport in fractured rock has important implications in underground repositories for hazardous materials (eg. nuclear and chemical waste), contaminant migration and remediation, groundwater resource management, and hydrocarbon extraction. We have developed methods to explicitly model flow in discrete fracture networks and track flow paths using passive particle tracking algorithms. Visualization and analysis of particle trajectory through the fracture network is important to understanding fracture connectivity, flow patterns, potential contaminant pathways and fast paths through the network. However, occlusion due to the large number of highly tessellated and intersecting fracture polygons preclude the effective use of traditional visualization methods. We would also like quantitative analysis methods to characterize the trajectory of a large number of particle paths. We have solved these problems by defining a hierarchal flow network representing the topology of particle flow through the fracture network. This approach allows us to analyses the flow and the dynamics of the system as a whole. We are able to easily query the flow network, and use paint-and-link style framework to filter the fracture geometry and particle traces based on the flow analytics. This allows us to greatly reduce occlusion while emphasizing salient features such as the principal transport pathways. Examples are shown that demonstrate the methodology and highlight how use of this new method allows quantitative analysis and characterization of flow and transport in a number of representative fracture networks.

Self-control of traffic lights and vehicle flows in urban road networks

NASA Astrophysics Data System (ADS)

Lämmer, Stefan; Helbing, Dirk

2008-04-01

Based on fluid-dynamic and many-particle (car-following) simulations of traffic flows in (urban) networks, we study the problem of coordinating incompatible traffic flows at intersections. Inspired by the observation of self-organized oscillations of pedestrian flows at bottlenecks, we propose a self-organization approach to traffic light control. The problem can be treated as a multi-agent problem with interactions between vehicles and traffic lights. Specifically, our approach assumes a priority-based control of traffic lights by the vehicle flows themselves, taking into account short-sighted anticipation of vehicle flows and platoons. The considered local interactions lead to emergent coordination patterns such as 'green waves' and achieve an efficient, decentralized traffic light control. While the proposed self-control adapts flexibly to local flow conditions and often leads to non-cyclical switching patterns with changing service sequences of different traffic flows, an almost periodic service may evolve under certain conditions and suggests the existence of a spontaneous synchronization of traffic lights despite the varying delays due to variable vehicle queues and travel times. The self-organized traffic light control is based on an optimization and a stabilization rule, each of which performs poorly at high utilizations of the road network, while their proper combination reaches a superior performance. The result is a considerable reduction not only in the average travel times, but also of their variation. Similar control approaches could be applied to the coordination of logistic and production processes.

Parallel Computation of Unsteady Flows on a Network of Workstations

NASA Technical Reports Server (NTRS)

1997-01-01

Parallel computation of unsteady flows requires significant computational resources. The utilization of a network of workstations seems an efficient solution to the problem where large problems can be treated at a reasonable cost. This approach requires the solution of several problems: 1) the partitioning and distribution of the problem over a network of workstation, 2) efficient communication tools, 3) managing the system efficiently for a given problem. Of course, there is the question of the efficiency of any given numerical algorithm to such a computing system. NPARC code was chosen as a sample for the application. For the explicit version of the NPARC code both two- and three-dimensional problems were studied. Again both steady and unsteady problems were investigated. The issues studied as a part of the research program were: 1) how to distribute the data between the workstations, 2) how to compute and how to communicate at each node efficiently, 3) how to balance the load distribution. In the following, a summary of these activities is presented. Details of the work have been presented and published as referenced.

Optimal Power Flow in Multiphase Radial Networks with Delta Connections: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhao, Changhong; Dall-Anese, Emiliano; Low, Steven H.

This paper focuses on multiphase radial distribution networks with mixed wye and delta connections, and proposes a semidefinite relaxation of the AC optimal power flow (OPF) problem. Two multiphase power-flow models are developed to facilitate the integration of delta-connected generation units/loads in the OPF problem. The first model extends traditional branch flow models - and it is referred to as extended branch flow model (EBFM). The second model leverages a linear relationship between per-phase power injections and delta connections, which holds under a balanced voltage approximation (BVA). Based on these models, pertinent OPF problems are formulated and relaxed to semidefinitemore » programs (SDPs). Numerical studies on IEEE test feeders show that SDP relaxations can be solved efficiently by a generic optimization solver. Numerical evidences indicate that solving the resultant SDP under BVA is faster than under EBFM. Moreover, both SDP solutions are numerically exact with respect to voltages and branch flows. It is also shown that the SDP solution under BVA has a small optimality gap, while the BVA model is accurate in the sense that it reflects actual system voltages.« less

NetFlow Dynamics

DOE Office of Scientific and Technical Information (OSTI.GOV)

Corbet Jr., Thomas F; Beyeler, Walter E; Vanwestrienen, Dirk

NetFlow Dynamics is a web-accessible analysis environment for simulating dynamic flows of materials on model networks. Performing a simulation requires both the NetFlow Dynamics application and a network model which is a description of the structure of the nodes and edges of a network including the flow capacity of each edge and the storage capacity of each node, and the sources and sinks of the material flowing on the network. NetFlow Dynamics consists of databases for storing network models, algorithms to calculate flows on networks, and a GIS-based graphical interface for performing simulations and viewing simulation results. Simulated flows aremore » dynamic in the sense that flows on each edge of the network and inventories at each node change with time and can be out of equilibrium with boundary conditions. Any number of network models could be simulated using Net Flow Dynamics. To date, the models simulated have been models of petroleum infrastructure. The main model has been the National Transportation Fuels Model (NTFM), a network of U.S. oil fields, transmission pipelines, rail lines, refineries, tank farms, and distribution terminals. NetFlow Dynamics supports two different flow algorithms, the Gradient Flow algorithm and the Inventory Control algorithm, that were developed specifically for the NetFlow Dynamics application. The intent is to add additional algorithms in the future as needed. The ability to select from multiple algorithms is desirable because a single algorithm never covers all analysis needs. The current algorithms use a demand-driven capacity-constrained formulation which means that the algorithms strive to use all available capacity and stored inventory to meet desired flows to sinks, subject to the capacity constraints of each network component. The current flow algorithms are best suited for problems in which a material flows on a capacity-constrained network representing a supply chain in which the material supplied can be stored at each node of the network. In the petroleum models, the flowing materials are crude oil and refined products that can be stored at tank farms, refineries, or terminals (i.e. the nodes of the network). Examples of other network models that could be simulated are currency flowing in a financial network, agricultural products moving to market, or natural gas flowing on a pipeline network.« less

On the linear stability of blood flow through model capillary networks.

PubMed

Davis, Jeffrey M

2014-12-01

Under the approximation that blood behaves as a continuum, a numerical implementation is presented to analyze the linear stability of capillary blood flow through model tree and honeycomb networks that are based on the microvascular structures of biological tissues. The tree network is comprised of a cascade of diverging bifurcations, in which a parent vessel bifurcates into two descendent vessels, while the honeycomb network also contains converging bifurcations, in which two parent vessels merge into one descendent vessel. At diverging bifurcations, a cell partitioning law is required to account for the nonuniform distribution of red blood cells as a function of the flow rate of blood into each descendent vessel. A linearization of the governing equations produces a system of delay differential equations involving the discharge hematocrit entering each network vessel and leads to a nonlinear eigenvalue problem. All eigenvalues in a specified region of the complex plane are captured using a transformation based on contour integrals to construct a linear eigenvalue problem with identical eigenvalues, which are then determined using a standard QR algorithm. The predicted value of the dimensionless exponent in the cell partitioning law at the instability threshold corresponds to a supercritical Hopf bifurcation in numerical simulations of the equations governing unsteady blood flow. Excellent agreement is found between the predictions of the linear stability analysis and nonlinear simulations. The relaxation of the assumption of plug flow made in previous stability analyses typically has a small, quantitative effect on the stability results that depends on the specific network structure. This implementation of the stability analysis can be applied to large networks with arbitrary structure provided only that the connectivity among the network segments is known.

Phase-synchronisation in continuous flow models of production networks

NASA Astrophysics Data System (ADS)

Scholz-Reiter, Bernd; Tervo, Jan Topi; Freitag, Michael

2006-04-01

To improve their position at the market, many companies concentrate on their core competences and hence cooperate with suppliers and distributors. Thus, between many independent companies strong linkages develop and production and logistics networks emerge. These networks are characterised by permanently increasing complexity, and are nowadays forced to adapt to dynamically changing markets. This factor complicates an enterprise-spreading production planning and control enormously. Therefore, a continuous flow model for production networks will be derived regarding these special logistic problems. Furthermore, phase-synchronisation effects will be presented and their dependencies to the set of network parameters will be investigated.

Scaling of peak flows with constant flow velocity in random self-similar networks

USGS Publications Warehouse

Troutman, Brent M.; Mantilla, Ricardo; Gupta, Vijay K.

2011-01-01

A methodology is presented to understand the role of the statistical self-similar topology of real river networks on scaling, or power law, in peak flows for rainfall-runoff events. We created Monte Carlo generated sets of ensembles of 1000 random self-similar networks (RSNs) with geometrically distributed interior and exterior generators having parameters pi and pe, respectively. The parameter values were chosen to replicate the observed topology of real river networks. We calculated flow hydrographs in each of these networks by numerically solving the link-based mass and momentum conservation equation under the assumption of constant flow velocity. From these simulated RSNs and hydrographs, the scaling exponents β and φ characterizing power laws with respect to drainage area, and corresponding to the width functions and flow hydrographs respectively, were estimated. We found that, in general, φ > β, which supports a similar finding first reported for simulations in the river network of the Walnut Gulch basin, Arizona. Theoretical estimation of β and φ in RSNs is a complex open problem. Therefore, using results for a simpler problem associated with the expected width function and expected hydrograph for an ensemble of RSNs, we give heuristic arguments for theoretical derivations of the scaling exponents β(E) and φ(E) that depend on the Horton ratios for stream lengths and areas. These ratios in turn have a known dependence on the parameters of the geometric distributions of RSN generators. Good agreement was found between the analytically conjectured values of β(E) and φ(E) and the values estimated by the simulated ensembles of RSNs and hydrographs. The independence of the scaling exponents φ(E) and φ with respect to the value of flow velocity and runoff intensity implies an interesting connection between unit hydrograph theory and flow dynamics. Our results provide a reference framework to study scaling exponents under more complex scenarios of flow dynamics and runoff generation processes using ensembles of RSNs.

Performance Evaluation of FAST TCP Traffic-Flows in Multihomed MANETs

NASA Astrophysics Data System (ADS)

Mudassir, Mumajjed Ul; Akram, Adeel

In Mobile Ad hoc Networks (MANETs) an efficient communication protocol is required at the transport layer. Mobile nodes moving around will have temporary and rather short-lived connectivity with each other and the Internet, thus requiring efficient utilization of network resources. Moreover the problems arising due to high mobility, collision and congestion must also be considered. Multihoming allows higher reliability and enhancement of network throughput. FAST TCP is a new promising transport layer protocol developed for high-speed high-latency networks. In this paper, we have analyzed the performance of FAST TCP traffic flows in multihomed MANETs and compared it with standard TCP (TCP Reno) traffic flows in non-multihomed MANETs.

High-resolution method for evolving complex interface networks

NASA Astrophysics Data System (ADS)

Pan, Shucheng; Hu, Xiangyu Y.; Adams, Nikolaus A.

2018-04-01

In this paper we describe a high-resolution transport formulation of the regional level-set approach for an improved prediction of the evolution of complex interface networks. The novelty of this method is twofold: (i) construction of local level sets and reconstruction of a global level set, (ii) local transport of the interface network by employing high-order spatial discretization schemes for improved representation of complex topologies. Various numerical test cases of multi-region flow problems, including triple-point advection, single vortex flow, mean curvature flow, normal driven flow, dry foam dynamics and shock-bubble interaction show that the method is accurate and suitable for a wide range of complex interface-network evolutions. Its overall computational cost is comparable to the Semi-Lagrangian regional level-set method while the prediction accuracy is significantly improved. The approach thus offers a viable alternative to previous interface-network level-set method.

Tracking trade transactions in water resource systems: A node-arc optimization formulation

NASA Astrophysics Data System (ADS)

Erfani, Tohid; Huskova, Ivana; Harou, Julien J.

2013-05-01

We formulate and apply a multicommodity network flow node-arc optimization model capable of tracking trade transactions in complex water resource systems. The model uses a simple node to node network connectivity matrix and does not require preprocessing of all possible flow paths in the network. We compare the proposed node-arc formulation with an existing arc-path (flow path) formulation and explain the advantages and difficulties of both approaches. We verify the proposed formulation model on a hypothetical water distribution network. Results indicate the arc-path model solves the problem with fewer constraints, but the proposed formulation allows using a simple network connectivity matrix which simplifies modeling large or complex networks. The proposed algorithm allows converting existing node-arc hydroeconomic models that broadly represent water trading to ones that also track individual supplier-receiver relationships (trade transactions).

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks.

PubMed

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.

Routing Algorithm based on Minimum Spanning Tree and Minimum Cost Flow for Hybrid Wireless-optical Broadband Access Network

NASA Astrophysics Data System (ADS)

Le, Zichun; Suo, Kaihua; Fu, Minglei; Jiang, Ling; Dong, Wen

2012-03-01

In order to minimize the average end to end delay for data transporting in hybrid wireless optical broadband access network, a novel routing algorithm named MSTMCF (minimum spanning tree and minimum cost flow) is devised. The routing problem is described as a minimum spanning tree and minimum cost flow model and corresponding algorithm procedures are given. To verify the effectiveness of MSTMCF algorithm, extensively simulations based on OWNS have been done under different types of traffic source.

Using Inspiration from Synaptic Plasticity Rules to Optimize Traffic Flow in Distributed Engineered Networks.

PubMed

Suen, Jonathan Y; Navlakha, Saket

2017-05-01

Controlling the flow and routing of data is a fundamental problem in many distributed networks, including transportation systems, integrated circuits, and the Internet. In the brain, synaptic plasticity rules have been discovered that regulate network activity in response to environmental inputs, which enable circuits to be stable yet flexible. Here, we develop a new neuro-inspired model for network flow control that depends only on modifying edge weights in an activity-dependent manner. We show how two fundamental plasticity rules, long-term potentiation and long-term depression, can be cast as a distributed gradient descent algorithm for regulating traffic flow in engineered networks. We then characterize, both by simulation and analytically, how different forms of edge-weight-update rules affect network routing efficiency and robustness. We find a close correspondence between certain classes of synaptic weight update rules derived experimentally in the brain and rules commonly used in engineering, suggesting common principles to both.

Constraints of nonresponding flows based on cross layers in the networks

NASA Astrophysics Data System (ADS)

Zhou, Zhi-Chao; Xiao, Yang; Wang, Dong

2016-02-01

In the active queue management (AQM) scheme, core routers cannot manage and constrain user datagram protocol (UDP) data flows by the sliding window control mechanism in the transport layer due to the nonresponsive nature of such traffic flows. However, the UDP traffics occupy a large part of the network service nowadays which brings a great challenge to the stability of the more and more complex networks. To solve the uncontrollable problem, this paper proposes a cross layers random early detection (CLRED) scheme, which can control the nonresponding UDP-like flows rate effectively when congestion occurs in the access point (AP). The CLRED makes use of the MAC frame acknowledgement (ACK) transmitting congestion information to the sources nodes and utilizes the back-off windows of the MAC layer throttling data rate. Consequently, the UDP-like flows data rate can be restrained timely by the sources nodes in order to alleviate congestion in the complex networks. The proposed CLRED can constrain the nonresponsive flows availably and make the communication expedite, so that the network can sustain stable. The simulation results of network simulator-2 (NS2) verify the proposed CLRED scheme.

Rapid Calculation of Max-Min Fair Rates for Multi-Commodity Flows in Fat-Tree Networks

DOE PAGES

Mollah, Md Atiqul; Yuan, Xin; Pakin, Scott; ...

2017-08-29

Max-min fairness is often used in the performance modeling of interconnection networks. Existing methods to compute max-min fair rates for multi-commodity flows have high complexity and are computationally infeasible for large networks. In this paper, we show that by considering topological features, this problem can be solved efficiently for the fat-tree topology that is widely used in data centers and high performance compute clusters. Several efficient new algorithms are developed for this problem, including a parallel algorithm that can take advantage of multi-core and shared-memory architectures. Using these algorithms, we demonstrate that it is possible to find the max-min fairmore » rate allocation for multi-commodity flows in fat-tree networks that support tens of thousands of nodes. We evaluate the run-time performance of the proposed algorithms and show improvement in orders of magnitude over the previously best known method. Finally, we further demonstrate a new application of max-min fair rate allocation that is only computationally feasible using our new algorithms.« less

Rapid Calculation of Max-Min Fair Rates for Multi-Commodity Flows in Fat-Tree Networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Mollah, Md Atiqul; Yuan, Xin; Pakin, Scott

Max-min fairness is often used in the performance modeling of interconnection networks. Existing methods to compute max-min fair rates for multi-commodity flows have high complexity and are computationally infeasible for large networks. In this paper, we show that by considering topological features, this problem can be solved efficiently for the fat-tree topology that is widely used in data centers and high performance compute clusters. Several efficient new algorithms are developed for this problem, including a parallel algorithm that can take advantage of multi-core and shared-memory architectures. Using these algorithms, we demonstrate that it is possible to find the max-min fairmore » rate allocation for multi-commodity flows in fat-tree networks that support tens of thousands of nodes. We evaluate the run-time performance of the proposed algorithms and show improvement in orders of magnitude over the previously best known method. Finally, we further demonstrate a new application of max-min fair rate allocation that is only computationally feasible using our new algorithms.« less

A multiobjective optimization framework for multicontaminant industrial water network design.

PubMed

Boix, Marianne; Montastruc, Ludovic; Pibouleau, Luc; Azzaro-Pantel, Catherine; Domenech, Serge

2011-07-01

The optimal design of multicontaminant industrial water networks according to several objectives is carried out in this paper. The general formulation of the water allocation problem (WAP) is given as a set of nonlinear equations with binary variables representing the presence of interconnections in the network. For optimization purposes, three antagonist objectives are considered: F(1), the freshwater flow-rate at the network entrance, F(2), the water flow-rate at inlet of regeneration units, and F(3), the number of interconnections in the network. The multiobjective problem is solved via a lexicographic strategy, where a mixed-integer nonlinear programming (MINLP) procedure is used at each step. The approach is illustrated by a numerical example taken from the literature involving five processes, one regeneration unit and three contaminants. The set of potential network solutions is provided in the form of a Pareto front. Finally, the strategy for choosing the best network solution among those given by Pareto fronts is presented. This Multiple Criteria Decision Making (MCDM) problem is tackled by means of two approaches: a classical TOPSIS analysis is first implemented and then an innovative strategy based on the global equivalent cost (GEC) in freshwater that turns out to be more efficient for choosing a good network according to a practical point of view. Copyright © 2011 Elsevier Ltd. All rights reserved.

Quantum Max-flow/Min-cut

NASA Astrophysics Data System (ADS)

Cui, Shawn X.; Freedman, Michael H.; Sattath, Or; Stong, Richard; Minton, Greg

2016-06-01

The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integral capacity to each edge and a tensor to each vertex in a flow network, we can also interpret it as a tensor network and, more specifically, as a linear map from the input space to the output space. The quantum max-flow is defined to be the maximal rank of this linear map over all choices of tensors. The quantum min-cut is defined to be the minimum product of the capacities of edges over all cuts of the tensor network. We show that unlike the classical case, the quantum max-flow=min-cut conjecture is not true in general. Under certain conditions, e.g., when the capacity on each edge is some power of a fixed integer, the quantum max-flow is proved to equal the quantum min-cut. However, concrete examples are also provided where the equality does not hold. We also found connections of quantum max-flow/min-cut with entropy of entanglement and the quantum satisfiability problem. We speculate that the phenomena revealed may be of interest both in spin systems in condensed matter and in quantum gravity.

Stability and sensitivity of ABR flow control protocols

NASA Astrophysics Data System (ADS)

Tsai, Wie K.; Kim, Yuseok; Chiussi, Fabio; Toh, Chai-Keong

1998-10-01

This tutorial paper surveys the important issues in stability and sensitivity analysis of ABR flow control of ATM networks. THe stability and sensitivity issues are formulated in a systematic framework. Four main cause of instability in ABR flow control are identified: unstable control laws, temporal variations of available bandwidth with delayed feedback control, misbehaving components, and interactions between higher layer protocols and ABR flow control. Popular rate-based ABR flow control protocols are evaluated. Stability and sensitivity is shown to be the fundamental issues when the network has dynamically-varying bandwidth. Simulation result confirming the theoretical studies are provided. Open research problems are discussed.

Application of network methods for understanding evolutionary dynamics in discrete habitats.

PubMed

Greenbaum, Gili; Fefferman, Nina H

2017-06-01

In populations occupying discrete habitat patches, gene flow between habitat patches may form an intricate population structure. In such structures, the evolutionary dynamics resulting from interaction of gene-flow patterns with other evolutionary forces may be exceedingly complex. Several models describing gene flow between discrete habitat patches have been presented in the population-genetics literature; however, these models have usually addressed relatively simple settings of habitable patches and have stopped short of providing general methodologies for addressing nontrivial gene-flow patterns. In the last decades, network theory - a branch of discrete mathematics concerned with complex interactions between discrete elements - has been applied to address several problems in population genetics by modelling gene flow between habitat patches using networks. Here, we present the idea and concepts of modelling complex gene flows in discrete habitats using networks. Our goal is to raise awareness to existing network theory applications in molecular ecology studies, as well as to outline the current and potential contribution of network methods to the understanding of evolutionary dynamics in discrete habitats. We review the main branches of network theory that have been, or that we believe potentially could be, applied to population genetics and molecular ecology research. We address applications to theoretical modelling and to empirical population-genetic studies, and we highlight future directions for extending the integration of network science with molecular ecology. © 2017 John Wiley & Sons Ltd.

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks

PubMed Central

Chen, Huan; Li, Lemin; Ren, Jing; Wang, Yang; Zhao, Yangming; Wang, Xiong; Wang, Sheng; Xu, Shizhong

2015-01-01

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme. PMID:26690571

Recurrence networks from multivariate signals for uncovering dynamic transitions of horizontal oil-water stratified flows

NASA Astrophysics Data System (ADS)

Gao, Zhong-Ke; Zhang, Xin-Wang; Jin, Ning-De; Donner, Reik V.; Marwan, Norbert; Kurths, Jürgen

2013-09-01

Characterizing the mechanism of drop formation at the interface of horizontal oil-water stratified flows is a fundamental problem eliciting a great deal of attention from different disciplines. We experimentally and theoretically investigate the formation and transition of horizontal oil-water stratified flows. We design a new multi-sector conductance sensor and measure multivariate signals from two different stratified flow patterns. Using the Adaptive Optimal Kernel Time-Frequency Representation (AOK TFR) we first characterize the flow behavior from an energy and frequency point of view. Then, we infer multivariate recurrence networks from the experimental data and investigate the cross-transitivity for each constructed network. We find that the cross-transitivity allows quantitatively uncovering the flow behavior when the stratified flow evolves from a stable state to an unstable one and recovers deeper insights into the mechanism governing the formation of droplets at the interface of stratified flows, a task that existing methods based on AOK TFR fail to work. These findings present a first step towards an improved understanding of the dynamic mechanism leading to the transition of horizontal oil-water stratified flows from a complex-network perspective.

Uncovering the spatial structure of mobility networks

NASA Astrophysics Data System (ADS)

Louail, Thomas; Lenormand, Maxime; Picornell, Miguel; García Cantú, Oliva; Herranz, Ricardo; Frias-Martinez, Enrique; Ramasco, José J.; Barthelemy, Marc

2015-01-01

The extraction of a clear and simple footprint of the structure of large, weighted and directed networks is a general problem that has relevance for many applications. An important example is seen in origin-destination matrices, which contain the complete information on commuting flows, but are difficult to analyze and compare. We propose here a versatile method, which extracts a coarse-grained signature of mobility networks, under the form of a 2 × 2 matrix that separates the flows into four categories. We apply this method to origin-destination matrices extracted from mobile phone data recorded in 31 Spanish cities. We show that these cities essentially differ by their proportion of two types of flows: integrated (between residential and employment hotspots) and random flows, whose importance increases with city size. Finally, the method allows the determination of categories of networks, and in the mobility case, the classification of cities according to their commuting structure.

Load Forecasting Based Distribution System Network Reconfiguration -- A Distributed Data-Driven Approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jiang, Huaiguang; Zhang, Yingchen; Muljadi, Eduard

In this paper, a short-term load forecasting approach based network reconfiguration is proposed in a parallel manner. Specifically, a support vector regression (SVR) based short-term load forecasting approach is designed to provide an accurate load prediction and benefit the network reconfiguration. Because of the nonconvexity of the three-phase balanced optimal power flow, a second-order cone program (SOCP) based approach is used to relax the optimal power flow problem. Then, the alternating direction method of multipliers (ADMM) is used to compute the optimal power flow in distributed manner. Considering the limited number of the switches and the increasing computation capability, themore » proposed network reconfiguration is solved in a parallel way. The numerical results demonstrate the feasible and effectiveness of the proposed approach.« less

A Network Thermodynamic Approach to Compartmental Analysis

PubMed Central

Mikulecky, D. C.; Huf, E. G.; Thomas, S. R.

1979-01-01

We introduce a general network thermodynamic method for compartmental analysis which uses a compartmental model of sodium flows through frog skin as an illustrative example (Huf and Howell, 1974a). We use network thermodynamics (Mikulecky et al., 1977b) to formulate the problem, and a circuit simulation program (ASTEC 2, SPICE2, or PCAP) for computation. In this way, the compartment concentrations and net fluxes between compartments are readily obtained for a set of experimental conditions involving a square-wave pulse of labeled sodium at the outer surface of the skin. Qualitative features of the influx at the outer surface correlate very well with those observed for the short circuit current under another similar set of conditions by Morel and LeBlanc (1975). In related work, the compartmental model is used as a basis for simulation of the short circuit current and sodium flows simultaneously using a two-port network (Mikulecky et al., 1977a, and Mikulecky et al., A network thermodynamic model for short circuit current transients in frog skin. Manuscript in preparation; Gary-Bobo et al., 1978). The network approach lends itself to computation of classic compartmental problems in a simple manner using circuit simulation programs (Chua and Lin, 1975), and it further extends the compartmental models to more complicated situations involving coupled flows and non-linearities such as concentration dependencies, chemical reaction kinetics, etc. PMID:262387

Network thermodynamic approach compartmental analysis. Na+ transients in frog skin.

PubMed

Mikulecky, D C; Huf, E G; Thomas, S R

1979-01-01

We introduce a general network thermodynamic method for compartmental analysis which uses a compartmental model of sodium flows through frog skin as an illustrative example (Huf and Howell, 1974a). We use network thermodynamics (Mikulecky et al., 1977b) to formulate the problem, and a circuit simulation program (ASTEC 2, SPICE2, or PCAP) for computation. In this way, the compartment concentrations and net fluxes between compartments are readily obtained for a set of experimental conditions involving a square-wave pulse of labeled sodium at the outer surface of the skin. Qualitative features of the influx at the outer surface correlate very well with those observed for the short circuit current under another similar set of conditions by Morel and LeBlanc (1975). In related work, the compartmental model is used as a basis for simulation of the short circuit current and sodium flows simultaneously using a two-port network (Mikulecky et al., 1977a, and Mikulecky et al., A network thermodynamic model for short circuit current transients in frog skin. Manuscript in preparation; Gary-Bobo et al., 1978). The network approach lends itself to computation of classic compartmental problems in a simple manner using circuit simulation programs (Chua and Lin, 1975), and it further extends the compartmental models to more complicated situations involving coupled flows and non-linearities such as concentration dependencies, chemical reaction kinetics, etc.

Quantum Max-flow/Min-cut

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cui, Shawn X., E-mail: xingshan@math.ucsb.edu; Quantum Architectures and Computation Group, Microsoft Research, Redmond, Washington 98052; Freedman, Michael H., E-mail: michaelf@microsoft.com

2016-06-15

The classical max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integral capacity to each edge and a tensor to each vertex in a flow network, we can also interpret it as a tensor network and, more specifically, as a linear map from the input space to the output space. The quantum max-flow is defined to be the maximal rank of this linear map over all choices of tensors. The quantum min-cut is defined to be the minimum product of the capacities of edges over all cuts ofmore » the tensor network. We show that unlike the classical case, the quantum max-flow=min-cut conjecture is not true in general. Under certain conditions, e.g., when the capacity on each edge is some power of a fixed integer, the quantum max-flow is proved to equal the quantum min-cut. However, concrete examples are also provided where the equality does not hold. We also found connections of quantum max-flow/min-cut with entropy of entanglement and the quantum satisfiability problem. We speculate that the phenomena revealed may be of interest both in spin systems in condensed matter and in quantum gravity.« less

A Neural Network Aero Design System for Advanced Turbo-Engines

NASA Technical Reports Server (NTRS)

Sanz, Jose M.

1999-01-01

An inverse design method calculates the blade shape that produces a prescribed input pressure distribution. By controlling this input pressure distribution the aerodynamic design objectives can easily be met. Because of the intrinsic relationship between pressure distribution and airfoil physical properties, a Neural Network can be trained to choose the optimal pressure distribution that would meet a set of physical requirements. Neural network systems have been attempted in the context of direct design methods. From properties ascribed to a set of blades the neural network is trained to infer the properties of an 'interpolated' blade shape. The problem is that, especially in transonic regimes where we deal with intrinsically non linear and ill posed problems, small perturbations of the blade shape can produce very large variations of the flow parameters. It is very unlikely that, under these circumstances, a neural network will be able to find the proper solution. The unique situation in the present method is that the neural network can be trained to extract the required input pressure distribution from a database of pressure distributions while the inverse method will still compute the exact blade shape that corresponds to this 'interpolated' input pressure distribution. In other words, the interpolation process is transferred to a smoother problem, namely, finding what pressure distribution would produce the required flow conditions and, once this is done, the inverse method will compute the exact solution for this problem. The use of neural network is, in this context, highly related to the use of proper optimization techniques. The optimization is used essentially as an automation procedure to force the input pressure distributions to achieve the required aero and structural design parameters. A multilayered feed forward network with back-propagation is used to train the system for pattern association and classification.

Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows

PubMed Central

Wang, Di; Kleinberg, Robert D.

2009-01-01

Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C2, C3, C4,…. It is known that C2 can be computed by solving a maximum-flow problem, whereas the only previously known algorithms for computing Ck (k > 2) require solving a linear program. In this paper we prove that C3 can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0, 1}n, this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network. PMID:20161596

Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows.

PubMed

Wang, Di; Kleinberg, Robert D

2009-11-28

Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C(2), C(3), C(4),…. It is known that C(2) can be computed by solving a maximum-flow problem, whereas the only previously known algorithms for computing C(k) (k > 2) require solving a linear program. In this paper we prove that C(3) can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0, 1}(n), this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network.

Practical application of game theory based production flow planning method in virtual manufacturing networks

NASA Astrophysics Data System (ADS)

Olender, M.; Krenczyk, D.

2016-08-01

Modern enterprises have to react quickly to dynamic changes in the market, due to changing customer requirements and expectations. One of the key area of production management, that must continuously evolve by searching for new methods and tools for increasing the efficiency of manufacturing systems is the area of production flow planning and control. These aspects are closely connected with the ability to implement the concept of Virtual Enterprises (VE) and Virtual Manufacturing Network (VMN) in which integrated infrastructure of flexible resources are created. In the proposed approach, the players role perform the objects associated with the objective functions, allowing to solve the multiobjective production flow planning problems based on the game theory, which is based on the theory of the strategic situation. For defined production system and production order models ways of solving the problem of production route planning in VMN on computational examples for different variants of production flow is presented. Possible decision strategy to use together with an analysis of calculation results is shown.

Convex Relaxation of OPF in Multiphase Radial Networks with Wye and Delta Connections

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhao, Changhong; Dall-Anese, Emiliano; Low, Steven

2017-08-01

This panel presentation focuses on multiphase radial distribution networks with wye and delta connections, and proposes a semidefinite relaxation of the AC optimal power flow (OPF) problem. Two multiphase power flow models are developed to facilitate the integration of delta-connected loads or generation resources in the OPF problem. The first model is referred to as the extended branch flow model (EBFM). The second model leverages a linear relationship between phase-to-ground power injections and delta connections that holds under a balanced voltage approximation (BVA). Based on these models, pertinent OPF problems are formulated and relaxed to semidefinite programs (SDPs). Numerical studiesmore » on IEEE test feeders show that the proposed SDP relaxations can be solved efficiently by a generic optimization solver. Numerical evidence also indicates that solving the resultant SDP under BVA is faster than under EBFM. Moreover, both SDP solutions are numerically exact with respect to voltages and branch flows. It is further shown that the SDP solution under BVA has a small optimality gap, and the BVA model is accurate in the sense that it reproduces actual system voltages.« less

Application of artificial neural networks to identify equilibration in computer simulations

NASA Astrophysics Data System (ADS)

Leibowitz, Mitchell H.; Miller, Evan D.; Henry, Michael M.; Jankowski, Eric

2017-11-01

Determining which microstates generated by a thermodynamic simulation are representative of the ensemble for which sampling is desired is a ubiquitous, underspecified problem. Artificial neural networks are one type of machine learning algorithm that can provide a reproducible way to apply pattern recognition heuristics to underspecified problems. Here we use the open-source TensorFlow machine learning library and apply it to the problem of identifying which hypothetical observation sequences from a computer simulation are “equilibrated” and which are not. We generate training populations and test populations of observation sequences with embedded linear and exponential correlations. We train a two-neuron artificial network to distinguish the correlated and uncorrelated sequences. We find that this simple network is good enough for > 98% accuracy in identifying exponentially-decaying energy trajectories from molecular simulations.

Thermodynamics of random reaction networks.

PubMed

Fischer, Jakob; Kleidon, Axel; Dittrich, Peter

2015-01-01

Reaction networks are useful for analyzing reaction systems occurring in chemistry, systems biology, or Earth system science. Despite the importance of thermodynamic disequilibrium for many of those systems, the general thermodynamic properties of reaction networks are poorly understood. To circumvent the problem of sparse thermodynamic data, we generate artificial reaction networks and investigate their non-equilibrium steady state for various boundary fluxes. We generate linear and nonlinear networks using four different complex network models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz, Pan-Sinha) and compare their topological properties with real reaction networks. For similar boundary conditions the steady state flow through the linear networks is about one order of magnitude higher than the flow through comparable nonlinear networks. In all networks, the flow decreases with the distance between the inflow and outflow boundary species, with Watts-Strogatz networks showing a significantly smaller slope compared to the three other network types. The distribution of entropy production of the individual reactions inside the network follows a power law in the intermediate region with an exponent of circa -1.5 for linear and -1.66 for nonlinear networks. An elevated entropy production rate is found in reactions associated with weakly connected species. This effect is stronger in nonlinear networks than in the linear ones. Increasing the flow through the nonlinear networks also increases the number of cycles and leads to a narrower distribution of chemical potentials. We conclude that the relation between distribution of dissipation, network topology and strength of disequilibrium is nontrivial and can be studied systematically by artificial reaction networks.

Thermodynamics of Random Reaction Networks

PubMed Central

Fischer, Jakob; Kleidon, Axel; Dittrich, Peter

2015-01-01

Reaction networks are useful for analyzing reaction systems occurring in chemistry, systems biology, or Earth system science. Despite the importance of thermodynamic disequilibrium for many of those systems, the general thermodynamic properties of reaction networks are poorly understood. To circumvent the problem of sparse thermodynamic data, we generate artificial reaction networks and investigate their non-equilibrium steady state for various boundary fluxes. We generate linear and nonlinear networks using four different complex network models (Erdős-Rényi, Barabási-Albert, Watts-Strogatz, Pan-Sinha) and compare their topological properties with real reaction networks. For similar boundary conditions the steady state flow through the linear networks is about one order of magnitude higher than the flow through comparable nonlinear networks. In all networks, the flow decreases with the distance between the inflow and outflow boundary species, with Watts-Strogatz networks showing a significantly smaller slope compared to the three other network types. The distribution of entropy production of the individual reactions inside the network follows a power law in the intermediate region with an exponent of circa −1.5 for linear and −1.66 for nonlinear networks. An elevated entropy production rate is found in reactions associated with weakly connected species. This effect is stronger in nonlinear networks than in the linear ones. Increasing the flow through the nonlinear networks also increases the number of cycles and leads to a narrower distribution of chemical potentials. We conclude that the relation between distribution of dissipation, network topology and strength of disequilibrium is nontrivial and can be studied systematically by artificial reaction networks. PMID:25723751

Inclusion of tank configurations as a variable in the cost optimization of branched piped-water networks

NASA Astrophysics Data System (ADS)

Hooda, Nikhil; Damani, Om

2017-06-01

The classic problem of the capital cost optimization of branched piped networks consists of choosing pipe diameters for each pipe in the network from a discrete set of commercially available pipe diameters. Each pipe in the network can consist of multiple segments of differing diameters. Water networks also consist of intermediate tanks that act as buffers between incoming flow from the primary source and the outgoing flow to the demand nodes. The network from the primary source to the tanks is called the primary network, and the network from the tanks to the demand nodes is called the secondary network. During the design stage, the primary and secondary networks are optimized separately, with the tanks acting as demand nodes for the primary network. Typically the choice of tank locations, their elevations, and the set of demand nodes to be served by different tanks is manually made in an ad hoc fashion before any optimization is done. It is desirable therefore to include this tank configuration choice in the cost optimization process itself. In this work, we explain why the choice of tank configuration is important to the design of a network and describe an integer linear program model that integrates the tank configuration to the standard pipe diameter selection problem. In order to aid the designers of piped-water networks, the improved cost optimization formulation is incorporated into our existing network design system called JalTantra.

Teaching New Dogs Old Tricks.

ERIC Educational Resources Information Center

Goldberg, Judy Hiller; Laurin, Mark Alfred

For the new two-year college instructor, gaining information that specifically addresses his/her problems and concerns, and establishing the network to generate the flow of quality information can be a problem. How the instructor deals with this problem is a function of his/her stage of growth. In the neophyte stage, the new faculty member is…

An Airway Network Flow Assignment Approach Based on an Efficient Multiobjective Optimization Framework

PubMed Central

Zhang, Xuejun; Lei, Jiaxing

2015-01-01

Considering reducing the airspace congestion and the flight delay simultaneously, this paper formulates the airway network flow assignment (ANFA) problem as a multiobjective optimization model and presents a new multiobjective optimization framework to solve it. Firstly, an effective multi-island parallel evolution algorithm with multiple evolution populations is employed to improve the optimization capability. Secondly, the nondominated sorting genetic algorithm II is applied for each population. In addition, a cooperative coevolution algorithm is adapted to divide the ANFA problem into several low-dimensional biobjective optimization problems which are easier to deal with. Finally, in order to maintain the diversity of solutions and to avoid prematurity, a dynamic adjustment operator based on solution congestion degree is specifically designed for the ANFA problem. Simulation results using the real traffic data from China air route network and daily flight plans demonstrate that the proposed approach can improve the solution quality effectively, showing superiority to the existing approaches such as the multiobjective genetic algorithm, the well-known multiobjective evolutionary algorithm based on decomposition, and a cooperative coevolution multiobjective algorithm as well as other parallel evolution algorithms with different migration topology. PMID:26180840

Kleinberg Complex Networks

DTIC Science & Technology

2014-10-21

linear combinations of paths. This project featured research on two classes of routing problems , namely traveling salesman problems and multicommodity...flows. One highlight of this research was our discovery of a polynomial-time algorithm for the metric traveling salesman s-t path problem whose...metric TSP would resolve one of the most venerable open problems in the theory of approximation algorithms. Our research on traveling salesman

Graph Design via Convex Optimization: Online and Distributed Perspectives

NASA Astrophysics Data System (ADS)

Meng, De

Network and graph have long been natural abstraction of relations in a variety of applications, e.g. transportation, power system, social network, communication, electrical circuit, etc. As a large number of computation and optimization problems are naturally defined on graphs, graph structures not only enable important properties of these problems, but also leads to highly efficient distributed and online algorithms. For example, graph separability enables the parallelism for computation and operation as well as limits the size of local problems. More interestingly, graphs can be defined and constructed in order to take best advantage of those problem properties. This dissertation focuses on graph structure and design in newly proposed optimization problems, which establish a bridge between graph properties and optimization problem properties. We first study a new optimization problem called Geodesic Distance Maximization Problem (GDMP). Given a graph with fixed edge weights, finding the shortest path, also known as the geodesic, between two nodes is a well-studied network flow problem. We introduce the Geodesic Distance Maximization Problem (GDMP): the problem of finding the edge weights that maximize the length of the geodesic subject to convex constraints on the weights. We show that GDMP is a convex optimization problem for a wide class of flow costs, and provide a physical interpretation using the dual. We present applications of the GDMP in various fields, including optical lens design, network interdiction, and resource allocation in the control of forest fires. We develop an Alternating Direction Method of Multipliers (ADMM) by exploiting specific problem structures to solve large-scale GDMP, and demonstrate its effectiveness in numerical examples. We then turn our attention to distributed optimization on graph with only local communication. Distributed optimization arises in a variety of applications, e.g. distributed tracking and localization, estimation problems in sensor networks, multi-agent coordination. Distributed optimization aims to optimize a global objective function formed by summation of coupled local functions over a graph via only local communication and computation. We developed a weighted proximal ADMM for distributed optimization using graph structure. This fully distributed, single-loop algorithm allows simultaneous updates and can be viewed as a generalization of existing algorithms. More importantly, we achieve faster convergence by jointly designing graph weights and algorithm parameters. Finally, we propose a new problem on networks called Online Network Formation Problem: starting with a base graph and a set of candidate edges, at each round of the game, player one first chooses a candidate edge and reveals it to player two, then player two decides whether to accept it; player two can only accept limited number of edges and make online decisions with the goal to achieve the best properties of the synthesized network. The network properties considered include the number of spanning trees, algebraic connectivity and total effective resistance. These network formation games arise in a variety of cooperative multiagent systems. We propose a primal-dual algorithm framework for the general online network formation game, and analyze the algorithm performance by the competitive ratio and regret.

Flow Analysis Tool White Paper

NASA Technical Reports Server (NTRS)

Boscia, Nichole K.

2012-01-01

Faster networks are continually being built to accommodate larger data transfers. While it is intuitive to think that implementing faster networks will result in higher throughput rates, this is often not the case. There are many elements involved in data transfer, many of which are beyond the scope of the network itself. Although networks may get bigger and support faster technologies, the presence of other legacy components, such as older application software or kernel parameters, can often cause bottlenecks. Engineers must be able to identify when data flows are reaching a bottleneck that is not imposed by the network and then troubleshoot it using the tools available to them. The current best practice is to collect as much information as possible on the network traffic flows so that analysis is quick and easy. Unfortunately, no single method of collecting this information can sufficiently capture the whole endto- end picture. This becomes even more of a hurdle when large, multi-user systems are involved. In order to capture all the necessary information, multiple data sources are required. This paper presents a method for developing a flow analysis tool to effectively collect network flow data from multiple sources and provide that information to engineers in a clear, concise way for analysis. The purpose of this method is to collect enough information to quickly (and automatically) identify poorly performing flows along with the cause of the problem. The method involves the development of a set of database tables that can be populated with flow data from multiple sources, along with an easyto- use, web-based front-end interface to help network engineers access, organize, analyze, and manage all the information.

Acoustic emission data assisted process monitoring.

PubMed

Yen, Gary G; Lu, Haiming

2002-07-01

Gas-liquid two-phase flows are widely used in the chemical industry. Accurate measurements of flow parameters, such as flow regimes, are the key of operating efficiency. Due to the interface complexity of a two-phase flow, it is very difficult to monitor and distinguish flow regimes on-line and real time. In this paper we propose a cost-effective and computation-efficient acoustic emission (AE) detection system combined with artificial neural network technology to recognize four major patterns in an air-water vertical two-phase flow column. Several crucial AE parameters are explored and validated, and we found that the density of acoustic emission events and ring-down counts are two excellent indicators for the flow pattern recognition problems. Instead of the traditional Fair map, a hit-count map is developed and a multilayer Perceptron neural network is designed as a decision maker to describe an approximate transmission stage of a given two-phase flow system.

Social Network Analysis of the Farabi Exchange Program: Student Mobility

ERIC Educational Resources Information Center

Ugurlu, Zeynep

2016-01-01

Problem Statement: Exchange programs offer communication channels created through student and instructor exchanges; a flow of information takes place through these channels. The Farabi Exchange Program (FEP) is a student and instructor exchange program between institutions of higher education. Through the use of social network analysis and…

Tuning-free controller to accurately regulate flow rates in a microfluidic network

NASA Astrophysics Data System (ADS)

Heo, Young Jin; Kang, Junsu; Kim, Min Jun; Chung, Wan Kyun

2016-03-01

We describe a control algorithm that can improve accuracy and stability of flow regulation in a microfluidic network that uses a conventional pressure pump system. The algorithm enables simultaneous and independent control of fluid flows in multiple micro-channels of a microfluidic network, but does not require any model parameters or tuning process. We investigate robustness and optimality of the proposed control algorithm and those are verified by simulations and experiments. In addition, the control algorithm is compared with a conventional PID controller to show that the proposed control algorithm resolves critical problems induced by the PID control. The capability of the control algorithm can be used not only in high-precision flow regulation in the presence of disturbance, but in some useful functions for lab-on-a-chip devices such as regulation of volumetric flow rate, interface position control of two laminar flows, valveless flow switching, droplet generation and particle manipulation. We demonstrate those functions and also suggest further potential biological applications which can be accomplished by the proposed control framework.

Tuning-free controller to accurately regulate flow rates in a microfluidic network

PubMed Central

Heo, Young Jin; Kang, Junsu; Kim, Min Jun; Chung, Wan Kyun

2016-01-01

We describe a control algorithm that can improve accuracy and stability of flow regulation in a microfluidic network that uses a conventional pressure pump system. The algorithm enables simultaneous and independent control of fluid flows in multiple micro-channels of a microfluidic network, but does not require any model parameters or tuning process. We investigate robustness and optimality of the proposed control algorithm and those are verified by simulations and experiments. In addition, the control algorithm is compared with a conventional PID controller to show that the proposed control algorithm resolves critical problems induced by the PID control. The capability of the control algorithm can be used not only in high-precision flow regulation in the presence of disturbance, but in some useful functions for lab-on-a-chip devices such as regulation of volumetric flow rate, interface position control of two laminar flows, valveless flow switching, droplet generation and particle manipulation. We demonstrate those functions and also suggest further potential biological applications which can be accomplished by the proposed control framework. PMID:26987587

The modeling of attraction characteristics regarding passenger flow in urban rail transit network based on field theory

PubMed Central

Jia, Limin

2017-01-01

Aimed at the complicated problems of attraction characteristics regarding passenger flow in urban rail transit network, the concept of the gravity field of passenger flow is proposed in this paper. We establish the computation methods of field strength and potential energy to reveal the potential attraction relationship among stations from the perspective of the collection and distribution of passenger flow and the topology of network. As for the computation methods of field strength, an optimum path concept is proposed to define betweenness centrality parameter. Regarding the computation of potential energy, Compound Simpson’s Rule Formula is applied to get a solution to the function. Taking No. 10 Beijing Subway as a practical example, an analysis of simulation and verification is conducted, and the results shows in the following ways. Firstly, the bigger field strength value between two stations is, the stronger passenger flow attraction is, and the greater probability of the formation of the largest passenger flow of section is. Secondly, there is the greatest passenger flow volume and circulation capacity between two zones of high potential energy. PMID:28863175

Dynamic ADMM for Real-Time Optimal Power Flow

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall-Anese, Emiliano; Zhang, Yijian; Hong, Mingyi

This paper considers distribution networks featuring distributed energy resources (DERs), and develops a dynamic optimization method to maximize given operational objectives in real time while adhering to relevant network constraints. The design of the dynamic algorithm is based on suitable linearization of the AC power flow equations, and it leverages the so-called alternating direction method of multipliers (ADMM). The steps of the ADMM, however, are suitably modified to accommodate appropriate measurements from the distribution network and the DERs. With the aid of these measurements, the resultant algorithm can enforce given operational constraints in spite of inaccuracies in the representation ofmore » the AC power flows, and it avoids ubiquitous metering to gather the state of noncontrollable resources. Optimality and convergence of the proposed algorithm are established in terms of tracking of the solution of a convex surrogate of the AC optimal power flow problem.« less

Dynamic ADMM for Real-Time Optimal Power Flow: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall-Anese, Emiliano; Zhang, Yijian; Hong, Mingyi

This paper considers distribution networks featuring distributed energy resources (DERs), and develops a dynamic optimization method to maximize given operational objectives in real time while adhering to relevant network constraints. The design of the dynamic algorithm is based on suitable linearizations of the AC power flow equations, and it leverages the so-called alternating direction method of multipliers (ADMM). The steps of the ADMM, however, are suitably modified to accommodate appropriate measurements from the distribution network and the DERs. With the aid of these measurements, the resultant algorithm can enforce given operational constraints in spite of inaccuracies in the representation ofmore » the AC power flows, and it avoids ubiquitous metering to gather the state of non-controllable resources. Optimality and convergence of the propose algorithm are established in terms of tracking of the solution of a convex surrogate of the AC optimal power flow problem.« less

An exact algorithm for optimal MAE stack filter design.

PubMed

Dellamonica, Domingos; Silva, Paulo J S; Humes, Carlos; Hirata, Nina S T; Barrera, Junior

2007-02-01

We propose a new algorithm for optimal MAE stack filter design. It is based on three main ingredients. First, we show that the dual of the integer programming formulation of the filter design problem is a minimum cost network flow problem. Next, we present a decomposition principle that can be used to break this dual problem into smaller subproblems. Finally, we propose a specialization of the network Simplex algorithm based on column generation to solve these smaller subproblems. Using our method, we were able to efficiently solve instances of the filter problem with window size up to 25 pixels. To the best of our knowledge, this is the largest dimension for which this problem was ever solved exactly.

Cross-Layer Scheme to Control Contention Window for Per-Flow in Asymmetric Multi-Hop Networks

NASA Astrophysics Data System (ADS)

Giang, Pham Thanh; Nakagawa, Kenji

The IEEE 802.11 MAC standard for wireless ad hoc networks adopts Binary Exponential Back-off (BEB) mechanism to resolve bandwidth contention between stations. BEB mechanism controls the bandwidth allocation for each station by choosing a back-off value from one to CW according to the uniform random distribution, where CW is the contention window size. However, in asymmetric multi-hop networks, some stations are disadvantaged in opportunity of access to the shared channel and may suffer severe throughput degradation when the traffic load is large. Then, the network performance is degraded in terms of throughput and fairness. In this paper, we propose a new cross-layer scheme aiming to solve the per-flow unfairness problem and achieve good throughput performance in IEEE 802.11 multi-hop ad hoc networks. Our cross-layer scheme collects useful information from the physical, MAC and link layers of own station. This information is used to determine the optimal Contention Window (CW) size for per-station fairness. We also use this information to adjust CW size for each flow in the station in order to achieve per-flow fairness. Performance of our cross-layer scheme is examined on various asymmetric multi-hop network topologies by using Network Simulator (NS-2).

Network analysis applications in hydrology

NASA Astrophysics Data System (ADS)

Price, Katie

2017-04-01

Applied network theory has seen pronounced expansion in recent years, in fields such as epidemiology, computer science, and sociology. Concurrent development of analytical methods and frameworks has increased possibilities and tools available to researchers seeking to apply network theory to a variety of problems. While water and nutrient fluxes through stream systems clearly demonstrate a directional network structure, the hydrological applications of network theory remain under­explored. This presentation covers a review of network applications in hydrology, followed by an overview of promising network analytical tools that potentially offer new insights into conceptual modeling of hydrologic systems, identifying behavioral transition zones in stream networks and thresholds of dynamical system response. Network applications were tested along an urbanization gradient in Atlanta, Georgia, USA. Peachtree Creek and Proctor Creek. Peachtree Creek contains a nest of five long­term USGS streamflow and water quality gages, allowing network application of long­term flow statistics. The watershed spans a range of suburban and heavily urbanized conditions. Summary flow statistics and water quality metrics were analyzed using a suite of network analysis techniques, to test the conceptual modeling and predictive potential of the methodologies. Storm events and low flow dynamics during Summer 2016 were analyzed using multiple network approaches, with an emphasis on tomogravity methods. Results indicate that network theory approaches offer novel perspectives for understanding long­ term and event­based hydrological data. Key future directions for network applications include 1) optimizing data collection, 2) identifying "hotspots" of contaminant and overland flow influx to stream systems, 3) defining process domains, and 4) analyzing dynamic connectivity of various system components, including groundwater­surface water interactions.

Flow distribution in parallel microfluidic networks and its effect on concentration gradient

PubMed Central

Guermonprez, Cyprien; Michelin, Sébastien; Baroud, Charles N.

2015-01-01

The architecture of microfluidic networks can significantly impact the flow distribution within its different branches and thereby influence tracer transport within the network. In this paper, we study the flow rate distribution within a network of parallel microfluidic channels with a single input and single output, using a combination of theoretical modeling and microfluidic experiments. Within the ladder network, the flow rate distribution follows a U-shaped profile, with the highest flow rate occurring in the initial and final branches. The contrast with the central branches is controlled by a single dimensionless parameter, namely, the ratio of hydrodynamic resistance between the distribution channel and the side branches. This contrast in flow rates decreases when the resistance of the side branches increases relative to the resistance of the distribution channel. When the inlet flow is composed of two parallel streams, one of which transporting a diffusing species, a concentration variation is produced within the side branches of the network. The shape of this concentration gradient is fully determined by two dimensionless parameters: the ratio of resistances, which determines the flow rate distribution, and the Péclet number, which characterizes the relative speed of diffusion and advection. Depending on the values of these two control parameters, different distribution profiles can be obtained ranging from a flat profile to a step distribution of solute, with well-distributed gradients between these two limits. Our experimental results are in agreement with our numerical model predictions, based on a simplified 2D advection-diffusion problem. Finally, two possible applications of this work are presented: the first one combines the present design with self-digitization principle to encapsulate the controlled concentration in nanoliter chambers, while the second one extends the present design to create a continuous concentration gradient within an open flow chamber. PMID:26487905

Structure-preserving model reduction of large-scale logistics networks. Applications for supply chains

NASA Astrophysics Data System (ADS)

Scholz-Reiter, B.; Wirth, F.; Dashkovskiy, S.; Makuschewitz, T.; Schönlein, M.; Kosmykov, M.

2011-12-01

We investigate the problem of model reduction with a view to large-scale logistics networks, specifically supply chains. Such networks are modeled by means of graphs, which describe the structure of material flow. An aim of the proposed model reduction procedure is to preserve important features within the network. As a new methodology we introduce the LogRank as a measure for the importance of locations, which is based on the structure of the flows within the network. We argue that these properties reflect relative importance of locations. Based on the LogRank we identify subgraphs of the network that can be neglected or aggregated. The effect of this is discussed for a few motifs. Using this approach we present a meta algorithm for structure-preserving model reduction that can be adapted to different mathematical modeling frameworks. The capabilities of the approach are demonstrated with a test case, where a logistics network is modeled as a Jackson network, i.e., a particular type of queueing network.

Multi-agent coordination in directed moving neighbourhood random networks

NASA Astrophysics Data System (ADS)

Shang, Yi-Lun

2010-07-01

This paper considers the consensus problem of dynamical multiple agents that communicate via a directed moving neighbourhood random network. Each agent performs random walk on a weighted directed network. Agents interact with each other through random unidirectional information flow when they coincide in the underlying network at a given instant. For such a framework, we present sufficient conditions for almost sure asymptotic consensus. Numerical examples are taken to show the effectiveness of the obtained results.

An iteration algorithm for optimal network flows

NASA Astrophysics Data System (ADS)

Woong, C. J.

1983-09-01

A packet switching network has the desirable feature of rapidly handling short (bursty) messages of the type often found in computer communication systems. In evaluating packet switching networks, the average time delay per packet is one of the most important measures of performance. The problem of message routing to minimize time delay is analyzed here using two approaches, called "successive saturation' and "max-slack', for various traffic requirement matrices and networks with fixed topology and link capacities.

Topics on data transmission problem in software definition network

NASA Astrophysics Data System (ADS)

Gao, Wei; Liang, Li; Xu, Tianwei; Gan, Jianhou

2017-08-01

In normal computer networks, the data transmission between two sites go through the shortest path between two corresponding vertices. However, in the setting of software definition network (SDN), it should monitor the network traffic flow in each site and channel timely, and the data transmission path between two sites in SDN should consider the congestion in current networks. Hence, the difference of available data transmission theory between normal computer network and software definition network is that we should consider the prohibit graph structures in SDN, and these forbidden subgraphs represent the sites and channels in which data can't be passed by the serious congestion. Inspired by theoretical analysis of an available data transmission in SDN, we consider some computational problems from the perspective of the graph theory. Several results determined in the paper imply the sufficient conditions of data transmission in SDN in the various graph settings.

The Efficacy of International Regulation of Transborder Data Flows: The Case for the Clipper Chip.

ERIC Educational Resources Information Center

Mhlaba, Sondlo Leonard

1995-01-01

Discusses origins of Transborder Data Flows (TDFs) as an international problem in the early 1970s. Shows how technological development in telecommunications and networks has made regulation more complex and urgent. Recommends the internationalization of the Key Escrowed Encryption System (KEES) and the development of broad international TDF…

Equivalent Relaxations of Optimal Power Flow

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bose, S; Low, SH; Teeraratkul, T

2015-03-01

Several convex relaxations of the optimal power flow (OPF) problem have recently been developed using both bus injection models and branch flow models. In this paper, we prove relations among three convex relaxations: a semidefinite relaxation that computes a full matrix, a chordal relaxation based on a chordal extension of the network graph, and a second-order cone relaxation that computes the smallest partial matrix. We prove a bijection between the feasible sets of the OPF in the bus injection model and the branch flow model, establishing the equivalence of these two models and their second-order cone relaxations. Our results implymore » that, for radial networks, all these relaxations are equivalent and one should always solve the second-order cone relaxation. For mesh networks, the semidefinite relaxation and the chordal relaxation are equally tight and both are strictly tighter than the second-order cone relaxation. Therefore, for mesh networks, one should either solve the chordal relaxation or the SOCP relaxation, trading off tightness and the required computational effort. Simulations are used to illustrate these results.« less

Advances in optimal routing through computer networks

NASA Technical Reports Server (NTRS)

Paz, I. M.

1977-01-01

The optimal routing problem is defined. Progress in solving the problem during the previous decade is reviewed, with special emphasis on technical developments made during the last few years. The relationships between the routing, the throughput, and the switching technology used are discussed and their future trends are reviewed. Economic aspects are also briefly considered. Modern technical approaches for handling the routing problems and, more generally, the flow control problems are reviewed.

A comparative study of discrete fracture network and equivalent continuum models for simulating flow and transport in the far field of a hypothetical nuclear waste repository in crystalline host rock

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hadgu, Teklu; Karra, Satish; Kalinina, Elena

One of the major challenges of simulating flow and transport in the far field of a geologic repository in crystalline host rock is related to reproducing the properties of the fracture network over the large volume of rock with sparse fracture characterization data. Various approaches have been developed to simulate flow and transport through the fractured rock. The approaches can be broadly divided into Discrete Fracture Network (DFN) and Equivalent Continuum Model (ECM). The DFN explicitly represents individual fractures, while the ECM uses fracture properties to determine equivalent continuum parameters. In this paper, we compare DFN and ECM in termsmore » of upscaled observed transport properties through generic fracture networks. The major effort was directed on making the DFN and ECM approaches similar in their conceptual representations. This allows for separating differences related to the interpretation of the test conditions and parameters from the differences between the DFN and ECM approaches. The two models are compared using a benchmark test problem that is constructed to represent the far field (1 × 1 × 1 km 3) of a hypothetical repository in fractured crystalline rock. The test problem setting uses generic fracture properties that can be expected in crystalline rocks. The models are compared in terms of the: 1) effective permeability of the domain, and 2) nonreactive solute breakthrough curves through the domain. The principal differences between the models are mesh size, network connectivity, matrix diffusion and anisotropy. We demonstrate how these differences affect the flow and transport. Finally, we identify the factors that should be taken in consideration when selecting an approach most suitable for the site-specific conditions.« less

A comparative study of discrete fracture network and equivalent continuum models for simulating flow and transport in the far field of a hypothetical nuclear waste repository in crystalline host rock

DOE PAGES

Hadgu, Teklu; Karra, Satish; Kalinina, Elena; ...

2017-07-28

One of the major challenges of simulating flow and transport in the far field of a geologic repository in crystalline host rock is related to reproducing the properties of the fracture network over the large volume of rock with sparse fracture characterization data. Various approaches have been developed to simulate flow and transport through the fractured rock. The approaches can be broadly divided into Discrete Fracture Network (DFN) and Equivalent Continuum Model (ECM). The DFN explicitly represents individual fractures, while the ECM uses fracture properties to determine equivalent continuum parameters. In this paper, we compare DFN and ECM in termsmore » of upscaled observed transport properties through generic fracture networks. The major effort was directed on making the DFN and ECM approaches similar in their conceptual representations. This allows for separating differences related to the interpretation of the test conditions and parameters from the differences between the DFN and ECM approaches. The two models are compared using a benchmark test problem that is constructed to represent the far field (1 × 1 × 1 km 3) of a hypothetical repository in fractured crystalline rock. The test problem setting uses generic fracture properties that can be expected in crystalline rocks. The models are compared in terms of the: 1) effective permeability of the domain, and 2) nonreactive solute breakthrough curves through the domain. The principal differences between the models are mesh size, network connectivity, matrix diffusion and anisotropy. We demonstrate how these differences affect the flow and transport. Finally, we identify the factors that should be taken in consideration when selecting an approach most suitable for the site-specific conditions.« less

A comparative study of discrete fracture network and equivalent continuum models for simulating flow and transport in the far field of a hypothetical nuclear waste repository in crystalline host rock

NASA Astrophysics Data System (ADS)

Hadgu, Teklu; Karra, Satish; Kalinina, Elena; Makedonska, Nataliia; Hyman, Jeffrey D.; Klise, Katherine; Viswanathan, Hari S.; Wang, Yifeng

2017-10-01

One of the major challenges of simulating flow and transport in the far field of a geologic repository in crystalline host rock is related to reproducing the properties of the fracture network over the large volume of rock with sparse fracture characterization data. Various approaches have been developed to simulate flow and transport through the fractured rock. The approaches can be broadly divided into Discrete Fracture Network (DFN) and Equivalent Continuum Model (ECM). The DFN explicitly represents individual fractures, while the ECM uses fracture properties to determine equivalent continuum parameters. We compare DFN and ECM in terms of upscaled observed transport properties through generic fracture networks. The major effort was directed on making the DFN and ECM approaches similar in their conceptual representations. This allows for separating differences related to the interpretation of the test conditions and parameters from the differences between the DFN and ECM approaches. The two models are compared using a benchmark test problem that is constructed to represent the far field (1 × 1 × 1 km3) of a hypothetical repository in fractured crystalline rock. The test problem setting uses generic fracture properties that can be expected in crystalline rocks. The models are compared in terms of the: 1) effective permeability of the domain, and 2) nonreactive solute breakthrough curves through the domain. The principal differences between the models are mesh size, network connectivity, matrix diffusion and anisotropy. We demonstrate how these differences affect the flow and transport. We identify the factors that should be taken in consideration when selecting an approach most suitable for the site-specific conditions.

Parallel ALLSPD-3D: Speeding Up Combustor Analysis Via Parallel Processing

NASA Technical Reports Server (NTRS)

Fricker, David M.

1997-01-01

The ALLSPD-3D Computational Fluid Dynamics code for reacting flow simulation was run on a set of benchmark test cases to determine its parallel efficiency. These test cases included non-reacting and reacting flow simulations with varying numbers of processors. Also, the tests explored the effects of scaling the simulation with the number of processors in addition to distributing a constant size problem over an increasing number of processors. The test cases were run on a cluster of IBM RS/6000 Model 590 workstations with ethernet and ATM networking plus a shared memory SGI Power Challenge L workstation. The results indicate that the network capabilities significantly influence the parallel efficiency, i.e., a shared memory machine is fastest and ATM networking provides acceptable performance. The limitations of ethernet greatly hamper the rapid calculation of flows using ALLSPD-3D.

Network reliability maximization for stochastic-flow network subject to correlated failures using genetic algorithm and tabu\\xA0search

NASA Astrophysics Data System (ADS)

Yeh, Cheng-Ta; Lin, Yi-Kuei; Yang, Jo-Yun

2018-07-01

Network reliability is an important performance index for many real-life systems, such as electric power systems, computer systems and transportation systems. These systems can be modelled as stochastic-flow networks (SFNs) composed of arcs and nodes. Most system supervisors respect the network reliability maximization by finding the optimal multi-state resource assignment, which is one resource to each arc. However, a disaster may cause correlated failures for the assigned resources, affecting the network reliability. This article focuses on determining the optimal resource assignment with maximal network reliability for SFNs. To solve the problem, this study proposes a hybrid algorithm integrating the genetic algorithm and tabu search to determine the optimal assignment, called the hybrid GA-TS algorithm (HGTA), and integrates minimal paths, recursive sum of disjoint products and the correlated binomial distribution to calculate network reliability. Several practical numerical experiments are adopted to demonstrate that HGTA has better computational quality than several popular soft computing algorithms.

Acoustic modes in fluid networks

NASA Technical Reports Server (NTRS)

Michalopoulos, C. D.; Clark, Robert W., Jr.; Doiron, Harold H.

1992-01-01

Pressure and flow rate eigenvalue problems for one-dimensional flow of a fluid in a network of pipes are derived from the familiar transmission line equations. These equations are linearized by assuming small velocity and pressure oscillations about mean flow conditions. It is shown that the flow rate eigenvalues are the same as the pressure eigenvalues and the relationship between line pressure modes and flow rate modes is established. A volume at the end of each branch is employed which allows any combination of boundary conditions, from open to closed, to be used. The Jacobi iterative method is used to compute undamped natural frequencies and associated pressure/flow modes. Several numerical examples are presented which include acoustic modes for the Helium Supply System of the Space Shuttle Orbiter Main Propulsion System. It should be noted that the method presented herein can be applied to any one-dimensional acoustic system involving an arbitrary number of branches.

Sensitivity Analysis of Genetic Algorithm Parameters for Optimal Groundwater Monitoring Network Design

NASA Astrophysics Data System (ADS)

Abdeh-Kolahchi, A.; Satish, M.; Datta, B.

2004-05-01

A state art groundwater monitoring network design is introduced. The method combines groundwater flow and transport results with optimization Genetic Algorithm (GA) to identify optimal monitoring well locations. Optimization theory uses different techniques to find a set of parameter values that minimize or maximize objective functions. The suggested groundwater optimal monitoring network design is based on the objective of maximizing the probability of tracking a transient contamination plume by determining sequential monitoring locations. The MODFLOW and MT3DMS models included as separate modules within the Groundwater Modeling System (GMS) are used to develop three dimensional groundwater flow and contamination transport simulation. The groundwater flow and contamination simulation results are introduced as input to the optimization model, using Genetic Algorithm (GA) to identify the groundwater optimal monitoring network design, based on several candidate monitoring locations. The groundwater monitoring network design model is used Genetic Algorithms with binary variables representing potential monitoring location. As the number of decision variables and constraints increase, the non-linearity of the objective function also increases which make difficulty to obtain optimal solutions. The genetic algorithm is an evolutionary global optimization technique, which is capable of finding the optimal solution for many complex problems. In this study, the GA approach capable of finding the global optimal solution to a groundwater monitoring network design problem involving 18.4X 1018 feasible solutions will be discussed. However, to ensure the efficiency of the solution process and global optimality of the solution obtained using GA, it is necessary that appropriate GA parameter values be specified. The sensitivity analysis of genetic algorithms parameters such as random number, crossover probability, mutation probability, and elitism are discussed for solution of monitoring network design.

Regulation of Dynamical Systems to Optimal Solutions of Semidefinite Programs: Algorithms and Applications to AC Optimal Power Flow

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall'Anese, Emiliano; Dhople, Sairaj V.; Giannakis, Georgios B.

2015-07-01

This paper considers a collection of networked nonlinear dynamical systems, and addresses the synthesis of feedback controllers that seek optimal operating points corresponding to the solution of pertinent network-wide optimization problems. Particular emphasis is placed on the solution of semidefinite programs (SDPs). The design of the feedback controller is grounded on a dual e-subgradient approach, with the dual iterates utilized to dynamically update the dynamical-system reference signals. Global convergence is guaranteed for diminishing stepsize rules, even when the reference inputs are updated at a faster rate than the dynamical-system settling time. The application of the proposed framework to the controlmore » of power-electronic inverters in AC distribution systems is discussed. The objective is to bridge the time-scale separation between real-time inverter control and network-wide optimization. Optimization objectives assume the form of SDP relaxations of prototypical AC optimal power flow problems.« less

Design of Distributed Controllers Seeking Optimal Power Flow Solutions Under Communication Constraints

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall'Anese, Emiliano; Simonetto, Andrea; Dhople, Sairaj

This paper focuses on power distribution networks featuring inverter-interfaced distributed energy resources (DERs), and develops feedback controllers that drive the DER output powers to solutions of time-varying AC optimal power flow (OPF) problems. Control synthesis is grounded on primal-dual-type methods for regularized Lagrangian functions, as well as linear approximations of the AC power-flow equations. Convergence and OPF-solution-tracking capabilities are established while acknowledging: i) communication-packet losses, and ii) partial updates of control signals. The latter case is particularly relevant since it enables asynchronous operation of the controllers where DER setpoints are updated at a fast time scale based on local voltagemore » measurements, and information on the network state is utilized if and when available, based on communication constraints. As an application, the paper considers distribution systems with high photovoltaic integration, and demonstrates that the proposed framework provides fast voltage-regulation capabilities, while enabling the near real-time pursuit of solutions of AC OPF problems.« less

Design of Distributed Controllers Seeking Optimal Power Flow Solutions under Communication Constraints: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall'Anese, Emiliano; Simonetto, Andrea; Dhople, Sairaj

This paper focuses on power distribution networks featuring inverter-interfaced distributed energy resources (DERs), and develops feedback controllers that drive the DER output powers to solutions of time-varying AC optimal power flow (OPF) problems. Control synthesis is grounded on primal-dual-type methods for regularized Lagrangian functions, as well as linear approximations of the AC power-flow equations. Convergence and OPF-solution-tracking capabilities are established while acknowledging: i) communication-packet losses, and ii) partial updates of control signals. The latter case is particularly relevant since it enables asynchronous operation of the controllers where DER setpoints are updated at a fast time scale based on local voltagemore » measurements, and information on the network state is utilized if and when available, based on communication constraints. As an application, the paper considers distribution systems with high photovoltaic integration, and demonstrates that the proposed framework provides fast voltage-regulation capabilities, while enabling the near real-time pursuit of solutions of AC OPF problems.« less

Sustainable Improvement of Urban River Network Water Quality and Flood Control Capacity by a Hydrodynamic Control Approach-Case Study of Changshu City

NASA Astrophysics Data System (ADS)

Xie, Chen; Yang, Fan; Liu, Guoqing; Liu, Yang; Wang, Long; Fan, Ziwu

2017-01-01

Water environment of urban rivers suffers degradation with the impacts of urban expansion, especially in Yangtze River Delta. The water area in cites decreased sharply, and some rivers were cut off because of estate development, which brings the problems of urban flooding, flow stagnation and water deterioration. The approach aims to enhance flood control capability and improve the urban river water quality by planning gate-pump stations surrounding the cities and optimizing the locations and functions of the pumps, sluice gates, weirs in the urban river network. These gate-pump stations together with the sluice gates and weirs guarantee the ability to control the water level in the rivers and creating hydraulic gradient artificially according to mathematical model. Therefore the flow velocity increases, which increases the rate of water exchange, the DO concentration and water body self-purification ability. By site survey and prototype measurement, the river problems are evaluated and basic data are collected. The hydrodynamic model of the river network is established and calibrated to simulate the scenarios. The schemes of water quality improvement, including optimizing layout of the water distribution projects, improvement of the flow discharge in the river network and planning the drainage capacity are decided by comprehensive Analysis. Finally the paper introduces the case study of the approach in Changshu City, where the approach is successfully implemented.

Optimization Techniques for Clustering,Connectivity, and Flow Problems in Complex Networks

DTIC Science & Technology

2012-10-01

discrete optimization and for analysis of performance of algorithm portfolios; introducing a metaheuristic framework of variable objective search that...The results of empirical evaluation of the proposed algorithm are also included. 1.3 Theoretical analysis of heuristics and designing new metaheuristic ...analysis of heuristics for inapproximable problems and designing new metaheuristic approaches for the problems of interest; (IV) Developing new models

A semi-automatic method for extracting thin line structures in images as rooted tree network

DOE Office of Scientific and Technical Information (OSTI.GOV)

Brazzini, Jacopo; Dillard, Scott; Soille, Pierre

2010-01-01

This paper addresses the problem of semi-automatic extraction of line networks in digital images - e.g., road or hydrographic networks in satellite images, blood vessels in medical images, robust. For that purpose, we improve a generic method derived from morphological and hydrological concepts and consisting in minimum cost path estimation and flow simulation. While this approach fully exploits the local contrast and shape of the network, as well as its arborescent nature, we further incorporate local directional information about the structures in the image. Namely, an appropriate anisotropic metric is designed by using both the characteristic features of the targetmore » network and the eigen-decomposition of the gradient structure tensor of the image. Following, the geodesic propagation from a given seed with this metric is combined with hydrological operators for overland flow simulation to extract the line network. The algorithm is demonstrated for the extraction of blood vessels in a retina image and of a river network in a satellite image.« less

Using genetic algorithms to determine near-optimal pricing, investment and operating strategies in the electric power industry

NASA Astrophysics Data System (ADS)

Wu, Dongjun

Network industries have technologies characterized by a spatial hierarchy, the "network," with capital-intensive interconnections and time-dependent, capacity-limited flows of products and services through the network to customers. This dissertation studies service pricing, investment and business operating strategies for the electric power network. First-best solutions for a variety of pricing and investment problems have been studied. The evaluation of genetic algorithms (GA, which are methods based on the idea of natural evolution) as a primary means of solving complicated network problems, both w.r.t. pricing: as well as w.r.t. investment and other operating decisions, has been conducted. New constraint-handling techniques in GAs have been studied and tested. The actual application of such constraint-handling techniques in solving practical non-linear optimization problems has been tested on several complex network design problems with encouraging initial results. Genetic algorithms provide solutions that are feasible and close to optimal when the optimal solution is know; in some instances, the near-optimal solutions for small problems by the proposed GA approach can only be tested by pushing the limits of currently available non-linear optimization software. The performance is far better than several commercially available GA programs, which are generally inadequate in solving any of the problems studied in this dissertation, primarily because of their poor handling of constraints. Genetic algorithms, if carefully designed, seem very promising in solving difficult problems which are intractable by traditional analytic methods.

Extracting spatial information from networks with low-order eigenvectors

NASA Astrophysics Data System (ADS)

Cucuringu, Mihai; Blondel, Vincent D.; Van Dooren, Paul

2013-03-01

We consider the problem of inferring meaningful spatial information in networks from incomplete information on the connection intensity between the nodes of the network. We consider two spatially distributed networks: a population migration flow network within the US, and a network of mobile phone calls between cities in Belgium. For both networks we use the eigenvectors of the Laplacian matrix constructed from the link intensities to obtain informative visualizations and capture natural geographical subdivisions. We observe that some low-order eigenvectors localize very well and seem to reveal small geographically cohesive regions that match remarkably well with political and administrative boundaries. We discuss possible explanations for this observation by describing diffusion maps and localized eigenfunctions. In addition, we discuss a possible connection with the weighted graph cut problem, and provide numerical evidence supporting the idea that lower-order eigenvectors point out local cuts in the network. However, we do not provide a formal and rigorous justification for our observations.

A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

NASA Technical Reports Server (NTRS)

Arneson, Heather M.; Dousse, Nicholas; Langbort, Cedric

2014-01-01

We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment.We address the problem of determining the routing of material between compartments to satisfy time-varying state constraints while ensuring that material reaches its intended destination over a finite time horizon. We give sufficient conditions for the existence of a time-varying state-dependent routing strategy which ensures that the closed-loop system satisfies basic network properties of positivity, conservation and interconnection while ensuring that capacity constraints are satisfied, when possible, or adjusted if a solution cannot be found. These conditions are formulated as a linear programming problem. Instances of this linear programming problem can be solved iteratively to generate a solution to the finite horizon routing problem. Results are given for the application of this control design method to an example problem. Key words: linear programming; control of networks; positive systems; controller constraints and structure.

The epidemic spreading model and the direction of information flow in brain networks.

PubMed

Meier, J; Zhou, X; Hillebrand, A; Tewarie, P; Stam, C J; Van Mieghem, P

2017-05-15

The interplay between structural connections and emerging information flow in the human brain remains an open research problem. A recent study observed global patterns of directional information flow in empirical data using the measure of transfer entropy. For higher frequency bands, the overall direction of information flow was from posterior to anterior regions whereas an anterior-to-posterior pattern was observed in lower frequency bands. In this study, we applied a simple Susceptible-Infected-Susceptible (SIS) epidemic spreading model on the human connectome with the aim to reveal the topological properties of the structural network that give rise to these global patterns. We found that direct structural connections induced higher transfer entropy between two brain regions and that transfer entropy decreased with increasing distance between nodes (in terms of hops in the structural network). Applying the SIS model, we were able to confirm the empirically observed opposite information flow patterns and posterior hubs in the structural network seem to play a dominant role in the network dynamics. For small time scales, when these hubs acted as strong receivers of information, the global pattern of information flow was in the posterior-to-anterior direction and in the opposite direction when they were strong senders. Our analysis suggests that these global patterns of directional information flow are the result of an unequal spatial distribution of the structural degree between posterior and anterior regions and their directions seem to be linked to different time scales of the spreading process. Copyright © 2017 Elsevier Inc. All rights reserved.

Finite volume solution for two-phase flow in a straight capillary

NASA Astrophysics Data System (ADS)

Yelkhovsky, Alexander; Pinczewski, W. Val

2018-04-01

The problem of two-phase flow in straight capillaries of polygonal cross section displays many of the dynamic characteristics of rapid interfacial motions associated with pore-scale displacements in porous media. Fluid inertia is known to be important in these displacements but is usually ignored in network models commonly used to predict macroscopic flow properties. This study presents a numerical model for two-phase flow which describes the spatial and temporal evolution of the interface between the fluids. The model is based on an averaged Navier-Stokes equation and is shown to be successful in predicting the complex dynamics of both capillary rise in round capillaries and imbibition along the corners of polygonal capillaries. The model can form the basis for more realistic network models which capture the effect of capillary, viscous, and inertial forces on pore-scale interfacial dynamics and consequent macroscopic flow properties.

Two-Phase Acto-Cytosolic Fluid Flow in a Moving Keratocyte: A 2D Continuum Model.

PubMed

Nikmaneshi, M R; Firoozabadi, B; Saidi, M S

2015-09-01

The F-actin network and cytosol in the lamellipodia of crawling cells flow in a centripetal pattern and spout-like form, respectively. We have numerically studied this two-phase flow in the realistic geometry of a moving keratocyte. Cytosol has been treated as a low viscosity Newtonian fluid flowing through the high viscosity porous medium of F-actin network. Other involved phenomena including myosin activity, adhesion friction, and interphase interaction are also discussed to provide an overall view of this problem. Adopting a two-phase coupled model by myosin concentration, we have found new accurate perspectives of acto-cytosolic flow and pressure fields, myosin distribution, as well as the distribution of effective forces across the lamellipodia of a keratocyte with stationary shape. The order of magnitude method is also used to determine the contribution of forces in the internal dynamics of lamellipodia.

GIS as a tool for efficient management of transport streams

NASA Astrophysics Data System (ADS)

Zatserkovnyi, V. I.; Kobrin, O. V.

2015-10-01

The transport network, which is an ideal object for the automation and the increase of efficiency using geographic information systems (GIS), is considered. The transport problems, which have a lot of mathematical models of the traffic flow for their solution, are enumerated. GIS analysis tools that allow one to build optimal routes in the real road network with its capabilities and limitations are presented. They can solve the extremely important problem of modern Ukraine - the rapid increase of the number of cars and the glut of road network vehicles. The intelligent transport systems, which are created and developed on the basis of GPS, GIS, modern communications and telecommunications facilities, are considered.

A feedback control model for network flow with multiple pure time delays

NASA Technical Reports Server (NTRS)

Press, J.

1972-01-01

A control model describing a network flow hindered by multiple pure time (or transport) delays is formulated. Feedbacks connect each desired output with a single control sector situated at the origin. The dynamic formulation invokes the use of differential difference equations. This causes the characteristic equation of the model to consist of transcendental functions instead of a common algebraic polynomial. A general graphical criterion is developed to evaluate the stability of such a problem. A digital computer simulation confirms the validity of such criterion. An optimal decision making process with multiple delays is presented.

Inverse problem and variation method to optimize cascade heat exchange network in central heating system

NASA Astrophysics Data System (ADS)

Zhang, Yin; Wei, Zhiyuan; Zhang, Yinping; Wang, Xin

2017-12-01

Urban heating in northern China accounts for 40% of total building energy usage. In central heating systems, heat is often transferred from heat source to users by the heat network where several heat exchangers are installed at heat source, substations and terminals respectively. For given overall heating capacity and heat source temperature, increasing the terminal fluid temperature is an effective way to improve the thermal performance of such cascade heat exchange network for energy saving. In this paper, the mathematical optimization model of the cascade heat exchange network with three-stage heat exchangers in series is established. Aim at maximizing the cold fluid temperature for given hot fluid temperature and overall heating capacity, the optimal heat exchange area distribution and the medium fluids' flow rates are determined through inverse problem and variation method. The preliminary results show that the heat exchange areas should be distributed equally for each heat exchanger. It also indicates that in order to improve the thermal performance of the whole system, more heat exchange areas should be allocated to the heat exchanger where flow rate difference between two fluids is relatively small. This work is important for guiding the optimization design of practical cascade heating systems.

Nonlinear relative-proportion-based route adjustment process for day-to-day traffic dynamics: modeling, equilibrium and stability analysis

NASA Astrophysics Data System (ADS)

Zhu, Wenlong; Ma, Shoufeng; Tian, Junfang; Li, Geng

2016-11-01

Travelers' route adjustment behaviors in a congested road traffic network are acknowledged as a dynamic game process between them. Existing Proportional-Switch Adjustment Process (PSAP) models have been extensively investigated to characterize travelers' route choice behaviors; PSAP has concise structure and intuitive behavior rule. Unfortunately most of which have some limitations, i.e., the flow over adjustment problem for the discrete PSAP model, the absolute cost differences route adjustment problem, etc. This paper proposes a relative-Proportion-based Route Adjustment Process (rePRAP) maintains the advantages of PSAP and overcomes these limitations. The rePRAP describes the situation that travelers on higher cost route switch to those with lower cost at the rate that is unilaterally depended on the relative cost differences between higher cost route and its alternatives. It is verified to be consistent with the principle of the rational behavior adjustment process. The equivalence among user equilibrium, stationary path flow pattern and stationary link flow pattern is established, which can be applied to judge whether a given network traffic flow has reached UE or not by detecting the stationary or non-stationary state of link flow pattern. The stability theorem is proved by the Lyapunov function approach. A simple example is tested to demonstrate the effectiveness of the rePRAP model.

Computing motion using resistive networks

NASA Technical Reports Server (NTRS)

Koch, Christof; Luo, Jin; Mead, Carver; Hutchinson, James

1988-01-01

Recent developments in the theory of early vision are described which lead from the formulation of the motion problem as an ill-posed one to its solution by minimizing certain 'cost' functions. These cost or energy functions can be mapped onto simple analog and digital resistive networks. It is shown how the optical flow can be computed by injecting currents into resistive networks and recording the resulting stationary voltage distribution at each node. These networks can be implemented in cMOS VLSI circuits and represent plausible candidates for biological vision systems.

A distributed approach to the OPF problem

NASA Astrophysics Data System (ADS)

Erseghe, Tomaso

2015-12-01

This paper presents a distributed approach to optimal power flow (OPF) in an electrical network, suitable for application in a future smart grid scenario where access to resource and control is decentralized. The non-convex OPF problem is solved by an augmented Lagrangian method, similar to the widely known ADMM algorithm, with the key distinction that penalty parameters are constantly increased. A (weak) assumption on local solver reliability is required to always ensure convergence. A certificate of convergence to a local optimum is available in the case of bounded penalty parameters. For moderate sized networks (up to 300 nodes, and even in the presence of a severe partition of the network), the approach guarantees a performance very close to the optimum, with an appreciably fast convergence speed. The generality of the approach makes it applicable to any (convex or non-convex) distributed optimization problem in networked form. In the comparison with the literature, mostly focused on convex SDP approximations, the chosen approach guarantees adherence to the reference problem, and it also requires a smaller local computational complexity effort.

Research on Segmentation Monitoring Control of IA-RWA Algorithm with Probe Flow

NASA Astrophysics Data System (ADS)

Ren, Danping; Guo, Kun; Yao, Qiuyan; Zhao, Jijun

2018-04-01

The impairment-aware routing and wavelength assignment algorithm with probe flow (P-IA-RWA) can make an accurate estimation for the transmission quality of the link when the connection request comes. But it also causes some problems. The probe flow data introduced in the P-IA-RWA algorithm can result in the competition for wavelength resources. In order to reduce the competition and the blocking probability of the network, a new P-IA-RWA algorithm with segmentation monitoring-control mechanism (SMC-P-IA-RWA) is proposed. The algorithm would reduce the holding time of network resources for the probe flow. It segments the candidate path suitably for the data transmitting. And the transmission quality of the probe flow sent by the source node will be monitored in the endpoint of each segment. The transmission quality of data can also be monitored, so as to make the appropriate treatment to avoid the unnecessary probe flow. The simulation results show that the proposed SMC-P-IA-RWA algorithm can effectively reduce the blocking probability. It brings a better solution to the competition for resources between the probe flow and the main data to be transferred. And it is more suitable for scheduling control in the large-scale network.

New Techniques for Deep Learning with Geospatial Data using TensorFlow, Earth Engine, and Google Cloud Platform

NASA Astrophysics Data System (ADS)

Hancher, M.

2017-12-01

Recent years have seen promising results from many research teams applying deep learning techniques to geospatial data processing. In that same timeframe, TensorFlow has emerged as the most popular framework for deep learning in general, and Google has assembled petabytes of Earth observation data from a wide variety of sources and made them available in analysis-ready form in the cloud through Google Earth Engine. Nevertheless, developing and applying deep learning to geospatial data at scale has been somewhat cumbersome to date. We present a new set of tools and techniques that simplify this process. Our approach combines the strengths of several underlying tools: TensorFlow for its expressive deep learning framework; Earth Engine for data management, preprocessing, postprocessing, and visualization; and other tools in Google Cloud Platform to train TensorFlow models at scale, perform additional custom parallel data processing, and drive the entire process from a single familiar Python development environment. These tools can be used to easily apply standard deep neural networks, convolutional neural networks, and other custom model architectures to a variety of geospatial data structures. We discuss our experiences applying these and related tools to a range of machine learning problems, including classic problems like cloud detection, building detection, land cover classification, as well as more novel problems like illegal fishing detection. Our improved tools will make it easier for geospatial data scientists to apply modern deep learning techniques to their own problems, and will also make it easier for machine learning researchers to advance the state of the art of those techniques.

An efective fractal-tree closure model for simulating blood flow in large arterial networks

PubMed Central

Perdikaris, Paris; Grinberg, Leopold; Karniadakis, George Em.

2014-01-01

The aim of the present work is to address the closure problem for hemodynamic simulations by developing a exible and effective model that accurately distributes flow in the downstream vasculature and can stably provide a physiological pressure out flow boundary condition. To achieve this goal, we model blood flow in the sub-pixel vasculature by using a non-linear 1D model in self-similar networks of compliant arteries that mimic the structure and hierarchy of vessels in the meso-vascular regime (radii 500 μm – 10 μm). We introduce a variable vessel length-to-radius ratio for small arteries and arterioles, while also addressing non-Newtonian blood rheology and arterial wall viscoelasticity effects in small arteries and arterioles. This methodology aims to overcome substantial cut-off radius sensitivities, typically arising in structured tree and linearized impedance models. The proposed model is not sensitive to out flow boundary conditions applied at the end points of the fractal network, and thus does not require calibration of resistance/capacitance parameters typically required for out flow conditions. The proposed model convergences to a periodic state in two cardiac cycles even when started from zero-flow initial conditions. The resulting fractal-trees typically consist of thousands to millions of arteries, posing the need for efficient parallel algorithms. To this end, we have scaled up a Discontinuous Galerkin solver that utilizes the MPI/OpenMP hybrid programming paradigm to thousands of computer cores, and can simulate blood flow in networks of millions of arterial segments at the rate of one cycle per 5 minutes. The proposed model has been extensively tested on a large and complex cranial network with 50 parent, patient-specific arteries and 21 outlets to which fractal trees where attached, resulting to a network of up to 4,392,484 vessels in total, and a detailed network of the arm with 276 parent arteries and 103 outlets (a total of 702,188 vessels after attaching the fractal trees), returning physiological flow and pressure wave predictions without requiring any parameter estimation or calibration procedures. We present a novel methodology to overcome substantial cut-off radius sensitivities PMID:25510364

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zamzam, Ahmed, S.; Zhaoy, Changhong; Dall'Anesey, Emiliano

This paper examines the AC Optimal Power Flow (OPF) problem for multiphase distribution networks featuring renewable energy resources (RESs). We start by outlining a power flow model for radial multiphase systems that accommodates wye-connected and delta-connected RESs and non-controllable energy assets. We then formalize an AC OPF problem that accounts for both types of connections. Similar to various AC OPF renditions, the resultant problem is a non convex quadratically-constrained quadratic program. However, the so-called Feasible Point Pursuit-Successive Convex Approximation algorithm is leveraged to obtain a feasible and yet locally-optimal solution. The merits of the proposed solution approach are demonstrated usingmore » two unbalanced multiphase distribution feeders with both wye and delta connections.« less

Models based on "out-of Kilter" algorithm

NASA Astrophysics Data System (ADS)

Adler, M. J.; Drobot, R.

2012-04-01

In case of many water users along the river stretches, it is very important, in case of low flows and droughty periods to develop an optimization model for water allocation, to cover all needs under certain predefined constraints, depending of the Contingency Plan for drought management. Such a program was developed during the implementation of the WATMAN Project, in Romania (WATMAN Project, 2005-2006, USTDA) for Arges-Dambovita-Ialomita Basins water transfers. This good practice was proposed for WATER CoRe Project- Good Practice Handbook for Drought Management, (InterregIVC, 2011), to be applied for the European Regions. Two types of simulation-optimization models based on an improved version of out-of-kilter algorithm as optimization technique have been developed and used in Romania: • models for founding of the short-term operation of a WMS, • models generically named SIMOPT that aim to the analysis of long-term WMS operation and have as the main results the statistical WMS functional parameters. A real WMS is modeled by an arcs-nodes network so the real WMS operation problem becomes a problem of flows in networks. The nodes and oriented arcs as well as their characteristics such as lower and upper limits and associated costs are the direct analog of the physical and operational WMS characteristics. Arcs represent both physical and conventional elements of WMS such as river branches, channels or pipes, water user demands or other water management requirements, trenches of water reservoirs volumes, water levels in channels or rivers, nodes are junctions of at least two arcs and stand for locations of lakes or water reservoirs and/or confluences of river branches, water withdrawal or wastewater discharge points, etc. Quantitative features of water resources, water users and water reservoirs or other water works are expressed as constraints of non-violating the lower and upper limits assigned on arcs. Options of WMS functioning i.e. water retention/discharge in/from the reservoirs or diversion of water from one part of WMS to the other in order to meet water demands as well as the water user economic benefit or loss related to the degree of water demand, are the defining elements of the objective function and are conventionally expressed by the means of costs attached to the arcs. The problem of optimizing the WMS operation is formulated like a flow in networks problem as following: to find the flow that minimize the cost in the whole network while meeting the constraints of continuity in nodes and the constraints of non-exceeding lower and upper flow limits on arcs. Conversion of WMS in the arcs-nodes network and the adequate choice of costs and limits on arcs are steps of a unitary process and depend on the goal of the respective model.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Burchett, Deon L.; Chen, Richard Li-Yang; Phillips, Cynthia A.

This report summarizes the work performed under the project project Next-Generation Algo- rithms for Assessing Infrastructure Vulnerability and Optimizing System Resilience. The goal of the project was to improve mathematical programming-based optimization technology for in- frastructure protection. In general, the owner of a network wishes to design a network a network that can perform well when certain transportation channels are inhibited (e.g. destroyed) by an adversary. These are typically bi-level problems where the owner designs a system, an adversary optimally attacks it, and then the owner can recover by optimally using the remaining network. This project funded three years ofmore » Deon Burchett's graduate research. Deon's graduate advisor, Professor Jean-Philippe Richard, and his Sandia advisors, Richard Chen and Cynthia Phillips, supported Deon on other funds or volunteer time. This report is, therefore. essentially a replication of the Ph.D. dissertation it funded [12] in a format required for project documentation. The thesis had some general polyhedral research. This is the study of the structure of the feasi- ble region of mathematical programs, such as integer programs. For example, an integer program optimizes a linear objective function subject to linear constraints, and (nonlinear) integrality con- straints on the variables. The feasible region without the integrality constraints is a convex polygon. Careful study of additional valid constraints can significantly improve computational performance. Here is the abstract from the dissertation: We perform a polyhedral study of a multi-commodity generalization of variable upper bound flow models. In particular, we establish some relations between facets of single- and multi- commodity models. We then introduce a new family of inequalities, which generalizes traditional flow cover inequalities to the multi-commodity context. We present encouraging numerical results. We also consider the directed edge-failure resilient network design problem (DRNDP). This problem entails the design of a directed multi-commodity flow network that is capable of fulfilling a specified percentage of demands in the event that any G arcs are destroyed, where G is a constant parameter. We present a formulation of DRNDP and solve it in a branch-column-cut framework. We present computational results.« less

Aiding USAF/UPT (Undergraduate Pilot Training) Aircrew Scheduling Using Network Flow Models.

DTIC Science & Technology

1986-06-01

51 3.4 Heuristic Modifications ............ 55 CHAPTER 4 STUDENT SCHEDULING PROBLEM (LEVEL 2) 4.0 Introduction 4.01 Constraints ............. 60 4.02...Covering" Complete Enumeration . . .. . 71 4.14 Heuristics . ............. 72 4.2 Heuristic Method for the Level 2 Problem 4.21 Step I ............... 73...4.22 Step 2 ............... 74 4.23 Advantages to the Heuristic Method. .... .. 78 4.24 Problems with the Heuristic Method. . ... 79 :,., . * CHAPTER5

Robust Distribution Network Reconfiguration

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Changhyeok; Liu, Cong; Mehrotra, Sanjay

2015-03-01

We propose a two-stage robust optimization model for the distribution network reconfiguration problem with load uncertainty. The first-stage decision is to configure the radial distribution network and the second-stage decision is to find the optimal a/c power flow of the reconfigured network for given demand realization. We solve the two-stage robust model by using a column-and-constraint generation algorithm, where the master problem and subproblem are formulated as mixed-integer second-order cone programs. Computational results for 16, 33, 70, and 94-bus test cases are reported. We find that the configuration from the robust model does not compromise much the power loss undermore » the nominal load scenario compared to the configuration from the deterministic model, yet it provides the reliability of the distribution system for all scenarios in the uncertainty set.« less

All-Optical Implementation of the Ant Colony Optimization Algorithm

PubMed Central

Hu, Wenchao; Wu, Kan; Shum, Perry Ping; Zheludev, Nikolay I.; Soci, Cesare

2016-01-01

We report all-optical implementation of the optimization algorithm for the famous “ant colony” problem. Ant colonies progressively optimize pathway to food discovered by one of the ants through identifying the discovered route with volatile chemicals (pheromones) secreted on the way back from the food deposit. Mathematically this is an important example of graph optimization problem with dynamically changing parameters. Using an optical network with nonlinear waveguides to represent the graph and a feedback loop, we experimentally show that photons traveling through the network behave like ants that dynamically modify the environment to find the shortest pathway to any chosen point in the graph. This proof-of-principle demonstration illustrates how transient nonlinearity in the optical system can be exploited to tackle complex optimization problems directly, on the hardware level, which may be used for self-routing of optical signals in transparent communication networks and energy flow in photonic systems. PMID:27222098

Protocol Support for a New Satellite-Based Airspace Communication Network

NASA Technical Reports Server (NTRS)

Shang, Yadong; Hadjitheodosiou, Michael; Baras, John

2004-01-01

We recommend suitable transport protocols for an aeronautical network supporting Internet and data services via satellite. We study the characteristics of an aeronautical satellite hybrid network and focus on the problems that cause dramatically degraded performance of the Transport Protocol. We discuss various extensions to standard TCP that alleviate some of these performance problems. Through simulation, we identify those TCP implementations that can be expected to perform well. Based on the observation that it is difficult for an end-to-end solution to solve these problems effectively, we propose a new TCP-splitting protocol, termed Aeronautical Transport Control Protocol (AeroTCP). The main idea of this protocol is to use a fixed window for flow control and one duplicated acknowledgement (ACK) for fast recovery. Our simulation results show that AeroTCP can maintain higher utilization for the satellite link than end-to-end TCP, especially in high BER environment.

Fixed Point Learning Based Intelligent Traffic Control System

NASA Astrophysics Data System (ADS)

Zongyao, Wang; Cong, Sui; Cheng, Shao

2017-10-01

Fixed point learning has become an important tool to analyse large scale distributed system such as urban traffic network. This paper presents a fixed point learning based intelligence traffic network control system. The system applies convergence property of fixed point theorem to optimize the traffic flow density. The intelligence traffic control system achieves maximum road resources usage by averaging traffic flow density among the traffic network. The intelligence traffic network control system is built based on decentralized structure and intelligence cooperation. No central control is needed to manage the system. The proposed system is simple, effective and feasible for practical use. The performance of the system is tested via theoretical proof and simulations. The results demonstrate that the system can effectively solve the traffic congestion problem and increase the vehicles average speed. It also proves that the system is flexible, reliable and feasible for practical use.

Entanglement branching operator

NASA Astrophysics Data System (ADS)

Harada, Kenji

2018-01-01

We introduce an entanglement branching operator to split a composite entanglement flow in a tensor network which is a promising theoretical tool for many-body systems. We can optimize an entanglement branching operator by solving a minimization problem based on squeezing operators. The entanglement branching is a new useful operation to manipulate a tensor network. For example, finding a particular entanglement structure by an entanglement branching operator, we can improve a higher-order tensor renormalization group method to catch a proper renormalization flow in a tensor network space. This new method yields a new type of tensor network states. The second example is a many-body decomposition of a tensor by using an entanglement branching operator. We can use it for a perfect disentangling among tensors. Applying a many-body decomposition recursively, we conceptually derive projected entangled pair states from quantum states that satisfy the area law of entanglement entropy.

Betweenness centrality and its applications from modeling traffic flows to network community detection

NASA Astrophysics Data System (ADS)

Ren, Yihui

As real-world complex networks are heterogeneous structures, not all their components such as nodes, edges and subgraphs carry the same role or importance in the functions performed by the networks: some elements are more critical than others. Understanding the roles of the components of a network is crucial for understanding the behavior of the network as a whole. One the most basic function of networks is transport; transport of vehicles/people, information, materials, forces, etc., and these quantities are transported along edges between source and destination nodes. For this reason, network path-based importance measures, also called centralities, play a crucial role in the understanding of the transport functions of the network and the network's structural and dynamical behavior in general. In this thesis we study the notion of betweenness centrality, which measures the fraction of lowest-cost (or shortest) paths running through a network component, in particular through a node or an edge. High betweenness centrality nodes/edges are those that will be frequently used by the entities transported through the network and thus they play a key role in the overall transport properties of the network. In the first part of the thesis we present a first-principles based method for traffic prediction using a cost-based generalization of the radiation model (emission/absorbtion model) for human mobility, coupled with a cost-minimizing algorithm for efficient distribution of the mobility fluxes through the network. Using US census and highway traffic data, we show that traffic can efficiently and accurately be computed from a range-limited, network betweenness type calculation. The model based on travel time costs captures the log-normal distribution of the traffic and attains a high Pearson correlation coefficient (0.75) when compared with real traffic. We then focus on studying the extent of changes in traffic flows in the wake of a localized damage or alteration to the network and we demonstrate that the changes can propagate globally, affecting traffic several hundreds of miles away. Because of its principled nature, this method can inform many applications related to human mobility driven flows in spatial networks, ranging from transportation, through urban planning to mitigation of the effects of catastrophic events. In the second part of the thesis we focus on network deconstruction and community detection problems, both intensely studied topics in network science, using a weighted betweenness centrality approach. We present an algorithm that solves both problems efficiently and accurately and demonstrate that on both benchmark networks and data networks.

A quasi steady state method for solving transient Darcy flow in complex 3D fractured networks accounting for matrix to fracture flow

NASA Astrophysics Data System (ADS)

Nœtinger, B.

2015-02-01

Modeling natural Discrete Fracture Networks (DFN) receives more and more attention in applied geosciences, from oil and gas industry, to geothermal recovery and aquifer management. The fractures may be either natural, or artificial in case of well stimulation. Accounting for the flow inside the fracture network, and accounting for the transfers between the matrix and the fractures, with the same level of accuracy is an important issue for calibrating the well architecture and for setting up optimal resources recovery strategies. Recently, we proposed an original method allowing to model transient pressure diffusion in the fracture network only [1]. The matrix was assumed to be impervious. A systematic approximation scheme was built, allowing to model the initial DFN by a set of N unknowns located at each identified intersection between fractures. The higher N, the higher the accuracy of the model. The main assumption was using a quasi steady state hypothesis, that states that the characteristic diffusion time over one single fracture is negligible compared with the characteristic time of the macroscopic problem, e.g. change of boundary conditions. In that context, the lowest order approximation N = 1 has the form of solving a transient problem in a resistor/capacitor network, a so-called pipe network. Its topology is the same as the network of geometrical intersections between fractures. In this paper, we generalize this approach in order to account for fluxes from matrix to fractures. The quasi steady state hypothesis at the fracture level is still kept. Then, we show that in the case of well separated time scales between matrix and fractures, the preceding model needs only to be slightly modified in order to incorporate these fluxes. The additional knowledge of the so-called matrix to fracture transfer function allows to modify the mass matrix that becomes a time convolution operator. This is reminiscent of existing space averaged transient dual porosity models.

Information flows in hierarchical networks and the capability of organizations to successfully respond to failures, crises, and disasters

NASA Astrophysics Data System (ADS)

Helbing, Dirk; Ammoser, Hendrik; Kühnert, Christian

2006-04-01

In this paper we discuss the problem of information losses in organizations and how they depend on the organization network structure. Hierarchical networks are an optimal organization structure only when the failure rate of nodes or links is negligible. Otherwise, redundant information links are important to reduce the risk of information losses and the related costs. However, as redundant information links are expensive, the optimal organization structure is not a fully connected one. It rather depends on the failure rate. We suggest that sidelinks and temporary, adaptive shortcuts can improve the information flows considerably by generating small-world effects. This calls for modified organization structures to cope with today's challenges of businesses and administrations, in particular, to successfully respond to crises or disasters.

Slow climate velocities of mountain streams portend their role as refugia

Science.gov Websites

result in imprecise estimates of network extent and flow dynamics (41). The problem is most acute in radiation-induced xerostomia by protecting salivary stem cells from toxic aldehydes Show more Ecology

Simulation of Code Spectrum and Code Flow of Cultured Neuronal Networks.

PubMed

Tamura, Shinichi; Nishitani, Yoshi; Hosokawa, Chie; Miyoshi, Tomomitsu; Sawai, Hajime

2016-01-01

It has been shown that, in cultured neuronal networks on a multielectrode, pseudorandom-like sequences (codes) are detected, and they flow with some spatial decay constant. Each cultured neuronal network is characterized by a specific spectrum curve. That is, we may consider the spectrum curve as a "signature" of its associated neuronal network that is dependent on the characteristics of neurons and network configuration, including the weight distribution. In the present study, we used an integrate-and-fire model of neurons with intrinsic and instantaneous fluctuations of characteristics for performing a simulation of a code spectrum from multielectrodes on a 2D mesh neural network. We showed that it is possible to estimate the characteristics of neurons such as the distribution of number of neurons around each electrode and their refractory periods. Although this process is a reverse problem and theoretically the solutions are not sufficiently guaranteed, the parameters seem to be consistent with those of neurons. That is, the proposed neural network model may adequately reflect the behavior of a cultured neuronal network. Furthermore, such prospect is discussed that code analysis will provide a base of communication within a neural network that will also create a base of natural intelligence.

Identifying Flow Networks in a Karstified Aquifer by Application of the Cellular Automata-Based Deterministic Inversion Method (Lez Aquifer, France)

NASA Astrophysics Data System (ADS)

Fischer, P.; Jardani, A.; Wang, X.; Jourde, H.; Lecoq, N.

2017-12-01

The distributed modeling of flow paths within karstic and fractured fields remains a complex task because of the high dependence of the hydraulic responses to the relative locations between observational boreholes and interconnected fractures and karstic conduits that control the main flow of the hydrosystem. The inverse problem in a distributed model is one alternative approach to interpret the hydraulic test data by mapping the karstic networks and fractured areas. In this work, we developed a Bayesian inversion approach, the Cellular Automata-based Deterministic Inversion (CADI) algorithm to infer the spatial distribution of hydraulic properties in a structurally constrained model. This method distributes hydraulic properties along linear structures (i.e., flow conduits) and iteratively modifies the structural geometry of this conduit network to progressively match the observed hydraulic data to the modeled ones. As a result, this method produces a conductivity model that is composed of a discrete conduit network embedded in the background matrix, capable of producing the same flow behavior as the investigated hydrologic system. The method is applied to invert a set of multiborehole hydraulic tests collected from a hydraulic tomography experiment conducted at the Terrieu field site in the Lez aquifer, Southern France. The emergent model shows a high consistency to field observation of hydraulic connections between boreholes. Furthermore, it provides a geologically realistic pattern of flow conduits. This method is therefore of considerable value toward an enhanced distributed modeling of the fractured and karstified aquifers.

Fleet Sizing of Automated Material Handling Using Simulation Approach

NASA Astrophysics Data System (ADS)

Wibisono, Radinal; Ai, The Jin; Ratna Yuniartha, Deny

2018-03-01

Automated material handling tends to be chosen rather than using human power in material handling activity for production floor in manufacturing company. One critical issue in implementing automated material handling is designing phase to ensure that material handling activity more efficient in term of cost spending. Fleet sizing become one of the topic in designing phase. In this research, simulation approach is being used to solve fleet sizing problem in flow shop production to ensure optimum situation. Optimum situation in this research means minimum flow time and maximum capacity in production floor. Simulation approach is being used because flow shop can be modelled into queuing network and inter-arrival time is not following exponential distribution. Therefore, contribution of this research is solving fleet sizing problem with multi objectives in flow shop production using simulation approach with ARENA Software

A source-controlled data center network model.

PubMed

Yu, Yang; Liang, Mangui; Wang, Zhe

2017-01-01

The construction of data center network by applying SDN technology has become a hot research topic. The SDN architecture has innovatively separated the control plane from the data plane which makes the network more software-oriented and agile. Moreover, it provides virtual multi-tenancy, effective scheduling resources and centralized control strategies to meet the demand for cloud computing data center. However, the explosion of network information is facing severe challenges for SDN controller. The flow storage and lookup mechanisms based on TCAM device have led to the restriction of scalability, high cost and energy consumption. In view of this, a source-controlled data center network (SCDCN) model is proposed herein. The SCDCN model applies a new type of source routing address named the vector address (VA) as the packet-switching label. The VA completely defines the communication path and the data forwarding process can be finished solely relying on VA. There are four advantages in the SCDCN architecture. 1) The model adopts hierarchical multi-controllers and abstracts large-scale data center network into some small network domains that has solved the restriction for the processing ability of single controller and reduced the computational complexity. 2) Vector switches (VS) developed in the core network no longer apply TCAM for table storage and lookup that has significantly cut down the cost and complexity for switches. Meanwhile, the problem of scalability can be solved effectively. 3) The SCDCN model simplifies the establishment process for new flows and there is no need to download flow tables to VS. The amount of control signaling consumed when establishing new flows can be significantly decreased. 4) We design the VS on the NetFPGA platform. The statistical results show that the hardware resource consumption in a VS is about 27% of that in an OFS.

A source-controlled data center network model

PubMed Central

Yu, Yang; Liang, Mangui; Wang, Zhe

2017-01-01

The construction of data center network by applying SDN technology has become a hot research topic. The SDN architecture has innovatively separated the control plane from the data plane which makes the network more software-oriented and agile. Moreover, it provides virtual multi-tenancy, effective scheduling resources and centralized control strategies to meet the demand for cloud computing data center. However, the explosion of network information is facing severe challenges for SDN controller. The flow storage and lookup mechanisms based on TCAM device have led to the restriction of scalability, high cost and energy consumption. In view of this, a source-controlled data center network (SCDCN) model is proposed herein. The SCDCN model applies a new type of source routing address named the vector address (VA) as the packet-switching label. The VA completely defines the communication path and the data forwarding process can be finished solely relying on VA. There are four advantages in the SCDCN architecture. 1) The model adopts hierarchical multi-controllers and abstracts large-scale data center network into some small network domains that has solved the restriction for the processing ability of single controller and reduced the computational complexity. 2) Vector switches (VS) developed in the core network no longer apply TCAM for table storage and lookup that has significantly cut down the cost and complexity for switches. Meanwhile, the problem of scalability can be solved effectively. 3) The SCDCN model simplifies the establishment process for new flows and there is no need to download flow tables to VS. The amount of control signaling consumed when establishing new flows can be significantly decreased. 4) We design the VS on the NetFPGA platform. The statistical results show that the hardware resource consumption in a VS is about 27% of that in an OFS. PMID:28328925

Allocation and management issues in multiple-transaction open access transmission networks

NASA Astrophysics Data System (ADS)

Tao, Shu

This thesis focuses on some key issues related to allocation and management by the independent grid operator (IGO) of unbundled services in multiple-transaction open access transmission networks. The three unbundled services addressed in the thesis are transmission real power losses, reactive power support requirements from generation sources, and transmission congestion management. We develop the general framework that explicitly represents multiple transactions undertaken simultaneously in the transmission grid. This framework serves as the basis for formulating various problems treated in the thesis. We use this comprehensive framework to develop a physical-flow-based mechanism to allocate the total transmission losses to each transaction using the system. An important property of the allocation scheme is its capability to effectively deal with counter flows that result in the presence of specific transactions. Using the loss allocation results as the basis, we construct the equivalent loss compensation concept and apply it to develop flexible and effective procedures for compensating losses in multiple-transaction networks. We present a new physical-flow-based mechanism for allocating the reactive power support requirements provided by generators in multiple-transaction networks. The allocatable reactive support requirements are formulated as the sum of two specific components---the voltage magnitude variation component and the voltage angle variation component. The formulation utilizes the multiple-transaction framework and makes use of certain simplifying approximations. The formulation leads to a natural allocation as a function of the amount of each transaction. The physical interpretation of each allocation as a sensitivity of the reactive output of a generator is discussed. We propose a congestion management allocation scheme for multiple-transaction networks. The proposed scheme determines the allocation of congestion among the transactions on a physical-flow basis. It also proposes a congestion relief scheme that removes the congestion attributed to each transaction on the network in a least-cost manner to the IGO and determines the appropriate transmission charges to each transaction for its transmission usage. The thesis provides a compendium of problems that are natural extensions of the research results reported here and appear to be good candidates for future work.

Calculation of flow about posts and powerhead model. [space shuttle main engine

NASA Technical Reports Server (NTRS)

Anderson, P. G.; Farmer, R. C.

1985-01-01

A three dimensional analysis of the non-uniform flow around the liquid oxygen (LOX) posts in the Space Shuttle Main Engine (SSME) powerhead was performed to determine possible factors contributing to the failure of the posts. Also performed was three dimensional numerical fluid flow analysis of the high pressure fuel turbopump (HPFTP) exhaust system, consisting of the turnaround duct (TAD), two-duct hot gas manifold (HGM), and the Version B transfer ducts. The analysis was conducted in the following manner: (1) modeling the flow around a single and small clusters (2 to 10) of posts; (2) modeling the velocity field in the cross plane; and (3) modeling the entire flow region with a three dimensional network type model. Shear stress functions which will permit viscous analysis without requiring excessive numbers of computational grid points were developed. These wall functions, laminar and turbulent, have been compared to standard Blasius solutions and are directly applicable to the cylinder in cross flow class of problems to which the LOX post problem belongs.

Serial Network Flow Monitor

NASA Technical Reports Server (NTRS)

Robinson, Julie A.; Tate-Brown, Judy M.

2009-01-01

Using a commercial software CD and minimal up-mass, SNFM monitors the Payload local area network (LAN) to analyze and troubleshoot LAN data traffic. Validating LAN traffic models may allow for faster and more reliable computer networks to sustain systems and science on future space missions. Research Summary: This experiment studies the function of the computer network onboard the ISS. On-orbit packet statistics are captured and used to validate ground based medium rate data link models and enhance the way that the local area network (LAN) is monitored. This information will allow monitoring and improvement in the data transfer capabilities of on-orbit computer networks. The Serial Network Flow Monitor (SNFM) experiment attempts to characterize the network equivalent of traffic jams on board ISS. The SNFM team is able to specifically target historical problem areas including the SAMS (Space Acceleration Measurement System) communication issues, data transmissions from the ISS to the ground teams, and multiple users on the network at the same time. By looking at how various users interact with each other on the network, conflicts can be identified and work can begin on solutions. SNFM is comprised of a commercial off the shelf software package that monitors packet traffic through the payload Ethernet LANs (local area networks) on board ISS.

A Minimax Network Flow Model for Characterizing the Impact of Slot Restrictions

NASA Technical Reports Server (NTRS)

Lee, Douglas W.; Patek, Stephen D.; Alexandrov, Natalia; Bass, Ellen J.; Kincaid, Rex K.

2010-01-01

This paper proposes a model for evaluating long-term measures to reduce congestion at airports in the National Airspace System (NAS). This model is constructed with the goal of assessing the global impacts of congestion management strategies, specifically slot restrictions. We develop the Minimax Node Throughput Problem (MINNTHRU), a multicommodity network flow model that provides insight into air traffic patterns when one minimizes the worst-case operation across all airports in a given network. MINNTHRU is thus formulated as a model where congestion arises from network topology. It reflects not market-driven airline objectives, but those of a regulatory authority seeking a distribution of air traffic beneficial to all airports, in response to congestion management measures. After discussing an algorithm for solving MINNTHRU for moderate-sized (30 nodes) and larger networks, we use this model to study the impacts of slot restrictions on the operation of an entire hub-spoke airport network. For both a small example network and a medium-sized network based on 30 airports in the NAS, we use MINNTHRU to demonstrate that increasing the severity of slot restrictions increases the traffic around unconstrained hub airports as well as the worst-case level of operation over all airports.

The Event Based Language and Its Multiple Processor Implementations.

DTIC Science & Technology

1980-01-01

10 6.1 "Recursive" Linear Fibonacci ................................................ 105 6.2 The Readers Writers Problem...kinds. Examples of such systems are: C.mmp [Wu-72], Pluribus [He-73], Data Flow [ De -75], the boolean n-cube parallel machine [Su-77], and the MuNet [Wa...concurrency within programs; therefore, we hate concentrated on two types of systems which seem suitable: a processor network, and a data flow processor [ De -77

An optimization model for the US Air-Traffic System

NASA Technical Reports Server (NTRS)

Mulvey, J. M.

1986-01-01

A systematic approach for monitoring U.S. air traffic was developed in the context of system-wide planning and control. Towards this end, a network optimization model with nonlinear objectives was chosen as the central element in the planning/control system. The network representation was selected because: (1) it provides a comprehensive structure for depicting essential aspects of the air traffic system, (2) it can be solved efficiently for large scale problems, and (3) the design can be easily communicated to non-technical users through computer graphics. Briefly, the network planning models consider the flow of traffic through a graph as the basic structure. Nodes depict locations and time periods for either individual planes or for aggregated groups of airplanes. Arcs define variables as actual airplanes flying through space or as delays across time periods. As such, a special case of the network can be used to model the so called flow control problem. Due to the large number of interacting variables and the difficulty in subdividing the problem into relatively independent subproblems, an integrated model was designed which will depict the entire high level (above 29000 feet) jet route system for the 48 contiguous states in the U.S. As a first step in demonstrating the concept's feasibility a nonlinear risk/cost model was developed for the Indianapolis Airspace. The nonlinear network program --NLPNETG-- was employed in solving the resulting test cases. This optimization program uses the Truncated-Newton method (quadratic approximation) for determining the search direction at each iteration in the nonlinear algorithm. It was shown that aircraft could be re-routed in an optimal fashion whenever traffic congestion increased beyond an acceptable level, as measured by the nonlinear risk function.

Volume of the steady-state space of financial flows in a monetary stock-flow-consistent model

NASA Astrophysics Data System (ADS)

Hazan, Aurélien

2017-05-01

We show that a steady-state stock-flow consistent macro-economic model can be represented as a Constraint Satisfaction Problem (CSP). The set of solutions is a polytope, which volume depends on the constraints applied and reveals the potential fragility of the economic circuit, with no need to study the dynamics. Several methods to compute the volume are compared, inspired by operations research methods and the analysis of metabolic networks, both exact and approximate. We also introduce a random transaction matrix, and study the particular case of linear flows with respect to money stocks.

Asymptotic identity in min-plus algebra: a report on CPNS.

PubMed

Li, Ming; Zhao, Wei

2012-01-01

Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of real-time communications, where min-plus algebra plays a role. Cyber-physical networking systems (CPNSs) are recently developing fast and models in data flows as well as systems in CPNS are, accordingly, greatly desired. Though min-plus algebra may be a promising tool to linearize any node in CPNS as can be seen from its applications to the Internet computing, there are tough problems remaining unsolved in this regard. The identity in min-plus algebra is one problem we shall address. We shall point out the confusions about the conventional identity in the min-plus algebra and present an analytical expression of the asymptotic identity that may not cause confusions.

Asymptotic Identity in Min-Plus Algebra: A Report on CPNS

PubMed Central

Li, Ming; Zhao, Wei

2012-01-01

Network calculus is a theory initiated primarily in computer communication networks, especially in the aspect of real-time communications, where min-plus algebra plays a role. Cyber-physical networking systems (CPNSs) are recently developing fast and models in data flows as well as systems in CPNS are, accordingly, greatly desired. Though min-plus algebra may be a promising tool to linearize any node in CPNS as can be seen from its applications to the Internet computing, there are tough problems remaining unsolved in this regard. The identity in min-plus algebra is one problem we shall address. We shall point out the confusions about the conventional identity in the min-plus algebra and present an analytical expression of the asymptotic identity that may not cause confusions. PMID:21822446

Highly parallel computation

NASA Technical Reports Server (NTRS)

Denning, Peter J.; Tichy, Walter F.

1990-01-01

Highly parallel computing architectures are the only means to achieve the computation rates demanded by advanced scientific problems. A decade of research has demonstrated the feasibility of such machines and current research focuses on which architectures designated as multiple instruction multiple datastream (MIMD) and single instruction multiple datastream (SIMD) have produced the best results to date; neither shows a decisive advantage for most near-homogeneous scientific problems. For scientific problems with many dissimilar parts, more speculative architectures such as neural networks or data flow may be needed.

SDN-based path hopping communication against eavesdropping attack

NASA Astrophysics Data System (ADS)

Zhang, Chuanhao; Bu, Youjun; Zhao, Zheng

2016-10-01

Network eavesdropping is one of the most popular means used by cyber attackers, which has been a severe threat to network communication security. Adversaries could capture and analyze network communication data from network nodes or links, monitor network status and steal sensitive data such as username and password etc. Traditional network usually uses static network configuration, and existing defense methods, including firewall, IDS, IPS etc., cannot prevent eavesdropping, which has no distinguishing characteristic. Network eavesdropping become silent during most of the time of the attacking process, which is why it is difficult to discover and to defend. But A successful eavesdropping attack also has its' precondition, which is the target path should be relatively stable and has enough time of duration. So, In order to resolve this problem, it has to work on the network architecture. In this paper, a path hopping communication(PHC) mechanism based on Software Define Network (SDN) was proposed to solve this problem. In PHC, Ends in communication packets as well as the routing paths were changed dynamically. Therefore, the traffic would be distributed to multiple flows and transmitted along different paths. so that Network eavesdropping attack could be prevented effectively. It was concluded that PHC was able to increase the overhead of Network eavesdropping, as well as the difficulty of communication data recovery.

Optimizing congestion and emissions via tradable credit charge and reward scheme without initial credit allocations

NASA Astrophysics Data System (ADS)

Zhu, Wenlong; Ma, Shoufeng; Tian, Junfang

2017-01-01

This paper investigates the revenue-neutral tradable credit charge and reward scheme without initial credit allocations that can reassign network traffic flow patterns to optimize congestion and emissions. First, we prove the existence of the proposed schemes and further decentralize the minimum emission flow pattern to user equilibrium. Moreover, we design the solving method of the proposed credit scheme for minimum emission problem. Second, we investigate the revenue-neutral tradable credit charge and reward scheme without initial credit allocations for bi-objectives to obtain the Pareto system optimum flow patterns of congestion and emissions; and present the corresponding solutions are located in the polyhedron constituted by some inequalities and equalities system. Last, numerical example based on a simple traffic network is adopted to obtain the proposed credit schemes and verify they are revenue-neutral.

Definition of perspective scheme of organization of traffic using methods of forecasting and modeling

NASA Astrophysics Data System (ADS)

Vlasov, V. M.; Novikov, A. N.; Novikov, I. A.; Shevtsova, A. G.

2018-03-01

In the environment of highly developed urban agglomerations, one of the main problems arises - inability of the road network to reach a high level of motorization. The introduction of intelligent transport systems allows solving this problem, but the main issue in their implementation remains open: to what extent this or that method of improving the transport network will be effective and whether it is able to solve the problem of vehicle growth especially for the long-term period. The main goal of this work was the development of an approach to forecasting the increase in the intensity of traffic flow for a long-term period using the population and the level of motorization. The developed approach made it possible to determine the projected population and, taking into account the level of motorization, to determine the growth factor of the traffic flow intensity, which allows calculating the intensity value for a long-term period with high accuracy. The analysis of the main methods for predicting the characteristics of the transport stream is performed. The basic values and parameters necessary for their use are established. The analysis of the urban settlement is carried out and the level of motorization characteristic for the given locality is determined. A new approach to predicting the intensity of the traffic flow has been developed, which makes it possible to predict the change in the transport situation in the long term in high accuracy. Calculations of the magnitude of the intensity increase on the basis of the developed forecasting method are made and the errors in the data obtained are determined. The main recommendations on the use of the developed forecasting approach for the long-term functioning of the road network are formulated.

Single- and two-phase flow in microfluidic porous media analogs based on Voronoi tessellation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Mengjie; Xiao, Feng; Johnson-Paben, Rebecca

2012-01-01

The objective of this study was to create a microfluidic model of complex porous media for studying single and multiphase flows. Most experimental porous media models consist of periodic geometries that lend themselves to comparison with well-developed theoretical predictions. However, most real porous media such as geological formations and biological tissues contain a degree of randomness and complexity that is not adequately represented in periodic geometries. To design an experimental tool to study these complex geometries, we created microfluidic models of random homogeneous and heterogeneous networks based on Voronoi tessellations. These networks consisted of approximately 600 grains separated by amore » highly connected network of channels with an overall porosity of 0.11 0.20. We found that introducing heterogeneities in the form of large cavities within the network changed the permeability in a way that cannot be predicted by the classical porosity-permeability relationship known as the Kozeny equation. The values of permeability found in experiments were in excellent agreement with those calculated from three-dimensional lattice Boltzmann simulations. In two-phase flow experiments of oil displacement with water we found that the surface energy of channel walls determined the pattern of water invasion, while the network topology determined the residual oil saturation. These results suggest that complex network topologies lead to fluid flow behavior that is difficult to predict based solely on porosity. The microfluidic models developed in this study using a novel geometry generation algorithm based on Voronoi tessellation are a new experimental tool for studying fluid and solute transport problems within complex porous media.« less

Distribution-Agnostic Stochastic Optimal Power Flow for Distribution Grids: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baker, Kyri; Dall'Anese, Emiliano; Summers, Tyler

2016-09-01

This paper outlines a data-driven, distributionally robust approach to solve chance-constrained AC optimal power flow problems in distribution networks. Uncertain forecasts for loads and power generated by photovoltaic (PV) systems are considered, with the goal of minimizing PV curtailment while meeting power flow and voltage regulation constraints. A data- driven approach is utilized to develop a distributionally robust conservative convex approximation of the chance-constraints; particularly, the mean and covariance matrix of the forecast errors are updated online, and leveraged to enforce voltage regulation with predetermined probability via Chebyshev-based bounds. By combining an accurate linear approximation of the AC power flowmore » equations with the distributionally robust chance constraint reformulation, the resulting optimization problem becomes convex and computationally tractable.« less

Multiscale model reduction for shale gas transport in poroelastic fractured media

NASA Astrophysics Data System (ADS)

Akkutlu, I. Yucel; Efendiev, Yalchin; Vasilyeva, Maria; Wang, Yuhe

2018-01-01

Inherently coupled flow and geomechanics processes in fractured shale media have implications for shale gas production. The system involves highly complex geo-textures comprised of a heterogeneous anisotropic fracture network spatially embedded in an ultra-tight matrix. In addition, nonlinearities due to viscous flow, diffusion, and desorption in the matrix and high velocity gas flow in the fractures complicates the transport. In this paper, we develop a multiscale model reduction approach to couple gas flow and geomechanics in fractured shale media. A Discrete Fracture Model (DFM) is used to treat the complex network of fractures on a fine grid. The coupled flow and geomechanics equations are solved using a fixed stress-splitting scheme by solving the pressure equation using a continuous Galerkin method and the displacement equation using an interior penalty discontinuous Galerkin method. We develop a coarse grid approximation and coupling using the Generalized Multiscale Finite Element Method (GMsFEM). GMsFEM constructs the multiscale basis functions in a systematic way to capture the fracture networks and their interactions with the shale matrix. Numerical results and an error analysis is provided showing that the proposed approach accurately captures the coupled process using a few multiscale basis functions, i.e. a small fraction of the degrees of freedom of the fine-scale problem.

Fair sharing of resources in a supply network with constraints.

PubMed

Carvalho, Rui; Buzna, Lubos; Just, Wolfram; Helbing, Dirk; Arrowsmith, David K

2012-04-01

This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyze a generic mechanism that distributes network capacity fairly among existing flow demands. The problem can be solved by semianalytical methods on a nearest-neighbor graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad range of patterns of intersecting shortest paths as a function of the distance between the source and the sink. When the number of intersections is the maximum and the distance between the source and the sink is large, we find that a fair allocation implies a decrease of at least 50% from the maximum throughput. We also find that the histogram of the flow allocations assigned to the agents decays as a power law with exponent -1. Our semianalytical framework suggests possible explanations for the well-known reduction of the throughput in fair allocations. It also suggests that the combination of network topology and routing rules can lead to highly uneven (but fair) distributions of resources, a remark of caution to network designers.

Fair sharing of resources in a supply network with constraints

NASA Astrophysics Data System (ADS)

Carvalho, Rui; Buzna, Lubos; Just, Wolfram; Helbing, Dirk; Arrowsmith, David K.

2012-04-01

This paper investigates the effect of network topology on the fair allocation of network resources among a set of agents, an all-important issue for the efficiency of transportation networks all around us. We analyze a generic mechanism that distributes network capacity fairly among existing flow demands. The problem can be solved by semianalytical methods on a nearest-neighbor graph with one source and sink pair, when transport occurs over shortest paths. For this setup, we uncover a broad range of patterns of intersecting shortest paths as a function of the distance between the source and the sink. When the number of intersections is the maximum and the distance between the source and the sink is large, we find that a fair allocation implies a decrease of at least 50% from the maximum throughput. We also find that the histogram of the flow allocations assigned to the agents decays as a power law with exponent -1. Our semianalytical framework suggests possible explanations for the well-known reduction of the throughput in fair allocations. It also suggests that the combination of network topology and routing rules can lead to highly uneven (but fair) distributions of resources, a remark of caution to network designers.

Quantification of network structural dissimilarities.

PubMed

Schieber, Tiago A; Carpi, Laura; Díaz-Guilera, Albert; Pardalos, Panos M; Masoller, Cristina; Ravetti, Martín G

2017-01-09

Identifying and quantifying dissimilarities among graphs is a fundamental and challenging problem of practical importance in many fields of science. Current methods of network comparison are limited to extract only partial information or are computationally very demanding. Here we propose an efficient and precise measure for network comparison, which is based on quantifying differences among distance probability distributions extracted from the networks. Extensive experiments on synthetic and real-world networks show that this measure returns non-zero values only when the graphs are non-isomorphic. Most importantly, the measure proposed here can identify and quantify structural topological differences that have a practical impact on the information flow through the network, such as the presence or absence of critical links that connect or disconnect connected components.

Influence of Distributed Residential Energy Storage on Voltage in Rural Distribution Network and Capacity Configuration

NASA Astrophysics Data System (ADS)

Liu, Lu; Tong, Yibin; Zhao, Zhigang; Zhang, Xuefen

2018-03-01

Large-scale access of distributed residential photovoltaic (PV) in rural areas has solved the voltage problem to a certain extent. However, due to the intermittency of PV and the particularity of rural residents’ power load, the problem of low voltage in the evening peak remains to be resolved. This paper proposes to solve the problem by accessing residential energy storage. Firstly, the influence of access location and capacity of energy storage on voltage distribution in rural distribution network is analyzed. Secondly, the relation between the storage capacity and load capacity is deduced for four typical load and energy storage cases when the voltage deviation meets the demand. Finally, the optimal storage position and capacity are obtained by using PSO and power flow simulation.

Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks

NASA Astrophysics Data System (ADS)

Langner, Tobias; Schindelhauer, Christian; Souza, Alexander

We consider an optimisation problem which is motivated from storage virtualisation in the Internet. While storage networks make use of dedicated hardware to provide homogeneous bandwidth between servers and clients, in the Internet, connections between storage servers and clients are heterogeneous and often asymmetric with respect to upload and download. Thus, for a large file, the question arises how it should be fragmented and distributed among the servers to grant "optimal" access to the contents. We concentrate on the transfer time of a file, which is the time needed for one upload and a sequence of n downloads, using a set of m servers with heterogeneous bandwidths. We assume that fragments of the file can be transferred in parallel to and from multiple servers. This model yields a distribution problem that examines the question of how these fragments should be distributed onto those servers in order to minimise the transfer time. We present an algorithm, called FlowScaling, that finds an optimal solution within running time {O}(m log m). We formulate the distribution problem as a maximum flow problem, which involves a function that states whether a solution with a given transfer time bound exists. This function is then used with a scaling argument to determine an optimal solution within the claimed time complexity.

Assessing lateral flows and solute transport during floods in a conduit-flow-dominated karst system using the inverse problem for the advection-diffusion equation

NASA Astrophysics Data System (ADS)

Cholet, Cybèle; Charlier, Jean-Baptiste; Moussa, Roger; Steinmann, Marc; Denimal, Sophie

2017-07-01

The aim of this study is to present a framework that provides new ways to characterize the spatio-temporal variability of lateral exchanges for water flow and solute transport in a karst conduit network during flood events, treating both the diffusive wave equation and the advection-diffusion equation with the same mathematical approach, assuming uniform lateral flow and solute transport. A solution to the inverse problem for the advection-diffusion equations is then applied to data from two successive gauging stations to simulate flows and solute exchange dynamics after recharge. The study site is the karst conduit network of the Fourbanne aquifer in the French Jura Mountains, which includes two reaches characterizing the network from sinkhole to cave stream to the spring. The model is applied, after separation of the base from the flood components, on discharge and total dissolved solids (TDSs) in order to assess lateral flows and solute concentrations and compare them to help identify water origin. The results showed various lateral contributions in space - between the two reaches located in the unsaturated zone (R1), and in the zone that is both unsaturated and saturated (R2) - as well as in time, according to hydrological conditions. Globally, the two reaches show a distinct response to flood routing, with important lateral inflows on R1 and large outflows on R2. By combining these results with solute exchanges and the analysis of flood routing parameters distribution, we showed that lateral inflows on R1 are the addition of diffuse infiltration (observed whatever the hydrological conditions) and localized infiltration in the secondary conduit network (tributaries) in the unsaturated zone, except in extreme dry periods. On R2, despite inflows on the base component, lateral outflows are observed during floods. This pattern was attributed to the concept of reversal flows of conduit-matrix exchanges, inducing a complex water mixing effect in the saturated zone. From our results we build the functional scheme of the karst system. It demonstrates the impact of the saturated zone on matrix-conduit exchanges in this shallow phreatic aquifer and highlights the important role of the unsaturated zone on storage and transfer functions of the system.

A strategy for reducing turnaround time in design optimization using a distributed computer system

NASA Technical Reports Server (NTRS)

Young, Katherine C.; Padula, Sharon L.; Rogers, James L.

1988-01-01

There is a need to explore methods for reducing lengthly computer turnaround or clock time associated with engineering design problems. Different strategies can be employed to reduce this turnaround time. One strategy is to run validated analysis software on a network of existing smaller computers so that portions of the computation can be done in parallel. This paper focuses on the implementation of this method using two types of problems. The first type is a traditional structural design optimization problem, which is characterized by a simple data flow and a complicated analysis. The second type of problem uses an existing computer program designed to study multilevel optimization techniques. This problem is characterized by complicated data flow and a simple analysis. The paper shows that distributed computing can be a viable means for reducing computational turnaround time for engineering design problems that lend themselves to decomposition. Parallel computing can be accomplished with a minimal cost in terms of hardware and software.

Putting Man in the Machine: Exploiting Expertise to Enhance Multiobjective Design of Water Supply Monitoring Network

NASA Astrophysics Data System (ADS)

Bode, F.; Nowak, W.; Reed, P. M.; Reuschen, S.

2016-12-01

Drinking-water well catchments need effective early-warning monitoring networks. Groundwater water supply wells in complex urban environments are in close proximity to a myriad of potential industrial pollutant sources that could irreversibly damage their source aquifers. These urban environments pose fiscal and physical challenges to designing monitoring networks. Ideal early-warning monitoring networks would satisfy three objectives: to detect (1) all potential contaminations within the catchment (2) as early as possible before they reach the pumping wells, (3) while minimizing costs. Obviously, the ideal case is nonexistent, so we search for tradeoffs using multiobjective optimization. The challenge of this optimization problem is the high number of potential monitoring-well positions (the search space) and the non-linearity of the underlying groundwater flow-and-transport problem. This study evaluates (1) different ways to effectively restrict the search space in an efficient way, with and without expert knowledge, (2) different methods to represent the search space during the optimization and (3) the influence of incremental increases in uncertainty in the system. Conductivity, regional flow direction and potential source locations are explored as key uncertainties. We show the need and the benefit of our methods by comparing optimized monitoring networks for different uncertainty levels with networks that seek to effectively exploit expert knowledge. The study's main contributions are the different approaches restricting and representing the search space. The restriction algorithms are based on a point-wise comparison of decision elements of the search space. The representation of the search space can be either binary or continuous. For both cases, the search space must be adjusted properly. Our results show the benefits and drawbacks of binary versus continuous search space representations and the high potential of automated search space restriction algorithms for high-dimensional, highly non-linear optimization problems.

A diameter-sensitive flow entropy method for reliability consideration in water distribution system design

NASA Astrophysics Data System (ADS)

Liu, Haixing; Savić, Dragan; Kapelan, Zoran; Zhao, Ming; Yuan, Yixing; Zhao, Hongbin

2014-07-01

Flow entropy is a measure of uniformity of pipe flows in water distribution systems. By maximizing flow entropy one can identify reliable layouts or connectivity in networks. In order to overcome the disadvantage of the common definition of flow entropy that does not consider the impact of pipe diameter on reliability, an extended definition of flow entropy, termed as diameter-sensitive flow entropy, is proposed. This new methodology is then assessed by using other reliability methods, including Monte Carlo Simulation, a pipe failure probability model, and a surrogate measure (resilience index) integrated with water demand and pipe failure uncertainty. The reliability assessment is based on a sample of WDS designs derived from an optimization process for each of the two benchmark networks. Correlation analysis is used to evaluate quantitatively the relationship between entropy and reliability. To ensure reliability, a comparative analysis between the flow entropy and the new method is conducted. The results demonstrate that the diameter-sensitive flow entropy shows consistently much stronger correlation with the three reliability measures than simple flow entropy. Therefore, the new flow entropy method can be taken as a better surrogate measure for reliability and could be potentially integrated into the optimal design problem of WDSs. Sensitivity analysis results show that the velocity parameters used in the new flow entropy has no significant impact on the relationship between diameter-sensitive flow entropy and reliability.

40-Gbps optical backbone network deep packet inspection based on FPGA

NASA Astrophysics Data System (ADS)

Zuo, Yuan; Huang, Zhiping; Su, Shaojing

2014-11-01

In the era of information, the big data, which contains huge information, brings about some problems, such as high speed transmission, storage and real-time analysis and process. As the important media for data transmission, the Internet is the significant part for big data processing research. With the large-scale usage of the Internet, the data streaming of network is increasing rapidly. The speed level in the main fiber optic communication of the present has reached 40Gbps, even 100Gbps, therefore data on the optical backbone network shows some features of massive data. Generally, data services are provided via IP packets on the optical backbone network, which is constituted with SDH (Synchronous Digital Hierarchy). Hence this method that IP packets are directly mapped into SDH payload is named POS (Packet over SDH) technology. Aiming at the problems of real time process of high speed massive data, this paper designs a process system platform based on ATCA for 40Gbps POS signal data stream recognition and packet content capture, which employs the FPGA as the CPU. This platform offers pre-processing of clustering algorithms, service traffic identification and data mining for the following big data storage and analysis with high efficiency. Also, the operational procedure is proposed in this paper. Four channels of 10Gbps POS signal decomposed by the analysis module, which chooses FPGA as the kernel, are inputted to the flow classification module and the pattern matching component based on TCAM. Based on the properties of the length of payload and net flows, buffer management is added to the platform to keep the key flow information. According to data stream analysis, DPI (deep packet inspection) and flow balance distribute, the signal is transmitted to the backend machine through the giga Ethernet ports on back board. Practice shows that the proposed platform is superior to the traditional applications based on ASIC and NP.

Competition between Local Collisions and Collective Hydrodynamic Feedback Controls Traffic Flows in Microfluidic Networks

NASA Astrophysics Data System (ADS)

Belloul, M.; Engl, W.; Colin, A.; Panizza, P.; Ajdari, A.

2009-05-01

By studying the repartition of monodisperse droplets at a simple T junction, we show that the traffic of discrete fluid systems in microfluidic networks results from two competing mechanisms, whose significance is driven by confinement. Traffic is dominated by collisions occurring at the junction for small droplets and by collective hydrodynamic feedback for large ones. For each mechanism, we present simple models in terms of the pertinent dimensionless parameters of the problem.

Graph Representations of Flow and Transport in Fracture Networks using Machine Learning

NASA Astrophysics Data System (ADS)

Srinivasan, G.; Viswanathan, H. S.; Karra, S.; O'Malley, D.; Godinez, H. C.; Hagberg, A.; Osthus, D.; Mohd-Yusof, J.

2017-12-01

Flow and transport of fluids through fractured systems is governed by the properties and interactions at the micro-scale. Retaining information about the micro-structure such as fracture length, orientation, aperture and connectivity in mesh-based computational models results in solving for millions to billions of degrees of freedom and quickly renders the problem computationally intractable. Our approach depicts fracture networks graphically, by mapping fractures to nodes and intersections to edges, thereby greatly reducing computational burden. Additionally, we use machine learning techniques to build simulators on the graph representation, trained on data from the mesh-based high fidelity simulations to speed up computation by orders of magnitude. We demonstrate our methodology on ensembles of discrete fracture networks, dividing up the data into training and validation sets. Our machine learned graph-based solvers result in over 3 orders of magnitude speedup without any significant sacrifice in accuracy.

An effective fractal-tree closure model for simulating blood flow in large arterial networks.

PubMed

Perdikaris, Paris; Grinberg, Leopold; Karniadakis, George Em

2015-06-01

The aim of the present work is to address the closure problem for hemodynamic simulations by developing a flexible and effective model that accurately distributes flow in the downstream vasculature and can stably provide a physiological pressure outflow boundary condition. To achieve this goal, we model blood flow in the sub-pixel vasculature by using a non-linear 1D model in self-similar networks of compliant arteries that mimic the structure and hierarchy of vessels in the meso-vascular regime (radii [Formula: see text]). We introduce a variable vessel length-to-radius ratio for small arteries and arterioles, while also addressing non-Newtonian blood rheology and arterial wall viscoelasticity effects in small arteries and arterioles. This methodology aims to overcome substantial cut-off radius sensitivities, typically arising in structured tree and linearized impedance models. The proposed model is not sensitive to outflow boundary conditions applied at the end points of the fractal network, and thus does not require calibration of resistance/capacitance parameters typically required for outflow conditions. The proposed model convergences to a periodic state in two cardiac cycles even when started from zero-flow initial conditions. The resulting fractal-trees typically consist of thousands to millions of arteries, posing the need for efficient parallel algorithms. To this end, we have scaled up a Discontinuous Galerkin solver that utilizes the MPI/OpenMP hybrid programming paradigm to thousands of computer cores, and can simulate blood flow in networks of millions of arterial segments at the rate of one cycle per 5 min. The proposed model has been extensively tested on a large and complex cranial network with 50 parent, patient-specific arteries and 21 outlets to which fractal trees where attached, resulting to a network of up to 4,392,484 vessels in total, and a detailed network of the arm with 276 parent arteries and 103 outlets (a total of 702,188 vessels after attaching the fractal trees), returning physiological flow and pressure wave predictions without requiring any parameter estimation or calibration procedures. We present a novel methodology to overcome substantial cut-off radius sensitivities.

A new class of finite-time nonlinear consensus protocols for multi-agent systems

NASA Astrophysics Data System (ADS)

Zuo, Zongyu; Tie, Lin

2014-02-01

This paper is devoted to investigating the finite-time consensus problem for a multi-agent system in networks with undirected topology. A new class of global continuous time-invariant consensus protocols is constructed for each single-integrator agent dynamics with the aid of Lyapunov functions. In particular, it is shown that the settling time of the proposed new class of finite-time consensus protocols is upper bounded for arbitrary initial conditions. This makes it possible for network consensus problems that the convergence time is designed and estimated offline for a given undirected information flow and a group volume of agents. Finally, a numerical simulation example is presented as a proof of concept.

Distributed robust finite-time nonlinear consensus protocols for multi-agent systems

NASA Astrophysics Data System (ADS)

Zuo, Zongyu; Tie, Lin

2016-04-01

This paper investigates the robust finite-time consensus problem of multi-agent systems in networks with undirected topology. Global nonlinear consensus protocols augmented with a variable structure are constructed with the aid of Lyapunov functions for each single-integrator agent dynamics in the presence of external disturbances. In particular, it is shown that the finite settling time of the proposed general framework for robust consensus design is upper bounded for any initial condition. This makes it possible for network consensus problems to design and estimate the convergence time offline for a multi-agent team with a given undirected information flow. Finally, simulation results are presented to demonstrate the performance and effectiveness of our finite-time protocols.

Algorithm to solve a chance-constrained network capacity design problem with stochastic demands and finite support

DOE Office of Scientific and Technical Information (OSTI.GOV)

Schumacher, Kathryn M.; Chen, Richard Li-Yang; Cohn, Amy E. M.

2016-04-15

Here, we consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real-world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum-cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as amore » foundation, our primary focus is on a chance-constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user-defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut-sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches.« less

DOE Office of Scientific and Technical Information (OSTI.GOV)

Baker, Kyri; Dall'Anese, Emiliano; Summers, Tyler

This paper outlines a data-driven, distributionally robust approach to solve chance-constrained AC optimal power flow problems in distribution networks. Uncertain forecasts for loads and power generated by photovoltaic (PV) systems are considered, with the goal of minimizing PV curtailment while meeting power flow and voltage regulation constraints. A data- driven approach is utilized to develop a distributionally robust conservative convex approximation of the chance-constraints; particularly, the mean and covariance matrix of the forecast errors are updated online, and leveraged to enforce voltage regulation with predetermined probability via Chebyshev-based bounds. By combining an accurate linear approximation of the AC power flowmore » equations with the distributionally robust chance constraint reformulation, the resulting optimization problem becomes convex and computationally tractable.« less

Evaluation of multilayer perceptron algorithms for an analysis of network flow data

NASA Astrophysics Data System (ADS)

Bieniasz, Jedrzej; Rawski, Mariusz; Skowron, Krzysztof; Trzepiński, Mateusz

2016-09-01

The volume of exchanged information through IP networks is larger than ever and still growing. It creates a space for both benign and malicious activities. The second one raises awareness on security network devices, as well as network infrastructure and a system as a whole. One of the basic tools to prevent cyber attacks is Network Instrusion Detection System (NIDS). NIDS could be realized as a signature-based detector or an anomaly-based one. In the last few years the emphasis has been placed on the latter type, because of the possibility of applying smart and intelligent solutions. An ideal NIDS of next generation should be composed of self-learning algorithms that could react on known and unknown malicious network activities respectively. In this paper we evaluated a machine learning approach for detection of anomalies in IP network data represented as NetFlow records. We considered Multilayer Perceptron (MLP) as the classifier and we used two types of learning algorithms - Backpropagation (BP) and Particle Swarm Optimization (PSO). This paper includes a comprehensive survey on determining the most optimal MLP learning algorithm for the classification problem in application to network flow data. The performance, training time and convergence of BP and PSO methods were compared. The results show that PSO algorithm implemented by the authors outperformed other solutions if accuracy of classifications is considered. The major disadvantage of PSO is training time, which could be not acceptable for larger data sets or in real network applications. At the end we compared some key findings with the results from the other papers to show that in all cases results from this study outperformed them.

Smart-Grid Backbone Network Real-Time Delay Reduction via Integer Programming.

PubMed

Pagadrai, Sasikanth; Yilmaz, Muhittin; Valluri, Pratyush

2016-08-01

This research investigates an optimal delay-based virtual topology design using integer linear programming (ILP), which is applied to the current backbone networks such as smart-grid real-time communication systems. A network traffic matrix is applied and the corresponding virtual topology problem is solved using the ILP formulations that include a network delay-dependent objective function and lightpath routing, wavelength assignment, wavelength continuity, flow routing, and traffic loss constraints. The proposed optimization approach provides an efficient deterministic integration of intelligent sensing and decision making, and network learning features for superior smart grid operations by adaptively responding the time-varying network traffic data as well as operational constraints to maintain optimal virtual topologies. A representative optical backbone network has been utilized to demonstrate the proposed optimization framework whose simulation results indicate that superior smart-grid network performance can be achieved using commercial networks and integer programming.

Optimal placement of FACTS devices using optimization techniques: A review

NASA Astrophysics Data System (ADS)

Gaur, Dipesh; Mathew, Lini

2018-03-01

Modern power system is dealt with overloading problem especially transmission network which works on their maximum limit. Today’s power system network tends to become unstable and prone to collapse due to disturbances. Flexible AC Transmission system (FACTS) provides solution to problems like line overloading, voltage stability, losses, power flow etc. FACTS can play important role in improving static and dynamic performance of power system. FACTS devices need high initial investment. Therefore, FACTS location, type and their rating are vital and should be optimized to place in the network for maximum benefit. In this paper, different optimization methods like Particle Swarm Optimization (PSO), Genetic Algorithm (GA) etc. are discussed and compared for optimal location, type and rating of devices. FACTS devices such as Thyristor Controlled Series Compensator (TCSC), Static Var Compensator (SVC) and Static Synchronous Compensator (STATCOM) are considered here. Mentioned FACTS controllers effects on different IEEE bus network parameters like generation cost, active power loss, voltage stability etc. have been analyzed and compared among the devices.

Initial Validation for the Estimation of Resting-State fMRI Effective Connectivity by a Generalization of the Correlation Approach.

PubMed

Xu, Nan; Spreng, R Nathan; Doerschuk, Peter C

2017-01-01

Resting-state functional MRI (rs-fMRI) is widely used to noninvasively study human brain networks. Network functional connectivity is often estimated by calculating the timeseries correlation between blood-oxygen-level dependent (BOLD) signal from different regions of interest (ROIs). However, standard correlation cannot characterize the direction of information flow between regions. In this paper, we introduce and test a new concept, prediction correlation, to estimate effective connectivity in functional brain networks from rs-fMRI. In this approach, the correlation between two BOLD signals is replaced by a correlation between one BOLD signal and a prediction of this signal via a causal system driven by another BOLD signal. Three validations are described: (1) Prediction correlation performed well on simulated data where the ground truth was known, and outperformed four other methods. (2) On simulated data designed to display the "common driver" problem, prediction correlation did not introduce false connections between non-interacting driven ROIs. (3) On experimental data, prediction correlation recovered the previously identified network organization of human brain. Prediction correlation scales well to work with hundreds of ROIs, enabling it to assess whole brain interregional connectivity at the single subject level. These results provide an initial validation that prediction correlation can capture the direction of information flow and estimate the duration of extended temporal delays in information flow between regions of interest ROIs based on BOLD signal. This approach not only maintains the high sensitivity to network connectivity provided by the correlation analysis, but also performs well in the estimation of causal information flow in the brain.

Network monitoring in the Tier2 site in Prague

NASA Astrophysics Data System (ADS)

Eliáš, Marek; Fiala, Lukáš; Horký, Jiří; Chudoba, Jiří; Kouba, Tomáš; Kundrát, Jan; Švec, Jan

2011-12-01

Network monitoring provides different types of view on the network traffic. It's output enables computing centre staff to make qualified decisions about changes in the organization of computing centre network and to spot possible problems. In this paper we present network monitoring framework used at Tier-2 in Prague in Institute of Physics (FZU). The framework consists of standard software and custom tools. We discuss our system for hardware failures detection using syslog logging and Nagios active checks, bandwidth monitoring of physical links and analysis of NetFlow exports from Cisco routers. We present tool for automatic detection of network layout based on SNMP. This tool also records topology changes into SVN repository. Adapted weathermap4rrd is used to visualize recorded data to get fast overview showing current bandwidth usage of links in network.

Developing a Procedure for Segmenting Meshed Heat Networks of Heat Supply Systems without Outflows

NASA Astrophysics Data System (ADS)

Tokarev, V. V.

2018-06-01

The heat supply systems of cities have, as a rule, a ring structure with the possibility of redistributing the flows. Despite the fact that a ring structure is more reliable than a radial one, the operators of heat networks prefer to use them in normal modes according to the scheme without overflows of the heat carrier between the heat mains. With such a scheme, it is easier to adjust the networks and to detect and locate faults in them. The article proposes a formulation of the heat network segmenting problem. The problem is set in terms of optimization with the heat supply system's excessive hydraulic power used as the optimization criterion. The heat supply system computer model has a hierarchically interconnected multilevel structure. Since iterative calculations are only carried out for the level of trunk heat networks, decomposing the entire system into levels allows the dimensionality of the solved subproblems to be reduced by an order of magnitude. An attempt to solve the problem by fully enumerating possible segmentation versions does not seem to be feasible for systems of really existing sizes. The article suggests a procedure for searching rational segmentation of heat supply networks with limiting the search to versions of dividing the system into segments near the flow convergence nodes with subsequent refining of the solution. The refinement is performed in two stages according to the total excess hydraulic power criterion. At the first stage, the loads are redistributed among the sources. After that, the heat networks are divided into independent fragments, and the possibility of increasing the excess hydraulic power in the obtained fragments is checked by shifting the division places inside a fragment. The proposed procedure has been approbated taking as an example a municipal heat supply system involving six heat mains fed from a common source, 24 loops within the feeding mains plane, and more than 5000 consumers. Application of the proposed segmentation procedure made it possible to find a version with required hydraulic power in the heat supply system on 3% less than the one found using the simultaneous segmentation method.

Gait Recognition Based on Convolutional Neural Networks

NASA Astrophysics Data System (ADS)

Sokolova, A.; Konushin, A.

2017-05-01

In this work we investigate the problem of people recognition by their gait. For this task, we implement deep learning approach using the optical flow as the main source of motion information and combine neural feature extraction with the additional embedding of descriptors for representation improvement. In order to find the best heuristics, we compare several deep neural network architectures, learning and classification strategies. The experiments were made on two popular datasets for gait recognition, so we investigate their advantages and disadvantages and the transferability of considered methods.

Optimal route discovery for soft QOS provisioning in mobile ad hoc multimedia networks

NASA Astrophysics Data System (ADS)

Huang, Lei; Pan, Feng

2007-09-01

In this paper, we propose an optimal routing discovery algorithm for ad hoc multimedia networks whose resource keeps changing, First, we use stochastic models to measure the network resource availability, based on the information about the location and moving pattern of the nodes, as well as the link conditions between neighboring nodes. Then, for a certain multimedia packet flow to be transmitted from a source to a destination, we formulate the optimal soft-QoS provisioning problem as to find the best route that maximize the probability of satisfying its desired QoS requirements in terms of the maximum delay constraints. Based on the stochastic network resource model, we developed three approaches to solve the formulated problem: A centralized approach serving as the theoretical reference, a distributed approach that is more suitable to practical real-time deployment, and a distributed dynamic approach that utilizes the updated time information to optimize the routing for each individual packet. Examples of numerical results demonstrated that using the route discovered by our distributed algorithm in a changing network environment, multimedia applications could achieve better QoS statistically.

Rate-based congestion control in networks with smart links, revision. B.S. Thesis - May 1988

NASA Technical Reports Server (NTRS)

Heybey, Andrew Tyrrell

1990-01-01

The author uses a network simulator to explore rate-based congestion control in networks with smart links that can feed back information to tell senders to adjust their transmission rates. This method differs in a very important way from congestion control in which a congested network component just drops packets - the most commonly used method. It is clearly advantageous for the links in the network to communicate with the end users about the network capacity, rather than the users unilaterally picking a transmission rate. The components in the middle of the network, not the end users, have information about the capacity and traffic in the network. The author experiments with three different algorithms for calculating the control rate to feed back to the users. All of the algorithms exhibit problems in the form of large queues when simulated with a configuration modeling the dynamics of a packet-voice system. However, the problems are not with the algorithms themselves, but with the fact that feedback takes time. If the network steady-state utilization is low enough that it can absorb transients in the traffic through it, then the large queues disappear. If the users are modified to start sending slowly, to allow the network to adapt to a new flow without causing congestion, a greater portion of the network's bandwidth can be used.

The Average Network Flow Problem: Shortest Path and Minimum Cost Flow Formulations, Algorithms, Heuristics, and Complexity

DTIC Science & Technology

2012-09-13

Jordan, Captain, USAF AFIT/DS/ENS/12-09 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright- Patterson Air Force Base...Way, Wright- Patterson AFB, Ohio, 45433, USA, +1 937-255-3636, jeremy.jordan@afit.edu jeffery.weir@afit.edu doral.sandlin@afit.edu 1.1 Abstract United...Technology 2950 Hobson Way, Wright- Patterson AFB, Ohio, 45433, USA, +1 937-255-3636, jeremy.jordan@afit.edu jeffery.weir@afit.edu doral.sandlin@afit.edu

Simulation model for port shunting yards

NASA Astrophysics Data System (ADS)

Rusca, A.; Popa, M.; Rosca, E.; Rosca, M.; Dragu, V.; Rusca, F.

2016-08-01

Sea ports are important nodes in the supply chain, joining two high capacity transport modes: rail and maritime transport. The huge cargo flows transiting port requires high capacity construction and installation such as berths, large capacity cranes, respectively shunting yards. However, the port shunting yards specificity raises several problems such as: limited access since these are terminus stations for rail network, the in-output of large transit flows of cargo relatively to the scarcity of the departure/arrival of a ship, as well as limited land availability for implementing solutions to serve these flows. It is necessary to identify technological solutions that lead to an answer to these problems. The paper proposed a simulation model developed with ARENA computer simulation software suitable for shunting yards which serve sea ports with access to the rail network. Are investigates the principal aspects of shunting yards and adequate measures to increase their transit capacity. The operation capacity for shunting yards sub-system is assessed taking in consideration the required operating standards and the measure of performance (e.g. waiting time for freight wagons, number of railway line in station, storage area, etc.) of the railway station are computed. The conclusion and results, drawn from simulation, help transports and logistics specialists to test the proposals for improving the port management.

Kinematic dynamo action in a network of screw motions; application to the core of a fast breeder reactor

NASA Astrophysics Data System (ADS)

Plunian, F.; Marty, P.; Alemany, A.

1999-03-01

Most of the studies concerning the dynamo effect are motivated by astrophysical and geophysical applications. The dynamo effect is also the subject of some experimental studies in fast breeder reactors (FBR) for they contain liquid sodium in motion with magnetic Reynolds numbers larger than unity. In this paper, we are concerned with the flow of sodium inside the core of an FBR, characterized by a strong helicity. The sodium in the core flows through a network of vertical cylinders. In each cylinder assembly, the flow can be approximated by a smooth upwards helical motion with no-slip conditions at the boundary. As the core contains a large number of assemblies, the global flow is considered to be two-dimensionally periodic. We investigate the self-excitation of a two-dimensionally periodic magnetic field using an instability analysis of the induction equation which leads to an eigenvalue problem. Advantage is taken of the flow symmetries to reduce the size of the problem. The growth rate of the magnetic field is found as a function of the flow pitch, the magnetic Reynolds number (Rm) and the vertical magnetic wavenumber (k). An [alpha]-effect is shown to operate for moderate values of Rm, supporting a mean magnetic field. The large-Rm limit is investigated numerically. It is found that [alpha]=O(Rm[minus sign]2/3), which can be explained through appropriate dynamo mechanisms. Either a smooth Ponomarenko or a Roberts type of dynamo is operating in each periodic cell, depending on k. The standard power regime of an industrial FPBR is found to be subcritical.

A Finite-Volume approach for compressible single- and two-phase flows in flexible pipelines with fluid-structure interaction

NASA Astrophysics Data System (ADS)

Daude, F.; Galon, P.

2018-06-01

A Finite-Volume scheme for the numerical computations of compressible single- and two-phase flows in flexible pipelines is proposed based on an approximate Godunov-type approach. The spatial discretization is here obtained using the HLLC scheme. In addition, the numerical treatment of abrupt changes in area and network including several pipelines connected at junctions is also considered. The proposed approach is based on the integral form of the governing equations making it possible to tackle general equations of state. A coupled approach for the resolution of fluid-structure interaction of compressible fluid flowing in flexible pipes is considered. The structural problem is solved using Euler-Bernoulli beam finite elements. The present Finite-Volume method is applied to ideal gas and two-phase steam-water based on the Homogeneous Equilibrium Model (HEM) in conjunction with a tabulated equation of state in order to demonstrate its ability to tackle general equations of state. The extensive application of the scheme for both shock tube and other transient flow problems demonstrates its capability to resolve such problems accurately and robustly. Finally, the proposed 1-D fluid-structure interaction model appears to be computationally efficient.

Application for Single Price Auction Model (SPA) in AC Network

NASA Astrophysics Data System (ADS)

Wachi, Tsunehisa; Fukutome, Suguru; Chen, Luonan; Makino, Yoshinori; Koshimizu, Gentarou

This paper aims to develop a single price auction model with AC transmission network, based on the principle of maximizing social surplus of electricity market. Specifically, we first formulate the auction market as a nonlinear optimization problem, which has almost the same form as the conventional optimal power flow problem, and then propose an algorithm to derive both market clearing price and trade volume of each player even for the case of market-splitting. As indicated in the paper, the proposed approach can be used not only for the price evaluation of auction or bidding market but also for analysis of bidding strategy, congestion effect and other constraints or factors. Several numerical examples are used to demonstrate effectiveness of our method.

A pressure-driven flow analysis of gas trapping behavior in nanocomposite thermite films

NASA Astrophysics Data System (ADS)

Sullivan, K. T.; Bastea, S.; Kuntz, J. D.; Gash, A. E.

2013-10-01

This article is in direct response to a recently published article entitled Electrophoretic deposition and mechanistic studies of nano-Al/CuO thermites (K. T. Sullivan et al., J. Appl. Phys., 112(2), 2012), in which we introduced a non-dimensional parameter as the ratio of gas production to gas escape within a thin porous thermite film. In our original analysis, we had treated the problem as Fickian diffusion of gases through the porous network. However, we believe a more physical representation of the problem is to treat this as pressure-driven flow of gases in a porous medium. We offer a new derivation of the non-dimensional parameter which calculates gas velocity using the well-known Poiseuille's Law for pressure-driven flow in a pipe. This updated analysis incorporates the porosity, gas viscosity, and pressure gradient into the equation.

Aeroelasticity of morphing wings using neural networks

NASA Astrophysics Data System (ADS)

Natarajan, Anand

In this dissertation, neural networks are designed to effectively model static non-linear aeroelastic problems in adaptive structures and linear dynamic aeroelastic systems with time varying stiffness. The use of adaptive materials in aircraft wings allows for the change of the contour or the configuration of a wing (morphing) in flight. The use of smart materials, to accomplish these deformations, can imply that the stiffness of the wing with a morphing contour changes as the contour changes. For a rapidly oscillating body in a fluid field, continuously adapting structural parameters may render the wing to behave as a time variant system. Even the internal spars/ribs of the aircraft wing which define the wing stiffness can be made adaptive, that is, their stiffness can be made to vary with time. The immediate effect on the structural dynamics of the wing, is that, the wing motion is governed by a differential equation with time varying coefficients. The study of this concept of a time varying torsional stiffness, made possible by the use of active materials and adaptive spars, in the dynamic aeroelastic behavior of an adaptable airfoil is performed here. Another type of aeroelastic problem of an adaptive structure that is investigated here, is the shape control of an adaptive bump situated on the leading edge of an airfoil. Such a bump is useful in achieving flow separation control for lateral directional maneuverability of the aircraft. Since actuators are being used to create this bump on the wing surface, the energy required to do so needs to be minimized. The adverse pressure drag as a result of this bump needs to be controlled so that the loss in lift over the wing is made minimal. The design of such a "spoiler bump" on the surface of the airfoil is an optimization problem of maximizing pressure drag due to flow separation while minimizing the loss in lift and energy required to deform the bump. One neural network is trained using the CFD code FLUENT to represent the aerodynamic loading over the bump. A second neural network is trained for calculating the actuator loads, bump displacement and lift, drag forces over the airfoil using the finite element solver, ANSYS and the previously trained neural network. This non-linear aeroelastic model of the deforming bump on an airfoil surface using neural networks can serve as a fore-runner for other non-linear aeroelastic problems.

Toward multiscale modelings of grain-fluid systems

NASA Astrophysics Data System (ADS)

Chareyre, Bruno; Yuan, Chao; Montella, Eduard P.; Salager, Simon

2017-06-01

Computationally efficient methods have been developed for simulating partially saturated granular materials in the pendular regime. In contrast, one hardly avoid expensive direct resolutions of 2-phase fluid dynamics problem for mixed pendular-funicular situations or even saturated regimes. Following previous developments for single-phase flow, a pore-network approach of the coupling problems is described. The geometry and movements of phases and interfaces are described on the basis of a tetrahedrization of the pore space, introducing elementary objects such as bridge, meniscus, pore body and pore throat, together with local rules of evolution. As firmly established local rules are still missing on some aspects (entry capillary pressure and pore-scale pressure-saturation relations, forces on the grains, or kinetics of transfers in mixed situations) a multi-scale numerical framework is introduced, enhancing the pore-network approach with the help of direct simulations. Small subsets of a granular system are extracted, in which multiphase scenario are solved using the Lattice-Boltzman method (LBM). In turns, a global problem is assembled and solved at the network scale, as illustrated by a simulated primary drainage.

Design of Compressed Sensing Algorithm for Coal Mine IoT Moving Measurement Data Based on a Multi-Hop Network and Total Variation.

PubMed

Wang, Gang; Zhao, Zhikai; Ning, Yongjie

2018-05-28

As the application of a coal mine Internet of Things (IoT), mobile measurement devices, such as intelligent mine lamps, cause moving measurement data to be increased. How to transmit these large amounts of mobile measurement data effectively has become an urgent problem. This paper presents a compressed sensing algorithm for the large amount of coal mine IoT moving measurement data based on a multi-hop network and total variation. By taking gas data in mobile measurement data as an example, two network models for the transmission of gas data flow, namely single-hop and multi-hop transmission modes, are investigated in depth, and a gas data compressed sensing collection model is built based on a multi-hop network. To utilize the sparse characteristics of gas data, the concept of total variation is introduced and a high-efficiency gas data compression and reconstruction method based on Total Variation Sparsity based on Multi-Hop (TVS-MH) is proposed. According to the simulation results, by using the proposed method, the moving measurement data flow from an underground distributed mobile network can be acquired and transmitted efficiently.

Deconvolution of mixing time series on a graph

PubMed Central

Blocker, Alexander W.; Airoldi, Edoardo M.

2013-01-01

In many applications we are interested in making inference on latent time series from indirect measurements, which are often low-dimensional projections resulting from mixing or aggregation. Positron emission tomography, super-resolution, and network traffic monitoring are some examples. Inference in such settings requires solving a sequence of ill-posed inverse problems, yt = Axt, where the projection mechanism provides information on A. We consider problems in which A specifies mixing on a graph of times series that are bursty and sparse. We develop a multilevel state-space model for mixing times series and an efficient approach to inference. A simple model is used to calibrate regularization parameters that lead to efficient inference in the multilevel state-space model. We apply this method to the problem of estimating point-to-point traffic flows on a network from aggregate measurements. Our solution outperforms existing methods for this problem, and our two-stage approach suggests an efficient inference strategy for multilevel models of multivariate time series. PMID:25309135

Spatial reasoning to determine stream network from LANDSAT imagery

NASA Technical Reports Server (NTRS)

Haralick, R. M.; Wang, S.; Elliott, D. B.

1983-01-01

In LANDSAT imagery, spectral and spatial information can be used to detect the drainage network as well as the relative elevation model in mountainous terrain. To do this, mixed information of material reflectance in the original LANDSAT imagery must be separated. From the material reflectance information, big visible rivers can be detected. From the topographic modulation information, ridges and valleys can be detected and assigned relative elevations. A complete elevation model can be generated by interpolating values for nonridge and non-valley pixels. The small streams not detectable from material reflectance information can be located in the valleys with flow direction known from the elevation model. Finally, the flow directions of big visible rivers can be inferred by solving a consistent labeling problem based on a set of spatial reasoning constraints.

RIACS

NASA Technical Reports Server (NTRS)

Oliger, Joseph

1997-01-01

Topics considered include: high-performance computing; cognitive and perceptual prostheses (computational aids designed to leverage human abilities); autonomous systems. Also included: development of a 3D unstructured grid code based on a finite volume formulation and applied to the Navier-stokes equations; Cartesian grid methods for complex geometry; multigrid methods for solving elliptic problems on unstructured grids; algebraic non-overlapping domain decomposition methods for compressible fluid flow problems on unstructured meshes; numerical methods for the compressible navier-stokes equations with application to aerodynamic flows; research in aerodynamic shape optimization; S-HARP: a parallel dynamic spectral partitioner; numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains; application of high-order shock capturing schemes to direct simulation of turbulence; multicast technology; network testbeds; supercomputer consolidation project.

Decentralized Optimal Dispatch of Photovoltaic Inverters in Residential Distribution Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall'Anese, Emiliano; Dhople, Sairaj V.; Johnson, Brian B.

Summary form only given. Decentralized methods for computing optimal real and reactive power setpoints for residential photovoltaic (PV) inverters are developed in this paper. It is known that conventional PV inverter controllers, which are designed to extract maximum power at unity power factor, cannot address secondary performance objectives such as voltage regulation and network loss minimization. Optimal power flow techniques can be utilized to select which inverters will provide ancillary services, and to compute their optimal real and reactive power setpoints according to well-defined performance criteria and economic objectives. Leveraging advances in sparsity-promoting regularization techniques and semidefinite relaxation, this papermore » shows how such problems can be solved with reduced computational burden and optimality guarantees. To enable large-scale implementation, a novel algorithmic framework is introduced - based on the so-called alternating direction method of multipliers - by which optimal power flow-type problems in this setting can be systematically decomposed into sub-problems that can be solved in a decentralized fashion by the utility and customer-owned PV systems with limited exchanges of information. Since the computational burden is shared among multiple devices and the requirement of all-to-all communication can be circumvented, the proposed optimization approach scales favorably to large distribution networks.« less

A class of solution-invariant transformations of cost functions for minimum cost flow phase unwrapping.

PubMed

Hubig, Michael; Suchandt, Steffen; Adam, Nico

2004-10-01

Phase unwrapping (PU) represents an important step in synthetic aperture radar interferometry (InSAR) and other interferometric applications. Among the different PU methods, the so called branch-cut approaches play an important role. In 1996 M. Costantini [Proceedings of the Fringe '96 Workshop ERS SAR Interferometry (European Space Agency, Munich, 1996), pp. 261-272] proposed to transform the problem of correctly placing branch cuts into a minimum cost flow (MCF) problem. The crucial point of this new approach is to generate cost functions that represent the a priori knowledge necessary for PU. Since cost functions are derived from measured data, they are random variables. This leads to the question of MCF solution stability: How much can the cost functions be varied without changing the cheapest flow that represents the correct branch cuts? This question is partially answered: The existence of a whole linear subspace in the space of cost functions is shown; this subspace contains all cost differences by which a cost function can be changed without changing the cost difference between any two flows that are discharging any residue configuration. These cost differences are called strictly stable cost differences. For quadrangular nonclosed networks (the most important type of MCF networks for interferometric purposes) a complete classification of strictly stable cost differences is presented. Further, the role of the well-known class of node potentials in the framework of strictly stable cost differences is investigated, and information on the vector-space structure representing the MCF environment is provided.

LETTER TO THE EDITOR: Dynamics of interacting neural networks

NASA Astrophysics Data System (ADS)

Kinzel, W.; Metzler, R.; Kanter, I.

2000-04-01

The dynamics of interacting perceptrons is solved analytically. For a directed flow of information the system runs into a state which has a higher symmetry than the topology of the model. A symmetry-breaking phase transition is found with increasing learning rate. In addition, it is shown that a system of interacting perceptrons which is trained on the history of its minority decisions develops a good strategy for the problem of adaptive competition known as the bar problem or minority game.

Characterize the hydraulic behaviour of grate inlet in urban drainage to prevent the urban's flooding

NASA Astrophysics Data System (ADS)

Tellez Alvarez, Jackson David; Gomez, Manuel; Russo, Beniamino; Redondo, Jose M.

2016-04-01

One of the most important problems that have some cities is the urban floods because of poor drainage design. Therefore the systems the drainage do not have the capacity of capture the flow of discharge generated in a rain event and insert it into the drainage network. Even though the two problems that have caught the main attention are the evaluation of the volumes falling in the river basin because extreme rainfall events often lead to urban pluvial flooding being a hydrologic problem and the hydraulic design of the sewer network being a hydraulic problem to limiting capacity of the drainage system, there is an intermediate step between these two processes that is necessary to solve that is the hydraulic behavior of the grate inlet. We need to collect the runoff produced on the city surface and to introduce it in the sewer network. Normally foundry companies provide complete information about drainage grate structural capacity but provide nothing about their hydraulic capacity. This fact can be seen because at the moment does not exist any official regulation at national or international level in this field. It's obvious that, nowadays, there is a great gap in this field at the legislative level owing to the complexity of this field and the modernity of the urban hydrology as science [1]. In essence, we shows the relevance to know the inlet hydraulic interception capacity because surface drainage requires a satisfactory knowledge on storm frequency, gutter flow and above all inlet capacity. In addition, we development an important achievement is the invention and development of techniques for measurement of field velocities in hydraulics engineering applications. Hence knowledge the technological advances in digital cameras with high resolution and high speed found in the environmental, and the advances in image processing techniques, therefore now is a tremendous potential to obtain of behavior of the water surface flow [2]. A novel technique using particle image velocimetry to measure surface flow velocities has been developed and validated with the experiments assays with the grate inlets [3 - 4]. Indeed, the Methodology carried out can become a useful tools to understand the hydraulics behavior of the flow approaching the inlet where the traditional measuring equipment have serious problems and limitations [5 - 6]. References [1] Gómez, M., Macchione, F. and Russo, B. (2006). Inlet systems and risk criteria associated to street runoff application to urban drainage catchments. 27 Corso di aggiornamiento in techniche per la difesa dall'inquinamento. [2] Russo, B., Gómez, M., & Tellez, J. (2013). Methodology to Estimate the Hydraulic Efficiency of Nontested Continuous Transverse Grates. Journal of Irrigation and Drainage Engineering, 139(10), 864-871. doi:10.1061/(ASCE)IR.1943-4774.0000625 [3] DigiFlow. User Guide. (2012), (June). [4] Vila, T., Tellez, J., Sanchez, J.M., Sotillos, L., Diez, M., and Redondo, J.M. (2014). Diffusion in fractal wakes and convective thermoelectric flows. Geophysical Research Abstracts - EGU General Assembly 2014. [5] Tellez, J., Gómez, M., Russo, B. and Redondo, J.M. (2014). A simple technique to measuring surface flow velocity to analyze the behavior of fields velocities in hydraulics engineer applications. Geophysical Research Abstracts - EGU General Assembly 2015. [6] Tellez, J., Gómez, M. and Russo, B. (2015). Técnica para la obtención del campo de velocidad del flujo superficial en proximidad de rejas de alcantarillado. IV Jornadas de Ingeniería del Agua. La precipitación y los procesos erosivos.

Deciphering deterioration mechanisms of complex diseases based on the construction of dynamic networks and systems analysis

NASA Astrophysics Data System (ADS)

Li, Yuanyuan; Jin, Suoqin; Lei, Lei; Pan, Zishu; Zou, Xiufen

2015-03-01

The early diagnosis and investigation of the pathogenic mechanisms of complex diseases are the most challenging problems in the fields of biology and medicine. Network-based systems biology is an important technique for the study of complex diseases. The present study constructed dynamic protein-protein interaction (PPI) networks to identify dynamical network biomarkers (DNBs) and analyze the underlying mechanisms of complex diseases from a systems level. We developed a model-based framework for the construction of a series of time-sequenced networks by integrating high-throughput gene expression data into PPI data. By combining the dynamic networks and molecular modules, we identified significant DNBs for four complex diseases, including influenza caused by either H3N2 or H1N1, acute lung injury and type 2 diabetes mellitus, which can serve as warning signals for disease deterioration. Function and pathway analyses revealed that the identified DNBs were significantly enriched during key events in early disease development. Correlation and information flow analyses revealed that DNBs effectively discriminated between different disease processes and that dysfunctional regulation and disproportional information flow may contribute to the increased disease severity. This study provides a general paradigm for revealing the deterioration mechanisms of complex diseases and offers new insights into their early diagnoses.

Geometric and topological characterization of porous media: insights from eigenvector centrality

NASA Astrophysics Data System (ADS)

Jimenez-Martinez, J.; Negre, C.

2017-12-01

Solving flow and transport through complex geometries such as porous media involves an extreme computational cost. Simplifications such as pore networks, where the pores are represented by nodes and the pore throats by edges connecting pores, have been proposed. These models have the ability to preserve the connectivity of the medium. However, they have difficulties capturing preferential paths (high velocity) and stagnation zones (low velocity), as they do not consider the specific relations between nodes. Network theory approaches, where the complex network is conceptualized like a graph, can help to simplify and better understand fluid dynamics and transport in porous media. To address this issue, we propose a method based on eigenvector centrality. It has been corrected to overcome the centralization problem and modified to introduce a bias in the centrality distribution along a particular direction which allows considering the flow and transport anisotropy in porous media. The model predictions are compared with millifluidic transport experiments, showing that this technique is computationally efficient and has potential for predicting preferential paths and stagnation zones for flow and transport in porous media. Entropy computed from the eigenvector centrality probability distribution is proposed as an indicator of the "mixing capacity" of the system.

Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks.

PubMed

Teng, Xian; Pei, Sen; Morone, Flaviano; Makse, Hernán A

2016-10-26

Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called "Collective Influence (CI)" has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes' significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy in realistic information spreading. Here, we examine real-world information flow in various social and scientific platforms including American Physical Society, Facebook, Twitter and LiveJournal. Since empirical data cannot be directly mapped to ideal multi-source spreading, we leverage the behavioral patterns of users extracted from data to construct "virtual" information spreading processes. Our results demonstrate that the set of spreaders selected by CI can induce larger scale of information propagation. Moreover, local measures as the number of connections or citations are not necessarily the deterministic factors of nodes' importance in realistic information spreading. This result has significance for rankings scientists in scientific networks like the APS, where the commonly used number of citations can be a poor indicator of the collective influence of authors in the community.

High-performance parallel analysis of coupled problems for aircraft propulsion

NASA Technical Reports Server (NTRS)

Felippa, C. A.; Farhat, C.; Lanteri, S.; Maman, N.; Piperno, S.; Gumaste, U.

1994-01-01

This research program deals with the application of high-performance computing methods for the analysis of complete jet engines. We have entitled this program by applying the two dimensional parallel aeroelastic codes to the interior gas flow problem of a bypass jet engine. The fluid mesh generation, domain decomposition, and solution capabilities were successfully tested. We then focused attention on methodology for the partitioned analysis of the interaction of the gas flow with a flexible structure and with the fluid mesh motion that results from these structural displacements. This is treated by a new arbitrary Lagrangian-Eulerian (ALE) technique that models the fluid mesh motion as that of a fictitious mass-spring network. New partitioned analysis procedures to treat this coupled three-component problem are developed. These procedures involved delayed corrections and subcycling. Preliminary results on the stability, accuracy, and MPP computational efficiency are reported.

Stationary metrics and optical Zermelo-Randers-Finsler geometry

NASA Astrophysics Data System (ADS)

Gibbons, G. W.; Herdeiro, C. A. R.; Warnick, C. M.; Werner, M. C.

2009-02-01

We consider a triality between the Zermelo navigation problem, the geodesic flow on a Finslerian geometry of Randers type, and spacetimes in one dimension higher admitting a timelike conformal Killing vector field. From the latter viewpoint, the data of the Zermelo problem are encoded in a (conformally) Painlevé-Gullstrand form of the spacetime metric, whereas the data of the Randers problem are encoded in a stationary generalization of the usual optical metric. We discuss how the spacetime viewpoint gives a simple and physical perspective on various issues, including how Finsler geometries with constant flag curvature always map to conformally flat spacetimes and that the Finsler condition maps to either a causality condition or it breaks down at an ergo surface in the spacetime picture. The gauge equivalence in this network of relations is considered as well as the connection to analogue models and the viewpoint of magnetic flows. We provide a variety of examples.

Inverse modeling of the hydraulic properties of fractured media : development of a flow tomography approach

NASA Astrophysics Data System (ADS)

Bour, O.; Klepikova, M.; Le Borgne, T.; De Dreuzy, J.

2013-12-01

Inverse modeling of hydraulic and geometrical properties of fractured media is a very challenging objective due to the spatial heterogeneity of the medium and the scarcity of data. Here we present a flow tomography approach that permits to characterize the location, the connectivity and the hydraulic properties of main flow paths in fractured media. The accurate characterization of the location, hydraulic properties and connectivity of major fracture zones is essential to model flow and solute transport in fractured media. Cross-borehole flowmeter tests, which consist of measuring changes in vertical borehole flows when pumping a neighboring borehole, were shown to be an efficient technique to provide information on the properties of the flow zones that connect borehole pairs [Paillet, 1998; Le Borgne et al., 2006]. The interpretation of such experiments may however be quite uncertain when multiple connections exist. In this study, we explore the potential of flow tomography (i.e., sequential cross-borehole flowmeter tests) for characterizing aquifer heterogeneity. We first propose a framework for inverting flow and drawdown data to infer fracture connectivity and transmissivities. Here we use a simplified discrete fracture network approach that highlights main connectivity structures. This conceptual model attempts to reproduce fracture network connectivity without taking fracture geometry (length, orientation, dip) into account. We then explore the potential of the method for simplified synthetic fracture network models and quantify the sensitivity of drawdown and borehole flow velocities to the transmissivity of the connecting flowpaths. Flow tomography is expected to be most effective if cross-borehole pumping induces large changes in vertical borehole velocities. The uncertainty of the transmissivity estimates increases for small borehole flow velocities. The uncertainty about the transmissivity of fractures that connect the main flowpath but not the boreholes is generally higher. We demonstrate that successively changing pumping and observation boreholes improves the quality of available information and reduces the indetermination of the problem. The inverse method is validated for different synthetic flow scenarios. It is shown to provide a good estimation of connectivity patterns and transmissivities of main flowpaths. Although the chosen fracture network geometry has been simplified, flow tomography appears to be a promising approach for characterizing connectivity patterns and transmissivities of fractured media.

Initial Validation for the Estimation of Resting-State fMRI Effective Connectivity by a Generalization of the Correlation Approach

PubMed Central

Xu, Nan; Spreng, R. Nathan; Doerschuk, Peter C.

2017-01-01

Resting-state functional MRI (rs-fMRI) is widely used to noninvasively study human brain networks. Network functional connectivity is often estimated by calculating the timeseries correlation between blood-oxygen-level dependent (BOLD) signal from different regions of interest (ROIs). However, standard correlation cannot characterize the direction of information flow between regions. In this paper, we introduce and test a new concept, prediction correlation, to estimate effective connectivity in functional brain networks from rs-fMRI. In this approach, the correlation between two BOLD signals is replaced by a correlation between one BOLD signal and a prediction of this signal via a causal system driven by another BOLD signal. Three validations are described: (1) Prediction correlation performed well on simulated data where the ground truth was known, and outperformed four other methods. (2) On simulated data designed to display the “common driver” problem, prediction correlation did not introduce false connections between non-interacting driven ROIs. (3) On experimental data, prediction correlation recovered the previously identified network organization of human brain. Prediction correlation scales well to work with hundreds of ROIs, enabling it to assess whole brain interregional connectivity at the single subject level. These results provide an initial validation that prediction correlation can capture the direction of information flow and estimate the duration of extended temporal delays in information flow between regions of interest ROIs based on BOLD signal. This approach not only maintains the high sensitivity to network connectivity provided by the correlation analysis, but also performs well in the estimation of causal information flow in the brain. PMID:28559793

Tumor Blood Vessel Dynamics

NASA Astrophysics Data System (ADS)

Munn, Lance

2009-11-01

``Normalization'' of tumor blood vessels has shown promise to improve the efficacy of chemotherapeutics. In theory, anti-angiogenic drugs targeting endothelial VEGF signaling can improve vessel network structure and function, enhancing the transport of subsequent cytotoxic drugs to cancer cells. In practice, the effects are unpredictable, with varying levels of success. The predominant effects of anti-VEGF therapies are decreased vessel leakiness (hydraulic conductivity), decreased vessel diameters and pruning of the immature vessel network. It is thought that each of these can influence perfusion of the vessel network, inducing flow in regions that were previously sluggish or stagnant. Unfortunately, when anti-VEGF therapies affect vessel structure and function, the changes are dynamic and overlapping in time, and it has been difficult to identify a consistent and predictable normalization ``window'' during which perfusion and subsequent drug delivery is optimal. This is largely due to the non-linearity in the system, and the inability to distinguish the effects of decreased vessel leakiness from those due to network structural changes in clinical trials or animal studies. We have developed a mathematical model to calculate blood flow in complex tumor networks imaged by two-photon microscopy. The model incorporates the necessary and sufficient components for addressing the problem of normalization of tumor vasculature: i) lattice-Boltzmann calculations of the full flow field within the vasculature and within the tissue, ii) diffusion and convection of soluble species such as oxygen or drugs within vessels and the tissue domain, iii) distinct and spatially-resolved vessel hydraulic conductivities and permeabilities for each species, iv) erythrocyte particles advecting in the flow and delivering oxygen with real oxygen release kinetics, v) shear stress-mediated vascular remodeling. This model, guided by multi-parameter intravital imaging of tumor vessel structure and function, provides a tool for identifying the structural and functional determinants of tumor vessel normalization.

Consistent initial conditions for the Saint-Venant equations in river network modeling

NASA Astrophysics Data System (ADS)

Yu, Cheng-Wei; Liu, Frank; Hodges, Ben R.

2017-09-01

Initial conditions for flows and depths (cross-sectional areas) throughout a river network are required for any time-marching (unsteady) solution of the one-dimensional (1-D) hydrodynamic Saint-Venant equations. For a river network modeled with several Strahler orders of tributaries, comprehensive and consistent synoptic data are typically lacking and synthetic starting conditions are needed. Because of underlying nonlinearity, poorly defined or inconsistent initial conditions can lead to convergence problems and long spin-up times in an unsteady solver. Two new approaches are defined and demonstrated herein for computing flows and cross-sectional areas (or depths). These methods can produce an initial condition data set that is consistent with modeled landscape runoff and river geometry boundary conditions at the initial time. These new methods are (1) the pseudo time-marching method (PTM) that iterates toward a steady-state initial condition using an unsteady Saint-Venant solver and (2) the steady-solution method (SSM) that makes use of graph theory for initial flow rates and solution of a steady-state 1-D momentum equation for the channel cross-sectional areas. The PTM is shown to be adequate for short river reaches but is significantly slower and has occasional non-convergent behavior for large river networks. The SSM approach is shown to provide a rapid solution of consistent initial conditions for both small and large networks, albeit with the requirement that additional code must be written rather than applying an existing unsteady Saint-Venant solver.

Exact and heuristic algorithms for Space Information Flow.

PubMed

Uwitonze, Alfred; Huang, Jiaqing; Ye, Yuanqing; Cheng, Wenqing; Li, Zongpeng

2018-01-01

Space Information Flow (SIF) is a new promising research area that studies network coding in geometric space, such as Euclidean space. The design of algorithms that compute the optimal SIF solutions remains one of the key open problems in SIF. This work proposes the first exact SIF algorithm and a heuristic SIF algorithm that compute min-cost multicast network coding for N (N ≥ 3) given terminal nodes in 2-D Euclidean space. Furthermore, we find that the Butterfly network in Euclidean space is the second example besides the Pentagram network where SIF is strictly better than Euclidean Steiner minimal tree. The exact algorithm design is based on two key techniques: Delaunay triangulation and linear programming. Delaunay triangulation technique helps to find practically good candidate relay nodes, after which a min-cost multicast linear programming model is solved over the terminal nodes and the candidate relay nodes, to compute the optimal multicast network topology, including the optimal relay nodes selected by linear programming from all the candidate relay nodes and the flow rates on the connection links. The heuristic algorithm design is also based on Delaunay triangulation and linear programming techniques. The exact algorithm can achieve the optimal SIF solution with an exponential computational complexity, while the heuristic algorithm can achieve the sub-optimal SIF solution with a polynomial computational complexity. We prove the correctness of the exact SIF algorithm. The simulation results show the effectiveness of the heuristic SIF algorithm.

"Time-dependent flow-networks"

NASA Astrophysics Data System (ADS)

Tupikina, Liubov; Molkentin, Nora; Lopez, Cristobal; Hernandez-Garcia, Emilio; Marwan, Norbert; Kurths, Jürgen

2015-04-01

Complex networks have been successfully applied to various systems such as society, technology, and recently climate. Links in a climate network are defined between two geographical locations if the correlation between the time series of some climate variable is higher than a threshold. Therefore, network links are considered to imply information or heat exchange. However, the relationship between the oceanic and atmospheric flows and the climate network's structure is still unclear. Recently, a theoretical approach verifying the correlation between ocean currents and surface air temperature networks has been introduced, where the Pearson correlation networks were constructed from advection-diffusion dynamics on an underlying flow. Since the continuous approach has its limitations, i.e. high computational complexity and fixed variety of the flows in the underlying system, we introduce a new, method of flow-networks for changing in time velocity fields including external forcing in the system, noise and temperature-decay. Method of the flow-network construction can be divided into several steps: first we obtain the linear recursive equation for the temperature time-series. Then we compute the correlation matrix for time-series averaging the tensor product over all realizations of the noise, which we interpret as a weighted adjacency matrix of the flow-network and analyze using network measures. We apply the method to different types of moving flows with geographical relevance such as meandering flow. Analyzing the flow-networks using network measures we find that our approach can highlight zones of high velocity by degree and transition zones by betweenness, while the combination of these network measures can uncover how the flow propagates within time. Flow-networks can be powerful tool to understand the connection between system's dynamics and network's topology analyzed using network measures in order to shed light on different climatic phenomena.

Network Flow Simulation of Fluid Transients in Rocket Propulsion Systems

NASA Technical Reports Server (NTRS)

Bandyopadhyay, Alak; Hamill, Brian; Ramachandran, Narayanan; Majumdar, Alok

2011-01-01

Fluid transients, also known as water hammer, can have a significant impact on the design and operation of both spacecraft and launch vehicle propulsion systems. These transients often occur at system activation and shutdown. The pressure rise due to sudden opening and closing of valves of propulsion feed lines can cause serious damage during activation and shutdown of propulsion systems. During activation (valve opening) and shutdown (valve closing), pressure surges must be predicted accurately to ensure structural integrity of the propulsion system fluid network. In the current work, a network flow simulation software (Generalized Fluid System Simulation Program) based on Finite Volume Method has been used to predict the pressure surges in the feed line due to both valve closing and valve opening using two separate geometrical configurations. The valve opening pressure surge results are compared with experimental data available in the literature and the numerical results compared very well within reasonable accuracy (< 5%) for a wide range of inlet-to-initial pressure ratios. A Fast Fourier Transform is preformed on the pressure oscillations to predict the various modal frequencies of the pressure wave. The shutdown problem, i.e. valve closing problem, the simulation results are compared with the results of Method of Characteristics. Most rocket engines experience a longitudinal acceleration, known as "pogo" during the later stage of engine burn. In the shutdown example problem, an accumulator has been used in the feed system to demonstrate the "pogo" mitigation effects in the feed system of propellant. The simulation results using GFSSP compared very well with the results of Method of Characteristics.

Achieving Fair Throughput among TCP Flows in Multi-Hop Wireless Mesh Networks

NASA Astrophysics Data System (ADS)

Hou, Ting-Chao; Hsu, Chih-Wei

Previous research shows that the IEEE 802.11 DCF channel contention mechanism is not capable of providing throughput fairness among nodes in different locations of the wireless mesh network. The node nearest the gateway will always strive for the chance to transmit data, causing fewer transmission opportunities for the nodes farther from the gateway, resulting in starvation. Prior studies modify the DCF mechanism to address the fairness problem. This paper focuses on the fairness study when TCP flows are carried over wireless mesh networks. By not modifying lower layer protocols, the current work identifies TCP parameters that impact throughput fairness and proposes adjusting those parameters to reduce frame collisions and improve throughput fairness. With the aid of mathematical formulation and ns2 simulations, this study finds that frame transmission from each node can be effectively controlled by properly controlling the delayed ACK timer and using a suitable advertised window. The proposed method reduces frame collisions and greatly improves TCP throughput fairness.

Analysis and experimental verification of new power flow control for grid-connected inverter with LCL filter in microgrid.

PubMed

Gu, Herong; Guan, Yajuan; Wang, Huaibao; Wei, Baoze; Guo, Xiaoqiang

2014-01-01

Microgrid is an effective way to integrate the distributed energy resources into the utility networks. One of the most important issues is the power flow control of grid-connected voltage-source inverter in microgrid. In this paper, the small-signal model of the power flow control for the grid-connected inverter is established, from which it can be observed that the conventional power flow control may suffer from the poor damping and slow transient response. While the new power flow control can mitigate these problems without affecting the steady-state power flow regulation. Results of continuous-domain simulations in MATLAB and digital control experiments based on a 32-bit fixed-point TMS320F2812 DSP are in good agreement, which verify the small signal model analysis and effectiveness of the proposed method.

The production route selection algorithm in virtual manufacturing networks

NASA Astrophysics Data System (ADS)

Krenczyk, D.; Skolud, B.; Olender, M.

2017-08-01

The increasing requirements and competition in the global market are challenges for the companies profitability in production and supply chain management. This situation became the basis for construction of virtual organizations, which are created in response to temporary needs. The problem of the production flow planning in virtual manufacturing networks is considered. In the paper the algorithm of the production route selection from the set of admissible routes, which meets the technology and resource requirements and in the context of the criterion of minimum cost is proposed.

Recurrent Neural Networks With Auxiliary Memory Units.

PubMed

Wang, Jianyong; Zhang, Lei; Guo, Quan; Yi, Zhang

2018-05-01

Memory is one of the most important mechanisms in recurrent neural networks (RNNs) learning. It plays a crucial role in practical applications, such as sequence learning. With a good memory mechanism, long term history can be fused with current information, and can thus improve RNNs learning. Developing a suitable memory mechanism is always desirable in the field of RNNs. This paper proposes a novel memory mechanism for RNNs. The main contributions of this paper are: 1) an auxiliary memory unit (AMU) is proposed, which results in a new special RNN model (AMU-RNN), separating the memory and output explicitly and 2) an efficient learning algorithm is developed by employing the technique of error flow truncation. The proposed AMU-RNN model, together with the developed learning algorithm, can learn and maintain stable memory over a long time range. This method overcomes both the learning conflict problem and gradient vanishing problem. Unlike the traditional method, which mixes the memory and output with a single neuron in a recurrent unit, the AMU provides an auxiliary memory neuron to maintain memory in particular. By separating the memory and output in a recurrent unit, the problem of learning conflicts can be eliminated easily. Moreover, by using the technique of error flow truncation, each auxiliary memory neuron ensures constant error flow during the learning process. The experiments demonstrate good performance of the proposed AMU-RNNs and the developed learning algorithm. The method exhibits quite efficient learning performance with stable convergence in the AMU-RNN learning and outperforms the state-of-the-art RNN models in sequence generation and sequence classification tasks.

Dynamic Flow Management Problems in Air Transportation

NASA Technical Reports Server (NTRS)

Patterson, Sarah Stock

1997-01-01

In 1995, over six hundred thousand licensed pilots flew nearly thirty-five million flights into over eighteen thousand U.S. airports, logging more than 519 billion passenger miles. Since demand for air travel has increased by more than 50% in the last decade while capacity has stagnated, congestion is a problem of undeniable practical significance. In this thesis, we will develop optimization techniques that reduce the impact of congestion on the national airspace. We start by determining the optimal release times for flights into the airspace and the optimal speed adjustment while airborne taking into account the capacitated airspace. This is called the Air Traffic Flow Management Problem (TFMP). We address the complexity, showing that it is NP-hard. We build an integer programming formulation that is quite strong as some of the proposed inequalities are facet defining for the convex hull of solutions. For practical problems, the solutions of the LP relaxation of the TFMP are very often integral. In essence, we reduce the problem to efficiently solving large scale linear programming problems. Thus, the computation times are reasonably small for large scale, practical problems involving thousands of flights. Next, we address the problem of determining how to reroute aircraft in the airspace system when faced with dynamically changing weather conditions. This is called the Air Traffic Flow Management Rerouting Problem (TFMRP) We present an integrated mathematical programming approach for the TFMRP, which utilizes several methodologies, in order to minimize delay costs. In order to address the high dimensionality, we present an aggregate model, in which we formulate the TFMRP as a multicommodity, integer, dynamic network flow problem with certain side constraints. Using Lagrangian relaxation, we generate aggregate flows that are decomposed into a collection of flight paths using a randomized rounding heuristic. This collection of paths is used in a packing integer programming formulation, the solution of which generates feasible and near-optimal routes for individual flights. The algorithm, termed the Lagrangian Generation Algorithm, is used to solve practical problems in the southwestern portion of United States in which the solutions are within 1% of the corresponding lower bounds.

Analysis of oil-pipeline distribution of multiple products subject to delivery time-windows

NASA Astrophysics Data System (ADS)

Jittamai, Phongchai

This dissertation defines the operational problems of, and develops solution methodologies for, a distribution of multiple products into oil pipeline subject to delivery time-windows constraints. A multiple-product oil pipeline is a pipeline system composing of pipes, pumps, valves and storage facilities used to transport different types of liquids. Typically, products delivered by pipelines are petroleum of different grades moving either from production facilities to refineries or from refineries to distributors. Time-windows, which are generally used in logistics and scheduling areas, are incorporated in this study. The distribution of multiple products into oil pipeline subject to delivery time-windows is modeled as multicommodity network flow structure and mathematically formulated. The main focus of this dissertation is the investigation of operating issues and problem complexity of single-source pipeline problems and also providing solution methodology to compute input schedule that yields minimum total time violation from due delivery time-windows. The problem is proved to be NP-complete. The heuristic approach, a reversed-flow algorithm, is developed based on pipeline flow reversibility to compute input schedule for the pipeline problem. This algorithm is implemented in no longer than O(T·E) time. This dissertation also extends the study to examine some operating attributes and problem complexity of multiple-source pipelines. The multiple-source pipeline problem is also NP-complete. A heuristic algorithm modified from the one used in single-source pipeline problems is introduced. This algorithm can also be implemented in no longer than O(T·E) time. Computational results are presented for both methodologies on randomly generated problem sets. The computational experience indicates that reversed-flow algorithms provide good solutions in comparison with the optimal solutions. Only 25% of the problems tested were more than 30% greater than optimal values and approximately 40% of the tested problems were solved optimally by the algorithms.

Flow-pattern identification and nonlinear dynamics of gas-liquid two-phase flow in complex networks.

PubMed

Gao, Zhongke; Jin, Ningde

2009-06-01

The identification of flow pattern is a basic and important issue in multiphase systems. Because of the complexity of phase interaction in gas-liquid two-phase flow, it is difficult to discern its flow pattern objectively. In this paper, we make a systematic study on the vertical upward gas-liquid two-phase flow using complex network. Three unique network construction methods are proposed to build three types of networks, i.e., flow pattern complex network (FPCN), fluid dynamic complex network (FDCN), and fluid structure complex network (FSCN). Through detecting the community structure of FPCN by the community-detection algorithm based on K -mean clustering, useful and interesting results are found which can be used for identifying five vertical upward gas-liquid two-phase flow patterns. To investigate the dynamic characteristics of gas-liquid two-phase flow, we construct 50 FDCNs under different flow conditions, and find that the power-law exponent and the network information entropy, which are sensitive to the flow pattern transition, can both characterize the nonlinear dynamics of gas-liquid two-phase flow. Furthermore, we construct FSCN and demonstrate how network statistic can be used to reveal the fluid structure of gas-liquid two-phase flow. In this paper, from a different perspective, we not only introduce complex network theory to the study of gas-liquid two-phase flow but also indicate that complex network may be a powerful tool for exploring nonlinear time series in practice.

Hodge Decomposition of Information Flow on Small-World Networks.

PubMed

Haruna, Taichi; Fujiki, Yuuya

2016-01-01

We investigate the influence of the small-world topology on the composition of information flow on networks. By appealing to the combinatorial Hodge theory, we decompose information flow generated by random threshold networks on the Watts-Strogatz model into three components: gradient, harmonic and curl flows. The harmonic and curl flows represent globally circular and locally circular components, respectively. The Watts-Strogatz model bridges the two extreme network topologies, a lattice network and a random network, by a single parameter that is the probability of random rewiring. The small-world topology is realized within a certain range between them. By numerical simulation we found that as networks become more random the ratio of harmonic flow to the total magnitude of information flow increases whereas the ratio of curl flow decreases. Furthermore, both quantities are significantly enhanced from the level when only network structure is considered for the network close to a random network and a lattice network, respectively. Finally, the sum of these two ratios takes its maximum value within the small-world region. These findings suggest that the dynamical information counterpart of global integration and that of local segregation are the harmonic flow and the curl flow, respectively, and that a part of the small-world region is dominated by internal circulation of information flow.

Global Education Inc.: New Policy Networks and the Neoliberal Imaginary

ERIC Educational Resources Information Center

Ball, Stephen J.

2012-01-01

Do private and philanthropic solutions to the problems of education signal the end of state education in its "welfare" form? Education policy is being reformed and re-worked on a global scale. Policies are flowing and converging to produce a singular vision of "best practice" based on the methods and tenets of the "neo-liberal imaginary".…

Resilience-based optimal design of water distribution network

NASA Astrophysics Data System (ADS)

Suribabu, C. R.

2017-11-01

Optimal design of water distribution network is generally aimed to minimize the capital cost of the investments on tanks, pipes, pumps, and other appurtenances. Minimizing the cost of pipes is usually considered as a prime objective as its proportion in capital cost of the water distribution system project is very high. However, minimizing the capital cost of the pipeline alone may result in economical network configuration, but it may not be a promising solution in terms of resilience point of view. Resilience of the water distribution network has been considered as one of the popular surrogate measures to address ability of network to withstand failure scenarios. To improve the resiliency of the network, the pipe network optimization can be performed with two objectives, namely minimizing the capital cost as first objective and maximizing resilience measure of the configuration as secondary objective. In the present work, these two objectives are combined as single objective and optimization problem is solved by differential evolution technique. The paper illustrates the procedure for normalizing the objective functions having distinct metrics. Two of the existing resilience indices and power efficiency are considered for optimal design of water distribution network. The proposed normalized objective function is found to be efficient under weighted method of handling multi-objective water distribution design problem. The numerical results of the design indicate the importance of sizing pipe telescopically along shortest path of flow to have enhanced resiliency indices.

Connectivity Restoration in Wireless Sensor Networks via Space Network Coding.

PubMed

Uwitonze, Alfred; Huang, Jiaqing; Ye, Yuanqing; Cheng, Wenqing

2017-04-20

The problem of finding the number and optimal positions of relay nodes for restoring the network connectivity in partitioned Wireless Sensor Networks (WSNs) is Non-deterministic Polynomial-time hard (NP-hard) and thus heuristic methods are preferred to solve it. This paper proposes a novel polynomial time heuristic algorithm, namely, Relay Placement using Space Network Coding (RPSNC), to solve this problem, where Space Network Coding, also called Space Information Flow (SIF), is a new research paradigm that studies network coding in Euclidean space, in which extra relay nodes can be introduced to reduce the cost of communication. Unlike contemporary schemes that are often based on Minimum Spanning Tree (MST), Euclidean Steiner Minimal Tree (ESMT) or a combination of MST with ESMT, RPSNC is a new min-cost multicast space network coding approach that combines Delaunay triangulation and non-uniform partitioning techniques for generating a number of candidate relay nodes, and then linear programming is applied for choosing the optimal relay nodes and computing their connection links with terminals. Subsequently, an equilibrium method is used to refine the locations of the optimal relay nodes, by moving them to balanced positions. RPSNC can adapt to any density distribution of relay nodes and terminals, as well as any density distribution of terminals. The performance and complexity of RPSNC are analyzed and its performance is validated through simulation experiments.

Determination of trunk streams via using flow accumulation values

NASA Astrophysics Data System (ADS)

Farek, Vladimir

2013-04-01

There is often a problem, with schematisation of catchments and a channel networks in a broken relief like sandstone landscape (with high vertical segmentation, narrow valley lines, crags, sheer rocks, endorheic hollows etc.). Usual hydrological parameters (subcatchment areas, altitude of highest point of subcatchment, water discharge), which are mostly used for determination of trunk stream upstream the junction, are frequently not utilizable very well in this kind of relief. We found, that for small, relatively homogeneous catchments (within the meaning of land-use, geological subsurface, anthropogenic influence etc.), which are extremely shaped, the value called "flow accumulation" (FA) could be very useful. This value gives the number of cells of the Digital Elevation Model (DEM) grid, which are drained to each cell of the catchment. We can predict that the stream channel with higher values of flow accumulation represents the main stream. There are three crucial issues with this theory. At first it is necessary to find the most suitable algorithm for calculation flow accumulation in a broken relief. Various algorithms could have complications with correct flow routing (representation of divergent or convergent character of the flow), or with keeping the flow paths uninterrupted. Relief with high curvature changes (alternating concave/convex shapes, high steepness changes) causes interrupting of flow lines in many algorithms used for hydrological computing. Second - set down limits of this theory (e.g. the size and character of a surveyed catchment). Third - verify this theory in reality. We tested this theory on sandstone landscape of National park Czech Switzerland. The main data source were high-resolution LIDAR (Light Detection and Ranging) DEM snapshots of surveyed area. This data comes from TU Dresden project called Genesis (Geoinformation Networks For The Cross- Border National Park Region Saxon- Bohemian Switzerland). In order to solve these issues GIS applications (e. g. GIS GRASS and its hydrological modules like r.terraflow, r.watershed, r.flow etc.) are very useful. Key words: channel network, flow accumulation, Digital Elevation Model, LIDAR, broken relief, GIS GRASS

Identifying and characterizing key nodes among communities based on electrical-circuit networks.

PubMed

Zhu, Fenghui; Wang, Wenxu; Di, Zengru; Fan, Ying

2014-01-01

Complex networks with community structures are ubiquitous in the real world. Despite many approaches developed for detecting communities, we continue to lack tools for identifying overlapping and bridging nodes that play crucial roles in the interactions and communications among communities in complex networks. Here we develop an algorithm based on the local flow conservation to effectively and efficiently identify and distinguish the two types of nodes. Our method is applicable in both undirected and directed networks without a priori knowledge of the community structure. Our method bypasses the extremely challenging problem of partitioning communities in the presence of overlapping nodes that may belong to multiple communities. Due to the fact that overlapping and bridging nodes are of paramount importance in maintaining the function of many social and biological networks, our tools open new avenues towards understanding and controlling real complex networks with communities accompanied with the key nodes.

Dual Temporal Scale Convolutional Neural Network for Micro-Expression Recognition.

PubMed

Peng, Min; Wang, Chongyang; Chen, Tong; Liu, Guangyuan; Fu, Xiaolan

2017-01-01

Facial micro-expression is a brief involuntary facial movement and can reveal the genuine emotion that people try to conceal. Traditional methods of spontaneous micro-expression recognition rely excessively on sophisticated hand-crafted feature design and the recognition rate is not high enough for its practical application. In this paper, we proposed a Dual Temporal Scale Convolutional Neural Network (DTSCNN) for spontaneous micro-expressions recognition. The DTSCNN is a two-stream network. Different of stream of DTSCNN is used to adapt to different frame rate of micro-expression video clips. Each stream of DSTCNN consists of independent shallow network for avoiding the overfitting problem. Meanwhile, we fed the networks with optical-flow sequences to ensure that the shallow networks can further acquire higher-level features. Experimental results on spontaneous micro-expression databases (CASME I/II) showed that our method can achieve a recognition rate almost 10% higher than what some state-of-the-art method can achieve.

Sometimes There Is No Most-Vital Arc: Assessing and Improving the Operational Resilience of Systems

DTIC Science & Technology

2013-01-01

this problem in which the reduction in capacity on each in- terdicted arc is a random variable with known mean and variance , and the overall goal is...capacities will allow. A classic result in the theory of network flows states that the maximum flow volume is equal to the min- imum capacity of any cut, where...attack capability provides a natural means to assess the resilience of the system as a whole. This analysis yields a corollary result that common-sense

Interpolating between random walks and optimal transportation routes: Flow with multiple sources and targets

NASA Astrophysics Data System (ADS)

Guex, Guillaume

2016-05-01

In recent articles about graphs, different models proposed a formalism to find a type of path between two nodes, the source and the target, at crossroads between the shortest-path and the random-walk path. These models include a freely adjustable parameter, allowing to tune the behavior of the path toward randomized movements or direct routes. This article presents a natural generalization of these models, namely a model with multiple sources and targets. In this context, source nodes can be viewed as locations with a supply of a certain good (e.g. people, money, information) and target nodes as locations with a demand of the same good. An algorithm is constructed to display the flow of goods in the network between sources and targets. With again a freely adjustable parameter, this flow can be tuned to follow routes of minimum cost, thus displaying the flow in the context of the optimal transportation problem or, by contrast, a random flow, known to be similar to the electrical current flow if the random-walk is reversible. Moreover, a source-targetcoupling can be retrieved from this flow, offering an optimal assignment to the transportation problem. This algorithm is described in the first part of this article and then illustrated with case studies.

Efficient quantum transmission in multiple-source networks.

PubMed

Luo, Ming-Xing; Xu, Gang; Chen, Xiu-Bo; Yang, Yi-Xian; Wang, Xiaojun

2014-04-02

A difficult problem in quantum network communications is how to efficiently transmit quantum information over large-scale networks with common channels. We propose a solution by developing a quantum encoding approach. Different quantum states are encoded into a coherent superposition state using quantum linear optics. The transmission congestion in the common channel may be avoided by transmitting the superposition state. For further decoding and continued transmission, special phase transformations are applied to incoming quantum states using phase shifters such that decoders can distinguish outgoing quantum states. These phase shifters may be precisely controlled using classical chaos synchronization via additional classical channels. Based on this design and the reduction of multiple-source network under the assumption of restricted maximum-flow, the optimal scheme is proposed for specially quantized multiple-source network. In comparison with previous schemes, our scheme can greatly increase the transmission efficiency.

Current-flow efficiency of networks

NASA Astrophysics Data System (ADS)

Liu, Kai; Yan, Xiaoyong

2018-02-01

Many real-world networks, from infrastructure networks to social and communication networks, can be formulated as flow networks. How to realistically measure the transport efficiency of these networks is of fundamental importance. The shortest-path-based efficiency measurement has limitations, as it assumes that flow travels only along those shortest paths. Here, we propose a new metric named current-flow efficiency, in which we calculate the average reciprocal effective resistance between all pairs of nodes in the network. This metric takes the multipath effect into consideration and is more suitable for measuring the efficiency of many real-world flow equilibrium networks. Moreover, this metric can handle a disconnected graph and can thus be used to identify critical nodes and edges from the efficiency-loss perspective. We further analyze how the topological structure affects the current-flow efficiency of networks based on some model and real-world networks. Our results enable a better understanding of flow networks and shed light on the design and improvement of such networks with higher transport efficiency.

A two-stage flow-based intrusion detection model for next-generation networks.

PubMed

Umer, Muhammad Fahad; Sher, Muhammad; Bi, Yaxin

2018-01-01

The next-generation network provides state-of-the-art access-independent services over converged mobile and fixed networks. Security in the converged network environment is a major challenge. Traditional packet and protocol-based intrusion detection techniques cannot be used in next-generation networks due to slow throughput, low accuracy and their inability to inspect encrypted payload. An alternative solution for protection of next-generation networks is to use network flow records for detection of malicious activity in the network traffic. The network flow records are independent of access networks and user applications. In this paper, we propose a two-stage flow-based intrusion detection system for next-generation networks. The first stage uses an enhanced unsupervised one-class support vector machine which separates malicious flows from normal network traffic. The second stage uses a self-organizing map which automatically groups malicious flows into different alert clusters. We validated the proposed approach on two flow-based datasets and obtained promising results.

A two-stage flow-based intrusion detection model for next-generation networks

PubMed Central

2018-01-01

The next-generation network provides state-of-the-art access-independent services over converged mobile and fixed networks. Security in the converged network environment is a major challenge. Traditional packet and protocol-based intrusion detection techniques cannot be used in next-generation networks due to slow throughput, low accuracy and their inability to inspect encrypted payload. An alternative solution for protection of next-generation networks is to use network flow records for detection of malicious activity in the network traffic. The network flow records are independent of access networks and user applications. In this paper, we propose a two-stage flow-based intrusion detection system for next-generation networks. The first stage uses an enhanced unsupervised one-class support vector machine which separates malicious flows from normal network traffic. The second stage uses a self-organizing map which automatically groups malicious flows into different alert clusters. We validated the proposed approach on two flow-based datasets and obtained promising results. PMID:29329294

Computer aided approximation of flow rate through systemic-pulmonary arterial shunts (SPAS).

PubMed

Vennemann, Peter; Montag, Michael; Peters, Franz; Merzkirch, Wolfgang

2012-02-22

The discrimination of flow rates through bronchial arteries that are affected by pathological SPAS today still happens solely qualitatively. A reproducible quantification of flow rates, however, would enable the comprehension of phenomena like the intensified shunt perfusion seen in cases of chronic inflammations or the characterization of SPAS that may cause cardiovascular problems. A computational program is developed, that allows the modeling of individual bronchial arteries on the basis of the information provided by angiography. Angiographic images are available from the standard clinical assessment of SPAS. The flow through continuous and geometrically measurable vessel segments and SPAS is given by the law of Hagen-Poiseuille. The discharge through healthy branches is calculated by means of allometric scaling laws. The simulation results are verified by flow experiments in artificial vessel networks made of glass and PE tubing. The experimental set-up mimics realistic, pulsating pressure and flow conditions. When applied to the artificial vessel networks, the model described herein provides results for the volumetric flow rate that differ from values measured in laboratory experiments by <6%. The computer model is also applied to real angiographic images. Due to inaccuracies during the deduction of the geometry and due to necessary simplifications of the model, we expect significant deviations between calculated and real flow rates in bronchial systems. Nevertheless, the presented method enables the physician to objectively estimate the order of magnitude of volumetric flow through individual SPAS fairly independently from his experience and without the need of measurements additional to the mandatory angiography.

Power laws and fragility in flow networks.

PubMed

Shore, Jesse; Chu, Catherine J; Bianchi, Matt T

2013-01-01

What makes economic and ecological networks so unlike other highly skewed networks in their tendency toward turbulence and collapse? Here, we explore the consequences of a defining feature of these networks: their nodes are tied together by flow. We show that flow networks tend to the power law degree distribution (PLDD) due to a self-reinforcing process involving position within the global network structure, and thus present the first random graph model for PLDDs that does not depend on a rich-get-richer function of nodal degree. We also show that in contrast to non-flow networks, PLDD flow networks are dramatically more vulnerable to catastrophic failure than non-PLDD flow networks, a finding with potential explanatory power in our age of resource- and financial-interdependence and turbulence.

A deep learning framework for causal shape transformation.

PubMed

Lore, Kin Gwn; Stoecklein, Daniel; Davies, Michael; Ganapathysubramanian, Baskar; Sarkar, Soumik

2018-02-01

Recurrent neural network (RNN) and Long Short-term Memory (LSTM) networks are the common go-to architecture for exploiting sequential information where the output is dependent on a sequence of inputs. However, in most considered problems, the dependencies typically lie in the latent domain which may not be suitable for applications involving the prediction of a step-wise transformation sequence that is dependent on the previous states only in the visible domain with a known terminal state. We propose a hybrid architecture of convolution neural networks (CNN) and stacked autoencoders (SAE) to learn a sequence of causal actions that nonlinearly transform an input visual pattern or distribution into a target visual pattern or distribution with the same support and demonstrated its practicality in a real-world engineering problem involving the physics of fluids. We solved a high-dimensional one-to-many inverse mapping problem concerning microfluidic flow sculpting, where the use of deep learning methods as an inverse map is very seldom explored. This work serves as a fruitful use-case to applied scientists and engineers in how deep learning can be beneficial as a solution for high-dimensional physical problems, and potentially opening doors to impactful advance in fields such as material sciences and medical biology where multistep topological transformations is a key element. Copyright © 2017 Elsevier Ltd. All rights reserved.

Bipartite consensus for multi-agent systems with antagonistic interactions and communication delays

NASA Astrophysics Data System (ADS)

Guo, Xing; Lu, Jianquan; Alsaedi, Ahmed; Alsaadi, Fuad E.

2018-04-01

This paper studies the consensus problems over signed digraphs with arbitrary finite communication delays. For the considered system, the information flow is directed and only locally delayed information can be used for each node. We derive that bipartite consensus of this system can be realized when the associated signed digraph is strongly connected. Furthermore, for structurally balanced networks, this paper studies the pinning partite consensus for the considered system. we design a pinning scheme to pin any one agent in the signed network, and obtain that the network achieves pinning bipartite consensus with any initial conditions. Finally, two examples are provided to demonstrate the effectiveness of our main results.

Recognition of an obstacle in a flow using artificial neural networks.

PubMed

Carrillo, Mauricio; Que, Ulices; González, José A; López, Carlos

2017-08-01

In this work a series of artificial neural networks (ANNs) has been developed with the capacity to estimate the size and location of an obstacle obstructing the flow in a pipe. The ANNs learn the size and location of the obstacle by reading the profiles of the dynamic pressure q or the x component of the velocity v_{x} of the fluid at a certain distance from the obstacle. Data to train the ANN were generated using numerical simulations with a two-dimensional lattice Boltzmann code. We analyzed various cases varying both the diameter and the position of the obstacle on the y axis, obtaining good estimations using the R^{2} coefficient for the cases under study. Although the ANN showed problems with the classification of very small obstacles, the general results show a very good capacity for prediction.

Adaptive Time Stepping for Transient Network Flow Simulation in Rocket Propulsion Systems

NASA Technical Reports Server (NTRS)

Majumdar, Alok K.; Ravindran, S. S.

2017-01-01

Fluid and thermal transients found in rocket propulsion systems such as propellant feedline system is a complex process involving fast phases followed by slow phases. Therefore their time accurate computation requires use of short time step initially followed by the use of much larger time step. Yet there are instances that involve fast-slow-fast phases. In this paper, we present a feedback control based adaptive time stepping algorithm, and discuss its use in network flow simulation of fluid and thermal transients. The time step is automatically controlled during the simulation by monitoring changes in certain key variables and by feedback. In order to demonstrate the viability of time adaptivity for engineering problems, we applied it to simulate water hammer and cryogenic chill down in pipelines. Our comparison and validation demonstrate the accuracy and efficiency of this adaptive strategy.

Silicon Nanophotonics for Many-Core On-Chip Networks

NASA Astrophysics Data System (ADS)

Mohamed, Moustafa

Number of cores in many-core architectures are scaling to unprecedented levels requiring ever increasing communication capacity. Traditionally, architects follow the path of higher throughput at the expense of latency. This trend has evolved into being problematic for performance in many-core architectures. Moreover, the trends of power consumption is increasing with system scaling mandating nontraditional solutions. Nanophotonics can address these problems, offering benefits in the three frontiers of many-core processor design: Latency, bandwidth, and power. Nanophotonics leverage circuit-switching flow control allowing low latency; in addition, the power consumption of optical links is significantly lower compared to their electrical counterparts at intermediate and long links. Finally, through wave division multiplexing, we can keep the high bandwidth trends without sacrificing the throughput. This thesis focuses on realizing nanophotonics for communication in many-core architectures at different design levels considering reliability challenges that our fabrication and measurements reveal. First, we study how to design on-chip networks for low latency, low power, and high bandwidth by exploiting the full potential of nanophotonics. The design process considers device level limitations and capabilities on one hand, and system level demands in terms of power and performance on the other hand. The design involves the choice of devices, designing the optical link, the topology, the arbitration technique, and the routing mechanism. Next, we address the problem of reliability in on-chip networks. Reliability not only degrades performance but can block communication. Hence, we propose a reliability-aware design flow and present a reliability management technique based on this flow to address reliability in the system. In the proposed flow reliability is modeled and analyzed for at the device, architecture, and system level. Our reliability management technique is superior to existing solutions in terms of power and performance. In fact, our solution can scale to thousand core with low overhead.

Toward Optimal Transport Networks

NASA Technical Reports Server (NTRS)

Alexandrov, Natalia; Kincaid, Rex K.; Vargo, Erik P.

2008-01-01

Strictly evolutionary approaches to improving the air transport system a highly complex network of interacting systems no longer suffice in the face of demand that is projected to double or triple in the near future. Thus evolutionary approaches should be augmented with active design methods. The ability to actively design, optimize and control a system presupposes the existence of predictive modeling and reasonably well-defined functional dependences between the controllable variables of the system and objective and constraint functions for optimization. Following recent advances in the studies of the effects of network topology structure on dynamics, we investigate the performance of dynamic processes on transport networks as a function of the first nontrivial eigenvalue of the network's Laplacian, which, in turn, is a function of the network s connectivity and modularity. The last two characteristics can be controlled and tuned via optimization. We consider design optimization problem formulations. We have developed a flexible simulation of network topology coupled with flows on the network for use as a platform for computational experiments.

Conjunctive management of multi-reservoir network system and groundwater system

NASA Astrophysics Data System (ADS)

Mani, A.; Tsai, F. T. C.

2015-12-01

This study develops a successive mixed-integer linear fractional programming (successive MILFP) method to conjunctively manage water resources provided by a multi-reservoir network system and a groundwater system. The conjunctive management objectives are to maximize groundwater withdrawals and maximize reservoir storages while satisfying water demands and raising groundwater level to a target level. The decision variables in the management problem are reservoir releases and spills, network flows and groundwater pumping rates. Using the fractional programming approach, the objective function is defined as a ratio of total groundwater withdraws to total reservoir storage deficits from the maximum storages. Maximizing this ratio function tends to maximizing groundwater use and minimizing surface water use. This study introduces a conditional constraint on groundwater head in order to sustain aquifers from overpumping: if current groundwater level is less than a target level, groundwater head at the next time period has to be raised; otherwise, it is allowed to decrease up to a certain extent. This conditional constraint is formulated into a set of mixed binary nonlinear constraints and results in a mixed-integer nonlinear fractional programming (MINLFP) problem. To solve the MINLFP problem, we first use the response matrix approach to linearize groundwater head with respect to pumping rate and reduce the problem to an MILFP problem. Using the Charnes-Cooper transformation, the MILFP is transformed to an equivalent mixed-integer linear programming (MILP). The solution of the MILP is successively updated by updating the response matrix in every iteration. The study uses IBM CPLEX to solve the MILP problem. The methodology is applied to water resources management in northern Louisiana. This conjunctive management approach aims to recover the declining groundwater level of the stressed Sparta aquifer by using surface water from a network of four reservoirs as an alternative source of supply.

Fast packet switching algorithms for dynamic resource control over ATM networks

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tsang, R.P.; Keattihananant, P.; Chang, T.

1996-12-01

Real-time continuous media traffic, such as digital video and audio, is expected to comprise a large percentage of the network load on future high speed packet switch networks such as ATM. A major feature which distinguishes high speed networks from traditional slower speed networks is the large amount of data the network must process very quickly. For efficient network usage, traffic control mechanisms are essential. Currently, most mechanisms for traffic control (such as flow control) have centered on the support of Available Bit Rate (ABR), i.e., non real-time, traffic. With regard to ATM, for ABR traffic, two major types ofmore » schemes which have been proposed are rate- control and credit-control schemes. Neither of these schemes are directly applicable to Real-time Variable Bit Rate (VBR) traffic such as continuous media traffic. Traffic control for continuous media traffic is an inherently difficult problem due to the time- sensitive nature of the traffic and its unpredictable burstiness. In this study, we present a scheme which controls traffic by dynamically allocating/de- allocating resources among competing VCs based upon their real-time requirements. This scheme incorporates a form of rate- control, real-time burst-level scheduling and link-link flow control. We show analytically potential performance improvements of our rate- control scheme and present a scheme for buffer dimensioning. We also present simulation results of our schemes and discuss the tradeoffs inherent in maintaining high network utilization and statistically guaranteeing many users` Quality of Service.« less

CUFID-query: accurate network querying through random walk based network flow estimation.

PubMed

Jeong, Hyundoo; Qian, Xiaoning; Yoon, Byung-Jun

2017-12-28

Functional modules in biological networks consist of numerous biomolecules and their complicated interactions. Recent studies have shown that biomolecules in a functional module tend to have similar interaction patterns and that such modules are often conserved across biological networks of different species. As a result, such conserved functional modules can be identified through comparative analysis of biological networks. In this work, we propose a novel network querying algorithm based on the CUFID (Comparative network analysis Using the steady-state network Flow to IDentify orthologous proteins) framework combined with an efficient seed-and-extension approach. The proposed algorithm, CUFID-query, can accurately detect conserved functional modules as small subnetworks in the target network that are expected to perform similar functions to the given query functional module. The CUFID framework was recently developed for probabilistic pairwise global comparison of biological networks, and it has been applied to pairwise global network alignment, where the framework was shown to yield accurate network alignment results. In the proposed CUFID-query algorithm, we adopt the CUFID framework and extend it for local network alignment, specifically to solve network querying problems. First, in the seed selection phase, the proposed method utilizes the CUFID framework to compare the query and the target networks and to predict the probabilistic node-to-node correspondence between the networks. Next, the algorithm selects and greedily extends the seed in the target network by iteratively adding nodes that have frequent interactions with other nodes in the seed network, in a way that the conductance of the extended network is maximally reduced. Finally, CUFID-query removes irrelevant nodes from the querying results based on the personalized PageRank vector for the induced network that includes the fully extended network and its neighboring nodes. Through extensive performance evaluation based on biological networks with known functional modules, we show that CUFID-query outperforms the existing state-of-the-art algorithms in terms of prediction accuracy and biological significance of the predictions.

Single- and Multiple-Objective Optimization with Differential Evolution and Neural Networks

NASA Technical Reports Server (NTRS)

Rai, Man Mohan

2006-01-01

Genetic and evolutionary algorithms have been applied to solve numerous problems in engineering design where they have been used primarily as optimization procedures. These methods have an advantage over conventional gradient-based search procedures became they are capable of finding global optima of multi-modal functions and searching design spaces with disjoint feasible regions. They are also robust in the presence of noisy data. Another desirable feature of these methods is that they can efficiently use distributed and parallel computing resources since multiple function evaluations (flow simulations in aerodynamics design) can be performed simultaneously and independently on ultiple processors. For these reasons genetic and evolutionary algorithms are being used more frequently in design optimization. Examples include airfoil and wing design and compressor and turbine airfoil design. They are also finding increasing use in multiple-objective and multidisciplinary optimization. This lecture will focus on an evolutionary method that is a relatively new member to the general class of evolutionary methods called differential evolution (DE). This method is easy to use and program and it requires relatively few user-specified constants. These constants are easily determined for a wide class of problems. Fine-tuning the constants will off course yield the solution to the optimization problem at hand more rapidly. DE can be efficiently implemented on parallel computers and can be used for continuous, discrete and mixed discrete/continuous optimization problems. It does not require the objective function to be continuous and is noise tolerant. DE and applications to single and multiple-objective optimization will be included in the presentation and lecture notes. A method for aerodynamic design optimization that is based on neural networks will also be included as a part of this lecture. The method offers advantages over traditional optimization methods. It is more flexible than other methods in dealing with design in the context of both steady and unsteady flows, partial and complete data sets, combined experimental and numerical data, inclusion of various constraints and rules of thumb, and other issues that characterize the aerodynamic design process. Neural networks provide a natural framework within which a succession of numerical solutions of increasing fidelity, incorporating more realistic flow physics, can be represented and utilized for optimization. Neural networks also offer an excellent framework for multiple-objective and multi-disciplinary design optimization. Simulation tools from various disciplines can be integrated within this framework and rapid trade-off studies involving one or many disciplines can be performed. The prospect of combining neural network based optimization methods and evolutionary algorithms to obtain a hybrid method with the best properties of both methods will be included in this presentation. Achieving solution diversity and accurate convergence to the exact Pareto front in multiple objective optimization usually requires a significant computational effort with evolutionary algorithms. In this lecture we will also explore the possibility of using neural networks to obtain estimates of the Pareto optimal front using non-dominated solutions generated by DE as training data. Neural network estimators have the potential advantage of reducing the number of function evaluations required to obtain solution accuracy and diversity, thus reducing cost to design.

Analysis and Experimental Verification of New Power Flow Control for Grid-Connected Inverter with LCL Filter in Microgrid

PubMed Central

Gu, Herong; Guan, Yajuan; Wang, Huaibao; Wei, Baoze; Guo, Xiaoqiang

2014-01-01

Microgrid is an effective way to integrate the distributed energy resources into the utility networks. One of the most important issues is the power flow control of grid-connected voltage-source inverter in microgrid. In this paper, the small-signal model of the power flow control for the grid-connected inverter is established, from which it can be observed that the conventional power flow control may suffer from the poor damping and slow transient response. While the new power flow control can mitigate these problems without affecting the steady-state power flow regulation. Results of continuous-domain simulations in MATLAB and digital control experiments based on a 32-bit fixed-point TMS320F2812 DSP are in good agreement, which verify the small signal model analysis and effectiveness of the proposed method. PMID:24672304

Nicholas Metropolis Award Talk for Outstanding Doctoral Thesis Work in Computational Physics: Computational biophysics and multiscale modeling of blood cells and blood flow in health and disease

NASA Astrophysics Data System (ADS)

Fedosov, Dmitry

2011-03-01

Computational biophysics is a large and rapidly growing area of computational physics. In this talk, we will focus on a number of biophysical problems related to blood cells and blood flow in health and disease. Blood flow plays a fundamental role in a wide range of physiological processes and pathologies in the organism. To understand and, if necessary, manipulate the course of these processes it is essential to investigate blood flow under realistic conditions including deformability of blood cells, their interactions, and behavior in the complex microvascular network. Using a multiscale cell model we are able to accurately capture red blood cell mechanics, rheology, and dynamics in agreement with a number of single cell experiments. Further, this validated model yields accurate predictions of the blood rheological properties, cell migration, cell-free layer, and hemodynamic resistance in microvessels. In addition, we investigate blood related changes in malaria, which include a considerable stiffening of red blood cells and their cytoadherence to endothelium. For these biophysical problems computational modeling is able to provide new physical insights and capabilities for quantitative predictions of blood flow in health and disease.

A decentralized mechanism for improving the functional robustness of distribution networks.

PubMed

Shi, Benyun; Liu, Jiming

2012-10-01

Most real-world distribution systems can be modeled as distribution networks, where a commodity can flow from source nodes to sink nodes through junction nodes. One of the fundamental characteristics of distribution networks is the functional robustness, which reflects the ability of maintaining its function in the face of internal or external disruptions. In view of the fact that most distribution networks do not have any centralized control mechanisms, we consider the problem of how to improve the functional robustness in a decentralized way. To achieve this goal, we study two important problems: 1) how to formally measure the functional robustness, and 2) how to improve the functional robustness of a network based on the local interaction of its nodes. First, we derive a utility function in terms of network entropy to characterize the functional robustness of a distribution network. Second, we propose a decentralized network pricing mechanism, where each node need only communicate with its distribution neighbors by sending a "price" signal to its upstream neighbors and receiving "price" signals from its downstream neighbors. By doing so, each node can determine its outflows by maximizing its own payoff function. Our mathematical analysis shows that the decentralized pricing mechanism can produce results equivalent to those of an ideal centralized maximization with complete information. Finally, to demonstrate the properties of our mechanism, we carry out a case study on the U.S. natural gas distribution network. The results validate the convergence and effectiveness of our mechanism when comparing it with an existing algorithm.

Modelling information flow along the human connectome using maximum flow.

PubMed

Lyoo, Youngwook; Kim, Jieun E; Yoon, Sujung

2018-01-01

The human connectome is a complex network that transmits information between interlinked brain regions. Using graph theory, previously well-known network measures of integration between brain regions have been constructed under the key assumption that information flows strictly along the shortest paths possible between two nodes. However, it is now apparent that information does flow through non-shortest paths in many real-world networks such as cellular networks, social networks, and the internet. In the current hypothesis, we present a novel framework using the maximum flow to quantify information flow along all possible paths within the brain, so as to implement an analogy to network traffic. We hypothesize that the connection strengths of brain networks represent a limit on the amount of information that can flow through the connections per unit of time. This allows us to compute the maximum amount of information flow between two brain regions along all possible paths. Using this novel framework of maximum flow, previous network topological measures are expanded to account for information flow through non-shortest paths. The most important advantage of the current approach using maximum flow is that it can integrate the weighted connectivity data in a way that better reflects the real information flow of the brain network. The current framework and its concept regarding maximum flow provides insight on how network structure shapes information flow in contrast to graph theory, and suggests future applications such as investigating structural and functional connectomes at a neuronal level. Copyright © 2017 Elsevier Ltd. All rights reserved.

A numerical approach for assessing effects of shear on equivalent permeability and nonlinear flow characteristics of 2-D fracture networks

NASA Astrophysics Data System (ADS)

Liu, Richeng; Li, Bo; Jiang, Yujing; Yu, Liyuan

2018-01-01

Hydro-mechanical properties of rock fractures are core issues for many geoscience and geo-engineering practices. Previous experimental and numerical studies have revealed that shear processes could greatly enhance the permeability of single rock fractures, yet the shear effects on hydraulic properties of fractured rock masses have received little attention. In most previous fracture network models, single fractures are typically presumed to be formed by parallel plates and flow is presumed to obey the cubic law. However, related studies have suggested that the parallel plate model cannot realistically represent the surface characters of natural rock fractures, and the relationship between flow rate and pressure drop will no longer be linear at sufficiently large Reynolds numbers. In the present study, a numerical approach was established to assess the effects of shear on the hydraulic properties of 2-D discrete fracture networks (DFNs) in both linear and nonlinear regimes. DFNs considering fracture surface roughness and variation of aperture in space were generated using an originally developed code DFNGEN. Numerical simulations by solving Navier-Stokes equations were performed to simulate the fluid flow through these DFNs. A fracture that cuts through each model was sheared and by varying the shear and normal displacements, effects of shear on equivalent permeability and nonlinear flow characteristics of DFNs were estimated. The results show that the critical condition of quantifying the transition from a linear flow regime to a nonlinear flow regime is: 10-4 〈 J < 10-3, where J is the hydraulic gradient. When the fluid flow is in a linear regime (i.e., J < 10-4), the relative deviation of equivalent permeability induced by shear, δ2, is linearly correlated with J with small variations, while for fluid flow in the nonlinear regime (J 〉 10-3), δ2 is nonlinearly correlated with J. A shear process would reduce the equivalent permeability significantly in the orientation perpendicular to the sheared fracture as much as 53.86% when J = 1, shear displacement Ds = 7 mm, and normal displacement Dn = 1 mm. By fitting the calculated results, the mathematical expression for δ2 is established to help choose proper governing equations when solving fluid flow problems in fracture networks.

Decision-making in irrigation networks: Selecting appropriate canal structures using multi-attribute decision analysis.

PubMed

Hosseinzade, Zeinab; Pagsuyoin, Sheree A; Ponnambalam, Kumaraswamy; Monem, Mohammad J

2017-12-01

The stiff competition for water between agriculture and non-agricultural production sectors makes it necessary to have effective management of irrigation networks in farms. However, the process of selecting flow control structures in irrigation networks is highly complex and involves different levels of decision makers. In this paper, we apply multi-attribute decision making (MADM) methodology to develop a decision analysis (DA) framework for evaluating, ranking and selecting check and intake structures for irrigation canals. The DA framework consists of identifying relevant attributes for canal structures, developing a robust scoring system for alternatives, identifying a procedure for data quality control, and identifying a MADM model for the decision analysis. An application is illustrated through an analysis for automation purposes of the Qazvin irrigation network, one of the oldest and most complex irrigation networks in Iran. A survey questionnaire designed based on the decision framework was distributed to experts, managers, and operators of the Qazvin network and to experts from the Ministry of Power in Iran. Five check structures and four intake structures were evaluated. A decision matrix was generated from the average scores collected from the survey, and was subsequently solved using TOPSIS (Technique for Order of Preference by Similarity to Ideal Solution) method. To identify the most critical structure attributes for the selection process, optimal attribute weights were calculated using Entropy method. For check structures, results show that the duckbill weir is the preferred structure while the pivot weir is the least preferred. Use of the duckbill weir can potentially address the problem with existing Amil gates where manual intervention is required to regulate water levels during periods of flow extremes. For intake structures, the Neyrpic® gate and constant head orifice are the most and least preferred alternatives, respectively. Some advantages of the Neyrpic® gate are ease of operation and capacity to measure discharge flows. Overall, the application to the Qazvin irrigation network demonstrates the utility of the proposed DA framework in selecting appropriate structures for regulating water flows in irrigation canals. This framework systematically aids the decision process by capturing decisions made at various levels (individual farmers to high-level management). It can be applied to other cases where a new irrigation network is being designed, or where changes in irrigation structures need to be identified to improve flow control in existing networks. Copyright © 2017 Elsevier B.V. All rights reserved.

Flow interaction based propagation model and bursty influence behavior analysis of Internet flows

NASA Astrophysics Data System (ADS)

Wu, Xiao-Yu; Gu, Ren-Tao; Ji, Yue-Feng

2016-11-01

QoS (quality of service) fluctuations caused by Internet bursty flows influence the user experience in the Internet, such as the increment of packet loss and transmission time. In this paper, we establish a mathematical model to study the influence propagation behavior of the bursty flow, which is helpful for developing a deep understanding of the network dynamics in the Internet complex system. To intuitively reflect the propagation process, a data flow interaction network with a hierarchical structure is constructed, where the neighbor order is proposed to indicate the neighborhood relationship between the bursty flow and other flows. The influence spreads from the bursty flow to each order of neighbors through flow interactions. As the influence spreads, the bursty flow has negative effects on the odd order neighbors and positive effects on the even order neighbors. The influence intensity of bursty flow decreases sharply between two adjacent orders and the decreasing degree can reach up to dozens of times in the experimental simulation. Moreover, the influence intensity increases significantly when network congestion situation becomes serious, especially for the 1st order neighbors. Network structural factors are considered to make a further study. Simulation results show that the physical network scale expansion can reduce the influence intensity of bursty flow by decreasing the flow distribution density. Furthermore, with the same network scale, the influence intensity in WS small-world networks is 38.18% and 18.40% lower than that in ER random networks and BA scale-free networks, respectively, due to a lower interaction probability between flows. These results indicate that the macro-structural changes such as network scales and styles will affect the inner propagation behaviors of the bursty flow.

Description of a method to support public health information management: organizational network analysis

PubMed Central

Merrill, Jacqueline; Bakken, Suzanne; Rockoff, Maxine; Gebbie, Kristine; Carley, Kathleen

2007-01-01

In this case study we describe a method that has potential to provide systematic support for public health information management. Public health agencies depend on specialized information that travels throughout an organization via communication networks among employees. Interactions that occur within these networks are poorly understood and are generally unmanaged. We applied organizational network analysis, a method for studying communication networks, to assess the method’s utility to support decision making for public health managers, and to determine what links existed between information use and agency processes. Data on communication links among a health department’s staff was obtained via survey with a 93% response rate, and analyzed using Organizational Risk Analyzer (ORA) software. The findings described the structure of information flow in the department’s communication networks. The analysis succeeded in providing insights into organizational processes which informed public health managers’ strategies to address problems and to take advantage of network strengths. PMID:17098480

Neural-tree call admission controller for ATM networks

NASA Astrophysics Data System (ADS)

Rughooputh, Harry C. S.

1999-03-01

Asynchronous Transfer Mode (ATM) has been recommended by ITU-T as the transport method for broadband integrated services digital networks. In high-speed ATM networks different types of multimedia traffic streams with widely varying traffic characteristics and Quality of Service (QoS) are asynchronously multiplexed on transmission links and switched without window flow control as found in X.25. In such an environment, a traffic control scheme is required to manage the required QoS of each class individually. To meet the QoS requirements, Bandwidth Allocation and Call Admission Control (CAC) in ATM networks must be able to adapt gracefully to the dynamic behavior of traffic and the time-varying nature of the network condition. In this paper, a Neural Network approach for CAC is proposed. The call admission problem is addressed by designing controllers based on Neural Tree Networks. Simulations reveal that the proposed scheme is not only simple but it also offers faster response than conventional neural/neuro-fuzzy controllers.

Drainage network optimization for inundation mitigation case study of ITS Surabaya

NASA Astrophysics Data System (ADS)

Savitri, Yang Ratri; Lasminto, Umboro

2017-06-01

Institut Teknologi Sepuluh Nopember (ITS) Surabaya is one of engineering campus in Surabaya with an area of ± 187 ha, which consists of building and campus facilities. The campus is supported by drainage system planned according to the ITS Master Plan on 2002. The drainage system is planned with numbers of retention and detention pond based on the city concept of Zero Delta Q concept. However, in the rainy season, it frequently has inundation problems in several locations. The problems could be identified from two major sources, namely the internal campus facilities and external condition connected with the city drainage system. This paper described the capabilities of drainage network optimization to mitigate local urban drainage problem. The hydrology-hydraulic investigation was done by utilizing the Storm Water Management Model (SWMM) developed by US Environmental Protection Agency (EPA). The mitigation is based on several alternative that based on the existing condition and regarding the social problem. The study results showed that the management of the flow from external source could reduce final stored volume of the campus main channel by 31.75 %.

Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks

NASA Astrophysics Data System (ADS)

Teng, Xian; Pei, Sen; Morone, Flaviano; Makse, Hernán A.

2016-10-01

Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called “Collective Influence (CI)” has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes’ significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy in realistic information spreading. Here, we examine real-world information flow in various social and scientific platforms including American Physical Society, Facebook, Twitter and LiveJournal. Since empirical data cannot be directly mapped to ideal multi-source spreading, we leverage the behavioral patterns of users extracted from data to construct “virtual” information spreading processes. Our results demonstrate that the set of spreaders selected by CI can induce larger scale of information propagation. Moreover, local measures as the number of connections or citations are not necessarily the deterministic factors of nodes’ importance in realistic information spreading. This result has significance for rankings scientists in scientific networks like the APS, where the commonly used number of citations can be a poor indicator of the collective influence of authors in the community.

Collective Influence of Multiple Spreaders Evaluated by Tracing Real Information Flow in Large-Scale Social Networks

PubMed Central

Teng, Xian; Pei, Sen; Morone, Flaviano; Makse, Hernán A.

2016-01-01

Identifying the most influential spreaders that maximize information flow is a central question in network theory. Recently, a scalable method called “Collective Influence (CI)” has been put forward through collective influence maximization. In contrast to heuristic methods evaluating nodes’ significance separately, CI method inspects the collective influence of multiple spreaders. Despite that CI applies to the influence maximization problem in percolation model, it is still important to examine its efficacy in realistic information spreading. Here, we examine real-world information flow in various social and scientific platforms including American Physical Society, Facebook, Twitter and LiveJournal. Since empirical data cannot be directly mapped to ideal multi-source spreading, we leverage the behavioral patterns of users extracted from data to construct “virtual” information spreading processes. Our results demonstrate that the set of spreaders selected by CI can induce larger scale of information propagation. Moreover, local measures as the number of connections or citations are not necessarily the deterministic factors of nodes’ importance in realistic information spreading. This result has significance for rankings scientists in scientific networks like the APS, where the commonly used number of citations can be a poor indicator of the collective influence of authors in the community. PMID:27782207

Integrated forward and reverse supply chain: A tire case study.

PubMed

Pedram, Ali; Yusoff, Nukman Bin; Udoncy, Olugu Ezutah; Mahat, Abu Bakar; Pedram, Payam; Babalola, Ayo

2017-02-01

This paper attempts to integrate both a forward and reverse supply chain to design a closed-loop supply chain network (CLSC). The problem in the design of a CLSC network is uncertainty in demand, return products and the quality of return products. Scenario analyses are generated to overcome this uncertainty. In contrast to the existing supply chain network design models, a new application of a CLSC network was studied in this paper to reduce waste. A multi-product, multi-tier mixed integer linear model is developed for a CLSC network design. The main objective is to maximize profit and provide waste management decision support in order to minimize pollution. The result shows applicability of the model in the tire industry. The model determines the number and the locations of facilities and the material flows between these facilities. Copyright © 2016 Elsevier Ltd. All rights reserved.

Efficient Quantum Transmission in Multiple-Source Networks

PubMed Central

Luo, Ming-Xing; Xu, Gang; Chen, Xiu-Bo; Yang, Yi-Xian; Wang, Xiaojun

2014-01-01

A difficult problem in quantum network communications is how to efficiently transmit quantum information over large-scale networks with common channels. We propose a solution by developing a quantum encoding approach. Different quantum states are encoded into a coherent superposition state using quantum linear optics. The transmission congestion in the common channel may be avoided by transmitting the superposition state. For further decoding and continued transmission, special phase transformations are applied to incoming quantum states using phase shifters such that decoders can distinguish outgoing quantum states. These phase shifters may be precisely controlled using classical chaos synchronization via additional classical channels. Based on this design and the reduction of multiple-source network under the assumption of restricted maximum-flow, the optimal scheme is proposed for specially quantized multiple-source network. In comparison with previous schemes, our scheme can greatly increase the transmission efficiency. PMID:24691590

Stochastic cycle selection in active flow networks.

PubMed

Woodhouse, Francis G; Forrow, Aden; Fawcett, Joanna B; Dunkel, Jörn

2016-07-19

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such nonequilibrium networks. Here we connect concepts from lattice field theory, graph theory, and transition rate theory to understand how topology controls dynamics in a generic model for actively driven flow on a network. Our combined theoretical and numerical analysis identifies symmetry-based rules that make it possible to classify and predict the selection statistics of complex flow cycles from the network topology. The conceptual framework developed here is applicable to a broad class of biological and nonbiological far-from-equilibrium networks, including actively controlled information flows, and establishes a correspondence between active flow networks and generalized ice-type models.

Stochastic cycle selection in active flow networks

NASA Astrophysics Data System (ADS)

Woodhouse, Francis; Forrow, Aden; Fawcett, Joanna; Dunkel, Jorn

2016-11-01

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such non-equilibrium networks. By connecting concepts from lattice field theory, graph theory and transition rate theory, we show how topology controls dynamics in a generic model for actively driven flow on a network. Through theoretical and numerical analysis we identify symmetry-based rules to classify and predict the selection statistics of complex flow cycles from the network topology. Our conceptual framework is applicable to a broad class of biological and non-biological far-from-equilibrium networks, including actively controlled information flows, and establishes a new correspondence between active flow networks and generalized ice-type models.

Stochastic cycle selection in active flow networks

PubMed Central

Woodhouse, Francis G.; Forrow, Aden; Fawcett, Joanna B.; Dunkel, Jörn

2016-01-01

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such nonequilibrium networks. Here we connect concepts from lattice field theory, graph theory, and transition rate theory to understand how topology controls dynamics in a generic model for actively driven flow on a network. Our combined theoretical and numerical analysis identifies symmetry-based rules that make it possible to classify and predict the selection statistics of complex flow cycles from the network topology. The conceptual framework developed here is applicable to a broad class of biological and nonbiological far-from-equilibrium networks, including actively controlled information flows, and establishes a correspondence between active flow networks and generalized ice-type models. PMID:27382186

Relationship between microscopic dynamics in traffic flow and complexity in networks.

PubMed

Li, Xin-Gang; Gao, Zi-You; Li, Ke-Ping; Zhao, Xiao-Mei

2007-07-01

Complex networks are constructed in the evolution process of traffic flow, and the states of traffic flow are represented by nodes in the network. The traffic dynamics can then be studied by investigating the statistical properties of those networks. According to Kerner's three-phase theory, there are two different phases in congested traffic, synchronized flow and wide moving jam. In the framework of this theory, we study different properties of synchronized flow and moving jam in relation to complex network. Scale-free network is constructed in stop-and-go traffic, i.e., a sequence of moving jams [Chin. Phys. Lett. 10, 2711 (2005)]. In this work, the networks generated in synchronized flow are investigated in detail. Simulation results show that the degree distribution of the networks constructed in synchronized flow has two power law regions, so the distinction in topological structure can really reflect the different dynamics in traffic flow. Furthermore, the real traffic data are investigated by this method, and the results are consistent with the simulations.

Never Use the Complete Search Space: a Concept to Enhance the Optimization Procedure for Monitoring Networks

NASA Astrophysics Data System (ADS)

Bode, F.; Reuschen, S.; Nowak, W.

2015-12-01

Drinking-water well catchments include many potential sources of contaminations like gas stations or agriculture. Finding optimal positions of early-warning monitoring wells is challenging because there are various parameters (and their uncertainties) that influence the reliability and optimality of any suggested monitoring location or monitoring network.The overall goal of this project is to develop and establish a concept to assess, design and optimize early-warning systems within well catchments. Such optimal monitoring networks need to optimize three competing objectives: a high detection probability, which can be reached by maximizing the "field of vision" of the monitoring network, a long early-warning time such that there is enough time left to install counter measures after first detection, and the overall operating costs of the monitoring network, which should ideally be reduced to a minimum. The method is based on numerical simulation of flow and transport in heterogeneous porous media coupled with geostatistics and Monte-Carlo, scenario analyses for real data, respectively, wrapped up within the framework of formal multi-objective optimization using a genetic algorithm.In order to speed up the optimization process and to better explore the Pareto-front, we developed a concept that forces the algorithm to search only in regions of the search space where promising solutions can be expected. We are going to show how to define these regions beforehand, using knowledge of the optimization problem, but also how to define them independently of problem attributes. With that, our method can be used with and/or without detailed knowledge of the objective functions.In summary, our study helps to improve optimization results in less optimization time by meaningful restrictions of the search space. These restrictions can be done independently of the optimization problem, but also in a problem-specific manner.

Improving the Energy Market: Algorithms, Market Implications, and Transmission Switching

NASA Astrophysics Data System (ADS)

Lipka, Paula Ann

This dissertation aims to improve ISO operations through a better real-time market solution algorithm that directly considers both real and reactive power, finds a feasible Alternating Current Optimal Power Flow solution, and allows for solving transmission switching problems in an AC setting. Most of the IEEE systems do not contain any thermal limits on lines, and the ones that do are often not binding. Chapter 3 modifies the thermal limits for the IEEE systems to create new, interesting test cases. Algorithms created to better solve the power flow problem often solve the IEEE cases without line limits. However, one of the factors that makes the power flow problem hard is thermal limits on the lines. The transmission networks in practice often have transmission lines that become congested, and it is unrealistic to ignore line limits. Modifying the IEEE test cases makes it possible for other researchers to be able to test their algorithms on a setup that is closer to the actual ISO setup. This thesis also examines how to convert limits given on apparent power---as is in the case in the Polish test systems---to limits on current. The main consideration in setting line limits is temperature, which linearly relates to current. Setting limits on real or apparent power is actually a proxy for using the limits on current. Therefore, Chapter 3 shows how to convert back to the best physical representation of line limits. A sequential linearization of the current-voltage formulation of the Alternating Current Optimal Power Flow (ACOPF) problem is used to find an AC-feasible generator dispatch. In this sequential linearization, there are parameters that are set to the previous optimal solution. Additionally, to improve accuracy of the Taylor series approximations that are used, the movement of the voltage is restricted. The movement of the voltage is allowed to be very large at the first iteration and is restricted further on each subsequent iteration, with the restriction corresponding to the accuracy and AC-feasiblity of the solution. This linearization was tested on the IEEE and Polish systems, which range from 14 to 3375 buses and 20 to 4161 transmission lines. It had an accuracy of 0.5% or less for all but the 30-bus system. It also solved in linear time with CPLEX, while the non-linear version solved in O(n1.11) to O(n1.39). The sequential linearization is slower than the nonlinear formulation for smaller problems, but faster for larger problems, and its linear computational time means it would continue solving faster for larger problems. A major consideration to implementing algorithms to solve the optimal generator dispatch is ensuring that the resulting prices from the algorithm will support the market. Since the sequential linearization is linear, it is convex, its marginal values are well-defined, and there is no duality gap. The prices and settlements obtained from the sequential linearization therefore can be used to run a market. This market will include extra prices and settlements for reactive power and voltage, compared to the present-day market, which is based on real power. An advantage of this is that there is a very clear pool that can be used for reactive power/voltage support payments, while presently there is not a clear pool to take them out of. This method also reveals how valuable reactive power and voltage are at different locations, which can enable better planning of reactive resource construction. Transmission switching increases the feasible region of the generator dispatch, which means there may be a better solution than without transmission switching. Power flows on transmission lines are not directly controllable; rather, the power flows according to how it is injected and the physical characteristics of the lines. Changing the network topology changes the physical characteristics, which changes the flows. This means that sets of generator dispatch that may have previously been infeasible due to the flow exceeding line constraints may be feasible, since the flows will be different and may meet line constraints. However, transmission switching is a mixed integer problem, which may have a very slow solution time. For economic switching, we examine a series of heuristics. We examine the congestion rent heuristic in detail and then examine many other heuristics at a higher level. Post-contingency corrective switching aims to fix issues in the power network after a line or generator outage. In Chapter 7, we show that using the sequential linear program with corrective switching helps solve voltage and excessive flow issues. (Abstract shortened by UMI.).

Well-balanced high-order solver for blood flow in networks of vessels with variable properties.

PubMed

Müller, Lucas O; Toro, Eleuterio F

2013-12-01

We present a well-balanced, high-order non-linear numerical scheme for solving a hyperbolic system that models one-dimensional flow in blood vessels with variable mechanical and geometrical properties along their length. Using a suitable set of test problems with exact solution, we rigorously assess the performance of the scheme. In particular, we assess the well-balanced property and the effective order of accuracy through an empirical convergence rate study. Schemes of up to fifth order of accuracy in both space and time are implemented and assessed. The numerical methodology is then extended to realistic networks of elastic vessels and is validated against published state-of-the-art numerical solutions and experimental measurements. It is envisaged that the present scheme will constitute the building block for a closed, global model for the human circulation system involving arteries, veins, capillaries and cerebrospinal fluid. Copyright © 2013 John Wiley & Sons, Ltd.

pyNS: an open-source framework for 0D haemodynamic modelling.

PubMed

Manini, Simone; Antiga, Luca; Botti, Lorenzo; Remuzzi, Andrea

2015-06-01

A number of computational approaches have been proposed for the simulation of haemodynamics and vascular wall dynamics in complex vascular networks. Among them, 0D pulse wave propagation methods allow to efficiently model flow and pressure distributions and wall displacements throughout vascular networks at low computational costs. Although several techniques are documented in literature, the availability of open-source computational tools is still limited. We here present python Network Solver, a modular solver framework for 0D problems released under a BSD license as part of the archToolkit ( http://archtk.github.com ). As an application, we describe patient-specific models of the systemic circulation and detailed upper extremity for use in the prediction of maturation after surgical creation of vascular access for haemodialysis.

Autonomous solutions for powering wireless sensor nodes in rivers

NASA Astrophysics Data System (ADS)

Kamenar, E.; Maćešić, S.; Gregov, G.; Blažević, D.; Zelenika, S.; Marković, K.; Glažar, V.

2015-05-01

There is an evident need for monitoring pollutants and/or other conditions in river flows via wireless sensor networks. In a typical wireless sensor network topography, a series of sensor nodes is to be deployed in the environment, all wirelessly connected to each other and/or their gateways. Each sensor node is composed of active electronic devices that have to be constantly powered. In general, batteries can be used for this purpose, but problems may occur when they have to be replaced. In the case of large networks, when sensor nodes can be placed in hardly accessible locations, energy harvesting can thus be a viable powering solution. The possibility to use three different small-scale river flow energy harvesting principles is hence thoroughly studied in this work: a miniaturized underwater turbine, a so-called `piezoelectric eel' and a hybrid turbine solution coupled with a rigid piezoelectric beam. The first two concepts are then validated experimentally in laboratory as well as in real river conditions. The concept of the miniaturised hydro-generator is finally embedded into the actual wireless sensor node system and its functionality is confirmed.

Virtual Network Embedding via Monte Carlo Tree Search.

PubMed

Haeri, Soroush; Trajkovic, Ljiljana

2018-02-01

Network virtualization helps overcome shortcomings of the current Internet architecture. The virtualized network architecture enables coexistence of multiple virtual networks (VNs) on an existing physical infrastructure. VN embedding (VNE) problem, which deals with the embedding of VN components onto a physical network, is known to be -hard. In this paper, we propose two VNE algorithms: MaVEn-M and MaVEn-S. MaVEn-M employs the multicommodity flow algorithm for virtual link mapping while MaVEn-S uses the shortest-path algorithm. They formalize the virtual node mapping problem by using the Markov decision process (MDP) framework and devise action policies (node mappings) for the proposed MDP using the Monte Carlo tree search algorithm. Service providers may adjust the execution time of the MaVEn algorithms based on the traffic load of VN requests. The objective of the algorithms is to maximize the profit of infrastructure providers. We develop a discrete event VNE simulator to implement and evaluate performance of MaVEn-M, MaVEn-S, and several recently proposed VNE algorithms. We introduce profitability as a new performance metric that captures both acceptance and revenue to cost ratios. Simulation results show that the proposed algorithms find more profitable solutions than the existing algorithms. Given additional computation time, they further improve embedding solutions.

Path Flow Estimation Using Time Varying Coefficient State Space Model

NASA Astrophysics Data System (ADS)

Jou, Yow-Jen; Lan, Chien-Lun

2009-08-01

The dynamic path flow information is very crucial in the field of transportation operation and management, i.e., dynamic traffic assignment, scheduling plan, and signal timing. Time-dependent path information, which is important in many aspects, is nearly impossible to be obtained. Consequently, researchers have been seeking estimation methods for deriving valuable path flow information from less expensive traffic data, primarily link traffic counts of surveillance systems. This investigation considers a path flow estimation problem involving the time varying coefficient state space model, Gibbs sampler, and Kalman filter. Numerical examples with part of a real network of the Taipei Mass Rapid Transit with real O-D matrices is demonstrated to address the accuracy of proposed model. Results of this study show that this time-varying coefficient state space model is very effective in the estimation of path flow compared to time-invariant model.

Physics and (patho)physiology in confined flows: from colloidal patterns to cytoplasmic rheology and sickle cell anemia

NASA Astrophysics Data System (ADS)

Mahadevan, L.

2015-03-01

I will discuss a few problems that involve the interaction of fluids and solids in confined spaces. (i) Jamming in pressure-driven suspension flows that show a transition from Stokes flows to Darcy flows as the solids start to lock, as in evaporative patterning in colloids (e.g. coffee stain formation) .(ii) Jamming and clogging of red blood cells, as in sickle-cell pathophysiology, with implications for other diseases that involve jamming. (iii) The mechanical response of crowded networks of filaments bathed in a fluid, as in the cytoskeleton, that can be described by poroelasticity theory. In each case, I will show how simple theories of multiphase flow and deformation can be used to explain a range of experimental observations, while failing to account for others, along with some thoughts on how to improve them.

Understanding Hydraulic Fracturing: A Multi-Scale Problem

DOE PAGES

Hyman, Jeffrey De'Haven; Gimenez Martinez, Joaquin; Viswanathan, Hari S.; ...

2016-09-05

Despite the impact that hydraulic fracturing has had on the energy sector, the physical mechanisms that control its efficiency and environmental impacts remain poorly understood in part because the length scales involved range from nano-meters to kilo-meters. We characterize flow and transport in shale formations across and between these scales using integrated computational, theoretical, and experimental efforts. At the field scale, we use discrete fracture network modeling to simulate production at a well site whose fracture network is based on a site characterization of a shale formation. At the core scale, we use triaxial fracture experiments and a finite-element discrete-elementmore » fracture propagation model with a coupled fluid solver to study dynamic crack propagation in low permeability shale. We use lattice Boltzmann pore-scale simulations and microfluidic experiments in both synthetic and real micromodels to study pore-scale flow phenomenon such as multiphase flow and mixing. A mechanistic description and integration of these multiple scales is required for accurate predictions of production and the eventual optimization of hydrocarbon extraction from unconventional reservoirs.« less

Use of Generalized Fluid System Simulation Program (GFSSP) for Teaching and Performing Senior Design Projects at the Educational Institutions

NASA Technical Reports Server (NTRS)

Majumdar, A. K.; Hedayat, A.

2015-01-01

This paper describes the experience of the authors in using the Generalized Fluid System Simulation Program (GFSSP) in teaching Design of Thermal Systems class at University of Alabama in Huntsville. GFSSP is a finite volume based thermo-fluid system network analysis code, developed at NASA/Marshall Space Flight Center, and is extensively used in NASA, Department of Defense, and aerospace industries for propulsion system design, analysis, and performance evaluation. The educational version of GFSSP is freely available to all US higher education institutions. The main purpose of the paper is to illustrate the utilization of this user-friendly code for the thermal systems design and fluid engineering courses and to encourage the instructors to utilize the code for the class assignments as well as senior design projects. The need for a generalized computer program for thermofluid analysis in a flow network has been felt for a long time in aerospace industries. Designers of thermofluid systems often need to know pressures, temperatures, flow rates, concentrations, and heat transfer rates at different parts of a flow circuit for steady state or transient conditions. Such applications occur in propulsion systems for tank pressurization, internal flow analysis of rocket engine turbopumps, chilldown of cryogenic tanks and transfer lines, and many other applications of gas-liquid systems involving fluid transients and conjugate heat and mass transfer. Computer resource requirements to perform time-dependent, three-dimensional Navier-Stokes computational fluid dynamic (CFD) analysis of such systems are prohibitive and therefore are not practical. Available commercial codes are generally suitable for steady state, single-phase incompressible flow. Because of the proprietary nature of such codes, it is not possible to extend their capability to satisfy the above-mentioned needs. Therefore, the Generalized Fluid System Simulation Program (GFSSP1) has been developed at NASA Marshall Space Flight Center (MSFC) as a general fluid flow system solver capable of handling phase changes, compressibility, mixture thermodynamics and transient operations. It also includes the capability to model external body forces such as gravity and centrifugal effects in a complex flow network. The objectives of GFSSP development are: a) to develop a robust and efficient numerical algorithm to solve a system of equations describing a flow network containing phase changes, mixing, and rotation; and b) to implement the algorithm in a structured, easy-to-use computer program. The analysis of thermofluid dynamics in a complex network requires resolution of the system into fluid nodes and branches, and solid nodes and conductors as shown in Figure 1. Figure 1 shows a schematic and GFSSP flow circuit of a counter-flow heat exchanger. Hot nitrogen gas is flowing through a pipe, colder nitrogen is flowing counter to the hot stream in the annulus pipe and heat transfer occurs through metal tubes. The problem considered is to calculate flowrates and temperature distributions in both streams. GFSSP has a unique data structure, as shown in Figure 2, that allows constructing all possible arrangements of a flow network with no limit on the number of elements. The elements of a flow network are boundary nodes where pressure and temperature are specified, internal nodes where pressure and temperature are calculated, and branches where flowrates are calculated. For conjugate heat transfer problems, there are three additional elements: solid node, ambient node, and conductor. The solid and fluid nodes are connected with solid-fluid conductors. GFSSP solves the conservation equations of mass and energy, and equation of state in internal nodes to calculate pressure, temperature and resident mass. The momentum conservation equation is solved in branches to calculate flowrate. It also solves for energy conservation equations to calculate temperatures of solid nodes. The equations are coupled and nonlinear; therefore, they are solved by an iterative numerical scheme. GFSSP employs a unique numerical scheme known as simultaneous adjustment with successive substitution (SASS), which is a combination of Newton-Raphson and successive substitution methods. The mass and momentum conservation equations and the equation of state are solved by the Newton-Raphson method while the conservation of energy and species are solved by the successive substitution method. GFSSP is linked with two thermodynamic property programs, GASP2 and WASP3 and GASPAK4, that provide thermodynamic and thermophysical properties of selected fluids. Both programs cover a range of pressure and temperature that allows fluid properties to be evaluated for liquid, liquid-vapor (saturation), and vapor region. GASP and WASP provide properties of 12 fluids. GASPAK includes a library of 36 fluids. GFSSP has three major parts. The first part is the graphical user interface (GUI), visual thermofluid analyzer of systems and components (VTASC). VTASC allows users to create a flow circuit by a 'point and click' paradigm. It creates the GFSSP input file after the completion of the model building process. GFSSP's GUI provides the users a platform to build and run their models. It also allows post-processing of results. The network flow circuit is first built using three basic elements: boundary node, internal node, and branch.

Challenges of CAC in Heterogeneous Wireless Cognitive Networks

NASA Astrophysics Data System (ADS)

Wang, Jiazheng; Fu, Xiuhua

Call admission control (CAC) is known as an effective functionality in ensuring the QoS of wireless networks. The vision of next generation wireless networks has led to the development of new call admission control (CAC) algorithms specifically designed for heterogeneous wireless Cognitive networks. However, there will be a number of challenges created by dynamic spectrum access and scheduling techniques associated with the cognitive systems. In this paper for the first time, we recommend that the CAC policies should be distinguished between primary users and secondary users. The classification of different methods of cac policies in cognitive networks contexts is proposed. Although there have been some researches within the umbrella of Joint CAC and cross-layer optimization for wireless networks, the advent of the cognitive networks adds some additional problems. We present the conceptual models for joint CAC and cross-layer optimization respectively. Also, the benefit of Cognition can only be realized fully if application requirements and traffic flow contexts are determined or inferred in order to know what modes of operation and spectrum bands to use at each point in time. The process model of Cognition involved per-flow-based CAC is presented. Because there may be a number of parameters on different levels affecting a CAC decision and the conditions for accepting or rejecting a call must be computed quickly and frequently, simplicity and practicability are particularly important for designing a feasible CAC algorithm. In a word, a more thorough understanding of CAC in heterogeneous wireless cognitive networks may help one to design better CAC algorithms.

Primary Health Care: care coordinator in regionalized networks?

PubMed Central

de Almeida, Patty Fidelis; dos Santos, Adriano Maia

2016-01-01

RESUMO OBJECTIVE To analyze the breadth of care coordination by Primary Health Care in three health regions. METHODS This is a quantitative and qualitative case study. Thirty-one semi-structured interviews with municipal, regional and state managers were carried out, besides a cross-sectional survey with the administration of questionnaires to physicians (74), nurses (127), and a representative sample of users (1,590) of Estratégia Saúde da Família (Family Health Strategy) in three municipal centers of health regions in the state of Bahia. RESULTS Primary Health Care as first contact of preference faced strong competition from hospital outpatient and emergency services outside the network. Issues related to access to and provision of specialized care were aggravated by dependence on the private sector in the regions, despite progress observed in institutionalizing flows starting out from Primary Health Care. The counter-referral system was deficient and interprofessional communication was scarce, especially concerning services provided by the contracted network. CONCLUSIONS Coordination capacity is affected both by the fragmentation of the regional network and intrinsic problems in Primary Health Care, which poorly supported in its essential attributes. Although the health regions have common problems, Primary Health Care remains a subject confined to municipal boundaries. PMID:28099663

Weighted complex network analysis of the Beijing subway system: Train and passenger flows

NASA Astrophysics Data System (ADS)

Feng, Jia; Li, Xiamiao; Mao, Baohua; Xu, Qi; Bai, Yun

2017-05-01

In recent years, complex network theory has become an important approach to the study of the structure and dynamics of traffic networks. However, because traffic data is difficult to collect, previous studies have usually focused on the physical topology of subway systems, whereas few studies have considered the characteristics of traffic flows through the network. Therefore, in this paper, we present a multi-layer model to analyze traffic flow patterns in subway networks, based on trip data and an operation timetable obtained from the Beijing Subway System. We characterize the patterns in terms of the spatiotemporal flow size distributions of both the train flow network and the passenger flow network. In addition, we describe the essential interactions between these two networks based on statistical analyses. The results of this study suggest that layered models of transportation systems can elucidate fundamental differences between the coexisting traffic flows and can also clarify the mechanism that causes these differences.

Multi-frequency complex network from time series for uncovering oil-water flow structure.

PubMed

Gao, Zhong-Ke; Yang, Yu-Xuan; Fang, Peng-Cheng; Jin, Ning-De; Xia, Cheng-Yi; Hu, Li-Dan

2015-02-04

Uncovering complex oil-water flow structure represents a challenge in diverse scientific disciplines. This challenge stimulates us to develop a new distributed conductance sensor for measuring local flow signals at different positions and then propose a novel approach based on multi-frequency complex network to uncover the flow structures from experimental multivariate measurements. In particular, based on the Fast Fourier transform, we demonstrate how to derive multi-frequency complex network from multivariate time series. We construct complex networks at different frequencies and then detect community structures. Our results indicate that the community structures faithfully represent the structural features of oil-water flow patterns. Furthermore, we investigate the network statistic at different frequencies for each derived network and find that the frequency clustering coefficient enables to uncover the evolution of flow patterns and yield deep insights into the formation of flow structures. Current results present a first step towards a network visualization of complex flow patterns from a community structure perspective.

Flow networks for Ocean currents

NASA Astrophysics Data System (ADS)

Tupikina, Liubov; Molkenthin, Nora; Marwan, Norbert; Kurths, Jürgen

2014-05-01

Complex networks have been successfully applied to various systems such as society, technology, and recently climate. Links in a climate network are defined between two geographical locations if the correlation between the time series of some climate variable is higher than a threshold. Therefore, network links are considered to imply heat exchange. However, the relationship between the oceanic and atmospheric flows and the climate network's structure is still unclear. Recently, a theoretical approach verifying the correlation between ocean currents and surface air temperature networks has been introduced, where the Pearson correlation networks were constructed from advection-diffusion dynamics on an underlying flow. Since the continuous approach has its limitations, i.e., by its high computational complexity, we here introduce a new, discrete construction of flow-networks, which is then applied to static and dynamic velocity fields. Analyzing the flow-networks of prototypical flows we find that our approach can highlight the zones of high velocity by degree and transition zones by betweenness, while the combination of these network measures can uncover how the flow propagates within time. We also apply the method to time series data of the Equatorial Pacific Ocean Current and the Gulf Stream ocean current for the changing velocity fields, which could not been done before, and analyse the properties of the dynamical system. Flow-networks can be powerful tools to theoretically understand the step from system's dynamics to network's topology that can be analyzed using network measures and is used for shading light on different climatic phenomena.

User's manual for a two-dimensional, ground-water flow code on the Octopus computer network

DOE Office of Scientific and Technical Information (OSTI.GOV)

Naymik, T.G.

1978-08-30

A ground-water hydrology computer code, programmed by R.L. Taylor (in Proc. American Society of Civil Engineers, Journal of Hydraulics Division, 93(HY2), pp. 25-33 (1967)), has been adapted to the Octopus computer system at Lawrence Livermore Laboratory. Using an example problem, this manual details the input, output, and execution options of the code.

Passenger flow analysis of Beijing urban rail transit network using fractal approach

NASA Astrophysics Data System (ADS)

Li, Xiaohong; Chen, Peiwen; Chen, Feng; Wang, Zijia

2018-04-01

To quantify the spatiotemporal distribution of passenger flow and the characteristics of an urban rail transit network, we introduce four radius fractal dimensions and two branch fractal dimensions by combining a fractal approach with passenger flow assignment model. These fractal dimensions can numerically describe the complexity of passenger flow in the urban rail transit network and its change characteristics. Based on it, we establish a fractal quantification method to measure the fractal characteristics of passenger follow in the rail transit network. Finally, we validate the reasonability of our proposed method by using the actual data of Beijing subway network. It has been shown that our proposed method can effectively measure the scale-free range of the urban rail transit network, network development and the fractal characteristics of time-varying passenger flow, which further provides a reference for network planning and analysis of passenger flow.

Network structure of subway passenger flows

NASA Astrophysics Data System (ADS)

Xu, Q.; Mao, B. H.; Bai, Y.

2016-03-01

The results of transportation infrastructure network analyses have been used to analyze complex networks in a topological context. However, most modeling approaches, including those based on complex network theory, do not fully account for real-life traffic patterns and may provide an incomplete view of network functions. This study utilizes trip data obtained from the Beijing Subway System to characterize individual passenger movement patterns. A directed weighted passenger flow network was constructed from the subway infrastructure network topology by incorporating trip data. The passenger flow networks exhibit several properties that can be characterized by power-law distributions based on flow size, and log-logistic distributions based on the fraction of boarding and departing passengers. The study also characterizes the temporal patterns of in-transit and waiting passengers and provides a hierarchical clustering structure for passenger flows. This hierarchical flow organization varies in the spatial domain. Ten cluster groups were identified, indicating a hierarchical urban polycentric structure composed of large concentrated flows at urban activity centers. These empirical findings provide insights regarding urban human mobility patterns within a large subway network.

Dual Temporal Scale Convolutional Neural Network for Micro-Expression Recognition

PubMed Central

Peng, Min; Wang, Chongyang; Chen, Tong; Liu, Guangyuan; Fu, Xiaolan

2017-01-01

Facial micro-expression is a brief involuntary facial movement and can reveal the genuine emotion that people try to conceal. Traditional methods of spontaneous micro-expression recognition rely excessively on sophisticated hand-crafted feature design and the recognition rate is not high enough for its practical application. In this paper, we proposed a Dual Temporal Scale Convolutional Neural Network (DTSCNN) for spontaneous micro-expressions recognition. The DTSCNN is a two-stream network. Different of stream of DTSCNN is used to adapt to different frame rate of micro-expression video clips. Each stream of DSTCNN consists of independent shallow network for avoiding the overfitting problem. Meanwhile, we fed the networks with optical-flow sequences to ensure that the shallow networks can further acquire higher-level features. Experimental results on spontaneous micro-expression databases (CASME I/II) showed that our method can achieve a recognition rate almost 10% higher than what some state-of-the-art method can achieve. PMID:29081753

Seepage Bifurcation as a Critical Process

NASA Astrophysics Data System (ADS)

Yi, R.; Rothman, D.

2015-12-01

Channel networks form beautiful and surprisingly intricate geometries, yet diligently evade comprehensive mathematical understanding. Work in recent years has shed light on this problem. Networks driven by seepage flow, in particular, have been shown to grow in a field that can be described by the Laplace equation, providing us with an understanding of valley growth and shape. However, the process by which such networks branch to form these ramified shapes is yet a mystery. We focus our attention on a highly ramified seepage valley network in Bristol, Florida. We study the behavior of flux to valley heads as a function of valley length, and use this result to motivate our discussion of branch formation. We then hypothesize that a critical groundwater flux demarcates a transition point where topographic diffusion is overcome by branching processes, and we present network-wide flux calculations, cosmogenic data, and simulation to support our claim. Our results ultimately suggest a mechanism for seepage bifurcation, and inform our understanding of pattern formation in river networks.

Modeling of heat flow and effective thermal conductivity of fractured media: Analytical and numerical methods

NASA Astrophysics Data System (ADS)

Nguyen, S. T.; Vu, M.-H.; Vu, M. N.; Tang, A. M.

2017-05-01

The present work aims to modeling the thermal conductivity of fractured materials using homogenization-based analytical and pattern-based numerical methods. These materials are considered as a network of cracks distributed inside a solid matrix. Heat flow through such media is perturbed by the crack system. The problem of heat flow across a single crack is firstly investigated. The classical Eshelby's solution, extended to the thermal conduction problem of an ellipsoidal inclusion embedding in an infinite homogeneous matrix, gives an analytical solution of temperature discontinuity across a non-conducting penny-shaped crack. This solution is then validated by the numerical simulation based on the finite elements method. The numerical simulation allows analyzing the effect of crack conductivity. The problem of a single crack is then extended to a medium containing multiple cracks. Analytical estimations for effective thermal conductivity, that take into account the interaction between cracks and their spatial distribution, are developed for the case of non-conducting cracks. Pattern-based numerical method is then employed for both cases non-conducting and conducting cracks. In the case of non-conducting cracks, numerical and analytical methods, both account for the spatial distribution of the cracks, fit perfectly. In the case of conducting cracks, the numerical analyzing of crack conductivity effect shows that highly conducting cracks weakly affect heat flow and the effective thermal conductivity of fractured media.

Software defined network architecture based research on load balancing strategy

NASA Astrophysics Data System (ADS)

You, Xiaoqian; Wu, Yang

2018-05-01

As a new type network architecture, software defined network has the key idea of separating the control place of the network from the transmission plane, to manage and control the network in a concentrated way; in addition, the network interface is opened on the control layer and the data layer, so as to achieve programmable control of the network. Considering that only the single shortest route is taken into the calculation of traditional network data flow transmission, and congestion and resource consumption caused by excessive load of link circuits are ignored, a link circuit load based flow media business QoS gurantee system is proposed in this article to divide the flow in the network into ordinary data flow and QoS flow. In this way, it supervises the link circuit load with the controller so as to calculate reasonable route rapidly and issue the flow table to the exchanger, to finish rapid data transmission. In addition, it establishes a simulation platform to acquire optimized result through simulation experiment.

A neural network construction method for surrogate modeling of physics-based analysis

NASA Astrophysics Data System (ADS)

Sung, Woong Je

In this thesis existing methodologies related to the developmental methods of neural networks have been surveyed and their approaches to network sizing and structuring are carefully observed. This literature review covers the constructive methods, the pruning methods, and the evolutionary methods and questions about the basic assumption intrinsic to the conventional neural network learning paradigm, which is primarily devoted to optimization of connection weights (or synaptic strengths) for the pre-determined connection structure of the network. The main research hypothesis governing this thesis is that, without breaking a prevailing dichotomy between weights and connectivity of the network during learning phase, the efficient design of a task-specific neural network is hard to achieve because, as long as connectivity and weights are searched by separate means, a structural optimization of the neural network requires either repetitive re-training procedures or computationally expensive topological meta-search cycles. The main contribution of this thesis is designing and testing a novel learning mechanism which efficiently learns not only weight parameters but also connection structure from a given training data set, and positioning this learning mechanism within the surrogate modeling practice. In this work, a simple and straightforward extension to the conventional error Back-Propagation (BP) algorithm has been formulated to enable a simultaneous learning for both connectivity and weights of the Generalized Multilayer Perceptron (GMLP) in supervised learning tasks. A particular objective is to achieve a task-specific network having reasonable generalization performance with a minimal training time. The dichotomy between architectural design and weight optimization is reconciled by a mechanism establishing a new connection for a neuron pair which has potentially higher error-gradient than one of the existing connections. Interpreting an instance of the absence of connection as a zero-weight connection, the potential contribution to training error reduction of any present or absent connection can readily be evaluated using the BP algorithm. Instead of being broken, the connections that contribute less remain frozen with constant weight values optimized to that point but they are excluded from further weight optimization until reselected. In this way, a selective weight optimization is executed only for the dynamically maintained pool of high gradient connections. By searching the rapidly changing weights and concentrating optimization resources on them, the learning process is accelerated without either a significant increase in computational cost or a need for re-training. This results in a more task-adapted network connection structure. Combined with another important criterion for the division of a neuron which adds a new computational unit to a network, a highly fitted network can be grown out of the minimal random structure. This particular learning strategy can belong to a more broad class of the variable connectivity learning scheme and the devised algorithm has been named Optimal Brain Growth (OBG). The OBG algorithm has been tested on two canonical problems; a regression analysis using the Complicated Interaction Regression Function and a classification of the Two-Spiral Problem. A comparative study with conventional Multilayer Perceptrons (MLPs) consisting of single- and double-hidden layers shows that OBG is less sensitive to random initial conditions and generalizes better with only a minimal increase in computational time. This partially proves that a variable connectivity learning scheme has great potential to enhance computational efficiency and reduce efforts to select proper network architecture. To investigate the applicability of the OBG to more practical surrogate modeling tasks, the geometry-to-pressure mapping of a particular class of airfoils in the transonic flow regime has been sought using both the conventional MLP networks with pre-defined architecture and the OBG-developed networks started from the same initial MLP networks. Considering wide variety in airfoil geometry and diversity of flow conditions distributed over a range of flow Mach numbers and angles of attack, the new method shows a great potential to capture fundamentally nonlinear flow phenomena especially related to the occurrence of shock waves on airfoil surfaces in transonic flow regime. (Abstract shortened by UMI.).

Estimation of Blood Flow Rates in Large Microvascular Networks

PubMed Central

Fry, Brendan C.; Lee, Jack; Smith, Nicolas P.; Secomb, Timothy W.

2012-01-01

Objective Recent methods for imaging microvascular structures provide geometrical data on networks containing thousands of segments. Prediction of functional properties, such as solute transport, requires information on blood flow rates also, but experimental measurement of many individual flows is difficult. Here, a method is presented for estimating flow rates in a microvascular network based on incomplete information on the flows in the boundary segments that feed and drain the network. Methods With incomplete boundary data, the equations governing blood flow form an underdetermined linear system. An algorithm was developed that uses independent information about the distribution of wall shear stresses and pressures in microvessels to resolve this indeterminacy, by minimizing the deviation of pressures and wall shear stresses from target values. Results The algorithm was tested using previously obtained experimental flow data from four microvascular networks in the rat mesentery. With two or three prescribed boundary conditions, predicted flows showed relatively small errors in most segments and fewer than 10% incorrect flow directions on average. Conclusions The proposed method can be used to estimate flow rates in microvascular networks, based on incomplete boundary data and provides a basis for deducing functional properties of microvessel networks. PMID:22506980

Inverse modeling of flow tomography experiments in fractured media

NASA Astrophysics Data System (ADS)

Klepikova, Maria; Le Borgne, Tanguy; Bour, Olivier; de Dreuzy, Jean-Raynald

2014-05-01

Inverse modeling of fracture hydraulic properties and connectivity is a very challenging objective due to the strong heterogeneity of the medium at multiple scales and the scarcity of data. Cross-borehole flowmeter tests, which consist of measuring changes in vertical borehole flows when pumping a neighboring borehole, were shown to be an efficient technique to provide information on the properties of the flow zones that connect borehole pairs (Paillet, 1998, Le Borgne et al., 2007). The interpretation of such experiments may, however, be quite uncertain when multiple connections exist. We propose the flow tomography approach (i.e., sequential cross-borehole flowmeter tests) to characterize the connectivity and transmissivity of preferential permeable flow paths in fractured aquifers (Klepikova et al., 2013). An inverse model approach is developed to estimate log-transformed transmissivity values of hydraulically active fractures between the pumping and observation wells by inverting cross-borehole flow and water level data. Here a simplified discrete fracture network approach that highlights main connectivity structures is used. This conceptual model attempts to reproduce fracture network connectivity without taking fracture geometry (length, orientation, dip) into account. We demonstrate that successively exchanging the roles of pumping and observation boreholes improves the quality of available information and reduces the under-determination of the problem. The inverse method is validated for several synthetic flow scenarios. It is shown to provide a good estimation of connectivity patterns and transmissivities of main flow paths. It also allows the estimation of the transmissivity of fractures that connect the flow paths but do not cross the boreholes, although the associated uncertainty may be high for some geometries. The results of this investigation encourage the application of flow tomography to natural fractured aquifers.

Flow Pattern Identification of Horizontal Two-Phase Refrigerant Flow Using Neural Networks

DTIC Science & Technology

2015-12-31

AFRL-RQ-WP-TP-2016-0079 FLOW PATTERN IDENTIFICATION OF HORIZONTAL TWO-PHASE REFRIGERANT FLOW USING NEURAL NETWORKS (POSTPRINT) Abdeel J...Journal Article Postprint 01 October 2013 – 22 June 2015 4. TITLE AND SUBTITLE FLOW PATTERN IDENTIFICATION OF HORIZONTAL TWO-PHASE REFRIGERANT FLOW USING...networks were used to automatically identify two-phase flow patterns for refrigerant R-134a flowing in a horizontal tube. In laboratory experiments

Social networks and trade of services: modelling interregional flows with spatial and network autocorrelation effects

NASA Astrophysics Data System (ADS)

de la Mata, Tamara; Llano, Carlos

2013-07-01

Recent literature on border effect has fostered research on informal barriers to trade and the role played by network dependencies. In relation to social networks, it has been shown that intensity of trade in goods is positively correlated with migration flows between pairs of countries/regions. In this article, we investigate whether such a relation also holds for interregional trade of services. We also consider whether interregional trade flows in services linked with tourism exhibit spatial and/or social network dependence. Conventional empirical gravity models assume the magnitude of bilateral flows between regions is independent of flows to/from regions located nearby in space, or flows to/from regions related through social/cultural/ethic network connections. With this aim, we provide estimates from a set of gravity models showing evidence of statistically significant spatial and network (demographic) dependence in the bilateral flows of the trade of services considered. The analysis has been applied to the Spanish intra- and interregional monetary flows of services from the accommodation, restaurants and travel agencies for the period 2000-2009, using alternative datasets for the migration stocks and definitions of network effects.

ADFNE: Open source software for discrete fracture network engineering, two and three dimensional applications

NASA Astrophysics Data System (ADS)

Fadakar Alghalandis, Younes

2017-05-01

Rapidly growing topic, the discrete fracture network engineering (DFNE), has already attracted many talents from diverse disciplines in academia and industry around the world to challenge difficult problems related to mining, geothermal, civil, oil and gas, water and many other projects. Although, there are few commercial software capable of providing some useful functionalities fundamental for DFNE, their costs, closed code (black box) distributions and hence limited programmability and tractability encouraged us to respond to this rising demand with a new solution. This paper introduces an open source comprehensive software package for stochastic modeling of fracture networks in two- and three-dimension in discrete formulation. Functionalities included are geometric modeling (e.g., complex polygonal fracture faces, and utilizing directional statistics), simulations, characterizations (e.g., intersection, clustering and connectivity analyses) and applications (e.g., fluid flow). The package is completely written in Matlab scripting language. Significant efforts have been made to bring maximum flexibility to the functions in order to solve problems in both two- and three-dimensions in an easy and united way that is suitable for beginners, advanced and experienced users.

a Numerical Investigation of the Jamming Transition in Traffic Flow on Diluted Planar Networks

NASA Astrophysics Data System (ADS)

Achler, Gabriele; Barra, Adriano

In order to develop a toy model for car's traffic in cities, in this paper we analyze, by means of numerical simulations, the transition among fluid regimes and a congested jammed phase of the flow of kinetically constrained hard spheres in planar random networks similar to urban roads. In order to explore as timescales as possible, at a microscopic level we implement an event driven dynamics as the infinite time limit of a class of already existing model (Follow the Leader) on an Erdos-Renyi two-dimensional graph, the crossroads being accounted by standard Kirchoff density conservations. We define a dynamical order parameter as the ratio among the moving spheres versus the total number and by varying two control parameters (density of the spheres and coordination number of the network) we study the phase transition. At a mesoscopic level it respects an, again suitable, adapted version of the Lighthill-Whitham model, which belongs to the fluid-dynamical approach to the problem. At a macroscopic level, the model seems to display a continuous transition from a fluid phase to a jammed phase when varying the density of the spheres (the amount of cars in a city-like scenario) and a discontinuous jump when varying the connectivity of the underlying network.

Electric Current Flow Through Two-Dimensional Networks

NASA Astrophysics Data System (ADS)

Gaspard, Mallory

In modern nanotechnology, two-dimensional atomic network structures boast promising applications as nanoscale circuit boards to serve as the building blocks of more sustainable and efficient, electronic devices. However, properties associated with the network connectivity can be beneficial or deleterious to the current flow. Taking a computational approach, we will study large uniform networks, as well as large random networks using Kirchhoff's Equations in conjunction with graph theoretical measures of network connectedness and flows, to understand how network connectivity affects overall ability for successful current flow throughout a network. By understanding how connectedness affects flow, we may develop new ways to design more efficient two-dimensional materials for the next generation of nanoscale electronic devices, and we will gain a deeper insight into the intricate balance between order and chaos in the universe. Rensselaer Polytechnic Institute, SURP Institutional Grant.

Applications of network analysis for adaptive management of artificial drainage systems in landscapes vulnerable to sea level rise

NASA Astrophysics Data System (ADS)

Poulter, Benjamin; Goodall, Jonathan L.; Halpin, Patrick N.

2008-08-01

SummaryThe vulnerability of coastal landscapes to sea level rise is compounded by the existence of extensive artificial drainage networks initially built to lower water tables for agriculture, forestry, and human settlements. These drainage networks are found in landscapes with little topographic relief where channel flow is characterized by bi-directional movement across multiple time-scales and related to precipitation, wind, and tidal patterns. The current configuration of many artificial drainage networks exacerbates impacts associated with sea level rise such as salt-intrusion and increased flooding. This suggests that in the short-term, drainage networks might be managed to mitigate sea level rise related impacts. The challenge, however, is that hydrologic processes in regions where channel flow direction is weakly related to slope and topography require extensive parameterization for numerical models which is limited where network size is on the order of a hundred or more kilometers in total length. Here we present an application of graph theoretic algorithms to efficiently investigate network properties relevant to the management of a large artificial drainage system in coastal North Carolina, USA. We created a digital network model representing the observation network topology and four types of drainage features (canal, collector and field ditches, and streams). We applied betweenness-centrality concepts (using Dijkstra's shortest path algorithm) to determine major hydrologic flowpaths based off of hydraulic resistance. Following this, we identified sub-networks that could be managed independently using a community structure and modularity approach. Lastly, a betweenness-centrality algorithm was applied to identify major shoreline entry points to the network that disproportionately control water movement in and out of the network. We demonstrate that graph theory can be applied to solving management and monitoring problems associated with sea level rise for poorly understood drainage networks in advance of numerical methods.

Numerical Experiments on Advective Transport in Large Three-Dimensional Discrete Fracture Networks

NASA Astrophysics Data System (ADS)

Makedonska, N.; Painter, S. L.; Karra, S.; Gable, C. W.

2013-12-01

Modeling of flow and solute transport in discrete fracture networks is an important approach for understanding the migration of contaminants in impermeable hard rocks such as granite, where fractures provide dominant flow and transport pathways. The discrete fracture network (DFN) model attempts to mimic discrete pathways for fluid flow through a fractured low-permeable rock mass, and may be combined with particle tracking simulations to address solute transport. However, experience has shown that it is challenging to obtain accurate transport results in three-dimensional DFNs because of the high computational burden and difficulty in constructing a high-quality unstructured computational mesh on simulated fractures. An integrated DFN meshing [1], flow, and particle tracking [2] simulation capability that enables accurate flow and particle tracking simulation on large DFNs has recently been developed. The new capability has been used in numerical experiments on advective transport in large DFNs with tens of thousands of fractures and millions of computational cells. The modeling procedure starts from the fracture network generation using a stochastic model derived from site data. A high-quality computational mesh is then generated [1]. Flow is then solved using the highly parallel PFLOTRAN [3] code. PFLOTRAN uses the finite volume approach, which is locally mass conserving and thus eliminates mass balance problems during particle tracking. The flow solver provides the scalar fluxes on each control volume face. From the obtained fluxes the Darcy velocity is reconstructed for each node in the network [4]. Velocities can then be continuously interpolated to any point in the domain of interest, thus enabling random walk particle tracking. In order to describe the flow field on fractures intersections, the control volume cells on intersections are split into four planar polygons, where each polygon corresponds to a piece of a fracture near the intersection line. Thus, computational nodes lying on fracture intersections have four associated velocities, one on each side of the intersection in each fracture plane [2]. This information is used to route particles arriving at the fracture intersection to the appropriate downstream fracture segment. Verified for small DFNs, the new simulation capability allows accurate particle tracking on more realistic representations of fractured rock sites. In the current work we focus on travel time statistics and spatial dispersion and show numerical results in DFNs of different sizes, fracture densities, and transmissivity distributions. [1] Hyman J.D., Gable C.W., Painter S.L., Automated meshing of stochastically generated discrete fracture networks, Abstract H33G-1403, 2011 AGU, San Francisco, CA, 5-9 Dec. [2] N. Makedonska, S. L. Painter, T.-L. Hsieh, Q.M. Bui, and C. W. Gable., Development and verification of a new particle tracking capability for modeling radionuclide transport in discrete fracture networks, Abstract, 2013 IHLRWM, Albuquerque, NM, Apr. 28 - May 3. [3] Lichtner, P.C., Hammond, G.E., Bisht, G., Karra, S., Mills, R.T., and Kumar, J. (2013) PFLOTRAN User's Manual: A Massively Parallel Reactive Flow Code. [4] Painter S.L., Gable C.W., Kelkar S., Pathline tracing on fully unstructured control-volume grids, Computational Geosciences, 16 (4), 2012, 1125-1134.

Identification of individual coherent sets associated with flow trajectories using coherent structure coloring

NASA Astrophysics Data System (ADS)

Schlueter-Kuck, Kristy L.; Dabiri, John O.

2017-09-01

We present a method for identifying the coherent structures associated with individual Lagrangian flow trajectories even where only sparse particle trajectory data are available. The method, based on techniques in spectral graph theory, uses the Coherent Structure Coloring vector and associated eigenvectors to analyze the distance in higher-dimensional eigenspace between a selected reference trajectory and other tracer trajectories in the flow. By analyzing this distance metric in a hierarchical clustering, the coherent structure of which the reference particle is a member can be identified. This algorithm is proven successful in identifying coherent structures of varying complexities in canonical unsteady flows. Additionally, the method is able to assess the relative coherence of the associated structure in comparison to the surrounding flow. Although the method is demonstrated here in the context of fluid flow kinematics, the generality of the approach allows for its potential application to other unsupervised clustering problems in dynamical systems such as neuronal activity, gene expression, or social networks.

Case Study on Optimal Routing in Logistics Network by Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Wang, Xiaoguang; Lin, Lin; Gen, Mitsuo; Shiota, Mitsushige

Recently, research on logistics caught more and more attention. One of the important issues on logistics system is to find optimal delivery routes with the least cost for products delivery. Numerous models have been developed for that reason. However, due to the diversity and complexity of practical problem, the existing models are usually not very satisfying to find the solution efficiently and convinently. In this paper, we treat a real-world logistics case with a company named ABC Co. ltd., in Kitakyusyu Japan. Firstly, based on the natures of this conveyance routing problem, as an extension of transportation problem (TP) and fixed charge transportation problem (fcTP) we formulate the problem as a minimum cost flow (MCF) model. Due to the complexity of fcTP, we proposed a priority-based genetic algorithm (pGA) approach to find the most acceptable solution to this problem. In this pGA approach, a two-stage path decoding method is adopted to develop delivery paths from a chromosome. We also apply the pGA approach to this problem, and compare our results with the current logistics network situation, and calculate the improvement of logistics cost to help the management to make decisions. Finally, in order to check the effectiveness of the proposed method, the results acquired are compared with those come from the two methods/ software, such as LINDO and CPLEX.

Analysis and Application of Microgrids

NASA Astrophysics Data System (ADS)

Yue, Lu

New trends of generating electricity locally and utilizing non-conventional or renewable energy sources have attracted increasing interests due to the gradual depletion of conventional fossil fuel energy sources. The new type of power generation is called Distributed Generation (DG) and the energy sources utilized by Distributed Generation are termed Distributed Energy Sources (DERs). With DGs embedded in the distribution networks, they evolve from passive distribution networks to active distribution networks enabling bidirectional power flows in the networks. Further incorporating flexible and intelligent controllers and employing future technologies, active distribution networks will turn to a Microgrid. A Microgrid is a small-scale, low voltage Combined with Heat and Power (CHP) supply network designed to supply electrical and heat loads for a small community. To further implement Microgrids, a sophisticated Microgrid Management System must be integrated. However, due to the fact that a Microgrid has multiple DERs integrated and is likely to be deregulated, the ability to perform real-time OPF and economic dispatch with fast speed advanced communication network is necessary. In this thesis, first, problems such as, power system modelling, power flow solving and power system optimization, are studied. Then, Distributed Generation and Microgrid are studied and reviewed, including a comprehensive review over current distributed generation technologies and Microgrid Management Systems, etc. Finally, a computer-based AC optimization method which minimizes the total transmission loss and generation cost of a Microgrid is proposed and a wireless communication scheme based on synchronized Code Division Multiple Access (sCDMA) is proposed. The algorithm is tested with a 6-bus power system and a 9-bus power system.

Transition Characteristic Analysis of Traffic Evolution Process for Urban Traffic Network

PubMed Central

Chen, Hong; Li, Yang

2014-01-01

The characterization of the dynamics of traffic states remains fundamental to seeking for the solutions of diverse traffic problems. To gain more insights into traffic dynamics in the temporal domain, this paper explored temporal characteristics and distinct regularity in the traffic evolution process of urban traffic network. We defined traffic state pattern through clustering multidimensional traffic time series using self-organizing maps and construct a pattern transition network model that is appropriate for representing and analyzing the evolution progress. The methodology is illustrated by an application to data flow rate of multiple road sections from Network of Shenzhen's Nanshan District, China. Analysis and numerical results demonstrated that the methodology permits extracting many useful traffic transition characteristics including stability, preference, activity, and attractiveness. In addition, more information about the relationships between these characteristics was extracted, which should be helpful in understanding the complex behavior of the temporal evolution features of traffic patterns. PMID:24982969

ProphTools: general prioritization tools for heterogeneous biological networks.

PubMed

Navarro, Carmen; Martínez, Victor; Blanco, Armando; Cano, Carlos

2017-12-01

Networks have been proven effective representations for the analysis of biological data. As such, there exist multiple methods to extract knowledge from biological networks. However, these approaches usually limit their scope to a single biological entity type of interest or they lack the flexibility to analyze user-defined data. We developed ProphTools, a flexible open-source command-line tool that performs prioritization on a heterogeneous network. ProphTools prioritization combines a Flow Propagation algorithm similar to a Random Walk with Restarts and a weighted propagation method. A flexible model for the representation of a heterogeneous network allows the user to define a prioritization problem involving an arbitrary number of entity types and their interconnections. Furthermore, ProphTools provides functionality to perform cross-validation tests, allowing users to select the best network configuration for a given problem. ProphTools core prioritization methodology has already been proven effective in gene-disease prioritization and drug repositioning. Here we make ProphTools available to the scientific community as flexible, open-source software and perform a new proof-of-concept case study on long noncoding RNAs (lncRNAs) to disease prioritization. ProphTools is robust prioritization software that provides the flexibility not present in other state-of-the-art network analysis approaches, enabling researchers to perform prioritization tasks on any user-defined heterogeneous network. Furthermore, the application to lncRNA-disease prioritization shows that ProphTools can reach the performance levels of ad hoc prioritization tools without losing its generality. © The Authors 2017. Published by Oxford University Press.

Eigenvector centrality for geometric and topological characterization of porous media

NASA Astrophysics Data System (ADS)

Jimenez-Martinez, Joaquin; Negre, Christian F. A.

2017-07-01

Solving flow and transport through complex geometries such as porous media is computationally difficult. Such calculations usually involve the solution of a system of discretized differential equations, which could lead to extreme computational cost depending on the size of the domain and the accuracy of the model. Geometric simplifications like pore networks, where the pores are represented by nodes and the pore throats by edges connecting pores, have been proposed. These models, despite their ability to preserve the connectivity of the medium, have difficulties capturing preferential paths (high velocity) and stagnation zones (low velocity), as they do not consider the specific relations between nodes. Nonetheless, network theory approaches, where a complex network is a graph, can help to simplify and better understand fluid dynamics and transport in porous media. Here we present an alternative method to address these issues based on eigenvector centrality, which has been corrected to overcome the centralization problem and modified to introduce a bias in the centrality distribution along a particular direction to address the flow and transport anisotropy in porous media. We compare the model predictions with millifluidic transport experiments, which shows that, albeit simple, this technique is computationally efficient and has potential for predicting preferential paths and stagnation zones for flow and transport in porous media. We propose to use the eigenvector centrality probability distribution to compute the entropy as an indicator of the "mixing capacity" of the system.

Dynamics of comb-of-comb-network polymers in random layered flows

NASA Astrophysics Data System (ADS)

Katyal, Divya; Kant, Rama

2016-12-01

We analyze the dynamics of comb-of-comb-network polymers in the presence of external random flows. The dynamics of such structures is evaluated through relevant physical quantities, viz., average square displacement (ASD) and the velocity autocorrelation function (VACF). We focus on comparing the dynamics of the comb-of-comb network with the linear polymer. The present work displays an anomalous diffusive behavior of this flexible network in the random layered flows. The effect of the polymer topology on the dynamics is analyzed by varying the number of generations and branch lengths in these networks. In addition, we investigate the influence of external flow on the dynamics by varying flow parameters, like the flow exponent α and flow strength Wα. Our analysis highlights two anomalous power-law regimes, viz., subdiffusive (intermediate-time polymer stretching and flow-induced diffusion) and superdiffusive (long-time flow-induced diffusion). The anomalous long-time dynamics is governed by the temporal exponent ν of ASD, viz., ν =2 -α /2 . Compared to a linear polymer, the comb-of-comb network shows a shorter crossover time (from the subdiffusive to superdiffusive regime) but a reduced magnitude of ASD. Our theory displays an anomalous VACF in the random layered flows that scales as t-α /2. We show that the network with greater total mass moves faster.

Modelling CO2 flow in naturally fractured geological media using MINC and multiple subregion upscaling procedure

NASA Astrophysics Data System (ADS)

Tatomir, Alexandru Bogdan A. C.; Flemisch, Bernd; Class, Holger; Helmig, Rainer; Sauter, Martin

2017-04-01

Geological storage of CO2 represents one viable solution to reduce greenhouse gas emission in the atmosphere. Potential leakage of CO2 storage can occur through networks of interconnected fractures. The geometrical complexity of these networks is often very high involving fractures occurring at various scales and having hierarchical structures. Such multiphase flow systems are usually hard to solve with a discrete fracture modelling (DFM) approach. Therefore, continuum fracture models assuming average properties are usually preferred. The multiple interacting continua (MINC) model is an extension of the classic double porosity model (Warren and Root, 1963) which accounts for the non-linear behaviour of the matrix-fracture interactions. For CO2 storage applications the transient representation of the inter-porosity two phase flow plays an important role. This study tests the accuracy and computational efficiency of the MINC method complemented with the multiple sub-region (MSR) upscaling procedure versus the DFM. The two phase flow MINC simulator is implemented in the free-open source numerical toolbox DuMux (www.dumux.org). The MSR (Gong et al., 2009) determines the inter-porosity terms by solving simplified local single-phase flow problems. The DFM is considered as the reference solution. The numerical examples consider a quasi-1D reservoir with a quadratic fracture system , a five-spot radial symmetric reservoir, and a completely random generated fracture system. Keywords: MINC, upscaling, two-phase flow, fractured porous media, discrete fracture model, continuum fracture model

Effects of inter-packet spacing on the delivery of multimedia content

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kapadia, A. C.; Feng, A. C.; Feng, W. C.

2001-01-01

Streaming multimedia content with UDP has become increasingly popular over distributed systems such as the Internet. However, because UDP does not possess any congestion-control mechanism and most best-effort trafic is served by the congestion-controlled TCP, UDP flows steal bandwidth from TCP to the point that TCP flows can starve for network resources. Furthermore, such applications may cause the Internet infrastructure to eventually suffer from congestion collapse because UDP trafic does not self-regulate itself. To address this problem, next-generation Internet routers will implement active queue-management schemes to punish malicious traffic, e.g., non-adaptive UDP flows, and to the improve the performance ofmore » congestion-controlled traffic, e.g., TCP flows. The arrival of such routers will cripple the performance of today's UDP-based multimedia applications. So, in this paper, we introduce the notion of inter-packet spacing with control feedback to enable these UDP-based applications to perform well in the next-generation Internet while being adaptive and self-regulating. When compared with traditional UDP-based multimedia streaming, we illustrate that our counterintuitive, interpacket-spacing scheme with control feedback can reduce packet loss by 90% without adversely affecting delivered throughput. Keywords: network protocol, multimedia, packet spacing, rate-adjusting congestion control.« less

Assessment of topographic and drainage network controls on debris-flow travel distance along the west coast of the United States

USGS Publications Warehouse

Coe, Jeffrey A.; Reid, Mark E.; Brien, Dainne L.; Michael, John A.

2011-01-01

To better understand controls on debris-flow entrainment and travel distance, we examined topographic and drainage network characteristics of initiation locations in two separate debris-flow prone areas located 700 km apart along the west coast of the U.S. One area was located in northern California, the other in southern Oregon. In both areas, debris flows mobilized from slides during large storms, but, when stratified by number of contributing initiation locations, median debris-flow travel distances in Oregon were 5 to 8 times longer than median distances in California. Debris flows in Oregon readily entrained channel material; entrainment in California was minimal. To elucidate this difference, we registered initiation locations to high-resolution airborne LiDAR, and then examined travel distances with respect to values of slope, upslope contributing area, planform curvature, distance from initiation locations to the drainage network, and number of initiation areas that contributed to flows. Results show distinct differences in the topographic and drainage network characteristics of debris-flow initiation locations between the two study areas. Slope and planform curvature of initiation locations (landslide headscarps), commonly used to predict landslide-prone areas, were not useful for predicting debris-flow travel distances. However, a positive, power-law relation exists between median debris-flow travel distance and the number of contributing debris-flow initiation locations. Moreover, contributing area and the proximity of the initiation locations to the drainage network both influenced travel distances, but proximity to the drainage network was the better predictor of travel distance. In both study areas, flows that interacted with the drainage network flowed significantly farther than those that did not. In California, initiation sites within 60 m of the network were likely to reach the network and generate longtraveled flows; in Oregon, the threshold was 80 m.

Controllability of flow-conservation networks

NASA Astrophysics Data System (ADS)

Zhao, Chen; Zeng, An; Jiang, Rui; Yuan, Zhengzhong; Wang, Wen-Xu

2017-07-01

The ultimate goal of exploring complex networks is to control them. As such, controllability of complex networks has been intensively investigated. Despite recent advances in studying the impact of a network's topology on its controllability, a comprehensive understanding of the synergistic impact of network topology and dynamics on controllability is still lacking. Here, we explore the controllability of flow-conservation networks, trying to identify the minimal number of driver nodes that can guide the network to any desirable state. We develop a method to analyze the controllability on flow-conservation networks based on exact controllability theory, transforming the original analysis on adjacency matrix to Laplacian matrix. With this framework, we systematically investigate the impact of some key factors of networks, including link density, link directionality, and link polarity, on the controllability of these networks. We also obtain the analytical equations by investigating the network's structural properties approximatively and design the efficient tools. Finally, we consider some real networks with flow dynamics, finding that their controllability is significantly different from that predicted by only considering the topology. These findings deepen our understanding of network controllability with flow-conservation dynamics and provide a general framework to incorporate real dynamics in the analysis of network controllability.

An Artificial Intelligence Approach for Modeling and Prediction of Water Diffusion Inside a Carbon Nanotube

PubMed Central

2009-01-01

Modeling of water flow in carbon nanotubes is still a challenge for the classic models of fluid dynamics. In this investigation, an adaptive-network-based fuzzy inference system (ANFIS) is presented to solve this problem. The proposed ANFIS approach can construct an input–output mapping based on both human knowledge in the form of fuzzy if-then rules and stipulated input–output data pairs. Good performance of the designed ANFIS ensures its capability as a promising tool for modeling and prediction of fluid flow at nanoscale where the continuum models of fluid dynamics tend to break down. PMID:20596382

An Artificial Intelligence Approach for Modeling and Prediction of Water Diffusion Inside a Carbon Nanotube.

PubMed

Ahadian, Samad; Kawazoe, Yoshiyuki

2009-06-04

Modeling of water flow in carbon nanotubes is still a challenge for the classic models of fluid dynamics. In this investigation, an adaptive-network-based fuzzy inference system (ANFIS) is presented to solve this problem. The proposed ANFIS approach can construct an input-output mapping based on both human knowledge in the form of fuzzy if-then rules and stipulated input-output data pairs. Good performance of the designed ANFIS ensures its capability as a promising tool for modeling and prediction of fluid flow at nanoscale where the continuum models of fluid dynamics tend to break down.

Architecture Design and Experimental Platform Demonstration of Optical Network based on OpenFlow Protocol

NASA Astrophysics Data System (ADS)

Xing, Fangyuan; Wang, Honghuan; Yin, Hongxi; Li, Ming; Luo, Shenzi; Wu, Chenguang

2016-02-01

With the extensive application of cloud computing and data centres, as well as the constantly emerging services, the big data with the burst characteristic has brought huge challenges to optical networks. Consequently, the software defined optical network (SDON) that combines optical networks with software defined network (SDN), has attracted much attention. In this paper, an OpenFlow-enabled optical node employed in optical cross-connect (OXC) and reconfigurable optical add/drop multiplexer (ROADM), is proposed. An open source OpenFlow controller is extended on routing strategies. In addition, the experiment platform based on OpenFlow protocol for software defined optical network, is designed. The feasibility and availability of the OpenFlow-enabled optical nodes and the extended OpenFlow controller are validated by the connectivity test, protection switching and load balancing experiments in this test platform.

Design and Evaluation of a Proxy-Based Monitoring System for OpenFlow Networks.

PubMed

Taniguchi, Yoshiaki; Tsutsumi, Hiroaki; Iguchi, Nobukazu; Watanabe, Kenzi

2016-01-01

Software-Defined Networking (SDN) has attracted attention along with the popularization of cloud environment and server virtualization. In SDN, the control plane and the data plane are decoupled so that the logical topology and routing control can be configured dynamically depending on network conditions. To obtain network conditions precisely, a network monitoring mechanism is necessary. In this paper, we focus on OpenFlow which is a core technology to realize SDN. We propose, design, implement, and evaluate a network monitoring system for OpenFlow networks. Our proposed system acts as a proxy between an OpenFlow controller and OpenFlow switches. Through experimental evaluations, we confirm that our proposed system can capture packets and monitor traffic information depending on administrator's configuration. In addition, we show that our proposed system does not influence significant performance degradation to overall network performance.

Design and Evaluation of a Proxy-Based Monitoring System for OpenFlow Networks

PubMed Central

Taniguchi, Yoshiaki; Tsutsumi, Hiroaki; Iguchi, Nobukazu; Watanabe, Kenzi

2016-01-01

Software-Defined Networking (SDN) has attracted attention along with the popularization of cloud environment and server virtualization. In SDN, the control plane and the data plane are decoupled so that the logical topology and routing control can be configured dynamically depending on network conditions. To obtain network conditions precisely, a network monitoring mechanism is necessary. In this paper, we focus on OpenFlow which is a core technology to realize SDN. We propose, design, implement, and evaluate a network monitoring system for OpenFlow networks. Our proposed system acts as a proxy between an OpenFlow controller and OpenFlow switches. Through experimental evaluations, we confirm that our proposed system can capture packets and monitor traffic information depending on administrator's configuration. In addition, we show that our proposed system does not influence significant performance degradation to overall network performance. PMID:27006977

Exploring 3D optimal channel networks by multiple organizing principles

NASA Astrophysics Data System (ADS)

Mason, Emanuele; Bizzi, Simone; Cominola, Andrea; Castelletti, Andrea; Paik, Kyungrock

2017-04-01

Catchment topography and flow networks are shaped by the interactions of water and sediment across various spatial and temporal scales. The complexity of these processes hinders the development of models able to assess the validity of general principles governing such phenomena. The theory of Optimal Channel Networks (OCNs) proved that it is possible to generate drainage networks statistically comparable to those observed in nature by minimizing the energy spent by the water flowing through them. So far, the OCN theory has been developed for planar 2D domains, assuming equal energy expenditure per unit area of channel and, correspondingly, a constant slope-discharge relationship. In this work, we apply the OCN theory to 3D problems by introducing a multi-principle minimization starting from an artificial digital elevation model of pyramidal shape. The OCN theory assumption of constant slope-area relationship is relaxed and embedded into a second-order principle. The modelled 3D channel networks achieve lower total energy expenditure corresponding to 2D sub-optimal OCNs bound to specific slope-area relationships. This is the first time we are able to explore accessible 3D OCNs starting from a general DEM. By contrasting the modelled 3D OCNs and natural river networks, we found statistical similarities of two indexes, namely the area exponent index and the profile concavity index. Among the wide range of alternative and sub-optimal river networks, a minimum degree of 3D network organization is found to guarantee the indexes values within the natural range. These networks simultaneously possess topological and topographic properties of real river networks. We found a pivotal functional link between slope-area relationship and accessible sub-optimal 2D river network paths, which suggests that geological and climate conditions producing slope-area relationships in natural basins co-determine the degree of optimality of accessible network paths.

Geomorphic clues to the Martian volatile inventory. 1: Flow ejecta blankets

NASA Technical Reports Server (NTRS)

Pieri, D.; Baloga, S.; Norris, M.

1984-01-01

There are classes of landforms whose presence on Mars is strongly suggestive, if not confirmatory, of the participation of volatiles, presumably water, in its geomorphic development: (1) valley networks, (2) outflow channels, (3) landslides, and (4) flow-ejecta blankets. The first two may represent landforms generated by the movement of volatiles from sources, while the latter two probably represent the dissipation of energy generated by forcing inputs (e.g., kinetic energy and gravity) modulated by volatiles. In many areas on Mars, all four processes have acted on the same lithologic materials and were influenced by the composition of those units, and possibility by the climatic regime at the time of their formation. One of the approaches discussed to this specific problem of landform genesis, and to the general problem of the present and past states of martian volatiles, is to attempt to constrain the distribution, amount, and history of available volatiles by using possible evidence of volatile participation expressed in the morphology of other related landforms (e.g., flow-ejecta blankets and landslides) coupled with physical models for landform genesis.

Multiobjective genetic algorithm conjunctive use optimization for production, cost, and energy with dynamic return flow

NASA Astrophysics Data System (ADS)

Peralta, Richard C.; Forghani, Ali; Fayad, Hala

2014-04-01

Many real water resources optimization problems involve conflicting objectives for which the main goal is to find a set of optimal solutions on, or near to the Pareto front. E-constraint and weighting multiobjective optimization techniques have shortcomings, especially as the number of objectives increases. Multiobjective Genetic Algorithms (MGA) have been previously proposed to overcome these difficulties. Here, an MGA derives a set of optimal solutions for multiobjective multiuser conjunctive use of reservoir, stream, and (un)confined groundwater resources. The proposed methodology is applied to a hydraulically and economically nonlinear system in which all significant flows, including stream-aquifer-reservoir-diversion-return flow interactions, are simulated and optimized simultaneously for multiple periods. Neural networks represent constrained state variables. The addressed objectives that can be optimized simultaneously in the coupled simulation-optimization model are: (1) maximizing water provided from sources, (2) maximizing hydropower production, and (3) minimizing operation costs of transporting water from sources to destinations. Results show the efficiency of multiobjective genetic algorithms for generating Pareto optimal sets for complex nonlinear multiobjective optimization problems.

Minimal model of a cell connecting amoebic motion and adaptive transport networks.

PubMed

Gunji, Yukio-Pegio; Shirakawa, Tomohiro; Niizato, Takayuki; Haruna, Taichi

2008-08-21

A cell is a minimal self-sustaining system that can move and compute. Previous work has shown that a unicellular slime mold, Physarum, can be utilized as a biological computer based on cytoplasmic flow encapsulated by a membrane. Although the interplay between the modification of the boundary of a cell and the cytoplasmic flow surrounded by the boundary plays a key role in Physarum computing, no model of a cell has been developed to describe this interplay. Here we propose a toy model of a cell that shows amoebic motion and can solve a maze, Steiner minimum tree problem and a spanning tree problem. Only by assuming that cytoplasm is hardened after passing external matter (or softened part) through a cell, the shape of the cell and the cytoplasmic flow can be changed. Without cytoplasm hardening, a cell is easily destroyed. This suggests that cytoplasmic hardening and/or sol-gel transformation caused by external perturbation can keep a cell in a critical state leading to a wide variety of shapes and motion.

Geomorphic clues to the Martian volatile inventory. 1: Flow ejecta blankets

NASA Astrophysics Data System (ADS)

Pieri, D.; Baloga, S.; Norris, M.

1984-04-01

There are classes of landforms whose presence on Mars is strongly suggestive, if not confirmatory, of the participation of volatiles, presumably water, in its geomorphic development: (1) valley networks, (2) outflow channels, (3) landslides, and (4) flow-ejecta blankets. The first two may represent landforms generated by the movement of volatiles from sources, while the latter two probably represent the dissipation of energy generated by forcing inputs (e.g., kinetic energy and gravity) modulated by volatiles. In many areas on Mars, all four processes have acted on the same lithologic materials and were influenced by the composition of those units, and possibility by the climatic regime at the time of their formation. One of the approaches discussed to this specific problem of landform genesis, and to the general problem of the present and past states of martian volatiles, is to attempt to constrain the distribution, amount, and history of available volatiles by using possible evidence of volatile participation expressed in the morphology of other related landforms (e.g., flow-ejecta blankets and landslides) coupled with physical models for landform genesis.

Atmospheric processes over complex terrain

NASA Astrophysics Data System (ADS)

Banta, Robert M.; Berri, G.; Blumen, William; Carruthers, David J.; Dalu, G. A.; Durran, Dale R.; Egger, Joseph; Garratt, J. R.; Hanna, Steven R.; Hunt, J. C. R.

1990-06-01

A workshop on atmospheric processes over complex terrain, sponsored by the American Meteorological Society, was convened in Park City, Utah from 24 vto 28 October 1988. The overall objective of the workshop was one of interaction and synthesis--interaction among atmospheric scientists carrying out research on a variety of orographic flow problems, and a synthesis of their results and points of view into an assessment of the current status of topical research problems. The final day of the workshop was devoted to an open discussion on the research directions that could be anticipated in the next decade because of new and planned instrumentation and observational networks, the recent emphasis on development of mesoscale numerical models, and continual theoretical investigations of thermally forced flows, orographic waves, and stratified turbulence. This monograph represents an outgrowth of the Park City Workshop. The authors have contributed chapters based on their lecture material. Workshop discussions indicated interest in both the remote sensing and predictability of orographic flows. These chapters were solicited following the workshop in order to provide a more balanced view of current progress and future directions in research on atmospheric processes over complex terrain.

Modelling groundwater fractal flow with fractional differentiation via Mittag-Leffler law

NASA Astrophysics Data System (ADS)

Ahokposi, D. P.; Atangana, Abdon; Vermeulen, D. P.

2017-04-01

Modelling the flow of groundwater within a network of fractures is perhaps one of the most difficult exercises within the field of geohydrology. This physical problem has attracted the attention of several scientists across the globe. Already two different types of differentiations have been used to attempt modelling this problem including the classical and the fractional differentiation. In this paper, we employed the most recent concept of differentiation based on the non-local and non-singular kernel called the generalized Mittag-Leffler function, to reshape the model of groundwater fractal flow. We presented the existence of positive solution of the new model. Using the fixed-point approach, we established the uniqueness of the positive solution. We solve the new model with three different numerical schemes including implicit, explicit and Crank-Nicholson numerical methods. Experimental data collected from four constant discharge tests conducted in a typical fractured crystalline rock aquifer of the Northern Limb (Bushveld Complex) in the Limpopo Province (South Africa) are compared with the numerical solutions. It is worth noting that the four boreholes (BPAC1, BPAC2, BPAC3, and BPAC4) are located on Faults.

Optimal-mass-transfer-based estimation of glymphatic transport in living brain

NASA Astrophysics Data System (ADS)

Ratner, Vadim; Zhu, Liangjia; Kolesov, Ivan; Nedergaard, Maiken; Benveniste, Helene; Tannenbaum, Allen

2015-03-01

It was recently shown that the brain-wide cerebrospinal fluid (CSF) and interstitial fluid exchange system designated the `glymphatic pathway' plays a key role in removing waste products from the brain, similarly to the lymphatic system in other body organs . It is therefore important to study the flow patterns of glymphatic transport through the live brain in order to better understand its functionality in normal and pathological states. Unlike blood, the CSF does not flow rapidly through a network of dedicated vessels, but rather through para-vascular channels and brain parenchyma in a slower time-domain, and thus conventional fMRI or other blood-flow sensitive MRI sequences do not provide much useful information about the desired flow patterns. We have accordingly analyzed a series of MRI images, taken at different times, of the brain of a live rat, which was injected with a paramagnetic tracer into the CSF via the lumbar intrathecal space of the spine. Our goal is twofold: (a) find glymphatic (tracer) flow directions in the live rodent brain; and (b) provide a model of a (healthy) brain that will allow the prediction of tracer concentrations given initial conditions. We model the liquid flow through the brain by the diffusion equation. We then use the Optimal Mass Transfer (OMT) approach to derive the glymphatic flow vector field, and estimate the diffusion tensors by analyzing the (changes in the) flow. Simulations show that the resulting model successfully reproduces the dominant features of the experimental data. Keywords: inverse problem, optimal mass transport, diffusion equation, cerebrospinal fluid flow in brain, optical flow, liquid flow modeling, Monge Kantorovich problem, diffusion tensor estimation

A new mutually reinforcing network node and link ranking algorithm

PubMed Central

Wang, Zhenghua; Dueñas-Osorio, Leonardo; Padgett, Jamie E.

2015-01-01

This study proposes a novel Normalized Wide network Ranking algorithm (NWRank) that has the advantage of ranking nodes and links of a network simultaneously. This algorithm combines the mutual reinforcement feature of Hypertext Induced Topic Selection (HITS) and the weight normalization feature of PageRank. Relative weights are assigned to links based on the degree of the adjacent neighbors and the Betweenness Centrality instead of assigning the same weight to every link as assumed in PageRank. Numerical experiment results show that NWRank performs consistently better than HITS, PageRank, eigenvector centrality, and edge betweenness from the perspective of network connectivity and approximate network flow, which is also supported by comparisons with the expensive N-1 benchmark removal criteria based on network efficiency. Furthermore, it can avoid some problems, such as the Tightly Knit Community effect, which exists in HITS. NWRank provides a new inexpensive way to rank nodes and links of a network, which has practical applications, particularly to prioritize resource allocation for upgrade of hierarchical and distributed networks, as well as to support decision making in the design of networks, where node and link importance depend on a balance of local and global integrity. PMID:26492958

Developing and using expert systems and neural networks in medicine: a review on benefits and challenges.

PubMed

Sheikhtaheri, Abbas; Sadoughi, Farahnaz; Hashemi Dehaghi, Zahra

2014-09-01

Complicacy of clinical decisions justifies utilization of information systems such as artificial intelligence (e.g. expert systems and neural networks) to achieve better decisions, however, application of these systems in the medical domain faces some challenges. We aimed at to review the applications of these systems in the medical domain and discuss about such challenges. Following a brief introduction of expert systems and neural networks by representing few examples, the challenges of these systems in the medical domain are discussed. We found that the applications of expert systems and artificial neural networks have been increased in the medical domain. These systems have shown many advantages such as utilization of experts' knowledge, gaining rare knowledge, more time for assessment of the decision, more consistent decisions, and shorter decision-making process. In spite of all these advantages, there are challenges ahead of developing and using such systems including maintenance, required experts, inputting patients' data into the system, problems for knowledge acquisition, problems in modeling medical knowledge, evaluation and validation of system performance, wrong recommendations and responsibility, limited domains of such systems and necessity of integrating such systems into the routine work flows. We concluded that expert systems and neural networks can be successfully used in medicine; however, there are many concerns and questions to be answered through future studies and discussions.

A Fault Tolerance Mechanism for On-Road Sensor Networks

PubMed Central

Feng, Lei; Guo, Shaoyong; Sun, Jialu; Yu, Peng; Li, Wenjing

2016-01-01

On-Road Sensor Networks (ORSNs) play an important role in capturing traffic flow data for predicting short-term traffic patterns, driving assistance and self-driving vehicles. However, this kind of network is prone to large-scale communication failure if a few sensors physically fail. In this paper, to ensure that the network works normally, an effective fault-tolerance mechanism for ORSNs which mainly consists of backup on-road sensor deployment, redundant cluster head deployment and an adaptive failure detection and recovery method is proposed. Firstly, based on the N − x principle and the sensors’ failure rate, this paper formulates the backup sensor deployment problem in the form of a two-objective optimization, which explains the trade-off between the cost and fault resumption. In consideration of improving the network resilience further, this paper introduces a redundant cluster head deployment model according to the coverage constraint. Then a common solving method combining integer-continuing and sequential quadratic programming is explored to determine the optimal location of these two deployment problems. Moreover, an Adaptive Detection and Resume (ADR) protocol is deigned to recover the system communication through route and cluster adjustment if there is a backup on-road sensor mismatch. The final experiments show that our proposed mechanism can achieve an average 90% recovery rate and reduce the average number of failed sensors at most by 35.7%. PMID:27918483

Enhanced reconstruction of weighted networks from strengths and degrees

NASA Astrophysics Data System (ADS)

Mastrandrea, Rossana; Squartini, Tiziano; Fagiolo, Giorgio; Garlaschelli, Diego

2014-04-01

Network topology plays a key role in many phenomena, from the spreading of diseases to that of financial crises. Whenever the whole structure of a network is unknown, one must resort to reconstruction methods that identify the least biased ensemble of networks consistent with the partial information available. A challenging case, frequently encountered due to privacy issues in the analysis of interbank flows and Big Data, is when there is only local (node-specific) aggregate information available. For binary networks, the relevant ensemble is one where the degree (number of links) of each node is constrained to its observed value. However, for weighted networks the problem is much more complicated. While the naïve approach prescribes to constrain the strengths (total link weights) of all nodes, recent counter-intuitive results suggest that in weighted networks the degrees are often more informative than the strengths. This implies that the reconstruction of weighted networks would be significantly enhanced by the specification of both strengths and degrees, a computationally hard and bias-prone procedure. Here we solve this problem by introducing an analytical and unbiased maximum-entropy method that works in the shortest possible time and does not require the explicit generation of reconstructed samples. We consider several real-world examples and show that, while the strengths alone give poor results, the additional knowledge of the degrees yields accurately reconstructed networks. Information-theoretic criteria rigorously confirm that the degree sequence, as soon as it is non-trivial, is irreducible to the strength sequence. Our results have strong implications for the analysis of motifs and communities and whenever the reconstructed ensemble is required as a null model to detect higher-order patterns.

Numerical Modeling of Interstitial Fluid Flow Coupled with Blood Flow through a Remodeled Solid Tumor Microvascular Network

PubMed Central

Soltani, M.; Chen, P.

2013-01-01

Modeling of interstitial fluid flow involves processes such as fluid diffusion, convective transport in extracellular matrix, and extravasation from blood vessels. To date, majority of microvascular flow modeling has been done at different levels and scales mostly on simple tumor shapes with their capillaries. However, with our proposed numerical model, more complex and realistic tumor shapes and capillary networks can be studied. Both blood flow through a capillary network, which is induced by a solid tumor, and fluid flow in tumor’s surrounding tissue are formulated. First, governing equations of angiogenesis are implemented to specify the different domains for the network and interstitium. Then, governing equations for flow modeling are introduced for different domains. The conservation laws for mass and momentum (including continuity equation, Darcy’s law for tissue, and simplified Navier–Stokes equation for blood flow through capillaries) are used for simulating interstitial and intravascular flows and Starling’s law is used for closing this system of equations and coupling the intravascular and extravascular flows. This is the first study of flow modeling in solid tumors to naturalistically couple intravascular and extravascular flow through a network. This network is generated by sprouting angiogenesis and consisting of one parent vessel connected to the network while taking into account the non-continuous behavior of blood, adaptability of capillary diameter to hemodynamics and metabolic stimuli, non-Newtonian blood flow, and phase separation of blood flow in capillary bifurcation. The incorporation of the outlined components beyond the previous models provides a more realistic prediction of interstitial fluid flow pattern in solid tumors and surrounding tissues. Results predict higher interstitial pressure, almost two times, for realistic model compared to the simplified model. PMID:23840579

Micro/Nano-pore Network Analysis of Gas Flow in Shale Matrix

PubMed Central

Zhang, Pengwei; Hu, Liming; Meegoda, Jay N.; Gao, Shengyan

2015-01-01

The gas flow in shale matrix is of great research interests for optimized shale gas extraction. The gas flow in the nano-scale pore may fall in flow regimes such as viscous flow, slip flow and Knudsen diffusion. A 3-dimensional nano-scale pore network model was developed to simulate dynamic gas flow, and to describe the transient properties of flow regimes. The proposed pore network model accounts for the various size distributions and low connectivity of shale pores. The pore size, pore throat size and coordination number obey normal distribution, and the average values can be obtained from shale reservoir data. The gas flow regimes were simulated using an extracted pore network backbone. The numerical results show that apparent permeability is strongly dependent on pore pressure in the reservoir and pore throat size, which is overestimated by low-pressure laboratory tests. With the decrease of reservoir pressure, viscous flow is weakening, then slip flow and Knudsen diffusion are gradually becoming dominant flow regimes. The fingering phenomenon can be predicted by micro/nano-pore network for gas flow, which provides an effective way to capture heterogeneity of shale gas reservoir. PMID:26310236

Micro/Nano-pore Network Analysis of Gas Flow in Shale Matrix.

PubMed

Zhang, Pengwei; Hu, Liming; Meegoda, Jay N; Gao, Shengyan

2015-08-27

The gas flow in shale matrix is of great research interests for optimized shale gas extraction. The gas flow in the nano-scale pore may fall in flow regimes such as viscous flow, slip flow and Knudsen diffusion. A 3-dimensional nano-scale pore network model was developed to simulate dynamic gas flow, and to describe the transient properties of flow regimes. The proposed pore network model accounts for the various size distributions and low connectivity of shale pores. The pore size, pore throat size and coordination number obey normal distribution, and the average values can be obtained from shale reservoir data. The gas flow regimes were simulated using an extracted pore network backbone. The numerical results show that apparent permeability is strongly dependent on pore pressure in the reservoir and pore throat size, which is overestimated by low-pressure laboratory tests. With the decrease of reservoir pressure, viscous flow is weakening, then slip flow and Knudsen diffusion are gradually becoming dominant flow regimes. The fingering phenomenon can be predicted by micro/nano-pore network for gas flow, which provides an effective way to capture heterogeneity of shale gas reservoir.

A Green's function method for simulation of time-dependent solute transport and reaction in realistic microvascular geometries

PubMed Central

Secomb, Timothy W.

2016-01-01

A novel theoretical method is presented for simulating the spatially resolved convective and diffusive transport of reacting solutes between microvascular networks and the surrounding tissues. The method allows for efficient computational solution of problems involving convection and non-linear binding of solutes in blood flowing through microvascular networks with realistic 3D geometries, coupled with transvascular exchange and diffusion and reaction in the surrounding tissue space. The method is based on a Green's function approach, in which the solute concentration distribution in the tissue is expressed as a sum of fields generated by time-varying distributions of discrete sources and sinks. As an example of the application of the method, the washout of an inert diffusible tracer substance from a tissue region perfused by a network of microvessels is simulated, showing its dependence on the solute's transvascular permeability and tissue diffusivity. Exponential decay of the washout concentration is predicted, with rate constants that are about 10–30% lower than the rate constants for a tissue cylinder model with the same vessel length, vessel surface area and blood flow rate per tissue volume. PMID:26443811

Wise use of water in smart cities - possibilities and limitations

NASA Astrophysics Data System (ADS)

Bąk, Joanna

2018-02-01

The need to save water is due, inter alia, to the paradigm of sustainable development. There are many ways to minimize the consumption of high quality water supplied by the water supply network. These include the simplest way and those complex, requiring additional installation. The lack of water is a big problem, but not only water deficit are dangerous. There is a possibility of secondary water pollution in the water supply network due to changes in network parameters. Changes in these parameters may occur due to reduced demand for water by residents and, as a result, reduced water flow - at the same pipe diameter. The article includes a review with comparative analysis of various classification systems for the tap fittings and other sanitary equipment, such as the Water Efficiency Label (WELL) in Europe or the Water Efficiency Labelling and Standards (WELS) in Australia. Several types of perlators and flow regulators were compared in the research section. This equipment was tested in the household. The possibilities of minimizing water consumption by using them was collated. In addition, the work also analyses the evolution of water consumption in Poland in recent years and their possible relationship with the threats quality of drinking water supplied to consumers.

Modeling of Kidney Hemodynamics: Probability-Based Topology of an Arterial Network.

PubMed

Postnov, Dmitry D; Marsh, Donald J; Postnov, Dmitry E; Braunstein, Thomas H; Holstein-Rathlou, Niels-Henrik; Martens, Erik A; Sosnovtseva, Olga

2016-07-01

Through regulation of the extracellular fluid volume, the kidneys provide important long-term regulation of blood pressure. At the level of the individual functional unit (the nephron), pressure and flow control involves two different mechanisms that both produce oscillations. The nephrons are arranged in a complex branching structure that delivers blood to each nephron and, at the same time, provides a basis for an interaction between adjacent nephrons. The functional consequences of this interaction are not understood, and at present it is not possible to address this question experimentally. We provide experimental data and a new modeling approach to clarify this problem. To resolve details of microvascular structure, we collected 3D data from more than 150 afferent arterioles in an optically cleared rat kidney. Using these results together with published micro-computed tomography (μCT) data we develop an algorithm for generating the renal arterial network. We then introduce a mathematical model describing blood flow dynamics and nephron to nephron interaction in the network. The model includes an implementation of electrical signal propagation along a vascular wall. Simulation results show that the renal arterial architecture plays an important role in maintaining adequate pressure levels and the self-sustained dynamics of nephrons.

Information Transfer in the Brain: Insights from a Unified Approach

NASA Astrophysics Data System (ADS)

Marinazzo, Daniele; Wu, Guorong; Pellicoro, Mario; Stramaglia, Sebastiano

Measuring directed interactions in the brain in terms of information flow is a promising approach, mathematically treatable and amenable to encompass several methods. In this chapter we propose some approaches rooted in this framework for the analysis of neuroimaging data. First we will explore how the transfer of information depends on the network structure, showing how for hierarchical networks the information flow pattern is characterized by exponential distribution of the incoming information and a fat-tailed distribution of the outgoing information, as a signature of the law of diminishing marginal returns. This was reported to be true also for effective connectivity networks from human EEG data. Then we address the problem of partial conditioning to a limited subset of variables, chosen as the most informative ones for the driver node.We will then propose a formal expansion of the transfer entropy to put in evidence irreducible sets of variables which provide information for the future state of each assigned target. Multiplets characterized by a large contribution to the expansion are associated to informational circuits present in the system, with an informational character (synergetic or redundant) which can be associated to the sign of the contribution. Applications are reported for EEG and fMRI data.

Coarse-Grain Bandwidth Estimation Scheme for Large-Scale Network

NASA Technical Reports Server (NTRS)

Cheung, Kar-Ming; Jennings, Esther H.; Sergui, John S.

2013-01-01

A large-scale network that supports a large number of users can have an aggregate data rate of hundreds of Mbps at any time. High-fidelity simulation of a large-scale network might be too complicated and memory-intensive for typical commercial-off-the-shelf (COTS) tools. Unlike a large commercial wide-area-network (WAN) that shares diverse network resources among diverse users and has a complex topology that requires routing mechanism and flow control, the ground communication links of a space network operate under the assumption of a guaranteed dedicated bandwidth allocation between specific sparse endpoints in a star-like topology. This work solved the network design problem of estimating the bandwidths of a ground network architecture option that offer different service classes to meet the latency requirements of different user data types. In this work, a top-down analysis and simulation approach was created to size the bandwidths of a store-and-forward network for a given network topology, a mission traffic scenario, and a set of data types with different latency requirements. These techniques were used to estimate the WAN bandwidths of the ground links for different architecture options of the proposed Integrated Space Communication and Navigation (SCaN) Network. A new analytical approach, called the "leveling scheme," was developed to model the store-and-forward mechanism of the network data flow. The term "leveling" refers to the spreading of data across a longer time horizon without violating the corresponding latency requirement of the data type. Two versions of the leveling scheme were developed: 1. A straightforward version that simply spreads the data of each data type across the time horizon and doesn't take into account the interactions among data types within a pass, or between data types across overlapping passes at a network node, and is inherently sub-optimal. 2. Two-state Markov leveling scheme that takes into account the second order behavior of the store-and-forward mechanism, and the interactions among data types within a pass. The novelty of this approach lies in the modeling of the store-and-forward mechanism of each network node. The term store-and-forward refers to the data traffic regulation technique in which data is sent to an intermediate network node where they are temporarily stored and sent at a later time to the destination node or to another intermediate node. Store-and-forward can be applied to both space-based networks that have intermittent connectivity, and ground-based networks with deterministic connectivity. For groundbased networks, the store-and-forward mechanism is used to regulate the network data flow and link resource utilization such that the user data types can be delivered to their destination nodes without violating their respective latency requirements.

A new lumped-parameter model for flow in unsaturated dual-porosity media

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zimmerman, Robert W.; Hadgu, Teklu; Bodvarsson, Gudmundur S.

A new lumped-parameter approach to simulating unsaturated flow processes in dual-porosity media such as fractured rocks or aggregated soils is presented. Fluid flow between the fracture network and the matrix blocks is described by a non-linear equation that relates the imbibition rate to the local difference in liquid-phase pressure between the fractures and the matrix blocks. Unlike a Warren-Root-type equation, this equation is accurate in both the early and late time regimes. The fracture/matrix interflow equation has been incorporated into an existing unsaturated flow simulator, to serve as a source/sink term for fracture gridblocks. Flow processes are then simulated usingmore » only fracture gridblocks in the computational grid. This new lumped-parameter approach has been tested on two problems involving transient flow in fractured/porous media, and compared with simulations performed using explicit discretization of the matrix blocks. The new procedure seems to accurately simulate flow processes in unsaturated fractured rocks, and typically requires an order of magnitude less computational time than do simulations using fully-discretized matrix blocks. [References: 37]« less

Short paths in expander graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kleinberg, J.; Rubinfeld, R.

Graph expansion has proved to be a powerful general tool for analyzing the behavior of routing algorithms and the interconnection networks on which they run. We develop new routing algorithms and structural results for bounded-degree expander graphs. Our results are unified by the fact that they are all based upon, and extend, a body of work asserting that expanders are rich in short, disjoint paths. In particular, our work has consequences for the disjoint paths problem, multicommodify flow, and graph minor containment. We show: (i) A greedy algorithm for approximating the maximum disjoint paths problem achieves a polylogarithmic approximation ratiomore » in bounded-degree expanders. Although our algorithm is both deterministic and on-line, its performance guarantee is an improvement over previous bounds in expanders. (ii) For a multicommodily flow problem with arbitrary demands on a bounded-degree expander, there is a (1 + {epsilon})-optimal solution using only flow paths of polylogarithmic length. It follows that the multicommodity flow algorithm of Awerbuch and Leighton runs in nearly linear time per commodity in expanders. Our analysis is based on establishing the following: given edge weights on an expander G, one can increase some of the weights very slightly so the resulting shortest-path metric is smooth - the min-weight path between any pair of nodes uses a polylogarithmic number of edges. (iii) Every bounded-degree expander on n nodes contains every graph with O(n/log{sup O(1)} n) nodes and edges as a minor.« less

On understanding nuclear reaction network flows with branchings on directed graphs

NASA Astrophysics Data System (ADS)

Meyer, Bradley S.

2018-04-01

Nuclear reaction network flow diagrams are useful for understanding which reactions are governing the abundance changes at a particular time during nucleosynthesis. This is especially true when the flows are largely unidirectional, such as during the s-process of nucleosynthesis. In explosive nucleosynthesis, when reaction flows are large, and when forward reactions are nearly balanced by their reverses, reaction flows no longer give a clear picture of the abundance evolution in the network. This paper presents a way of understanding network evolution in terms of sums of branchings on a directed graph, which extends the concept of reaction flows to allow for multiple reaction pathways.

Non-invasive classification of gas-liquid two-phase horizontal flow regimes using an ultrasonic Doppler sensor and a neural network

NASA Astrophysics Data System (ADS)

Musa Abbagoni, Baba; Yeung, Hoi

2016-08-01

The identification of flow pattern is a key issue in multiphase flow which is encountered in the petrochemical industry. It is difficult to identify the gas-liquid flow regimes objectively with the gas-liquid two-phase flow. This paper presents the feasibility of a clamp-on instrument for an objective flow regime classification of two-phase flow using an ultrasonic Doppler sensor and an artificial neural network, which records and processes the ultrasonic signals reflected from the two-phase flow. Experimental data is obtained on a horizontal test rig with a total pipe length of 21 m and 5.08 cm internal diameter carrying air-water two-phase flow under slug, elongated bubble, stratified-wavy and, stratified flow regimes. Multilayer perceptron neural networks (MLPNNs) are used to develop the classification model. The classifier requires features as an input which is representative of the signals. Ultrasound signal features are extracted by applying both power spectral density (PSD) and discrete wavelet transform (DWT) methods to the flow signals. A classification scheme of ‘1-of-C coding method for classification’ was adopted to classify features extracted into one of four flow regime categories. To improve the performance of the flow regime classifier network, a second level neural network was incorporated by using the output of a first level networks feature as an input feature. The addition of the two network models provided a combined neural network model which has achieved a higher accuracy than single neural network models. Classification accuracies are evaluated in the form of both the PSD and DWT features. The success rates of the two models are: (1) using PSD features, the classifier missed 3 datasets out of 24 test datasets of the classification and scored 87.5% accuracy; (2) with the DWT features, the network misclassified only one data point and it was able to classify the flow patterns up to 95.8% accuracy. This approach has demonstrated the success of a clamp-on ultrasound sensor for flow regime classification that would be possible in industry practice. It is considerably more promising than other techniques as it uses a non-invasive and non-radioactive sensor.

Role of Unchannelized Flow in Determining Bifurcation Angle in Distributary Channel Networks

NASA Astrophysics Data System (ADS)

Coffey, T.

2016-12-01

Distributary channel bifurcations on river deltas are important features in both modern systems, where the channels control water, sediment, and nutrient routing, and in ancient deltas, where the channel networks can dictate large-scale stratigraphic heterogeneity. Geometric features of distributary channels, such as channel dimensions and network structure, have long been thought to be defined by factors such as flow velocity, grain size, or channel aspect ratio where the channel enters the basin. We use theory originally developed for tributary networks fed by groundwater seepage to understand the dynamics of distributary channel bifurcations. Interestingly, bifurcations in groundwater-fed tributary networks have been shown to evolve dependent on the diffusive flow patterns around the channel network. These networks possess a characteristic bifurcation angle of 72°, due to Laplacian flow (gradient2h2=0, where h is water surface elevation) in the groundwater flow field near tributary channel tips. We develop and test the hypothesis that bifurcation angles in distributary channel networks are likewise dictated by the external flow field, in this case the shallow surface water surrounding the subaqueous portion of distributary channel bifurcations in a deltaic setting. We measured 130 unique distributary channel bifurcations in a single experimental delta and in 10 natural deltas, yielding a mean angle of 70.35°±2.59° (95% confidence interval), in line with the theoretical prediction. This similarity implies that flow outside of the distributary channel network is also Laplacian, which we use scaling arguments to justify. We conclude that the dynamics of the unchannelized flow control bifurcation formation in distributary networks.

Integrated risk/cost planning models for the US Air Traffic system

NASA Technical Reports Server (NTRS)

Mulvey, J. M.; Zenios, S. A.

1985-01-01

A prototype network planning model for the U.S. Air Traffic control system is described. The model encompasses the dual objectives of managing collision risks and transportation costs where traffic flows can be related to these objectives. The underlying structure is a network graph with nonseparable convex costs; the model is solved efficiently by capitalizing on its intrinsic characteristics. Two specialized algorithms for solving the resulting problems are described: (1) truncated Newton, and (2) simplicial decomposition. The feasibility of the approach is demonstrated using data collected from a control center in the Midwest. Computational results with different computer systems are presented, including a vector supercomputer (CRAY-XMP). The risk/cost model has two primary uses: (1) as a strategic planning tool using aggregate flight information, and (2) as an integrated operational system for forecasting congestion and monitoring (controlling) flow throughout the U.S. In the latter case, access to a supercomputer is required due to the model's enormous size.

A Network Flow Approach to the Initial Skills Training Scheduling Problem

DTIC Science & Technology

2007-12-01

include (but are not limited to) queuing theory, stochastic analysis and simulation. After the demand schedule has been estimated, it can be ...software package has already been purchased and is in use by AFPC, AFPC has requested that the new algorithm be programmed in this language as well ...the discussed outputs from those schedules. Required Inputs A single input file details the students to be scheduled as well as the courses

Numerical Simulation of Sickle Cell Blood Flow in the Microcirculation

NASA Astrophysics Data System (ADS)

Berger, Stanley A.; Carlson, Brian E.

2001-11-01

A numerical simulation of normal and sickle cell blood flow through the transverse arteriole-capillary microcirculation is carried out to model the dominant mechanisms involved in the onset of vascular stasis in sickle cell disease. The transverse arteriole-capillary network is described by Strahler's network branching method, and the oxygen and blood transport in the capillaries is modeled by a Krogh cylinder analysis utilizing Lighthill's lubrication theory, as developed by Berger and King. Poiseuille's law is used to represent blood flow in the arterioles. Applying this flow and transport model and utilizing volumetric flow continuity at each network bifurcation, a nonlinear system of equations is obtained, which is solved iteratively using a steepest descent algorithm coupled with a Newton solver. Ten different networks are generated and flow results are calculated for normal blood and sickle cell blood without and with precapillary oxygen loss. We find that total volumetric blood flow through the network is greater in the two sickle cell blood simulations than for normal blood owing to the anemia associated with sickle cell disease. The percentage of capillary blockage in the network increases dramatically with decreasing pressure drop across the network in the sickle cell cases while there is no blockage when normal blood flows through simulated networks. It is concluded that, in sickle cell disease, without any vasomotor dilation response to decreasing oxygen concentrations in the blood, capillary blockage will occur in the microvasculature even at average pressure drops across the transverse arteriole-capillary networks.

Damage Response in Fluid Flow Networks

NASA Astrophysics Data System (ADS)

Gavrilchenko, Tatyana; Katifori, Eleni

The networks found in biological fluid flow systems such as leaf venation and animal vasculature are characterized by hierarchically nested loops. This structure allows the system to be resilient against fluctuations in the flow of fluid and to be robust against damage. We analytically and computationally investigate how this loopy hierarchy determines the extent of disruption in fluid flow in the vicinity of a damage site. Perturbing the network with the removal of a single edge results in the differential flow as a function of distance from the perturbation decaying as a power law. The power law exponent is generally around -2 in 2D, but we find that it varies due to edge effects, initial edge conductivity, and local topology. We expect that these network flow findings, directly applicable to plant and animal veins, will have analogues in electrical grids, traffic flow and other transport networks.

Building SDN-Based Agricultural Vehicular Sensor Networks Based on Extended Open vSwitch.

PubMed

Huang, Tao; Yan, Siyu; Yang, Fan; Pan, Tian; Liu, Jiang

2016-01-19

Software-defined vehicular sensor networks in agriculture, such as autonomous vehicle navigation based on wireless multi-sensor networks, can lead to more efficient precision agriculture. In SDN-based vehicle sensor networks, the data plane is simplified and becomes more efficient by introducing a centralized controller. However, in a wireless environment, the main controller node may leave the sensor network due to the dynamic topology change or the unstable wireless signal, leaving the rest of network devices without control, e.g., a sensor node as a switch may forward packets according to stale rules until the controller updates the flow table entries. To solve this problem, this paper proposes a novel SDN-based vehicular sensor networks architecture which can minimize the performance penalty of controller connection loss. We achieve this by designing a connection state detection and self-learning mechanism. We build prototypes based on extended Open vSwitch and Ryu. The experimental results show that the recovery time from controller connection loss is under 100 ms and it keeps rule updating in real time with a stable throughput. This architecture enhances the survivability and stability of SDN-based vehicular sensor networks in precision agriculture.

Building SDN-Based Agricultural Vehicular Sensor Networks Based on Extended Open vSwitch

PubMed Central

Huang, Tao; Yan, Siyu; Yang, Fan; Pan, Tian; Liu, Jiang

2016-01-01

Software-defined vehicular sensor networks in agriculture, such as autonomous vehicle navigation based on wireless multi-sensor networks, can lead to more efficient precision agriculture. In SDN-based vehicle sensor networks, the data plane is simplified and becomes more efficient by introducing a centralized controller. However, in a wireless environment, the main controller node may leave the sensor network due to the dynamic topology change or the unstable wireless signal, leaving the rest of network devices without control, e.g., a sensor node as a switch may forward packets according to stale rules until the controller updates the flow table entries. To solve this problem, this paper proposes a novel SDN-based vehicular sensor networks architecture which can minimize the performance penalty of controller connection loss. We achieve this by designing a connection state detection and self-learning mechanism. We build prototypes based on extended Open vSwitch and Ryu. The experimental results show that the recovery time from controller connection loss is under 100 ms and it keeps rule updating in real time with a stable throughput. This architecture enhances the survivability and stability of SDN-based vehicular sensor networks in precision agriculture. PMID:26797616

SAFSIM theory manual: A computer program for the engineering simulation of flow systems

NASA Astrophysics Data System (ADS)

Dobranich, Dean

1993-12-01

SAFSIM (System Analysis Flow SIMulator) is a FORTRAN computer program for simulating the integrated performance of complex flow systems. SAFSIM provides sufficient versatility to allow the engineering simulation of almost any system, from a backyard sprinkler system to a clustered nuclear reactor propulsion system. In addition to versatility, speed and robustness are primary SAFSIM development goals. SAFSIM contains three basic physics modules: (1) a fluid mechanics module with flow network capability; (2) a structure heat transfer module with multiple convection and radiation exchange surface capability; and (3) a point reactor dynamics module with reactivity feedback and decay heat capability. Any or all of the physics modules can be implemented, as the problem dictates. SAFSIM can be used for compressible and incompressible, single-phase, multicomponent flow systems. Both the fluid mechanics and structure heat transfer modules employ a one-dimensional finite element modeling approach. This document contains a description of the theory incorporated in SAFSIM, including the governing equations, the numerical methods, and the overall system solution strategies.

Reference hydrologic networks I. The status and potential future directions of national reference hydrologic networks for detecting trends

USGS Publications Warehouse

Whitfield, Paul H.; Burn, Donald H.; Hannaford, Jamie; Higgins, Hélène; Hodgkins, Glenn A.; Marsh, Terry; Looser, Ulrich

2012-01-01

Identifying climate-driven trends in river flows on a global basis is hampered by a lack of long, quality time series data for rivers with relatively undisturbed regimes. This is a global problem compounded by the lack of support for essential long-term monitoring. Experience demonstrates that, with clear strategic objectives, and the support of sponsoring organizations, reference hydrologic networks can constitute an exceptionally valuable data source to effectively identify, quantify and interpret hydrological change—the speed and magnitude of which is expected to a be a primary driver of water management and flood alleviation strategies through the future—and for additional applications. Reference hydrologic networks have been developed in many countries in the past few decades. These collections of streamflow gauging stations, that are maintained and operated with the intention of observing how the hydrology of watersheds responds to variations in climate, are described. The status of networks under development is summarized. We suggest a plan of actions to make more effective use of this collection of networks.

Multi-agent coordination algorithms for control of distributed energy resources in smart grids

NASA Astrophysics Data System (ADS)

Cortes, Andres

Sustainable energy is a top-priority for researchers these days, since electricity and transportation are pillars of modern society. Integration of clean energy technologies such as wind, solar, and plug-in electric vehicles (PEVs), is a major engineering challenge in operation and management of power systems. This is due to the uncertain nature of renewable energy technologies and the large amount of extra load that PEVs would add to the power grid. Given the networked structure of a power system, multi-agent control and optimization strategies are natural approaches to address the various problems of interest for the safe and reliable operation of the power grid. The distributed computation in multi-agent algorithms addresses three problems at the same time: i) it allows for the handling of problems with millions of variables that a single processor cannot compute, ii) it allows certain independence and privacy to electricity customers by not requiring any usage information, and iii) it is robust to localized failures in the communication network, being able to solve problems by simply neglecting the failing section of the system. We propose various algorithms to coordinate storage, generation, and demand resources in a power grid using multi-agent computation and decentralized decision making. First, we introduce a hierarchical vehicle-one-grid (V1G) algorithm for coordination of PEVs under usage constraints, where energy only flows from the grid in to the batteries of PEVs. We then present a hierarchical vehicle-to-grid (V2G) algorithm for PEV coordination that takes into consideration line capacity constraints in the distribution grid, and where energy flows both ways, from the grid in to the batteries, and from the batteries to the grid. Next, we develop a greedy-like hierarchical algorithm for management of demand response events with on/off loads. Finally, we introduce distributed algorithms for the optimal control of distributed energy resources, i.e., generation and storage in a microgrid. The algorithms we present are provably correct and tested in simulation. Each algorithm is assumed to work on a particular network topology, and simulation studies are carried out in order to demonstrate their convergence properties to a desired solution.

Dynamic mobility applications policy analysis : policy and institutional issues for intelligent network flow optimization (INFLO).

DOT National Transportation Integrated Search

2014-12-01

The report documents policy considerations for the Intelligent Network Flow Optimization (INFLO) connected vehicle applications bundle. INFLO aims to optimize network flow on freeways and arterials by informing motorists of existing and impendi...

Network analysis of patient flow in two UK acute care hospitals identifies key sub-networks for A&E performance

PubMed Central

Stringer, Clive; Beeknoo, Neeraj

2017-01-01

The topology of the patient flow network in a hospital is complex, comprising hundreds of overlapping patient journeys, and is a determinant of operational efficiency. To understand the network architecture of patient flow, we performed a data-driven network analysis of patient flow through two acute hospital sites of King’s College Hospital NHS Foundation Trust. Administration databases were queried for all intra-hospital patient transfers in an 18-month period and modelled as a dynamic weighted directed graph. A ‘core’ subnetwork containing only 13–17% of all edges channelled 83–90% of the patient flow, while an ‘ephemeral’ network constituted the remainder. Unsupervised cluster analysis and differential network analysis identified sub-networks where traffic is most associated with A&E performance. Increased flow to clinical decision units was associated with the best A&E performance in both sites. The component analysis also detected a weekend effect on patient transfers which was not associated with performance. We have performed the first data-driven hypothesis-free analysis of patient flow which can enhance understanding of whole healthcare systems. Such analysis can drive transformation in healthcare as it has in industries such as manufacturing. PMID:28968472

Accuracy of 1D microvascular flow models in the limit of low Reynolds numbers.

PubMed

Pindera, Maciej Z; Ding, Hui; Athavale, Mahesh M; Chen, Zhijian

2009-05-01

We describe results of numerical simulations of steady flows in tubes with branch bifurcations using fully 3D and reduced 1D geometries. The intent is to delineate the range of validity of reduced models used for simulations of flows in microcapillary networks, as a function of the flow Reynolds number Re. Results from model problems indicate that for Re less than 1 and possibly as high as 10, vasculatures may be represented by strictly 1D Poiseuille flow geometries with flow variation in the axial dimensions only. In that range flow rate predictions in the different branches generated by 1D and 3D models differ by a constant factor, independent of Re. When the cross-sectional areas of the branches are constant these differences are generally small and appear to stem from an uncertainty of how the individual branch lengths are defined. This uncertainty can be accounted for by a simple geometrical correction. For non-constant cross-sections the differences can be much more significant. If additional corrections for the presence of branch junctions and flow area variations are not taken into account in 1D models of complex vasculatures, the resultant flow predictions should be interpreted with caution.

Effective contaminant detection networks in uncertain groundwater flow fields.

PubMed

Hudak, P F

2001-01-01

A mass transport simulation model tested seven contaminant detection-monitoring networks under a 40 degrees range of groundwater flow directions. Each monitoring network contained five wells located 40 m from a rectangular landfill. The 40-m distance (lag) was measured in different directions, depending upon the strategy used to design a particular monitoring network. Lagging the wells parallel to the central flow path was more effective than alternative design strategies. Other strategies allowed higher percentages of leaks to migrate between monitoring wells. Results of this study suggest that centrally lagged groundwater monitoring networks perform most effectively in uncertain groundwater-flow fields.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Chase

A number of Department of Energy (DOE) science applications, involving exascale computing systems and large experimental facilities, are expected to generate large volumes of data, in the range of petabytes to exabytes, which will be transported over wide-area networks for the purpose of storage, visualization, and analysis. The objectives of this proposal are to (1) develop and test the component technologies and their synthesis methods to achieve source-to-sink high-performance flows, and (2) develop tools that provide these capabilities through simple interfaces to users and applications. In terms of the former, we propose to develop (1) optimization methods that align andmore » transition multiple storage flows to multiple network flows on multicore, multibus hosts; and (2) edge and long-haul network path realization and maintenance using advanced provisioning methods including OSCARS and OpenFlow. We also propose synthesis methods that combine these individual technologies to compose high-performance flows using a collection of constituent storage-network flows, and realize them across the storage and local network connections as well as long-haul connections. We propose to develop automated user tools that profile the hosts, storage systems, and network connections; compose the source-to-sink complex flows; and set up and maintain the needed network connections.« less

A parallel interaction potential approach coupled with the immersed boundary method for fully resolved simulations of deformable interfaces and membranes

NASA Astrophysics Data System (ADS)

Spandan, Vamsi; Meschini, Valentina; Ostilla-Mónico, Rodolfo; Lohse, Detlef; Querzoli, Giorgio; de Tullio, Marco D.; Verzicco, Roberto

2017-11-01

In this paper we show and discuss how the deformation dynamics of closed liquid-liquid interfaces (for example drops and bubbles) can be replicated with use of a phenomenological interaction potential model. This new approach to simulate liquid-liquid interfaces is based on the fundamental principle of minimum potential energy where the total potential energy depends on the extent of deformation of a spring network distributed on the surface of the immersed drop or bubble. Simulating liquid-liquid interfaces using this model require computing ad-hoc elastic constants which is done through a reverse-engineered approach. The results from our simulations agree very well with previous studies on the deformation of drops in standard flow configurations such as a deforming drop in a shear flow or cross flow. The interaction potential model is highly versatile, computationally efficient and can be easily incorporated into generic single phase fluid solvers to also simulate complex fluid-structure interaction problems. This is shown by simulating flow in the left ventricle of the heart with mechanical and natural mitral valves where the imposed flow, motion of ventricle and valves dynamically govern the behaviour of each other. Results from these simulations are compared with ad-hoc in-house experimental measurements. Finally, we present a simple and easy to implement parallelisation scheme, as high performance computing is unavoidable when studying large scale problems involving several thousands of simultaneously deforming bodies in highly turbulent flows.

An Amorphous Network Model for Capillary Flow and Dispersion in a Partially Saturated Porous Medium

NASA Astrophysics Data System (ADS)

Simmons, C. S.; Rockhold, M. L.

2013-12-01

Network models of capillary flow are commonly used to represent conduction of fluids at pore scales. Typically, a flow system is described by a regular geometric lattice of interconnected tubes. Tubes constitute the pore throats, while connection junctions (nodes) are pore bodies. Such conceptualization of the geometry, however, is questionable for the pore scale, where irregularity clearly prevails, although prior published models using a regular lattice have demonstrated successful descriptions of the flow in the bulk medium. Here a network is allowed to be amorphous, and is not subject to any particular lattice structure. Few network flow models have treated partially saturated or even multiphase conditions. The research trend is toward using capillary tubes with triangular or square cross sections that have corners and always retain some fluid by capillarity when drained. In contrast, this model uses only circular capillaries, whose filled state is controlled by a capillary pressure rule for the junctions. The rule determines which capillary participate in the flow under an imposed matric potential gradient during steady flow conditions. Poiseuille's Law and Laplace equation are used to describe flow and water retention in the capillary units of the model. A modified conjugate gradient solution for steady flow that tracks which capillary in an amorphous network contribute to fluid conduction was devised for partially saturated conditions. The model thus retains the features of classical capillary models for determining hydraulic flow properties under unsaturated conditions based on distribution of non-interacting tubes, but now accounts for flow exchange at junctions. Continuity of the flow balance at every junction is solved simultaneously. The effective water retention relationship and unsaturated permeability are evaluated for an extensive enough network to represent a small bulk sample of porous medium. The model is applied for both a hypothetically randomly generate network and for a directly measured porous medium structure, by means of xray-CT scan. A randomly generated network has the benefit of providing ensemble averages for sample replicates of a medium's properties, whereas network structure measurements are expected to be more predictive. Dispersion of solute in a network flow is calculate by using particle tracking to determine the travel time breakthrough between inflow and outflow boundaries. The travel time distribution can exhibit substantial skewness that reflects both network velocity variability and mixing dilution at junctions. When local diffusion is not included, and transport is strictly advective, then the skew breakthrough is not due to mobile-immobile flow region behavior. The approach of dispersivity to its asymptotic value with sample size is examined, and may be only an indicator of particular stochastic flow variation. It is not proven that a simplified network flow model can accurately predict the hydraulic properties of a sufficiently large-size medium sample, but such a model can at least demonstrate macroscopic flow resulting from the interaction of physical processes at pore scales.

Spatio-temporal organization of dynamics in a two-dimensional periodically driven vortex flow: A Lagrangian flow network perspective.

PubMed

Lindner, Michael; Donner, Reik V

2017-03-01

We study the Lagrangian dynamics of passive tracers in a simple model of a driven two-dimensional vortex resembling real-world geophysical flow patterns. Using a discrete approximation of the system's transfer operator, we construct a directed network that describes the exchange of mass between distinct regions of the flow domain. By studying different measures characterizing flow network connectivity at different time-scales, we are able to identify the location of dynamically invariant structures and regions of maximum dispersion. Specifically, our approach allows us to delimit co-existing flow regimes with different dynamics. To validate our findings, we compare several network characteristics to the well-established finite-time Lyapunov exponents and apply a receiver operating characteristic analysis to identify network measures that are particularly useful for unveiling the skeleton of Lagrangian chaos.

A variational approach to probing extreme events in turbulent dynamical systems

PubMed Central

Farazmand, Mohammad; Sapsis, Themistoklis P.

2017-01-01

Extreme events are ubiquitous in a wide range of dynamical systems, including turbulent fluid flows, nonlinear waves, large-scale networks, and biological systems. We propose a variational framework for probing conditions that trigger intermittent extreme events in high-dimensional nonlinear dynamical systems. We seek the triggers as the probabilistically feasible solutions of an appropriately constrained optimization problem, where the function to be maximized is a system observable exhibiting intermittent extreme bursts. The constraints are imposed to ensure the physical admissibility of the optimal solutions, that is, significant probability for their occurrence under the natural flow of the dynamical system. We apply the method to a body-forced incompressible Navier-Stokes equation, known as the Kolmogorov flow. We find that the intermittent bursts of the energy dissipation are independent of the external forcing and are instead caused by the spontaneous transfer of energy from large scales to the mean flow via nonlinear triad interactions. The global maximizer of the corresponding variational problem identifies the responsible triad, hence providing a precursor for the occurrence of extreme dissipation events. Specifically, monitoring the energy transfers within this triad allows us to develop a data-driven short-term predictor for the intermittent bursts of energy dissipation. We assess the performance of this predictor through direct numerical simulations. PMID:28948226

Social Insects: A Model System for Network Dynamics

NASA Astrophysics Data System (ADS)

Charbonneau, Daniel; Blonder, Benjamin; Dornhaus, Anna

Social insect colonies (ants, bees, wasps, and termites) show sophisticated collective problem-solving in the face of variable constraints. Individuals exchange information and materials such as food. The resulting network structure and dynamics can inform us about the mechanisms by which the insects achieve particular collective behaviors and these can be transposed to man-made and social networks. We discuss how network analysis can answer important questions about social insects, such as how effective task allocation or information flow is realized. We put forward the idea that network analysis methods are under-utilized in social insect research, and that they can provide novel ways to view the complexity of collective behavior, particularly if network dynamics are taken into account. To illustrate this, we present an example of network tasks performed by ant workers, linked by instances of workers switching from one task to another. We show how temporal network analysis can propose and test new hypotheses on mechanisms of task allocation, and how adding temporal elements to static networks can drastically change results. We discuss the benefits of using social insects as models for complex systems in general. There are multiple opportunities emergent technologies and analysis methods in facilitating research on social insect network. The potential for interdisciplinary work could significantly advance diverse fields such as behavioral ecology, computer sciences, and engineering.

Optimal coordinated voltage control in active distribution networks using backtracking search algorithm

PubMed Central

Tengku Hashim, Tengku Juhana; Mohamed, Azah

2017-01-01

The growing interest in distributed generation (DG) in recent years has led to a number of generators connected to a distribution system. The integration of DGs in a distribution system has resulted in a network known as active distribution network due to the existence of bidirectional power flow in the system. Voltage rise issue is one of the predominantly important technical issues to be addressed when DGs exist in an active distribution network. This paper presents the application of the backtracking search algorithm (BSA), which is relatively new optimisation technique to determine the optimal settings of coordinated voltage control in a distribution system. The coordinated voltage control considers power factor, on-load tap-changer and generation curtailment control to manage voltage rise issue. A multi-objective function is formulated to minimise total losses and voltage deviation in a distribution system. The proposed BSA is compared with that of particle swarm optimisation (PSO) so as to evaluate its effectiveness in determining the optimal settings of power factor, tap-changer and percentage active power generation to be curtailed. The load flow algorithm from MATPOWER is integrated in the MATLAB environment to solve the multi-objective optimisation problem. Both the BSA and PSO optimisation techniques have been tested on a radial 13-bus distribution system and the results show that the BSA performs better than PSO by providing better fitness value and convergence rate. PMID:28991919

Optimal coordinated voltage control in active distribution networks using backtracking search algorithm.

PubMed

Tengku Hashim, Tengku Juhana; Mohamed, Azah

2017-01-01

The growing interest in distributed generation (DG) in recent years has led to a number of generators connected to a distribution system. The integration of DGs in a distribution system has resulted in a network known as active distribution network due to the existence of bidirectional power flow in the system. Voltage rise issue is one of the predominantly important technical issues to be addressed when DGs exist in an active distribution network. This paper presents the application of the backtracking search algorithm (BSA), which is relatively new optimisation technique to determine the optimal settings of coordinated voltage control in a distribution system. The coordinated voltage control considers power factor, on-load tap-changer and generation curtailment control to manage voltage rise issue. A multi-objective function is formulated to minimise total losses and voltage deviation in a distribution system. The proposed BSA is compared with that of particle swarm optimisation (PSO) so as to evaluate its effectiveness in determining the optimal settings of power factor, tap-changer and percentage active power generation to be curtailed. The load flow algorithm from MATPOWER is integrated in the MATLAB environment to solve the multi-objective optimisation problem. Both the BSA and PSO optimisation techniques have been tested on a radial 13-bus distribution system and the results show that the BSA performs better than PSO by providing better fitness value and convergence rate.

Interest communities and flow roles in directed networks: the Twitter network of the UK riots

PubMed Central

Beguerisse-Díaz, Mariano; Garduño-Hernández, Guillermo; Vangelov, Borislav; Yaliraki, Sophia N.; Barahona, Mauricio

2014-01-01

Directionality is a crucial ingredient in many complex networks in which information, energy or influence are transmitted. In such directed networks, analysing flows (and not only the strength of connections) is crucial to reveal important features of the network that might go undetected if the orientation of connections is ignored. We showcase here a flow-based approach for community detection through the study of the network of the most influential Twitter users during the 2011 riots in England. Firstly, we use directed Markov Stability to extract descriptions of the network at different levels of coarseness in terms of interest communities, i.e. groups of nodes within which flows of information are contained and reinforced. Such interest communities reveal user groupings according to location, profession, employer and topic. The study of flows also allows us to generate an interest distance, which affords a personalized view of the attention in the network as viewed from the vantage point of any given user. Secondly, we analyse the profiles of incoming and outgoing long-range flows with a combined approach of role-based similarity and the novel relaxed minimum spanning tree algorithm to reveal that the users in the network can be classified into five roles. These flow roles go beyond the standard leader/follower dichotomy and differ from classifications based on regular/structural equivalence. We then show that the interest communities fall into distinct informational organigrams characterized by a different mix of user roles reflecting the quality of dialogue within them. Our generic framework can be used to provide insight into how flows are generated, distributed, preserved and consumed in directed networks. PMID:25297320

Hybrid network modeling and the effect of image resolution on digitally-obtained petrophysical and two-phase flow properties

NASA Astrophysics Data System (ADS)

Aghaei, A.

2017-12-01

Digital imaging and modeling of rocks and subsequent simulation of physical phenomena in digitally-constructed rock models are becoming an integral part of core analysis workflows. One of the inherent limitations of image-based analysis, at any given scale, is image resolution. This limitation becomes more evident when the rock has multiple scales of porosity such as in carbonates and tight sandstones. Multi-scale imaging and constructions of hybrid models that encompass images acquired at multiple scales and resolutions are proposed as a solution to this problem. In this study, we investigate the effect of image resolution and unresolved porosity on petrophysical and two-phase flow properties calculated based on images. A helical X-ray micro-CT scanner with a high cone-angle is used to acquire digital rock images that are free of geometric distortion. To remove subjectivity from the analyses, a semi-automated image processing technique is used to process and segment the acquired data into multiple phases. Direct and pore network based models are used to simulate physical phenomena and obtain absolute permeability, formation factor and two-phase flow properties such as relative permeability and capillary pressure. The effect of image resolution on each property is investigated. Finally a hybrid network model incorporating images at multiple resolutions is built and used for simulations. The results from the hybrid model are compared against results from the model built at the highest resolution and those from laboratory tests.

Optimal Power Flow Pursuit

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall'Anese, Emiliano; Simonetto, Andrea

This paper considers distribution networks featuring inverter-interfaced distributed energy resources, and develops distributed feedback controllers that continuously drive the inverter output powers to solutions of AC optimal power flow (OPF) problems. Particularly, the controllers update the power setpoints based on voltage measurements as well as given (time-varying) OPF targets, and entail elementary operations implementable onto low-cost microcontrollers that accompany power-electronics interfaces of gateways and inverters. The design of the control framework is based on suitable linear approximations of the AC power-flow equations as well as Lagrangian regularization methods. Convergence and OPF-target tracking capabilities of the controllers are analytically established. Overall,more » the proposed method allows to bypass traditional hierarchical setups where feedback control and optimization operate at distinct time scales, and to enable real-time optimization of distribution systems.« less

Cubic law with aperture-length correlation: implications for network scale fluid flow

NASA Astrophysics Data System (ADS)

Klimczak, Christian; Schultz, Richard A.; Parashar, Rishi; Reeves, Donald M.

2010-06-01

Previous studies have computed and modeled fluid flow through fractured rock with the parallel plate approach where the volumetric flow per unit width normal to the direction of flow is proportional to the cubed aperture between the plates, referred to as the traditional cubic law. When combined with the square root relationship of displacement to length scaling of opening-mode fractures, total flow rates through natural opening-mode fractures are found to be proportional to apertures to the fifth power. This new relationship was explored by examining a suite of flow simulations through fracture networks using the discrete fracture network model (DFN). Flow was modeled through fracture networks with the same spatial distribution of fractures for both correlated and uncorrelated fracture length-to-aperture relationships. Results indicate that flow rates are significantly higher for correlated DFNs. Furthermore, the length-to-aperture relations lead to power-law distributions of network hydraulic conductivity which greatly influence equivalent permeability tensor values. These results confirm the importance of the correlated square root relationship of displacement to length scaling for total flow through natural opening-mode fractures and, hence, emphasize the role of these correlations for flow modeling.

An investigation into preserving spatially-distinct pore systems in multi-component rocks using a fossiliferous limestone example

NASA Astrophysics Data System (ADS)

Jiang, Zeyun; Couples, Gary D.; Lewis, Helen; Mangione, Alessandro

2018-07-01

Limestones containing abundant disc-shaped fossil Nummulites can form significant hydrocarbon reservoirs but they have a distinctly heterogeneous distribution of pore shapes, sizes and connectivities, which make it particularly difficult to calculate petrophysical properties and consequent flow outcomes. The severity of the problem rests on the wide length-scale range from the millimetre scale of the fossil's pore space to the micron scale of rock matrix pores. This work develops a technique to incorporate multi-scale void systems into a pore network, which is used to calculate the petrophysical properties for subsequent flow simulations at different stages in the limestone's petrophysical evolution. While rock pore size, shape and connectivity can be determined, with varying levels of fidelity, using techniques such as X-ray computed tomography (CT) or scanning electron microscopy (SEM), this work represents a more challenging class where the rock of interest is insufficiently sampled or, as here, has been overprinted by extensive chemical diagenesis. The main challenge is integrating multi-scale void structures derived from both SEM and CT images, into a single model or a pore-scale network while still honouring the nature of the connections across these length scales. Pore network flow simulations are used to illustrate the technique but of equal importance, to demonstrate how supportable earlier-stage petrophysical property distributions can be used to assess the viability of several potential geological event sequences. The results of our flow simulations on generated models highlight the requirement for correct determination of the dominant pore scales (one plus of nm, μm, mm, cm), the spatial correlation and the cross-scale connections.

Exploring a QoS Driven Scheduling Approach for Peer-to-Peer Live Streaming Systems with Network Coding

PubMed Central

Cui, Laizhong; Lu, Nan; Chen, Fu

2014-01-01

Most large-scale peer-to-peer (P2P) live streaming systems use mesh to organize peers and leverage pull scheduling to transmit packets for providing robustness in dynamic environment. The pull scheduling brings large packet delay. Network coding makes the push scheduling feasible in mesh P2P live streaming and improves the efficiency. However, it may also introduce some extra delays and coding computational overhead. To improve the packet delay, streaming quality, and coding overhead, in this paper are as follows. we propose a QoS driven push scheduling approach. The main contributions of this paper are: (i) We introduce a new network coding method to increase the content diversity and reduce the complexity of scheduling; (ii) we formulate the push scheduling as an optimization problem and transform it to a min-cost flow problem for solving it in polynomial time; (iii) we propose a push scheduling algorithm to reduce the coding overhead and do extensive experiments to validate the effectiveness of our approach. Compared with previous approaches, the simulation results demonstrate that packet delay, continuity index, and coding ratio of our system can be significantly improved, especially in dynamic environments. PMID:25114968

Congestion and flow control in signaling system no. 7: Impacts of intelligent networks and new services

NASA Astrophysics Data System (ADS)

Zepf, Joachim; Rufa, Gerhard

1994-04-01

This paper focuses on the transient performance analysis of the congestion and flow control mechanisms in CCITT Signaling System No. 7 (SS7). Special attention is directed to the impacts of the introduction of intelligent services and new applications, e.g., Freephone, credit card services, user-to-user signaling, etc. In particular, we show that signaling traffic characteristics like signaling scenarios or signaling message length as well as end-to-end signaling capabilities have a significant influence on the congestion and flow control and, therefore, on the real-time signaling performance. One important result of our performance studies is that if, e.g., intelligent services are introduced, the SS7 congestion and flow control does not work correctly. To solve this problem, some reinvestigations into these mechanisms would be necessary. Therefore, some approaches, e.g., modification of the Signaling Connection Control Part (SCCP) congestion control, usage of the SCCP relay function, or a redesign of the MTP flow control procedures are discussed in order to guarantee the efficacy of the congestion and flow control mechanisms also in the future.

Application of Artificial Neural Network to Optical Fluid Analyzer

NASA Astrophysics Data System (ADS)

Kimura, Makoto; Nishida, Katsuhiko

1994-04-01

A three-layer artificial neural network has been applied to the presentation of optical fluid analyzer (OFA) raw data, and the accuracy of oil fraction determination has been significantly improved compared to previous approaches. To apply the artificial neural network approach to solving a problem, the first step is training to determine the appropriate weight set for calculating the target values. This involves using a series of data sets (each comprising a set of input values and an associated set of output values that the artificial neural network is required to determine) to tune artificial neural network weighting parameters so that the output of the neural network to the given set of input values is as close as possible to the required output. The physical model used to generate the series of learning data sets was the effective flow stream model, developed for OFA data presentation. The effectiveness of the training was verified by reprocessing the same input data as were used to determine the weighting parameters and then by comparing the results of the artificial neural network to the expected output values. The standard deviation of the expected and obtained values was approximately 10% (two sigma).

HeNCE: A Heterogeneous Network Computing Environment

DOE PAGES

Beguelin, Adam; Dongarra, Jack J.; Geist, George Al; ...

1994-01-01

Network computing seeks to utilize the aggregate resources of many networked computers to solve a single problem. In so doing it is often possible to obtain supercomputer performance from an inexpensive local area network. The drawback is that network computing is complicated and error prone when done by hand, especially if the computers have different operating systems and data formats and are thus heterogeneous. The heterogeneous network computing environment (HeNCE) is an integrated graphical environment for creating and running parallel programs over a heterogeneous collection of computers. It is built on a lower level package called parallel virtual machine (PVM).more » The HeNCE philosophy of parallel programming is to have the programmer graphically specify the parallelism of a computation and to automate, as much as possible, the tasks of writing, compiling, executing, debugging, and tracing the network computation. Key to HeNCE is a graphical language based on directed graphs that describe the parallelism and data dependencies of an application. Nodes in the graphs represent conventional Fortran or C subroutines and the arcs represent data and control flow. This article describes the present state of HeNCE, its capabilities, limitations, and areas of future research.« less

Reduced-Order Modeling for Flutter/LCO Using Recurrent Artificial Neural Network

NASA Technical Reports Server (NTRS)

Yao, Weigang; Liou, Meng-Sing

2012-01-01

The present study demonstrates the efficacy of a recurrent artificial neural network to provide a high fidelity time-dependent nonlinear reduced-order model (ROM) for flutter/limit-cycle oscillation (LCO) modeling. An artificial neural network is a relatively straightforward nonlinear method for modeling an input-output relationship from a set of known data, for which we use the radial basis function (RBF) with its parameters determined through a training process. The resulting RBF neural network, however, is only static and is not yet adequate for an application to problems of dynamic nature. The recurrent neural network method [1] is applied to construct a reduced order model resulting from a series of high-fidelity time-dependent data of aero-elastic simulations. Once the RBF neural network ROM is constructed properly, an accurate approximate solution can be obtained at a fraction of the cost of a full-order computation. The method derived during the study has been validated for predicting nonlinear aerodynamic forces in transonic flow and is capable of accurate flutter/LCO simulations. The obtained results indicate that the present recurrent RBF neural network is accurate and efficient for nonlinear aero-elastic system analysis

Tests of peak flow scaling in simulated self-similar river networks

USGS Publications Warehouse

Menabde, M.; Veitzer, S.; Gupta, V.; Sivapalan, M.

2001-01-01

The effect of linear flow routing incorporating attenuation and network topology on peak flow scaling exponent is investigated for an instantaneously applied uniform runoff on simulated deterministic and random self-similar channel networks. The flow routing is modelled by a linear mass conservation equation for a discrete set of channel links connected in parallel and series, and having the same topology as the channel network. A quasi-analytical solution for the unit hydrograph is obtained in terms of recursion relations. The analysis of this solution shows that the peak flow has an asymptotically scaling dependence on the drainage area for deterministic Mandelbrot-Vicsek (MV) and Peano networks, as well as for a subclass of random self-similar channel networks. However, the scaling exponent is shown to be different from that predicted by the scaling properties of the maxima of the width functions. ?? 2001 Elsevier Science Ltd. All rights reserved.

The queueing perspective of asynchronous network coding in two-way relay network

NASA Astrophysics Data System (ADS)

Liang, Yaping; Chang, Qing; Li, Xianxu

2018-04-01

Asynchronous network coding (NC) has potential to improve the wireless network performance compared with a routing or the synchronous network coding. Recent researches concentrate on the optimization between throughput/energy consuming and delay with a couple of independent input flow. However, the implementation of NC requires a thorough investigation of its impact on relevant queueing systems where few work focuses on. Moreover, few works study the probability density function (pdf) in network coding scenario. In this paper, the scenario with two independent Poisson input flows and one output flow is considered. The asynchronous NC-based strategy is that a new arrival evicts a head packet holding in its queue when waiting for another packet from the other flow to encode. The pdf for the output flow which contains both coded and uncoded packets is derived. Besides, the statistic characteristics of this strategy are analyzed. These results are verified by numerical simulations.

Leaf hydraulics II: vascularized tissues.

PubMed

Rockwell, Fulton E; Holbrook, N Michele; Stroock, Abraham D

2014-01-07

Current models of leaf hydration employ an Ohm's law analogy of the leaf as an ideal capacitor, neglecting the resistance to flow between cells, or treat the leaf as a plane sheet with a source of water at fixed potential filling the mid-plane, neglecting the discrete placement of veins as well as their resistance. We develop a model of leaf hydration that considers the average conductance of the vascular network to a representative areole (region bounded by the vascular network), and represent the volume of tissue within the areole as a poroelastic composite of cells and air spaces. Solutions to the 3D flow problem are found by numerical simulation, and these results are then compared to 1D models with exact solutions for a range of leaf geometries, based on a survey of temperate woody plants. We then show that the hydration times given by these solutions are well approximated by a sum of the ideal capacitor and plane sheet times, representing the time for transport through the vasculature and tissue respectively. We then develop scaling factors relating this approximate solution to the 3D model, and examine the dependence of these scaling factors on leaf geometry. Finally, we apply a similar strategy to reduce the dimensions of the steady state problem, in the context of peristomatal transpiration, and consider the relation of transpirational gradients to equilibrium leaf water potential measurements. © 2013 Published by Elsevier Ltd. All rights reserved.

Road Risk Modeling and Cloud-Aided Safety-Based Route Planning.

PubMed

Li, Zhaojian; Kolmanovsky, Ilya; Atkins, Ella; Lu, Jianbo; Filev, Dimitar P; Michelini, John

2016-11-01

This paper presents a safety-based route planner that exploits vehicle-to-cloud-to-vehicle (V2C2V) connectivity. Time and road risk index (RRI) are considered as metrics to be balanced based on user preference. To evaluate road segment risk, a road and accident database from the highway safety information system is mined with a hybrid neural network model to predict RRI. Real-time factors such as time of day, day of the week, and weather are included as correction factors to the static RRI prediction. With real-time RRI and expected travel time, route planning is formulated as a multiobjective network flow problem and further reduced to a mixed-integer programming problem. A V2C2V implementation of our safety-based route planning approach is proposed to facilitate access to real-time information and computing resources. A real-world case study, route planning through the city of Columbus, Ohio, is presented. Several scenarios illustrate how the "best" route can be adjusted to favor time versus safety metrics.

Multimodal Logistics Network Design over Planning Horizon through a Hybrid Meta-Heuristic Approach

NASA Astrophysics Data System (ADS)

Shimizu, Yoshiaki; Yamazaki, Yoshihiro; Wada, Takeshi

Logistics has been acknowledged increasingly as a key issue of supply chain management to improve business efficiency under global competition and diversified customer demands. This study aims at improving a quality of strategic decision making associated with dynamic natures in logistics network optimization. Especially, noticing an importance to concern with a multimodal logistics under multiterms, we have extended a previous approach termed hybrid tabu search (HybTS). The attempt intends to deploy a strategic planning more concretely so that the strategic plan can link to an operational decision making. The idea refers to a smart extension of the HybTS to solve a dynamic mixed integer programming problem. It is a two-level iterative method composed of a sophisticated tabu search for the location problem at the upper level and a graph algorithm for the route selection at the lower level. To keep efficiency while coping with the resulting extremely large-scale problem, we invented a systematic procedure to transform the original linear program at the lower-level into a minimum cost flow problem solvable by the graph algorithm. Through numerical experiments, we verified the proposed method outperformed the commercial software. The results indicate the proposed approach can make the conventional strategic decision much more practical and is promising for real world applications.

Network meta-analysis, electrical networks and graph theory.

PubMed

Rücker, Gerta

2012-12-01

Network meta-analysis is an active field of research in clinical biostatistics. It aims to combine information from all randomized comparisons among a set of treatments for a given medical condition. We show how graph-theoretical methods can be applied to network meta-analysis. A meta-analytic graph consists of vertices (treatments) and edges (randomized comparisons). We illustrate the correspondence between meta-analytic networks and electrical networks, where variance corresponds to resistance, treatment effects to voltage, and weighted treatment effects to current flows. Based thereon, we then show that graph-theoretical methods that have been routinely applied to electrical networks also work well in network meta-analysis. In more detail, the resulting consistent treatment effects induced in the edges can be estimated via the Moore-Penrose pseudoinverse of the Laplacian matrix. Moreover, the variances of the treatment effects are estimated in analogy to electrical effective resistances. It is shown that this method, being computationally simple, leads to the usual fixed effect model estimate when applied to pairwise meta-analysis and is consistent with published results when applied to network meta-analysis examples from the literature. Moreover, problems of heterogeneity and inconsistency, random effects modeling and including multi-armed trials are addressed. Copyright © 2012 John Wiley & Sons, Ltd. Copyright © 2012 John Wiley & Sons, Ltd.

Solution of weakly compressible isothermal flow in landfill gas collection networks

NASA Astrophysics Data System (ADS)

Nec, Y.; Huculak, G.

2017-12-01

Pipe networks collecting gas in sanitary landfills operate under the regime of a weakly compressible isothermal flow of ideal gas. The effect of compressibility has been traditionally neglected in this application in favour of simplicity, thereby creating a conceptual incongruity between the flow equations and thermodynamic equation of state. Here the flow is solved by generalisation of the classic Darcy-Weisbach equation for an incompressible steady flow in a pipe to an ordinary differential equation, permitting continuous variation of density, viscosity and related fluid parameters, as well as head loss or gain due to gravity, in isothermal flow. The differential equation is solved analytically in the case of ideal gas for a single edge in the network. Thereafter the solution is used in an algorithm developed to construct the flow equations automatically for a network characterised by an incidence matrix, and determine pressure distribution, flow rates and all associated parameters therein.

Design Process for High Speed Civil Transport Aircraft Improved by Neural Network and Regression Methods

NASA Technical Reports Server (NTRS)

Hopkins, Dale A.

1998-01-01

A key challenge in designing the new High Speed Civil Transport (HSCT) aircraft is determining a good match between the airframe and engine. Multidisciplinary design optimization can be used to solve the problem by adjusting parameters of both the engine and the airframe. Earlier, an example problem was presented of an HSCT aircraft with four mixed-flow turbofan engines and a baseline mission to carry 305 passengers 5000 nautical miles at a cruise speed of Mach 2.4. The problem was solved by coupling NASA Lewis Research Center's design optimization testbed (COMETBOARDS) with NASA Langley Research Center's Flight Optimization System (FLOPS). The computing time expended in solving the problem was substantial, and the instability of the FLOPS analyzer at certain design points caused difficulties. In an attempt to alleviate both of these limitations, we explored the use of two approximation concepts in the design optimization process. The two concepts, which are based on neural network and linear regression approximation, provide the reanalysis capability and design sensitivity analysis information required for the optimization process. The HSCT aircraft optimization problem was solved by using three alternate approaches; that is, the original FLOPS analyzer and two approximate (derived) analyzers. The approximate analyzers were calibrated and used in three different ranges of the design variables; narrow (interpolated), standard, and wide (extrapolated).

Composition and Realization of Source-to-Sink High-Performance Flows: File Systems, Storage, Hosts, LAN and WAN

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wu, Chase Qishi

A number of Department of Energy (DOE) science applications, involving exascale computing systems and large experimental facilities, are expected to generate large volumes of data, in the range of petabytes to exabytes, which will be transported over wide-area networks for the purpose of storage, visualization, and analysis. To support such capabilities, significant progress has been made in various components including the deployment of 100 Gbps networks with future 1 Tbps bandwidth, increases in end-host capabilities with multiple cores and buses, capacity improvements in large disk arrays, and deployment of parallel file systems such as Lustre and GPFS. High-performance source-to-sink datamore » flows must be composed of these component systems, which requires significant optimizations of the storage-to-host data and execution paths to match the edge and long-haul network connections. In particular, end systems are currently supported by 10-40 Gbps Network Interface Cards (NIC) and 8-32 Gbps storage Host Channel Adapters (HCAs), which carry the individual flows that collectively must reach network speeds of 100 Gbps and higher. Indeed, such data flows must be synthesized using multicore, multibus hosts connected to high-performance storage systems on one side and to the network on the other side. Current experimental results show that the constituent flows must be optimally composed and preserved from storage systems, across the hosts and the networks with minimal interference. Furthermore, such a capability must be made available transparently to the science users without placing undue demands on them to account for the details of underlying systems and networks. And, this task is expected to become even more complex in the future due to the increasing sophistication of hosts, storage systems, and networks that constitute the high-performance flows. The objectives of this proposal are to (1) develop and test the component technologies and their synthesis methods to achieve source-to-sink high-performance flows, and (2) develop tools that provide these capabilities through simple interfaces to users and applications. In terms of the former, we propose to develop (1) optimization methods that align and transition multiple storage flows to multiple network flows on multicore, multibus hosts; and (2) edge and long-haul network path realization and maintenance using advanced provisioning methods including OSCARS and OpenFlow. We also propose synthesis methods that combine these individual technologies to compose high-performance flows using a collection of constituent storage-network flows, and realize them across the storage and local network connections as well as long-haul connections. We propose to develop automated user tools that profile the hosts, storage systems, and network connections; compose the source-to-sink complex flows; and set up and maintain the needed network connections. These solutions will be tested using (1) 100 Gbps connection(s) between Oak Ridge National Laboratory (ORNL) and Argonne National Laboratory (ANL) with storage systems supported by Lustre and GPFS file systems with an asymmetric connection to University of Memphis (UM); (2) ORNL testbed with multicore and multibus hosts, switches with OpenFlow capabilities, and network emulators; and (3) 100 Gbps connections from ESnet and their Openflow testbed, and other experimental connections. This proposal brings together the expertise and facilities of the two national laboratories, ORNL and ANL, and UM. It also represents a collaboration between DOE and the Department of Defense (DOD) projects at ORNL by sharing technical expertise and personnel costs, and leveraging the existing DOD Extreme Scale Systems Center (ESSC) facilities at ORNL.« less

A Proxy Design to Leverage the Interconnection of CoAP Wireless Sensor Networks with Web Applications

PubMed Central

Ludovici, Alessandro; Calveras, Anna

2015-01-01

In this paper, we present the design of a Constrained Application Protocol (CoAP) proxy able to interconnect Web applications based on Hypertext Transfer Protocol (HTTP) and WebSocket with CoAP based Wireless Sensor Networks. Sensor networks are commonly used to monitor and control physical objects or environments. Smart Cities represent applications of such a nature. Wireless Sensor Networks gather data from their surroundings and send them to a remote application. This data flow may be short or long lived. The traditional HTTP long-polling used by Web applications may not be adequate in long-term communications. To overcome this problem, we include the WebSocket protocol in the design of the CoAP proxy. We evaluate the performance of the CoAP proxy in terms of latency and memory consumption. The tests consider long and short-lived communications. In both cases, we evaluate the performance obtained by the CoAP proxy according to the use of WebSocket and HTTP long-polling. PMID:25585107

A comprehensive Network Security Risk Model for process control networks.

PubMed

Henry, Matthew H; Haimes, Yacov Y

2009-02-01

The risk of cyber attacks on process control networks (PCN) is receiving significant attention due to the potentially catastrophic extent to which PCN failures can damage the infrastructures and commodity flows that they support. Risk management addresses the coupled problems of (1) reducing the likelihood that cyber attacks would succeed in disrupting PCN operation and (2) reducing the severity of consequences in the event of PCN failure or manipulation. The Network Security Risk Model (NSRM) developed in this article provides a means of evaluating the efficacy of candidate risk management policies by modeling the baseline risk and assessing expectations of risk after the implementation of candidate measures. Where existing risk models fall short of providing adequate insight into the efficacy of candidate risk management policies due to shortcomings in their structure or formulation, the NSRM provides model structure and an associated modeling methodology that captures the relevant dynamics of cyber attacks on PCN for risk analysis. This article develops the NSRM in detail in the context of an illustrative example.

A numerical procedure for transient free surface seepage through fracture networks

NASA Astrophysics Data System (ADS)

Jiang, Qinghui; Ye, Zuyang; Zhou, Chuangbing

2014-11-01

A parabolic variational inequality (PVI) formulation is presented for the transient free surface seepage problem defined for a whole fracture network. Because the seepage faces are specified as Signorini-type conditions, the PVI formulation can effectively eliminate the singularity of spillpoints that evolve with time. By introducing a continuous penalty function to replace the original Heaviside function, a finite element procedure based on the PVI formulation is developed to predict the transient free surface response in the fracture network. The effects of the penalty parameter on the solution precision are analyzed. A relative error formula for evaluating the flow losses at steady state caused by the penalty parameter is obtained. To validate the proposed method, three typical examples are solved. The solutions for the first example are compared with the experimental results. The results from the last two examples further demonstrate that the orientation, extent and density of fractures significantly affect the free surface seepage behavior in the fracture network.

Understanding characteristics in multivariate traffic flow time series from complex network structure

NASA Astrophysics Data System (ADS)

Yan, Ying; Zhang, Shen; Tang, Jinjun; Wang, Xiaofei

2017-07-01

Discovering dynamic characteristics in traffic flow is the significant step to design effective traffic managing and controlling strategy for relieving traffic congestion in urban cities. A new method based on complex network theory is proposed to study multivariate traffic flow time series. The data were collected from loop detectors on freeway during a year. In order to construct complex network from original traffic flow, a weighted Froenius norm is adopt to estimate similarity between multivariate time series, and Principal Component Analysis is implemented to determine the weights. We discuss how to select optimal critical threshold for networks at different hour in term of cumulative probability distribution of degree. Furthermore, two statistical properties of networks: normalized network structure entropy and cumulative probability of degree, are utilized to explore hourly variation in traffic flow. The results demonstrate these two statistical quantities express similar pattern to traffic flow parameters with morning and evening peak hours. Accordingly, we detect three traffic states: trough, peak and transitional hours, according to the correlation between two aforementioned properties. The classifying results of states can actually represent hourly fluctuation in traffic flow by analyzing annual average hourly values of traffic volume, occupancy and speed in corresponding hours.

A proposal for an SDN-based SIEPON architecture

NASA Astrophysics Data System (ADS)

Khalili, Hamzeh; Sallent, Sebastià; Piney, José Ramón; Rincón, David

2017-11-01

Passive Optical Network (PON) elements such as Optical Line Terminal (OLT) and Optical Network Units (ONUs) are currently managed by inflexible legacy network management systems. Software-Defined Networking (SDN) is a new networking paradigm that improves the operation and management of networks. In this paper, we propose a novel architecture, based on the SDN concept, for Ethernet Passive Optical Networks (EPON) that includes the Service Interoperability standard (SIEPON). In our proposal, the OLT is partially virtualized and some of its functionalities are allocated to the core network management system, while the OLT itself is replaced by an OpenFlow (OF) switch. A new MultiPoint MAC Control (MPMC) sublayer extension based on the OpenFlow protocol is presented. This would allow the SDN controller to manage and enhance the resource utilization, flow monitoring, bandwidth assignment, quality-of-service (QoS) guarantees, and energy management of the optical network access, to name a few possibilities. The OpenFlow switch is extended with synchronous ports to retain the time-critical nature of the EPON network. OpenFlow messages are also extended with new functionalities to implement the concept of EPON Service Paths (ESPs). Our simulation-based results demonstrate the effectiveness of the new architecture, while retaining a similar (or improved) performance in terms of delay and throughput when compared to legacy PONs.

P-adic model of transport in porous disordered media

NASA Astrophysics Data System (ADS)

Khrennikov, Adrei Yu.; Oleschko, Klaudia

2014-05-01

The soil porosity and permeability are the most important quantitative indicators of soil dynamics under the land-use change. The main problema in the modeling of this dynamic is still poor correlation between the real measuring data and the mathematical and computer simulation models. In order to overpassed this deep divorce we have designed a new technique, able to compare the data arised from the multiscale image analices and time series of the basic physical properties dynamics in porous media studied in time and space. We present a model of the diffusion reaction type describing transport in disordered porous media, e.g., water or oil flow in a complex network of pores. Our model is based on p-adic representation of such networks. This is a kind of fractal representation. We explore advantages of p- adic representation, namely, the possibility to endow p-adic trees with an algebraic structure and ultrametric topology and, hence, to apply analysis which have (at least some) similarities with ordinary real analysis on the straight line. We present the system of two diffusion reaction equations describing propagation of particles in networks of pores in disordered media. As an application, one can consider water transport through the soil pore Networks, or oil flow through capillaries nets. Under some restrictions on potentials and rate coefficients we found the stationary regime corresponding to water content or concentration of oil in a cluster of capillaries. Usage of p-adic analysis (in particular, p-adic wavelets) gives a possibility to find the stationary solution in the analytic form which makes possible to present a clear pedological or geological picture of the process. The mathematical model elaborated in this paper (Khrennikov, 2013) can be applied to variety of problems from water concentration in aquifers to the problem of formation of oil reservoirs in disordered media with porous structures. Another possible application may have real practical output. In fact, our system of diffusion-reaction equations can be used to model the process of extraction of water or oil from an extended network of capillaries (Khrennikov et al., 2013). The accomplished analyses show that the time series of water content/pressure dynamics in saturated/unsaturated conditions reflect the fractal structure of pores separated by familias base don the seven geometric descriptors which we used for the soils multiscale images (Oleschko et al., 2012). The similar models were applied to the porous media behind the oil flow from wells. These results motivate usage of the fractal and, in particular, p-adic methods of modeling.

Restoration of services in disrupted infrastructure systems: A network science approach.

PubMed

Ulusan, Aybike; Ergun, Ozlem

2018-01-01

Due to the ubiquitous nature of disruptive extreme events, functionality of the critical infrastructure systems (CIS) is constantly at risk. In case of a disruption, in order to minimize the negative impact to the society, service networks operating on the CIS should be restored as quickly as possible. In this paper, we introduce a novel network science inspired measure to quantify the criticality of components within a disrupted service network and develop a restoration heuristic (Cent-Restore) that prioritizes restoration efforts based on this measure. As an illustrative case study, we consider a road network blocked by debris in the aftermath of a natural disaster. The debris obstructs the flow of relief aid and search-and-rescue teams between critical facilities and disaster sites, debilitating the emergency service network. In this context, the problem is defined as finding a schedule to clear the roads with the limited resources. First, we develop a mixed-integer programming model for the problem. Then we validate the efficiency and accuracy of the Cent-Restore heuristic on randomly generated instances by comparing it to the model. Furthermore, we use Cent-Restore to recommend real-time restoration plans for disrupted road networks of Boston and Manhattan and analyze the performance of the plans over time through resilience curves. We compare Cent-Restore to the current restoration guidelines proposed by FEMA and other strategies that prioritize the restoration efforts based on different measures. As a result we confirm the importance of including specific post-disruption attributes of the networks to create effective restoration strategies. Moreover, we explore the relationship between a service network's resilience and its topological and operational characteristics under different disruption scenarios. The methods and insights provided in this work can be extended to other disrupted large-scale critical infrastructure systems in which the ultimate goal is to enable the functions of the overlaying service networks.

Role of Unchannelized Flow in Determining Bifurcation Angle in Distributary Channel Networks

NASA Astrophysics Data System (ADS)

Coffey, T.

2016-02-01

Distributary channel bifurcations on river deltas are important features in both actively prograding river deltas and in lithified deltas within the stratigraphic record. Attributes of distributary channels have long been thought to be defined by flow velocity, grain size and channel aspect ratio where the channel enters the basin. Interestingly, bifurcations in groundwater-fed tributary networks have been shown to grow and bifurcate independent of flow within the exposed channel network. These networks possess a characteristic bifurcation angle of 72°, based on Laplacian flow (water surface concavity equals zero) in the groundwater flow field near tributary channel tips. Based on the tributary channel model, we develop and test the hypothesis that bifurcation angles in distributary channels are likewise dictated by the external flow field, in this case the surface water surrounding the subaqueous portion of distributary channel tips in a deltaic setting. We measured 64 unique distributary bifurcations in an experimental delta, yielding a characteristic angle of 70.2°±2.2° (95% confidence interval), in line with the theoretical prediction for tributary channels. This similarity between bifurcation angles suggests that (A) flow directly outside of the distributary network is Laplacian, (B) the external flow field controls the bifurcation dynamics of distributary channels, and (C) that flow within the channel plays a secondary role in network dynamics.

Neural networks application to divergence-based passive ranging

NASA Technical Reports Server (NTRS)

Barniv, Yair

1992-01-01

The purpose of this report is to summarize the state of knowledge and outline the planned work in divergence-based/neural networks approach to the problem of passive ranging derived from optical flow. Work in this and closely related areas is reviewed in order to provide the necessary background for further developments. New ideas about devising a monocular passive-ranging system are then introduced. It is shown that image-plan divergence is independent of image-plan location with respect to the focus of expansion and of camera maneuvers because it directly measures the object's expansion which, in turn, is related to the time-to-collision. Thus, a divergence-based method has the potential of providing a reliable range complementing other monocular passive-ranging methods which encounter difficulties in image areas close to the focus of expansion. Image-plan divergence can be thought of as some spatial/temporal pattern. A neural network realization was chosen for this task because neural networks have generally performed well in various other pattern recognition applications. The main goal of this work is to teach a neural network to derive the divergence from the imagery.

Bi-Objective Modelling for Hazardous Materials Road–Rail Multimodal Routing Problem with Railway Schedule-Based Space–Time Constraints

PubMed Central

Sun, Yan; Lang, Maoxiang; Wang, Danzhu

2016-01-01

The transportation of hazardous materials is always accompanied by considerable risk that will impact public and environment security. As an efficient and reliable transportation organization, a multimodal service should participate in the transportation of hazardous materials. In this study, we focus on transporting hazardous materials through the multimodal service network and explore the hazardous materials multimodal routing problem from the operational level of network planning. To formulate this problem more practicably, minimizing the total generalized costs of transporting the hazardous materials and the social risk along the planned routes are set as the optimization objectives. Meanwhile, the following formulation characteristics will be comprehensively modelled: (1) specific customer demands; (2) multiple hazardous material flows; (3) capacitated schedule-based rail service and uncapacitated time-flexible road service; and (4) environmental risk constraint. A bi-objective mixed integer nonlinear programming model is first built to formulate the routing problem that combines the formulation characteristics above. Then linear reformations are developed to linearize and improve the initial model so that it can be effectively solved by exact solution algorithms on standard mathematical programming software. By utilizing the normalized weighted sum method, we can generate the Pareto solutions to the bi-objective optimization problem for a specific case. Finally, a large-scale empirical case study from the Beijing–Tianjin–Hebei Region in China is presented to demonstrate the feasibility of the proposed methods in dealing with the practical problem. Various scenarios are also discussed in the case study. PMID:27483294

Contraction driven flow in the extended vein networks of Physarum polycephalum

NASA Astrophysics Data System (ADS)

Alim, Karen; Amselem, Gabriel; Peaudecerf, Francois; Pringle, Anne; Brenner, Michael P.

2011-11-01

The true slime mold Physarum polycephalum is a basal organism that forms an extended network of veins to forage for food. P. polycephalum is renown for its adaptive changes of vein structure and morphology in response to food sources. These rearrangements presumably occur to establish an efficient transport and mixing of resources throughout the networks thus presenting a prototype to design transport networks under the constraints of laminar flow. The physical flows of cytoplasmic fluid enclosed by the veins exhibit an oscillatory flow termed ``shuttle streaming.'' The flow exceed by far the volume required for growth at the margins suggesting that the additional energy cost for generating the flow is spent for efficient and/or targeted redistribution of resources. We show that the viscous shuttle flow is driven by the radial contractions of the veins that accompany the streaming. We present a model for the fluid flow and resource dispersion arising due to radial contractions. The transport and mixing properties of the flow are discussed.

Deep Space Network (DSN), Network Operations Control Center (NOCC) computer-human interfaces

NASA Technical Reports Server (NTRS)

Ellman, Alvin; Carlton, Magdi

1993-01-01

The Network Operations Control Center (NOCC) of the DSN is responsible for scheduling the resources of DSN, and monitoring all multi-mission spacecraft tracking activities in real-time. Operations performs this job with computer systems at JPL connected to over 100 computers at Goldstone, Australia and Spain. The old computer system became obsolete, and the first version of the new system was installed in 1991. Significant improvements for the computer-human interfaces became the dominant theme for the replacement project. Major issues required innovating problem solving. Among these issues were: How to present several thousand data elements on displays without overloading the operator? What is the best graphical representation of DSN end-to-end data flow? How to operate the system without memorizing mnemonics of hundreds of operator directives? Which computing environment will meet the competing performance requirements? This paper presents the technical challenges, engineering solutions, and results of the NOCC computer-human interface design.

Incorporation of Condensation Heat Transfer in a Flow Network Code

NASA Technical Reports Server (NTRS)

Anthony, Miranda; Majumdar, Alok; McConnaughey, Paul K. (Technical Monitor)

2001-01-01

In this paper we have investigated the condensation of water vapor in a short tube. A numerical model of condensation heat transfer was incorporated in a flow network code. The flow network code that we have used in this paper is Generalized Fluid System Simulation Program (GFSSP). GFSSP is a finite volume based flow network code. Four different condensation models were presented in the paper. Soliman's correlation has been found to be the most stable in low flow rates which is of particular interest in this application. Another highlight of this investigation is conjugate or coupled heat transfer between solid or fluid. This work was done in support of NASA's International Space Station program.

A Wavelet Neural Network Optimal Control Model for Traffic-Flow Prediction in Intelligent Transport Systems

NASA Astrophysics Data System (ADS)

Huang, Darong; Bai, Xing-Rong

Based on wavelet transform and neural network theory, a traffic-flow prediction model, which was used in optimal control of Intelligent Traffic system, is constructed. First of all, we have extracted the scale coefficient and wavelet coefficient from the online measured raw data of traffic flow via wavelet transform; Secondly, an Artificial Neural Network model of Traffic-flow Prediction was constructed and trained using the coefficient sequences as inputs and raw data as outputs; Simultaneous, we have designed the running principium of the optimal control system of traffic-flow Forecasting model, the network topological structure and the data transmitted model; Finally, a simulated example has shown that the technique is effectively and exactly. The theoretical results indicated that the wavelet neural network prediction model and algorithms have a broad prospect for practical application.

Compression of Flow Can Reveal Overlapping-Module Organization in Networks

NASA Astrophysics Data System (ADS)

Viamontes Esquivel, Alcides; Rosvall, Martin

2011-10-01

To better understand the organization of overlapping modules in large networks with respect to flow, we introduce the map equation for overlapping modules. In this information-theoretic framework, we use the correspondence between compression and regularity detection. The generalized map equation measures how well we can compress a description of flow in the network when we partition it into modules with possible overlaps. When we minimize the generalized map equation over overlapping network partitions, we detect modules that capture flow and determine which nodes at the boundaries between modules should be classified in multiple modules and to what degree. With a novel greedy-search algorithm, we find that some networks, for example, the neural network of the nematode Caenorhabditis elegans, are best described by modules dominated by hard boundaries, but that others, for example, the sparse European-roads network, have an organization of highly overlapping modules.

Social adaptation in multi-agent model of linguistic categorization is affected by network information flow.

PubMed

Zubek, Julian; Denkiewicz, Michał; Barański, Juliusz; Wróblewski, Przemysław; Rączaszek-Leonardi, Joanna; Plewczynski, Dariusz

2017-01-01

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems.

Social adaptation in multi-agent model of linguistic categorization is affected by network information flow

PubMed Central

Denkiewicz, Michał; Barański, Juliusz; Wróblewski, Przemysław; Rączaszek-Leonardi, Joanna; Plewczynski, Dariusz

2017-01-01

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems. PMID:28809957

Research on virtual network load balancing based on OpenFlow

NASA Astrophysics Data System (ADS)

Peng, Rong; Ding, Lei

2017-08-01

The Network based on OpenFlow technology separate the control module and data forwarding module. Global deployment of load balancing strategy through network view of control plane is fast and of high efficiency. This paper proposes a Weighted Round-Robin Scheduling algorithm for virtual network and a load balancing plan for server load based on OpenFlow. Load of service nodes and load balancing tasks distribution algorithm will be taken into account.

Many-objective Groundwater Monitoring Network Design Using Bias-Aware Ensemble Kalman Filtering and Evolutionary Optimization

NASA Astrophysics Data System (ADS)

Kollat, J. B.; Reed, P. M.

2009-12-01

This study contributes the ASSIST (Adaptive Strategies for Sampling in Space and Time) framework for improving long-term groundwater monitoring decisions across space and time while accounting for the influences of systematic model errors (or predictive bias). The ASSIST framework combines contaminant flow-and-transport modeling, bias-aware ensemble Kalman filtering (EnKF) and many-objective evolutionary optimization. Our goal in this work is to provide decision makers with a fuller understanding of the information tradeoffs they must confront when performing long-term groundwater monitoring network design. Our many-objective analysis considers up to 6 design objectives simultaneously and consequently synthesizes prior monitoring network design methodologies into a single, flexible framework. This study demonstrates the ASSIST framework using a tracer study conducted within a physical aquifer transport experimental tank located at the University of Vermont. The tank tracer experiment was extensively sampled to provide high resolution estimates of tracer plume behavior. The simulation component of the ASSIST framework consists of stochastic ensemble flow-and-transport predictions using ParFlow coupled with the Lagrangian SLIM transport model. The ParFlow and SLIM ensemble predictions are conditioned with tracer observations using a bias-aware EnKF. The EnKF allows decision makers to enhance plume transport predictions in space and time in the presence of uncertain and biased model predictions by conditioning them on uncertain measurement data. In this initial demonstration, the position and frequency of sampling were optimized to: (i) minimize monitoring cost, (ii) maximize information provided to the EnKF, (iii) minimize failure to detect the tracer, (iv) maximize the detection of tracer flux, (v) minimize error in quantifying tracer mass, and (vi) minimize error in quantifying the moment of the tracer plume. The results demonstrate that the many-objective problem formulation provides a tremendous amount of information for decision makers. Specifically our many-objective analysis highlights the limitations and potentially negative design consequences of traditional single and two-objective problem formulations. These consequences become apparent through visual exploration of high-dimensional tradeoffs and the identification of regions with interesting compromise solutions. The prediction characteristics of these compromise designs are explored in detail, as well as their implications for subsequent design decisions in both space and time.

Dynamic hydro-climatic networks in pristine and regulated rivers

NASA Astrophysics Data System (ADS)

Botter, G.; Basso, S.; Lazzaro, G.; Doulatyari, B.; Biswal, B.; Schirmer, M.; Rinaldo, A.

2014-12-01

Flow patterns observed at-a-station are the dynamical byproduct of a cascade of processes involving different compartments of the hydro-climatic network (e.g., climate, rainfall, soil, vegetation) that regulates the transformation of rainfall into streamflows. In complex branching rivers, flow regimes result from the heterogeneous arrangement around the stream network of multiple hydrologic cascades that simultaneously occur within distinct contributing areas. As such, flow regimes are seen as the integrated output of a complex "network of networks", which can be properly characterized by its degree of temporal variability and spatial heterogeneity. Hydrologic networks that generate river flow regimes are dynamic in nature. In pristine rivers, the time-variance naturally emerges at multiple timescales from climate variability (namely, seasonality and inter-annual fluctuations), implying that the magnitude (and the features) of the water flow between two nodes may be highly variable across different seasons and years. Conversely, the spatial distribution of river flow regimes within pristine rivers involves scale-dependent transport features, as well as regional climatic and soil use gradients, which in small and meso-scale catchments (A < 103 km2) are usually mild enough to guarantee quite uniform flow regimes and high spatial correlations. Human-impacted rivers, instead, constitute hybrid networks where observed spatio-temporal patterns are dominated by anthropogenic shifts, such as landscape alterations and river regulation. In regulated rivers, the magnitude and the features of water flows from node to node may change significantly through time due to damming and withdrawals. However, regulation may impact river regimes in a spatially heterogeneous manner (e.g. in localized river reaches), with a significant decrease of spatial correlations and network connectivity. Provided that the spatial and temporal dynamics of flow regimes in complex rivers may strongly impact important biotic processes involved in the river food web (e.g. biofilm and riparian vegetation dynamics), the study of rivers as dynamic networks provides important clues to water management strategies and freshwater ecosystem studies.

Spatially dynamic recurrent information flow across long-range dorsal motor network encodes selective motor goals.

PubMed

Yoo, Peter E; Hagan, Maureen A; John, Sam E; Opie, Nicholas L; Ordidge, Roger J; O'Brien, Terence J; Oxley, Thomas J; Moffat, Bradford A; Wong, Yan T

2018-06-01

Performing voluntary movements involves many regions of the brain, but it is unknown how they work together to plan and execute specific movements. We recorded high-resolution ultra-high-field blood-oxygen-level-dependent signal during a cued ankle-dorsiflexion task. The spatiotemporal dynamics and the patterns of task-relevant information flow across the dorsal motor network were investigated. We show that task-relevant information appears and decays earlier in the higher order areas of the dorsal motor network then in the primary motor cortex. Furthermore, the results show that task-relevant information is encoded in general initially, and then selective goals are subsequently encoded in specifics subregions across the network. Importantly, the patterns of recurrent information flow across the network vary across different subregions depending on the goal. Recurrent information flow was observed across all higher order areas of the dorsal motor network in the subregions encoding for the current goal. In contrast, only the top-down information flow from the supplementary motor cortex to the frontoparietal regions, with weakened recurrent information flow between the frontoparietal regions and bottom-up information flow from the frontoparietal regions to the supplementary cortex were observed in the subregions encoding for the opposing goal. We conclude that selective motor goal encoding and execution rely on goal-dependent differences in subregional recurrent information flow patterns across the long-range dorsal motor network areas that exhibit graded functional specialization. © 2018 Wiley Periodicals, Inc.

A Green's function method for simulation of time-dependent solute transport and reaction in realistic microvascular geometries.

PubMed

Secomb, Timothy W

2016-12-01

A novel theoretical method is presented for simulating the spatially resolved convective and diffusive transport of reacting solutes between microvascular networks and the surrounding tissues. The method allows for efficient computational solution of problems involving convection and non-linear binding of solutes in blood flowing through microvascular networks with realistic 3D geometries, coupled with transvascular exchange and diffusion and reaction in the surrounding tissue space. The method is based on a Green's function approach, in which the solute concentration distribution in the tissue is expressed as a sum of fields generated by time-varying distributions of discrete sources and sinks. As an example of the application of the method, the washout of an inert diffusible tracer substance from a tissue region perfused by a network of microvessels is simulated, showing its dependence on the solute's transvascular permeability and tissue diffusivity. Exponential decay of the washout concentration is predicted, with rate constants that are about 10-30% lower than the rate constants for a tissue cylinder model with the same vessel length, vessel surface area and blood flow rate per tissue volume. © The authors 2015. Published by Oxford University Press on behalf of the Institute of Mathematics and its Applications. All rights reserved.

Transient PVT measurements and model predictions for vessel heat transfer. Part II.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Felver, Todd G.; Paradiso, Nicholas Joseph; Winters, William S., Jr.

2010-07-01

Part I of this report focused on the acquisition and presentation of transient PVT data sets that can be used to validate gas transfer models. Here in Part II we focus primarily on describing models and validating these models using the data sets. Our models are intended to describe the high speed transport of compressible gases in arbitrary arrangements of vessels, tubing, valving and flow branches. Our models fall into three categories: (1) network flow models in which flow paths are modeled as one-dimensional flow and vessels are modeled as single control volumes, (2) CFD (Computational Fluid Dynamics) models inmore » which flow in and between vessels is modeled in three dimensions and (3) coupled network/CFD models in which vessels are modeled using CFD and flows between vessels are modeled using a network flow code. In our work we utilized NETFLOW as our network flow code and FUEGO for our CFD code. Since network flow models lack three-dimensional resolution, correlations for heat transfer and tube frictional pressure drop are required to resolve important physics not being captured by the model. Here we describe how vessel heat transfer correlations were improved using the data and present direct model-data comparisons for all tests documented in Part I. Our results show that our network flow models have been substantially improved. The CFD modeling presented here describes the complex nature of vessel heat transfer and for the first time demonstrates that flow and heat transfer in vessels can be modeled directly without the need for correlations.« less

Application of the PROMETHEE technique to determine depression outlet location and flow direction in DEM

NASA Astrophysics Data System (ADS)

Chou, Tien-Yin; Lin, Wen-Tzu; Lin, Chao-Yuan; Chou, Wen-Chieh; Huang, Pi-Hui

2004-02-01

With the fast growing progress of computer technologies, spatial information on watersheds such as flow direction, watershed boundaries and the drainage network can be automatically calculated or extracted from a digital elevation model (DEM). The stubborn problem that depressions exist in DEMs has been frequently encountered while extracting the spatial information of terrain. Several filling-up methods have been proposed for solving depressions. However, their suitability for large-scale flat areas is inadequate. This study proposes a depression watershed method coupled with the Preference Ranking Organization METHod for Enrichment Evaluations (PROMETHEEs) theory to determine the optimal outlet and calculate the flow direction in depressions. Three processing procedures are used to derive the depressionless flow direction: (1) calculating the incipient flow direction; (2) establishing the depression watershed by tracing the upstream drainage area and determining the depression outlet using PROMETHEE theory; (3) calculating the depressionless flow direction. The developed method was used to delineate the Shihmen Reservoir watershed located in Northern Taiwan. The results show that the depression watershed method can effectively solve the shortcomings such as depression outlet differentiating and looped flow direction between depressions. The suitability of the proposed approach was verified.

Network planning under uncertainties

NASA Astrophysics Data System (ADS)

Ho, Kwok Shing; Cheung, Kwok Wai

2008-11-01

One of the main focuses for network planning is on the optimization of network resources required to build a network under certain traffic demand projection. Traditionally, the inputs to this type of network planning problems are treated as deterministic. In reality, the varying traffic requirements and fluctuations in network resources can cause uncertainties in the decision models. The failure to include the uncertainties in the network design process can severely affect the feasibility and economics of the network. Therefore, it is essential to find a solution that can be insensitive to the uncertain conditions during the network planning process. As early as in the 1960's, a network planning problem with varying traffic requirements over time had been studied. Up to now, this kind of network planning problems is still being active researched, especially for the VPN network design. Another kind of network planning problems under uncertainties that has been studied actively in the past decade addresses the fluctuations in network resources. One such hotly pursued research topic is survivable network planning. It considers the design of a network under uncertainties brought by the fluctuations in topology to meet the requirement that the network remains intact up to a certain number of faults occurring anywhere in the network. Recently, the authors proposed a new planning methodology called Generalized Survivable Network that tackles the network design problem under both varying traffic requirements and fluctuations of topology. Although all the above network planning problems handle various kinds of uncertainties, it is hard to find a generic framework under more general uncertainty conditions that allows a more systematic way to solve the problems. With a unified framework, the seemingly diverse models and algorithms can be intimately related and possibly more insights and improvements can be brought out for solving the problem. This motivates us to seek a generic framework for solving the network planning problem under uncertainties. In addition to reviewing the various network planning problems involving uncertainties, we also propose that a unified framework based on robust optimization can be used to solve a rather large segment of network planning problem under uncertainties. Robust optimization is first introduced in the operations research literature and is a framework that incorporates information about the uncertainty sets for the parameters in the optimization model. Even though robust optimization is originated from tackling the uncertainty in the optimization process, it can serve as a comprehensive and suitable framework for tackling generic network planning problems under uncertainties. In this paper, we begin by explaining the main ideas behind the robust optimization approach. Then we demonstrate the capabilities of the proposed framework by giving out some examples of how the robust optimization framework can be applied to the current common network planning problems under uncertain environments. Next, we list some practical considerations for solving the network planning problem under uncertainties with the proposed framework. Finally, we conclude this article with some thoughts on the future directions for applying this framework to solve other network planning problems.

Using arborescences to estimate hierarchicalness in directed complex networks

PubMed Central

2018-01-01

Complex networks are a useful tool for the understanding of complex systems. One of the emerging properties of such systems is their tendency to form hierarchies: networks can be organized in levels, with nodes in each level exerting control on the ones beneath them. In this paper, we focus on the problem of estimating how hierarchical a directed network is. We propose a structural argument: a network has a strong top-down organization if we need to delete only few edges to reduce it to a perfect hierarchy—an arborescence. In an arborescence, all edges point away from the root and there are no horizontal connections, both characteristics we desire in our idealization of what a perfect hierarchy requires. We test our arborescence score in synthetic and real-world directed networks against the current state of the art in hierarchy detection: agony, flow hierarchy and global reaching centrality. These tests highlight that our arborescence score is intuitive and we can visualize it; it is able to better distinguish between networks with and without a hierarchical structure; it agrees the most with the literature about the hierarchy of well-studied complex systems; and it is not just a score, but it provides an overall scheme of the underlying hierarchy of any directed complex network. PMID:29381761

Evans blue dye-enhanced capillary-resolution photoacoustic microscopy in vivo

NASA Astrophysics Data System (ADS)

Yao, Junjie; Maslov, Konstantin; Hu, Song; Wang, Lihong V.

2009-09-01

Complete and continuous imaging of microvascular networks is crucial for a wide variety of biomedical applications. Photoacoustic tomography can provide high resolution microvascular imaging using hemoglobin within red blood cells (RBCs) as an endogenic contrast agent. However, intermittent RBC flow in capillaries results in discontinuous and fragmentary capillary images. To overcome this problem, we use Evans blue (EB) dye as a contrast agent for in vivo photoacoustic imaging. EB has strong optical absorption and distributes uniformly in the blood stream by chemically binding to albumin. With the help of EB, complete and continuous microvascular networks--especially capillaries--are imaged. The diffusion dynamics of EB leaving the blood stream and the clearance dynamics of the EB-albumin complex are also quantitatively investigated.

Performance study of a data flow architecture

NASA Technical Reports Server (NTRS)

Adams, George

1985-01-01

Teams of scientists studied data flow concepts, static data flow machine architecture, and the VAL language. Each team mapped its application onto the machine and coded it in VAL. The principal findings of the study were: (1) Five of the seven applications used the full power of the target machine. The galactic simulation and multigrid fluid flow teams found that a significantly smaller version of the machine (16 processing elements) would suffice. (2) A number of machine design parameters including processing element (PE) function unit numbers, array memory size and bandwidth, and routing network capability were found to be crucial for optimal machine performance. (3) The study participants readily acquired VAL programming skills. (4) Participants learned that application-based performance evaluation is a sound method of evaluating new computer architectures, even those that are not fully specified. During the course of the study, participants developed models for using computers to solve numerical problems and for evaluating new architectures. These models form the bases for future evaluation studies.

Predicting Information Flows in Network Traffic.

ERIC Educational Resources Information Center

Hinich, Melvin J.; Molyneux, Robert E.

2003-01-01

Discusses information flow in networks and predicting network traffic and describes a study that uses time series analysis on a day's worth of Internet log data. Examines nonlinearity and traffic invariants, and suggests that prediction of network traffic may not be possible with current techniques. (Author/LRW)

Systems Design and Pilot Operation of a Regional Center for Technical Processing for the Libraries of the New England State Universities. NELINET, New England Library Information Network. Progress Report, July 1, 1967 - March 30, 1968, Volume II, Appendices.

ERIC Educational Resources Information Center

Agenbroad, James E.; And Others

Included in this volume of appendices to LI 000 979 are acquisitions flow charts; a current operations questionnaire; an algorithm for splitting the Library of Congress call number; analysis of the Machine-Readable Cataloging (MARC II) format; production problems and decisions; operating procedures for information transmittal in the New England…

Cloud-based large-scale air traffic flow optimization

NASA Astrophysics Data System (ADS)

Cao, Yi

The ever-increasing traffic demand makes the efficient use of airspace an imperative mission, and this paper presents an effort in response to this call. Firstly, a new aggregate model, called Link Transmission Model (LTM), is proposed, which models the nationwide traffic as a network of flight routes identified by origin-destination pairs. The traversal time of a flight route is assumed to be the mode of distribution of historical flight records, and the mode is estimated by using Kernel Density Estimation. As this simplification abstracts away physical trajectory details, the complexity of modeling is drastically decreased, resulting in efficient traffic forecasting. The predicative capability of LTM is validated against recorded traffic data. Secondly, a nationwide traffic flow optimization problem with airport and en route capacity constraints is formulated based on LTM. The optimization problem aims at alleviating traffic congestions with minimal global delays. This problem is intractable due to millions of variables. A dual decomposition method is applied to decompose the large-scale problem such that the subproblems are solvable. However, the whole problem is still computational expensive to solve since each subproblem is an smaller integer programming problem that pursues integer solutions. Solving an integer programing problem is known to be far more time-consuming than solving its linear relaxation. In addition, sequential execution on a standalone computer leads to linear runtime increase when the problem size increases. To address the computational efficiency problem, a parallel computing framework is designed which accommodates concurrent executions via multithreading programming. The multithreaded version is compared with its monolithic version to show decreased runtime. Finally, an open-source cloud computing framework, Hadoop MapReduce, is employed for better scalability and reliability. This framework is an "off-the-shelf" parallel computing model that can be used for both offline historical traffic data analysis and online traffic flow optimization. It provides an efficient and robust platform for easy deployment and implementation. A small cloud consisting of five workstations was configured and used to demonstrate the advantages of cloud computing in dealing with large-scale parallelizable traffic problems.

Design of pressure-driven microfluidic networks using electric circuit analogy.

PubMed

Oh, Kwang W; Lee, Kangsun; Ahn, Byungwook; Furlani, Edward P

2012-02-07

This article reviews the application of electric circuit methods for the analysis of pressure-driven microfluidic networks with an emphasis on concentration- and flow-dependent systems. The application of circuit methods to microfluidics is based on the analogous behaviour of hydraulic and electric circuits with correlations of pressure to voltage, volumetric flow rate to current, and hydraulic to electric resistance. Circuit analysis enables rapid predictions of pressure-driven laminar flow in microchannels and is very useful for designing complex microfluidic networks in advance of fabrication. This article provides a comprehensive overview of the physics of pressure-driven laminar flow, the formal analogy between electric and hydraulic circuits, applications of circuit theory to microfluidic network-based devices, recent development and applications of concentration- and flow-dependent microfluidic networks, and promising future applications. The lab-on-a-chip (LOC) and microfluidics community will gain insightful ideas and practical design strategies for developing unique microfluidic network-based devices to address a broad range of biological, chemical, pharmaceutical, and other scientific and technical challenges.

A feasibility study of stateful automaton packet inspection for streaming application detection systems

NASA Astrophysics Data System (ADS)

Tseng, Kuo-Kun; Lo, Jiao; Liu, Yiming; Chang, Shih-Hao; Merabti, Madjid; Ng, Felix, C. K.; Wu, C. H.

2017-10-01

The rapid development of the internet has brought huge benefits and social impacts; however, internet security has also become a great problem for users, since traditional approaches to packet classification cannot achieve satisfactory detection performance due to their low accuracy and efficiency. In this paper, a new stateful packet inspection method is introduced, which can be embedded in the network gateway and used by a streaming application detection system. This new detection method leverages the inexact automaton approach, using part of the header field and part of the application layer data of a packet. Based on this approach, an advanced detection system is proposed for streaming applications. The workflow of the system involves two stages: the training stage and the detection stage. In the training stage, the system initially captures characteristic patterns from a set of application packet flows. After this training is completed, the detection stage allows the user to detect the target application by capturing new application flows. This new detection approach is also evaluated using experimental analysis; the results of this analysis show that this new approach not only simplifies the management of the state detection system, but also improves the accuracy of data flow detection, making it feasible for real-world network applications.

Understanding hydraulic fracturing: a multi-scale problem.

PubMed

Hyman, J D; Jiménez-Martínez, J; Viswanathan, H S; Carey, J W; Porter, M L; Rougier, E; Karra, S; Kang, Q; Frash, L; Chen, L; Lei, Z; O'Malley, D; Makedonska, N

2016-10-13

Despite the impact that hydraulic fracturing has had on the energy sector, the physical mechanisms that control its efficiency and environmental impacts remain poorly understood in part because the length scales involved range from nanometres to kilometres. We characterize flow and transport in shale formations across and between these scales using integrated computational, theoretical and experimental efforts/methods. At the field scale, we use discrete fracture network modelling to simulate production of a hydraulically fractured well from a fracture network that is based on the site characterization of a shale gas reservoir. At the core scale, we use triaxial fracture experiments and a finite-discrete element model to study dynamic fracture/crack propagation in low permeability shale. We use lattice Boltzmann pore-scale simulations and microfluidic experiments in both synthetic and shale rock micromodels to study pore-scale flow and transport phenomena, including multi-phase flow and fluids mixing. A mechanistic description and integration of these multiple scales is required for accurate predictions of production and the eventual optimization of hydrocarbon extraction from unconventional reservoirs. Finally, we discuss the potential of CO2 as an alternative working fluid, both in fracturing and re-stimulating activities, beyond its environmental advantages.This article is part of the themed issue 'Energy and the subsurface'. © 2016 The Author(s).

Understanding hydraulic fracturing: a multi-scale problem

PubMed Central

Hyman, J. D.; Jiménez-Martínez, J.; Viswanathan, H. S.; Carey, J. W.; Porter, M. L.; Rougier, E.; Karra, S.; Kang, Q.; Frash, L.; Chen, L.; Lei, Z.; O’Malley, D.; Makedonska, N.

2016-01-01

Despite the impact that hydraulic fracturing has had on the energy sector, the physical mechanisms that control its efficiency and environmental impacts remain poorly understood in part because the length scales involved range from nanometres to kilometres. We characterize flow and transport in shale formations across and between these scales using integrated computational, theoretical and experimental efforts/methods. At the field scale, we use discrete fracture network modelling to simulate production of a hydraulically fractured well from a fracture network that is based on the site characterization of a shale gas reservoir. At the core scale, we use triaxial fracture experiments and a finite-discrete element model to study dynamic fracture/crack propagation in low permeability shale. We use lattice Boltzmann pore-scale simulations and microfluidic experiments in both synthetic and shale rock micromodels to study pore-scale flow and transport phenomena, including multi-phase flow and fluids mixing. A mechanistic description and integration of these multiple scales is required for accurate predictions of production and the eventual optimization of hydrocarbon extraction from unconventional reservoirs. Finally, we discuss the potential of CO2 as an alternative working fluid, both in fracturing and re-stimulating activities, beyond its environmental advantages. This article is part of the themed issue ‘Energy and the subsurface’. PMID:27597789

Coupled Flow and Mechanics in Porous and Fractured Media*

NASA Astrophysics Data System (ADS)

Martinez, M. J.; Newell, P.; Bishop, J.

2012-12-01

Numerical models describing subsurface flow through deformable porous materials are important for understanding and enabling energy security and climate security. Some applications of current interest come from such diverse areas as geologic sequestration of anthropogenic CO2, hydro-fracturing for stimulation of hydrocarbon reservoirs, and modeling electrochemistry-induced swelling of fluid-filled porous electrodes. Induced stress fields in any of these applications can lead to structural failure and fracture. The ultimate goal of this research is to model evolving faults and fracture networks and flow within the networks while coupling to flow and mechanics within the intact porous structure. We report here on a new computational capability for coupling of multiphase porous flow with geomechanics including assessment of over-pressure-induced structural damage. The geomechanics is coupled to the flow via the variation in the fluid pore pressures, whereas the flow problem is coupled to mechanics by the concomitant material strains which alter the pore volume (porosity field) and hence the permeability field. For linear elastic solid mechanics a monolithic coupling strategy is utilized. For nonlinear elastic/plastic and fractured media, a segregated coupling is presented. To facilitate coupling with disparate flow and mechanics time scales, the coupling strategy allows for different time steps in the flow solve compared to the mechanics solve. If time steps are synchronized, the controller allows user-specified intra-time-step iterations. The iterative coupling is dynamically controlled based on a norm measuring the degree of variation in the deformed porosity. The model is applied for evaluation of the integrity of jointed caprock systems during CO2 sequestration operations. Creation or reactivation of joints can lead to enhanced pathways for leakage. Similarly, over-pressures can induce flow along faults. Fluid flow rates in fractures are strongly dependent on the effective hydraulic aperture, which is a non-linear function of effective normal stress. The dynamically evolving aperture field updates the effective, anisotropic permeability tensor, thus resulting in a highly coupled multiphysics problem. Two models of geomechanical damage are discussed: critical shear-slip criteria and a sub-grid joint model. Leakage rates through the caprock resulting from the joint model are compared to those assuming intact material, allowing a correlation between potential for leakage and injection rates/pressures, for various in-situ stratigraphies. *This material is based upon work supported as part of the Center for Frontiers of Subsurface Energy Security, an Energy Frontier Research Center funded by the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences under Award Number DE-SC0001114. Sandia is a multi-program laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energys National Nuclear Security Administration under Contract DE-AC04-94AL85000.

77 FR 3544 - Meeting and Webinar on the Active Traffic and Demand Management and Intelligent Network Flow...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-01-24

... Intelligent Network Flow Optimization Operational Concepts; Notice of Public Meeting AGENCY: Research and... Demand Management (ADTM) and Intelligent Network Flow Optimization (INFLO) operational concepts. The ADTM... February 8, 2012, 8:30 to 4:30 p.m. The location for both meetings is the Hall of States, 444 North Capitol...

Dynamic switching enables efficient bacterial colonization in flow.

PubMed

Kannan, Anerudh; Yang, Zhenbin; Kim, Minyoung Kevin; Stone, Howard A; Siryaporn, Albert

2018-05-22

Bacteria colonize environments that contain networks of moving fluids, including digestive pathways, blood vasculature in animals, and the xylem and phloem networks in plants. In these flow networks, bacteria form distinct biofilm structures that have an important role in pathogenesis. The physical mechanisms that determine the spatial organization of bacteria in flow are not understood. Here, we show that the bacterium P. aeruginosa colonizes flow networks using a cyclical process that consists of surface attachment, upstream movement, detachment, movement with the bulk flow, and surface reattachment. This process, which we have termed dynamic switching, distributes bacterial subpopulations upstream and downstream in flow through two phases: movement on surfaces and cellular movement via the bulk. The model equations that describe dynamic switching are identical to those that describe dynamic instability, a process that enables microtubules in eukaryotic cells to search space efficiently to capture chromosomes. Our results show that dynamic switching enables bacteria to explore flow networks efficiently, which maximizes dispersal and colonization and establishes the organizational structure of biofilms. A number of eukaryotic and mammalian cells also exhibit movement in two phases in flow, which suggests that dynamic switching is a modality that enables efficient dispersal for a broad range of cell types.

Transnational cocaine and heroin flow networks in western Europe: A comparison.

PubMed

Chandra, Siddharth; Joba, Johnathan

2015-08-01

A comparison of the properties of drug flow networks for cocaine and heroin in a group of 17 western European countries is provided with the aim of understanding the implications of their similarities and differences for drug policy. Drug flow data for the cocaine and heroin networks were analyzed using the UCINET software package. Country-level characteristics including hub and authority scores, core and periphery membership, and centrality, and network-level characteristics including network density, the results of a triad census, and the final fitness of the core-periphery structure of the network, were computed and compared between the two networks. The cocaine network contains fewer path redundancies and a smaller, more tightly knit core than the heroin network. Authorities, hubs and countries central to the cocaine network tend to have higher hub, authority, and centrality scores than those in the heroin network. The core-periphery and hub-authority structures of the cocaine and heroin networks reflect the west-to-east and east-to-west patterns of flow of cocaine and heroin respectively across Europe. The key nodes in the cocaine and heroin networks are generally distinct from one another. The analysis of drug flow networks can reveal important structural features of trafficking networks that can be useful for the allocation of scarce drug control resources. The identification of authorities, hubs, network cores, and network-central nodes can suggest foci for the allocation of these resources. In the case of Europe, while some countries are important to both cocaine and heroin networks, different sets of countries occupy positions of prominence in the two networks. The distinct nature of the cocaine and heroin networks also suggests that a one-size-fits-all supply- and interdiction-focused policy may not work as well as an approach that takes into account the particular characteristics of each network. Copyright © 2015 Elsevier B.V. All rights reserved.

The application of complex network time series analysis in turbulent heated jets

DOE Office of Scientific and Technical Information (OSTI.GOV)

Charakopoulos, A. K.; Karakasidis, T. E., E-mail: thkarak@uth.gr; Liakopoulos, A.

In the present study, we applied the methodology of the complex network-based time series analysis to experimental temperature time series from a vertical turbulent heated jet. More specifically, we approach the hydrodynamic problem of discriminating time series corresponding to various regions relative to the jet axis, i.e., time series corresponding to regions that are close to the jet axis from time series originating at regions with a different dynamical regime based on the constructed network properties. Applying the transformation phase space method (k nearest neighbors) and also the visibility algorithm, we transformed time series into networks and evaluated the topologicalmore » properties of the networks such as degree distribution, average path length, diameter, modularity, and clustering coefficient. The results show that the complex network approach allows distinguishing, identifying, and exploring in detail various dynamical regions of the jet flow, and associate it to the corresponding physical behavior. In addition, in order to reject the hypothesis that the studied networks originate from a stochastic process, we generated random network and we compared their statistical properties with that originating from the experimental data. As far as the efficiency of the two methods for network construction is concerned, we conclude that both methodologies lead to network properties that present almost the same qualitative behavior and allow us to reveal the underlying system dynamics.« less

The application of complex network time series analysis in turbulent heated jets

DOE Office of Scientific and Technical Information (OSTI.GOV)

Charakopoulos, A. K.; Karakasidis, T. E., E-mail: thkarak@uth.gr; Liakopoulos, A.

2014-06-15

In the present study, we applied the methodology of the complex network-based time series analysis to experimental temperature time series from a vertical turbulent heated jet. More specifically, we approach the hydrodynamic problem of discriminating time series corresponding to various regions relative to the jet axis, i.e., time series corresponding to regions that are close to the jet axis from time series originating at regions with a different dynamical regime based on the constructed network properties. Applying the transformation phase space method (k nearest neighbors) and also the visibility algorithm, we transformed time series into networks and evaluated the topologicalmore » properties of the networks such as degree distribution, average path length, diameter, modularity, and clustering coefficient. The results show that the complex network approach allows distinguishing, identifying, and exploring in detail various dynamical regions of the jet flow, and associate it to the corresponding physical behavior. In addition, in order to reject the hypothesis that the studied networks originate from a stochastic process, we generated random network and we compared their statistical properties with that originating from the experimental data. As far as the efficiency of the two methods for network construction is concerned, we conclude that both methodologies lead to network properties that present almost the same qualitative behavior and allow us to reveal the underlying system dynamics.« less

Analysis of Cisco Open Network Environment (ONE) OpenFlow Controller Implementation

DTIC Science & Technology

2014-08-01

Software - Defined Networking ( SDN ), when fully realized, offer many improvements over the current rigid and...functionalities like handshake, connection setup, switch management, and security. 15. SUBJECT TERMS OpenFlow, software - defined networking , Cisco ONE, SDN ...innovating packet-forwarding technologies. Network device roles are strictly defined with little or no flexibility. In Software - Defined Networks ( SDNs ),

An experimental approach to the fundamental principles of hemodynamics.

PubMed

Pontiga, Francisco; Gaytán, Susana P

2005-09-01

An experimental model has been developed to give students hands-on experience with the fundamental laws of hemodynamics. The proposed experimental setup is of simple construction but permits the precise measurements of physical variables involved in the experience. The model consists in a series of experiments where different basic phenomena are quantitatively investigated, such as the pressure drop in a long straight vessel and in an obstructed vessel, the transition from laminar to turbulent flow, the association of vessels in vascular networks, or the generation of a critical stenosis. Through these experiments, students acquire a direct appreciation of the importance of the parameters involved in the relationship between pressure and flow rate, thus facilitating the comprehension of more complex problems in hemodynamics.

Restoration of services in disrupted infrastructure systems: A network science approach

PubMed Central

Ergun, Ozlem

2018-01-01

Due to the ubiquitous nature of disruptive extreme events, functionality of the critical infrastructure systems (CIS) is constantly at risk. In case of a disruption, in order to minimize the negative impact to the society, service networks operating on the CIS should be restored as quickly as possible. In this paper, we introduce a novel network science inspired measure to quantify the criticality of components within a disrupted service network and develop a restoration heuristic (Cent-Restore) that prioritizes restoration efforts based on this measure. As an illustrative case study, we consider a road network blocked by debris in the aftermath of a natural disaster. The debris obstructs the flow of relief aid and search-and-rescue teams between critical facilities and disaster sites, debilitating the emergency service network. In this context, the problem is defined as finding a schedule to clear the roads with the limited resources. First, we develop a mixed-integer programming model for the problem. Then we validate the efficiency and accuracy of the Cent-Restore heuristic on randomly generated instances by comparing it to the model. Furthermore, we use Cent-Restore to recommend real-time restoration plans for disrupted road networks of Boston and Manhattan and analyze the performance of the plans over time through resilience curves. We compare Cent-Restore to the current restoration guidelines proposed by FEMA and other strategies that prioritize the restoration efforts based on different measures. As a result we confirm the importance of including specific post-disruption attributes of the networks to create effective restoration strategies. Moreover, we explore the relationship between a service network’s resilience and its topological and operational characteristics under different disruption scenarios. The methods and insights provided in this work can be extended to other disrupted large-scale critical infrastructure systems in which the ultimate goal is to enable the functions of the overlaying service networks. PMID:29444191

Building the Material Flow Networks of Aluminum in the 2007 U.S. Economy.

PubMed

Chen, Wei-Qiang; Graedel, T E; Nuss, Philip; Ohno, Hajime

2016-04-05

Based on the combination of the U.S. economic input-output table and the stocks and flows framework for characterizing anthropogenic metal cycles, this study presents a methodology for building material flow networks of bulk metals in the U.S. economy and applies it to aluminum. The results, which we term the Input-Output Material Flow Networks (IO-MFNs), achieve a complete picture of aluminum flow in the entire U.S. economy and for any chosen industrial sector (illustrated for the Automobile Manufacturing sector). The results are compared with information from our former study on U.S. aluminum stocks and flows to demonstrate the robustness and value of this new methodology. We find that the IO-MFN approach has the following advantages: (1) it helps to uncover the network of material flows in the manufacturing stage in the life cycle of metals; (2) it provides a method that may be less time-consuming but more complete and accurate in estimating new scrap generation, process loss, domestic final demand, and trade of final products of metals, than existing material flow analysis approaches; and, most importantly, (3) it enables the analysis of the material flows of metals in the U.S. economy from a network perspective, rather than merely that of a life cycle chain.

Design and performance evaluation of an OpenFlow-based control plane for software-defined elastic optical networks with direct-detection optical OFDM (DDO-OFDM) transmission.

PubMed

Liu, Lei; Peng, Wei-Ren; Casellas, Ramon; Tsuritani, Takehiro; Morita, Itsuro; Martínez, Ricardo; Muñoz, Raül; Yoo, S J B

2014-01-13

Optical Orthogonal Frequency Division Multiplexing (O-OFDM), which transmits high speed optical signals using multiple spectrally overlapped lower-speed subcarriers, is a promising candidate for supporting future elastic optical networks. In contrast to previous works which focus on Coherent Optical OFDM (CO-OFDM), in this paper, we consider the direct-detection optical OFDM (DDO-OFDM) as the transport technique, which leads to simpler hardware and software realizations, potentially offering a low-cost solution for elastic optical networks, especially in metro networks, and short or medium distance core networks. Based on this network scenario, we design and deploy a software-defined networking (SDN) control plane enabled by extending OpenFlow, detailing the network architecture, the routing and spectrum assignment algorithm, OpenFlow protocol extensions and the experimental validation. To the best of our knowledge, it is the first time that an OpenFlow-based control plane is reported and its performance is quantitatively measured in an elastic optical network with DDO-OFDM transmission.

Assessment of system reliability for a stochastic-flow distribution network with the spoilage property

NASA Astrophysics Data System (ADS)

Lin, Yi-Kuei; Huang, Cheng-Fu; Yeh, Cheng-Ta

2016-04-01

In supply chain management, satisfying customer demand is the most concerned for the manager. However, the goods may rot or be spoilt during delivery owing to natural disasters, inclement weather, traffic accidents, collisions, and so on, such that the intact goods may not meet market demand. This paper concentrates on a stochastic-flow distribution network (SFDN), in which a node denotes a supplier, a transfer station, or a market, while a route denotes a carrier providing the delivery service for a pair of nodes. The available capacity of the carrier is stochastic because the capacity may be partially reserved by other customers. The addressed problem is to evaluate the system reliability, the probability that the SFDN can satisfy the market demand with the spoilage rate under the budget constraint from multiple suppliers to the customer. An algorithm is developed in terms of minimal paths to evaluate the system reliability along with a numerical example to illustrate the solution procedure. A practical case of fruit distribution is presented accordingly to emphasise the management implication of the system reliability.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.

PubMed

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A

2016-08-25

There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Purvine, Emilie AH; Monson, Kyle E.; Jurrus, Elizabeth R.

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which verticesmore » (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.« less

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

PubMed Central

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A.

2016-01-01

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of “maximum flow-minimum cut” graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174

The Impact of The Fractal Paradigm on Geography

NASA Astrophysics Data System (ADS)

De Cola, L.

2001-12-01

Being itself somewhat fractal, Benoit Mandelbrot's magnum opus THE FRACTAL GEOMETRY OF NATURE may be deconstructed in many ways, including geometrically, systematically, and epistemologically. Viewed as a work of geography it may be used to organize the major topics of interest to scientists preoccupied with the understanding of real-world space in astronomy, geology, meteorology, hydrology, and biology. We shall use it to highlight such recent geographic accomplishments as automated feature detection, understanding urban growth, and modeling the spread of disease in space and time. However, several key challenges remain unsolved, among them: 1. It is still not possible to move continuously from one map scale to another so that objects change their dimension smoothly. I.e. as a viewer zooms in on a map the zero-dimensional location of a city should gradually become a 2-dimensional polygon, then a network of 1-dimensional streets, then 3-dimensional buildings, etc. 2. Spatial autocorrelation continues to be regarded more as an econometric challenge than as a problem of scaling. Similarities of values among closely-spaced observation is not so much a problem to be overcome as a source of information about spatial structure. 3. Although the fractal paradigm is a powerful model for data analysis, its ideas and techniques need to be brought to bear on the problems of understanding such hierarchies as ecosystems (the flow networks of energy and matter), taxonomies (biological classification), and knowledge (hierarchies of bureaucratic information, networks of linked data, etc).

Programmable multi-node quantum network design and simulation

NASA Astrophysics Data System (ADS)

Dasari, Venkat R.; Sadlier, Ronald J.; Prout, Ryan; Williams, Brian P.; Humble, Travis S.

2016-05-01

Software-defined networking offers a device-agnostic programmable framework to encode new network functions. Externally centralized control plane intelligence allows programmers to write network applications and to build functional network designs. OpenFlow is a key protocol widely adopted to build programmable networks because of its programmability, flexibility and ability to interconnect heterogeneous network devices. We simulate the functional topology of a multi-node quantum network that uses programmable network principles to manage quantum metadata for protocols such as teleportation, superdense coding, and quantum key distribution. We first show how the OpenFlow protocol can manage the quantum metadata needed to control the quantum channel. We then use numerical simulation to demonstrate robust programmability of a quantum switch via the OpenFlow network controller while executing an application of superdense coding. We describe the software framework implemented to carry out these simulations and we discuss near-term efforts to realize these applications.

Effectiveness of the New Hampshire stream-gaging network in providing regional streamflow information

USGS Publications Warehouse

Olson, Scott A.

2003-01-01

The stream-gaging network in New Hampshire was analyzed for its effectiveness in providing regional information on peak-flood flow, mean-flow, and low-flow frequency. The data available for analysis were from stream-gaging stations in New Hampshire and selected stations in adjacent States. The principles of generalized-least-squares regression analysis were applied to develop regional regression equations that relate streamflow-frequency characteristics to watershed characteristics. Regression equations were developed for (1) the instantaneous peak flow with a 100-year recurrence interval, (2) the mean-annual flow, and (3) the 7-day, 10-year low flow. Active and discontinued stream-gaging stations with 10 or more years of flow data were used to develop the regression equations. Each stream-gaging station in the network was evaluated and ranked on the basis of how much the data from that station contributed to the cost-weighted sampling-error component of the regression equation. The potential effect of data from proposed and new stream-gaging stations on the sampling error also was evaluated. The stream-gaging network was evaluated for conditions in water year 2000 and for estimated conditions under various network strategies if an additional 5 years and 20 years of streamflow data were collected. The effectiveness of the stream-gaging network in providing regional streamflow information could be improved for all three flow characteristics with the collection of additional flow data, both temporally and spatially. With additional years of data collection, the greatest reduction in the average sampling error of the regional regression equations was found for the peak- and low-flow characteristics. In general, additional data collection at stream-gaging stations with unregulated flow, relatively short-term record (less than 20 years), and drainage areas smaller than 45 square miles contributed the largest cost-weighted reduction to the average sampling error of the regional estimating equations. The results of the network analyses can be used to prioritize the continued operation of active stations, the reactivation of discontinued stations, or the activation of new stations to maximize the regional information content provided by the stream-gaging network. Final decisions regarding altering the New Hampshire stream-gaging network would require the consideration of the many uses of the streamflow data serving local, State, and Federal interests.

Experimental and modeling study of Newtonian and non-Newtonian fluid flow in pore network micromodels.

PubMed

Perrin, Christian L; Tardy, Philippe M J; Sorbie, Ken S; Crawshaw, John C

2006-03-15

The in situ rheology of polymeric solutions has been studied experimentally in etched silicon micromodels which are idealizations of porous media. The rectangular channels in these etched networks have dimensions typical of pore sizes in sandstone rocks. Pressure drop/flow rate relations have been measured for water and non-Newtonian hydrolyzed-polyacrylamide (HPAM) solutions in both individual straight rectangular capillaries and in networks of such capillaries. Results from these experiments have been analyzed using pore-scale network modeling incorporating the non-Newtonian fluid mechanics of a Carreau fluid. Quantitative agreement is seen between the experiments and the network calculations in the Newtonian and shear-thinning flow regions demonstrating that the 'shift factor,'alpha, can be calculated a priori. Shear-thickening behavior was observed at higher flow rates in the micromodel experiments as a result of elastic effects becoming important and this remains to be incorporated in the network model.

Modeling microcirculatory blood flow: current state and future perspectives.

PubMed

Gompper, Gerhard; Fedosov, Dmitry A

2016-01-01

Microvascular blood flow determines a number of important physiological processes of an organism in health and disease. Therefore, a detailed understanding of microvascular blood flow would significantly advance biophysical and biomedical research and its applications. Current developments in modeling of microcirculatory blood flow already allow to go beyond available experimental measurements and have a large potential to elucidate blood flow behavior in normal and diseased microvascular networks. There exist detailed models of blood flow on a single cell level as well as simplified models of the flow through microcirculatory networks, which are reviewed and discussed here. The combination of these models provides promising prospects for better understanding of blood flow behavior and transport properties locally as well as globally within large microvascular networks. © 2015 Wiley Periodicals, Inc.

Prediction of friction factor of pure water flowing inside vertical smooth and microfin tubes by using artificial neural networks

NASA Astrophysics Data System (ADS)

Çebi, A.; Akdoğan, E.; Celen, A.; Dalkilic, A. S.

2017-02-01

An artificial neural network (ANN) model of friction factor in smooth and microfin tubes under heating, cooling and isothermal conditions was developed in this study. Data used in ANN was taken from a vertically positioned heat exchanger experimental setup. Multi-layered feed-forward neural network with backpropagation algorithm, radial basis function networks and hybrid PSO-neural network algorithm were applied to the database. Inputs were the ratio of cross sectional flow area to hydraulic diameter, experimental condition number depending on isothermal, heating, or cooling conditions and mass flow rate while the friction factor was the output of the constructed system. It was observed that such neural network based system could effectively predict the friction factor values of the flows regardless of their tube types. A dependency analysis to determine the strongest parameter that affected the network and database was also performed and tube geometry was found to be the strongest parameter of all as a result of analysis.

Bandwidth turbulence control based on flow community structure in the Internet

NASA Astrophysics Data System (ADS)

Wu, Xiaoyu; Gu, Rentao; Ji, Yuefeng

2016-10-01

Bursty flows vary rapidly in short period of time, and cause fierce bandwidth turbulence in the Internet. In this letter, we model the flow bandwidth turbulence process by constructing a flow interaction network (FIN network), with nodes representing flows and edges denoting bandwidth interactions among them. To restrain the bandwidth turbulence in FIN networks, an immune control strategy based on flow community structure is proposed. Flows in community boundary positions are immunized to cut off the inter-community turbulence spreading. By applying this control strategy in the first- and the second-level flow communities separately, 97.2% flows can effectively avoid bandwidth variations by immunizing 21% flows, and the average bandwidth variation degree reaches near zero. To achieve a similar result, about 70%-90% immune flows are needed with targeted control strategy based on flow degrees and random control strategy. Moreover, simulation results showed that the control effect of the proposed strategy improves significantly if the immune flow number is relatively smaller in each control step.

Automating Network Node Behavior Characterization by Mining Communication Patterns

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carroll, Thomas E.; Chikkagoudar, Satish; Arthur-Durett, Kristine M.

Enterprise networks of scale are complex, dynamic computing environments that respond to evolv- ing business objectives and requirements. Characteriz- ing system behaviors in these environments is essential for network management and cyber security operations. Characterization of system’s communication is typical and is supported using network flow information (NetFlow). Related work has characterized behavior using theoretical graph metrics; results are often difficult to interpret by enterprise staff. We propose a different approach, where flow information is mapped to sets of tags that contextualize the data in terms of network principals and enterprise concepts. Frequent patterns are then extracted and are expressedmore » as behaviors. Behaviors can be com- pared, identifying systems expressing similar behaviors. We evaluate the approach using flow information collected by a third party.« less

Design of a stateless low-latency router architecture for green software-defined networking

NASA Astrophysics Data System (ADS)

Saldaña Cercós, Silvia; Ramos, Ramon M.; Ewald Eller, Ana C.; Martinello, Magnos; Ribeiro, Moisés. R. N.; Manolova Fagertun, Anna; Tafur Monroy, Idelfonso

2015-01-01

Expanding software defined networking (SDN) to transport networks requires new strategies to deal with the large number of flows that future core networks will have to face. New south-bound protocols within SDN have been proposed to benefit from having control plane detached from the data plane offering a cost- and energy-efficient forwarding engine. This paper presents an overview of a new approach named KeyFlow to simultaneously reduce latency, jitter, and power consumption in core network nodes. Results on an emulation platform indicate that round trip time (RTT) can be reduced above 50% compared to the reference protocol OpenFlow, specially when flow tables are densely populated. Jitter reduction has been demonstrated experimentally on a NetFPGA-based platform, and 57.3% power consumption reduction has been achieved.

An Emergent Bifurcation Angle on River Deltas

NASA Astrophysics Data System (ADS)

Shaw, J.; Coffey, T.

2017-12-01

Distributary channel bifurcations on river deltas are important features that control water, sediment, and nutrient routing and can dictate large-scale stratigraphic heterogeneity. We use theory originally developed for a special case of tributary networks to understand the dynamics of distributary channel bifurcations. Interestingly, bifurcations in groundwater-fed tributary networks have been shown to evolve dependent on the diffusive flow field outside the network. These networks possess a characteristic bifurcation angle of 72°, due to Laplacian flow in the groundwater flow field near tributary channel tips (gradient2h2=0, where h is water surface elevation). We develop and test the hypothesis that bifurcation angles in distributary channel networks are likewise dictated by the external flow field, in this case the shallow surface water surrounding the subaqueous portion of distributary channel bifurcations in a deltaic setting. We measured 130 unique distributary channel bifurcations in a single experimental delta and in 10 natural deltas, yielding a mean angle of 70.35°±2.59° (95% confidence interval), in line with the theoretical prediction. These data and hydrodynamic scaling arguments convince us that distributary network formation can result simply from the coupling of (Laplacian) extra-channel flow to channels along subaqueous channel networks. The simplicity of this model provides new insight into distributary network formation and its geomorphic and stratigraphic consequences.

Congestion and flow control in signaling system No. 7: Impacts of intelligent networks and new services

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zepf, J.; Rufa, G.

1994-04-01

This paper focuses on the transient performance analysis of the congestion and flow control mechanisms in CCITT Signaling System No. 7 (SS7). Special attention is directed to the impacts of the introduction of intelligent services and new applications, e.g., Freephone, credit card services, user-to-user signaling, etc. In particular, we show that signaling traffic characteristics like signaling scenarios or signaling message length as well as end-to-end signaling capabilities have a significant influence on the congestion and flow control and, therefore, on the real-time signaling performance. One important result of our performance studies is that if, e.g., intelligent services are introduced, themore » SS7 congestion and flow control does not work correctly. To solve this problem, some reinvestigations into these mechanisms would be necessary. Therefore, some approaches, e.g., modification of the Signaling Connection Control Part (SCCP) congestion control, usage of the SCCP relay function, or a redesign of the MTP flow control procedures are discussed in order to guarantee the efficacy of the congestion and flow control mechanisms also in the future. 16 refs.« less

Assessment of velocity fields through open-channel flows with an empiric law.

PubMed

Bardiaux, J B; Vazquez, J; Mosé, R

2008-01-01

Most sewer managers are currently confronted with the evaluation of the water discharges, that flow through their networks or go to the discharge system, i.e. rivers in the majority of cases. In this context, the Urban Hydraulic Systems laboratory of the ENGEES is working on the relation between velocity fields and metrology assessment through a partnership with the Fluid and Solid Mechanics Institute of Strasbourg (IMFS). The responsibility is clearly to transform a velocity profile measurement, given by a Doppler sensor developed by the IMFS team, into a water discharge evaluation. The velocity distribution in a cross section of the flow in a channel has attracted the interests of many researchers over the years, due to its practical applications. In the case of free surface flows in narrow open channels the maximum velocity is below the free surface. This phenomenon, usually called "dip-phenomenon", amongst other things, raises the problem of the area explored in the section of measurements. The work presented here tries to create a simple relation making possible to associate the flow with the velocity distribution. This step allows to insert the sensor position into the flow calculation.

A Second Law Based Unstructured Finite Volume Procedure for Generalized Flow Simulation

NASA Technical Reports Server (NTRS)

Majumdar, Alok

1998-01-01

An unstructured finite volume procedure has been developed for steady and transient thermo-fluid dynamic analysis of fluid systems and components. The procedure is applicable for a flow network consisting of pipes and various fittings where flow is assumed to be one dimensional. It can also be used to simulate flow in a component by modeling a multi-dimensional flow using the same numerical scheme. The flow domain is discretized into a number of interconnected control volumes located arbitrarily in space. The conservation equations for each control volume account for the transport of mass, momentum and entropy from the neighboring control volumes. In addition, they also include the sources of each conserved variable and time dependent terms. The source term of entropy equation contains entropy generation due to heat transfer and fluid friction. Thermodynamic properties are computed from the equation of state of a real fluid. The system of equations is solved by a hybrid numerical method which is a combination of simultaneous Newton-Raphson and successive substitution schemes. The paper also describes the application and verification of the procedure by comparing its predictions with the analytical and numerical solution of several benchmark problems.

Dynamic Hop Service Differentiation Model for End-to-End QoS Provisioning in Multi-Hop Wireless Networks

NASA Astrophysics Data System (ADS)

Youn, Joo-Sang; Seok, Seung-Joon; Kang, Chul-Hee

This paper presents a new QoS model for end-to-end service provisioning in multi-hop wireless networks. In legacy IEEE 802.11e based multi-hop wireless networks, the fixed assignment of service classes according to flow's priority at every node causes priority inversion problem when performing end-to-end service differentiation. Thus, this paper proposes a new QoS provisioning model called Dynamic Hop Service Differentiation (DHSD) to alleviate the problem and support effective service differentiation between end-to-end nodes. Many previous works for QoS model through the 802.11e based service differentiation focus on packet scheduling on several service queues with different service rate and service priority. Our model, however, concentrates on a dynamic class selection scheme, called Per Hop Class Assignment (PHCA), in the node's MAC layer, which selects a proper service class for each packet, in accordance with queue states and service requirement, in every node along the end-to-end route of the packet. The proposed QoS solution is evaluated using the OPNET simulator. The simulation results show that the proposed model outperforms both best-effort and 802.11e based strict priority service models in mobile ad hoc environments.

An implementation of the SNR high speed network communication protocol (Receiver part)

NASA Astrophysics Data System (ADS)

Wan, Wen-Jyh

1995-03-01

This thesis work is to implement the receiver pan of the SNR high speed network transport protocol. The approach was to use the Systems of Communicating Machines (SCM) as the formal definition of the protocol. Programs were developed on top of the Unix system using C programming language. The Unix system features that were adopted for this implementation were multitasking, signals, shared memory, semaphores, sockets, timers and process control. The problems encountered, and solved, were signal loss, shared memory conflicts, process synchronization, scheduling, data alignment and errors in the SCM specification itself. The result was a correctly functioning program which implemented the SNR protocol. The system was tested using different connection modes, lost packets, duplicate packets and large data transfers. The contributions of this thesis are: (1) implementation of the receiver part of the SNR high speed transport protocol; (2) testing and integration with the transmitter part of the SNR transport protocol on an FDDI data link layered network; (3) demonstration of the functions of the SNR transport protocol such as connection management, sequenced delivery, flow control and error recovery using selective repeat methods of retransmission; and (4) modifications to the SNR transport protocol specification such as corrections for incorrect predicate conditions, defining of additional packet types formats, solutions for signal lost and processes contention problems etc.

Using a genetic algorithm to optimize a water-monitoring network for accuracy and cost effectiveness

NASA Astrophysics Data System (ADS)

Julich, R. J.

2004-05-01

The purpose of this project is to determine the optimal spatial distribution of water-monitoring wells to maximize important data collection and to minimize the cost of managing the network. We have employed a genetic algorithm (GA) towards this goal. The GA uses a simple fitness measure with two parts: the first part awards a maximal score to those combinations of hydraulic head observations whose net uncertainty is closest to the value representing all observations present, thereby maximizing accuracy; the second part applies a penalty function to minimize the number of observations, thereby minimizing the overall cost of the monitoring network. We used the linear statistical inference equation to calculate standard deviations on predictions from a numerical model generated for the 501-observation Death Valley Regional Flow System as the basis for our uncertainty calculations. We have organized the results to address the following three questions: 1) what is the optimal design strategy for a genetic algorithm to optimize this problem domain; 2) what is the consistency of solutions over several optimization runs; and 3) how do these results compare to what is known about the conceptual hydrogeology? Our results indicate the genetic algorithms are a more efficient and robust method for solving this class of optimization problems than have been traditional optimization approaches.

Robustness analysis of complex networks with power decentralization strategy via flow-sensitive centrality against cascading failures

NASA Astrophysics Data System (ADS)

Guo, Wenzhang; Wang, Hao; Wu, Zhengping

2018-03-01

Most existing cascading failure mitigation strategy of power grids based on complex network ignores the impact of electrical characteristics on dynamic performance. In this paper, the robustness of the power grid under a power decentralization strategy is analysed through cascading failure simulation based on AC flow theory. The flow-sensitive (FS) centrality is introduced by integrating topological features and electrical properties to help determine the siting of the generation nodes. The simulation results of the IEEE-bus systems show that the flow-sensitive centrality method is a more stable and accurate approach and can enhance the robustness of the network remarkably. Through the study of the optimal flow-sensitive centrality selection for different networks, we find that the robustness of the network with obvious small-world effect depends more on contribution of the generation nodes detected by community structure, otherwise, contribution of the generation nodes with important influence on power flow is more critical. In addition, community structure plays a significant role in balancing the power flow distribution and further slowing the propagation of failures. These results are useful in power grid planning and cascading failure prevention.

Groundwater Discharge of Legacy Nitrogen to River Networks: Linking Regional Groundwater Models to Streambed Groundwater-Surface Water Exchange and Nitrogen Processing

NASA Astrophysics Data System (ADS)

Barclay, J. R.; Helton, A. M.; Briggs, M. A.; Starn, J. J.; Hunt, A.

2017-12-01

Despite years of management, excess nitrogen (N) is a pervasive problem in many aquatic ecosystems. More than half of surface water in the United States is derived from groundwater, and widespread N contamination in aquifers from decades of watershed N inputs suggest legacy N discharging from groundwater may contribute to contemporary N pollution problems in surface waters. Legacy N loads to streams and rivers are controlled by both regional scale flow paths and fine-scale processes that drive N transformations, such as groundwater-surface water exchange across steep redox gradients that occur at stream bed interfaces. Adequately incorporating these disparate scales is a challenge, but it is essential to understanding legacy N transport and making informed management decisions. We developed a regional groundwater flow model for the Farmington River, a HUC-8 basin that drains to the Long Island Sound, a coastal estuary that suffers from elevated N loads despite decades of management, to understand broad patterns of regional transport. To evaluate and refine the regional model, we used thermal infrared imagery paired with vertical temperature profiling to estimate groundwater discharge at the streambed interface. We also analyzed discharging groundwater for multiple N species to quantify fine scale patterns of N loading and transformation via denitrification at the streambed interface. Integrating regional and local estimates of groundwater discharge of legacy N to river networks should improve our ability to predict spatiotemporal patterns of legacy N loading to and transformation within surface waters.

Autonomous Agent-Based Systems and Their Applications in Fluid Dynamics, Particle Separation, and Co-evolving Networks

NASA Astrophysics Data System (ADS)

Graeser, Oliver

This thesis comprises three parts, reporting research results in Fluid Dynamics (Part I), Particle Separation (Part II) and Co-evolving Networks (Part III). Part I deals with the simulation of fluid dynamics using the lattice-Boltzmann method. Microfluidic devices often feature two-dimensional, repetitive arrays. Flows through such devices are pressure-driven and confined by solid walls. We have defined new adaptive generalised periodic boundary conditions to represent the effects of outer solid walls, and are thus able to exploit the periodicity of the array by simulating the flow through one unit cell in lieu of the entire device. The so-calculated fully developed flow describes the flow through the entire array accurately, but with computational requirements that are reduced according to the dimensions of the array. Part II discusses the problem of separating macromolecules like proteins or DNA coils. The reliable separation of such molecules is a crucial task in molecular biology. The use of Brownian ratchets as mechanisms for the separation of such particles has been proposed and discussed during the last decade. Pressure-driven flows have so far been dismissed as possible driving forces for Brownian ratchets, as they do not generate ratchet asymmetry. We propose a microfluidic design that uses pressure-driven flows to create asymmetry and hence allows particle separation. The dependence of the asymmetry on various factors of the microfluidic geometry is discussed. We further exemplify the feasibility of our approach using Brownian dynamics simulations of particles of different sizes in such a device. The results show that ratchet-based particle separation using flows as the driving force is possible. Simulation results and ratchet theory predictions are in excellent agreement. Part III deals with the co-evolution of networks and dynamic models. A group of agents occupies the nodes of a network, which defines the relationship between these agents. The evolution of the agents is defined by the rules of the dynamic model and depends on the relationship between agents, i.e., the state of the network. In return, the evolution of the network depends on the state of the dynamic model. The concept is introduced through the adaptive SIS model. We show that the previously used criterion determining the critical infected fraction, i.e., the number of infected agents required to sustain the epidemic, is inappropriate for this model. We introduce a different criterion and show that the critical infected fraction so determined is in good agreement with results obtained by numerical simulations. We further discuss the concept of co-evolving dynamics using the Snowdrift Game as a model paradigm. Co-evolution occurs through agents cutting dissatisfied links and rewiring to other agents at random. The effect of co-evolution on the emergence of cooperation is discussed using a mean-field theory and numerical simulations. A transition between a connected and a disconnected, highly cooperative state of the system is observed, and explained using the mean-field model. Quantitative deviations regarding the level of cooperation in the disconnected regime can be fully resolved through an improved mean-field theory that includes the effect of random fluctuations into its model.

Advance reservation access control using software-defined networking and tokens

DOE PAGES

Chung, Joaquin; Jung, Eun-Sung; Kettimuthu, Rajkumar; ...

2017-03-09

Advance reservation systems allow users to reserve dedicated bandwidth connection resources from advanced high-speed networks. A common use case for such systems is data transfers in distributed science environments in which a user wants exclusive access to the reservation. However, current advance network reservation methods cannot ensure exclusive access of a network reservation to the specific flow for which the user made the reservation. We present in this paper a novel network architecture that addresses this limitation and ensures that a reservation is used only by the intended flow. We achieve this by leveraging software-defined networking (SDN) and token-based authorization.more » We use SDN to orchestrate and automate the reservation of networking resources, end-to-end and across multiple administrative domains, and tokens to create a strong binding between the user or application that requested the reservation and the flows provisioned by SDN. Finally, we conducted experiments on the ESNet 100G SDN testbed, and demonstrated that our system effectively protects authorized flows from competing traffic in the network.« less

Advance reservation access control using software-defined networking and tokens

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chung, Joaquin; Jung, Eun-Sung; Kettimuthu, Rajkumar

Advance reservation systems allow users to reserve dedicated bandwidth connection resources from advanced high-speed networks. A common use case for such systems is data transfers in distributed science environments in which a user wants exclusive access to the reservation. However, current advance network reservation methods cannot ensure exclusive access of a network reservation to the specific flow for which the user made the reservation. We present in this paper a novel network architecture that addresses this limitation and ensures that a reservation is used only by the intended flow. We achieve this by leveraging software-defined networking (SDN) and token-based authorization.more » We use SDN to orchestrate and automate the reservation of networking resources, end-to-end and across multiple administrative domains, and tokens to create a strong binding between the user or application that requested the reservation and the flows provisioned by SDN. Finally, we conducted experiments on the ESNet 100G SDN testbed, and demonstrated that our system effectively protects authorized flows from competing traffic in the network.« less

Advance reservation access control using software-defined networking and tokens

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chung, Joaquin; Jung, Eun-Sung; Kettimuthu, Rajkumar

Advance reservation systems allow users to reserve dedicated bandwidth connection resources from advanced high-speed networks. A common use case for such systems is data transfers in distributed science environments in which a user wants exclusive access to the reservation. However, current advance network reservation methods cannot ensure exclusive access of a network reservation to the specific flow for which the user made the reservation. We present here a novel network architecture that addresses this limitation and ensures that a reservation is used only by the intended flow. We achieve this by leveraging software-defined networking (SDN) and token-based authorization. We usemore » SDN to orchestrate and automate the reservation of networking resources, end-to-end and across multiple administrative domains, and tokens to create a strong binding between the user or application that requested the reservation and the flows provisioned by SDN. We conducted experiments on the ESNet 100G SDN testbed, and demonstrated that our system effectively protects authorized flows from competing traffic in the network. (C) 2017 Elsevier B.V. All rights reserved.« less

Overland flow erosion inferred from Martian channel network geometry

NASA Astrophysics Data System (ADS)

Seybold, Hansjörg; Kirchner, James

2016-04-01

The controversy about the origin of Mars' channel networks is almost as old as their discovery 150 years ago. Over the last few decades, new Mars probes have revealed more detailed structures in Martian The controversy about the origin of Mars' channel networks is almost as old as their discovery 150 years ago. Over the last few decades, new Mars probes have revealed more detailed structures in Martian drainage networks, and new studies suggest that Mars once had large volumes of surface water. But how this water flowed, and how it could have carved the channels, remains unclear. Simple scaling arguments show that networks formed by similar mechanisms should have similar branching angles on Earth and Mars, suggesting that Earth analogues can be informative here. A recent analysis of high-resolution data for the continental United States shows that climate leaves a characteristic imprint in the branching geometry of stream networks. Networks growing in humid regions have an average branching angle of α = 2π/5 = 72° [1], which is characteristic of network growth by groundwater sapping [2]. Networks in arid regions, where overland flow erosion is more dominant, show much smaller branching angles. Here we show that the channel networks on Mars have branching angles that resemble those created by surficial flows on Earth. This result implies that the growth of Martian channel networks was dominated by near-surface flow, and suggests that deeper infiltration was inhibited, potentially by permafrost or by impermeable weathered soils. [1] Climate's Watermark in the Geometry of River Networks, Seybold et al.; under review [2] Ramification of stream networks, Devauchelle et al.; PNAS (2012)

Inclusion-based effective medium models for the field-scale permeability of 3D fractured rock masses

NASA Astrophysics Data System (ADS)

Ebigbo, Anozie; Lang, Philipp S.; Paluszny, Adriana; Zimmerman, Robert W.

2016-04-01

Fractures that are more permeable than their host rock can act as preferential, or at least additional, pathways for fluid to flow through the rock. The additional transmissivity contributed by these fractures will be of great relevance in several areas of earth science and engineering, such as radioactive waste disposal in crystalline rock, exploitation of fractured hydrocarbon and geothermal reservoirs, or hydraulic fracturing. In describing or predicting flow through fractured rock, the effective permeability of the rock mass, comprising both the rock matrix and a network of fractures, is a crucial parameter, and will depend on several geometric properties of the fractures/networks, such as lateral extent, aperture, orientation, and fracture density. This study investigates the ability of classical inclusion-based effective medium models (following the work of Sævik et al., Transp. Porous Media, 2013) to predict this permeability. In these models, the fractures are represented as thin, spheroidal inclusions, the interiors of which are treated as porous media having a high (but finite) permeability. The predictions of various effective medium models, such as the symmetric and asymmetric self-consistent schemes, the differential scheme, and Maxwell's method, are tested against the results of explicit numerical simulations of mono- and polydisperse isotropic fracture networks embedded in a permeable rock matrix. Comparisons are also made with the Hashin-Shrikman bounds, Snow's model, and Mourzenko's heuristic model (Mourzenko et al., Phys. Rev. E, 2011). This problem is characterised mathematically by two small parameters, the aspect ratio of the spheroidal fractures, α, and the ratio between matrix and fracture permeability, κ. Two different regimes can be identified, corresponding to α/κ < 1 and α/κ > 1. The lower the value of α/κ, the more significant is flow through the matrix. Due to differing flow patterns, the dependence of effective permeability on fracture density differs in the two regimes. When α/κ > 1, a distinct percolation threshold is observed, whereas for α/κ < 1, the matrix is sufficiently transmissive that a percolation-like transition is not observed. The self-consistent effective medium methods show good accuracy for both mono- and polydisperse isotropic fracture networks. Mourzenko's equation is also found to be very accurate, particularly for monodisperse networks. Finally, it is shown that Snow's model essentially coincides with the Hashin-Shtrikman upper bound.

Mechanics and control of the cytoskeleton in Amoeba proteus.

PubMed Central

Dembo, M

1989-01-01

Many models of the cytoskeletal motility of Amoeba proteus can be formulated in terms of the theory of reactive interpenetrating flow (Dembo and Harlow, 1986). We have devised numerical methodology for testing such models against the phenomenon of steady axisymmetric fountain flow. The simplest workable scheme revealed by such tests (the minimal model) is the main preoccupation of this study. All parameters of the minimal model are determined from available data. Using these parameters the model quantitatively accounts for the self assembly of the cytoskeleton of A. proteus: for the formation and detailed morphology of the endoplasmic channel, the ectoplasmic tube, the uropod, the plasma gel sheet, and the hyaline cap. The model accounts for the kinematics of the cytoskeleton: the detailed velocity field of the forward flow of the endoplasm, the contraction of the ectoplasmic tube, and the inversion of the flow in the fountain zone. The model also gives a satisfactory account of measurements of pressure gradients, measurements of heat dissipation, and measurements of the output of useful work by amoeba. Finally, the model suggests a very promising (but still hypothetical) continuum formulation of the free boundary problem of amoeboid motion. by balancing normal forces on the plasma membrane as closely as possible, the minimal model is able to predict the turgor pressure and surface tension of A. proteus. Several dynamical factors are crucial to the success of the minimal model and are likely to be general features of cytoskeletal mechanics and control in amoeboid cells. These are: a constitutive law for the viscosity of the contractile network that includes an automatic process of gelation as the network density gets large; a very vigorous cycle of network polymerization and depolymerization (in the case of A. proteus, the time constant for this reaction is approximately 12 s); control of network contractility by a diffusible factor (probably calcium ion); and control of the adhesive interaction between the cytoskeleton and the inner surface of the plasma membrane. Images FIGURE 1 FIGURE 2 FIGURE 7 PMID:2765645

Application of SNODAS and hydrologic models to enhance entropy-based snow monitoring network design

NASA Astrophysics Data System (ADS)

Keum, Jongho; Coulibaly, Paulin; Razavi, Tara; Tapsoba, Dominique; Gobena, Adam; Weber, Frank; Pietroniro, Alain

2018-06-01

Snow has a unique characteristic in the water cycle, that is, snow falls during the entire winter season, but the discharge from snowmelt is typically delayed until the melting period and occurs in a relatively short period. Therefore, reliable observations from an optimal snow monitoring network are necessary for an efficient management of snowmelt water for flood prevention and hydropower generation. The Dual Entropy and Multiobjective Optimization is applied to design snow monitoring networks in La Grande River Basin in Québec and Columbia River Basin in British Columbia. While the networks are optimized to have the maximum amount of information with minimum redundancy based on entropy concepts, this study extends the traditional entropy applications to the hydrometric network design by introducing several improvements. First, several data quantization cases and their effects on the snow network design problems were explored. Second, the applicability the Snow Data Assimilation System (SNODAS) products as synthetic datasets of potential stations was demonstrated in the design of the snow monitoring network of the Columbia River Basin. Third, beyond finding the Pareto-optimal networks from the entropy with multi-objective optimization, the networks obtained for La Grande River Basin were further evaluated by applying three hydrologic models. The calibrated hydrologic models simulated discharges using the updated snow water equivalent data from the Pareto-optimal networks. Then, the model performances for high flows were compared to determine the best optimal network for enhanced spring runoff forecasting.

Collaborative learning in networks.

PubMed

Mason, Winter; Watts, Duncan J

2012-01-17

Complex problems in science, business, and engineering typically require some tradeoff between exploitation of known solutions and exploration for novel ones, where, in many cases, information about known solutions can also disseminate among individual problem solvers through formal or informal networks. Prior research on complex problem solving by collectives has found the counterintuitive result that inefficient networks, meaning networks that disseminate information relatively slowly, can perform better than efficient networks for problems that require extended exploration. In this paper, we report on a series of 256 Web-based experiments in which groups of 16 individuals collectively solved a complex problem and shared information through different communication networks. As expected, we found that collective exploration improved average success over independent exploration because good solutions could diffuse through the network. In contrast to prior work, however, we found that efficient networks outperformed inefficient networks, even in a problem space with qualitative properties thought to favor inefficient networks. We explain this result in terms of individual-level explore-exploit decisions, which we find were influenced by the network structure as well as by strategic considerations and the relative payoff between maxima. We conclude by discussing implications for real-world problem solving and possible extensions.

Collaborative learning in networks

PubMed Central

Mason, Winter; Watts, Duncan J.

2012-01-01

Complex problems in science, business, and engineering typically require some tradeoff between exploitation of known solutions and exploration for novel ones, where, in many cases, information about known solutions can also disseminate among individual problem solvers through formal or informal networks. Prior research on complex problem solving by collectives has found the counterintuitive result that inefficient networks, meaning networks that disseminate information relatively slowly, can perform better than efficient networks for problems that require extended exploration. In this paper, we report on a series of 256 Web-based experiments in which groups of 16 individuals collectively solved a complex problem and shared information through different communication networks. As expected, we found that collective exploration improved average success over independent exploration because good solutions could diffuse through the network. In contrast to prior work, however, we found that efficient networks outperformed inefficient networks, even in a problem space with qualitative properties thought to favor inefficient networks. We explain this result in terms of individual-level explore-exploit decisions, which we find were influenced by the network structure as well as by strategic considerations and the relative payoff between maxima. We conclude by discussing implications for real-world problem solving and possible extensions. PMID:22184216

The Flow of International Students from a Macro Perspective: A Network Analysis

ERIC Educational Resources Information Center

Barnett, George A.; Lee, Moosung; Jiang, Ke; Park, Han Woo

2016-01-01

This paper provides a network analysis of the international flow of students among 210 countries and the factors determining the structure of this flow. Among these factors, bilateral hyperlink connections between countries and the number of telephone minutes (communication variables) are the most important predictors of the flow's structure,…

Analysis of HRCT-derived xylem network reveals reverse flow in some vessels

USDA-ARS?s Scientific Manuscript database

Flow in xylem vessels is modeled based on constructions of three dimensional xylem networks derived from High Resolution Computed Tomography (HRCT) images of grapevine (Vitis vinifera) stems. Flow in 6-14% of the vessels was found to be oriented in the opposite direction to the bulk flow under norma...

Dual-mode ultraflow access networks: a hybrid solution for the access bottleneck

NASA Astrophysics Data System (ADS)

Kazovsky, Leonid G.; Shen, Thomas Shunrong; Dhaini, Ahmad R.; Yin, Shuang; De Leenheer, Marc; Detwiler, Benjamin A.

2013-12-01

Optical Flow Switching (OFS) is a promising solution for large Internet data transfers. In this paper, we introduce UltraFlow Access, a novel optical access network architecture that offers dual-mode service to its end-users: IP and OFS. With UltraFlow Access, we design and implement a new dual-mode control plane and a new dual-mode network stack to ensure efficient connection setup and reliable and optimal data transmission. We study the impact of the UltraFlow system's design on the network throughput. Our experimental results show that with an optimized system design, near optimal (around 10 Gb/s) OFS data throughput can be attained when the line rate is 10Gb/s.

Multiple object tracking using the shortest path faster association algorithm.

PubMed

Xi, Zhenghao; Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time.

Multiple Object Tracking Using the Shortest Path Faster Association Algorithm

PubMed Central

Liu, Heping; Liu, Huaping; Yang, Bin

2014-01-01

To solve the persistently multiple object tracking in cluttered environments, this paper presents a novel tracking association approach based on the shortest path faster algorithm. First, the multiple object tracking is formulated as an integer programming problem of the flow network. Then we relax the integer programming to a standard linear programming problem. Therefore, the global optimum can be quickly obtained using the shortest path faster algorithm. The proposed method avoids the difficulties of integer programming, and it has a lower worst-case complexity than competing methods but better robustness and tracking accuracy in complex environments. Simulation results show that the proposed algorithm takes less time than other state-of-the-art methods and can operate in real time. PMID:25215322

From Signature-Based Towards Behaviour-Based Anomaly Detection (Extended Abstract)

DTIC Science & Technology

2010-11-01

data acquisition can serve as sensors. De- facto standard for IP flow monitoring is NetFlow format. Although NetFlow was originally developed by Cisco...packets with some common properties that pass through a network device. These collected flows are exported to an external device, the NetFlow ...Thanks to the network-based approach using NetFlow data, the detection algorithm is host independent and highly scalable. Deep Packet Inspection

PageRank versatility analysis of multilayer modality-based network for exploring the evolution of oil-water slug flow.

PubMed

Gao, Zhong-Ke; Dang, Wei-Dong; Li, Shan; Yang, Yu-Xuan; Wang, Hong-Tao; Sheng, Jing-Ran; Wang, Xiao-Fan

2017-07-14

Numerous irregular flow structures exist in the complicated multiphase flow and result in lots of disparate spatial dynamical flow behaviors. The vertical oil-water slug flow continually attracts plenty of research interests on account of its significant importance. Based on the spatial transient flow information acquired through our designed double-layer distributed-sector conductance sensor, we construct multilayer modality-based network to encode the intricate spatial flow behavior. Particularly, we calculate the PageRank versatility and multilayer weighted clustering coefficient to quantitatively explore the inferred multilayer modality-based networks. Our analysis allows characterizing the complicated evolution of oil-water slug flow, from the opening formation of oil slugs, to the succedent inter-collision and coalescence among oil slugs, and then to the dispersed oil bubbles. These properties render our developed method particularly powerful for mining the essential flow features from the multilayer sensor measurements.

Operator splitting method for simulation of dynamic flows in natural gas pipeline networks

DOE PAGES

Dyachenko, Sergey A.; Zlotnik, Anatoly; Korotkevich, Alexander O.; ...

2017-09-19

Here, we develop an operator splitting method to simulate flows of isothermal compressible natural gas over transmission pipelines. The method solves a system of nonlinear hyperbolic partial differential equations (PDEs) of hydrodynamic type for mass flow and pressure on a metric graph, where turbulent losses of momentum are modeled by phenomenological Darcy-Weisbach friction. Mass flow balance is maintained through the boundary conditions at the network nodes, where natural gas is injected or withdrawn from the system. Gas flow through the network is controlled by compressors boosting pressure at the inlet of the adjoint pipe. Our operator splitting numerical scheme ismore » unconditionally stable and it is second order accurate in space and time. The scheme is explicit, and it is formulated to work with general networks with loops. We test the scheme over range of regimes and network configurations, also comparing its performance with performance of two other state of the art implicit schemes.« less

Accounting for heterogeneity of nutrient dynamics in riverscapes through spatially distributed models

NASA Astrophysics Data System (ADS)

Wollheim, W. M.; Stewart, R. J.

2011-12-01

Numerous types of heterogeneity exist within river systems, leading to hotspots of nutrient sources, sinks, and impacts embedded within an underlying gradient defined by river size. This heterogeneity influences the downstream propagation of anthropogenic impacts across flow conditions. We applied a river network model to explore how nitrogen saturation at river network scales is influenced by the abundance and distribution of potential nutrient processing hotspots (lakes, beaver ponds, tributary junctions, hyporheic zones) under different flow conditions. We determined that under low flow conditions, whole network nutrient removal is relatively insensitive to the number of hotspots because the underlying river network structure has sufficient nutrient processing capacity. However, hotspots become more important at higher flows and greatly influence the spatial distribution of removal within the network at all flows, suggesting that identification of heterogeneity is critical to develop predictive understanding of nutrient removal processes under changing loading and climate conditions. New temporally intensive data from in situ sensors can potentially help to better understand and constrain these dynamics.

Information transmission and signal permutation in active flow networks

NASA Astrophysics Data System (ADS)

Woodhouse, Francis G.; Fawcett, Joanna B.; Dunkel, Jörn

2018-03-01

Recent experiments show that both natural and artificial microswimmers in narrow channel-like geometries will self-organise to form steady, directed flows. This suggests that networks of flowing active matter could function as novel autonomous microfluidic devices. However, little is known about how information propagates through these far-from-equilibrium systems. Through a mathematical analogy with spin-ice vertex models, we investigate here the input–output characteristics of generic incompressible active flow networks (AFNs). Our analysis shows that information transport through an AFN is inherently different from conventional pressure or voltage driven networks. Active flows on hexagonal arrays preserve input information over longer distances than their passive counterparts and are highly sensitive to bulk topological defects, whose presence can be inferred from marginal input–output distributions alone. This sensitivity further allows controlled permutations on parallel inputs, revealing an unexpected link between active matter and group theory that can guide new microfluidic mixing strategies facilitated by active matter and aid the design of generic autonomous information transport networks.

Stochastic Stability in Internet Router Congestion Games

NASA Astrophysics Data System (ADS)

Chung, Christine; Pyrga, Evangelia

Congestion control at bottleneck routers on the internet is a long standing problem. Many policies have been proposed for effective ways to drop packets from the queues of these routers so that network endpoints will be inclined to share router capacity fairly and minimize the overflow of packets trying to enter the queues. We study just how effective some of these queuing policies are when each network endpoint is a self-interested player with no information about the other players’ actions or preferences. By employing the adaptive learning model of evolutionary game theory, we study policies such as Droptail, RED, and the greedy-flow-punishing policy proposed by Gao et al. [10] to find the stochastically stable states: the states of the system that will be reached in the long run.

A flood lamination strategy based on transportation network with time delay.

PubMed

Nouasse, H; Chiron, P; Archimède, B

2013-01-01

Over the last few years, the frequency and intensity of floods has become more marked due to the influence of climate change. The engendered problems are related to the safety of goods and persons. These considerations require predictive management that will limit water height downstream. In the literature, numerous works have described flow modeling and management. The work presented in this paper is interested in quantitative management by means of flood expansion areas placed along the river and for which we have size and location. The performance of the management system depends on the time and height of gate opening, which will influence wave mitigation. The proposed management method is based on use of a transportation network with time delay from which the volume of water to be stored is calculated.

Airport Network Flow Simulator

DOT National Transportation Integrated Search

1978-10-01

The Airport Network Flow Simulator is a FORTRAN IV simulation of the flow of air traffic in the nation's 600 commercial airports. It calculates for any group of selected airports: (a) the landing and take-off (Type A) delays; and (b) the gate departu...

An Efficacious Multi-Objective Fuzzy Linear Programming Approach for Optimal Power Flow Considering Distributed Generation.

PubMed

Warid, Warid; Hizam, Hashim; Mariun, Norman; Abdul-Wahab, Noor Izzri

2016-01-01

This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality.

An Efficacious Multi-Objective Fuzzy Linear Programming Approach for Optimal Power Flow Considering Distributed Generation

PubMed Central

Warid, Warid; Hizam, Hashim; Mariun, Norman; Abdul-Wahab, Noor Izzri

2016-01-01

This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality. PMID:26954783

Variational Lagrangian data assimilation in open channel networks

NASA Astrophysics Data System (ADS)

Wu, Qingfang; Tinka, Andrew; Weekly, Kevin; Beard, Jonathan; Bayen, Alexandre M.

2015-04-01

This article presents a data assimilation method in a tidal system, where data from both Lagrangian drifters and Eulerian flow sensors were fused to estimate water velocity. The system is modeled by first-order, hyperbolic partial differential equations subject to periodic forcing. The estimation problem can then be formulated as the minimization of the difference between the observed variables and model outputs, and eventually provide the velocity and water stage of the hydrodynamic system. The governing equations are linearized and discretized using an implicit discretization scheme, resulting in linear equality constraints in the optimization program. Thus, the flow estimation can be formed as an optimization problem and efficiently solved. The effectiveness of the proposed method was substantiated by a large-scale field experiment in the Sacramento-San Joaquin River Delta in California. A fleet of 100 sensors developed at the University of California, Berkeley, were deployed in Walnut Grove, CA, to collect a set of Lagrangian data, a time series of positions as the sensors moved through the water. Measurements were also taken from Eulerian sensors in the region, provided by the United States Geological Survey. It is shown that the proposed method can effectively integrate Lagrangian and Eulerian measurement data, resulting in a suited estimation of the flow variables within the hydraulic system.

Generation of Complex Karstic Conduit Networks with a Hydro-chemical Model

NASA Astrophysics Data System (ADS)

De Rooij, R.; Graham, W. D.

2016-12-01

The discrete-continuum approach is very well suited to simulate flow and solute transport within karst aquifers. Using this approach, discrete one-dimensional conduits are embedded within a three-dimensional continuum representative of the porous limestone matrix. Typically, however, little is known about the geometry of the karstic conduit network. As such the discrete-continuum approach is rarely used for practical applications. It may be argued, however, that the uncertainty associated with the geometry of the network could be handled by modeling an ensemble of possible karst conduit networks within a stochastic framework. We propose to generate stochastically realistic karst conduit networks by simulating the widening of conduits as caused by the dissolution of limestone over geological relevant timescales. We illustrate that advanced numerical techniques permit to solve the non-linear and coupled hydro-chemical processes efficiently, such that relatively large and complex networks can be generated in acceptable time frames. Instead of specifying flow boundary conditions on conduit cells to recharge the network as is typically done in classical speleogenesis models, we specify an effective rainfall rate over the land surface and let model physics determine the amount of water entering the network. This is advantageous since the amount of water entering the network is extremely difficult to reconstruct, whereas the effective rainfall rate may be quantified using paleoclimatic data. Furthermore, we show that poorly known flow conditions may be constrained by requiring a realistic flow field. Using our speleogenesis model we have investigated factors that influence the geometry of simulated conduit networks. We illustrate that our model generates typical branchwork, network and anastomotic conduit systems. Flow, solute transport and water ages in karst aquifers are simulated using a few illustrative networks.

Resilient Wireless Sensor Networks Using Topology Control: A Review

PubMed Central

Huang, Yuanjiang; Martínez, José-Fernán; Sendra, Juana; López, Lourdes

2015-01-01

Wireless sensor networks (WSNs) may be deployed in failure-prone environments, and WSNs nodes easily fail due to unreliable wireless connections, malicious attacks and resource-constrained features. Nevertheless, if WSNs can tolerate at most losing k − 1 nodes while the rest of nodes remain connected, the network is called k − connected. k is one of the most important indicators for WSNs’ self-healing capability. Following a WSN design flow, this paper surveys resilience issues from the topology control and multi-path routing point of view. This paper provides a discussion on transmission and failure models, which have an important impact on research results. Afterwards, this paper reviews theoretical results and representative topology control approaches to guarantee WSNs to be k − connected at three different network deployment stages: pre-deployment, post-deployment and re-deployment. Multi-path routing protocols are discussed, and many NP-complete or NP-hard problems regarding topology control are identified. The challenging open issues are discussed at the end. This paper can serve as a guideline to design resilient WSNs. PMID:26404272

A spatial model for a stream networks of Citarik River with the environmental variables: potential of hydrogen (PH) and temperature

NASA Astrophysics Data System (ADS)

Bachrudin, A.; Mohamed, N. B.; Supian, S.; Sukono; Hidayat, Y.

2018-03-01

Application of existing geostatistical theory of stream networks provides a number of interesting and challenging problems. Most of statistical tools in the traditional geostatistics have been based on a Euclidean distance such as autocovariance functions, but for stream data is not permissible since it deals with a stream distance. To overcome this autocovariance developed a model based on the distance the flow with using convolution kernel approach (moving average construction). Spatial model for a stream networks is widely used to monitor environmental on a river networks. In a case study of a river in province of West Java, the objective of this paper is to analyze a capability of a predictive on two environmental variables, potential of hydrogen (PH) and temperature using ordinary kriging. Several the empirical results show: (1) The best fit of autocovariance functions for temperature and potential hydrogen (ph) of Citarik River is linear which also yields the smallest root mean squared prediction error (RMSPE), (2) the spatial correlation values between the locations on upstream and on downstream of Citarik river exhibit decreasingly

Direct lifts of coupled cell networks

NASA Astrophysics Data System (ADS)

Dias, A. P. S.; Moreira, C. S.

2018-04-01

In networks of dynamical systems, there are spaces defined in terms of equalities of cell coordinates which are flow-invariant under any dynamical system that has a form consistent with the given underlying network structure—the network synchrony subspaces. Given a network and one of its synchrony subspaces, any system with a form consistent with the network, restricted to the synchrony subspace, defines a new system which is consistent with a smaller network, called the quotient network of the original network by the synchrony subspace. Moreover, any system associated with the quotient can be interpreted as the restriction to the synchrony subspace of a system associated with the original network. We call the larger network a lift of the smaller network, and a lift can be interpreted as a result of the cellular splitting of the smaller network. In this paper, we address the question of the uniqueness in this lifting process in terms of the networks’ topologies. A lift G of a given network Q is said to be direct when there are no intermediate lifts of Q between them. We provide necessary and sufficient conditions for a lift of a general network to be direct. Our results characterize direct lifts using the subnetworks of all splitting cells of Q and of all split cells of G. We show that G is a direct lift of Q if and only if either the split subnetwork is a direct lift or consists of two copies of the splitting subnetwork. These results are then applied to the class of regular uniform networks and to the special classes of ring networks and acyclic networks. We also illustrate that one of the applications of our results is to the lifting bifurcation problem.

User's Guide for Mixed-Size Sediment Transport Model for Networks of One-Dimensional Open Channels

USGS Publications Warehouse

Bennett, James P.

2001-01-01

This user's guide describes a mathematical model for predicting the transport of mixed sizes of sediment by flow in networks of one-dimensional open channels. The simulation package is useful for general sediment routing problems, prediction of erosion and deposition following dam removal, and scour in channels at road embankment crossings or other artificial structures. The model treats input hydrographs as stepwise steady-state, and the flow computation algorithm automatically switches between sub- and supercritical flow as dictated by channel geometry and discharge. A variety of boundary conditions including weirs and rating curves may be applied both external and internal to the flow network. The model may be used to compute flow around islands and through multiple openings in embankments, but the network must be 'simple' in the sense that the flow directions in all channels can be specified before simulation commences. The location and shape of channel banks are user specified, and all bedelevation changes take place between these banks and above a user-specified bedrock elevation. Computation of sediment-transport emphasizes the sand-size range (0.0625-2.0 millimeter) but the user may select any desired range of particle diameters including silt and finer (<0.0625 millimeter). As part of data input, the user may set the original bed-sediment composition of any number of layers of known thickness. The model computes the time evolution of total transport and the size composition of bed- and suspended-load sand through any cross section of interest. It also tracks bed -surface elevation and size composition. The model is written in the FORTRAN programming language for implementation on personal computers using the WINDOWS operating system and, along with certain graphical output display capability, is accessed from a graphical user interface (GUI). The GUI provides a framework for selecting input files and parameters of a number of components of the sediment-transport process. There are no restrictions in the use of the model as to numbers of channels, channel junctions, cross sections per channel, or points defining the cross sections. Following completion of the simulation computations, the GUI accommodates display of longitudinal plots of either bed elevation and size composition, or of transport rate and size composition of the various components, for individual channels and selected times during the simulation period. For individual cross sections, the GUI also allows display of time series of transport rate and size composition of the various components and of bed elevation and size composition.

Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks

PubMed Central

Artuñedo, Antonio; del Toro, Raúl M.; Haber, Rodolfo E.

2017-01-01

Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller (TLC) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks. PMID:28445398

Consensus-Based Cooperative Control Based on Pollution Sensing and Traffic Information for Urban Traffic Networks.

PubMed

Artuñedo, Antonio; Del Toro, Raúl M; Haber, Rodolfo E

2017-04-26

Nowadays many studies are being conducted to develop solutions for improving the performance of urban traffic networks. One of the main challenges is the necessary cooperation among different entities such as vehicles or infrastructure systems and how to exploit the information available through networks of sensors deployed as infrastructures for smart cities. In this work an algorithm for cooperative control of urban subsystems is proposed to provide a solution for mobility problems in cities. The interconnected traffic lights controller ( TLC ) network adapts traffic lights cycles, based on traffic and air pollution sensory information, in order to improve the performance of urban traffic networks. The presence of air pollution in cities is not only caused by road traffic but there are other pollution sources that contribute to increase or decrease the pollution level. Due to the distributed and heterogeneous nature of the different components involved, a system of systems engineering approach is applied to design a consensus-based control algorithm. The designed control strategy contains a consensus-based component that uses the information shared in the network for reaching a consensus in the state of TLC network components. Discrete event systems specification is applied for modelling and simulation. The proposed solution is assessed by simulation studies with very promising results to deal with simultaneous responses to both pollution levels and traffic flows in urban traffic networks.

Development of automated system based on neural network algorithm for detecting defects on molds installed on casting machines

NASA Astrophysics Data System (ADS)

Bazhin, V. Yu; Danilov, I. V.; Petrov, P. A.

2018-05-01

During the casting of light alloys and ligatures based on aluminum and magnesium, problems of the qualitative distribution of the metal and its crystallization in the mold arise. To monitor the defects of molds on the casting conveyor, a camera with a resolution of 780 x 580 pixels and a shooting rate of 75 frames per second was selected. Images of molds from casting machines were used as input data for neural network algorithm. On the preparation of a digital database and its analytical evaluation stage, the architecture of the convolutional neural network was chosen for the algorithm. The information flow from the local controller is transferred to the OPC server and then to the SCADA system of foundry. After the training, accuracy of neural network defect recognition was about 95.1% on a validation split. After the training, weight coefficients of the neural network were used on testing split and algorithm had identical accuracy with validation images. The proposed technical solutions make it possible to increase the efficiency of the automated process control system in the foundry by expanding the digital database.

MaxEnt analysis of a water distribution network in Canberra, ACT, Australia

NASA Astrophysics Data System (ADS)

Waldrip, Steven H.; Niven, Robert K.; Abel, Markus; Schlegel, Michael; Noack, Bernd R.

2015-01-01

A maximum entropy (MaxEnt) method is developed to infer the state of a pipe flow network, for situations in which there is insufficient information to form a closed equation set. This approach substantially extends existing deterministic methods for the analysis of engineered flow networks (e.g. Newton's method or the Hardy Cross scheme). The network is represented as an undirected graph structure, in which the uncertainty is represented by a continuous relative entropy on the space of internal and external flow rates. The head losses (potential differences) on the network are treated as dependent variables, using specified pipe-flow resistance functions. The entropy is maximised subject to "observable" constraints on the mean values of certain flow rates and/or potential differences, and also "physical" constraints arising from the frictional properties of each pipe and from Kirchhoff's nodal and loop laws. A numerical method is developed in Matlab for solution of the integral equation system, based on multidimensional quadrature. Several nonlinear resistance functions (e.g. power-law and Colebrook) are investigated, necessitating numerical solution of the implicit Lagrangian by a double iteration scheme. The method is applied to a 1123-node, 1140-pipe water distribution network for the suburb of Torrens in the Australian Capital Territory, Australia, using network data supplied by water authority ACTEW Corporation Limited. A number of different assumptions are explored, including various network geometric representations, prior probabilities and constraint settings, yielding useful predictions of network demand and performance. We also propose this methodology be used in conjunction with in-flow monitoring systems, to obtain better inferences of user consumption without large investments in monitoring equipment and maintenance.

Evaluation of the streamflow-gaging network of Alaska in providing regional streamflow information

USGS Publications Warehouse

Brabets, Timothy P.

1996-01-01

In 1906, the U.S. Geological Survey (USGS) began operating a network of streamflow-gaging stations in Alaska. The primary purpose of the streamflow- gaging network has been to provide peak flow, average flow, and low-flow characteristics to a variety of users. In 1993, the USGS began a study to evaluate the current network of 78 stations. The objectives of this study were to determine the adequacy of the existing network in predicting selected regional flow characteristics and to determine if providing additional streamflow-gaging stations could improve the network's ability to predict these characteristics. Alaska was divided into six distinct hydrologic regions: Arctic, Northwest, Southcentral, Southeast, Southwest, and Yukon. For each region, historical and current streamflow data were compiled. In Arctic, Northwest, and Southwest Alaska, insufficient data were available to develop regional regression equations. In these areas, proposed locations of streamflow-gaging stations were selected by using clustering techniques to define similar areas within a region and by spatial visual analysis using the precipitation, physiographic, and hydrologic unit maps of Alaska. Sufficient data existed in Southcentral and Southeast Alaska to use generalized least squares (GLS) procedures to develop regional regression equations to estimate the 50-year peak flow, annual average flow, and a low-flow statistic. GLS procedures were also used for Yukon Alaska but the results should be used with caution because the data do not have an adequate spatial distribution. Network analysis procedures were used for the Southcentral, Southeast, and Yukon regions. Network analysis indicates the reduction in the sampling error of the regional regression equation that can be obtained given different scenarios. For Alaska, a 10-year planning period was used. One scenario showed the results of continuing the current network with no additional gaging stations and another scenario showed the results of adding gaging stations to the network. With the exception of the annual average discharge equation for Southeast Alaska, by adding gaging stations in all three regions, the sampling error was reduced to a greater extent than by not adding gaging stations. The proposed streamflow-gaging network for Alaska consists of 308 gaging stations, of which 32 are designated as index stations. If the proposed network can not be implemented in its entirety, then a lesser cost alternative would be to establish the index stations and to implement the network for a particular region.

Extreme learning machine for reduced order modeling of turbulent geophysical flows.

PubMed

San, Omer; Maulik, Romit

2018-04-01

We investigate the application of artificial neural networks to stabilize proper orthogonal decomposition-based reduced order models for quasistationary geophysical turbulent flows. An extreme learning machine concept is introduced for computing an eddy-viscosity closure dynamically to incorporate the effects of the truncated modes. We consider a four-gyre wind-driven ocean circulation problem as our prototype setting to assess the performance of the proposed data-driven approach. Our framework provides a significant reduction in computational time and effectively retains the dynamics of the full-order model during the forward simulation period beyond the training data set. Furthermore, we show that the method is robust for larger choices of time steps and can be used as an efficient and reliable tool for long time integration of general circulation models.

Solving Problems With SINDA/FLUINT

NASA Technical Reports Server (NTRS)

2002-01-01

SINDA/FLUINT, the NASA standard software system for thermohydraulic analysis, provides computational simulation of interacting thermal and fluid effects in designs modeled as heat transfer and fluid flow networks. The product saves time and money by making the user's design process faster and easier, and allowing the user to gain a better understanding of complex systems. The code is completely extensible, allowing the user to choose the features, accuracy and approximation levels, and outputs. Users can also add their own customizations as needed to handle unique design tasks or to automate repetitive tasks. Applications for SINDA/FLUINT include the pharmaceutical, petrochemical, biomedical, electronics, and energy industries. The system has been used to simulate nuclear reactors, windshield wipers, and human windpipes. In the automotive industry, it simulates the transient liquid/vapor flows within air conditioning systems.

Extreme learning machine for reduced order modeling of turbulent geophysical flows

NASA Astrophysics Data System (ADS)

San, Omer; Maulik, Romit

2018-04-01

We investigate the application of artificial neural networks to stabilize proper orthogonal decomposition-based reduced order models for quasistationary geophysical turbulent flows. An extreme learning machine concept is introduced for computing an eddy-viscosity closure dynamically to incorporate the effects of the truncated modes. We consider a four-gyre wind-driven ocean circulation problem as our prototype setting to assess the performance of the proposed data-driven approach. Our framework provides a significant reduction in computational time and effectively retains the dynamics of the full-order model during the forward simulation period beyond the training data set. Furthermore, we show that the method is robust for larger choices of time steps and can be used as an efficient and reliable tool for long time integration of general circulation models.

Physics Applied to Oil and Gas Exploration

NASA Astrophysics Data System (ADS)

Schwartz, Larry

2002-03-01

Problems involving transport in porous media are of interest throughout the fields of petroleum exploration and environmental monitoring and remediation. The systems being studied can vary in size from centimeter scale rock or soil samples to kilometer scale reservoirs and aquifers. Clearly, the smaller the sample the more easily can the medium's structure and composition be characterized, and the better defined are the associated experimental and theoretical modeling problems. The study of transport in such geological systems is then similar to corresponding problems in the study of other heterogeneous systems such as polymer gels, catalytic beds and cementitious materials. The defining characteristic of porous media is that they are comprised of two percolating interconnected channels, the solid and pore networks. Transport processes of interest in such systems typically involve the flow of electrical current, viscous fluids or fine grained particles. A closely related phenomena, nuclear magnetic resonance (NMR), is controlled by diffusion in the pore network. Also of interest is the highly non-linear character of the stress-strain response of granular porous media. We will review the development of two and three dimensional model porous media, and will outline the calculation of their physical properties. We will also discuss the direct measurement of the pore structure by synchrotron X-ray microtomography.

Communication networks, soap films and vectors

NASA Astrophysics Data System (ADS)

Clark, R. C.

1981-01-01

The problem of constructing the least-cost network of connections between arbitrarily placed points is one that is common and which can be very important financially. The network may consist of motorways between towns, a grid of electric power lines, buried gas or oil pipe lines or telephone cables. Soap films trapped between parallel planes with vertical pins between them provide a 'shortest path' network and Isenberg (1975) has suggested that soap films of this sort be used to model communication networks. However soap films are unable to simulate the different costs of laying, say, a three-lane motorway instead of a two-lane one or of using a larger pipeline to take the flow from two smaller ones. Soap films, however, have considerable intrinsic interest. In the article the emphasis is on the use of soap films and communication networks as a practical means of illustrating the importance of vector and matrix methods in geometry. The power of vector methods is illustrated by the fact that given any soap film network the total length of the film can be written down by inspection if the vector positions of the pins are known. It is also possible to predict the boundaries at which 'catastrophes' occur and to decide which network has the least total length. In the field of communication networks a method is given of designing the minimum cost network linking, say, a number of oilwells, which produce at different rates to an outlet terminal.

Dynamic autonomous routing technology for IP-based satellite ad hoc networks

NASA Astrophysics Data System (ADS)

Wang, Xiaofei; Deng, Jing; Kostas, Theresa; Rajappan, Gowri

2014-06-01

IP-based routing for military LEO/MEO satellite ad hoc networks is very challenging due to network and traffic heterogeneity, network topology and traffic dynamics. In this paper, we describe a traffic priority-aware routing scheme for such networks, namely Dynamic Autonomous Routing Technology (DART) for satellite ad hoc networks. DART has a cross-layer design, and conducts routing and resource reservation concurrently for optimal performance in the fluid but predictable satellite ad hoc networks. DART ensures end-to-end data delivery with QoS assurances by only choosing routing paths that have sufficient resources, supporting different packet priority levels. In order to do so, DART incorporates several resource management and innovative routing mechanisms, which dynamically adapt to best fit the prevailing conditions. In particular, DART integrates a resource reservation mechanism to reserve network bandwidth resources; a proactive routing mechanism to set up non-overlapping spanning trees to segregate high priority traffic flows from lower priority flows so that the high priority flows do not face contention from low priority flows; a reactive routing mechanism to arbitrate resources between various traffic priorities when needed; a predictive routing mechanism to set up routes for scheduled missions and for anticipated topology changes for QoS assurance. We present simulation results showing the performance of DART. We have conducted these simulations using the Iridium constellation and trajectories as well as realistic military communications scenarios. The simulation results demonstrate DART's ability to discriminate between high-priority and low-priority traffic flows and ensure disparate QoS requirements of these traffic flows.

A model for simulation of flow in singular and interconnected channels

USGS Publications Warehouse

Schaffranek, Raymond W.; Baltzer, R.A.; Goldberg, D.E.

1981-01-01

A one-dimensional numerical model is presented for simulating the unsteady flow in singular riverine or estuarine reaches and in networks of reaches composed of interconnected channels. The model is both general and flexible in that it can be used to simulate a wide range of flow conditions for various channel configurations. The channel geometry of the network to be modeled should be sufficiently simple so as to lend itself to characterization in one spatial dimension. The flow must be substantially homogenous in density, and hydrostatic pressure must prevail everywhere in the network channels. The slope of each channel bottom ought to be mild and reasonably constant over its length so that the flow remains subcritical. The model accommodates tributary inflows and diversions and includes the effects of wind shear on the water surface as a forcing function in the flow equations. Water-surface elevations and flow discharges are computed at channel junctions, as well as at specified intermediate locations within the network channels. The one-dimensional branch-network flow model uses a four-point, implicit, finite-difference approximation of the unsteady-flow equations. The flow equations are linearized over a time step, and branch transformations are formulated that describe the relationship between the unknowns at the end points of the channels. The resultant matrix of branch-transformation equations and required boundary-condition equations is solved by Gaussian elimination using maximum pivot strategy. Five example applications of the flow model are illustrated. The applications cover such diverse conditions as a singular upland river reach in which unsteady flow results from hydropower regulations, coastal rivers composed of sequentially connected reaches subject to unsteady tide-driven flow, and a multiply connected network of channels whose flow is principally governed by wind tides and seiches in adjoining lakes. The report includes a listing of the FORTRAN IV computer program and a description of the input data requirements. Model supporting programs for the processing and input of initial and boundary-value data are identified, various model output formats are illustrated, and instructions are given to permit the production of graphical output using the line printer, electromechanical pen plotters, cathode-ray-tube display units, or microfilm recorders.

The Predictive Capability of Conditioned Simulation of Discrete Fracture Networks using Structural and Hydraulic Data from the ONKALO Underground Research Facility, Finland

NASA Astrophysics Data System (ADS)

Williams, T. R. N.; Baxter, S.; Hartley, L.; Appleyard, P.; Koskinen, L.; Vanhanarkaus, O.; Selroos, J. O.; Munier, R.

2017-12-01

Discrete fracture network (DFN) models provide a natural analysis framework for rock conditions where flow is predominately through a series of connected discrete features. Mechanistic models to predict the structural patterns of networks are generally intractable due to inherent uncertainties (e.g. deformation history) and as such fracture characterisation typically involves empirical descriptions of fracture statistics for location, intensity, orientation, size, aperture etc. from analyses of field data. These DFN models are used to make probabilistic predictions of likely flow or solute transport conditions for a range of applications in underground resource and construction projects. However, there are many instances when the volumes in which predictions are most valuable are close to data sources. For example, in the disposal of hazardous materials such as radioactive waste, accurate predictions of flow-rates and network connectivity around disposal areas are required for long-term safety evaluation. The problem at hand is thus: how can probabilistic predictions be conditioned on local-scale measurements? This presentation demonstrates conditioning of a DFN model based on the current structural and hydraulic characterisation of the Demonstration Area at the ONKALO underground research facility. The conditioned realisations honour (to a required level of similarity) the locations, orientations and trace lengths of fractures mapped on the surfaces of the nearby ONKALO tunnels and pilot drillholes. Other data used as constraints include measurements from hydraulic injection tests performed in pilot drillholes and inflows to the subsequently reamed experimental deposition holes. Numerical simulations using this suite of conditioned DFN models provides a series of prediction-outcome exercises detailing the reliability of the DFN model to make local-scale predictions of measured geometric and hydraulic properties of the fracture system; and provides an understanding of the reduction in uncertainty in model predictions for conditioned DFN models honouring different aspects of this data.

Energy optimization in mobile sensor networks

NASA Astrophysics Data System (ADS)

Yu, Shengwei

Mobile sensor networks are considered to consist of a network of mobile robots, each of which has computation, communication and sensing capabilities. Energy efficiency is a critical issue in mobile sensor networks, especially when mobility (i.e., locomotion control), routing (i.e., communications) and sensing are unique characteristics of mobile robots for energy optimization. This thesis focuses on the problem of energy optimization of mobile robotic sensor networks, and the research results can be extended to energy optimization of a network of mobile robots that monitors the environment, or a team of mobile robots that transports materials from stations to stations in a manufacturing environment. On the energy optimization of mobile robotic sensor networks, our research focuses on the investigation and development of distributed optimization algorithms to exploit the mobility of robotic sensor nodes for network lifetime maximization. In particular, the thesis studies these five problems: 1. Network-lifetime maximization by controlling positions of networked mobile sensor robots based on local information with distributed optimization algorithms; 2. Lifetime maximization of mobile sensor networks with energy harvesting modules; 3. Lifetime maximization using joint design of mobility and routing; 4. Optimal control for network energy minimization; 5. Network lifetime maximization in mobile visual sensor networks. In addressing the first problem, we consider only the mobility strategies of the robotic relay nodes in a mobile sensor network in order to maximize its network lifetime. By using variable substitutions, the original problem is converted into a convex problem, and a variant of the sub-gradient method for saddle-point computation is developed for solving this problem. An optimal solution is obtained by the method. Computer simulations show that mobility of robotic sensors can significantly prolong the lifetime of the whole robotic sensor network while consuming negligible amount of energy for mobility cost. For the second problem, the problem is extended to accommodate mobile robotic nodes with energy harvesting capability, which makes it a non-convex optimization problem. The non-convexity issue is tackled by using the existing sequential convex approximation method, based on which we propose a novel procedure of modified sequential convex approximation that has fast convergence speed. For the third problem, the proposed procedure is used to solve another challenging non-convex problem, which results in utilizing mobility and routing simultaneously in mobile robotic sensor networks to prolong the network lifetime. The results indicate that joint design of mobility and routing has an edge over other methods in prolonging network lifetime, which is also the justification for the use of mobility in mobile sensor networks for energy efficiency purpose. For the fourth problem, we include the dynamics of the robotic nodes in the problem by modeling the networked robotic system using hybrid systems theory. A novel distributed method for the networked hybrid system is used to solve the optimal moving trajectories for robotic nodes and optimal network links, which are not answered by previous approaches. Finally, the fact that mobility is more effective in prolonging network lifetime for a data-intensive network leads us to apply our methods to study mobile visual sensor networks, which are useful in many applications. We investigate the joint design of mobility, data routing, and encoding power to help improving the video quality while maximizing the network lifetime. This study leads to a better understanding of the role mobility can play in data-intensive surveillance sensor networks.

Flow motifs reveal limitations of the static framework to represent human interactions

NASA Astrophysics Data System (ADS)

Rocha, Luis E. C.; Blondel, Vincent D.

2013-04-01

Networks are commonly used to define underlying interaction structures where infections, information, or other quantities may spread. Although the standard approach has been to aggregate all links into a static structure, some studies have shown that the time order in which the links are established may alter the dynamics of spreading. In this paper, we study the impact of the time ordering in the limits of flow on various empirical temporal networks. By using a random walk dynamics, we estimate the flow on links and convert the original undirected network (temporal and static) into a directed flow network. We then introduce the concept of flow motifs and quantify the divergence in the representativity of motifs when using the temporal and static frameworks. We find that the regularity of contacts and persistence of vertices (common in email communication and face-to-face interactions) result on little differences in the limits of flow for both frameworks. On the other hand, in the case of communication within a dating site and of a sexual network, the flow between vertices changes significantly in the temporal framework such that the static approximation poorly represents the structure of contacts. We have also observed that cliques with 3 and 4 vertices containing only low-flow links are more represented than the same cliques with all high-flow links. The representativity of these low-flow cliques is higher in the temporal framework. Our results suggest that the flow between vertices connected in cliques depend on the topological context in which they are placed and in the time sequence in which the links are established. The structure of the clique alone does not completely characterize the potential of flow between the vertices.

The influence of passenger flow on the topology characteristics of urban rail transit networks

NASA Astrophysics Data System (ADS)

Hu, Yingyue; Chen, Feng; Chen, Peiwen; Tan, Yurong

2017-05-01

Current researches on the network characteristics of metro networks are generally carried out on topology networks without passenger flows running on it, thus more complex features of the networks with ridership loaded on it cannot be captured. In this study, we incorporated the load of metro networks, passenger volume, into the exploration of network features. Thus, the network can be examined in the context of operation, which is the ultimate purpose of the existence of a metro network. To this end, section load was selected as an edge weight to demonstrate the influence of ridership on the network, and a weighted calculation method for complex network indicators and robustness were proposed to capture the unique behaviors of a metro network with passengers flowing in it. The proposed method was applied on Beijing Subway. Firstly, the passenger volume in terms of daily origin and destination matrix was extracted from exhausted transit smart card data. Using the established approach and the matrix as weighting, common indicators of complex network including clustering coefficient, betweenness and degree were calculated, and network robustness were evaluated under potential attacks. The results were further compared to that of unweighted networks, and it suggests indicators of the network with consideration of passenger volumes differ from that without ridership to some extent, and networks tend to be more vulnerable than that without load on it. The significance sequence for the stations can be changed. By introducing passenger flow weighting, actual operation status of the network can be reflected more accurately. It is beneficial to determine the crucial stations and make precautionary measures for the entire network’s operation security.

OpenFlow arbitrated programmable network channels for managing quantum metadata

DOE PAGES

Dasari, Venkat R.; Humble, Travis S.

2016-10-10

Quantum networks must classically exchange complex metadata between devices in order to carry out information for protocols such as teleportation, super-dense coding, and quantum key distribution. Demonstrating the integration of these new communication methods with existing network protocols, channels, and data forwarding mechanisms remains an open challenge. Software-defined networking (SDN) offers robust and flexible strategies for managing diverse network devices and uses. We adapt the principles of SDN to the deployment of quantum networks, which are composed from unique devices that operate according to the laws of quantum mechanics. We show how quantum metadata can be managed within a software-definedmore » network using the OpenFlow protocol, and we describe how OpenFlow management of classical optical channels is compatible with emerging quantum communication protocols. We next give an example specification of the metadata needed to manage and control quantum physical layer (QPHY) behavior and we extend the OpenFlow interface to accommodate this quantum metadata. Here, we conclude by discussing near-term experimental efforts that can realize SDN’s principles for quantum communication.« less

OpenFlow arbitrated programmable network channels for managing quantum metadata

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dasari, Venkat R.; Humble, Travis S.

Quantum networks must classically exchange complex metadata between devices in order to carry out information for protocols such as teleportation, super-dense coding, and quantum key distribution. Demonstrating the integration of these new communication methods with existing network protocols, channels, and data forwarding mechanisms remains an open challenge. Software-defined networking (SDN) offers robust and flexible strategies for managing diverse network devices and uses. We adapt the principles of SDN to the deployment of quantum networks, which are composed from unique devices that operate according to the laws of quantum mechanics. We show how quantum metadata can be managed within a software-definedmore » network using the OpenFlow protocol, and we describe how OpenFlow management of classical optical channels is compatible with emerging quantum communication protocols. We next give an example specification of the metadata needed to manage and control quantum physical layer (QPHY) behavior and we extend the OpenFlow interface to accommodate this quantum metadata. Here, we conclude by discussing near-term experimental efforts that can realize SDN’s principles for quantum communication.« less

Random network peristalsis in Physarum polycephalum organizes fluid flows across an individual

PubMed Central

Alim, Karen; Amselem, Gabriel; Peaudecerf, François; Brenner, Michael P.; Pringle, Anne

2013-01-01

Individuals can function as integrated organisms only when information and resources are shared across a body. Signals and substrates are commonly moved using fluids, often channeled through a network of tubes. Peristalsis is one mechanism for fluid transport and is caused by a wave of cross-sectional contractions along a tube. We extend the concept of peristalsis from the canonical case of one tube to a random network. Transport is maximized within the network when the wavelength of the peristaltic wave is of the order of the size of the network. The slime mold Physarum polycephalum grows as a random network of tubes, and our experiments confirm peristalsis is used by the slime mold to drive internal cytoplasmic flows. Comparisons of theoretically generated contraction patterns with the patterns exhibited by individuals of P. polycephalum demonstrate that individuals maximize internal flows by adapting patterns of contraction to size, thus optimizing transport throughout an organism. This control of fluid flow may be the key to coordinating growth and behavior, including the dynamic changes in network architecture seen over time in an individual. PMID:23898203

Random network peristalsis in Physarum polycephalum organizes fluid flows across an individual.

PubMed

Alim, Karen; Amselem, Gabriel; Peaudecerf, François; Brenner, Michael P; Pringle, Anne

2013-08-13

Individuals can function as integrated organisms only when information and resources are shared across a body. Signals and substrates are commonly moved using fluids, often channeled through a network of tubes. Peristalsis is one mechanism for fluid transport and is caused by a wave of cross-sectional contractions along a tube. We extend the concept of peristalsis from the canonical case of one tube to a random network. Transport is maximized within the network when the wavelength of the peristaltic wave is of the order of the size of the network. The slime mold Physarum polycephalum grows as a random network of tubes, and our experiments confirm peristalsis is used by the slime mold to drive internal cytoplasmic flows. Comparisons of theoretically generated contraction patterns with the patterns exhibited by individuals of P. polycephalum demonstrate that individuals maximize internal flows by adapting patterns of contraction to size, thus optimizing transport throughout an organism. This control of fluid flow may be the key to coordinating growth and behavior, including the dynamic changes in network architecture seen over time in an individual.

The Role of Surface Water for the Branching Geometry of Mars' Channel Networks

NASA Astrophysics Data System (ADS)

Seybold, H. F.; Rothman, D.; Kirchner, J. W.

2016-12-01

The controversy over the origin of Mars' channel networks is almost as old as their discovery 150 years ago. In recent decades, new Mars probe missions have revealed detailed network structures, and new studies suggest that Mars once had an active hydrologic cycle. But how this water flowed and how it could have carved these huge channel networks remains unclear. A recent analysis of high-resolution data for the Continental United States suggests that climate leaves a characteristic imprint in the branching geometry of stream networks: arid regions dominated by overland or near-surface flows have much narrower branching angles than humid regions with greater groundwater recharge. Based on this result we analyze the channel networks of Mars, and find that their geometry resembles those created by near-surface and overland flows on Earth. This result gives additional support to the hypothesis that Mars once had a more active hydrologic cycle, with liquid water flowing over its surface.

A distributed predictive control approach for periodic flow-based networks: application to drinking water systems

NASA Astrophysics Data System (ADS)

Grosso, Juan M.; Ocampo-Martinez, Carlos; Puig, Vicenç

2017-10-01

This paper proposes a distributed model predictive control approach designed to work in a cooperative manner for controlling flow-based networks showing periodic behaviours. Under this distributed approach, local controllers cooperate in order to enhance the performance of the whole flow network avoiding the use of a coordination layer. Alternatively, controllers use both the monolithic model of the network and the given global cost function to optimise the control inputs of the local controllers but taking into account the effect of their decisions over the remainder subsystems conforming the entire network. In this sense, a global (all-to-all) communication strategy is considered. Although the Pareto optimality cannot be reached due to the existence of non-sparse coupling constraints, the asymptotic convergence to a Nash equilibrium is guaranteed. The resultant strategy is tested and its effectiveness is shown when applied to a large-scale complex flow-based network: the Barcelona drinking water supply system.

Variable disparity estimation based intermediate view reconstruction in dynamic flow allocation over EPON-based access networks

NASA Astrophysics Data System (ADS)

Bae, Kyung-Hoon; Lee, Jungjoon; Kim, Eun-Soo

2008-06-01

In this paper, a variable disparity estimation (VDE)-based intermediate view reconstruction (IVR) in dynamic flow allocation (DFA) over an Ethernet passive optical network (EPON)-based access network is proposed. In the proposed system, the stereoscopic images are estimated by a variable block-matching algorithm (VBMA), and they are transmitted to the receiver through DFA over EPON. This scheme improves a priority-based access network by converting it to a flow-based access network with a new access mechanism and scheduling algorithm, and then 16-view images are synthesized by the IVR using VDE. Some experimental results indicate that the proposed system improves the peak-signal-to-noise ratio (PSNR) to as high as 4.86 dB and reduces the processing time to 3.52 s. Additionally, the network service provider can provide upper limits of transmission delays by the flow. The modeling and simulation results, including mathematical analyses, from this scheme are also provided.

Activity flow over resting-state networks shapes cognitive task activations.

PubMed

Cole, Michael W; Ito, Takuya; Bassett, Danielle S; Schultz, Douglas H

2016-12-01

Resting-state functional connectivity (FC) has helped reveal the intrinsic network organization of the human brain, yet its relevance to cognitive task activations has been unclear. Uncertainty remains despite evidence that resting-state FC patterns are highly similar to cognitive task activation patterns. Identifying the distributed processes that shape localized cognitive task activations may help reveal why resting-state FC is so strongly related to cognitive task activations. We found that estimating task-evoked activity flow (the spread of activation amplitudes) over resting-state FC networks allowed prediction of cognitive task activations in a large-scale neural network model. Applying this insight to empirical functional MRI data, we found that cognitive task activations can be predicted in held-out brain regions (and held-out individuals) via estimated activity flow over resting-state FC networks. This suggests that task-evoked activity flow over intrinsic networks is a large-scale mechanism explaining the relevance of resting-state FC to cognitive task activations.

Activity flow over resting-state networks shapes cognitive task activations

PubMed Central

Cole, Michael W.; Ito, Takuya; Bassett, Danielle S.; Schultz, Douglas H.

2016-01-01

Resting-state functional connectivity (FC) has helped reveal the intrinsic network organization of the human brain, yet its relevance to cognitive task activations has been unclear. Uncertainty remains despite evidence that resting-state FC patterns are highly similar to cognitive task activation patterns. Identifying the distributed processes that shape localized cognitive task activations may help reveal why resting-state FC is so strongly related to cognitive task activations. We found that estimating task-evoked activity flow (the spread of activation amplitudes) over resting-state FC networks allows prediction of cognitive task activations in a large-scale neural network model. Applying this insight to empirical functional MRI data, we found that cognitive task activations can be predicted in held-out brain regions (and held-out individuals) via estimated activity flow over resting-state FC networks. This suggests that task-evoked activity flow over intrinsic networks is a large-scale mechanism explaining the relevance of resting-state FC to cognitive task activations. PMID:27723746

Self-organization and solution of shortest-path optimization problems with memristive networks

NASA Astrophysics Data System (ADS)

Pershin, Yuriy V.; Di Ventra, Massimiliano

2013-07-01

We show that memristive networks, namely networks of resistors with memory, can efficiently solve shortest-path optimization problems. Indeed, the presence of memory (time nonlocality) promotes self organization of the network into the shortest possible path(s). We introduce a network entropy function to characterize the self-organized evolution, show the solution of the shortest-path problem and demonstrate the healing property of the solution path. Finally, we provide an algorithm to solve the traveling salesman problem. Similar considerations apply to networks of memcapacitors and meminductors, and networks with memory in various dimensions.