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

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.

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.

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.

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.

Implementation of Finite Volume based Navier Stokes Algorithm Within General Purpose Flow Network Code

NASA Technical Reports Server (NTRS)

Schallhorn, Paul; Majumdar, Alok

2012-01-01

This paper describes a finite volume based numerical algorithm that allows multi-dimensional computation of fluid flow within a system level network flow analysis. There are several thermo-fluid engineering problems where higher fidelity solutions are needed that are not within the capacity of system level codes. The proposed algorithm will allow NASA's Generalized Fluid System Simulation Program (GFSSP) to perform multi-dimensional flow calculation within the framework of GFSSP s typical system level flow network consisting of fluid nodes and branches. The paper presents several classical two-dimensional fluid dynamics problems that have been solved by GFSSP's multi-dimensional flow solver. The numerical solutions are compared with the analytical and benchmark solution of Poiseulle, Couette and flow in a driven cavity.

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

Predicting commuter flows in spatial networks using a radiation model based on temporal ranges

NASA Astrophysics Data System (ADS)

Ren, Yihui; Ercsey-Ravasz, Mária; Wang, Pu; González, Marta C.; Toroczkai, Zoltán

2014-11-01

Understanding network flows such as commuter traffic in large transportation networks is an ongoing challenge due to the complex nature of the transportation infrastructure and human mobility. Here we show a first-principles based method for traffic prediction using a cost-based generalization of the radiation 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. 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.

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.

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

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

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

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...

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.

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.

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.

Flow-Based Network Analysis of the Caenorhabditis elegans Connectome

PubMed Central

Bacik, Karol A.; Schaub, Michael T.; Billeh, Yazan N.; Barahona, Mauricio

2016-01-01

We exploit flow propagation on the directed neuronal network of the nematode C. elegans to reveal dynamically relevant features of its connectome. We find flow-based groupings of neurons at different levels of granularity, which we relate to functional and anatomical constituents of its nervous system. A systematic in silico evaluation of the full set of single and double neuron ablations is used to identify deletions that induce the most severe disruptions of the multi-resolution flow structure. Such ablations are linked to functionally relevant neurons, and suggest potential candidates for further in vivo investigation. In addition, we use the directional patterns of incoming and outgoing network flows at all scales to identify flow profiles for the neurons in the connectome, without pre-imposing a priori categories. The four flow roles identified are linked to signal propagation motivated by biological input-response scenarios. PMID:27494178

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.

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.

Computing the Envelope for Stepwise Constant Resource Allocations

NASA Technical Reports Server (NTRS)

Muscettola, Nicola; Clancy, Daniel (Technical Monitor)

2001-01-01

Estimating tight resource level is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with noises equal to the events and edges equal to the necessary predecessor links between events. The incremental solution of a staged maximum flow problem on the network is then used to compute the time of occurrence and the height of each step of the resource envelope profile. The staged algorithm has the same computational complexity of solving a maximum flow problem on the entire flow network. This makes this method computationally feasible for use in the inner loop of search-based scheduling algorithms.

NeuroFlow: A General Purpose Spiking Neural Network Simulation Platform using Customizable Processors.

PubMed

Cheung, Kit; Schultz, Simon R; Luk, Wayne

2015-01-01

NeuroFlow is a scalable spiking neural network simulation platform for off-the-shelf high performance computing systems using customizable hardware processors such as Field-Programmable Gate Arrays (FPGAs). Unlike multi-core processors and application-specific integrated circuits, the processor architecture of NeuroFlow can be redesigned and reconfigured to suit a particular simulation to deliver optimized performance, such as the degree of parallelism to employ. The compilation process supports using PyNN, a simulator-independent neural network description language, to configure the processor. NeuroFlow supports a number of commonly used current or conductance based neuronal models such as integrate-and-fire and Izhikevich models, and the spike-timing-dependent plasticity (STDP) rule for learning. A 6-FPGA system can simulate a network of up to ~600,000 neurons and can achieve a real-time performance of 400,000 neurons. Using one FPGA, NeuroFlow delivers a speedup of up to 33.6 times the speed of an 8-core processor, or 2.83 times the speed of GPU-based platforms. With high flexibility and throughput, NeuroFlow provides a viable environment for large-scale neural network simulation.

NeuroFlow: A General Purpose Spiking Neural Network Simulation Platform using Customizable Processors

PubMed Central

Cheung, Kit; Schultz, Simon R.; Luk, Wayne

2016-01-01

NeuroFlow is a scalable spiking neural network simulation platform for off-the-shelf high performance computing systems using customizable hardware processors such as Field-Programmable Gate Arrays (FPGAs). Unlike multi-core processors and application-specific integrated circuits, the processor architecture of NeuroFlow can be redesigned and reconfigured to suit a particular simulation to deliver optimized performance, such as the degree of parallelism to employ. The compilation process supports using PyNN, a simulator-independent neural network description language, to configure the processor. NeuroFlow supports a number of commonly used current or conductance based neuronal models such as integrate-and-fire and Izhikevich models, and the spike-timing-dependent plasticity (STDP) rule for learning. A 6-FPGA system can simulate a network of up to ~600,000 neurons and can achieve a real-time performance of 400,000 neurons. Using one FPGA, NeuroFlow delivers a speedup of up to 33.6 times the speed of an 8-core processor, or 2.83 times the speed of GPU-based platforms. With high flexibility and throughput, NeuroFlow provides a viable environment for large-scale neural network simulation. PMID:26834542

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.

Experimental study of overland flow resistance coefficient model of grassland based on BP neural network

NASA Astrophysics Data System (ADS)

Jiao, Peng; Yang, Er; Ni, Yong Xin

2018-06-01

The overland flow resistance on grassland slope of 20° was studied by using simulated rainfall experiments. Model of overland flow resistance coefficient was established based on BP neural network. The input variations of model were rainfall intensity, flow velocity, water depth, and roughness of slope surface, and the output variations was overland flow resistance coefficient. Model was optimized by Genetic Algorithm. The results show that the model can be used to calculate overland flow resistance coefficient, and has high simulation accuracy. The average prediction error of the optimized model of test set is 8.02%, and the maximum prediction error was 18.34%.

Optimizing Virtual Network Functions Placement in Virtual Data Center Infrastructure Using Machine Learning

NASA Astrophysics Data System (ADS)

Bolodurina, I. P.; Parfenov, D. I.

2018-01-01

We have elaborated a neural network model of virtual network flow identification based on the statistical properties of flows circulating in the network of the data center and characteristics that describe the content of packets transmitted through network objects. This enabled us to establish the optimal set of attributes to identify virtual network functions. We have established an algorithm for optimizing the placement of virtual data functions using the data obtained in our research. Our approach uses a hybrid method of visualization using virtual machines and containers, which enables to reduce the infrastructure load and the response time in the network of the virtual data center. The algorithmic solution is based on neural networks, which enables to scale it at any number of the network function copies.

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.

SACFIR: SDN-Based Application-Aware Centralized Adaptive Flow Iterative Reconfiguring Routing Protocol for WSNs.

PubMed

Aslam, Muhammad; Hu, Xiaopeng; Wang, Fan

2017-12-13

Smart reconfiguration of a dynamic networking environment is offered by the central control of Software-Defined Networking (SDN). Centralized SDN-based management architectures are capable of retrieving global topology intelligence and decoupling the forwarding plane from the control plane. Routing protocols developed for conventional Wireless Sensor Networks (WSNs) utilize limited iterative reconfiguration methods to optimize environmental reporting. However, the challenging networking scenarios of WSNs involve a performance overhead due to constant periodic iterative reconfigurations. In this paper, we propose the SDN-based Application-aware Centralized adaptive Flow Iterative Reconfiguring (SACFIR) routing protocol with the centralized SDN iterative solver controller to maintain the load-balancing between flow reconfigurations and flow allocation cost. The proposed SACFIR's routing protocol offers a unique iterative path-selection algorithm, which initially computes suitable clustering based on residual resources at the control layer and then implements application-aware threshold-based multi-hop report transmissions on the forwarding plane. The operation of the SACFIR algorithm is centrally supervised by the SDN controller residing at the Base Station (BS). This paper extends SACFIR to SDN-based Application-aware Main-value Centralized adaptive Flow Iterative Reconfiguring (SAMCFIR) to establish both proactive and reactive reporting. The SAMCFIR transmission phase enables sensor nodes to trigger direct transmissions for main-value reports, while in the case of SACFIR, all reports follow computed routes. Our SDN-enabled proposed models adjust the reconfiguration period according to the traffic burden on sensor nodes, which results in heterogeneity awareness, load-balancing and application-specific reconfigurations of WSNs. Extensive experimental simulation-based results show that SACFIR and SAMCFIR yield the maximum scalability, network lifetime and stability period when compared to existing routing protocols.

SACFIR: SDN-Based Application-Aware Centralized Adaptive Flow Iterative Reconfiguring Routing Protocol for WSNs

PubMed Central

Hu, Xiaopeng; Wang, Fan

2017-01-01

Smart reconfiguration of a dynamic networking environment is offered by the central control of Software-Defined Networking (SDN). Centralized SDN-based management architectures are capable of retrieving global topology intelligence and decoupling the forwarding plane from the control plane. Routing protocols developed for conventional Wireless Sensor Networks (WSNs) utilize limited iterative reconfiguration methods to optimize environmental reporting. However, the challenging networking scenarios of WSNs involve a performance overhead due to constant periodic iterative reconfigurations. In this paper, we propose the SDN-based Application-aware Centralized adaptive Flow Iterative Reconfiguring (SACFIR) routing protocol with the centralized SDN iterative solver controller to maintain the load-balancing between flow reconfigurations and flow allocation cost. The proposed SACFIR’s routing protocol offers a unique iterative path-selection algorithm, which initially computes suitable clustering based on residual resources at the control layer and then implements application-aware threshold-based multi-hop report transmissions on the forwarding plane. The operation of the SACFIR algorithm is centrally supervised by the SDN controller residing at the Base Station (BS). This paper extends SACFIR to SDN-based Application-aware Main-value Centralized adaptive Flow Iterative Reconfiguring (SAMCFIR) to establish both proactive and reactive reporting. The SAMCFIR transmission phase enables sensor nodes to trigger direct transmissions for main-value reports, while in the case of SACFIR, all reports follow computed routes. Our SDN-enabled proposed models adjust the reconfiguration period according to the traffic burden on sensor nodes, which results in heterogeneity awareness, load-balancing and application-specific reconfigurations of WSNs. Extensive experimental simulation-based results show that SACFIR and SAMCFIR yield the maximum scalability, network lifetime and stability period when compared to existing routing protocols. PMID:29236031

Experimental demonstration of an OpenFlow based software-defined optical network employing packet, fixed and flexible DWDM grid technologies on an international multi-domain testbed.

PubMed

Channegowda, M; Nejabati, R; Rashidi Fard, M; Peng, S; Amaya, N; Zervas, G; Simeonidou, D; Vilalta, R; Casellas, R; Martínez, R; Muñoz, R; Liu, L; Tsuritani, T; Morita, I; Autenrieth, A; Elbers, J P; Kostecki, P; Kaczmarek, P

2013-03-11

Software defined networking (SDN) and flexible grid optical transport technology are two key technologies that allow network operators to customize their infrastructure based on application requirements and therefore minimizing the extra capital and operational costs required for hosting new applications. In this paper, for the first time we report on design, implementation & demonstration of a novel OpenFlow based SDN unified control plane allowing seamless operation across heterogeneous state-of-the-art optical and packet transport domains. We verify and experimentally evaluate OpenFlow protocol extensions for flexible DWDM grid transport technology along with its integration with fixed DWDM grid and layer-2 packet switching.

Network community-based model reduction for vortical flows

NASA Astrophysics Data System (ADS)

Gopalakrishnan Meena, Muralikrishnan; Nair, Aditya G.; Taira, Kunihiko

2018-06-01

A network community-based reduced-order model is developed to capture key interactions among coherent structures in high-dimensional unsteady vortical flows. The present approach is data-inspired and founded on network-theoretic techniques to identify important vortical communities that are comprised of vortical elements that share similar dynamical behavior. The overall interaction-based physics of the high-dimensional flow field is distilled into the vortical community centroids, considerably reducing the system dimension. Taking advantage of these vortical interactions, the proposed methodology is applied to formulate reduced-order models for the inter-community dynamics of vortical flows, and predict lift and drag forces on bodies in wake flows. We demonstrate the capabilities of these models by accurately capturing the macroscopic dynamics of a collection of discrete point vortices, and the complex unsteady aerodynamic forces on a circular cylinder and an airfoil with a Gurney flap. The present formulation is found to be robust against simulated experimental noise and turbulence due to its integrating nature of the system reduction.

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.

Bicriteria Network Optimization Problem using Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin; Cheng, Runwei

Network optimization is being an increasingly important and fundamental issue in the fields such as engineering, computer science, operations research, transportation, telecommunication, decision support systems, manufacturing, and airline scheduling. In many applications, however, there are several criteria associated with traversing each edge of a network. For example, cost and flow measures are both important in the networks. As a result, there has been recent interest in solving Bicriteria Network Optimization Problem. The Bicriteria Network Optimization Problem is known a NP-hard. The efficient set of paths may be very large, possibly exponential in size. Thus the computational effort required to solve it can increase exponentially with the problem size in the worst case. In this paper, we propose a genetic algorithm (GA) approach used a priority-based chromosome for solving the bicriteria network optimization problem including maximum flow (MXF) model and minimum cost flow (MCF) model. The objective is to find the set of Pareto optimal solutions that give possible maximum flow with minimum cost. This paper also combines Adaptive Weight Approach (AWA) that utilizes some useful information from the current population to readjust weights for obtaining a search pressure toward a positive ideal point. Computer simulations show the several numerical experiments by using some difficult-to-solve network design problems, and show the effectiveness of the proposed method.

Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata

PubMed Central

Chen, Yangzhou; Guo, Yuqi; Wang, Ying

2017-01-01

In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research. PMID:28353664

Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata.

PubMed

Chen, Yangzhou; Guo, Yuqi; Wang, Ying

2017-03-29

In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research.

Cyber Defence in the Armed Forces of the Czech Republic

DTIC Science & Technology

2010-11-01

undesirable action backward discovery. This solution is based on special tools using NetFlow protocol. Active network elements or specialized hardware...probes attached to the backbone network using a tap can be the sources of NetFlow data. The principal advantage of NetFlow protocol is the fact that it...provides primary data in the open form, which can be easily utilized in the subsequent operations. The FlowMon Probe 4000 is mostly used NetFlow

Two-phase flow characterization based on advanced instrumentation, neural networks, and mathematical modeling

NASA Astrophysics Data System (ADS)

Mi, Ye

1998-12-01

The major objective of this thesis is focused on theoretical and experimental investigations of identifying and characterizing vertical and horizontal flow regimes in two-phase flows. A methodology of flow regime identification with impedance-based neural network systems and a comprehensive model of vertical slug flow have been developed. Vertical slug flow has been extensively investigated and characterized with geometric, kinematic and hydrodynamic parameters. A multi-sensor impedance void-meter and a multi-sensor magnetic flowmeter were developed. The impedance void-meter was cross-calibrated with other reliable techniques for void fraction measurements. The performance of the impedance void-meter to measure the void propagation velocity was evaluated by the drift flux model. It was proved that the magnetic flowmeter was applicable to vertical slug flow measurements. Separable signals from these instruments allow us to unearth most characteristics of vertical slug flow. A methodology of vertical flow regime identification was developed. Supervised neural network and self-organizing neural network systems were employed. First, they were trained with results from an idealized simulation of impedance in a two-phase mixture. The simulation was mainly based on Mishima and Ishii's flow regime map, the drift flux model, and the newly developed model of slug flow. Then, these trained systems were tested with impedance signals. The results showed that the neural network systems were appropriate classifiers of vertical flow regimes. The theoretical models and experimental databases used in the simulation were reliable. Furthermore, this approach was applied successfully to horizontal flow identification. A comprehensive model was developed to predict important characteristics of vertical slug flow. It was realized that the void fraction of the liquid slug is determined by the relative liquid motion between the Taylor bubble tail and the Taylor bubble wake. Relying on this understanding and experimental results, a special relationship was built for the void fraction of the liquid slug. The prediction of the void fraction of the liquid slug was considerably improved. Experimental characterization of vertical slug flows was performed extensively with the impedance void-meter and the magnetic flowmeter. The theoretical predictions were compared with the experimental results. The agreements between them are very satisfactory.

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.

A novel method for flow pattern identification in unstable operational conditions using gamma ray and radial basis function.

PubMed

Roshani, G H; Nazemi, E; Roshani, M M

2017-05-01

Changes of fluid properties (especially density) strongly affect the performance of radiation-based multiphase flow meter and could cause error in recognizing the flow pattern and determining void fraction. In this work, we proposed a methodology based on combination of multi-beam gamma ray attenuation and dual modality densitometry techniques using RBF neural network in order to recognize the flow regime and determine the void fraction in gas-liquid two phase flows independent of the liquid phase changes. The proposed system is consisted of one 137 Cs source, two transmission detectors and one scattering detector. The registered counts in two transmission detectors were used as the inputs of one primary Radial Basis Function (RBF) neural network for recognizing the flow regime independent of liquid phase density. Then, after flow regime identification, three RBF neural networks were utilized for determining the void fraction independent of liquid phase density. Registered count in scattering detector and first transmission detector were used as the inputs of these three RBF neural networks. Using this simple methodology, all the flow patterns were correctly recognized and the void fraction was predicted independent of liquid phase density with mean relative error (MRE) of less than 3.28%. Copyright © 2017 Elsevier Ltd. All rights reserved.

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.

Sample EP Flow Analysis of Severely Damaged Networks

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

Werley, Kenneth Alan; McCown, Andrew William

These are slides for a presentation at the working group meeting of the WESC SREMP Software Product Integration Team on sample EP flow analysis of severely damaged networks. The following topics are covered: ERCOT EP Transmission Model; Zoomed in to Houston and Overlaying StreetAtlas; EMPACT Solve/Dispatch/Shedding Options; QACS BaseCase Power Flow Solution; 3 Substation Contingency; Gen. & Load/100 Optimal Dispatch; Dispatch Results; Shed Load for Low V; Network Damage Summary; Estimated Service Areas (Potential); Estimated Outage Areas (potential).

Effective comparative analysis of protein-protein interaction networks by measuring the steady-state network flow using a Markov model.

PubMed

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

2016-10-06

Comparative analysis of protein-protein interaction (PPI) networks provides an effective means of detecting conserved functional network modules across different species. Such modules typically consist of orthologous proteins with conserved interactions, which can be exploited to computationally predict the modules through network comparison. In this work, we propose a novel probabilistic framework for comparing PPI networks and effectively predicting the correspondence between proteins, represented as network nodes, that belong to conserved functional modules across the given PPI networks. The basic idea is to estimate the steady-state network flow between nodes that belong to different PPI networks based on a Markov random walk model. The random walker is designed to make random moves to adjacent nodes within a PPI network as well as cross-network moves between potential orthologous nodes with high sequence similarity. Based on this Markov random walk model, we estimate the steady-state network flow - or the long-term relative frequency of the transitions that the random walker makes - between nodes in different PPI networks, which can be used as a probabilistic score measuring their potential correspondence. Subsequently, the estimated scores can be used for detecting orthologous proteins in conserved functional modules through network alignment. Through evaluations based on multiple real PPI networks, we demonstrate that the proposed scheme leads to improved alignment results that are biologically more meaningful at reduced computational cost, outperforming the current state-of-the-art algorithms. The source code and datasets can be downloaded from http://www.ece.tamu.edu/~bjyoon/CUFID .

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

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.

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.

A network-analysis-based comparative study of the throughput behavior of polymer melts in barrier screw geometries

NASA Astrophysics Data System (ADS)

Aigner, M.; Köpplmayr, T.; Kneidinger, C.; Miethlinger, J.

2014-05-01

Barrier screws are widely used in the plastics industry. Due to the extreme diversity of their geometries, describing the flow behavior is difficult and rarely done in practice. We present a systematic approach based on networks that uses tensor algebra and numerical methods to model and calculate selected barrier screw geometries in terms of pressure, mass flow, and residence time. In addition, we report the results of three-dimensional simulations using the commercially available ANSYS Polyflow software. The major drawbacks of three-dimensional finite-element-method (FEM) simulations are that they require vast computational power and, large quantities of memory, and consume considerable time to create a geometric model created by computer-aided design (CAD) and complete a flow calculation. Consequently, a modified 2.5-dimensional finite volume method, termed network analysis is preferable. The results obtained by network analysis and FEM simulations correlated well. Network analysis provides an efficient alternative to complex FEM software in terms of computing power and memory consumption. Furthermore, typical barrier screw geometries can be parameterized and used for flow calculations without timeconsuming CAD-constructions.

Forecasting the short-term passenger flow on high-speed railway with neural networks.

PubMed

Xie, Mei-Quan; Li, Xia-Miao; Zhou, Wen-Liang; Fu, Yan-Bing

2014-01-01

Short-term passenger flow forecasting is an important component of transportation systems. The forecasting result can be applied to support transportation system operation and management such as operation planning and revenue management. In this paper, a divide-and-conquer method based on neural network and origin-destination (OD) matrix estimation is developed to forecast the short-term passenger flow in high-speed railway system. There are three steps in the forecasting method. Firstly, the numbers of passengers who arrive at each station or depart from each station are obtained from historical passenger flow data, which are OD matrices in this paper. Secondly, short-term passenger flow forecasting of the numbers of passengers who arrive at each station or depart from each station based on neural network is realized. At last, the OD matrices in short-term time are obtained with an OD matrix estimation method. The experimental results indicate that the proposed divide-and-conquer method performs well in forecasting the short-term passenger flow on high-speed railway.

Internet-Based Approaches to Building Stakeholder Networks for Conservation and Natural Resource Management

EPA Science Inventory

Social network analysis (SNA) is based on a conceptual network representation of social interactions and is an invaluable tool for conservation professionals to increase collaboration, improve information flow, and increase efficiency. We present two approaches to constructing i...

Internet-Based Approaches to Building Stakeholder Networks for Conservation and Natural Resource Management.

EPA Science Inventory

Social network analysis (SNA) is based on a conceptual network representation of social interactions and is an invaluable tool for conservation professionals to increase collaboration, improve information flow, and increase efficiency. We present two approaches to constructing in...

A probabilistic approach to quantifying spatial patterns of flow regimes and network-scale connectivity

NASA Astrophysics Data System (ADS)

Garbin, Silvia; Alessi Celegon, Elisa; Fanton, Pietro; Botter, Gianluca

2017-04-01

The temporal variability of river flow regime is a key feature structuring and controlling fluvial ecological communities and ecosystem processes. In particular, streamflow variability induced by climate/landscape heterogeneities or other anthropogenic factors significantly affects the connectivity between streams with notable implication for river fragmentation. Hydrologic connectivity is a fundamental property that guarantees species persistence and ecosystem integrity in riverine systems. In riverine landscapes, most ecological transitions are flow-dependent and the structure of flow regimes may affect ecological functions of endemic biota (i.e., fish spawning or grazing of invertebrate species). Therefore, minimum flow thresholds must be guaranteed to support specific ecosystem services, like fish migration, aquatic biodiversity and habitat suitability. In this contribution, we present a probabilistic approach aiming at a spatially-explicit, quantitative assessment of hydrologic connectivity at the network-scale as derived from river flow variability. Dynamics of daily streamflows are estimated based on catchment-scale climatic and morphological features, integrating a stochastic, physically based approach that accounts for the stochasticity of rainfall with a water balance model and a geomorphic recession flow model. The non-exceedance probability of ecologically meaningful flow thresholds is used to evaluate the fragmentation of individual stream reaches, and the ensuing network-scale connectivity metrics. A multi-dimensional Poisson Process for the stochastic generation of rainfall is used to evaluate the impact of climate signature on reach-scale and catchment-scale connectivity. The analysis shows that streamflow patterns and network-scale connectivity are influenced by the topology of the river network and the spatial variability of climatic properties (rainfall, evapotranspiration). The framework offers a robust basis for the prediction of the impact of land-use/land-cover changes and river regulation on network-scale connectivity.

A network analysis of indirect carbon emission flows among different industries in China.

PubMed

Du, Qiang; Xu, Yadan; Wu, Min; Sun, Qiang; Bai, Libiao; Yu, Ming

2018-06-17

Indirect carbon emissions account for a large ratio of the total carbon emissions in processes to make the final products, and this implies indirect carbon emission flow across industries. Understanding these flows is crucial for allocating a carbon allowance for each industry. By combining input-output analysis and complex network theory, this study establishes an indirect carbon emission flow network (ICEFN) for 41 industries from 2005 to 2014 to investigate the interrelationships among different industries. The results show that the ICEFN was consistent with a small-world nature based on an analysis of the average path lengths and the clustering coefficients. Moreover, key industries in the ICEFN were identified using complex network theory on the basis of degree centrality and betweenness centrality. Furthermore, the 41 industries of the ICEFN were divided into four industrial subgroups that are related closely to one another. Finally, possible policy implications were provided based on the knowledge of the structure of the ICEFN and its trend.

Bit Threads and Holographic Entanglement

NASA Astrophysics Data System (ADS)

Freedman, Michael; Headrick, Matthew

2017-05-01

The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, we invoke the notion of a "flow", defined as a divergenceless norm-bounded vector field, or equivalently a set of Planck-thickness "bit threads". The entanglement entropy of a boundary region is given by the maximum flux out of it of any flow, or equivalently the maximum number of bit threads that can emanate from it. The threads thus represent entanglement between points on the boundary, and naturally implement the holographic principle. As we explain, this new picture clarifies several conceptual puzzles surrounding the RT formula. We give flow-based proofs of strong subadditivity and related properties; unlike the ones based on minimal surfaces, these proofs correspond in a transparent manner to the properties' information-theoretic meanings. We also briefly discuss certain technical advantages that the flows offer over minimal surfaces. In a mathematical appendix, we review the max flow-min cut theorem on networks and on Riemannian manifolds, and prove in the network case that the set of max flows varies Lipshitz continuously in the network parameters.

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.

SDN architecture for optical packet and circuit integrated networks

NASA Astrophysics Data System (ADS)

Furukawa, Hideaki; Miyazawa, Takaya

2016-02-01

We have been developing an optical packet and circuit integrated (OPCI) network, which realizes dynamic optical path, high-density packet multiplexing, and flexible wavelength resource allocation. In the OPCI networks, a best-effort service and a QoS-guaranteed service are provided by employing optical packet switching (OPS) and optical circuit switching (OCS) respectively, and users can select these services. Different wavelength resources are assigned for OPS and OCS links, and the amount of their wavelength resources are dynamically changed in accordance with the service usage conditions. To apply OPCI networks into wide-area (core/metro) networks, we have developed an OPCI node with a distributed control mechanism. Moreover, our OPCI node works with a centralized control mechanism as well as a distributed one. It is therefore possible to realize SDN-based OPCI networks, where resource requests and a centralized configuration are carried out. In this paper, we show our SDN architecture for an OPS system that configures mapping tables between IP addresses and optical packet addresses and switching tables according to the requests from multiple users via a web interface. While OpenFlow-based centralized control protocol is coming into widespread use especially for single-administrative, small-area (LAN/data-center) networks. Here, we also show an interworking mechanism between OpenFlow-based networks (OFNs) and the OPCI network for constructing a wide-area network, and a control method of wavelength resource selection to automatically transfer diversified flows from OFNs to the OPCI network.

SDTCP: Towards Datacenter TCP Congestion Control with SDN for IoT Applications.

PubMed

Lu, Yifei; Ling, Zhen; Zhu, Shuhong; Tang, Ling

2017-01-08

The Internet of Things (IoT) has gained popularity in recent years. Today's IoT applications are now increasingly deployed in cloud platforms to perform Big Data analytics. In cloud data center networks (DCN), TCP incast usually happens when multiple senders simultaneously communicate with a single receiver. However, when TCP incast happens, DCN may suffer from both throughput collapse for TCP burst flows and temporary starvation for TCP background flows. In this paper, we propose a software defined network (SDN)-based TCP congestion control mechanism, referred to as SDTCP, to leverage the features, e.g., centralized control methods and the global view of the network, in order to solve the TCP incast problems. When we detect network congestion on an OpenFlow switch, our controller can select the background flows and reduce their bandwidth by adjusting the advertised window of TCP ACK packets of the corresponding background flows so as to reserve more bandwidth for burst flows. SDTCP is transparent to the end systems and can accurately decelerate the rate of background flows by leveraging the global view of the network gained via SDN. The experiments demonstrate that our SDTCP can provide high tolerance for burst flows and achieve better flow completion time for short flows. Therefore, SDTCP is an effective and scalable solution for the TCP incast problem.

Real-time flood forecasts & risk assessment using a possibility-theory based fuzzy neural network

NASA Astrophysics Data System (ADS)

Khan, U. T.

2016-12-01

Globally floods are one of the most devastating natural disasters and improved flood forecasting methods are essential for better flood protection in urban areas. Given the availability of high resolution real-time datasets for flood variables (e.g. streamflow and precipitation) in many urban areas, data-driven models have been effectively used to predict peak flow rates in river; however, the selection of input parameters for these types of models is often subjective. Additionally, the inherit uncertainty associated with data models along with errors in extreme event observations means that uncertainty quantification is essential. Addressing these concerns will enable improved flood forecasting methods and provide more accurate flood risk assessments. In this research, a new type of data-driven model, a quasi-real-time updating fuzzy neural network is developed to predict peak flow rates in urban riverine watersheds. A possibility-to-probability transformation is first used to convert observed data into fuzzy numbers. A possibility theory based training regime is them used to construct the fuzzy parameters and the outputs. A new entropy-based optimisation criterion is used to train the network. Two existing methods to select the optimum input parameters are modified to account for fuzzy number inputs, and compared. These methods are: Entropy-Wavelet-based Artificial Neural Network (EWANN) and Combined Neural Pathway Strength Analysis (CNPSA). Finally, an automated algorithm design to select the optimum structure of the neural network is implemented. The overall impact of each component of training this network is to replace the traditional ad hoc network configuration methods, with one based on objective criteria. Ten years of data from the Bow River in Calgary, Canada (including two major floods in 2005 and 2013) are used to calibrate and test the network. The EWANN method selected lagged peak flow as a candidate input, whereas the CNPSA method selected lagged precipitation and lagged mean daily flow as candidate inputs. Model performance metric show that the CNPSA method had higher performance (with an efficiency of 0.76). Model output was used to assess the risk of extreme peak flows for a given day using an inverse possibility-to-probability transformation.

Power Grid Maintenance Scheduling Intelligence Arrangement Supporting System Based on Power Flow Forecasting

NASA Astrophysics Data System (ADS)

Xie, Chang; Wen, Jing; Liu, Wenying; Wang, Jiaming

With the development of intelligent dispatching, the intelligence level of network control center full-service urgent need to raise. As an important daily work of network control center, the application of maintenance scheduling intelligent arrangement to achieve high-quality and safety operation of power grid is very important. By analyzing the shortages of the traditional maintenance scheduling software, this paper designs a power grid maintenance scheduling intelligence arrangement supporting system based on power flow forecasting, which uses the advanced technologies in maintenance scheduling, such as artificial intelligence, online security checking, intelligent visualization techniques. It implements the online security checking of maintenance scheduling based on power flow forecasting and power flow adjusting based on visualization, in order to make the maintenance scheduling arrangement moreintelligent and visual.

Dynamics of functional failures and recovery in complex road networks

NASA Astrophysics Data System (ADS)

Zhan, Xianyuan; Ukkusuri, Satish V.; Rao, P. Suresh C.

2017-11-01

We propose a new framework for modeling the evolution of functional failures and recoveries in complex networks, with traffic congestion on road networks as the case study. Differently from conventional approaches, we transform the evolution of functional states into an equivalent dynamic structural process: dual-vertex splitting and coalescing embedded within the original network structure. The proposed model successfully explains traffic congestion and recovery patterns at the city scale based on high-resolution data from two megacities. Numerical analysis shows that certain network structural attributes can amplify or suppress cascading functional failures. Our approach represents a new general framework to model functional failures and recoveries in flow-based networks and allows understanding of the interplay between structure and function for flow-induced failure propagation and recovery.

FloVis: Leveraging Visualization to Protect Sensitive Network Infrastructure

DTIC Science & Technology

2010-11-01

words, we are clustering the hourly web surfing patterns of users on a small private network. The data in this case is filtered NetFlow records...Entity-based NetFlow Visualization Utility for Identifying Intrusive Behavior. In Goodall et al. (eds.), Mathematics and Visualization (Proceedings

International Trade Modelling Using Open Flow Networks: A Flow-Distance Based Analysis.

PubMed

Shen, Bin; Zhang, Jiang; Li, Yixiao; Zheng, Qiuhua; Li, Xingsen

2015-01-01

This paper models and analyzes international trade flows using open flow networks (OFNs) with the approaches of flow distances, which provide a novel perspective and effective tools for the study of international trade. We discuss the establishment of OFNs of international trade from two coupled viewpoints: the viewpoint of trading commodity flow and that of money flow. Based on the novel model with flow distance approaches, meaningful insights are gained. First, by introducing the concepts of trade trophic levels and niches, countries' roles and positions in the global supply chains (or value-added chains) can be evaluated quantitatively. We find that the distributions of trading "trophic levels" have the similar clustering pattern for different types of commodities, and summarize some regularities between money flow and commodity flow viewpoints. Second, we find that active and competitive countries trade a wide spectrum of products, while inactive and underdeveloped countries trade a limited variety of products. Besides, some abnormal countries import many types of goods, which the vast majority of countries do not need to import. Third, harmonic node centrality is proposed and we find the phenomenon of centrality stratification. All the results illustrate the usefulness of the model of OFNs with its network approaches for investigating international trade flows.

International Trade Modelling Using Open Flow Networks: A Flow-Distance Based Analysis

PubMed Central

Shen, Bin; Zhang, Jiang; Li, Yixiao; Zheng, Qiuhua; Li, Xingsen

2015-01-01

This paper models and analyzes international trade flows using open flow networks (OFNs) with the approaches of flow distances, which provide a novel perspective and effective tools for the study of international trade. We discuss the establishment of OFNs of international trade from two coupled viewpoints: the viewpoint of trading commodity flow and that of money flow. Based on the novel model with flow distance approaches, meaningful insights are gained. First, by introducing the concepts of trade trophic levels and niches, countries’ roles and positions in the global supply chains (or value-added chains) can be evaluated quantitatively. We find that the distributions of trading “trophic levels” have the similar clustering pattern for different types of commodities, and summarize some regularities between money flow and commodity flow viewpoints. Second, we find that active and competitive countries trade a wide spectrum of products, while inactive and underdeveloped countries trade a limited variety of products. Besides, some abnormal countries import many types of goods, which the vast majority of countries do not need to import. Third, harmonic node centrality is proposed and we find the phenomenon of centrality stratification. All the results illustrate the usefulness of the model of OFNs with its network approaches for investigating international trade flows. PMID:26569618

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.

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

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.

An Open-Access Modeled Passenger Flow Matrix for the Global Air Network in 2010

PubMed Central

Huang, Zhuojie; Wu, Xiao; Garcia, Andres J.; Fik, Timothy J.; Tatem, Andrew J.

2013-01-01

The expanding global air network provides rapid and wide-reaching connections accelerating both domestic and international travel. To understand human movement patterns on the network and their socioeconomic, environmental and epidemiological implications, information on passenger flow is required. However, comprehensive data on global passenger flow remain difficult and expensive to obtain, prompting researchers to rely on scheduled flight seat capacity data or simple models of flow. This study describes the construction of an open-access modeled passenger flow matrix for all airports with a host city-population of more than 100,000 and within two transfers of air travel from various publicly available air travel datasets. Data on network characteristics, city population, and local area GDP amongst others are utilized as covariates in a spatial interaction framework to predict the air transportation flows between airports. Training datasets based on information from various transportation organizations in the United States, Canada and the European Union were assembled. A log-linear model controlling the random effects on origin, destination and the airport hierarchy was then built to predict passenger flows on the network, and compared to the results produced using previously published models. Validation analyses showed that the model presented here produced improved predictive power and accuracy compared to previously published models, yielding the highest successful prediction rate at the global scale. Based on this model, passenger flows between 1,491 airports on 644,406 unique routes were estimated in the prediction dataset. The airport node characteristics and estimated passenger flows are freely available as part of the Vector-Borne Disease Airline Importation Risk (VBD-Air) project at: www.vbd-air.com/data. PMID:23691194

An open-access modeled passenger flow matrix for the global air network in 2010.

PubMed

Huang, Zhuojie; Wu, Xiao; Garcia, Andres J; Fik, Timothy J; Tatem, Andrew J

2013-01-01

The expanding global air network provides rapid and wide-reaching connections accelerating both domestic and international travel. To understand human movement patterns on the network and their socioeconomic, environmental and epidemiological implications, information on passenger flow is required. However, comprehensive data on global passenger flow remain difficult and expensive to obtain, prompting researchers to rely on scheduled flight seat capacity data or simple models of flow. This study describes the construction of an open-access modeled passenger flow matrix for all airports with a host city-population of more than 100,000 and within two transfers of air travel from various publicly available air travel datasets. Data on network characteristics, city population, and local area GDP amongst others are utilized as covariates in a spatial interaction framework to predict the air transportation flows between airports. Training datasets based on information from various transportation organizations in the United States, Canada and the European Union were assembled. A log-linear model controlling the random effects on origin, destination and the airport hierarchy was then built to predict passenger flows on the network, and compared to the results produced using previously published models. Validation analyses showed that the model presented here produced improved predictive power and accuracy compared to previously published models, yielding the highest successful prediction rate at the global scale. Based on this model, passenger flows between 1,491 airports on 644,406 unique routes were estimated in the prediction dataset. The airport node characteristics and estimated passenger flows are freely available as part of the Vector-Borne Disease Airline Importation Risk (VBD-Air) project at: www.vbd-air.com/data.

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

Variable speed limit strategies analysis with mesoscopic traffic flow model based on complex networks

NASA Astrophysics Data System (ADS)

Li, Shu-Bin; Cao, Dan-Ni; Dang, Wen-Xiu; Zhang, Lin

As a new cross-discipline, the complexity science has penetrated into every field of economy and society. With the arrival of big data, the research of the complexity science has reached its summit again. In recent years, it offers a new perspective for traffic control by using complex networks theory. The interaction course of various kinds of information in traffic system forms a huge complex system. A new mesoscopic traffic flow model is improved with variable speed limit (VSL), and the simulation process is designed, which is based on the complex networks theory combined with the proposed model. This paper studies effect of VSL on the dynamic traffic flow, and then analyzes the optimal control strategy of VSL in different network topologies. The conclusion of this research is meaningful to put forward some reasonable transportation plan and develop effective traffic management and control measures to help the department of traffic management.

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.

FastLane: Agile Drop Notification for Datacenter Networks

DTIC Science & Technology

2013-10-23

interactivity dead- lines mean that networks are increasingly evaluated on high percentile completion times of these short flows. Achieving consistent flow...triggering retransmissions based on out-of-order delivery. We evaluate FastLane in a number of scenarios, us- ing both testbed experiments and simulations...Results from our evaluation demonstrate that FastLane improves the 99.9th percentile completion time of short flows by up to 75% compared to TCP

Stability and dynamical properties of material flow systems on random networks

NASA Astrophysics Data System (ADS)

Anand, K.; Galla, T.

2009-04-01

The theory of complex networks and of disordered systems is used to study the stability and dynamical properties of a simple model of material flow networks defined on random graphs. In particular we address instabilities that are characteristic of flow networks in economic, ecological and biological systems. Based on results from random matrix theory, we work out the phase diagram of such systems defined on extensively connected random graphs, and study in detail how the choice of control policies and the network structure affects stability. We also present results for more complex topologies of the underlying graph, focussing on finitely connected Erdös-Réyni graphs, Small-World Networks and Barabási-Albert scale-free networks. Results indicate that variability of input-output matrix elements, and random structures of the underlying graph tend to make the system less stable, while fast price dynamics or strong responsiveness to stock accumulation promote stability.

Forecasting the Short-Term Passenger Flow on High-Speed Railway with Neural Networks

PubMed Central

Xie, Mei-Quan; Li, Xia-Miao; Zhou, Wen-Liang; Fu, Yan-Bing

2014-01-01

Short-term passenger flow forecasting is an important component of transportation systems. The forecasting result can be applied to support transportation system operation and management such as operation planning and revenue management. In this paper, a divide-and-conquer method based on neural network and origin-destination (OD) matrix estimation is developed to forecast the short-term passenger flow in high-speed railway system. There are three steps in the forecasting method. Firstly, the numbers of passengers who arrive at each station or depart from each station are obtained from historical passenger flow data, which are OD matrices in this paper. Secondly, short-term passenger flow forecasting of the numbers of passengers who arrive at each station or depart from each station based on neural network is realized. At last, the OD matrices in short-term time are obtained with an OD matrix estimation method. The experimental results indicate that the proposed divide-and-conquer method performs well in forecasting the short-term passenger flow on high-speed railway. PMID:25544838

SDTCP: Towards Datacenter TCP Congestion Control with SDN for IoT Applications

PubMed Central

Lu, Yifei; Ling, Zhen; Zhu, Shuhong; Tang, Ling

2017-01-01

The Internet of Things (IoT) has gained popularity in recent years. Today’s IoT applications are now increasingly deployed in cloud platforms to perform Big Data analytics. In cloud data center networks (DCN), TCP incast usually happens when multiple senders simultaneously communicate with a single receiver. However, when TCP incast happens, DCN may suffer from both throughput collapse for TCP burst flows and temporary starvation for TCP background flows. In this paper, we propose a software defined network (SDN)-based TCP congestion control mechanism, referred to as SDTCP, to leverage the features, e.g., centralized control methods and the global view of the network, in order to solve the TCP incast problems. When we detect network congestion on an OpenFlow switch, our controller can select the background flows and reduce their bandwidth by adjusting the advertised window of TCP ACK packets of the corresponding background flows so as to reserve more bandwidth for burst flows. SDTCP is transparent to the end systems and can accurately decelerate the rate of background flows by leveraging the global view of the network gained via SDN. The experiments demonstrate that our SDTCP can provide high tolerance for burst flows and achieve better flow completion time for short flows. Therefore, SDTCP is an effective and scalable solution for the TCP incast problem. PMID:28075347

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.

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.

Quantitative angle-insensitive flow measurement using relative standard deviation OCT.

PubMed

Zhu, Jiang; Zhang, Buyun; Qi, Li; Wang, Ling; Yang, Qiang; Zhu, Zhuqing; Huo, Tiancheng; Chen, Zhongping

2017-10-30

Incorporating different data processing methods, optical coherence tomography (OCT) has the ability for high-resolution angiography and quantitative flow velocity measurements. However, OCT angiography cannot provide quantitative information of flow velocities, and the velocity measurement based on Doppler OCT requires the determination of Doppler angles, which is a challenge in a complex vascular network. In this study, we report on a relative standard deviation OCT (RSD-OCT) method which provides both vascular network mapping and quantitative information for flow velocities within a wide range of Doppler angles. The RSD values are angle-insensitive within a wide range of angles, and a nearly linear relationship was found between the RSD values and the flow velocities. The RSD-OCT measurement in a rat cortex shows that it can quantify the blood flow velocities as well as map the vascular network in vivo .

Quantitative angle-insensitive flow measurement using relative standard deviation OCT

NASA Astrophysics Data System (ADS)

Zhu, Jiang; Zhang, Buyun; Qi, Li; Wang, Ling; Yang, Qiang; Zhu, Zhuqing; Huo, Tiancheng; Chen, Zhongping

2017-10-01

Incorporating different data processing methods, optical coherence tomography (OCT) has the ability for high-resolution angiography and quantitative flow velocity measurements. However, OCT angiography cannot provide quantitative information of flow velocities, and the velocity measurement based on Doppler OCT requires the determination of Doppler angles, which is a challenge in a complex vascular network. In this study, we report on a relative standard deviation OCT (RSD-OCT) method which provides both vascular network mapping and quantitative information for flow velocities within a wide range of Doppler angles. The RSD values are angle-insensitive within a wide range of angles, and a nearly linear relationship was found between the RSD values and the flow velocities. The RSD-OCT measurement in a rat cortex shows that it can quantify the blood flow velocities as well as map the vascular network in vivo.

Identifying the Critical Links in Road Transportation Networks: Centrality-based approach utilizing structural properties

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

Chinthavali, Supriya

Surface transportation road networks share structural properties similar to other complex networks (e.g., social networks, information networks, biological networks, and so on). This research investigates the structural properties of road networks for any possible correlation with the traffic characteristics such as link flows those determined independently. Additionally, we define a criticality index for the links of the road network that identifies the relative importance in the network. We tested our hypotheses with two sample road networks. Results show that, correlation exists between the link flows and centrality measures of a link of the road (dual graph approach is followed) andmore » the criticality index is found to be effective for one test network to identify the vulnerable nodes.« less

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.

Experimental demonstration of OpenFlow-enabled media ecosystem architecture for high-end applications over metro and core networks.

PubMed

Ntofon, Okung-Dike; Channegowda, Mayur P; Efstathiou, Nikolaos; Rashidi Fard, Mehdi; Nejabati, Reza; Hunter, David K; Simeonidou, Dimitra

2013-02-25

In this paper, a novel Software-Defined Networking (SDN) architecture is proposed for high-end Ultra High Definition (UHD) media applications. UHD media applications require huge amounts of bandwidth that can only be met with high-capacity optical networks. In addition, there are requirements for control frameworks capable of delivering effective application performance with efficient network utilization. A novel SDN-based Controller that tightly integrates application-awareness with network control and management is proposed for such applications. An OpenFlow-enabled test-bed demonstrator is reported with performance evaluations of advanced online and offline media- and network-aware schedulers.

A Novel Capacity Analysis for Wireless Backhaul Mesh Networks

NASA Astrophysics Data System (ADS)

Chung, Tein-Yaw; Lee, Kuan-Chun; Lee, Hsiao-Chih

This paper derived a closed-form expression for inter-flow capacity of a backhaul wireless mesh network (WMN) with centralized scheduling by employing a ring-based approach. Through the definition of an interference area, we are able to accurately describe a bottleneck collision area for a WMN and calculate the upper bound of inter-flow capacity. The closed-form expression shows that the upper bound is a function of the ratio between transmission range and network radius. Simulations and numerical analysis show that our analytic solution can better estimate the inter-flow capacity of WMNs than that of previous approach.

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.

Effects of iterative learning based signal control strategies on macroscopic fundamental diagrams of urban road networks

NASA Astrophysics Data System (ADS)

Yan, Fei; Tian, Fuli; Shi, Zhongke

2016-10-01

Urban traffic flows are inherently repeated on a daily or weekly basis. This repeatability can help improve the traffic conditions if it is used properly by the control system. In this paper, we propose a novel iterative learning control (ILC) strategy for traffic signals of urban road networks using the repeatability feature of traffic flow. To improve the control robustness, the ILC strategy is further integrated with an error feedback control law in a complementary manner. Theoretical analysis indicates that the ILC-based traffic signal control methods can guarantee the asymptotic learning convergence, despite the presence of modeling uncertainties and exogenous disturbances. Finally, the impacts of the ILC-based signal control strategies on the network macroscopic fundamental diagram (MFD) are examined. The results show that the proposed ILC-based control strategies can homogenously distribute the network accumulation by controlling the vehicle numbers in each link to the desired levels under different traffic demands, which can result in the network with high capacity and mobility.

Computing the Envelope for Stepwise-Constant Resource Allocations

NASA Technical Reports Server (NTRS)

Muscettola, Nicola; Clancy, Daniel (Technical Monitor)

2002-01-01

Computing tight resource-level bounds is a fundamental problem in the construction of flexible plans with resource utilization. In this paper we describe an efficient algorithm that builds a resource envelope, the tightest possible such bound. The algorithm is based on transforming the temporal network of resource consuming and producing events into a flow network with nodes equal to the events and edges equal to the necessary predecessor links between events. A staged maximum flow problem on the network is then used to compute the time of occurrence and the height of each step of the resource envelope profile. Each stage has the same computational complexity of solving a maximum flow problem on the entire flow network. This makes this method computationally feasible and promising for use in the inner loop of flexible-time scheduling algorithms.

Unified pipe network method for simulation of water flow in fractured porous rock

NASA Astrophysics Data System (ADS)

Ren, Feng; Ma, Guowei; Wang, Yang; Li, Tuo; Zhu, Hehua

2017-04-01

Rock masses are often conceptualized as dual-permeability media containing fractures or fracture networks with high permeability and porous matrix that is less permeable. In order to overcome the difficulties in simulating fluid flow in a highly discontinuous dual-permeability medium, an effective unified pipe network method is developed, which discretizes the dual-permeability rock mass into a virtual pipe network system. It includes fracture pipe networks and matrix pipe networks. They are constructed separately based on equivalent flow models in a representative area or volume by taking the advantage of the orthogonality of the mesh partition. Numerical examples of fluid flow in 2-D and 3-D domain including porous media and fractured porous media are presented to demonstrate the accuracy, robustness, and effectiveness of the proposed unified pipe network method. Results show that the developed method has good performance even with highly distorted mesh. Water recharge into the fractured rock mass with complex fracture network is studied. It has been found in this case that the effect of aperture change on the water recharge rate is more significant in the early stage compared to the fracture density change.

Optimal topology to minimizing congestion in connected communication complex network

NASA Astrophysics Data System (ADS)

Benyoussef, M.; Ez-Zahraouy, H.; Benyoussef, A.

In this paper, a new model of the interdependent complex network is proposed, based on two assumptions that (i) the capacity of a node depends on its degree, and (ii) the traffic load depends on the distribution of the links in the network. Based on these assumptions, the presented model proposes a method of connection not based on the node having a higher degree but on the region containing hubs. It is found that the final network exhibits two kinds of degree distribution behavior, depending on the kind and the way of the connection. This study reveals a direct relation between network structure and traffic flow. It is found that pc the point of transition between the free flow and the congested phase depends on the network structure and the degree distribution. Moreover, this new model provides an improvement in the traffic compared to the results found in a single network. The same behavior of degree distribution found in a BA network and observed in the real world is obtained; except for this model, the transition point between the free phase and congested phase is much higher than the one observed in a network of BA, for both static and dynamic protocols.

Filament turnover tunes both force generation and dissipation to control long-range flows in a model actomyosin cortex

PubMed Central

McCall, Patrick M.; Gardel, Margaret L.; Munro, Edwin M.

2017-01-01

Actomyosin-based cortical flow is a fundamental engine for cellular morphogenesis. Cortical flows are generated by cross-linked networks of actin filaments and myosin motors, in which active stress produced by motor activity is opposed by passive resistance to network deformation. Continuous flow requires local remodeling through crosslink unbinding and and/or filament disassembly. But how local remodeling tunes stress production and dissipation, and how this in turn shapes long range flow, remains poorly understood. Here, we study a computational model for a cross-linked network with active motors based on minimal requirements for production and dissipation of contractile stress: Asymmetric filament compliance, spatial heterogeneity of motor activity, reversible cross-links and filament turnover. We characterize how the production and dissipation of network stress depend, individually, on cross-link dynamics and filament turnover, and how these dependencies combine to determine overall rates of cortical flow. Our analysis predicts that filament turnover is required to maintain active stress against external resistance and steady state flow in response to external stress. Steady state stress increases with filament lifetime up to a characteristic time τm, then decreases with lifetime above τm. Effective viscosity increases with filament lifetime up to a characteristic time τc, and then becomes independent of filament lifetime and sharply dependent on crosslink dynamics. These individual dependencies of active stress and effective viscosity define multiple regimes of steady state flow. In particular our model predicts that when filament lifetimes are shorter than both τc and τm, the dependencies of effective viscosity and steady state stress on filament turnover cancel one another, such that flow speed is insensitive to filament turnover, and shows a simple dependence on motor activity and crosslink dynamics. These results provide a framework for understanding how animal cells tune cortical flow through local control of network remodeling. PMID:29253848

Toward an optimal design principle in symmetric and asymmetric tree flow networks.

PubMed

Miguel, Antonio F

2016-01-21

Fluid flow in tree-shaped networks plays an important role in both natural and engineered systems. This paper focuses on laminar flows of Newtonian and non-Newtonian power law fluids in symmetric and asymmetric bifurcating trees. Based on the constructal law, we predict the tree-shaped architecture that provides greater access to the flow subjected to the total network volume constraint. The relationships between the sizes of parent and daughter tubes are presented both for symmetric and asymmetric branching tubes. We also approach the wall-shear stresses and the flow resistance in terms of first tube size, degree of asymmetry between daughter branches, and rheological behavior of the fluid. The influence of tubes obstructing the fluid flow is also accounted for. The predictions obtained by our theory-driven approach find clear support in the findings of previous experimental studies. Copyright © 2015 Elsevier Ltd. All rights reserved.

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.

Quantifying spatial and temporal patterns of flow intermittency using spatially contiguous runoff data

NASA Astrophysics Data System (ADS)

Yu (于松延), Songyan; Bond, Nick R.; Bunn, Stuart E.; Xu, Zongxue; Kennard, Mark J.

2018-04-01

River channel drying caused by intermittent stream flow is a widely-recognized factor shaping stream ecosystems. There is a strong need to quantify the distribution of intermittent streams across catchments to inform management. However, observational gauge networks provide only point estimates of streamflow variation. Increasingly, this limitation is being overcome through the use of spatially contiguous estimates of the terrestrial water-balance, which can also assist in estimating runoff and streamflow at large-spatial scales. Here we proposed an approach to quantifying spatial and temporal variation in monthly flow intermittency throughout river networks in eastern Australia. We aggregated gridded (5 × 5 km) monthly water-balance data with a hierarchically nested catchment dataset to simulate catchment runoff accumulation throughout river networks from 1900 to 2016. We also predicted zero flow duration for the entire river network by developing a robust predictive model relating measured zero flow duration (% months) to environmental predictor variables (based on 43 stream gauges). We then combined these datasets by using the predicted zero flow duration from the regression model to determine appropriate 'zero' flow thresholds for the modelled discharge data, which varied spatially across the catchments examined. Finally, based on modelled discharge data and identified actual zero flow thresholds, we derived summary metrics describing flow intermittency across the catchment (mean flow duration and coefficient-of-variation in flow permanence from 1900 to 2016). We also classified the relative degree of flow intermittency annually to characterise temporal variation in flow intermittency. Results showed that the degree of flow intermittency varied substantially across streams in eastern Australia, ranging from perennial streams flowing permanently (11-12 months) to strongly intermittent streams flowing 4 months or less of year. Results also showed that the temporal extent of flow intermittency varied dramatically inter-annually from 1900 to 2016, with the proportion of intermittent (weakly and strongly intermittent) streams ranging in length from 3% to nearly 100% of the river network, but there was no evidence of an increasing trend towards flow intermittency over this period. Our approach to generating spatially explicit and catchment-wide estimates of streamflow intermittency can facilitate improved ecological understanding and management of intermittent streams in Australia and around the world.

Information Flow in Interaction Networks II: Channels, Path Lengths, and Potentials

PubMed Central

Stojmirović, Aleksandar

2012-01-01

Abstract In our previous publication, a framework for information flow in interaction networks based on random walks with damping was formulated with two fundamental modes: emitting and absorbing. While many other network analysis methods based on random walks or equivalent notions have been developed before and after our earlier work, one can show that they can all be mapped to one of the two modes. In addition to these two fundamental modes, a major strength of our earlier formalism was its accommodation of context-specific directed information flow that yielded plausible and meaningful biological interpretation of protein functions and pathways. However, the directed flow from origins to destinations was induced via a potential function that was heuristic. Here, with a theoretically sound approach called the channel mode, we extend our earlier work for directed information flow. This is achieved by constructing a potential function facilitating a purely probabilistic interpretation of the channel mode. For each network node, the channel mode combines the solutions of emitting and absorbing modes in the same context, producing what we call a channel tensor. The entries of the channel tensor at each node can be interpreted as the amount of flow passing through that node from an origin to a destination. Similarly to our earlier model, the channel mode encompasses damping as a free parameter that controls the locality of information flow. Through examples involving the yeast pheromone response pathway, we illustrate the versatility and stability of our new framework. PMID:22409812

What determines blood vessel structure? Genetic prespecification vs. hemodynamics.

PubMed

Jones, Elizabeth A V; le Noble, Ferdinand; Eichmann, Anne

2006-12-01

Vascular network remodeling, angiogenesis, and arteriogenesis play an important role in the pathophysiology of ischemic cardiovascular diseases and cancer. Based on recent studies of vascular network development in the embryo, several novel aspects to angiogenesis have been identified as crucial to generate a functional vascular network. These aspects include specification of arterial and venous identity in vessels and network patterning. In early embryogenesis, vessel identity and positioning are genetically hardwired and involve neural guidance genes expressed in the vascular system. We demonstrated that, during later stages of embryogenesis, blood flow plays a crucial role in regulating vessel identity and network remodeling. The flow-evoked remodeling process is dynamic and involves a high degree of vessel plasticity. The open question in the field is how genetically predetermined processes in vessel identity and patterning balance with the contribution of blood flow in shaping a functional vascular architecture. Although blood flow is essential, it remains unclear to what extent flow is able to act on the developing cardiovascular system. There is significant evidence that mechanical forces created by flowing blood are biologically active within the embryo and that the level of mechanical forces and the type of flow patterns present in the embryo are able to affect gene expression. Here, we highlight the pivotal role for blood flow and physical forces in shaping the cardiovascular system.

A Study on Market-based Strategic Procurement Planning in Convergent Supply Networks

NASA Astrophysics Data System (ADS)

Opadiji, Jayeola Femi; Kaihara, Toshiya

We present a market-based decentralized approach which uses a market-oriented programming algorithm to obtain Pareto-optimal allocation of resources traded among agents which represent enterprise units in a supply network. The proposed method divides the network into a series of Walrsian markets in order to obtain procurement budgets for enterprises in the network. An interaction protocol based on market value propagation is constructed to coordinate the flow of resources across the network layers. The method mitigates the effect of product complementarity in convergent network by allowing for enterprises to hold private valuations of resources in the markets.

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.

Extended shortest path selection for package routing of complex networks

NASA Astrophysics Data System (ADS)

Ye, Fan; Zhang, Lei; Wang, Bing-Hong; Liu, Lu; Zhang, Xing-Yi

The routing strategy plays a very important role in complex networks such as Internet system and Peer-to-Peer networks. However, most of the previous work concentrates only on the path selection, e.g. Flooding and Random Walk, or finding the shortest path (SP) and rarely considering the local load information such as SP and Distance Vector Routing. Flow-based Routing mainly considers load balance and still cannot achieve best optimization. Thus, in this paper, we propose a novel dynamic routing strategy on complex network by incorporating the local load information into SP algorithm to enhance the traffic flow routing optimization. It was found that the flow in a network is greatly affected by the waiting time of the network, so we should not consider only choosing optimized path for package transformation but also consider node congestion. As a result, the packages should be transmitted with a global optimized path with smaller congestion and relatively short distance. Analysis work and simulation experiments show that the proposed algorithm can largely enhance the network flow with the maximum throughput within an acceptable calculating time. The detailed analysis of the algorithm will also be provided for explaining the efficiency.

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.

Graphene-based battery electrodes having continuous flow paths

DOEpatents

Zhang, Jiguang; Xiao, Jie; Liu, Jun; Xu, Wu; Li, Xiaolin; Wang, Deyu

2014-05-24

Some batteries can exhibit greatly improved performance by utilizing electrodes having randomly arranged graphene nanosheets forming a network of channels defining continuous flow paths through the electrode. The network of channels can provide a diffusion pathway for the liquid electrolyte and/or for reactant gases. Metal-air batteries can benefit from such electrodes. In particular Li-air batteries show extremely high capacities, wherein the network of channels allow oxygen to diffuse through the electrode and mesopores in the electrode can store discharge products.

Flow-rate control for managing communications in tracking and surveillance networks

NASA Astrophysics Data System (ADS)

Miller, Scott A.; Chong, Edwin K. P.

2007-09-01

This paper describes a primal-dual distributed algorithm for managing communications in a bandwidth-limited sensor network for tracking and surveillance. The algorithm possesses some scale-invariance properties and adaptive gains that make it more practical for applications such as tracking where the conditions change over time. A simulation study comparing this algorithm with a priority-queue-based approach in a network tracking scenario shows significant improvement in the resulting track quality when using flow control to manage communications.

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.

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.

Network-based study of Lagrangian transport and mixing

NASA Astrophysics Data System (ADS)

Padberg-Gehle, Kathrin; Schneide, Christiane

2017-10-01

Transport and mixing processes in fluid flows are crucially influenced by coherent structures and the characterization of these Lagrangian objects is a topic of intense current research. While established mathematical approaches such as variational methods or transfer-operator-based schemes require full knowledge of the flow field or at least high-resolution trajectory data, this information may not be available in applications. Recently, different computational methods have been proposed to identify coherent behavior in flows directly from Lagrangian trajectory data, that is, numerical or measured time series of particle positions in a fluid flow. In this context, spatio-temporal clustering algorithms have been proven to be very effective for the extraction of coherent sets from sparse and possibly incomplete trajectory data. Inspired by these recent approaches, we consider an unweighted, undirected network, where Lagrangian particle trajectories serve as network nodes. A link is established between two nodes if the respective trajectories come close to each other at least once in the course of time. Classical graph concepts are then employed to analyze the resulting network. In particular, local network measures such as the node degree, the average degree of neighboring nodes, and the clustering coefficient serve as indicators of highly mixing regions, whereas spectral graph partitioning schemes allow us to extract coherent sets. The proposed methodology is very fast to run and we demonstrate its applicability in two geophysical flows - the Bickley jet as well as the Antarctic stratospheric polar vortex.

Deep Vadose Zone Flow and Transport Behavior at T-Tunnel Complex, Rainier Mesa, Nevada National Security Site

NASA Astrophysics Data System (ADS)

Parashar, R.; Reeves, D. M.

2010-12-01

Rainier Mesa, a tuffaceous plateau on the Nevada National Security Site, has been the location of numerous subsurface nuclear tests conducted in a series of tunnel complexes located approximately 450 m below the top of the mesa and 500 m above the regional groundwater flow system. The tunnels were constructed near the middle of an 800 m Tertiary sequence of faulted, low-permeability welded and non-welded bedded, vitric, and zeolitized tuff units. Water levels from wells in the vicinity of the T-tunnel complex indicate the presence of a perched saturation zone located approximately 100 m above the T-tunnel complex. This upper zone of saturation extends downward through most of the Tertiary sequence. The groundwater table is located at an elevation of 1300 m within a thrust sheet of Paleozoic carbonates, corresponding to the lower carbonate aquifer hydrostratigraphic unit (LCA3). The LCA3 is considered to be hydraulically connected to the Death Valley regional flow system. The objective of this project is to simulate complex downward patterns of fluid flow and radionuclide transport from the T-tunnel complex through the matrix and fault networks of the Tertiary tuff units to the water table. We developed an improved fracture characterization and mapping methodology consisting of displacement-length scaling relationships, simulation of realistic fault networks based on site-specific data, and the development of novel fracture network upscaling techniques that preserves fracture network flow and transport properties on coarse continuum grid. Development of upscaling method for fracture continua is based on the concepts of discrete fracture network modeling approach which performs better at honoring network connectivity and anisotropy of sparse networks in comparison to other established methods such as a tensor approach. Extensive flow simulations in the dual-continuum framework demonstrate that the characteristics of fault networks strongly influences the saturation profile and formation of perched zones, although they may not conduct a large amount of flow when compared to the matrix continua. The simulated results are found to be very sensitive to distribution of fracture aperture, density of the network, and spatial pattern of fracture clustering. The faults provide rapid pathways for radionuclide transport and the conceptual modeling of diffusional mass transfer between matrix and fracture continua plays a vital role in prediction of the overall behavior of the breakthrough curve.

Communication Dynamics in Finite Capacity Social Networks

NASA Astrophysics Data System (ADS)

Haerter, Jan O.; Jamtveit, Bjørn; Mathiesen, Joachim

2012-10-01

In communication networks, structure and dynamics are tightly coupled. The structure controls the flow of information and is itself shaped by the dynamical process of information exchanged between nodes. In order to reconcile structure and dynamics, a generic model, based on the local interaction between nodes, is considered for the communication in large social networks. In agreement with data from a large human organization, we show that the flow is non-Markovian and controlled by the temporal limitations of individuals. We confirm the versatility of our model by predicting simultaneously the degree-dependent node activity, the balance between information input and output of nodes, and the degree distribution. Finally, we quantify the limitations to network analysis when it is based on data sampled over a finite period of time.

Robust optimal control of material flows in demand-driven supply networks

NASA Astrophysics Data System (ADS)

Laumanns, Marco; Lefeber, Erjen

2006-04-01

We develop a model based on stochastic discrete-time controlled dynamical systems in order to derive optimal policies for controlling the material flow in supply networks. Each node in the network is described as a transducer such that the dynamics of the material and information flows within the entire network can be expressed by a system of first-order difference equations, where some inputs to the system act as external disturbances. We apply methods from constrained robust optimal control to compute the explicit control law as a function of the current state. For the numerical examples considered, these control laws correspond to certain classes of optimal ordering policies from inventory management while avoiding, however, any a priori assumptions about the general form of the policy.

Ad hoc Laser networks component technology for modular spacecraft

NASA Astrophysics Data System (ADS)

Huang, Xiujun; Shi, Dele; Ma, Zongfeng; Shen, Jingshi

2016-03-01

Distributed reconfigurable satellite is a new kind of spacecraft system, which is based on a flexible platform of modularization and standardization. Based on the module data flow analysis of the spacecraft, this paper proposes a network component of ad hoc Laser networks architecture. Low speed control network with high speed load network of Microwave-Laser communication mode, no mesh network mode, to improve the flexibility of the network. Ad hoc Laser networks component technology was developed, and carried out the related performance testing and experiment. The results showed that ad hoc Laser networks components can meet the demand of future networking between the module of spacecraft.

Ad hoc laser networks component technology for modular spacecraft

NASA Astrophysics Data System (ADS)

Huang, Xiujun; Shi, Dele; Shen, Jingshi

2017-10-01

Distributed reconfigurable satellite is a new kind of spacecraft system, which is based on a flexible platform of modularization and standardization. Based on the module data flow analysis of the spacecraft, this paper proposes a network component of ad hoc Laser networks architecture. Low speed control network with high speed load network of Microwave-Laser communication mode, no mesh network mode, to improve the flexibility of the network. Ad hoc Laser networks component technology was developed, and carried out the related performance testing and experiment. The results showed that ad hoc Laser networks components can meet the demand of future networking between the module of spacecraft.

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.

A new algorithm for grid-based hydrologic analysis by incorporating stormwater infrastructure

NASA Astrophysics Data System (ADS)

Choi, Yosoon; Yi, Huiuk; Park, Hyeong-Dong

2011-08-01

We developed a new algorithm, the Adaptive Stormwater Infrastructure (ASI) algorithm, to incorporate ancillary data sets related to stormwater infrastructure into the grid-based hydrologic analysis. The algorithm simultaneously considers the effects of the surface stormwater collector network (e.g., diversions, roadside ditches, and canals) and underground stormwater conveyance systems (e.g., waterway tunnels, collector pipes, and culverts). The surface drainage flows controlled by the surface runoff collector network are superimposed onto the flow directions derived from a DEM. After examining the connections between inlets and outfalls in the underground stormwater conveyance system, the flow accumulation and delineation of watersheds are calculated based on recursive computations. Application of the algorithm to the Sangdong tailings dam in Korea revealed superior performance to that of a conventional D8 single-flow algorithm in terms of providing reasonable hydrologic information on watersheds with stormwater infrastructure.

Availability Improvement of Layer 2 Seamless Networks Using OpenFlow

PubMed Central

Molina, Elias; Jacob, Eduardo; Matias, Jon; Moreira, Naiara; Astarloa, Armando

2015-01-01

The network robustness and reliability are strongly influenced by the implementation of redundancy and its ability of reacting to changes. In situations where packet loss or maximum latency requirements are critical, replication of resources and information may become the optimal technique. To this end, the IEC 62439-3 Parallel Redundancy Protocol (PRP) provides seamless recovery in layer 2 networks by delegating the redundancy management to the end-nodes. In this paper, we present a combination of the Software-Defined Networking (SDN) approach and PRP topologies to establish a higher level of redundancy and thereby, through several active paths provisioned via the OpenFlow protocol, the global reliability is increased, as well as data flows are managed efficiently. Hence, the experiments with multiple failure scenarios, which have been run over the Mininet network emulator, show the improvement in the availability and responsiveness over other traditional technologies based on a single active path. PMID:25759861

Availability improvement of layer 2 seamless networks using OpenFlow.

PubMed

Molina, Elias; Jacob, Eduardo; Matias, Jon; Moreira, Naiara; Astarloa, Armando

2015-01-01

The network robustness and reliability are strongly influenced by the implementation of redundancy and its ability of reacting to changes. In situations where packet loss or maximum latency requirements are critical, replication of resources and information may become the optimal technique. To this end, the IEC 62439-3 Parallel Redundancy Protocol (PRP) provides seamless recovery in layer 2 networks by delegating the redundancy management to the end-nodes. In this paper, we present a combination of the Software-Defined Networking (SDN) approach and PRP topologies to establish a higher level of redundancy and thereby, through several active paths provisioned via the OpenFlow protocol, the global reliability is increased, as well as data flows are managed efficiently. Hence, the experiments with multiple failure scenarios, which have been run over the Mininet network emulator, show the improvement in the availability and responsiveness over other traditional technologies based on a single active path.

A multiclass vehicular dynamic traffic flow model for main roads and dedicated lanes/roads of multimodal transport network

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

Sossoe, K.S., E-mail: kwami.sossoe@irt-systemx.fr; Lebacque, J-P., E-mail: jean-patrick.lebacque@ifsttar.fr

2015-03-10

We present in this paper a model of vehicular traffic flow for a multimodal transportation road network. We introduce the notion of class of vehicles to refer to vehicles of different transport modes. Our model describes the traffic on highways (which may contain several lanes) and network transit for pubic transportation. The model is drafted with Eulerian and Lagrangian coordinates and uses a Logit model to describe the traffic assignment of our multiclass vehicular flow description on shared roads. The paper also discusses traffic streams on dedicated lanes for specific class of vehicles with event-based traffic laws. An Euler-Lagrangian-remap schememore » is introduced to numerically approximate the model’s flow equations.« less

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

XFEM modeling of hydraulic fracture in porous rocks with natural fractures

NASA Astrophysics Data System (ADS)

Wang, Tao; Liu, ZhanLi; Zeng, QingLei; Gao, Yue; Zhuang, Zhuo

2017-08-01

Hydraulic fracture (HF) in porous rocks is a complex multi-physics coupling process which involves fluid flow, diffusion and solid deformation. In this paper, the extended finite element method (XFEM) coupling with Biot theory is developed to study the HF in permeable rocks with natural fractures (NFs). In the recent XFEM based computational HF models, the fluid flow in fractures and interstitials of the porous media are mostly solved separately, which brings difficulties in dealing with complex fracture morphology. In our new model the fluid flow is solved in a unified framework by considering the fractures as a kind of special porous media and introducing Poiseuille-type flow inside them instead of Darcy-type flow. The most advantage is that it is very convenient to deal with fluid flow inside the complex fracture network, which is important in shale gas extraction. The weak formulation for the new coupled model is derived based on virtual work principle, which includes the XFEM formulation for multiple fractures and fractures intersection in porous media and finite element formulation for the unified fluid flow. Then the plane strain Kristianovic-Geertsma-de Klerk (KGD) model and the fluid flow inside the fracture network are simulated to validate the accuracy and applicability of this method. The numerical results show that large injection rate, low rock permeability and isotropic in-situ stresses tend to lead to a more uniform and productive fracture network.

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.

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

Network-wide BGP route prediction for traffic engineering

NASA Astrophysics Data System (ADS)

Feamster, Nick; Rexford, Jennifer

2002-07-01

The Internet consists of about 13,000 Autonomous Systems (AS's) that exchange routing information using the Border Gateway Protocol (BGP). The operators of each AS must have control over the flow of traffic through their network and between neighboring AS's. However, BGP is a complicated, policy-based protocol that does not include any direct support for traffic engineering. In previous work, we have demonstrated that network operators can adapt the flow of traffic in an efficient and predictable fashion through careful adjustments to the BGP policies running on their edge routers. Nevertheless, many details of the BGP protocol and decision process make predicting the effects of these policy changes difficult. In this paper, we describe a tool that predicts traffic flow at network exit points based on the network topology, the import policy associated with each BGP session, and the routing advertisements received from neighboring AS's. We present a linear-time algorithm that computes a network-wide view of the best BGP routes for each destination prefix given a static snapshot of the network state, without simulating the complex details of BGP message passing. We describe how to construct this snapshot using the BGP routing tables and router configuration files available from operational routers. We verify the accuracy of our algorithm by applying our tool to routing and configuration data from AT&T's commercial IP network. Our route prediction techniques help support the operation of large IP backbone networks, where interdomain routing is an important aspect of traffic engineering.

Characterizing the correlations between local phase fractions of gas-liquid two-phase flow with wire-mesh sensor.

PubMed

Tan, C; Liu, W L; Dong, F

2016-06-28

Understanding of flow patterns and their transitions is significant to uncover the flow mechanics of two-phase flow. The local phase distribution and its fluctuations contain rich information regarding the flow structures. A wire-mesh sensor (WMS) was used to study the local phase fluctuations of horizontal gas-liquid two-phase flow, which was verified through comparing the reconstructed three-dimensional flow structure with photographs taken during the experiments. Each crossing point of the WMS is treated as a node, so the measurement on each node is the phase fraction in this local area. An undirected and unweighted flow pattern network was established based on connections that are formed by cross-correlating the time series of each node under different flow patterns. The structure of the flow pattern network reveals the relationship of the phase fluctuations at each node during flow pattern transition, which is then quantified by introducing the topological index of the complex network. The proposed analysis method using the WMS not only provides three-dimensional visualizations of the gas-liquid two-phase flow, but is also a thorough analysis for the structure of flow patterns and the characteristics of flow pattern transition. This article is part of the themed issue 'Supersensing through industrial process tomography'. © 2016 The Author(s).

Characterizing the correlations between local phase fractions of gas–liquid two-phase flow with wire-mesh sensor

PubMed Central

Liu, W. L.; Dong, F.

2016-01-01

Understanding of flow patterns and their transitions is significant to uncover the flow mechanics of two-phase flow. The local phase distribution and its fluctuations contain rich information regarding the flow structures. A wire-mesh sensor (WMS) was used to study the local phase fluctuations of horizontal gas–liquid two-phase flow, which was verified through comparing the reconstructed three-dimensional flow structure with photographs taken during the experiments. Each crossing point of the WMS is treated as a node, so the measurement on each node is the phase fraction in this local area. An undirected and unweighted flow pattern network was established based on connections that are formed by cross-correlating the time series of each node under different flow patterns. The structure of the flow pattern network reveals the relationship of the phase fluctuations at each node during flow pattern transition, which is then quantified by introducing the topological index of the complex network. The proposed analysis method using the WMS not only provides three-dimensional visualizations of the gas–liquid two-phase flow, but is also a thorough analysis for the structure of flow patterns and the characteristics of flow pattern transition. This article is part of the themed issue ‘Supersensing through industrial process tomography’. PMID:27185959

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.

Origin of Permeability and Structure of Flows in Fractured Media

NASA Astrophysics Data System (ADS)

De Dreuzy, J.; Darcel, C.; Davy, P.; Erhel, J.; Le Goc, R.; Maillot, J.; Meheust, Y.; Pichot, G.; Poirriez, B.

2013-12-01

After more than three decades of research, flows in fractured media have been shown to result from multi-scale geological structures. Flows result non-exclusively from the damage zone of the large faults, from the percolation within denser networks of smaller fractures, from the aperture heterogeneity within the fracture planes and from some remaining permeability within the matrix. While the effect of each of these causes has been studied independently, global assessments of the main determinisms is still needed. We propose a general approach to determine the geological structures responsible for flows, their permeability and their organization based on field data and numerical modeling [de Dreuzy et al., 2012b]. Multi-scale synthetic networks are reconstructed from field data and simplified mechanical modeling [Davy et al., 2010]. High-performance numerical methods are developed to comply with the specificities of the geometry and physical properties of the fractured media [Pichot et al., 2010; Pichot et al., 2012]. And, based on a large Monte-Carlo sampling, we determine the key determinisms of fractured permeability and flows (Figure). We illustrate our approach on the respective influence of fracture apertures and fracture correlation patterns at large scale. We show the potential role of fracture intersections, so far overlooked between the fracture and the network scales. We also demonstrate how fracture correlations reduce the bulk fracture permeability. Using this analysis, we highlight the need for more specific in-situ characterization of fracture flow structures. Fracture modeling and characterization are necessary to meet the new requirements of a growing number of applications where fractures appear both as potential advantages to enhance permeability and drawbacks for safety, e.g. in energy storage, stimulated geothermal energy and non-conventional gas productions. References Davy, P., et al. (2010), A likely universal model of fracture scaling and its consequence for crustal hydromechanics, Journal of Geophysical Research-Solid Earth, 115, 13. de Dreuzy, J.-R., et al. (2012a), Influence of fracture scale heterogeneity on the flow properties of three-dimensional Discrete Fracture Networks (DFN), J. Geophys. Res.-Earth Surf., 117(B11207), 21 PP. de Dreuzy, J.-R., et al. (2012b), Synthetic benchmark for modeling flow in 3D fractured media, Computers and Geosciences(0). Pichot, G., et al. (2010), A Mixed Hybrid Mortar Method for solving flow in Discrete Fracture Networks, Applicable Analysis, 89(10), 1729-1643. Pichot, G., et al. (2012), Flow simulation in 3D multi-scale fractured networks using non-matching meshes, SIAM Journal on Scientific Computing (SISC), 34(1). Figure: (a) Fracture network with a broad-range of fracture lengths. (b) Flows (log-scale) with homogeneous fractures. (c) Flows (log-scale) with heterogeneous fractures [de Dreuzy et al., 2012a]. The impact of the fracture apertures (c) is illustrated on the organization of flows.

Eavesdropping-aware routing and spectrum allocation based on multi-flow virtual concatenation for confidential information service in elastic optical networks

NASA Astrophysics Data System (ADS)

Bai, Wei; Yang, Hui; Yu, Ao; Xiao, Hongyun; He, Linkuan; Feng, Lei; Zhang, Jie

2018-01-01

The leakage of confidential information is one of important issues in the network security area. Elastic Optical Networks (EON) as a promising technology in the optical transport network is under threat from eavesdropping attacks. It is a great demand to support confidential information service (CIS) and design efficient security strategy against the eavesdropping attacks. In this paper, we propose a solution to cope with the eavesdropping attacks in routing and spectrum allocation. Firstly, we introduce probability theory to describe eavesdropping issue and achieve awareness of eavesdropping attacks. Then we propose an eavesdropping-aware routing and spectrum allocation (ES-RSA) algorithm to guarantee information security. For further improving security and network performance, we employ multi-flow virtual concatenation (MFVC) and propose an eavesdropping-aware MFVC-based secure routing and spectrum allocation (MES-RSA) algorithm. The presented simulation results show that the proposed two RSA algorithms can both achieve greater security against the eavesdropping attacks and MES-RSA can also improve the network performance efficiently.

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.

A FRAMEWORK FOR ATTRIBUTE-BASED COMMUNITY DETECTION WITH APPLICATIONS TO INTEGRATED FUNCTIONAL GENOMICS.

PubMed

Yu, Han; Hageman Blair, Rachael

2016-01-01

Understanding community structure in networks has received considerable attention in recent years. Detecting and leveraging community structure holds promise for understanding and potentially intervening with the spread of influence. Network features of this type have important implications in a number of research areas, including, marketing, social networks, and biology. However, an overwhelming majority of traditional approaches to community detection cannot readily incorporate information of node attributes. Integrating structural and attribute information is a major challenge. We propose a exible iterative method; inverse regularized Markov Clustering (irMCL), to network clustering via the manipulation of the transition probability matrix (aka stochastic flow) corresponding to a graph. Similar to traditional Markov Clustering, irMCL iterates between "expand" and "inflate" operations, which aim to strengthen the intra-cluster flow, while weakening the inter-cluster flow. Attribute information is directly incorporated into the iterative method through a sigmoid (logistic function) that naturally dampens attribute influence that is contradictory to the stochastic flow through the network. We demonstrate advantages and the exibility of our approach using simulations and real data. We highlight an application that integrates breast cancer gene expression data set and a functional network defined via KEGG pathways reveal significant modules for survival.

River flow modeling using artificial neural networks in Kapuas river, West Kalimantan, Indonesia

NASA Astrophysics Data System (ADS)

Herawati, Henny; Suripin, Suharyanto

2017-11-01

Kapuas River is located in the province of West Kalimantan. Kapuas river length is 1,086 km and river basin areas about 100,000 Km2. The availability of river flow data in the Long River and very wide catchments are difficult to obtain, while river flow data are essential for planning waterworks. To predict the water flow in the catchment area requires a lot of hydrology coefficient, so it is very difficult to predict and obtain results that closer to the real conditions. This paper demonstrates that artificial neural network (ANN) could be used to predict the water flow. The ANN technique can be used to predict the incidence of water discharge that occurs in the Kapuas River based on rainfall and evaporation data. With the data available to do training on the artificial neural network model is obtained mean square error (MSE) 0.00007. The river flow predictions could be carried out after the training. The results showed differences in water discharge measurement and prediction of about 4%.

Coupling Network Computing Applications in Air-cooled Turbine Blades Optimization

NASA Astrophysics Data System (ADS)

Shi, Liang; Yan, Peigang; Xie, Ming; Han, Wanjin

2018-05-01

Through establishing control parameters from blade outside to inside, the parametric design of air-cooled turbine blade based on airfoil has been implemented. On the basis of fast updating structure features and generating solid model, a complex cooling system has been created. Different flow units are modeled into a complex network topology with parallel and serial connection. Applying one-dimensional flow theory, programs have been composed to get pipeline network physical quantities along flow path, including flow rate, pressure, temperature and other parameters. These inner units parameters set as inner boundary conditions for external flow field calculation program HIT-3D by interpolation, thus to achieve full field thermal coupling simulation. Referring the studies in literatures to verify the effectiveness of pipeline network program and coupling algorithm. After that, on the basis of a modified design, and with the help of iSIGHT-FD, an optimization platform had been established. Through MIGA mechanism, the target of enhancing cooling efficiency has been reached, and the thermal stress has been effectively reduced. Research work in this paper has significance for rapid deploying the cooling structure design.

Gas network model allows full reservoir coupling

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

Methnani, M.M.

The gas-network flow model (Gasnet) developed for and added to an existing Qatar General Petroleum Corp. (OGPC) in-house reservoir simulator, allows improved modeling of the interaction among the reservoir, wells, and pipeline networks. Gasnet is a three-phase model that is modified to handle gas-condensate systems. The numerical solution is based on a control volume scheme that uses the concept of cells and junctions, whereby pressure and phase densities are defined in cells, while phase flows are defined at junction links. The model features common numerical equations for the reservoir, the well, and the pipeline components and an efficient state-variable solutionmore » method in which all primary variables including phase flows are solved directly. Both steady-state and transient flow events can be simulated with the same tool. Three test cases show how the model runs. One case simulates flow redistribution in a simple two-branch gas network. The second simulates a horizontal gas well in a waterflooded gas reservoir. The third involves an export gas pipeline coupled to a producing reservoir.« less

Network-induced oscillatory behavior in material flow networks and irregular business cycles

NASA Astrophysics Data System (ADS)

Helbing, Dirk; Lämmer, Stefen; Witt, Ulrich; Brenner, Thomas

2004-11-01

Network theory is rapidly changing our understanding of complex systems, but the relevance of topological features for the dynamic behavior of metabolic networks, food webs, production systems, information networks, or cascade failures of power grids remains to be explored. Based on a simple model of supply networks, we offer an interpretation of instabilities and oscillations observed in biological, ecological, economic, and engineering systems. We find that most supply networks display damped oscillations, even when their units—and linear chains of these units—behave in a nonoscillatory way. Moreover, networks of damped oscillators tend to produce growing oscillations. This surprising behavior offers, for example, a different interpretation of business cycles and of oscillating or pulsating processes. The network structure of material flows itself turns out to be a source of instability, and cyclical variations are an inherent feature of decentralized adjustments.

A flow-control mechanism for distributed systems

NASA Technical Reports Server (NTRS)

Maitan, J.

1991-01-01

A new approach to the rate-based flow control in store-and-forward networks is evaluated. Existing methods display oscillations in the presence of transport delays. The proposed scheme is based on the explicit use of an embedded dynamic model of a store-and-forward buffer in a controller's feedback loop. It is shown that the use of the model eliminates the oscillations caused by the transport delays. The paper presents simulation examples and assesses the applicability of the scheme in the new generation of high-speed photonic networks where transport delays must be considered.

High-efficient Extraction of Drainage Networks from Digital Elevation Model Data Constrained by Enhanced Flow Enforcement from Known River Map

NASA Astrophysics Data System (ADS)

Wu, T.; Li, T.; Li, J.; Wang, G.

2017-12-01

Improved drainage network extraction can be achieved by flow enforcement whereby information of known river maps is imposed to the flow-path modeling process. However, the common elevation-based stream burning method can sometimes cause unintended topological errors and misinterpret the overall drainage pattern. We presented an enhanced flow enforcement method to facilitate accurate and efficient process of drainage network extraction. Both the topology of the mapped hydrography and the initial landscape of the DEM are well preserved and fully utilized in the proposed method. An improved stream rasterization is achieved here, yielding continuous, unambiguous and stream-collision-free raster equivalent of stream vectors for flow enforcement. By imposing priority-based enforcement with a complementary flow direction enhancement procedure, the drainage patterns of the mapped hydrography are fully represented in the derived results. The proposed method was tested over the Rogue River Basin, using DEMs with various resolutions. As indicated by the visual and statistical analyses, the proposed method has three major advantages: (1) it significantly reduces the occurrences of topological errors, yielding very accurate watershed partition and channel delineation, (2) it ensures scale-consistent performance at DEMs of various resolutions, and (3) the entire extraction process is well-designed to achieve great computational efficiency.

Flowable Conducting Particle Networks in Redox-Active Electrolytes for Grid Energy Storage

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

Hatzell, K. B.; Boota, M.; Kumbur, E. C.

2015-01-01

This study reports a new hybrid approach toward achieving high volumetric energy and power densities in an electrochemical flow capacitor for grid energy storage. The electrochemical flow capacitor suffers from high self-discharge and low energy density because charge storage is limited to the available surface area (electric double layer charge storage). Here, we examine two carbon materials as conducting particles in a flow battery electrolyte containing the VO2+/VO2+ redox couple. Highly porous activated carbon spheres (CSs) and multi-walled carbon nanotubes (MWCNTs) are investigated as conducting particle networks that facilitate both faradaic and electric double layer charge storage. Charge storage contributionsmore » (electric double layer and faradaic) are distinguished for flow-electrodes composed of MWCNTs and activated CSs. A MWCNT flow-electrode based in a redox-active electrolyte containing the VO2+/VO2+ redox couple demonstrates 18% less self-discharge, 10 X more energy density, and 20 X greater power densities (at 20 mV s-1) than one based on a non-redox active electrolyte. Furthermore, a MWCNT redox-active flow electrode demonstrates 80% capacitance retention, and >95% coulombic efficiency over 100 cycles, indicating the feasibility of utilizing conducting networks with redox chemistries for grid energy storage.« less

Flowable conducting particle networks in redox-active electrolytes for grid energy storage

DOE PAGES

Hatzell, K. B.; Boota, M.; Kumbur, E. C.; ...

2015-01-09

This paper reports a new hybrid approach toward achieving high volumetric energy and power densities in an electrochemical flow capacitor for grid energy storage. The electrochemical flow capacitor suffers from high self-discharge and low energy density because charge storage is limited to the available surface area (electric double layer charge storage). Here, we examine two carbon materials as conducting particles in a flow battery electrolyte containing the VO 2+/VO 2 + redox couple. Highly porous activated carbon spheres (CSs) and multi-walled carbon nanotubes (MWCNTs) are investigated as conducting particle networks that facilitate both faradaic and electric double layer charge storage.more » Charge storage contributions (electric double layer and faradaic) are distinguished for flow-electrodes composed of MWCNTs and activated CSs. A MWCNT flow-electrode based in a redox-active electrolyte containing the VO 2+/VO 2 + redox couple demonstrates 18% less self-discharge, 10 X more energy density, and 20 X greater power densities (at 20 mV s -1) than one based on a non-redox active electrolyte. Additionally, a MWCNT redox-active flow electrode demonstrates 80% capacitance retention, and >95% coulombic efficiency over 100 cycles, indicating the feasibility of utilizing conducting networks with redox chemistries for grid energy storage.« 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.

Fabrication and Operation of Microfluidic Hanging-Drop Networks.

PubMed

Misun, Patrick M; Birchler, Axel K; Lang, Moritz; Hierlemann, Andreas; Frey, Olivier

2018-01-01

The hanging-drop network (HDN) is a technology platform based on a completely open microfluidic network at the bottom of an inverted, surface-patterned substrate. The platform is predominantly used for the formation, culturing, and interaction of self-assembled spherical microtissues (spheroids) under precisely controlled flow conditions. Here, we describe design, fabrication, and operation of microfluidic hanging-drop networks.

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.

Interactions between Financial and Environmental Networks in OECD Countries.

PubMed

Ruzzenenti, Franco; Joseph, Andreas; Ticci, Elisa; Vozzella, Pietro; Gabbi, Giampaolo

2015-01-01

We analysed a multiplex of financial and environmental networks between OECD countries from 2002 to 2010. Foreign direct investments and portfolio investment showing the flows in equity securities, short-term, long-term and total debt, these securities represent the financial layers; emissions of NOx, PM10, SO2, CO2 equivalent and the water footprint associated with international trade represent the environmental layers. We present a new measure of cross-layer correlations between flows in different layers based on reciprocity. For the assessment of results, we implement a null model for this measure based on the exponential random graph theory. We find that short-term financial flows are more correlated with environmental flows than long-term investments. Moreover, the correlations between reverse financial and environmental flows (i.e. the flows of different layers going in opposite directions) are generally stronger than correlations between synergic flows (flows going in the same direction). This suggests a trade-off between financial and environmental layers, where, more financialised countries display higher correlations between outgoing financial flows and incoming environmental flows than from lower financialised countries. Five countries are identified as hubs in this finance-environment multiplex: The United States, France, Germany, Belgium-Luxembourg and United Kingdom.

Interactions between Financial and Environmental Networks in OECD Countries

PubMed Central

Ruzzenenti, Franco; Joseph, Andreas; Ticci, Elisa; Vozzella, Pietro; Gabbi, Giampaolo

2015-01-01

We analysed a multiplex of financial and environmental networks between OECD countries from 2002 to 2010. Foreign direct investments and portfolio investment showing the flows in equity securities, short-term, long-term and total debt, these securities represent the financial layers; emissions of NO x, PM10, SO 2, CO 2 equivalent and the water footprint associated with international trade represent the environmental layers. We present a new measure of cross-layer correlations between flows in different layers based on reciprocity. For the assessment of results, we implement a null model for this measure based on the exponential random graph theory. We find that short-term financial flows are more correlated with environmental flows than long-term investments. Moreover, the correlations between reverse financial and environmental flows (i.e. the flows of different layers going in opposite directions) are generally stronger than correlations between synergic flows (flows going in the same direction). This suggests a trade-off between financial and environmental layers, where, more financialised countries display higher correlations between outgoing financial flows and incoming environmental flows than from lower financialised countries. Five countries are identified as hubs in this finance-environment multiplex: The United States, France, Germany, Belgium-Luxembourg and United Kingdom. PMID:26375393

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.

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

A novel PON based UMTS broadband wireless access network architecture with an algorithm to guarantee end to end QoS

NASA Astrophysics Data System (ADS)

Sana, Ajaz; Hussain, Shahab; Ali, Mohammed A.; Ahmed, Samir

2007-09-01

In this paper we proposes a novel Passive Optical Network (PON) based broadband wireless access network architecture to provide multimedia services (video telephony, video streaming, mobile TV, mobile emails etc) to mobile users. In the conventional wireless access networks, the base stations (Node B) and Radio Network Controllers (RNC) are connected by point to point T1/E1 lines (Iub interface). The T1/E1 lines are expensive and add up to operating costs. Also the resources (transceivers and T1/E1) are designed for peak hours traffic, so most of the time the dedicated resources are idle and wasted. Further more the T1/E1 lines are not capable of supporting bandwidth (BW) required by next generation wireless multimedia services proposed by High Speed Packet Access (HSPA, Rel.5) for Universal Mobile Telecommunications System (UMTS) and Evolution Data only (EV-DO) for Code Division Multiple Access 2000 (CDMA2000). The proposed PON based back haul can provide Giga bit data rates and Iub interface can be dynamically shared by Node Bs. The BW is dynamically allocated and the unused BW from lightly loaded Node Bs is assigned to heavily loaded Node Bs. We also propose a novel algorithm to provide end to end Quality of Service (QoS) (between RNC and user equipment).The algorithm provides QoS bounds in the wired domain as well as in wireless domain with compensation for wireless link errors. Because of the air interface there can be certain times when the user equipment (UE) is unable to communicate with Node B (usually referred to as link error). Since the link errors are bursty and location dependent. For a proposed approach, the scheduler at the Node B maps priorities and weights for QoS into wireless MAC. The compensations for errored links is provided by the swapping of services between the active users and the user data is divided into flows, with flows allowed to lag or lead. The algorithm guarantees (1)delay and throughput for error-free flows,(2)short term fairness among error-free flows,(3)long term fairness among errored and error-free flows,(4)graceful degradation for leading flows and graceful compensation for lagging flows.

Optimization of the graph model of the water conduit network, based on the approach of search space reducing

NASA Astrophysics Data System (ADS)

Korovin, Iakov S.; Tkachenko, Maxim G.

2018-03-01

In this paper we present a heuristic approach, improving the efficiency of methods, used for creation of efficient architecture of water distribution networks. The essence of the approach is a procedure of search space reduction the by limiting the range of available pipe diameters that can be used for each edge of the network graph. In order to proceed the reduction, two opposite boundary scenarios for the distribution of flows are analysed, after which the resulting range is further narrowed by applying a flow rate limitation for each edge of the network. The first boundary scenario provides the most uniform distribution of the flow in the network, the opposite scenario created the net with the highest possible flow level. The parameters of both distributions are calculated by optimizing systems of quadratic functions in a confined space, which can be effectively performed with small time costs. This approach was used to modify the genetic algorithm (GA). The proposed GA provides a variable number of variants of each gene, according to the number of diameters in list, taking into account flow restrictions. The proposed approach was implemented to the evaluation of a well-known test network - the Hanoi water distribution network [1], the results of research were compared with a classical GA with an unlimited search space. On the test data, the proposed trip significantly reduced the search space and provided faster and more obvious convergence in comparison with the classical version of GA.

Qualitative modeling of normal blood coagulation and its pathological states using stochastic activity networks.

PubMed

Mounts, W M; Liebman, M N

1997-07-01

We have developed a method for representing biological pathways and simulating their behavior based on the use of stochastic activity networks (SANs). SANs, an extension of the original Petri net, have been used traditionally to model flow systems including data-communications networks and manufacturing processes. We apply the methodology to the blood coagulation cascade, a biological flow system, and present the representation method as well as results of simulation studies based on published experimental data. In addition to describing the dynamic model, we also present the results of its utilization to perform simulations of clinical states including hemophilia's A and B as well as sensitivity analysis of individual factors and their impact on thrombin production.

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.

"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.

Time-series network analysis of civil aviation in Japan (1985-2005)

NASA Astrophysics Data System (ADS)

Michishita, Ryo; Xu, Bing; Yamada, Ikuho

2008-10-01

Due to the airline deregulation in 1985, a series of new airport developments in the 1990s and 2000s, and the reorganization of airline companies in the 2000s, Japan's air passenger transportation has been dramatically altered in the last two decades in many ways. In this paper, the authors examine how the network and flow structures of domestic air passenger transportation in Japan have geographically changed since 1985. For this purpose, passenger flow data in 1985, 1995, and 2005 were extracted from the Air Transportation Statistical Survey conducted by the Ministry of Land, Infrastructure and Transport, Japan. First, national and regional hub airports are identified via dominant flow and hub function analysis. Then the roles of the hub airports and individual connections over the network are examined with respect to their spatial and network autocorrelations. Spatial and network autocorrelations were evaluated both globally and locally using Moran's I and LISA statistics. The passenger flow data were first examined as a whole and then divided into 3 airline-based categories. Dominant flow and hub function enabled us to detect the hub airports. Structural processes of the hub-and-spoke network were confirmed in each airline through spatial autocorrelation analysis. Network autocorrelation analysis showed that all airlines ingeniously optimized their networks by connecting their routes with large numbers of passengers to other routes with large numbers of passengers, and routes with small numbers of passengers to other routes with small numbers of passengers. The effects of political events and the changes in the strategies of each airline on the whole networks were strongly reflected in the results of this study.

Multiscale fracture network characterization and impact on flow: A case study on the Latemar carbonate platform

NASA Astrophysics Data System (ADS)

Hardebol, N. J.; Maier, C.; Nick, H.; Geiger, S.; Bertotti, G.; Boro, H.

2015-12-01

A fracture network arrangement is quantified across an isolated carbonate platform from outcrop and aerial imagery to address its impact on fluid flow. The network is described in terms of fracture density, orientation, and length distribution parameters. Of particular interest is the role of fracture cross connections and abutments on the effective permeability. Hence, the flow simulations explicitly account for network topology by adopting Discrete-Fracture-and-Matrix description. The interior of the Latemar carbonate platform (Dolomites, Italy) is taken as outcrop analogue for subsurface reservoirs of isolated carbonate build-ups that exhibit a fracture-dominated permeability. New is our dual strategy to describe the fracture network both as deterministic- and stochastic-based inputs for flow simulations. The fracture geometries are captured explicitly and form a multiscale data set by integration of interpretations from outcrops, airborne imagery, and lidar. The deterministic network descriptions form the basis for descriptive rules that are diagnostic of the complex natural fracture arrangement. The fracture networks exhibit a variable degree of multitier hierarchies with smaller-sized fractures abutting against larger fractures under both right and oblique angles. The influence of network topology on connectivity is quantified using Discrete-Fracture-Single phase fluid flow simulations. The simulation results show that the effective permeability for the fracture and matrix ensemble can be 50 to 400 times higher than the matrix permeability of 1.0 · 10-14 m2. The permeability enhancement is strongly controlled by the connectivity of the fracture network. Therefore, the degree of intersecting and abutting fractures should be captured from outcrops with accuracy to be of value as analogue.

Development of a general method for obtaining the geometry of microfluidic networks

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

Razavi, Mohammad Sayed, E-mail: m.sayedrazavi@gmail.com; Salimpour, M. R.; Shirani, Ebrahim

2014-01-15

In the present study, a general method for geometry of fluidic networks is developed with emphasis on pressure-driven flows in the microfluidic applications. The design method is based on general features of network's geometry such as cross-sectional area and length of channels. Also, the method is applicable to various cross-sectional shapes such as circular, rectangular, triangular, and trapezoidal cross sections. Using constructal theory, the flow resistance, energy loss and performance of the network are optimized. Also, by this method, practical design strategies for the fabrication of microfluidic networks can be improved. The design method enables rapid prediction of fluid flowmore » in the complex network of channels and is very useful for improving proper miniaturization and integration of microfluidic networks. Minimization of flow resistance of the network of channels leads to universal constants for consecutive cross-sectional areas and lengths. For a Y-shaped network, the optimal ratios of consecutive cross-section areas (A{sub i+1}/A{sub i}) and lengths (L{sub i+1}/L{sub i}) are obtained as A{sub i+1}/A{sub i} = 2{sup −2/3} and L{sub i+1}/L{sub i} = 2{sup −1/3}, respectively. It is shown that energy loss in the network is proportional to the volume of network. It is also seen when the number of channels is increased both the hydraulic resistance and the volume occupied by the network are increased in a similar manner. Furthermore, the method offers that fabrication of multi-depth and multi-width microchannels should be considered as an integral part of designing procedures. Finally, numerical simulations for the fluid flow in the network have been performed and results show very good agreement with analytic results.« less

Traffic flow collection wireless sensor network node for intersection light control

NASA Astrophysics Data System (ADS)

Li, Xu; Li, Xue

2011-10-01

Wireless sensor network (WSN) is expected to be deployed in intersection to monitor the traffic flow continuously, and the monitoring datum can be used as the foundation of traffic light control. In this paper, a WSN based on ZigBee protocol for monitoring traffic flow is proposed. Structure, hardware and work flow of WSN nodes are designed. CC2431 from Texas Instrument is chosen as the main computational and transmission unit, and CC2591 as the amplification unit. The stability experiment and the actual environment experiment are carried out in the last of the paper. The results of experiments show that WSN has the ability to collect traffic flow information quickly and transmit the datum to the processing center in real time.

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.

Mechanics of blood supply to the heart: wave reflection effects in a right coronary artery.

PubMed Central

Zamir, M

1998-01-01

Mechanics of blood flow in the coronary circulation have in the past been based largely on models in which the detailed architecture of the coronary network is not included because of lack of data: properties of individual vessels do not appear individually in the model but are represented collectively by the elements of a single electric circuit. Recent data from the human heart make it possible, for the first time, to examine the dynamics of flow in the coronary network based on detailed, measured vascular architecture. In particular, admittance values along the full course of the right coronary artery are computed based on actual lengths and diameters of the many thousands of branches which make up the distribution system of this vessel. The results indicate that effects of wave reflections on this flow are far more significant than those generally suspected to occur in coronary blood flow and that they are actually the reverse of the well known wave reflection effects in the aorta. PMID:9523440

A Novel Biobjective Risk-Based Model for Stochastic Air Traffic Network Flow Optimization Problem.

PubMed

Cai, Kaiquan; Jia, Yaoguang; Zhu, Yanbo; Xiao, Mingming

2015-01-01

Network-wide air traffic flow management (ATFM) is an effective way to alleviate demand-capacity imbalances globally and thereafter reduce airspace congestion and flight delays. The conventional ATFM models assume the capacities of airports or airspace sectors are all predetermined. However, the capacity uncertainties due to the dynamics of convective weather may make the deterministic ATFM measures impractical. This paper investigates the stochastic air traffic network flow optimization (SATNFO) problem, which is formulated as a weighted biobjective 0-1 integer programming model. In order to evaluate the effect of capacity uncertainties on ATFM, the operational risk is modeled via probabilistic risk assessment and introduced as an extra objective in SATNFO problem. Computation experiments using real-world air traffic network data associated with simulated weather data show that presented model has far less constraints compared to stochastic model with nonanticipative constraints, which means our proposed model reduces the computation complexity.

How has climate change altered network connectivity in a mountain stream network?

NASA Astrophysics Data System (ADS)

Ward, A. S.; Schmadel, N.; Wondzell, S. M.; Johnson, S.

2017-12-01

Connectivity along river networks is broadly recognized as dynamic, with seasonal and event-based expansion and contraction of the network extent. Intermittently flowing streams are particularly important as they define a crucial threshold for continuously connected waters that enable migration by aquatic species. In the Pacific northwestern U.S., changes in atmospheric circulation have been found to alter rainfall patterns and result in decreased summer low-flows in the region. However, the impact of this climate dynamic on network connectivity is heretofore unstudied. Thus, we ask: How has connectivity in the riparian corridor changed in response to observed changes in climate? In this study we take the well-studied H.J. Andrews Experimental Forest as representative of mountain river networks in the Pacific northwestern U.S. First, we analyze 63 years of stream gauge information from a network of 11 gauges to document observed changes in timing and magnitude of stream discharge. We found declining magnitudes of seasonal low-flows and shifting seasonality of water export from the catchment, both of which we attribute to changes in precipitation timing and storage as snow vs. rainfall. Next, we use these discharge data to drive a reduced-complexity model of the river network to simulate network connectivity over 63 years. Model results show that network contraction (i.e., minimum network extent) has decreased over the past 63 years. Unexpectedly, the increasing winter peak flows did not correspond with increasing network expansion, suggesting a geologic control on maximum flowing network extent. We find dynamic expansion and contraction of the network primarily occurs during period of catchment discharge less than about 1 m3/s at the outlet, whereas the network extent is generally constant for discharges from 1 to 300 m3/s. Results of our study are of interest to scientists focused on connectivity as a control on ecological processes both directly (e.g., fish migration) and indirectly (e.g., stream temperature modeling). Additionally, our results inform management and regulatory needs such as estimating connectivity for entire river networks as a basis for regulation, and identifying the complexity of a shifting baseline in identifying a regulatory basis.

Realistic Data-Driven Traffic Flow Animation Using Texture Synthesis.

PubMed

Chao, Qianwen; Deng, Zhigang; Ren, Jiaping; Ye, Qianqian; Jin, Xiaogang

2018-02-01

We present a novel data-driven approach to populate virtual road networks with realistic traffic flows. Specifically, given a limited set of vehicle trajectories as the input samples, our approach first synthesizes a large set of vehicle trajectories. By taking the spatio-temporal information of traffic flows as a 2D texture, the generation of new traffic flows can be formulated as a texture synthesis process, which is solved by minimizing a newly developed traffic texture energy. The synthesized output captures the spatio-temporal dynamics of the input traffic flows, and the vehicle interactions in it strictly follow traffic rules. After that, we position the synthesized vehicle trajectory data to virtual road networks using a cage-based registration scheme, where a few traffic-specific constraints are enforced to maintain each vehicle's original spatial location and synchronize its motion in concert with its neighboring vehicles. Our approach is intuitive to control and scalable to the complexity of virtual road networks. We validated our approach through many experiments and paired comparison user studies.

Microfluidic circuit analysis II: implications of ion conservation for microchannels connected in series.

PubMed

Biscombe, Christian J C; Davidson, Malcolm R; Harvie, Dalton J E

2012-01-01

A mathematical framework for analysing electrokinetic flow in microchannel networks is outlined. The model is based on conservation of volume and total charge at network junctions, but in contrast to earlier theories also incorporates conservation of ion charge there. The model is applied to mixed pressure-driven/electro-osmotic flows of binary electrolytes through homogeneous microchannels as well as a 4:1:4 contraction-expansion series network. Under conditions of specified volumetric flow rate and ion currents, non-linear steady-state phenomena may arise: when the direction of the net co-ion flux is opposite to the direction of the net volumetric flow, two different fully developed, steady-state flow solutions may be obtained. Model predictions are compared with two-dimensional computational fluid dynamics (CFD) simulations. For systems where two steady states are realisable, the ultimate steady behaviour is shown to depend in part upon the initial state of the system. Copyright © 2011 Elsevier Inc. All rights reserved.

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.

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

Constitutive flow behaviour of austenitic stainless steels under hot deformation: artificial neural network modelling to understand, evaluate and predict

NASA Astrophysics Data System (ADS)

Mandal, Sumantra; Sivaprasad, P. V.; Venugopal, S.; Murthy, K. P. N.

2006-09-01

An artificial neural network (ANN) model is developed to predict the constitutive flow behaviour of austenitic stainless steels during hot deformation. The input parameters are alloy composition and process variables whereas flow stress is the output. The model is based on a three-layer feed-forward ANN with a back-propagation learning algorithm. The neural network is trained with an in-house database obtained from hot compression tests on various grades of austenitic stainless steels. The performance of the model is evaluated using a wide variety of statistical indices. Good agreement between experimental and predicted data is obtained. The correlation between individual alloying elements and high temperature flow behaviour is investigated by employing the ANN model. The results are found to be consistent with the physical phenomena. The model can be used as a guideline for new alloy development.

Control of Networked Traffic Flow Distribution - A Stochastic Distribution System Perspective

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

Wang, Hong; Aziz, H M Abdul; Young, Stan

Networked traffic flow is a common scenario for urban transportation, where the distribution of vehicle queues either at controlled intersections or highway segments reflect the smoothness of the traffic flow in the network. At signalized intersections, the traffic queues are controlled by traffic signal control settings and effective traffic lights control would realize both smooth traffic flow and minimize fuel consumption. Funded by the Energy Efficient Mobility Systems (EEMS) program of the Vehicle Technologies Office of the US Department of Energy, we performed a preliminary investigation on the modelling and control framework in context of urban network of signalized intersections.more » In specific, we developed a recursive input-output traffic queueing models. The queue formation can be modeled as a stochastic process where the number of vehicles entering each intersection is a random number. Further, we proposed a preliminary B-Spline stochastic model for a one-way single-lane corridor traffic system based on theory of stochastic distribution control.. It has been shown that the developed stochastic model would provide the optimal probability density function (PDF) of the traffic queueing length as a dynamic function of the traffic signal setting parameters. Based upon such a stochastic distribution model, we have proposed a preliminary closed loop framework on stochastic distribution control for the traffic queueing system to make the traffic queueing length PDF follow a target PDF that potentially realizes the smooth traffic flow distribution in a concerned corridor.« less

Attacks and Countermeasures in Communications and Power Networks

DTIC Science & Technology

2014-01-01

the victim. This strategy is often used to confuse the intrusion detection system about the adversary’s location. If the adversary compromises a pair...1.2 Detection of Information Flows Detection of information flows between a pair of nodes has been studied in the context of network intrusion ...Theo- rem 3.3.4 were derived purely based on the condition for undetectability. Hence, the same optimality statements hold for the noisy measurement

Influence of geomorphological properties and stage on in-stream travel time

NASA Astrophysics Data System (ADS)

Åkesson, Anna; Wörman, Anders

2014-05-01

The travel time distribution within stream channels is known to vary non-linearly with stage (discharge), depending on the combined effects of geomorphologic, hydrodynamic and kinematic dispersions. This non-linearity, implying that stream network travel time generally decreases with increasing discharge is a factor that is important to account for in hydrological modelling - especially when making peak flow predictions where uncertainty is often high and large values can be at risk. Through hydraulic analysis of several stream networks, we analyse how travel time distributions varies with discharge. The principal focus is the coupling to the geomorphologic properties of stream networks with the final goal being to use this physically based information as a parameterisation tool of the streamflow component of hydrologic models. For each of the studied stream networks, a 1D, steady-state, distributed routing model was set up to determine the velocities in each reach during different flow conditions. Although the model (based in the Manning friction formula) is built on the presence of uniform conditions within sub-reaches, the model can in the stream network scale be considered to include effects of non-uniformity as supercritical conditions in sections of the stream network give rise to backwater effects that reduce the flow velocities in upstream reaches in the stream. By coupling the routing model to a particle tracking routine tracing water "parcels" through the stream network, the average travel time within the stream network can be determined quantitatively for different flow conditions. The data used to drive the model is digitised stream network maps, topographical data (DEMs). The model is not calibrated in any way, but is run for with different sets of parameters representing a span of possible friction coefficients and cross-sectional geometries as this information is not generally known. The routing model is implemented in several different stream networks (representing catchments of the spatial scale of a few hundred km2) in different geographic regions in Sweden displaying different geomorphological properties. Results show that the geomorphological properties (data that is often available in the form of maps and/or DEMs) of individual stream networks have major influence on the stream network travel times. By coupling the geomorphological information to general expressions for stage dependency, catchment-specific relationships of how the travel times within stream networks can be determined. Basing the parameterisation procedure of a hydrological model in physical catchment properties and process understanding rather than statistical parameterisation (based in how a catchment has responded in the past) - is believed to lead to more reliable hydrological predictions - during extreme conditions as well as during changing conditions such as climate change and landscape modifications, and/or when making predictions in ungauged basins.

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.

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.

Intrusion Detection and Forensics for Self-Defending Wireless Networks

DTIC Science & Technology

2012-12-01

ICNP), Nov. 2007. 5. Yao Zhao, Yan Chen, Bo Li, and Qian Zhang, Hop ID: A Virtual Coordinate based Routing for Sparse Mobile Ad Hoc Networks, in...Liu, Hongbo Zhao, Kai Chen and Yan Chen, " DISCO : Memory Efficient and Accurate Flow Statistics for Network Measurement", in the Proc. of IEEE ICDCS

Scaling of Average Weighted Receiving Time on Double-Weighted Koch Networks

NASA Astrophysics Data System (ADS)

Dai, Meifeng; Ye, Dandan; Hou, Jie; Li, Xingyi

2015-03-01

In this paper, we introduce a model of the double-weighted Koch networks based on actual road networks depending on the two weight factors w,r ∈ (0, 1]. The double weights represent the capacity-flowing weight and the cost-traveling weight, respectively. Denote by wFij the capacity-flowing weight connecting the nodes i and j, and denote by wCij the cost-traveling weight connecting the nodes i and j. Let wFij be related to the weight factor w, and let wCij be related to the weight factor r. This paper assumes that the walker, at each step, starting from its current node, moves to any of its neighbors with probability proportional to the capacity-flowing weight of edge linking them. The weighted time for two adjacency nodes is the cost-traveling weight connecting the two nodes. We define the average weighted receiving time (AWRT) on the double-weighted Koch networks. The obtained result displays that in the large network, the AWRT grows as power-law function of the network order with the exponent, represented by θ(w,r) = ½ log2(1 + 3wr). We show that the AWRT exhibits a sublinear or linear dependence on network order. Thus, the double-weighted Koch networks are more efficient than classic Koch networks in receiving information.

Adaptive Flow Control for Enabling Quality of Service in Tactical Ad Hoc Wireless Networks

DTIC Science & Technology

2010-12-01

environment in wireless networks , we use sensors in the network routers to detect and respond to congestion. We use backpressure techniques... wireless mesh network . In the current approach, we used OLSR as the routing scheme. However, B.A.T.M.A.N. offers the significant advantage of being based...Control and QoS Routing in Multi-Channel Wireless Mesh Networks ,” 68-77. ACM International Symposium on Mobile Ad Hoc Networking &

Analysis of the streamflow-gaging station network in Ohio for effectiveness in providing regional streamflow information

USGS Publications Warehouse

Straub, D.E.

1998-01-01

The streamflow-gaging station network in Ohio was evaluated for its effectiveness in providing regional streamflow information. The analysis involved application of the principles of generalized least squares regression between streamflow and climatic and basin characteristics. Regression equations were developed for three flow characteristics: (1) the instantaneous peak flow with a 100-year recurrence interval (P100), (2) the mean annual flow (Qa), and (3) the 7-day, 10-year low flow (7Q10). All active and discontinued gaging stations with 5 or more years of unregulated-streamflow data with respect to each flow characteristic were used to develop the regression equations. The gaging-station network was evaluated for the current (1996) condition of the network and estimated conditions of various network strategies if an additional 5 and 20 years of streamflow data were collected. Any active or discontinued gaging station with (1) less than 5 years of unregulated-streamflow record, (2) previously defined basin and climatic characteristics, and (3) the potential for collection of more unregulated-streamflow record were included in the network strategies involving the additional 5 and 20 years of data. The network analysis involved use of the regression equations, in combination with location, period of record, and cost of operation, to determine the contribution of the data for each gaging station to regional streamflow information. The contribution of each gaging station was based on a cost-weighted reduction of the mean square error (average sampling-error variance) associated with each regional estimating equation. All gaging stations included in the network analysis were then ranked according to their contribution to the regional information for each flow characteristic. The predictive ability of the regression equations developed from the gaging station network could be improved for all three flow characteristics with the collection of additional streamflow data. The addition of new gaging stations to the network would result in an even greater improvement of the accuracy of the regional regression equations. Typically, continued data collection at stations with unregulated streamflow for all flow conditions that had less than 11 years of record with drainage areas smaller than 200 square miles contributed the largest cost-weighted reduction to the average sampling-error variance of the regional estimating equations. The results of the network analyses can be used to prioritize the continued operation of active gaging stations or the reactivation of discontinued gaging stations if the objective is to maximize the regional information content in the streamflow-gaging station network.

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.

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.

Impact Analysis of Flow Shaping in Ethernet-AVB/TSN and AFDX from Network Calculus and Simulation Perspective

PubMed Central

He, Feng; Zhao, Lin; Li, Ershuai

2017-01-01

Ethernet-AVB/TSN (Audio Video Bridging/Time-Sensitive Networking) and AFDX (Avionics Full DupleX switched Ethernet) are switched Ethernet technologies, which are both candidates for real-time communication in the context of transportation systems. AFDX implements a fixed priority scheduling strategy with two priority levels. Ethernet-AVB/TSN supports a similar fixed priority scheduling with an additional Credit-Based Shaper (CBS) mechanism. Besides, TSN can support time-triggered scheduling strategy. One direct effect of CBS mechanism is to increase the delay of its flows while decreasing the delay of other priority ones. The former effect can be seen as the shaping restriction and the latter effect can be seen as the shaping benefit from CBS. The goal of this paper is to investigate the impact of CBS on different priority flows, especially on the intermediate priority ones, as well as the effect of CBS bandwidth allocation. It is based on a performance comparison of AVB/TSN and AFDX by simulation in an automotive case study. Furthermore, the shaping benefit is modeled based on integral operation from network calculus perspective. Combing with the analysis of shaping restriction and shaping benefit, some configuration suggestions on the setting of CBS bandwidth are given. Results show that the effect of CBS depends on flow loads and CBS configurations. A larger load of high priority flows in AVB tends to a better performance for the intermediate priority flows when compared with AFDX. Shaping benefit can be explained and calculated according to the changing from the permitted maximum burst. PMID:28531158

Adding the 'heart' to hanging drop networks for microphysiological multi-tissue experiments.

PubMed

Rismani Yazdi, Saeed; Shadmani, Amir; Bürgel, Sebastian C; Misun, Patrick M; Hierlemann, Andreas; Frey, Olivier

2015-11-07

Microfluidic hanging-drop networks enable culturing and analysis of 3D microtissue spheroids derived from different cell types under controlled perfusion and investigating inter-tissue communication in multi-tissue formats. In this paper we introduce a compact on-chip pumping approach for flow control in hanging-drop networks. The pump includes one pneumatic chamber located directly above one of the hanging drops and uses the surface tension at the liquid-air-interface for flow actuation. Control of the pneumatic protocol provides a wide range of unidirectional pulsatile and continuous flow profiles. With the proposed concept several independent hanging-drop networks can be operated in parallel with only one single pneumatic actuation line at high fidelity. Closed-loop medium circulation between different organ models for multi-tissue formats and multiple simultaneous assays in parallel are possible. Finally, we implemented a real-time feedback control-loop of the pump actuation based on the beating of a human iPS-derived cardiac microtissue cultured in the same system. This configuration allows for simulating physiological effects on the heart and their impact on flow circulation between the organ models on chip.

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

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.

Modeling of Propagation of Interacting Cracks Under Hydraulic Pressure Gradient

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

Huang, Hai; Mattson, Earl Douglas; Podgorney, Robert Karl

A robust and reliable numerical model for fracture initiation and propagation, which includes the interactions among propagating fractures and the coupling between deformation, fracturing and fluid flow in fracture apertures and in the permeable rock matrix, would be an important tool for developing a better understanding of fracturing behaviors of crystalline brittle rocks driven by thermal and (or) hydraulic pressure gradients. In this paper, we present a physics-based hydraulic fracturing simulator based on coupling a quasi-static discrete element model (DEM) for deformation and fracturing with conjugate lattice network flow model for fluid flow in both fractures and porous matrix. Fracturingmore » is represented explicitly by removing broken bonds from the network to represent microcracks. Initiation of new microfractures and growth and coalescence of the microcracks leads to the formation of macroscopic fractures when external and/or internal loads are applied. The coupled DEM-network flow model reproduces realistic growth pattern of hydraulic fractures. In particular, simulation results of perforated horizontal wellbore clearly demonstrate that elastic interactions among multiple propagating fractures, fluid viscosity, strong coupling between fluid pressure fluctuations within fractures and fracturing, and lower length scale heterogeneities, collectively lead to complicated fracturing patterns.« less

Modeling flow and transport in fracture networks using graphs

NASA Astrophysics Data System (ADS)

Karra, S.; O'Malley, D.; Hyman, J. D.; Viswanathan, H. S.; Srinivasan, G.

2018-03-01

Fractures form the main pathways for flow in the subsurface within low-permeability rock. For this reason, accurately predicting flow and transport in fractured systems is vital for improving the performance of subsurface applications. Fracture sizes in these systems can range from millimeters to kilometers. Although modeling flow and transport using the discrete fracture network (DFN) approach is known to be more accurate due to incorporation of the detailed fracture network structure over continuum-based methods, capturing the flow and transport in such a wide range of scales is still computationally intractable. Furthermore, if one has to quantify uncertainty, hundreds of realizations of these DFN models have to be run. To reduce the computational burden, we solve flow and transport on a graph representation of a DFN. We study the accuracy of the graph approach by comparing breakthrough times and tracer particle statistical data between the graph-based and the high-fidelity DFN approaches, for fracture networks with varying number of fractures and degree of heterogeneity. Due to our recent developments in capabilities to perform DFN high-fidelity simulations on fracture networks with large number of fractures, we are in a unique position to perform such a comparison. We show that the graph approach shows a consistent bias with up to an order of magnitude slower breakthrough when compared to the DFN approach. We show that this is due to graph algorithm's underprediction of the pressure gradients across intersections on a given fracture, leading to slower tracer particle speeds between intersections and longer travel times. We present a bias correction methodology to the graph algorithm that reduces the discrepancy between the DFN and graph predictions. We show that with this bias correction, the graph algorithm predictions significantly improve and the results are very accurate. The good accuracy and the low computational cost, with O (104) times lower times than the DFN, makes the graph algorithm an ideal technique to incorporate in uncertainty quantification methods.

Modeling flow and transport in fracture networks using graphs.

PubMed

Karra, S; O'Malley, D; Hyman, J D; Viswanathan, H S; Srinivasan, G

2018-03-01

Fractures form the main pathways for flow in the subsurface within low-permeability rock. For this reason, accurately predicting flow and transport in fractured systems is vital for improving the performance of subsurface applications. Fracture sizes in these systems can range from millimeters to kilometers. Although modeling flow and transport using the discrete fracture network (DFN) approach is known to be more accurate due to incorporation of the detailed fracture network structure over continuum-based methods, capturing the flow and transport in such a wide range of scales is still computationally intractable. Furthermore, if one has to quantify uncertainty, hundreds of realizations of these DFN models have to be run. To reduce the computational burden, we solve flow and transport on a graph representation of a DFN. We study the accuracy of the graph approach by comparing breakthrough times and tracer particle statistical data between the graph-based and the high-fidelity DFN approaches, for fracture networks with varying number of fractures and degree of heterogeneity. Due to our recent developments in capabilities to perform DFN high-fidelity simulations on fracture networks with large number of fractures, we are in a unique position to perform such a comparison. We show that the graph approach shows a consistent bias with up to an order of magnitude slower breakthrough when compared to the DFN approach. We show that this is due to graph algorithm's underprediction of the pressure gradients across intersections on a given fracture, leading to slower tracer particle speeds between intersections and longer travel times. We present a bias correction methodology to the graph algorithm that reduces the discrepancy between the DFN and graph predictions. We show that with this bias correction, the graph algorithm predictions significantly improve and the results are very accurate. The good accuracy and the low computational cost, with O(10^{4}) times lower times than the DFN, makes the graph algorithm an ideal technique to incorporate in uncertainty quantification methods.

Modeling flow and transport in fracture networks using graphs

DOE PAGES

Karra, S.; O'Malley, D.; Hyman, J. D.; ...

2018-03-09

Fractures form the main pathways for flow in the subsurface within low-permeability rock. For this reason, accurately predicting flow and transport in fractured systems is vital for improving the performance of subsurface applications. Fracture sizes in these systems can range from millimeters to kilometers. Although modeling flow and transport using the discrete fracture network (DFN) approach is known to be more accurate due to incorporation of the detailed fracture network structure over continuum-based methods, capturing the flow and transport in such a wide range of scales is still computationally intractable. Furthermore, if one has to quantify uncertainty, hundreds of realizationsmore » of these DFN models have to be run. To reduce the computational burden, we solve flow and transport on a graph representation of a DFN. We study the accuracy of the graph approach by comparing breakthrough times and tracer particle statistical data between the graph-based and the high-fidelity DFN approaches, for fracture networks with varying number of fractures and degree of heterogeneity. Due to our recent developments in capabilities to perform DFN high-fidelity simulations on fracture networks with large number of fractures, we are in a unique position to perform such a comparison. We show that the graph approach shows a consistent bias with up to an order of magnitude slower breakthrough when compared to the DFN approach. We show that this is due to graph algorithm's underprediction of the pressure gradients across intersections on a given fracture, leading to slower tracer particle speeds between intersections and longer travel times. We present a bias correction methodology to the graph algorithm that reduces the discrepancy between the DFN and graph predictions. We show that with this bias correction, the graph algorithm predictions significantly improve and the results are very accurate. In conclusion, the good accuracy and the low computational cost, with O(10 4) times lower times than the DFN, makes the graph algorithm an ideal technique to incorporate in uncertainty quantification methods.« less

Modeling flow and transport in fracture networks using graphs

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

Karra, S.; O'Malley, D.; Hyman, J. D.

Fractures form the main pathways for flow in the subsurface within low-permeability rock. For this reason, accurately predicting flow and transport in fractured systems is vital for improving the performance of subsurface applications. Fracture sizes in these systems can range from millimeters to kilometers. Although modeling flow and transport using the discrete fracture network (DFN) approach is known to be more accurate due to incorporation of the detailed fracture network structure over continuum-based methods, capturing the flow and transport in such a wide range of scales is still computationally intractable. Furthermore, if one has to quantify uncertainty, hundreds of realizationsmore » of these DFN models have to be run. To reduce the computational burden, we solve flow and transport on a graph representation of a DFN. We study the accuracy of the graph approach by comparing breakthrough times and tracer particle statistical data between the graph-based and the high-fidelity DFN approaches, for fracture networks with varying number of fractures and degree of heterogeneity. Due to our recent developments in capabilities to perform DFN high-fidelity simulations on fracture networks with large number of fractures, we are in a unique position to perform such a comparison. We show that the graph approach shows a consistent bias with up to an order of magnitude slower breakthrough when compared to the DFN approach. We show that this is due to graph algorithm's underprediction of the pressure gradients across intersections on a given fracture, leading to slower tracer particle speeds between intersections and longer travel times. We present a bias correction methodology to the graph algorithm that reduces the discrepancy between the DFN and graph predictions. We show that with this bias correction, the graph algorithm predictions significantly improve and the results are very accurate. In conclusion, the good accuracy and the low computational cost, with O(10 4) times lower times than the DFN, makes the graph algorithm an ideal technique to incorporate in uncertainty quantification methods.« less

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.

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

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.

Embeddedness and New Idea Discussion in Professional Networks: The Mediating Role of Affect-Based Trust

ERIC Educational Resources Information Center

Chua, Roy Y. J.; Morris, Michael W.; Ingram, Paul

2010-01-01

This article examines how managers' tendency to discuss new ideas with others in their professional networks depends on the density of shared ties surrounding a given relationship. Consistent with prior research which found that embeddedness enhances information flow, an egocentric network survey of mid-level executives shows that managers tend to…

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.

Experimental demonstration of bandwidth on demand (BoD) provisioning based on time scheduling in software-defined multi-domain optical networks

NASA Astrophysics Data System (ADS)

Zhao, Yongli; Li, Yajie; Wang, Xinbo; Chen, Bowen; Zhang, Jie

2016-09-01

A hierarchical software-defined networking (SDN) control architecture is designed for multi-domain optical networks with the Open Daylight (ODL) controller. The OpenFlow-based Control Virtual Network Interface (CVNI) protocol is deployed between the network orchestrator and the domain controllers. Then, a dynamic bandwidth on demand (BoD) provisioning solution is proposed based on time scheduling in software-defined multi-domain optical networks (SD-MDON). Shared Risk Link Groups (SRLG)-disjoint routing schemes are adopted to separate each tenant for reliability. The SD-MDON testbed is built based on the proposed hierarchical control architecture. Then the proposed time scheduling-based BoD (Ts-BoD) solution is experimentally demonstrated on the testbed. The performance of the Ts-BoD solution is evaluated with respect to blocking probability, resource utilization, and lightpath setup latency.

Improving the effectiveness of traffic monitoring based on wireless location technology.

DOT National Transportation Integrated Search

2004-01-01

A fundamental requirement for effectively monitoring and operating transportation facilities is reliable, accurate data on traffic flow. The current state of the practice is to use networks of point detectors to gather information on traffic flow at ...

Coupled prediction of flash flood response and debris flow occurrence: Application on an alpine extreme flood event

NASA Astrophysics Data System (ADS)

Destro, Elisa; Amponsah, William; Nikolopoulos, Efthymios I.; Marchi, Lorenzo; Marra, Francesco; Zoccatelli, Davide; Borga, Marco

2018-03-01

The concurrence of flash floods and debris flows is of particular concern, because it may amplify the hazard corresponding to the individual generative processes. This paper presents a coupled modelling framework for the predictions of flash flood response and of the occurrence of debris flows initiated by channel bed mobilization. The framework combines a spatially distributed flash flood response model and a debris flow initiation model to define a threshold value for the peak flow which permits identification of channelized debris flow initiation. The threshold is defined over the channel network as a function of the upslope area and of the local channel bed slope, and it is based on assumptions concerning the properties of the channel bed material and of the morphology of the channel network. The model is validated using data from an extreme rainstorm that impacted the 140 km2 Vizze basin in the Eastern Italian Alps on August 4-5, 2012. The results show that the proposed methodology has improved skill in identifying the catchments where debris-flows are triggered, compared to the use of simpler thresholds based on rainfall properties.

The role of storm scale, position and movement in controlling urban flood response

NASA Astrophysics Data System (ADS)

ten Veldhuis, Marie-claire; Zhou, Zhengzheng; Yang, Long; Liu, Shuguang; Smith, James

2018-01-01

The impact of spatial and temporal variability of rainfall on hydrological response remains poorly understood, in particular in urban catchments due to their strong variability in land use, a high degree of imperviousness and the presence of stormwater infrastructure. In this study, we analyze the effect of storm scale, position and movement in relation to basin scale and flow-path network structure on urban hydrological response. A catalog of 279 peak events was extracted from a high-quality observational dataset covering 15 years of flow observations and radar rainfall data for five (semi)urbanized basins ranging from 7.0 to 111.1 km2 in size. Results showed that the largest peak flows in the event catalog were associated with storm core scales exceeding basin scale, for all except the largest basin. Spatial scale of flood-producing storm events in the smaller basins fell into two groups: storms of large spatial scales exceeding basin size or small, concentrated events, with storm core much smaller than basin size. For the majority of events, spatial rainfall variability was strongly smoothed by the flow-path network, increasingly so for larger basin size. Correlation analysis showed that position of the storm in relation to the flow-path network was significantly correlated with peak flow in the smallest and in the two more urbanized basins. Analysis of storm movement relative to the flow-path network showed that direction of storm movement, upstream or downstream relative to the flow-path network, had little influence on hydrological response. Slow-moving storms tend to be associated with higher peak flows and longer lag times. Unexpectedly, position of the storm relative to impervious cover within the basins had little effect on flow peaks. These findings show the importance of observation-based analysis in validating and improving our understanding of interactions between the spatial distribution of rainfall and catchment variability.

Internet-Based Approaches to Building Stakeholder Networks for Conservation and Natural Resource Management.

PubMed

Kreakie, B J; Hychka, K C; Belaire, J A; Minor, E; Walker, H A

2016-02-01

Social network analysis (SNA) is based on a conceptual network representation of social interactions and is an invaluable tool for conservation professionals to increase collaboration, improve information flow, and increase efficiency. We present two approaches to constructing internet-based social networks, and use an existing traditional (survey-based) case study to illustrate in a familiar context the deviations in methods and results. Internet-based approaches to SNA offer a means to overcome institutional hurdles to conducting survey-based SNA, provide unique insight into an institution's web presences, allow for easy snowballing (iterative process that incorporates new nodes in the network), and afford monitoring of social networks through time. The internet-based approaches differ in link definition: hyperlink is based on links on a website that redirect to a different website and relatedness links are based on a Google's "relatedness" operator that identifies pages "similar" to a URL. All networks were initiated with the same start nodes [members of a conservation alliance for the Calumet region around Chicago (n = 130)], but the resulting networks vary drastically from one another. Interpretation of the resulting networks is highly contingent upon how the links were defined.

Internet-Based Approaches to Building Stakeholder Networks for Conservation and Natural Resource Management

NASA Astrophysics Data System (ADS)

Kreakie, B. J.; Hychka, K. C.; Belaire, J. A.; Minor, E.; Walker, H. A.

2016-02-01

Social network analysis (SNA) is based on a conceptual network representation of social interactions and is an invaluable tool for conservation professionals to increase collaboration, improve information flow, and increase efficiency. We present two approaches to constructing internet-based social networks, and use an existing traditional (survey-based) case study to illustrate in a familiar context the deviations in methods and results. Internet-based approaches to SNA offer a means to overcome institutional hurdles to conducting survey-based SNA, provide unique insight into an institution's web presences, allow for easy snowballing (iterative process that incorporates new nodes in the network), and afford monitoring of social networks through time. The internet-based approaches differ in link definition: hyperlink is based on links on a website that redirect to a different website and relatedness links are based on a Google's "relatedness" operator that identifies pages "similar" to a URL. All networks were initiated with the same start nodes [members of a conservation alliance for the Calumet region around Chicago ( n = 130)], but the resulting networks vary drastically from one another. Interpretation of the resulting networks is highly contingent upon how the links were defined.

Where and why hyporheic exchange is important: Inferences from a parsimonious, physically-based river network model

NASA Astrophysics Data System (ADS)

Gomez-Velez, J. D.; Harvey, J. W.

2014-12-01

Hyporheic exchange has been hypothesized to have basin-scale consequences; however, predictions throughout river networks are limited by available geomorphic and hydrogeologic data as well as models that can analyze and aggregate hyporheic exchange flows across large spatial scales. We developed a parsimonious but physically-based model of hyporheic flow for application in large river basins: Networks with EXchange and Subsurface Storage (NEXSS). At the core of NEXSS is a characterization of the channel geometry, geomorphic features, and related hydraulic drivers based on scaling equations from the literature and readily accessible information such as river discharge, bankfull width, median grain size, sinuosity, channel slope, and regional groundwater gradients. Multi-scale hyporheic flow is computed based on combining simple but powerful analytical and numerical expressions that have been previously published. We applied NEXSS across a broad range of geomorphic diversity in river reaches and synthetic river networks. NEXSS demonstrates that vertical exchange beneath submerged bedforms dominates hyporheic fluxes and turnover rates along the river corridor. Moreover, the hyporheic zone's potential for biogeochemical transformations is comparable across stream orders, but the abundance of lower-order channels results in a considerably higher cumulative effect for low-order streams. Thus, vertical exchange beneath submerged bedforms has more potential for biogeochemical transformations than lateral exchange beneath banks, although lateral exchange through meanders may be important in large rivers. These results have implications for predicting outcomes of river and basin management practices.

Systematic Assessment of the Impact of User Roles on Network Flow Patterns

DTIC Science & Technology

2017-09-01

Protocol SNMP Simple Network Management Protocol SQL Structured Query Language SSH Secure Shell SYN TCP Sync Flag SVDD Support Vector Data Description SVM...and evaluating users based on roles provide the best approach for defining normal digital behaviors? People are individuals, with different interests...activities on the network. We evaluate the assumption that users sharing similar roles exhibit similar network behaviors, and contrast the level of similarity

Statistical analysis of passenger-crowding in bus transport network of Harbin

NASA Astrophysics Data System (ADS)

Hu, Baoyu; Feng, Shumin; Li, Jinyang; Zhao, Hu

2018-01-01

Passenger flow data is indispensable but rare in the study of public transport networks. In this study, we focus on the passenger-crowding characteristics of the bus transport network of Harbin (BTN-H) based on passenger flow investigation. The three frequency histograms for all the uplinks and downlinks in Harbin are presented, including passengers on the bus at each section, crowding coefficients, and position parameters of crowded sections. The differences in crowding position are analyzed on each route. The distributions of degree and crowding degree (in directed space L) follow an exponential law. The new finding indicates that there are many stations with few crowded sections and a few stations with many crowded sections. The distributions of path length and crowded length (in directed space P) are presented based on the minimum transfer times, and it is found that they can be fitted by a composite Gaussian function and a Gaussian function, respectively. The stations and paths can be divided into three crowd levels. We conclude that BTN-H is crowded from a network-based perspective.

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.

Flow analysis system and method

NASA Technical Reports Server (NTRS)

Hill, Wayne S. (Inventor); Barck, Bruce N. (Inventor)

1998-01-01

A non-invasive flow analysis system and method wherein a sensor, such as an acoustic sensor, is coupled to a conduit for transmitting a signal which varies depending on the characteristics of the flow in the conduit. The signal is amplified and there is a filter, responsive to the sensor signal, and tuned to pass a narrow band of frequencies proximate the resonant frequency of the sensor. A demodulator generates an amplitude envelope of the filtered signal and a number of flow indicator quantities are calculated based on variations in amplitude of the amplitude envelope. A neural network, or its equivalent, is then used to determine the flow rate of the flow in the conduit based on the flow indicator quantities.

A Deep Learning based Approach to Reduced Order Modeling of Fluids using LSTM Neural Networks

NASA Astrophysics Data System (ADS)

Mohan, Arvind; Gaitonde, Datta

2017-11-01

Reduced Order Modeling (ROM) can be used as surrogates to prohibitively expensive simulations to model flow behavior for long time periods. ROM is predicated on extracting dominant spatio-temporal features of the flow from CFD or experimental datasets. We explore ROM development with a deep learning approach, which comprises of learning functional relationships between different variables in large datasets for predictive modeling. Although deep learning and related artificial intelligence based predictive modeling techniques have shown varied success in other fields, such approaches are in their initial stages of application to fluid dynamics. Here, we explore the application of the Long Short Term Memory (LSTM) neural network to sequential data, specifically to predict the time coefficients of Proper Orthogonal Decomposition (POD) modes of the flow for future timesteps, by training it on data at previous timesteps. The approach is demonstrated by constructing ROMs of several canonical flows. Additionally, we show that statistical estimates of stationarity in the training data can indicate a priori how amenable a given flow-field is to this approach. Finally, the potential and limitations of deep learning based ROM approaches will be elucidated and further developments discussed.

Establishing a Multi-scale Stream Gaging Network in the Whitewater River Basin, Kansas, USA

USGS Publications Warehouse

Clayton, J.A.; Kean, J.W.

2010-01-01

Investigating the routing of streamflow through a large drainage basin requires the determination of discharge at numerous locations in the channel network. Establishing a dense network of stream gages using conventional methods is both cost-prohibitive and functionally impractical for many research projects. We employ herein a previously tested, fluid-mechanically based model for generating rating curves to establish a stream gaging network in the Whitewater River basin in south-central Kansas. The model was developed for the type of channels typically found in this watershed, meaning that it is designed to handle deep, narrow geomorphically stable channels with irregular planforms, and can model overbank flow over a vegetated floodplain. We applied the model to ten previously ungaged stream reaches in the basin, ranging from third- to sixth-order channels. At each site, detailed field measurements of the channel and floodplain morphology, bed and bank roughness, and vegetation characteristics were used to quantify the roughness for a range of flow stages, from low flow to overbank flooding. Rating curves that relate stage to discharge were developed for all ten sites. Both fieldwork and modeling were completed in less than 2 years during an anomalously dry period in the region, which underscores an advantage of using theoretically based (as opposed to empirically based) discharge estimation techniques. ?? 2010 Springer Science+Business Media B.V.

A new scripting library for modeling flow and transport in fractured rock with channel networks

NASA Astrophysics Data System (ADS)

Dessirier, Benoît; Tsang, Chin-Fu; Niemi, Auli

2018-02-01

Deep crystalline bedrock formations are targeted to host spent nuclear fuel owing to their overall low permeability. They are however highly heterogeneous and only a few preferential paths pertaining to a small set of dominant rock fractures usually carry most of the flow or mass fluxes, a behavior known as channeling that needs to be accounted for in the performance assessment of repositories. Channel network models have been developed and used to investigate the effect of channeling. They are usually simpler than discrete fracture networks based on rock fracture mappings and rely on idealized full or sparsely populated lattices of channels. This study reexamines the fundamental parameter structure required to describe a channel network in terms of groundwater flow and solute transport, leading to an extended description suitable for unstructured arbitrary networks of channels. An implementation of this formalism in a Python scripting library is presented and released along with this article. A new algebraic multigrid preconditioner delivers a significant speedup in the flow solution step compared to previous channel network codes. 3D visualization is readily available for verification and interpretation of the results by exporting the results to an open and free dedicated software. The new code is applied to three example cases to verify its results on full uncorrelated lattices of channels, sparsely populated percolation lattices and to exemplify the use of unstructured networks to accommodate knowledge on local rock fractures.

Preventing Bandwidth Abuse at the Router through Sending Rate Estimate-based Active Queue Management

DTIC Science & Technology

2007-06-01

behavior is growing in the Internet. These non-responsive sources can monopolize network bandwidth and starve the “congestion friendly” flows. Without...unnecessarily complex because most of the flows in the Internet are short flows usually termed as “web mice ” [7]. Moreover, having a separate queue for each

Sequential geophysical and flow inversion to characterize fracture networks in subsurface systems

DOE PAGES

Mudunuru, Maruti Kumar; Karra, Satish; Makedonska, Nataliia; ...

2017-09-05

Subsurface applications, including geothermal, geological carbon sequestration, and oil and gas, typically involve maximizing either the extraction of energy or the storage of fluids. Fractures form the main pathways for flow in these systems, and locating these fractures is critical for predicting flow. However, fracture characterization is a highly uncertain process, and data from multiple sources, such as flow and geophysical are needed to reduce this uncertainty. We present a nonintrusive, sequential inversion framework for integrating data from geophysical and flow sources to constrain fracture networks in the subsurface. In this framework, we first estimate bounds on the statistics formore » the fracture orientations using microseismic data. These bounds are estimated through a combination of a focal mechanism (physics-based approach) and clustering analysis (statistical approach) of seismic data. Then, the fracture lengths are constrained using flow data. In conclusion, the efficacy of this inversion is demonstrated through a representative example.« less

Sequential geophysical and flow inversion to characterize fracture networks in subsurface systems

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

Mudunuru, Maruti Kumar; Karra, Satish; Makedonska, Nataliia

Subsurface applications, including geothermal, geological carbon sequestration, and oil and gas, typically involve maximizing either the extraction of energy or the storage of fluids. Fractures form the main pathways for flow in these systems, and locating these fractures is critical for predicting flow. However, fracture characterization is a highly uncertain process, and data from multiple sources, such as flow and geophysical are needed to reduce this uncertainty. We present a nonintrusive, sequential inversion framework for integrating data from geophysical and flow sources to constrain fracture networks in the subsurface. In this framework, we first estimate bounds on the statistics formore » the fracture orientations using microseismic data. These bounds are estimated through a combination of a focal mechanism (physics-based approach) and clustering analysis (statistical approach) of seismic data. Then, the fracture lengths are constrained using flow data. In conclusion, the efficacy of this inversion is demonstrated through a representative example.« less

Voltage profile program for the Kennedy Space Center electric power distribution system

NASA Technical Reports Server (NTRS)

1976-01-01

The Kennedy Space Center voltage profile program computes voltages at all busses greater than 1 Kv in the network under various conditions of load. The computation is based upon power flow principles and utilizes a Newton-Raphson iterative load flow algorithm. Power flow conditions throughout the network are also provided. The computer program is designed for both steady state and transient operation. In the steady state mode, automatic tap changing of primary distribution transformers is incorporated. Under transient conditions, such as motor starts etc., it is assumed that tap changing is not accomplished so that transformer secondary voltage is allowed to sag.

Flow regulation in the Swiss Alps: a river network modelling approach to investigate the impacts on bed load and grain size distribution

NASA Astrophysics Data System (ADS)

Costa, A.; Molnar, P.; Schmitt, R. J. P.

2017-12-01

The grain size distribution (GSD) of river bed sediment results from the long term balance between transport capacity and sediment supply. Changes in climate and human activities may alter the spatial distribution of transport capacity and sediment supply along channels and hence impact local bedload transport and GSD. The effects of changed flow are not easily inferable due the non-linear, threshold-based nature of the relation between discharge and sediment mobilization, and the network-scale control on local sediment supply. We present a network-scale model for fractional sediment transport to quantify the impact of hydropower (HP) operations on river network GSD. We represent the river network as a series of connected links for which we extract the geometric characteristics from satellite images and a digital elevation model. We assign surface roughness based on the channel bed GSD. Bed shear stress is estimated at link-scale under the assumptions of rectangular prismatic cross sections and normal flow. The mass balance between sediment supply and transport capacity, computed with the Wilcock and Crowe model, determines transport rates of multiple grain size classes and the resulting GSD. We apply the model to the upper Rhone basin, a large Alpine basin in Switzerland. Since 1960s, changed flow conditions due to HP operations and sediment storage behind dams have potentially altered the sediment transport of the basin. However, little is known on the magnitude and spatial distribution of these changes. We force the model with time series of daily discharge derived with a spatially distributed hydrological model for pre and post HP scenarios. We initialize GSD under the assumption that coarse grains (d90) are mobilized only during mean annual maximum flows, and on the basis of ratios between d90 and characteristic diameters estimated from field measurements. Results show that effects of flow regulation vary significantly in space and in time and are grain size dependent. HP operations led to an overall reduction of sediment transport at network scale, especially in summer and for coarser grains, leading to a general coarsening of the river bed sediments at the upstream reaches. The model allows investigating the impact of modified HP operations and climate change projections on sediment dynamics at the network scale.

Framework based on communicability and flow to analyze complex network dynamics

NASA Astrophysics Data System (ADS)

Gilson, M.; Kouvaris, N. E.; Deco, G.; Zamora-López, G.

2018-05-01

Graph theory constitutes a widely used and established field providing powerful tools for the characterization of complex networks. The intricate topology of networks can also be investigated by means of the collective dynamics observed in the interactions of self-sustained oscillations (synchronization patterns) or propagationlike processes such as random walks. However, networks are often inferred from real-data-forming dynamic systems, which are different from those employed to reveal their topological characteristics. This stresses the necessity for a theoretical framework dedicated to the mutual relationship between the structure and dynamics in complex networks, as the two sides of the same coin. Here we propose a rigorous framework based on the network response over time (i.e., Green function) to study interactions between nodes across time. For this purpose we define the flow that describes the interplay between the network connectivity and external inputs. This multivariate measure relates to the concepts of graph communicability and the map equation. We illustrate our theory using the multivariate Ornstein-Uhlenbeck process, which describes stable and non-conservative dynamics, but the formalism can be adapted to other local dynamics for which the Green function is known. We provide applications to classical network examples, such as small-world ring and hierarchical networks. Our theory defines a comprehensive framework that is canonically related to directed and weighted networks, thus paving a way to revise the standards for network analysis, from the pairwise interactions between nodes to the global properties of networks including community detection.

Network modeling for reverse flows of end-of-life vehicles

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

Ene, Seval; Öztürk, Nursel

2015-04-15

Highlights: • We developed a network model for reverse flows of end-of-life vehicles. • The model considers all recovery operations for end-of-life vehicles. • A scenario-based model is used for uncertainty to improve real case applications. • The model is adequate to real case applications for end-of-life vehicles recovery. • Considerable insights are gained from the model by sensitivity analyses. - Abstract: Product recovery operations are of critical importance for the automotive industry in complying with environmental regulations concerning end-of-life products management. Manufacturers must take responsibility for their products over the entire life cycle. In this context, there is amore » need for network design methods for effectively managing recovery operations and waste. The purpose of this study is to develop a mathematical programming model for managing reverse flows in end-of-life vehicles’ recovery network. A reverse flow is the collection of used products from consumers and the transportation of these products for the purpose of recycling, reuse or disposal. The proposed model includes all operations in a product recovery and waste management network for used vehicles and reuse for vehicle parts such as collection, disassembly, refurbishing, processing (shredding), recycling, disposal and reuse of vehicle parts. The scope of the network model is to determine the numbers and locations of facilities in the network and the material flows between these facilities. The results show the performance of the model and its applicability for use in the planning of recovery operations in the automotive industry. The main objective of recovery and waste management is to maximize revenue and minimize pollution in end-of-life product operations. This study shows that with an accurate model, these activities may provide economic benefits and incentives in addition to protecting the environment.« less

Connectomics-based analysis of information flow in the Drosophila brain.

PubMed

Shih, Chi-Tin; Sporns, Olaf; Yuan, Shou-Li; Su, Ta-Shun; Lin, Yen-Jen; Chuang, Chao-Chun; Wang, Ting-Yuan; Lo, Chung-Chuang; Greenspan, Ralph J; Chiang, Ann-Shyn

2015-05-18

Understanding the overall patterns of information flow within the brain has become a major goal of neuroscience. In the current study, we produced a first draft of the Drosophila connectome at the mesoscopic scale, reconstructed from 12,995 images of neuron projections collected in FlyCircuit (version 1.1). Neuron polarities were predicted according to morphological criteria, with nodes of the network corresponding to brain regions designated as local processing units (LPUs). The weight of each directed edge linking a pair of LPUs was determined by the number of neuron terminals that connected one LPU to the other. The resulting network showed hierarchical structure and small-world characteristics and consisted of five functional modules that corresponded to sensory modalities (olfactory, mechanoauditory, and two visual) and the pre-motor center. Rich-club organization was present in this network and involved LPUs in all sensory centers, and rich-club members formed a putative motor center of the brain. Major intra- and inter-modular loops were also identified that could play important roles for recurrent and reverberant information flow. The present analysis revealed whole-brain patterns of network structure and information flow. Additionally, we propose that the overall organizational scheme showed fundamental similarities to the network structure of the mammalian brain. Copyright © 2015 Elsevier Ltd. All rights reserved.

Network Simulation solution of free convective flow from a vertical cone with combined effect of non- uniform surface heat flux and heat generation or absorption

NASA Astrophysics Data System (ADS)

Immanuel, Y.; Pullepu, Bapuji; Sambath, P.

2018-04-01

A two dimensional mathematical model is formulated for the transitive laminar free convective, incompressible viscous fluid flow over vertical cone with variable surface heat flux combined with the effects of heat generation and absorption is considered . using a powerful computational method based on thermoelectric analogy called Network Simulation Method (NSM0, the solutions of governing nondimensionl coupled, unsteady and nonlinear partial differential conservation equations of the flow that are obtained. The numerical technique is always stable and convergent which establish high efficiency and accuracy by employing network simulator computer code Pspice. The effects of velocity and temperature profiles have been analyzed for various factors, namely Prandtl number Pr, heat flux power law exponent n and heat generation/absorption parameter Δ are analyzed graphically.

Application of optimization technique for flood damage modeling in river system

NASA Astrophysics Data System (ADS)

Barman, Sangita Deb; Choudhury, Parthasarathi

2018-04-01

A river system is defined as a network of channels that drains different parts of a basin uniting downstream to form a common outflow. An application of various models found in literatures, to a river system having multiple upstream flows is not always straight forward, involves a lengthy procedure; and with non-availability of data sets model calibration and applications may become difficult. In the case of a river system the flow modeling can be simplified to a large extent if the channel network is replaced by an equivalent single channel. In the present work optimization model formulations based on equivalent flow and applications of the mixed integer programming based pre-emptive goal programming model in evaluating flood control alternatives for a real life river system in India are proposed to be covered in the study.

Deterministic and stochastic algorithms for resolving the flow fields in ducts and networks using energy minimization

NASA Astrophysics Data System (ADS)

Sochi, Taha

2016-09-01

Several deterministic and stochastic multi-variable global optimization algorithms (Conjugate Gradient, Nelder-Mead, Quasi-Newton and global) are investigated in conjunction with energy minimization principle to resolve the pressure and volumetric flow rate fields in single ducts and networks of interconnected ducts. The algorithms are tested with seven types of fluid: Newtonian, power law, Bingham, Herschel-Bulkley, Ellis, Ree-Eyring and Casson. The results obtained from all those algorithms for all these types of fluid agree very well with the analytically derived solutions as obtained from the traditional methods which are based on the conservation principles and fluid constitutive relations. The results confirm and generalize the findings of our previous investigations that the energy minimization principle is at the heart of the flow dynamics systems. The investigation also enriches the methods of computational fluid dynamics for solving the flow fields in tubes and networks for various types of Newtonian and non-Newtonian fluids.

Discrete Mathematical Approaches to Graph-Based Traffic Analysis

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

Joslyn, Cliff A.; Cowley, Wendy E.; Hogan, Emilie A.

2014-04-01

Modern cyber defense and anlaytics requires general, formal models of cyber systems. Multi-scale network models are prime candidates for such formalisms, using discrete mathematical methods based in hierarchically-structured directed multigraphs which also include rich sets of labels. An exemplar of an application of such an approach is traffic analysis, that is, observing and analyzing connections between clients, servers, hosts, and actors within IP networks, over time, to identify characteristic or suspicious patterns. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. In thismore » paper, we consider traffic analysis of Netflow using both basic graph statistics and two new mathematical measures involving labeled degree distributions and time interval overlap measures. We do all of this over the VAST test data set of 96M synthetic Netflow graph edges, against which we can identify characteristic patterns of simulated ground-truth network attacks.« less

Improved security monitoring method for network bordary

NASA Astrophysics Data System (ADS)

Gao, Liting; Wang, Lixia; Wang, Zhenyan; Qi, Aihua

2013-03-01

This paper proposes a network bordary security monitoring system based on PKI. The design uses multiple safe technologies, analysis deeply the association between network data flow and system log, it can detect the intrusion activities and position invasion source accurately in time. The experiment result shows that it can reduce the rate of false alarm or missing alarm of the security incident effectively.

Field Effect Flow Control in a Polymer T-Intersection Microfluidic Network

NASA Technical Reports Server (NTRS)

Sniadecki, Nathan J.; Chang, Richard; Beamesderfer, Mike; Lee, Cheng S.; DeVoe, Don L.

2003-01-01

We present a study of induced pressure pumping in a polymer microchannel due to differential electroosmotic flow @OF) rates via field-effect flow control (FEFC). The experimental results demonstrate that the induced pressure pumping is dependent on the distance of the FEFC gate from the cathodic gate. A proposed flow model based on a linearly-decaying zeta potential profile is found to successfully predict experimental trends.

Application of AFINCH as a tool for evaluating the effects of streamflow-gaging-network size and composition on the accuracy and precision of streamflow estimates at ungaged locations in the southeast Lake Michigan hydrologic subregion

USGS Publications Warehouse

Koltun, G.F.; Holtschlag, David J.

2010-01-01

Bootstrapping techniques employing random subsampling were used with the AFINCH (Analysis of Flows In Networks of CHannels) model to gain insights into the effects of variation in streamflow-gaging-network size and composition on the accuracy and precision of streamflow estimates at ungaged locations in the 0405 (Southeast Lake Michigan) hydrologic subregion. AFINCH uses stepwise-regression techniques to estimate monthly water yields from catchments based on geospatial-climate and land-cover data in combination with available streamflow and water-use data. Calculations are performed on a hydrologic-subregion scale for each catchment and stream reach contained in a National Hydrography Dataset Plus (NHDPlus) subregion. Water yields from contributing catchments are multiplied by catchment areas and resulting flow values are accumulated to compute streamflows in stream reaches which are referred to as flow lines. AFINCH imposes constraints on water yields to ensure that observed streamflows are conserved at gaged locations.  Data from the 0405 hydrologic subregion (referred to as Southeast Lake Michigan) were used for the analyses. Daily streamflow data were measured in the subregion for 1 or more years at a total of 75 streamflow-gaging stations during the analysis period which spanned water years 1971–2003. The number of streamflow gages in operation each year during the analysis period ranged from 42 to 56 and averaged 47. Six sets (one set for each censoring level), each composed of 30 random subsets of the 75 streamflow gages, were created by censoring (removing) approximately 10, 20, 30, 40, 50, and 75 percent of the streamflow gages (the actual percentage of operating streamflow gages censored for each set varied from year to year, and within the year from subset to subset, but averaged approximately the indicated percentages).Streamflow estimates for six flow lines each were aggregated by censoring level, and results were analyzed to assess (a) how the size and composition of the streamflow-gaging network affected the average apparent errors and variability of the estimated flows and (b) whether results for certain months were more variable than for others. The six flow lines were categorized into one of three types depending upon their network topology and position relative to operating streamflow-gaging stations.    Statistical analysis of the model results indicates that (1) less precise (that is, more variable) estimates resulted from smaller streamflow-gaging networks as compared to larger streamflow-gaging networks, (2) precision of AFINCH flow estimates at an ungaged flow line is improved by operation of one or more streamflow gages upstream and (or) downstream in the enclosing basin, (3) no consistent seasonal trend in estimate variability was evident, and (4) flow lines from ungaged basins appeared to exhibit the smallest absolute apparent percent errors (APEs) and smallest changes in average APE as a function of increasing censoring level. The counterintuitive results described in item (4) above likely reflect both the nature of the base-streamflow estimate from which the errors were computed and insensitivity in the average model-derived estimates to changes in the streamflow-gaging-network size and composition. Another analysis demonstrated that errors for flow lines in ungaged basins have the potential to be much larger than indicated by their APEs if measured relative to their true (but unknown) flows.     “Missing gage” analyses, based on examination of censoring subset results where the streamflow gage of interest was omitted from the calibration data set, were done to better understand the true error characteristics for ungaged flow lines as a function of network size. Results examined for 2 water years indicated that the probability of computing a monthly streamflow estimate within 10 percent of the true value with AFINCH decreased from greater than 0.9 at about a 10-percent network-censoring level to less than 0.6 as the censoring level approached 75 percent. In addition, estimates for typically dry months tended to be characterized by larger percent errors than typically wetter months.

Modeling of Relation between Transaction Network and Production Activity for Firms

NASA Astrophysics Data System (ADS)

Iino, T.; Iyetomi, H.

Bak et al. [Ricerche Economiche 47 (1993), 3] proposed a self-organizing model for production activity of interacting firms to illustrate how large fluctuations can be triggered by small independent shocks in aggregate economy. This paper develops the original transaction model based on a regular network with layered order flow to accommodate more realistic networks. Simulations in the generalized model so obtained are then carried out for various networks to examine the influence caused by change of the network structure.

Novel flat datacenter network architecture based on scalable and flow-controlled optical switch system.

PubMed

Miao, Wang; Luo, Jun; Di Lucente, Stefano; Dorren, Harm; Calabretta, Nicola

2014-02-10

We propose and demonstrate an optical flat datacenter network based on scalable optical switch system with optical flow control. Modular structure with distributed control results in port-count independent optical switch reconfiguration time. RF tone in-band labeling technique allowing parallel processing of the label bits ensures the low latency operation regardless of the switch port-count. Hardware flow control is conducted at optical level by re-using the label wavelength without occupying extra bandwidth, space, and network resources which further improves the performance of latency within a simple structure. Dynamic switching including multicasting operation is validated for a 4 x 4 system. Error free operation of 40 Gb/s data packets has been achieved with only 1 dB penalty. The system could handle an input load up to 0.5 providing a packet loss lower that 10(-5) and an average latency less that 500 ns when a buffer size of 16 packets is employed. Investigation on scalability also indicates that the proposed system could potentially scale up to large port count with limited power penalty.

Quantification of groundwater infiltration and surface water inflows in urban sewer networks based on a multiple model approach.

PubMed

Karpf, Christian; Krebs, Peter

2011-05-01

The management of sewer systems requires information about discharge and variability of typical wastewater sources in urban catchments. Especially the infiltration of groundwater and the inflow of surface water (I/I) are important for making decisions about the rehabilitation and operation of sewer networks. This paper presents a methodology to identify I/I and estimate its quantity. For each flow fraction in sewer networks, an individual model approach is formulated whose parameters are optimised by the method of least squares. This method was applied to estimate the contributions to the wastewater flow in the sewer system of the City of Dresden (Germany), where data availability is good. Absolute flows of I/I and their temporal variations are estimated. Further information on the characteristics of infiltration is gained by clustering and grouping sewer pipes according to the attributes construction year and groundwater influence and relating these resulting classes to infiltration behaviour. Further, it is shown that condition classes based on CCTV-data can be used to estimate the infiltration potential of sewer pipes. Copyright © 2011 Elsevier Ltd. All rights reserved.

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.

Bifurcations: Focal Points of Particle Adhesion in Microvascular Networks

PubMed Central

Prabhakarpandian, Balabhaskar; Wang, Yi; Rea-Ramsey, Angela; Sundaram, Shivshankar; Kiani, Mohammad F.; Pant, Kapil

2011-01-01

Objective Particle adhesion in vivo is dependent on microcirculation environment which features unique anatomical (bifurcations, tortuosity, cross-sectional changes) and physiological (complex hemodynamics) characteristics. The mechanisms behind these complex phenomena are not well understood. In this study, we used a recently developed in vitro model of microvascular networks, called Synthetic Microvascular Network, for characterizing particle adhesion patterns in the microcirculation. Methods Synthetic microvascular networks were fabricated using soft lithography processes followed by particle adhesion studies using avidin and biotin-conjugated microspheres. Particle adhesion patterns were subsequently analyzed using CFD based modeling. Results Experimental and modeling studies highlighted the complex and heterogeneous fluid flow patterns encountered by particles in microvascular networks resulting in significantly higher propensity of adhesion (>1.5X) near bifurcations compared to the branches of the microvascular networks. Conclusion Bifurcations are the focal points of particle adhesion in microvascular networks. Changing flow patterns and morphology near bifurcations are the primary factors controlling the preferential adhesion of functionalized particles in microvascular networks. Synthetic microvascular networks provide an in vitro framework for understanding particle adhesion. PMID:21418388

Optimization of flow modeling in fractured media with discrete fracture network via percolation theory

NASA Astrophysics Data System (ADS)

Donado-Garzon, L. D.; Pardo, Y.

2013-12-01

Fractured media are very heterogeneous systems where occur complex physical and chemical processes to model. One of the possible approaches to conceptualize this type of massifs is the Discrete Fracture Network (DFN). Donado et al., modeled flow and transport in a granitic batholith based on this approach and found good fitting with hydraulic and tracer tests, but the computational cost was excessive due to a gigantic amount of elements to model. We present in this work a methodology based on percolation theory for reducing the number of elements and in consequence, to reduce the bandwidth of the conductance matrix and the execution time of each network. DFN poses as an excellent representation of all the set of fractures of the media, but not all the fractures of the media are part of the conductive network. Percolation theory is used to identify which nodes or fractures are not conductive, based on the occupation probability or percolation threshold. In a fractured system, connectivity determines the flow pattern in the fractured rock mass. This volume of fluid is driven through connection paths formed by the fractures, when the permeability of the rock is negligible compared to the fractures. In a population of distributed fractures, each of this that has no intersection with any connected fracture do not contribute to generate a flow field. This algorithm also permits us to erase these elements however they are water conducting and hence, refine even more the backbone of the network. We used 100 different generations of DFN that were optimized in this study using percolation theory. In each of the networks calibrate hydrodynamic parameters as hydraulic conductivity and specific storage coefficient, for each of the five families of fractures, yielding a total of 10 parameters to estimate, at each generation. Since the effects of the distribution of fault orientation changes the value of the percolation threshold, but not the universal laws of classical percolation theory, the latter is applicable to such networks. Under these conditions, percolation theory permit us to reduced the number of elements (90% in average) that form clusters of the 100 DFNs, preserving the so-called backbone. In this way the calibration runs in these networks changed from several hours to just a second obtaining much better results.

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.

Adding the ‘heart’ to hanging drop networks for microphysiological multi-tissue experiments†

PubMed Central

Yazdi, Saeed Rismani; Shadmani, Amir; Bürgel, Sebastian C.; Misun, Patrick M.; Hierlemann, Andreas; Frey, Olivier

2017-01-01

Microfluidic hanging-drop networks enable culturing and analysis of 3D microtissue spheroids derived from different cell types under controlled perfusion and investigating inter-tissue communication in multi-tissue formats. In this paper we introduce a compact on-chip pumping approach for flow control in hanging-drop networks. The pump includes one pneumatic chamber located directly above one of the hanging drops and uses the surface tension at the liquid–air-interface for flow actuation. Control of the pneumatic protocol provides a wide range of unidirectional pulsatile and continuous flow profiles. With the proposed concept several independent hanging-drop networks can be operated in parallel with only one single pneumatic actuation line at high fidelity. Closed-loop medium circulation between different organ models for multi-tissue formats and multiple simultaneous assays in parallel are possible. Finally, we implemented a real-time feedback control-loop of the pump actuation based on the beating of a human iPS-derived cardiac microtissue cultured in the same system. This configuration allows for simulating physiological effects on the heart and their impact on flow circulation between the organ models on chip. PMID:26401602

Path selection in the growth of rivers

DOE PAGES

Cohen, Yossi; Devauchelle, Olivier; Seybold, Hansjörg F.; ...

2015-11-02

River networks exhibit a complex ramified structure that has inspired decades of studies. But, an understanding of the propagation of a single stream remains elusive. In this paper, we invoke a criterion for path selection from fracture mechanics and apply it to the growth of streams in a diffusion field. We show that, as it cuts through the landscape, a stream maintains a symmetric groundwater flow around its tip. The local flow conditions therefore determine the growth of the drainage network. We use this principle to reconstruct the history of a network and to find a growth law associated withmore » it. Finally, our results show that the deterministic growth of a single channel based on its local environment can be used to characterize the structure of river networks.« less

Considerations for Software Defined Networking (SDN): Approaches and use cases

NASA Astrophysics Data System (ADS)

Bakshi, K.

Software Defined Networking (SDN) is an evolutionary approach to network design and functionality based on the ability to programmatically modify the behavior of network devices. SDN uses user-customizable and configurable software that's independent of hardware to enable networked systems to expand data flow control. SDN is in large part about understanding and managing a network as a unified abstraction. It will make networks more flexible, dynamic, and cost-efficient, while greatly simplifying operational complexity. And this advanced solution provides several benefits including network and service customizability, configurability, improved operations, and increased performance. There are several approaches to SDN and its practical implementation. Among them, two have risen to prominence with differences in pedigree and implementation. This paper's main focus will be to define, review, and evaluate salient approaches and use cases of the OpenFlow and Virtual Network Overlay approaches to SDN. OpenFlow is a communication protocol that gives access to the forwarding plane of a network's switches and routers. The Virtual Network Overlay relies on a completely virtualized network infrastructure and services to abstract the underlying physical network, which allows the overlay to be mobile to other physical networks. This is an important requirement for cloud computing, where applications and associated network services are migrated to cloud service providers and remote data centers on the fly as resource demands dictate. The paper will discuss how and where SDN can be applied and implemented, including research and academia, virtual multitenant data center, and cloud computing applications. Specific attention will be given to the cloud computing use case, where automated provisioning and programmable overlay for scalable multi-tenancy is leveraged via the SDN approach.

A new link between the retrograde actin flow and focal adhesions.

PubMed

Yamashiro, Sawako; Watanabe, Naoki

2014-11-01

The retrograde actin flow, continuous centripetal movement of the cell peripheral actin networks, is widely observed in adherent cells. The retrograde flow is believed to facilitate cell migration when linked to cell adhesion molecules. In this review, we summarize our current knowledge regarding the functional relationship between the retrograde actin flow and focal adhesions (FAs). We also introduce our recent study in which single-molecule speckle (SiMS) microscopy dissected the complex interactions between FAs and the local actin flow. FAs do not simply impede the actin flow, but actively attract and remodel the local actin network. Our findings provide a new insight into the mechanisms for protrusion and traction force generation at the cell leading edge. Furthermore, we discuss possible roles of the actin flow-FA interaction based on the accumulated knowledge and our SiMS study. © The Authors 2014. Published by Oxford University Press on behalf of the Japanese Biochemical Society. All rights reserved.

Application of Geographical Information System Arc/info Grid-Based Surface Hyrologic Modeling to the Eastern Hellas Region, Mars

NASA Astrophysics Data System (ADS)

Mest, S. C.; Harbert, W.; Crown, D. A.

2001-05-01

Geographical Information System GRID-based raster modeling of surface water runoff in the eastern Hellas region of Mars has been completed. We utilized the 0.0625 by 0.0625 degree topographic map of Mars collected by the Mars Global Surveyor Mars Orbiter Laser Altimeter (MOLA) instrument to model watershed and surface runoff drainage systems. Scientific interpretation of these models with respect to ongoing geological mapping is presented in Mest et al., (2001). After importing a region of approximately 77,000,000 square kilometers into Arc/Info 8.0.2 we reprojected this digital elevation model (DEM) from a Mars sphere into a Mars ellipsoid. Using a simple cylindrical geographic projection and horizontal spatial units of decimal degrees and then an Albers projection with horizontal spatial units of meters, we completed basic hydrological modeling. Analysis of the raw DEM to determine slope, aspect, flow direction, watershed and flow accumulation grids demonstrated the need for correction of single pixel sink anomalies. After analysis of zonal elevation statistics associated with single pixel sinks, which identified 0.8 percent of the DEM points as having undefined surface water flow directions, we filled single pixel sink values of 89 meters or less. This correction is comparable with terrestrial DEMs that contain 0.9 percent to 4.7 percent of cells, which are sinks (Tarboton et al., 1991). The fill-corrected DEM was then used to determine slope, aspect, surface water flow direction and surface water flow accumulation. Within the region of interest 8,776 watersheds were identified. Using Arc/Info GRID flow direction and flow accumulation tools, regions of potential surface water flow accumulation were identified. These networks were then converted to a Strahler ordered stream network. Surface modeling produced Strahler orders one through six. As presented in Mest et al., (2001) comparisons of mapped features may prove compatible with drainage networks and watersheds derived using this methodology. Mest, Scott C., Crown, David A., and Harbert, William, 2001, Highland drainage basins and valley networks in the eastern Hellas Region of Mars, Abstract 1419, Lunar and Planetary Science XXXII Meeting Houston (CDROM). Tarboton D. G., Bras, R. L., and Rodriguez-Iturbe, 1991, On the Extraction of Channel Networks from Digital Elevation Data, Hydrological Processes, v. 5, 81-100. http://viking.eps.pitt.edu

Performance of Social Network Sensors during Hurricane Sandy

PubMed Central

Kryvasheyeu, Yury; Chen, Haohui; Moro, Esteban; Van Hentenryck, Pascal; Cebrian, Manuel

2015-01-01

Information flow during catastrophic events is a critical aspect of disaster management. Modern communication platforms, in particular online social networks, provide an opportunity to study such flow and derive early-warning sensors, thus improving emergency preparedness and response. Performance of the social networks sensor method, based on topological and behavioral properties derived from the “friendship paradox”, is studied here for over 50 million Twitter messages posted before, during, and after Hurricane Sandy. We find that differences in users’ network centrality effectively translate into moderate awareness advantage (up to 26 hours); and that geo-location of users within or outside of the hurricane-affected area plays a significant role in determining the scale of such an advantage. Emotional response appears to be universal regardless of the position in the network topology, and displays characteristic, easily detectable patterns, opening a possibility to implement a simple “sentiment sensing” technique that can detect and locate disasters. PMID:25692690

Performance of social network sensors during Hurricane Sandy.

PubMed

Kryvasheyeu, Yury; Chen, Haohui; Moro, Esteban; Van Hentenryck, Pascal; Cebrian, Manuel

2015-01-01

Information flow during catastrophic events is a critical aspect of disaster management. Modern communication platforms, in particular online social networks, provide an opportunity to study such flow and derive early-warning sensors, thus improving emergency preparedness and response. Performance of the social networks sensor method, based on topological and behavioral properties derived from the "friendship paradox", is studied here for over 50 million Twitter messages posted before, during, and after Hurricane Sandy. We find that differences in users' network centrality effectively translate into moderate awareness advantage (up to 26 hours); and that geo-location of users within or outside of the hurricane-affected area plays a significant role in determining the scale of such an advantage. Emotional response appears to be universal regardless of the position in the network topology, and displays characteristic, easily detectable patterns, opening a possibility to implement a simple "sentiment sensing" technique that can detect and locate disasters.

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

Intelligent Sensing and Classification in DSR-Based Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Dempsey, Tae; Sahin, Gokhan; Morton, Yu T. (Jade

Wireless ad hoc networks have fundamentally altered today's battlefield, with applications ranging from unmanned air vehicles to randomly deployed sensor networks. Security and vulnerabilities in wireless ad hoc networks have been considered at different layers, and many attack strategies have been proposed, including denial of service (DoS) through the intelligent jamming of the most critical packet types of flows in a network. This paper investigates the effectiveness of intelligent jamming in wireless ad hoc networks using the Dynamic Source Routing (DSR) and TCP protocols and introduces an intelligent classifier to facilitate the jamming of such networks. Assuming encrypted packet headers and contents, our classifier is based solely on the observable characteristics of size, inter-arrival timing, and direction and classifies packets with up to 99.4% accuracy in our experiments.

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

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.

Artificial neural network analysis based on genetic algorithm to predict the performance characteristics of a cross flow cooling tower

NASA Astrophysics Data System (ADS)

Wu, Jiasheng; Cao, Lin; Zhang, Guoqiang

2018-02-01

Cooling tower of air conditioning has been widely used as cooling equipment, and there will be broad application prospect if it can be reversibly used as heat source under heat pump heating operation condition. In view of the complex non-linear relationship of each parameter in the process of heat and mass transfer inside tower, In this paper, the BP neural network model based on genetic algorithm optimization (GABP neural network model) is established for the reverse use of cross flow cooling tower. The model adopts the structure of 6 inputs, 13 hidden nodes and 8 outputs. With this model, the outlet air dry bulb temperature, wet bulb temperature, water temperature, heat, sensible heat ratio and heat absorbing efficiency, Lewis number, a total of 8 the proportion of main performance parameters were predicted. Furthermore, the established network model is used to predict the water temperature and heat absorption of the tower at different inlet temperatures. The mean relative error MRE between BP predicted value and experimental value are 4.47%, 3.63%, 2.38%, 3.71%, 6.35%,3.14%, 13.95% and 6.80% respectively; the mean relative error MRE between GABP predicted value and experimental value are 2.66%, 3.04%, 2.27%, 3.02%, 6.89%, 3.17%, 11.50% and 6.57% respectively. The results show that the prediction results of GABP network model are better than that of BP network model; the simulation results are basically consistent with the actual situation. The GABP network model can well predict the heat and mass transfer performance of the cross flow cooling tower.

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

Network Aggregation in Transportation Planning : Volume II : A Fixed Point Method for Treating Traffic Equilibria

DOT National Transportation Integrated Search

1978-04-01

Volume 2 defines a new algorithm for the network equilibrium model that works in the space of path flows and is based on the theory of fixed point method. The goals of the study were broadly defined as the identification of aggregation practices and ...

Transportation and dynamic networks: Models, theory, and applications to supply chains, electric power, and financial networks

NASA Astrophysics Data System (ADS)

Liu, Zugang

Network systems, including transportation and logistic systems, electric power generation and distribution networks as well as financial networks, provide the critical infrastructure for the functioning of our societies and economies. The understanding of the dynamic behavior of such systems is also crucial to national security and prosperity. The identification of new connections between distinct network systems is the inspiration for the research in this dissertation. In particular, I answer two questions raised by Beckmann, McGuire, and Winsten (1956) and Copeland (1952) over half a century ago, which are, respectively, how are electric power flows related to transportation flows and does money flow like water or electricity? In addition, in this dissertation, I achieve the following: (1) I establish the relationships between transportation networks and three other classes of complex network systems: supply chain networks, electric power generation and transmission networks, and financial networks with intermediation. The establishment of such connections provides novel theoretical insights as well as new pricing mechanisms, and efficient computational methods. (2) I develop new modeling frameworks based on evolutionary variational inequality theory that capture the dynamics of such network systems in terms of the time-varying flows and incurred costs, prices, and, where applicable, profits. This dissertation studies the dynamics of such network systems by addressing both internal competition and/or cooperation, and external changes, such as varying costs and demands. (3) I focus, in depth, on electric power supply chains. By exploiting the relationships between transportation networks and electric power supply chains, I develop a large-scale network model that integrates electric power supply chains and fuel supply markets. The model captures both the economic transactions as well as the physical transmission constraints. The model is then applied to the New England electric power supply chain consisting of 6 states, 5 fuel types, 82 power generators, with a total of 573 generating units, and 10 demand markets. The empirical case study demonstrates that the regional electricity prices simulated by the model match very well the actual electricity prices in New England. I also utilize the model to study interactions between electric power supply chains and energy fuel markets.

Explore the impacts of river flow and quality on biodiversity for water resources management by AI techniques

NASA Astrophysics Data System (ADS)

Chang, Fi-John; Tsai Tsai, Wen-Ping; Chang, Li-Chiu

2016-04-01

Water resources development is very challenging in Taiwan due to her diverse geographic environment and climatic conditions. To pursue sustainable water resources development, rationality and integrity is essential for water resources planning. River water quality and flow regimes are closely related to each other and affect river ecosystems simultaneously. This study aims to explore the complex impacts of water quality and flow regimes on fish community in order to comprehend the situations of the eco-hydrological system in the Danshui River of northern Taiwan. To make an effective and comprehensive strategy for sustainable water resources management, this study first models fish diversity through implementing a hybrid artificial neural network (ANN) based on long-term observational heterogeneity data of water quality, stream flow and fish species in the river. Then we use stream flow to estimate the loss of dissolved oxygen based on back-propagation neural networks (BPNNs). Finally, the non-dominated sorting genetic algorithm II (NSGA-II) is established for river flow management over the Shihmen Reservoir which is the main reservoir in this study area. In addition to satisfying the water demands of human beings and ecosystems, we also consider water quality for river flow management. The ecosystem requirement takes the form of maximizing fish diversity, which can be estimated by the hybrid ANN. The human requirement is to provide a higher satisfaction degree of water supply while the water quality requirement is to reduce the loss of dissolved oxygen in the river among flow stations. The results demonstrate that the proposed methodology can offer diversified alternative strategies for reservoir operation and improve reservoir operation strategies for producing downstream flows that could better meet both human and ecosystem needs as well as maintain river water quality. Keywords: Artificial intelligence (AI), Artificial neural networks (ANNs), Non-dominated sorting genetic algorithm II (NSGA-II), Sustainable water resources management, Flow regime, River ecosystem.

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.

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

Subsurface lateral preferential flow network revealed by time-lapse ground-penetrating radar in a hillslope

NASA Astrophysics Data System (ADS)

Guo, Li; Chen, Jin; Lin, Henry

2014-12-01

Subsurface lateral preferential flow (LPF) has been observed to contribute substantially to hillslope and catchment runoff. However, the complex nature of LPF and the lack of an appropriate investigation method have hindered direct LPF observation in the field. Thus, the initiation, persistence, and dynamics of LPF networks remain poorly understood. This study explored the application of time-lapse ground-penetrating radar (GPR) together with an artificial infiltration to shed light on the nature of LPF and its dynamics in a hillslope. Based on our enhanced field experimental setup and carefully refined GPR data postprocessing algorithms, we developed a new protocol to reconstruct LPF networks with centimeter resolution. This is the first time that a detailed LPF network and its dynamics have been revealed noninvasively along a hillslope. Real-time soil water monitoring and field soil investigation confirmed the locations of LPF mapped by time-lapse GPR surveys. Our results indicated the following: (1) Increased spatial variations of radar signals after infiltration suggested heterogeneous soil water changes within the studied soil, which reflected the generation and dynamics of LPF; (2) Two types of LPF networks were identified, the network at the location of soil permeability contrasts and that formed via a series of connected preferential flow paths; and (3) The formation and distribution of LPF networks were influenced by antecedent soil water condition. Overall, this study demonstrates clearly that carefully designed time-lapse GPR surveys with enhanced data postprocessing offer a practical and nondestructive way of mapping LPF networks in the field, thereby providing a potentially significant enhancement in our ability to study complex subsurface flow processes across the landscape.

Construction of microscale structures in enclosed microfluidic networks by using a magnetic beads based method.

PubMed

Wang, Zhenyu; Zhang, Xiaojuan; Yang, Jun; Yang, Zhong; Wan, Xiaoping; Hu, Ning; Zheng, Xiaolin

2013-08-20

A large number of microscale structures have been used to elaborate flowing control or complex biological and chemical reaction on microfluidic chips. However, it is still inconvenient to fabricate microstructures with different heights (or depths) on the same substrate. These kinds of microstructures can be fabricated by using the photolithography and wet-etching method step by step, but involves time-consuming design and fabrication process, as well as complicated alignment of different masters. In addition, few existing methods can be used to perform fabrication within enclosed microfluidic networks. It is also difficult to change or remove existing microstructures within these networks. In this study, a magnetic-beads-based approach is presented to build microstructures in enclosed microfluidic networks. Electromagnetic field generated by microfabricated conducting wires (coils) is used to manipulate and trap magnetic beads on the bottom surface of a microchannel. These trapped beads are accumulated to form a microscale pile with desired shape, which can adjust liquid flow, dock cells, modify surface, and do some other things as those fabricated microstructures. Once the electromagnetic field is changed, trapped beads may form new shapes or be removed by a liquid flow. Besides being used in microfabrication, this magnetic-beads-based method can be used for novel microfluidic manipulation. It has been validated by forming microscale dam structure for cell docking and modified surface for cell patterning, as well as guiding the growth of neurons. Copyright © 2013 Elsevier B.V. All rights reserved.

Structure and Dynamics of an Arp2/3 Complex-independent Component of the Lamellipodial Actin Network

PubMed Central

Henson, John H.; Cheung, David; Fried, Christopher A.; Shuster, Charles B.; McClellan, Mary K.; Voss, Meagen K.; Sheridan, John T.; Oldenbourg, Rudolf

2010-01-01

Sea urchin coelomocytes contain an unusually broad lamellipodial region and have served as a useful model experimental system for studying the process of actin-based retrograde/centripetal flow. In the current study the small molecule drug 2,3-butanedione monoxime (BDM) was employed as a means of delocalizing the Arp2/3 complex from the cell edge in an effort to investigate the Arp2/3 complex-independent aspects of retrograde flow. Digitally-enhanced phase contrast, fluorescence and polarization light microscopy, along with rotary shadow TEM methods demonstrated that BDM treatment resulted in the centripetal displacement of the Arp2/3 complex and the associated dendritic lamellipodial (LP) actin network from the cell edge. In its wake there remained an array of elongate actin filaments organized into concave arcs that displayed retrograde flow at approximately one quarter the normal rate. Actin polymerization inhibitor experiments indicated that these arcs were generated by polymerization at the cell edge, while active myosin-based contraction in BDM treated cells was demonstrated by localization with anti-phospho-MRLC antibody, the retraction of the cytoskeleton in the presence of BDM, and the response of the BDM arcs to laser-based severing. The results suggest that BDM treatment reveals an Arp2/3 complex-independent actin structure in coelomocytes consisting of elongate filaments integrated into the LP network and that these filaments represent a potential connection between the LP network and the central cytoskeleton. PMID:19530177

Comparative empirical analysis of flow-weighted transit route networks in R-space and evolution modeling

NASA Astrophysics Data System (ADS)

Huang, Ailing; Zang, Guangzhi; He, Zhengbing; Guan, Wei

2017-05-01

Urban public transit system is a typical mixed complex network with dynamic flow, and its evolution should be a process coupling topological structure with flow dynamics, which has received little attention. This paper presents the R-space to make a comparative empirical analysis on Beijing’s flow-weighted transit route network (TRN) and we found that both the Beijing’s TRNs in the year of 2011 and 2015 exhibit the scale-free properties. As such, we propose an evolution model driven by flow to simulate the development of TRNs with consideration of the passengers’ dynamical behaviors triggered by topological change. The model simulates that the evolution of TRN is an iterative process. At each time step, a certain number of new routes are generated driven by travel demands, which leads to dynamical evolution of new routes’ flow and triggers perturbation in nearby routes that will further impact the next round of opening new routes. We present the theoretical analysis based on the mean-field theory, as well as the numerical simulation for this model. The results obtained agree well with our empirical analysis results, which indicate that our model can simulate the TRN evolution with scale-free properties for distributions of node’s strength and degree. The purpose of this paper is to illustrate the global evolutional mechanism of transit network that will be used to exploit planning and design strategies for real TRNs.

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.

Violent Interaction Detection in Video Based on Deep Learning

NASA Astrophysics Data System (ADS)

Zhou, Peipei; Ding, Qinghai; Luo, Haibo; Hou, Xinglin

2017-06-01

Violent interaction detection is of vital importance in some video surveillance scenarios like railway stations, prisons or psychiatric centres. Existing vision-based methods are mainly based on hand-crafted features such as statistic features between motion regions, leading to a poor adaptability to another dataset. En lightened by the development of convolutional networks on common activity recognition, we construct a FightNet to represent the complicated visual violence interaction. In this paper, a new input modality, image acceleration field is proposed to better extract the motion attributes. Firstly, each video is framed as RGB images. Secondly, optical flow field is computed using the consecutive frames and acceleration field is obtained according to the optical flow field. Thirdly, the FightNet is trained with three kinds of input modalities, i.e., RGB images for spatial networks, optical flow images and acceleration images for temporal networks. By fusing results from different inputs, we conclude whether a video tells a violent event or not. To provide researchers a common ground for comparison, we have collected a violent interaction dataset (VID), containing 2314 videos with 1077 fight ones and 1237 no-fight ones. By comparison with other algorithms, experimental results demonstrate that the proposed model for violent interaction detection shows higher accuracy and better robustness.

Deep Packet/Flow Analysis using GPUs

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

Gong, Qian; Wu, Wenji; DeMar, Phil

Deep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Sincemore » the flow-centric operations are naturally antiparallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysis framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. In conclusion, evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.« less

GIS-based channel flow and sediment transport simulation using CCHE1D coupled with AnnAGNPS

USDA-ARS?s Scientific Manuscript database

CCHE1D (Center for Computational Hydroscience and Engineering 1-Dimensional model) simulates unsteady free-surface flows with nonequilibrium, nonuniform sediment transport in dendritic channel networks. Since early 1990’s, the model and its software packages have been developed and continuously main...

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.

Polymer-based platform for microfluidic systems

DOEpatents

Benett, William [Livermore, CA; Krulevitch, Peter [Pleasanton, CA; Maghribi, Mariam [Livermore, CA; Hamilton, Julie [Tracy, CA; Rose, Klint [Boston, MA; Wang, Amy W [Oakland, CA

2009-10-13

A method of forming a polymer-based microfluidic system platform using network building blocks selected from a set of interconnectable network building blocks, such as wire, pins, blocks, and interconnects. The selected building blocks are interconnectably assembled and fixedly positioned in precise positions in a mold cavity of a mold frame to construct a three-dimensional model construction of a microfluidic flow path network preferably having meso-scale dimensions. A hardenable liquid, such as poly (dimethylsiloxane) is then introduced into the mold cavity and hardened to form a platform structure as well as to mold the microfluidic flow path network having channels, reservoirs and ports. Pre-fabricated elbows, T's and other joints are used to interconnect various building block elements together. After hardening the liquid the building blocks are removed from the platform structure to make available the channels, cavities and ports within the platform structure. Microdevices may be embedded within the cast polymer-based platform, or bonded to the platform structure subsequent to molding, to create an integrated microfluidic system. In this manner, the new microfluidic platform is versatile and capable of quickly generating prototype systems, and could easily be adapted to a manufacturing setting.

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.

Reinforced communication and social navigation: Remember your friends and remember yourself

NASA Astrophysics Data System (ADS)

Mirshahvalad, A.; Rosvall, M.

2011-09-01

In social systems, people communicate with each other and form groups based on their interests. The pattern of interactions, the network, and the ideas that flow on the network naturally evolve together. Researchers use simple models to capture the feedback between changing network patterns and ideas on the network, but little is understood about the role of past events in the feedback process. Here, we introduce a simple agent-based model to study the coupling between peoples’ ideas and social networks, and better understand the role of history in dynamic social networks. We measure how information about ideas can be recovered from information about network structure and, the other way around, how information about network structure can be recovered from information about ideas. We find that it is, in general, easier to recover ideas from the network structure than vice versa.

Design of real-time voice over internet protocol system under bandwidth network

NASA Astrophysics Data System (ADS)

Zhang, Li; Gong, Lina

2017-04-01

With the increasing bandwidth of the network and network convergence accelerating, VoIP means of communication across the network is becoming increasingly popular phenomenon. The real-time identification and analysis for VOIP flow over backbone network become the urgent needs and research hotspot of network operations management. Based on this, the paper proposes a VoIP business management system over backbone network. The system first filters VoIP data stream over backbone network and further resolves the call signaling information and media voice. The system can also be able to design appropriate rules to complete real-time reduction and presentation of specific categories of calls. Experimental results show that the system can parse and process real-time backbone of the VoIP call, and the results are presented accurately in the management interface, VoIP-based network traffic management and maintenance provide the necessary technical support.

An enhanced SOCP-based method for feeder load balancing using the multi-terminal soft open point in active distribution networks

DOE PAGES

Ji, Haoran; Wang, Chengshan; Li, Peng; ...

2017-09-20

The integration of distributed generators (DGs) exacerbates the feeder power flow fluctuation and load unbalanced condition in active distribution networks (ADNs). The unbalanced feeder load causes inefficient use of network assets and network congestion during system operation. The flexible interconnection based on the multi-terminal soft open point (SOP) significantly benefits the operation of ADNs. The multi-terminal SOP, which is a controllable power electronic device installed to replace the normally open point, provides accurate active and reactive power flow control to enable the flexible connection of feeders. An enhanced SOCP-based method for feeder load balancing using the multi-terminal SOP is proposedmore » in this paper. Furthermore, by regulating the operation of the multi-terminal SOP, the proposed method can mitigate the unbalanced condition of feeder load and simultaneously reduce the power losses of ADNs. Then, the original non-convex model is converted into a second-order cone programming (SOCP) model using convex relaxation. In order to tighten the SOCP relaxation and improve the computation efficiency, an enhanced SOCP-based approach is developed to solve the proposed model. Finally, case studies are performed on the modified IEEE 33-node system to verify the effectiveness and efficiency of the proposed method.« less

An enhanced SOCP-based method for feeder load balancing using the multi-terminal soft open point in active distribution networks

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

Ji, Haoran; Wang, Chengshan; Li, Peng

The integration of distributed generators (DGs) exacerbates the feeder power flow fluctuation and load unbalanced condition in active distribution networks (ADNs). The unbalanced feeder load causes inefficient use of network assets and network congestion during system operation. The flexible interconnection based on the multi-terminal soft open point (SOP) significantly benefits the operation of ADNs. The multi-terminal SOP, which is a controllable power electronic device installed to replace the normally open point, provides accurate active and reactive power flow control to enable the flexible connection of feeders. An enhanced SOCP-based method for feeder load balancing using the multi-terminal SOP is proposedmore » in this paper. Furthermore, by regulating the operation of the multi-terminal SOP, the proposed method can mitigate the unbalanced condition of feeder load and simultaneously reduce the power losses of ADNs. Then, the original non-convex model is converted into a second-order cone programming (SOCP) model using convex relaxation. In order to tighten the SOCP relaxation and improve the computation efficiency, an enhanced SOCP-based approach is developed to solve the proposed model. Finally, case studies are performed on the modified IEEE 33-node system to verify the effectiveness and efficiency of the proposed method.« less

Effect of advective flow in fractures and matrix diffusion on natural gas production

DOE PAGES

Karra, Satish; Makedonska, Nataliia; Viswanathan, Hari S.; ...

2015-10-12

Although hydraulic fracturing has been used for natural gas production for the past couple of decades, there are significant uncertainties about the underlying mechanisms behind the production curves that are seen in the field. A discrete fracture network based reservoir-scale work flow is used to identify the relative effect of flow of gas in fractures and matrix diffusion on the production curve. With realistic three dimensional representations of fracture network geometry and aperture variability, simulated production decline curves qualitatively resemble observed production decline curves. The high initial peak of the production curve is controlled by advective fracture flow of freemore » gas within the network and is sensitive to the fracture aperture variability. Matrix diffusion does not significantly affect the production decline curve in the first few years, but contributes to production after approximately 10 years. These results suggest that the initial flushing of gas-filled background fractures combined with highly heterogeneous flow paths to the production well are sufficient to explain observed initial production decline. Lastly, these results also suggest that matrix diffusion may support reduced production over longer time frames.« less

Mass transport enhancement in redox flow batteries with corrugated fluidic networks

NASA Astrophysics Data System (ADS)

Lisboa, Kleber Marques; Marschewski, Julian; Ebejer, Neil; Ruch, Patrick; Cotta, Renato Machado; Michel, Bruno; Poulikakos, Dimos

2017-08-01

We propose a facile, novel concept of mass transfer enhancement in flow batteries based on electrolyte guidance in rationally designed corrugated channel systems. The proposed fluidic networks employ periodic throttling of the flow to optimally deflect the electrolytes into the porous electrode, targeting enhancement of the electrolyte-electrode interaction. Theoretical analysis is conducted with channels in the form of trapezoidal waves, confirming and detailing the mass transport enhancement mechanism. In dilute concentration experiments with an alkaline quinone redox chemistry, a scaling of the limiting current with Re0.74 is identified, which compares favourably against the Re0.33 scaling typical of diffusion-limited laminar processes. Experimental IR-corrected polarization curves are presented for high concentration conditions, and a significant performance improvement is observed with the narrowing of the nozzles. The adverse effects of periodic throttling on the pumping power are compared with the benefits in terms of power density, and an improvement of up to 102% in net power density is obtained in comparison with the flow-by case employing straight parallel channels. The proposed novel concept of corrugated fluidic networks comes with facile fabrication and contributes to the improvement of the transport characteristics and overall performance of redox flow battery systems.

Lung assist device technology with physiologic blood flow developed on a tissue engineered scaffold platform.

PubMed

Hoganson, David M; Pryor, Howard I; Bassett, Erik K; Spool, Ira D; Vacanti, Joseph P

2011-02-21

There is no technology available to support failing lung function for patients outside the hospital. An implantable lung assist device would augment lung function as a bridge to transplant or possible destination therapy. Utilizing biomimetic design principles, a microfluidic vascular network was developed for blood inflow from the pulmonary artery and blood return to the left atrium. Computational fluid dynamics analysis was used to optimize blood flow within the vascular network. A micro milled variable depth mold with 3D features was created to achieve both physiologic blood flow and shear stress. Gas exchange occurs across a thin silicone membrane between the vascular network and adjacent alveolar chamber with flowing oxygen. The device had a surface area of 23.1 cm(2) and respiratory membrane thickness of 8.7 ± 1.2 μm. Carbon dioxide transfer within the device was 156 ml min(-1) m(-2) and the oxygen transfer was 34 ml min(-1) m(-2). A lung assist device based on tissue engineering architecture achieves gas exchange comparable to hollow fiber oxygenators yet does so while maintaining physiologic blood flow. This device may be scaled up to create an implantable ambulatory lung assist device.

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.

Coupled Multi-physics analysis of Caprock Integrity and Fault Reactivation during CO2 Sequestration*

NASA Astrophysics Data System (ADS)

Newell, P.; Martinez, M. J.; Bishop, J.

2012-12-01

Structural/stratigraphic trapping beneath a low-permeable caprock layer is the primary trapping mechanism for long-term subsurface sequestration of CO2. Pre-existing fracture networks, injection induced fractures, and faults are of concern for possible CO2 leakage both during and after injection. In this work we model the effects of both caprock jointing and a fault on the caprock sealing integrity during various injection scenarios. The modeling effort uses a three-dimensional finite-element based coupled multiphase flow and geomechanics simulator. The joints within the caprock are idealized as equally spaced and parallel. Both the mechanical and flow behavior of the joint network are treated within an effective continuum formulation. The mechanical behavior of the joint network is linear elastic in shear and nonlinear elastic in the normal direction. The flow behavior of the joint network is treated using the classical cubic-law relating flow rate and aperture. The flow behavior is then upscaled to obtain an effective permeability. The fault is modeled as a finite-thickness layer with multiple joint sets. The joint sets within the fault region are modeled following the same mechanical and flow formulation as the joints within the caprock. Various injection schedules as well as fault and caprock jointing configurations within a proto-typical sequestration site have been investigated. The resulting leakage rates through the caprock and fault are compared to those assuming intact material. The predicted leakage rates are a strong nonlinear function of the injection rate. *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.

Modeling the Effects of Cu Content and Deformation Variables on the High-Temperature Flow Behavior of Dilute Al-Fe-Si Alloys Using an Artificial Neural Network.

PubMed

Shakiba, Mohammad; Parson, Nick; Chen, X-Grant

2016-06-30

The hot deformation behavior of Al-0.12Fe-0.1Si alloys with varied amounts of Cu (0.002-0.31 wt %) was investigated by uniaxial compression tests conducted at different temperatures (400 °C-550 °C) and strain rates (0.01-10 s -1 ). The results demonstrated that flow stress decreased with increasing deformation temperature and decreasing strain rate, while flow stress increased with increasing Cu content for all deformation conditions studied due to the solute drag effect. Based on the experimental data, an artificial neural network (ANN) model was developed to study the relationship between chemical composition, deformation variables and high-temperature flow behavior. A three-layer feed-forward back-propagation artificial neural network with 20 neurons in a hidden layer was established in this study. The input parameters were Cu content, temperature, strain rate and strain, while the flow stress was the output. The performance of the proposed model was evaluated using the K-fold cross-validation method. The results showed excellent generalization capability of the developed model. Sensitivity analysis indicated that the strain rate is the most important parameter, while the Cu content exhibited a modest but significant influence on the flow stress.

Modeling the Effects of Cu Content and Deformation Variables on the High-Temperature Flow Behavior of Dilute Al-Fe-Si Alloys Using an Artificial Neural Network

PubMed Central

Shakiba, Mohammad; Parson, Nick; Chen, X.-Grant

2016-01-01

The hot deformation behavior of Al-0.12Fe-0.1Si alloys with varied amounts of Cu (0.002–0.31 wt %) was investigated by uniaxial compression tests conducted at different temperatures (400 °C–550 °C) and strain rates (0.01–10 s−1). The results demonstrated that flow stress decreased with increasing deformation temperature and decreasing strain rate, while flow stress increased with increasing Cu content for all deformation conditions studied due to the solute drag effect. Based on the experimental data, an artificial neural network (ANN) model was developed to study the relationship between chemical composition, deformation variables and high-temperature flow behavior. A three-layer feed-forward back-propagation artificial neural network with 20 neurons in a hidden layer was established in this study. The input parameters were Cu content, temperature, strain rate and strain, while the flow stress was the output. The performance of the proposed model was evaluated using the K-fold cross-validation method. The results showed excellent generalization capability of the developed model. Sensitivity analysis indicated that the strain rate is the most important parameter, while the Cu content exhibited a modest but significant influence on the flow stress. PMID:28773658

To trade or not to trade: Link prediction in the virtual water network

NASA Astrophysics Data System (ADS)

Tuninetti, Marta; Tamea, Stefania; Laio, Francesco; Ridolfi, Luca

2017-12-01

In the international trade network, links express the (temporary) presence of a commercial exchange of goods between any two countries. Given the dynamical behaviour of the trade network, where links are created and dismissed every year, predicting the link activation/deactivation is an open research question. Through the international trade network of agricultural goods, water resources are 'virtually' transferred from the country of production to the country of consumption. We propose a novel methodology for link prediction applied to the network of virtual water trade. Starting from the assumption of having links between any two countries, we estimate the associated virtual water flows by means of a gravity-law model using country and link characteristics as drivers. We consider the links with estimated flows higher than 1000 m3/year as active links, while the others as non-active links. Flows traded along estimated active links are then re-estimated using a similar but differently-calibrated gravity-law model. We were able to correctly model 84% of the existing links and 93% of the non-existing links in year 2011. It is worth to note that the predicted active links carry 99% of the global virtual water flow; hence, missed links are mainly those where a minimum volume of virtual water is exchanged. Results indicate that, over the period from 1986 to 2011, population, geographical distances between countries, and agricultural efficiency (through fertilizers use) are the major factors driving the link activation and deactivation. As opposed to other (network-based) models for link prediction, the proposed method is able to reconstruct the network architecture without any prior knowledge of the network topology, using only the nodes and links attributes; it thus represents a general method that can be applied to other networks such as food or value trade networks.

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.

Analyzing the international exergy flow network of ferrous metal ores.

PubMed

Qi, Hai; An, Haizhong; Hao, Xiaoqing; Zhong, Weiqiong; Zhang, Yanbing

2014-01-01

This paper employs an un-weighted and weighted exergy network to study the properties of ferrous metal ores in countries worldwide and their evolution from 2002 to 2012. We find that there are few countries controlling most of the ferrous metal ore exports in terms of exergy and that the entire exergy flow network is becoming more heterogeneous though the addition of new nodes. The increasing of the average clustering coefficient indicates that the formation of an international exergy flow system and regional integration is improving. When we contrast the average out strength of exergy and the average out strength of currency, we find both similarities and differences. Prices are affected largely by human factors; thus, the growth rate of the average out strength of currency has fluctuated acutely in the eleven years from 2002 to 2012. Exergy is defined as the maximum work that can be extracted from a system and can reflect the true cost in the world, and this parameter fluctuates much less. Performing an analysis based on the two aspects of exergy and currency, we find that the network is becoming uneven.

Analyzing the International Exergy Flow Network of Ferrous Metal Ores

PubMed Central

Qi, Hai; An, Haizhong; Hao, Xiaoqing; Zhong, Weiqiong; Zhang, Yanbing

2014-01-01

This paper employs an un-weighted and weighted exergy network to study the properties of ferrous metal ores in countries worldwide and their evolution from 2002 to 2012. We find that there are few countries controlling most of the ferrous metal ore exports in terms of exergy and that the entire exergy flow network is becoming more heterogeneous though the addition of new nodes. The increasing of the average clustering coefficient indicates that the formation of an international exergy flow system and regional integration is improving. When we contrast the average out strength of exergy and the average out strength of currency, we find both similarities and differences. Prices are affected largely by human factors; thus, the growth rate of the average out strength of currency has fluctuated acutely in the eleven years from 2002 to 2012. Exergy is defined as the maximum work that can be extracted from a system and can reflect the true cost in the world, and this parameter fluctuates much less. Performing an analysis based on the two aspects of exergy and currency, we find that the network is becoming uneven. PMID:25188407

Network structure impacts global commodity trade growth and resilience.

PubMed

Kharrazi, Ali; Rovenskaya, Elena; Fath, Brian D

2017-01-01

Global commodity trade networks are critical to our collective sustainable development. Their increasing interconnectedness pose two practical questions: (i) Do the current network configurations support their further growth? (ii) How resilient are these networks to economic shocks? We analyze the data of global commodity trade flows from 1996 to 2012 to evaluate the relationship between structural properties of the global commodity trade networks and (a) their dynamic growth, as well as (b) the resilience of their growth with respect to the 2009 global economic shock. Specifically, we explore the role of network efficiency and redundancy using the information theory-based network flow analysis. We find that, while network efficiency is positively correlated with growth, highly efficient systems appear to be less resilient, losing more and gaining less growth following an economic shock. While all examined networks are rather redundant, we find that network redundancy does not hinder their growth. Moreover, systems exhibiting higher levels of redundancy lose less and gain more growth following an economic shock. We suggest that a strategy to support making global trade networks more efficient via, e.g., preferential trade agreements and higher specialization, can promote their further growth; while a strategy to increase the global trade networks' redundancy via e.g., more abundant free-trade agreements, can improve their resilience to global economic shocks.

On service differentiation in mobile Ad Hoc networks.

PubMed

Zhang, Shun-liang; Ye, Cheng-qing

2004-09-01

A network model is proposed to support service differentiation for mobile Ad Hoc networks by combining a fully distributed admission control approach and the DIFS based differentiation mechanism of IEEE802.11. It can provide different kinds of QoS (Quality of Service) for various applications. Admission controllers determine a committed bandwidth based on the reserved bandwidth of flows and the source utilization of networks. Packets are marked when entering into networks by markers according to the committed rate. By the mark in the packet header, intermediate nodes handle the received packets in different manners to provide applications with the QoS corresponding to the pre-negotiated profile. Extensive simulation experiments showed that the proposed mechanism can provide QoS guarantee to assured service traffic and increase the channel utilization of networks.

Passive and Active Analysis in DSR-Based Ad Hoc Networks

NASA Astrophysics Data System (ADS)

Dempsey, Tae; Sahin, Gokhan; Morton, Y. T. (Jade)

Security and vulnerabilities in wireless ad hoc networks have been considered at different layers, and many attack strategies have been proposed, including denial of service (DoS) through the intelligent jamming of the most critical packet types of flows in a network. This paper investigates the effectiveness of intelligent jamming in wireless ad hoc networks using the Dynamic Source Routing (DSR) and TCP protocols and introduces an intelligent classifier to facilitate the jamming of such networks. Assuming encrypted packet headers and contents, our classifier is based solely on the observable characteristics of size, inter-arrival timing, and direction and classifies packets with up to 99.4% accuracy in our experiments. Furthermore, we investigate active analysis, which is the combination of a classifier and intelligent jammer to invoke specific responses from a victim network.

A microfluidic device for simultaneous measurement of viscosity and flow rate of blood in a complex fluidic network

PubMed Central

Jun Kang, Yang; Yeom, Eunseop; Lee, Sang-Joon

2013-01-01

Blood viscosity has been considered as one of important biophysical parameters for effectively monitoring variations in physiological and pathological conditions of circulatory disorders. Standard previous methods make it difficult to evaluate variations of blood viscosity under cardiopulmonary bypass procedures or hemodialysis. In this study, we proposed a unique microfluidic device for simultaneously measuring viscosity and flow rate of whole blood circulating in a complex fluidic network including a rat, a reservoir, a pinch valve, and a peristaltic pump. To demonstrate the proposed method, a twin-shaped microfluidic device, which is composed of two half-circular chambers, two side channels with multiple indicating channels, and one bridge channel, was carefully designed. Based on the microfluidic device, three sequential flow controls were applied to identify viscosity and flow rate of blood, with label-free and sensorless detection. The half-circular chamber was employed to achieve mechanical membrane compliance for flow stabilization in the microfluidic device. To quantify the effect of flow stabilization on flow fluctuations, a formula of pulsation index (PI) was analytically derived using a discrete fluidic circuit model. Using the PI formula, the time constant contributed by the half-circular chamber is estimated to be 8 s. Furthermore, flow fluctuations resulting from the peristaltic pumps are completely removed, especially under periodic flow conditions within short periods (T < 10 s). For performance demonstrations, the proposed method was applied to evaluate blood viscosity with respect to varying flow rate conditions [(a) known blood flow rate via a syringe pump, (b) unknown blood flow rate via a peristaltic pump]. As a result, the flow rate and viscosity of blood can be simultaneously measured with satisfactory accuracy. In addition, the proposed method was successfully applied to identify the viscosity of rat blood, which circulates in a complex fluidic network. These observations confirm that the proposed method can be used for simultaneous measurement of viscosity and flow rate of whole blood circulating in the complex fluid network, with sensorless and label-free detection. Furthermore, the proposed method will be used in evaluating variations in the viscosity of human blood during cardiopulmonary bypass procedures or hemodialysis. PMID:24404074

A microfluidic device for simultaneous measurement of viscosity and flow rate of blood in a complex fluidic network.

PubMed

Jun Kang, Yang; Yeom, Eunseop; Lee, Sang-Joon

2013-01-01

Blood viscosity has been considered as one of important biophysical parameters for effectively monitoring variations in physiological and pathological conditions of circulatory disorders. Standard previous methods make it difficult to evaluate variations of blood viscosity under cardiopulmonary bypass procedures or hemodialysis. In this study, we proposed a unique microfluidic device for simultaneously measuring viscosity and flow rate of whole blood circulating in a complex fluidic network including a rat, a reservoir, a pinch valve, and a peristaltic pump. To demonstrate the proposed method, a twin-shaped microfluidic device, which is composed of two half-circular chambers, two side channels with multiple indicating channels, and one bridge channel, was carefully designed. Based on the microfluidic device, three sequential flow controls were applied to identify viscosity and flow rate of blood, with label-free and sensorless detection. The half-circular chamber was employed to achieve mechanical membrane compliance for flow stabilization in the microfluidic device. To quantify the effect of flow stabilization on flow fluctuations, a formula of pulsation index (PI) was analytically derived using a discrete fluidic circuit model. Using the PI formula, the time constant contributed by the half-circular chamber is estimated to be 8 s. Furthermore, flow fluctuations resulting from the peristaltic pumps are completely removed, especially under periodic flow conditions within short periods (T < 10 s). For performance demonstrations, the proposed method was applied to evaluate blood viscosity with respect to varying flow rate conditions [(a) known blood flow rate via a syringe pump, (b) unknown blood flow rate via a peristaltic pump]. As a result, the flow rate and viscosity of blood can be simultaneously measured with satisfactory accuracy. In addition, the proposed method was successfully applied to identify the viscosity of rat blood, which circulates in a complex fluidic network. These observations confirm that the proposed method can be used for simultaneous measurement of viscosity and flow rate of whole blood circulating in the complex fluid network, with sensorless and label-free detection. Furthermore, the proposed method will be used in evaluating variations in the viscosity of human blood during cardiopulmonary bypass procedures or hemodialysis.

The Building of Multimedia Communications Network based on Session Initiation Protocol

NASA Astrophysics Data System (ADS)

Yuexiao, Han; Yanfu, Zhang

In this paper, we presented a novel design for a distributed multimedia communications network. We introduced the distributed tactic, flow procedure and particular structure. We also analyzed its scalability, stability, robustness, extension, and transmission delay of this architecture. Finally, the result shows our framework is suitable for very large scale communications.

Optimizing Power–Frequency Droop Characteristics of Distributed Energy Resources

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

Guggilam, Swaroop S.; Zhao, Changhong; Dall Anese, Emiliano

This paper outlines a procedure to design power-frequency droop slopes for distributed energy resources (DERs) installed in distribution networks to optimally participate in primary frequency response. In particular, the droop slopes are engineered such that DERs respond in proportion to their power ratings and they are not unfairly penalized in power provisioning based on their location in the distribution network. The main contribution of our approach is that a guaranteed level of frequency regulation can be guaranteed at the feeder head, while ensuring that the outputs of individual DERs conform to some well-defined notion of fairness. The approach we adoptmore » leverages an optimization-based perspective and suitable linearizations of the power-flow equations to embed notions of fairness and information regarding the physics of the power flows within the distribution network into the droop slopes. Time-domain simulations from a differential algebraic equation model of the 39-bus New England test-case system augmented with three instances of the IEEE 37-node distribution-network with frequency-sensitive DERs are provided to validate our approach.« less

Electron Heat Flux in Pressure Balance Structures at Ulysses

NASA Technical Reports Server (NTRS)

Yamauchi, Yohei; Suess, Steven T.; Sakurai, Takashi; Whitaker, Ann F. (Technical Monitor)

2001-01-01

Pressure balance structures (PBSs) are a common feature in the high-latitude solar wind near solar minimum. Rom previous studies, PBSs are believed to be remnants of coronal plumes and be related to network activity such as magnetic reconnection in the photosphere. We investigated the magnetic structures of the PBSs, applying a minimum variance analysis to Ulysses/Magnetometer data. At 2001 AGU Spring meeting, we reported that PBSs have structures like current sheets or plasmoids, and suggested that they are associated with network activity at the base of polar plumes. In this paper, we have analyzed high-energy electron data at Ulysses/SWOOPS to see whether bi-directional electron flow exists and confirm the conclusions more precisely. As a result, although most events show a typical flux directed away from the Sun, we have obtained evidence that some PBSs show bi-directional electron flux and others show an isotropic distribution of electron pitch angles. The evidence shows that plasmoids are flowing away from the Sun, changing their flow direction dynamically in a way not caused by Alfven waves. From this, we have concluded that PBSs are generated due to network activity at the base of polar plumes and their magnetic structures axe current sheets or plasmoids.

A hybrid optical switch architecture to integrate IP into optical networks to provide flexible and intelligent bandwidth on demand for cloud computing

NASA Astrophysics Data System (ADS)

Yang, Wei; Hall, Trevor J.

2013-12-01

The Internet is entering an era of cloud computing to provide more cost effective, eco-friendly and reliable services to consumer and business users. As a consequence, the nature of the Internet traffic has been fundamentally transformed from a pure packet-based pattern to today's predominantly flow-based pattern. Cloud computing has also brought about an unprecedented growth in the Internet traffic. In this paper, a hybrid optical switch architecture is presented to deal with the flow-based Internet traffic, aiming to offer flexible and intelligent bandwidth on demand to improve fiber capacity utilization. The hybrid optical switch is capable of integrating IP into optical networks for cloud-based traffic with predictable performance, for which the delay performance of the electronic module in the hybrid optical switch architecture is evaluated through simulation.

Understanding the topological characteristics and flow complexity of urban traffic congestion

NASA Astrophysics Data System (ADS)

Wen, Tzai-Hung; Chin, Wei-Chien-Benny; Lai, Pei-Chun

2017-05-01

For a growing number of developing cities, the capacities of streets cannot meet the rapidly growing demand of cars, causing traffic congestion. Understanding the spatial-temporal process of traffic flow and detecting traffic congestion are important issues associated with developing sustainable urban policies to resolve congestion. Therefore, the objective of this study is to propose a flow-based ranking algorithm for investigating traffic demands in terms of the attractiveness of street segments and flow complexity of the street network based on turning probability. Our results show that, by analyzing the topological characteristics of streets and volume data for a small fraction of street segments in Taipei City, the most congested segments of the city were identified successfully. The identified congested segments are significantly close to the potential congestion zones, including the officially announced most congested streets, the segments with slow moving speeds at rush hours, and the areas near significant landmarks. The identified congested segments also captured congestion-prone areas concentrated in the business districts and industrial areas of the city. Identifying the topological characteristics and flow complexity of traffic congestion provides network topological insights for sustainable urban planning, and these characteristics can be used to further understand congestion propagation.

A network architecture for International Business Satellite communications

NASA Astrophysics Data System (ADS)

Takahata, Fumio; Nohara, Mitsuo; Takeuchi, Yoshio

Demand Assignment (DA) control is expected to be introduced in the International Business Satellte communications (IBS) network in order to cope with a growing international business traffic. The paper discusses the DA/IBS network from the viewpoints of network configuration, satellite channel configuration and DA control. The network configuration proposed here consists of one Central Station with network management function and several Network Coordination Stations with user management function. A satellite channel configuration is also presented along with a tradeoff study on transmission bit rate, high power amplifier output power requirement, and service quality. The DA control flow and protocol based on CCITT Signalling System No. 7 are also proposed.

Evolution of weighted complex bus transit networks with flow

NASA Astrophysics Data System (ADS)

Huang, Ailing; Xiong, Jie; Shen, Jinsheng; Guan, Wei

2016-02-01

Study on the intrinsic properties and evolutional mechanism of urban public transit networks (PTNs) has great significance for transit planning and control, particularly considering passengers’ dynamic behaviors. This paper presents an empirical analysis for exploring the complex properties of Beijing’s weighted bus transit network (BTN) based on passenger flow in L-space, and proposes a bi-level evolution model to simulate the development of transit routes from the view of complex network. The model is an iterative process that is driven by passengers’ travel demands and dual-controlled interest mechanism, which is composed of passengers’ spatio-temporal requirements and cost constraint of transit agencies. Also, the flow’s dynamic behaviors, including the evolutions of travel demand, sectional flow attracted by a new link and flow perturbation triggered in nearby routes, are taken into consideration in the evolutional process. We present the numerical experiment to validate the model, where the main parameters are estimated by using distribution functions that are deduced from real-world data. The results obtained have proven that our model can generate a BTN with complex properties, such as the scale-free behavior or small-world phenomenon, which shows an agreement with our empirical results. Our study’s results can be exploited to optimize the real BTN’s structure and improve the network’s robustness.

Spatiotemporal image correlation analysis of blood flow in branched vessel networks of zebrafish embryos

NASA Astrophysics Data System (ADS)

Ceffa, Nicolo G.; Cesana, Ilaria; Collini, Maddalena; D'Alfonso, Laura; Carra, Silvia; Cotelli, Franco; Sironi, Laura; Chirico, Giuseppe

2017-10-01

Ramification of blood circulation is relevant in a number of physiological and pathological conditions. The oxygen exchange occurs largely in the capillary bed, and the cancer progression is closely linked to the angiogenesis around the tumor mass. Optical microscopy has made impressive improvements in in vivo imaging and dynamic studies based on correlation analysis of time stacks of images. Here, we develop and test advanced methods that allow mapping the flow fields in branched vessel networks at the resolution of 10 to 20 μm. The methods, based on the application of spatiotemporal image correlation spectroscopy and its extension to cross-correlation analysis, are applied here to the case of early stage embryos of zebrafish.

A Novel Approach to Adaptive Flow Separation Control

DTIC Science & Technology

2016-09-03

particular, it considers control of flow separation over a NACA-0025 airfoil using microjet actuators and develops Adaptive Sampling Based Model...Predictive Control ( Adaptive SBMPC), a novel approach to Nonlinear Model Predictive Control that applies the Minimal Resource Allocation Network...Distribution Unlimited UU UU UU UU 03-09-2016 1-May-2013 30-Apr-2016 Final Report: A Novel Approach to Adaptive Flow Separation Control The views, opinions

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

The topology of card transaction money flows

NASA Astrophysics Data System (ADS)

Zanin, Massimiliano; Papo, David; Romance, Miguel; Criado, Regino; Moral, Santiago

2016-11-01

Money flow models are essential tools to understand different economical phenomena, like saving propensities and wealth distributions. In spite of their importance, most of them are based on synthetic transaction networks with simple topologies, e.g. random or scale-free ones, as the characterisation of real networks is made difficult by the confidentiality and sensitivity of money transaction data. Here, we present an analysis of the topology created by real credit card transactions from one of the biggest world banks, and show how different distributions, e.g. number of transactions per card or amount, have nontrivial characteristics. We further describe a stochastic model to create transactions data sets, feeding from the obtained distributions, which will allow researchers to create more realistic money flow models.

A knowledge-based system for controlling automobile traffic

NASA Technical Reports Server (NTRS)

Maravas, Alexander; Stengel, Robert F.

1994-01-01

Transportation network capacity variations arising from accidents, roadway maintenance activity, and special events as well as fluctuations in commuters' travel demands complicate traffic management. Artificial intelligence concepts and expert systems can be useful in framing policies for incident detection, congestion anticipation, and optimal traffic management. This paper examines the applicability of intelligent route guidance and control as decision aids for traffic management. Basic requirements for managing traffic are reviewed, concepts for studying traffic flow are introduced, and mathematical models for modeling traffic flow are examined. Measures for quantifying transportation network performance levels are chosen, and surveillance and control strategies are evaluated. It can be concluded that automated decision support holds great promise for aiding the efficient flow of automobile traffic over limited-access roadways, bridges, and tunnels.

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.

Network structure impacts global commodity trade growth and resilience

PubMed Central

Rovenskaya, Elena; Fath, Brian D.

2017-01-01

Global commodity trade networks are critical to our collective sustainable development. Their increasing interconnectedness pose two practical questions: (i) Do the current network configurations support their further growth? (ii) How resilient are these networks to economic shocks? We analyze the data of global commodity trade flows from 1996 to 2012 to evaluate the relationship between structural properties of the global commodity trade networks and (a) their dynamic growth, as well as (b) the resilience of their growth with respect to the 2009 global economic shock. Specifically, we explore the role of network efficiency and redundancy using the information theory-based network flow analysis. We find that, while network efficiency is positively correlated with growth, highly efficient systems appear to be less resilient, losing more and gaining less growth following an economic shock. While all examined networks are rather redundant, we find that network redundancy does not hinder their growth. Moreover, systems exhibiting higher levels of redundancy lose less and gain more growth following an economic shock. We suggest that a strategy to support making global trade networks more efficient via, e.g., preferential trade agreements and higher specialization, can promote their further growth; while a strategy to increase the global trade networks’ redundancy via e.g., more abundant free-trade agreements, can improve their resilience to global economic shocks. PMID:28207790

The Atlas of Chinese World Wide Web Ecosystem Shaped by the Collective Attention Flows.

PubMed

Lou, Xiaodan; Li, Yong; Gu, Weiwei; Zhang, Jiang

2016-01-01

The web can be regarded as an ecosystem of digital resources connected and shaped by collective successive behaviors of users. Knowing how people allocate limited attention on different resources is of great importance. To answer this, we embed the most popular Chinese web sites into a high dimensional Euclidean space based on the open flow network model of a large number of Chinese users' collective attention flows, which both considers the connection topology of hyperlinks between the sites and the collective behaviors of the users. With these tools, we rank the web sites and compare their centralities based on flow distances with other metrics. We also study the patterns of attention flow allocation, and find that a large number of web sites concentrate on the central area of the embedding space, and only a small fraction of web sites disperse in the periphery. The entire embedding space can be separated into 3 regions(core, interim, and periphery). The sites in the core (1%) occupy a majority of the attention flows (40%), and the sites (34%) in the interim attract 40%, whereas other sites (65%) only take 20% flows. What's more, we clustered the web sites into 4 groups according to their positions in the space, and found that similar web sites in contents and topics are grouped together. In short, by incorporating the open flow network model, we can clearly see how collective attention allocates and flows on different web sites, and how web sites connected each other.

A new estimation of equivalent matrix block sizes in fractured media with two-phase flow applications in dual porosity models

NASA Astrophysics Data System (ADS)

Jerbi, Chahir; Fourno, André; Noetinger, Benoit; Delay, Frederick

2017-05-01

Single and multiphase flows in fractured porous media at the scale of natural reservoirs are often handled by resorting to homogenized models that avoid the heavy computations associated with a complete discretization of both fractures and matrix blocks. For example, the two overlapping continua (fractures and matrix) of a dual porosity system are coupled by way of fluid flux exchanges that deeply condition flow at the large scale. This characteristic is a key to realistic flow simulations, especially for multiphase flow as capillary forces and contrasts of fluid mobility compete in the extraction of a fluid from a capacitive matrix then conveyed through the fractures. The exchange rate between fractures and matrix is conditioned by the so-called mean matrix block size which can be viewed as the size of a single matrix block neighboring a single fracture within a mesh of a dual porosity model. We propose a new evaluation of this matrix block size based on the analysis of discrete fracture networks. The fundaments rely upon establishing at the scale of a fractured block the equivalence between the actual fracture network and a Warren and Root network only made of three regularly spaced fracture families parallel to the facets of the fractured block. The resulting matrix block sizes are then compared via geometrical considerations and two-phase flow simulations to the few other available methods. It is shown that the new method is stable in the sense it provides accurate sizes irrespective of the type of fracture network investigated. The method also results in two-phase flow simulations from dual porosity models very close to that from references calculated in finely discretized networks. Finally, calculations of matrix block sizes by this new technique reveal very rapid, which opens the way to cumbersome applications such as preconditioning a dual porosity approach applied to regional fractured reservoirs.

Network Structure as a Modulator of Disturbance Impacts in Streams

NASA Astrophysics Data System (ADS)

Warner, S.; Tullos, D. D.

2017-12-01

This study examines how river network structure affects the propagation of geomorphic and anthropogenic disturbances through streams. Geomorphic processes such as debris flows can alter channel morphology and modify habitat for aquatic biota. Anthropogenic disturbances such as road construction can interact with the geomorphology and hydrology of forested watersheds to change sediment and water inputs to streams. It was hypothesized that the network structure of streams within forested watersheds would influence the location and magnitude of the impacts of debris flows and road construction on sediment size and channel width. Longitudinal surveys were conducted every 50 meters for 11 kilometers of third-to-fifth order streams in the H.J. Andrews Experimental Forest in the Western Cascade Range of Oregon. Particle counts and channel geometry measurements were collected to characterize the geomorphic impacts of road crossings and debris flows as disturbances. Sediment size distributions and width measurements were plotted against the distance of survey locations through the network to identify variations in longitudinal trends of channel characteristics. Thresholds for the background variation in sediment size and channel width, based on the standard deviations of sample points, were developed for sampled stream segments characterized by location as well as geomorphic and land use history. Survey locations were classified as "disturbed" when they deviated beyond the reference thresholds in expected sediment sizes and channel widths, as well as flow-connected proximity to debris flows and road crossings. River network structure was quantified by drainage density and centrality of nodes upstream of survey locations. Drainage density and node centrality were compared between survey locations with similar channel characteristic classifications. Cluster analysis was used to assess the significance of survey location, proximity of survey location to debris flows and road crossings, drainage density and node centrality in predicting sediment size and channel width classifications for locations within the watershed. Results contribute to the understanding of susceptibility and responses of streams supporting critical habitat for aquatic species to debris flows and forest road disturbances.

Streamflow characteristics at hydrologic bench-mark stations

USGS Publications Warehouse

Lawrence, C.L.

1987-01-01

The Hydrologic Bench-Mark Network was established in the 1960's. Its objectives were to document the hydrologic characteristics of representative undeveloped watersheds nationwide and to provide a comparative base for studying the effects of man on the hydrologic environment. The network, which consists of 57 streamflow gaging stations and one lake-stage station in 39 States, is planned for permanent operation. This interim report describes streamflow characteristics at each bench-mark site and identifies time trends in annual streamflow that have occurred during the data-collection period. The streamflow characteristics presented for each streamflow station are (1) flood and low-flow frequencies, (2) flow duration, (3) annual mean flow, and (4) the serial correlation coefficient for annual mean discharge. In addition, Kendall's tau is computed as an indicator of time trend in annual discharges. The period of record for most stations was 13 to 17 years, although several stations had longer periods of record. The longest period was 65 years for Merced River near Yosemite, Calif. Records of flow at 6 of 57 streamflow sites in the network showed a statistically significant change in annual mean discharge over the period of record, based on computations of Kendall's tau. The values of Kendall's tau ranged from -0.533 to 0.648. An examination of climatological records showed that changes in precipitation were most likely the cause for the change in annual mean discharge.

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.

Stochastic flux analysis of chemical reaction networks

PubMed Central

2013-01-01

Background Chemical reaction networks provide an abstraction scheme for a broad range of models in biology and ecology. The two common means for simulating these networks are the deterministic and the stochastic approaches. The traditional deterministic approach, based on differential equations, enjoys a rich set of analysis techniques, including a treatment of reaction fluxes. However, the discrete stochastic simulations, which provide advantages in some cases, lack a quantitative treatment of network fluxes. Results We describe a method for flux analysis of chemical reaction networks, where flux is given by the flow of species between reactions in stochastic simulations of the network. Extending discrete event simulation algorithms, our method constructs several data structures, and thereby reveals a variety of statistics about resource creation and consumption during the simulation. We use these structures to quantify the causal interdependence and relative importance of the reactions at arbitrary time intervals with respect to the network fluxes. This allows us to construct reduced networks that have the same flux-behavior, and compare these networks, also with respect to their time series. We demonstrate our approach on an extended example based on a published ODE model of the same network, that is, Rho GTP-binding proteins, and on other models from biology and ecology. Conclusions We provide a fully stochastic treatment of flux analysis. As in deterministic analysis, our method delivers the network behavior in terms of species transformations. Moreover, our stochastic analysis can be applied, not only at steady state, but at arbitrary time intervals, and used to identify the flow of specific species between specific reactions. Our cases study of Rho GTP-binding proteins reveals the role played by the cyclic reverse fluxes in tuning the behavior of this network. PMID:24314153

Stochastic flux analysis of chemical reaction networks.

PubMed

Kahramanoğulları, Ozan; Lynch, James F

2013-12-07

Chemical reaction networks provide an abstraction scheme for a broad range of models in biology and ecology. The two common means for simulating these networks are the deterministic and the stochastic approaches. The traditional deterministic approach, based on differential equations, enjoys a rich set of analysis techniques, including a treatment of reaction fluxes. However, the discrete stochastic simulations, which provide advantages in some cases, lack a quantitative treatment of network fluxes. We describe a method for flux analysis of chemical reaction networks, where flux is given by the flow of species between reactions in stochastic simulations of the network. Extending discrete event simulation algorithms, our method constructs several data structures, and thereby reveals a variety of statistics about resource creation and consumption during the simulation. We use these structures to quantify the causal interdependence and relative importance of the reactions at arbitrary time intervals with respect to the network fluxes. This allows us to construct reduced networks that have the same flux-behavior, and compare these networks, also with respect to their time series. We demonstrate our approach on an extended example based on a published ODE model of the same network, that is, Rho GTP-binding proteins, and on other models from biology and ecology. We provide a fully stochastic treatment of flux analysis. As in deterministic analysis, our method delivers the network behavior in terms of species transformations. Moreover, our stochastic analysis can be applied, not only at steady state, but at arbitrary time intervals, and used to identify the flow of specific species between specific reactions. Our cases study of Rho GTP-binding proteins reveals the role played by the cyclic reverse fluxes in tuning the behavior of this network.

Debris flow initiation by runoff in a recently burned basin: Is grain-by-grain sediment bulking or en masse failure to blame?

NASA Astrophysics Data System (ADS)

McGuire, Luke A.; Rengers, Francis K.; Kean, Jason W.; Staley, Dennis M.

2017-07-01

Postwildfire debris flows are frequently triggered by runoff following high-intensity rainfall, but the physical mechanisms by which water-dominated flows transition to debris flows are poorly understood relative to debris flow initiation from shallow landslides. In this study, we combined a numerical model with high-resolution hydrologic and geomorphic data sets to test two different hypotheses for debris flow initiation during a rainfall event that produced numerous debris flows within a recently burned drainage basin. Based on simulations, large volumes of sediment eroded from the hillslopes were redeposited within the channel network throughout the storm, leading to the initiation of numerous debris flows as a result of the mass failure of sediment dams that built up within the channel. More generally, results provide a quantitative framework for assessing the potential of runoff-generated debris flows based on sediment supply and hydrologic conditions.

Debris flow initiation by runoff in a recently burned basin: Is grain-by-grain sediment bulking or en masse failure to blame?

USGS Publications Warehouse

McGuire, Luke; Rengers, Francis K.; Kean, Jason W.; Staley, Dennis M.

2017-01-01

Postwildfire debris flows are frequently triggered by runoff following high-intensity rainfall, but the physical mechanisms by which water-dominated flows transition to debris flows are poorly understood relative to debris flow initiation from shallow landslides. In this study, we combined a numerical model with high-resolution hydrologic and geomorphic data sets to test two different hypotheses for debris flow initiation during a rainfall event that produced numerous debris flows within a recently burned drainage basin. Based on simulations, large volumes of sediment eroded from the hillslopes were redeposited within the channel network throughout the storm, leading to the initiation of numerous debris flows as a result of the mass failure of sediment dams that built up within the channel. More generally, results provide a quantitative framework for assessing the potential of runoff-generated debris flows based on sediment supply and hydrologic conditions.

Systematic flood modelling to support flood-proof urban design

NASA Astrophysics Data System (ADS)

Bruwier, Martin; Mustafa, Ahmed; Aliaga, Daniel; Archambeau, Pierre; Erpicum, Sébastien; Nishida, Gen; Zhang, Xiaowei; Pirotton, Michel; Teller, Jacques; Dewals, Benjamin

2017-04-01

Urban flood risk is influenced by many factors such as hydro-meteorological drivers, existing drainage systems as well as vulnerability of population and assets. The urban fabric itself has also a complex influence on inundation flows. In this research, we performed a systematic analysis on how various characteristics of urban patterns control inundation flow within the urban area and upstream of it. An urban generator tool was used to generate over 2,250 synthetic urban networks of 1 km2. This tool is based on the procedural modelling presented by Parish and Müller (2001) which was adapted to generate a broader variety of urban networks. Nine input parameters were used to control the urban geometry. Three of them define the average length, orientation and curvature of the streets. Two orthogonal major roads, for which the width constitutes the fourth input parameter, work as constraints to generate the urban network. The width of secondary streets is given by the fifth input parameter. Each parcel generated by the street network based on a parcel mean area parameter can be either a park or a building parcel depending on the park ratio parameter. Three setback parameters constraint the exact location of the building whithin a building parcel. For each of synthetic urban network, detailed two-dimensional inundation maps were computed with a hydraulic model. The computational efficiency was enhanced by means of a porosity model. This enables the use of a coarser computational grid , while preserving information on the detailed geometry of the urban network (Sanders et al. 2008). These porosity parameters reflect not only the void fraction, which influences the storage capacity of the urban area, but also the influence of buildings on flow conveyance (dynamic effects). A sensitivity analysis was performed based on the inundation maps to highlight the respective impact of each input parameter characteristizing the urban networks. The findings of the study pinpoint which properties of urban networks have a major influence on urban inundation flow, enabling better informed flood-proof urban design. References: Parish, Y. I. H., Muller, P. 2001. Procedural modeling of cities. SIGGRAPH, pp. 301—308. Sanders, B.F., Schubert, J.E., Gallegos, H.A., 2008. Integral formulation of shallow-water equations with anisotropic porosity for urban flood modeling. Journal of Hydrology 362, 19-38. Acknowledgements: The research was funded through the ARC grant for Concerted Research Actions, financed by the Wallonia-Brussels Federation.

HPNAIDM: The High-Performance Network Anomaly/Intrusion Detection and Mitigation System

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

Chen, Yan

Identifying traffic anomalies and attacks rapidly and accurately is critical for large network operators. With the rapid growth of network bandwidth, such as the next generation DOE UltraScience Network, and fast emergence of new attacks/virus/worms, existing network intrusion detection systems (IDS) are insufficient because they: • Are mostly host-based and not scalable to high-performance networks; • Are mostly signature-based and unable to adaptively recognize flow-level unknown attacks; • Cannot differentiate malicious events from the unintentional anomalies. To address these challenges, we proposed and developed a new paradigm called high-performance network anomaly/intrustion detection and mitigation (HPNAIDM) system. The new paradigm ismore » significantly different from existing IDSes with the following features (research thrusts). • Online traffic recording and analysis on high-speed networks; • Online adaptive flow-level anomaly/intrusion detection and mitigation; • Integrated approach for false positive reduction. Our research prototype and evaluation demonstrate that the HPNAIDM system is highly effective and economically feasible. Beyond satisfying the pre-set goals, we even exceed that significantly (see more details in the next section). Overall, our project harvested 23 publications (2 book chapters, 6 journal papers and 15 peer-reviewed conference/workshop papers). Besides, we built a website for technique dissemination, which hosts two system prototype release to the research community. We also filed a patent application and developed strong international and domestic collaborations which span both academia and industry.« less

Experimental testing and modeling analysis of solute mixing at water distribution pipe junctions.

PubMed

Shao, Yu; Jeffrey Yang, Y; Jiang, Lijie; Yu, Tingchao; Shen, Cheng

2014-06-01

Flow dynamics at a pipe junction controls particle trajectories, solute mixing and concentrations in downstream pipes. The effect can lead to different outcomes of water quality modeling and, hence, drinking water management in a distribution network. Here we have investigated solute mixing behavior in pipe junctions of five hydraulic types, for which flow distribution factors and analytical equations for network modeling are proposed. First, based on experiments, the degree of mixing at a cross is found to be a function of flow momentum ratio that defines a junction flow distribution pattern and the degree of departure from complete mixing. Corresponding analytical solutions are also validated using computational-fluid-dynamics (CFD) simulations. Second, the analytical mixing model is further extended to double-Tee junctions. Correspondingly the flow distribution factor is modified to account for hydraulic departure from a cross configuration. For a double-Tee(A) junction, CFD simulations show that the solute mixing depends on flow momentum ratio and connection pipe length, whereas the mixing at double-Tee(B) is well represented by two independent single-Tee junctions with a potential water stagnation zone in between. Notably, double-Tee junctions differ significantly from a cross in solute mixing and transport. However, it is noted that these pipe connections are widely, but incorrectly, simplified as cross junctions of assumed complete solute mixing in network skeletonization and water quality modeling. For the studied pipe junction types, analytical solutions are proposed to characterize the incomplete mixing and hence may allow better water quality simulation in a distribution network. Published by Elsevier Ltd.

Flow Correlated Percolation during Vascular Remodeling in Growing Tumors

NASA Astrophysics Data System (ADS)

Lee, D.-S.; Rieger, H.; Bartha, K.

2006-02-01

A theoretical model based on the molecular interactions between a growing tumor and a dynamically evolving blood vessel network describes the transformation of the regular vasculature in normal tissues into a highly inhomogeneous tumor specific capillary network. The emerging morphology, characterized by the compartmentalization of the tumor into several regions differing in vessel density, diameter, and necrosis, is in accordance with experimental data for human melanoma. Vessel collapse due to a combination of severely reduced blood flow and solid stress exerted by the tumor leads to a correlated percolation process that is driven towards criticality by the mechanism of hydrodynamic vessel stabilization.

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.

Fracture network created by 3D printer and its validation using CT images

NASA Astrophysics Data System (ADS)

Suzuki, A.; Watanabe, N.; Li, K.; Horne, R. N.

2017-12-01

Understanding flow mechanisms in fractured media is essential for geoscientific research and geological development industries. This study used 3D printed fracture networks in order to control the properties of fracture distributions inside the sample. The accuracy and appropriateness of creating samples by the 3D printer was investigated by using a X-ray CT scanner. The CT scan images suggest that the 3D printer is able to reproduce complex three-dimensional spatial distributions of fracture networks. Use of hexane after printing was found to be an effective way to remove wax for the post-treatment. Local permeability was obtained by the cubic law and used to calculate the global mean. The experimental value of the permeability was between the arithmetic and geometric means of the numerical results, which is consistent with conventional studies. This methodology based on 3D printed fracture networks can help validate existing flow modeling and numerical methods.

High frequency sound propagation in a network of interconnecting streets

NASA Astrophysics Data System (ADS)

Hewett, D. P.

2012-12-01

We propose a new model for the propagation of acoustic energy from a time-harmonic point source through a network of interconnecting streets in the high frequency regime, in which the wavelength is small compared to typical macro-lengthscales such as street widths/lengths and building heights. Our model, which is based on geometrical acoustics (ray theory), represents the acoustic power flow from the source along any pathway through the network as the integral of a power density over the launch angle of a ray emanating from the source, and takes into account the key phenomena involved in the propagation, namely energy loss by wall absorption, energy redistribution at junctions, and, in 3D, energy loss to the atmosphere. The model predicts strongly anisotropic decay away from the source, with the power flow decaying exponentially in the number of junctions from the source, except along the axial directions of the network, where the decay is algebraic.

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.

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.

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.

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.

Planning and cost analysis of digital radiography services for a network of hospitals (the Veterans Integrated Service Network).

PubMed

Duerinckx, A J; Kenagy, J J; Grant, E G

1998-01-01

This study analysed the design and cost of a picture archiving and communications system (PACS), computerized radiography (CR) and a wide-area network for teleradiology. The Desert Pacific Healthcare Network comprises 10 facilities, including four tertiary medical centres and one small hospital. Data were collected on radiologists' workloads, and patient and image flow within and between these medical centres. These were used to estimate the size and cash flows associated with a system-wide implementation of PACS, CR and teleradiology services. A cost analysis model was used to estimate the potential cost savings in a filmless radiology environment. ATM technology was selected as the communications medium between the medical centres. A strategic plan and business plan were successfully developed. The cost model predicted the cost-effectiveness of the proposed PACS/CR configuration within four to six years, if the base costs were kept low. The experience gained in design and cost analysis of a PACS/teleradiology network will serve as a model for similar projects.

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.

An Adaptive Flow Solver for Air-Borne Vehicles Undergoing Time-Dependent Motions/Deformations

NASA Technical Reports Server (NTRS)

Singh, Jatinder; Taylor, Stephen

1997-01-01

This report describes a concurrent Euler flow solver for flows around complex 3-D bodies. The solver is based on a cell-centered finite volume methodology on 3-D unstructured tetrahedral grids. In this algorithm, spatial discretization for the inviscid convective term is accomplished using an upwind scheme. A localized reconstruction is done for flow variables which is second order accurate. Evolution in time is accomplished using an explicit three-stage Runge-Kutta method which has second order temporal accuracy. This is adapted for concurrent execution using another proven methodology based on concurrent graph abstraction. This solver operates on heterogeneous network architectures. These architectures may include a broad variety of UNIX workstations and PCs running Windows NT, symmetric multiprocessors and distributed-memory multi-computers. The unstructured grid is generated using commercial grid generation tools. The grid is automatically partitioned using a concurrent algorithm based on heat diffusion. This results in memory requirements that are inversely proportional to the number of processors. The solver uses automatic granularity control and resource management techniques both to balance load and communication requirements, and deal with differing memory constraints. These ideas are again based on heat diffusion. Results are subsequently combined for visualization and analysis using commercial CFD tools. Flow simulation results are demonstrated for a constant section wing at subsonic, transonic, and a supersonic case. These results are compared with experimental data and numerical results of other researchers. Performance results are under way for a variety of network topologies.

Clustering and Flow Conservation Monitoring Tool for Software Defined Networks.

PubMed

Puente Fernández, Jesús Antonio; García Villalba, Luis Javier; Kim, Tai-Hoon

2018-04-03

Prediction systems present some challenges on two fronts: the relation between video quality and observed session features and on the other hand, dynamics changes on the video quality. Software Defined Networks (SDN) is a new concept of network architecture that provides the separation of control plane (controller) and data plane (switches) in network devices. Due to the existence of the southbound interface, it is possible to deploy monitoring tools to obtain the network status and retrieve a statistics collection. Therefore, achieving the most accurate statistics depends on a strategy of monitoring and information requests of network devices. In this paper, we propose an enhanced algorithm for requesting statistics to measure the traffic flow in SDN networks. Such an algorithm is based on grouping network switches in clusters focusing on their number of ports to apply different monitoring techniques. Such grouping occurs by avoiding monitoring queries in network switches with common characteristics and then, by omitting redundant information. In this way, the present proposal decreases the number of monitoring queries to switches, improving the network traffic and preventing the switching overload. We have tested our optimization in a video streaming simulation using different types of videos. The experiments and comparison with traditional monitoring techniques demonstrate the feasibility of our proposal maintaining similar values decreasing the number of queries to the switches.

A proposal of optimal sampling design using a modularity strategy

NASA Astrophysics Data System (ADS)

Simone, A.; Giustolisi, O.; Laucelli, D. B.

2016-08-01

In real water distribution networks (WDNs) are present thousands nodes and optimal placement of pressure and flow observations is a relevant issue for different management tasks. The planning of pressure observations in terms of spatial distribution and number is named sampling design and it was faced considering model calibration. Nowadays, the design of system monitoring is a relevant issue for water utilities e.g., in order to manage background leakages, to detect anomalies and bursts, to guarantee service quality, etc. In recent years, the optimal location of flow observations related to design of optimal district metering areas (DMAs) and leakage management purposes has been faced considering optimal network segmentation and the modularity index using a multiobjective strategy. Optimal network segmentation is the basis to identify network modules by means of optimal conceptual cuts, which are the candidate locations of closed gates or flow meters creating the DMAs. Starting from the WDN-oriented modularity index, as a metric for WDN segmentation, this paper proposes a new way to perform the sampling design, i.e., the optimal location of pressure meters, using newly developed sampling-oriented modularity index. The strategy optimizes the pressure monitoring system mainly based on network topology and weights assigned to pipes according to the specific technical tasks. A multiobjective optimization minimizes the cost of pressure meters while maximizing the sampling-oriented modularity index. The methodology is presented and discussed using the Apulian and Exnet networks.

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...

Roles of Course Facilitators, Learners, and Technology in the Flow of Information of a cMOOC

ERIC Educational Resources Information Center

Skrypnyk, Oleksandra; Joksimovic, Srec´ko; Kovanovic, Vitomir; Gas?evic, Dragan; Dawson, Shane

2015-01-01

Distributed Massive Open Online Courses (MOOCs) are based on the premise that online learning occurs through a network of interconnected learners. The teachers' role in distributed courses extends to forming such a network by facilitating communication that connects learners and their separate personal learning environments scattered around the…

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…

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

Real-time hydraulic interval state estimation for water transport networks: a case study

NASA Astrophysics Data System (ADS)

Vrachimis, Stelios G.; Eliades, Demetrios G.; Polycarpou, Marios M.

2018-03-01

Hydraulic state estimation in water distribution networks is the task of estimating water flows and pressures in the pipes and nodes of the network based on some sensor measurements. This requires a model of the network as well as knowledge of demand outflow and tank water levels. Due to modeling and measurement uncertainty, standard state estimation may result in inaccurate hydraulic estimates without any measure of the estimation error. This paper describes a methodology for generating hydraulic state bounding estimates based on interval bounds on the parametric and measurement uncertainties. The estimation error bounds provided by this method can be applied to determine the existence of unaccounted-for water in water distribution networks. As a case study, the method is applied to a modified transport network in Cyprus, using actual data in real time.

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

Network analysis reveals multiscale controls on streamwater chemistry

USGS Publications Warehouse

McGuire, Kevin J.; Torgersen, Christian E.; Likens, Gene E.; Buso, Donald C.; Lowe, Winsor H.; Bailey, Scott W.

2014-01-01

By coupling synoptic data from a basin-wide assessment of streamwater chemistry with network-based geostatistical analysis, we show that spatial processes differentially affect biogeochemical condition and pattern across a headwater stream network. We analyzed a high-resolution dataset consisting of 664 water samples collected every 100 m throughout 32 tributaries in an entire fifth-order stream network. These samples were analyzed for an exhaustive suite of chemical constituents. The fine grain and broad extent of this study design allowed us to quantify spatial patterns over a range of scales by using empirical semivariograms that explicitly incorporated network topology. Here, we show that spatial structure, as determined by the characteristic shape of the semivariograms, differed both among chemical constituents and by spatial relationship (flow-connected, flow-unconnected, or Euclidean). Spatial structure was apparent at either a single scale or at multiple nested scales, suggesting separate processes operating simultaneously within the stream network and surrounding terrestrial landscape. Expected patterns of spatial dependence for flow-connected relationships (e.g., increasing homogeneity with downstream distance) occurred for some chemical constituents (e.g., dissolved organic carbon, sulfate, and aluminum) but not for others (e.g., nitrate, sodium). By comparing semivariograms for the different chemical constituents and spatial relationships, we were able to separate effects on streamwater chemistry of (i) fine-scale versus broad-scale processes and (ii) in-stream processes versus landscape controls. These findings provide insight on the hierarchical scaling of local, longitudinal, and landscape processes that drive biogeochemical patterns in stream networks.

Network analysis reveals multiscale controls on streamwater chemistry

PubMed Central

McGuire, Kevin J.; Torgersen, Christian E.; Likens, Gene E.; Buso, Donald C.; Lowe, Winsor H.; Bailey, Scott W.

2014-01-01

By coupling synoptic data from a basin-wide assessment of streamwater chemistry with network-based geostatistical analysis, we show that spatial processes differentially affect biogeochemical condition and pattern across a headwater stream network. We analyzed a high-resolution dataset consisting of 664 water samples collected every 100 m throughout 32 tributaries in an entire fifth-order stream network. These samples were analyzed for an exhaustive suite of chemical constituents. The fine grain and broad extent of this study design allowed us to quantify spatial patterns over a range of scales by using empirical semivariograms that explicitly incorporated network topology. Here, we show that spatial structure, as determined by the characteristic shape of the semivariograms, differed both among chemical constituents and by spatial relationship (flow-connected, flow-unconnected, or Euclidean). Spatial structure was apparent at either a single scale or at multiple nested scales, suggesting separate processes operating simultaneously within the stream network and surrounding terrestrial landscape. Expected patterns of spatial dependence for flow-connected relationships (e.g., increasing homogeneity with downstream distance) occurred for some chemical constituents (e.g., dissolved organic carbon, sulfate, and aluminum) but not for others (e.g., nitrate, sodium). By comparing semivariograms for the different chemical constituents and spatial relationships, we were able to separate effects on streamwater chemistry of (i) fine-scale versus broad-scale processes and (ii) in-stream processes versus landscape controls. These findings provide insight on the hierarchical scaling of local, longitudinal, and landscape processes that drive biogeochemical patterns in stream networks. PMID:24753575

Network analysis reveals multiscale controls on streamwater chemistry.

PubMed

McGuire, Kevin J; Torgersen, Christian E; Likens, Gene E; Buso, Donald C; Lowe, Winsor H; Bailey, Scott W

2014-05-13

By coupling synoptic data from a basin-wide assessment of streamwater chemistry with network-based geostatistical analysis, we show that spatial processes differentially affect biogeochemical condition and pattern across a headwater stream network. We analyzed a high-resolution dataset consisting of 664 water samples collected every 100 m throughout 32 tributaries in an entire fifth-order stream network. These samples were analyzed for an exhaustive suite of chemical constituents. The fine grain and broad extent of this study design allowed us to quantify spatial patterns over a range of scales by using empirical semivariograms that explicitly incorporated network topology. Here, we show that spatial structure, as determined by the characteristic shape of the semivariograms, differed both among chemical constituents and by spatial relationship (flow-connected, flow-unconnected, or Euclidean). Spatial structure was apparent at either a single scale or at multiple nested scales, suggesting separate processes operating simultaneously within the stream network and surrounding terrestrial landscape. Expected patterns of spatial dependence for flow-connected relationships (e.g., increasing homogeneity with downstream distance) occurred for some chemical constituents (e.g., dissolved organic carbon, sulfate, and aluminum) but not for others (e.g., nitrate, sodium). By comparing semivariograms for the different chemical constituents and spatial relationships, we were able to separate effects on streamwater chemistry of (i) fine-scale versus broad-scale processes and (ii) in-stream processes versus landscape controls. These findings provide insight on the hierarchical scaling of local, longitudinal, and landscape processes that drive biogeochemical patterns in stream networks.

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.

Report on Technology Horizons: A Vision for Air Force Science and Technology During 2010-2030. Volume 1

DTIC Science & Technology

2010-05-15

flow and decision processes across the air and space domains. It thus comprises traditional wired and fiber-optic computer networks based on...dual flow path design allow high volumetric efficiency, and high cruise speed provides significantly increased survivability. Vertical takeoff...emerging “third-stream engine architectures” can enable for constant mass flow engines that can provide further reductions in fuel consumption. A wide

Hybrid services efficient provisioning over the network coding-enabled elastic optical networks

NASA Astrophysics Data System (ADS)

Wang, Xin; Gu, Rentao; Ji, Yuefeng; Kavehrad, Mohsen

2017-03-01

As a variety of services have emerged, hybrid services have become more common in real optical networks. Although the elastic spectrum resource optimizations over the elastic optical networks (EONs) have been widely investigated, little research has been carried out on the hybrid services of the routing and spectrum allocation (RSA), especially over the network coding-enabled EON. We investigated the RSA for the unicast service and network coding-based multicast service over the network coding-enabled EON with the constraints of time delay and transmission distance. To address this issue, a mathematical model was built to minimize the total spectrum consumption for the hybrid services over the network coding-enabled EON under the constraints of time delay and transmission distance. The model guarantees different routing constraints for different types of services. The immediate nodes over the network coding-enabled EON are assumed to be capable of encoding the flows for different kinds of information. We proposed an efficient heuristic algorithm of the network coding-based adaptive routing and layered graph-based spectrum allocation algorithm (NCAR-LGSA). From the simulation results, NCAR-LGSA shows highly efficient performances in terms of the spectrum resources utilization under different network scenarios compared with the benchmark algorithms.

Maximum flow-based resilience analysis: From component to system

PubMed Central

Jin, Chong; Li, Ruiying; Kang, Rui

2017-01-01

Resilience, the ability to withstand disruptions and recover quickly, must be considered during system design because any disruption of the system may cause considerable loss, including economic and societal. This work develops analytic maximum flow-based resilience models for series and parallel systems using Zobel’s resilience measure. The two analytic models can be used to evaluate quantitatively and compare the resilience of the systems with the corresponding performance structures. For systems with identical components, the resilience of the parallel system increases with increasing number of components, while the resilience remains constant in the series system. A Monte Carlo-based simulation method is also provided to verify the correctness of our analytic resilience models and to analyze the resilience of networked systems based on that of components. A road network example is used to illustrate the analysis process, and the resilience comparison among networks with different topologies but the same components indicates that a system with redundant performance is usually more resilient than one without redundant performance. However, not all redundant capacities of components can improve the system resilience, the effectiveness of the capacity redundancy depends on where the redundant capacity is located. PMID:28545135

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

NASA Astrophysics Data System (ADS)

Hyman, J.; Hagberg, A.; Srinivasan, G.; Mohd-Yusof, J.; Viswanathan, H. S.

2017-12-01

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

NASA Astrophysics Data System (ADS)

Hyman, Jeffrey D.; Hagberg, Aric; Srinivasan, Gowri; Mohd-Yusof, Jamaludin; Viswanathan, Hari

2017-07-01

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.

BGen: A UML Behavior Network Generator Tool

NASA Technical Reports Server (NTRS)

Huntsberger, Terry; Reder, Leonard J.; Balian, Harry

2010-01-01

BGen software was designed for autogeneration of code based on a graphical representation of a behavior network used for controlling automatic vehicles. A common format used for describing a behavior network, such as that used in the JPL-developed behavior-based control system, CARACaS ["Control Architecture for Robotic Agent Command and Sensing" (NPO-43635), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 40] includes a graph with sensory inputs flowing through the behaviors in order to generate the signals for the actuators that drive and steer the vehicle. A computer program to translate Unified Modeling Language (UML) Freeform Implementation Diagrams into a legacy C implementation of Behavior Network has been developed in order to simplify the development of C-code for behavior-based control systems. UML is a popular standard developed by the Object Management Group (OMG) to model software architectures graphically. The C implementation of a Behavior Network is functioning as a decision tree.

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

Smart social adaptation prevents catastrophic ecological regime shifts in networks of myopic harvesters

NASA Astrophysics Data System (ADS)

Donges, Jonathan; Lucht, Wolfgang; Wiedermann, Marc; Heitzig, Jobst; Kurths, Jürgen

2015-04-01

In the anthropocene, the rise of global social and economic networks with ever increasing connectivity and speed of interactions, e.g., the internet or global financial markets, is a key challenge for sustainable development. The spread of opinions, values or technologies on these networks, in conjunction with the coevolution of the network structures themselves, underlies nexuses of current concern such as anthropogenic climate change, biodiversity loss or global land use change. To isolate and quantitatively study the effects and implications of network dynamics for sustainable development, we propose an agent-based model of information flow on adaptive networks between myopic harvesters that exploit private renewable resources. In this conceptual model of a network of socio-ecological systems, information on management practices flows between agents via boundedly rational imitation depending on the state of the resource stocks involved in an interaction. Agents can also adapt the structure of their social network locally by preferentially connecting to culturally similar agents with identical management practices and, at the same time, disconnecting from culturally dissimilar agents. Investigating in detail the statistical mechanics of this model, we find that an increasing rate of information flow through faster imitation dynamics or growing density of network connectivity leads to a marked increase in the likelihood of environmental resource collapse. However, we show that an optimal rate of social network adaptation can mitigate this negative effect without loss of social cohesion through network fragmentation. Our results highlight that seemingly immaterial network dynamics of spreading opinions or values can be of large relevance for the sustainable management of socio-ecological systems and suggest smartly conservative network adaptation as a strategy for mitigating environmental collapse. Hence, facing the great acceleration, these network dynamics should be more routinely incorporated in standard models of economic development or integrated assessment models used for evaluating anthropogenic climate change.

3D Groundwater flow model at the Upper Rhine Graben scale to delineate preferential target areas for geothermal projects

NASA Astrophysics Data System (ADS)

Armandine Les Landes, Antoine; Guillon, Théophile; Peter-Borie, Mariane; Rachez, Xavier

2017-04-01

Any deep unconventional geothermal project remains risky because of the uncertainty regarding the presence of the geothermal resource at depth and the drilling costs increasing accordingly. That's why this resource must be located as precisely as possible to increase the chances of successful projects and their economic viability. To minimize the risk, as much information as possible should be gathered prior to any drilling. Usually, the position of the exploration wells of geothermal energy systems is chosen based on structural geology observations, geophysics measurements and geochemical analyses. Confronting these observations to results from additional disciplines should bring more objectivity in locating the region to explore and where to implant the geothermal system. The Upper Rhine Graben (URG) is a tectonically active rift system that corresponds to one branch of the European Cenozoic Rift System where the basin hosts a significant potential for geothermal energy. The large fault network inherited from a complex tectonic history and settled under the sedimentary deposits hosts fluid circulation patterns. Geothermal anomalies are strongly influenced by fluid circulations within permeable structures such as fault zones. In order to better predict the location of the geothermal resource, it is necessary to understand how it is influenced by heat transport mechanisms such as groundwater flow. The understanding of fluid circulation in hot fractured media at large scale can help in the identification of preferential zones at a finer scale where additional exploration can be carried out. Numerical simulations is a useful tool to deal with the issue of fluid circulations through large fault networks that enable the uplift of deep and hot fluids. Therefore, we build a numerical model to study groundwater flow at the URG scale (150 x 130km), which aims to delineate preferential zones. The numerical model is based on a hybrid method using a Discrete Fracture Network (DFN) and 3D elements to simulate groundwater flow in the 3D regional fault network and in sedimentary deposits, respectively. Firstly, the geometry of the 3D fracture network and its hydraulic connections with 3D elements (sedimentary cover) is built in accordance with the tectonic history and based on geological and geophysical evidences. Secondly, data from previous studies and site-specific geological knowledge provide information on the fault zones family sets and on respective hydraulic properties. Then, from the simulated 3D groundwater flow model and based on a particle tracking methodology, groundwater flow paths are constructed. The regional groundwater flow paths results are extracted and analysed to delineate preferential zones to explore at finer scale and so to define the potential positions of the exploration wells. This work is conducted in the framework of the IMAGE project (Integrated Methods for Advanced Geothermal Exploration, grant agreement No. 608553), which aims to develop new methods for better siting of exploitation wells.

Steerable sound transport in a 3D acoustic network

NASA Astrophysics Data System (ADS)

Xia, Bai-Zhan; Jiao, Jun-Rui; Dai, Hong-Qing; Yin, Sheng-Wen; Zheng, Sheng-Jie; Liu, Ting-Ting; Chen, Ning; Yu, De-Jie

2017-10-01

Quasi-lossless and asymmetric sound transports, which are exceedingly desirable in various modern physical systems, are almost always based on nonlinear or angular momentum biasing effects with extremely high power levels and complex modulation schemes. A practical route for the steerable sound transport along any arbitrary acoustic pathway, especially in a three-dimensional (3D) acoustic network, can revolutionize the sound power propagation and the sound communication. Here, we design an acoustic device containing a regular-tetrahedral cavity with four cylindrical waveguides. A smaller regular-tetrahedral solid in this cavity is eccentrically emplaced to break spatial symmetry of the acoustic device. The numerical and experimental results show that the sound power flow can unimpededly transport between two waveguides away from the eccentric solid within a wide frequency range. Based on the quasi-lossless and asymmetric transport characteristic of the single acoustic device, we construct a 3D acoustic network, in which the sound power flow can flexibly propagate along arbitrary sound pathways defined by our acoustic devices with eccentrically emplaced regular-tetrahedral solids.

Traffic protection in MPLS networks using an off-line flow optimization model

NASA Astrophysics Data System (ADS)

Krzesinski, Anthony E.; Muller, Karen E.

2002-07-01

MPLS-based recovery is intended to effect rapid and complete restoration of traffic affected by a fault in an MPLS network. Two MPLS-based recovery models have been proposed: IP re-routing which establishes recovery paths on demand, and protection switching which works with pre-established recovery paths. IP re-routing is robust and frugal since no resources are pre-committed but is inherently slower than protection switching which is intended to offer high reliability to premium services where fault recovery takes place at the 100 ms time scale. We present a model of protection switching in MPLS networks. A variant of the flow deviation method is used to find and capacitate a set of optimal label switched paths. The traffic is routed over a set of working LSPs. Global repair is implemented by reserving a set of pre-established recovery LSPs. An analytic model is used to evaluate the MPLS-based recovery mechanisms in response to bi-directional link failures. A simulation model is used to evaluate the MPLS recovery cycle in terms of the time needed to restore the traffic after a uni-directional link failure. The models are applied to evaluate the effectiveness of protection switching in networks consisting of between 20 and 100 nodes.

Regression equations for estimating flood flows for the 2-, 10-, 25-, 50-, 100-, and 500-Year recurrence intervals in Connecticut

USGS Publications Warehouse

Ahearn, Elizabeth A.

2004-01-01

Multiple linear-regression equations were developed to estimate the magnitudes of floods in Connecticut for recurrence intervals ranging from 2 to 500 years. The equations can be used for nonurban, unregulated stream sites in Connecticut with drainage areas ranging from about 2 to 715 square miles. Flood-frequency data and hydrologic characteristics from 70 streamflow-gaging stations and the upstream drainage basins were used to develop the equations. The hydrologic characteristics?drainage area, mean basin elevation, and 24-hour rainfall?are used in the equations to estimate the magnitude of floods. Average standard errors of prediction for the equations are 31.8, 32.7, 34.4, 35.9, 37.6 and 45.0 percent for the 2-, 10-, 25-, 50-, 100-, and 500-year recurrence intervals, respectively. Simplified equations using only one hydrologic characteristic?drainage area?also were developed. The regression analysis is based on generalized least-squares regression techniques. Observed flows (log-Pearson Type III analysis of the annual maximum flows) from five streamflow-gaging stations in urban basins in Connecticut were compared to flows estimated from national three-parameter and seven-parameter urban regression equations. The comparison shows that the three- and seven- parameter equations used in conjunction with the new statewide equations generally provide reasonable estimates of flood flows for urban sites in Connecticut, although a national urban flood-frequency study indicated that the three-parameter equations significantly underestimated flood flows in many regions of the country. Verification of the accuracy of the three-parameter or seven-parameter national regression equations using new data from Connecticut stations was beyond the scope of this study. A technique for calculating flood flows at streamflow-gaging stations using a weighted average also is described. Two estimates of flood flows?one estimate based on the log-Pearson Type III analyses of the annual maximum flows at the gaging station, and the other estimate from the regression equation?are weighted together based on the years of record at the gaging station and the equivalent years of record value determined from the regression. Weighted averages of flood flows for the 2-, 10-, 25-, 50-, 100-, and 500-year recurrence intervals are tabulated for the 70 streamflow-gaging stations used in the regression analysis. Generally, weighted averages give the most accurate estimate of flood flows at gaging stations. An evaluation of the Connecticut's streamflow-gaging network was performed to determine whether the spatial coverage and range of geographic and hydrologic conditions are adequately represented for transferring flood characteristics from gaged to ungaged sites. Fifty-one of 54 stations in the current (2004) network support one or more flood needs of federal, state, and local agencies. Twenty-five of 54 stations in the current network are considered high-priority stations by the U.S. Geological Survey because of their contribution to the longterm understanding of floods, and their application for regionalflood analysis. Enhancements to the network to improve overall effectiveness for regionalization can be made by increasing the spatial coverage of gaging stations, establishing stations in regions of the state that are not well-represented, and adding stations in basins with drainage area sizes not represented. Additionally, the usefulness of the network for characterizing floods can be maintained and improved by continuing operation at the current stations because flood flows can be more accurately estimated at stations with continuous, long-term record.

The application of neural network PID controller to control the light gasoline etherification

NASA Astrophysics Data System (ADS)

Cheng, Huanxin; Zhang, Yimin; Kong, Lingling; Meng, Xiangyong

2017-06-01

Light gasoline etherification technology can effectively improve the quality of gasoline, which is environmental- friendly and economical. By combining BP neural network and PID control and using BP neural network self-learning ability for online parameter tuning, this method optimizes the parameters of PID controller and applies this to the Fcc gas flow control to achieve the control of the final product- heavy oil concentration. Finally, through MATLAB simulation, it is found that the PID control based on BP neural network has better controlling effect than traditional PID control.

Dynamic baseline detection method for power data network service

NASA Astrophysics Data System (ADS)

Chen, Wei

2017-08-01

This paper proposes a dynamic baseline Traffic detection Method which is based on the historical traffic data for the Power data network. The method uses Cisco's NetFlow acquisition tool to collect the original historical traffic data from network element at fixed intervals. This method uses three dimensions information including the communication port, time, traffic (number of bytes or number of packets) t. By filtering, removing the deviation value, calculating the dynamic baseline value, comparing the actual value with the baseline value, the method can detect whether the current network traffic is abnormal.

Machine Learning and Deep Learning Models to Predict Runoff Water Quantity and Quality

NASA Astrophysics Data System (ADS)

Bradford, S. A.; Liang, J.; Li, W.; Murata, T.; Simunek, J.

2017-12-01

Contaminants can be rapidly transported at the soil surface by runoff to surface water bodies. Physically-based models, which are based on the mathematical description of main hydrological processes, are key tools for predicting surface water impairment. Along with physically-based models, data-driven models are becoming increasingly popular for describing the behavior of hydrological and water resources systems since these models can be used to complement or even replace physically based-models. In this presentation we propose a new data-driven model as an alternative to a physically-based overland flow and transport model. First, we have developed a physically-based numerical model to simulate overland flow and contaminant transport (the HYDRUS-1D overland flow module). A large number of numerical simulations were carried out to develop a database containing information about the impact of various input parameters (weather patterns, surface topography, vegetation, soil conditions, contaminants, and best management practices) on runoff water quantity and quality outputs. This database was used to train data-driven models. Three different methods (Neural Networks, Support Vector Machines, and Recurrence Neural Networks) were explored to prepare input- output functional relations. Results demonstrate the ability and limitations of machine learning and deep learning models to predict runoff water quantity and quality.

1987 Robert E. Horton Award to Thomas Dunne

NASA Astrophysics Data System (ADS)

Dunne, Thomas

Robert Horton demonstrated in his seminal 1945 paper that physically based quantitative models for landscape evolution can be constructed by using predicted overland flow in a sediment transport equation for sheetwash. He envisioned drainage network evolution by infiltration-limited overland flow as a process of channel incision, network growth, and then abstraction to a stable channel network fed by hillslopes too short for channel initiation. Not until the work of Tom Dunne in the late 1960s in the Sleepers River watershed, Vermont, was it realized that overland flow, and consequently hillslope evolution, could occur by an entirely different mechanism than that proposed by Horton. Dunne showed that in certain predictable zones of the landscape, exfiltration from saturated grounds adds to precipitation on the soil surface to form what he later called saturation overland flow. Many researchers have since found that this form of overland flow occurs in humid and semiarid landscapes throughout the world. So clear is Dunne's contribution to defining this process that some refer to it as the “Dunne mechanism” to distinguish it from “Horton overland flow.” His work also documented unquestionably the applicability of the partial area concept in explaining runoff generation. Because of this work, his research in snowmelt runoff, and his subsequent authorship with Luna Leopold of the widely used book entitled Water in Environmental Planning, Dunne has established himself as a leader of process hydrology.

A physically-based Distributed Hydrologic Model for Tropical Catchments

NASA Astrophysics Data System (ADS)

Abebe, N. A.; Ogden, F. L.

2010-12-01

Hydrological models are mathematical formulations intended to represent observed hydrological processes in a watershed. Simulated watersheds in turn vary in their nature based on their geographic location, altitude, climatic variables and geology and soil formation. Due to these variations, available hydrologic models vary in process formulation, spatial and temporal resolution and data demand. Many tropical watersheds are characterized by extensive and persistent biological activity and a large amount of rain. The Agua Salud catchments located within the Panama Canal Watershed, Panama, are such catchments identified by steep rolling topography, deep soils derived from weathered bedrock, and limited exposed bedrock. Tropical soils are highly affected by soil cracks, decayed tree roots and earthworm burrows forming a network of preferential flow paths that drain to a perched water table, which forms at a depth where the vertical hydraulic conductivity is significantly reduced near the bottom of the bioturbation layer. We have developed a physics-based, spatially distributed, multi-layered hydrologic model to simulate the dominant processes in these tropical watersheds. The model incorporates the major flow processes including overland flow, channel flow, matrix and non-Richards film flow infiltration, lateral downslope saturated matrix and non-Darcian pipe flow in the bioturbation layer, and deep saturated groundwater flow. Emphasis is given to the modeling of subsurface unsaturated zone soil moisture dynamics and the saturated preferential lateral flow from the network of macrospores. Preliminary results indicate that the model has the capability to simulate the complex hydrological processes in the catchment and will be a useful tool in the ongoing comprehensive ecohydrological studies in tropical catchments, and help improve our understanding of the hydrological effects of deforestation and aforestation.

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.

Thermal Drawdown-Induced Flow Channeling in Fractured Geothermal Reservoirs

DOE PAGES

Fu, Pengcheng; Hao, Yue; Walsh, Stuart D. C.; ...

2015-06-30

In this paper, we investigate the flow-channeling phenomenon caused by thermal drawdown in fractured geothermal reservoirs. A discrete fracture network-based, fully coupled thermal–hydrological–mechanical simulator is used to study the interactions between fluid flow, temperature change, and the associated rock deformation. The responses of a number of randomly generated 2D fracture networks that represent a variety of reservoir characteristics are simulated with various injection-production well distances. We find that flow channeling, namely flow concentration in cooled zones, is the inevitable fate of all the scenarios evaluated. We also identify a secondary geomechanical mechanism caused by the anisotropy in thermal stress thatmore » counteracts the primary mechanism of flow channeling. This new mechanism tends, to some extent, to result in a more diffuse flow distribution, although it is generally not strong enough to completely reverse flow channeling. We find that fracture intensity substantially affects the overall hydraulic impedance of the reservoir but increasing fracture intensity generally does not improve heat production performance. Finally, increasing the injection-production well separation appears to be an effective means to prolong the production life of a reservoir.« less

Design trade-offs among shunt current, pumping loss and compactness in the piping system of a multi-stack vanadium flow battery

NASA Astrophysics Data System (ADS)

Ye, Qiang; Hu, Jing; Cheng, Ping; Ma, Zhiqi

2015-11-01

Trade-off between shunt current loss and pumping loss is a major challenge in the design of the electrolyte piping network in a flow battery system. It is generally recognized that longer and thinner ducts are beneficial to reduce shunt current but detrimental to minimize pumping power. Base on the developed analog circuit model and the flow network model, we make case studies of multi-stack vanadium flow battery piping systems and demonstrate that both shunt current and electrolyte flow resistance can be simultaneously minimized by using longer and thicker ducts in the piping network. However, extremely long and/or thick ducts lead to a bulky system and may be prohibited by the stack structure. Accordingly, the intrinsic design trade-off is between system efficiency and compactness. Since multi-stack configurations bring both flexibility and complexity to the design process, we perform systematic comparisons among representative piping system designs to illustrate the complicated trade-offs among numerous parameters including stack number, intra-stack channel resistance and inter-stack pipe resistance. As the final design depends on various technical and economical requirements, this paper aims to provide guidelines rather than solutions for designers to locate the optimal trade-off points according to their specific cases.

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

A neural network-based estimator for the mixture ratio of the Space Shuttle Main Engine

NASA Astrophysics Data System (ADS)

Guo, T. H.; Musgrave, J.

1992-11-01

In order to properly utilize the available fuel and oxidizer of a liquid propellant rocket engine, the mixture ratio is closed loop controlled during main stage (65 percent - 109 percent power) operation. However, because of the lack of flight-capable instrumentation for measuring mixture ratio, the value of mixture ratio in the control loop is estimated using available sensor measurements such as the combustion chamber pressure and the volumetric flow, and the temperature and pressure at the exit duct on the low pressure fuel pump. This estimation scheme has two limitations. First, the estimation formula is based on an empirical curve fitting which is accurate only within a narrow operating range. Second, the mixture ratio estimate relies on a few sensor measurements and loss of any of these measurements will make the estimate invalid. In this paper, we propose a neural network-based estimator for the mixture ratio of the Space Shuttle Main Engine. The estimator is an extension of a previously developed neural network based sensor failure detection and recovery algorithm (sensor validation). This neural network uses an auto associative structure which utilizes the redundant information of dissimilar sensors to detect inconsistent measurements. Two approaches have been identified for synthesizing mixture ratio from measurement data using a neural network. The first approach uses an auto associative neural network for sensor validation which is modified to include the mixture ratio as an additional output. The second uses a new network for the mixture ratio estimation in addition to the sensor validation network. Although mixture ratio is not directly measured in flight, it is generally available in simulation and in test bed firing data from facility measurements of fuel and oxidizer volumetric flows. The pros and cons of these two approaches will be discussed in terms of robustness to sensor failures and accuracy of the estimate during typical transients using simulation data.

A neural network-based estimator for the mixture ratio of the Space Shuttle Main Engine

NASA Technical Reports Server (NTRS)

Guo, T. H.; Musgrave, J.

1992-01-01

In order to properly utilize the available fuel and oxidizer of a liquid propellant rocket engine, the mixture ratio is closed loop controlled during main stage (65 percent - 109 percent power) operation. However, because of the lack of flight-capable instrumentation for measuring mixture ratio, the value of mixture ratio in the control loop is estimated using available sensor measurements such as the combustion chamber pressure and the volumetric flow, and the temperature and pressure at the exit duct on the low pressure fuel pump. This estimation scheme has two limitations. First, the estimation formula is based on an empirical curve fitting which is accurate only within a narrow operating range. Second, the mixture ratio estimate relies on a few sensor measurements and loss of any of these measurements will make the estimate invalid. In this paper, we propose a neural network-based estimator for the mixture ratio of the Space Shuttle Main Engine. The estimator is an extension of a previously developed neural network based sensor failure detection and recovery algorithm (sensor validation). This neural network uses an auto associative structure which utilizes the redundant information of dissimilar sensors to detect inconsistent measurements. Two approaches have been identified for synthesizing mixture ratio from measurement data using a neural network. The first approach uses an auto associative neural network for sensor validation which is modified to include the mixture ratio as an additional output. The second uses a new network for the mixture ratio estimation in addition to the sensor validation network. Although mixture ratio is not directly measured in flight, it is generally available in simulation and in test bed firing data from facility measurements of fuel and oxidizer volumetric flows. The pros and cons of these two approaches will be discussed in terms of robustness to sensor failures and accuracy of the estimate during typical transients using simulation data.

Modelling rapid subsurface flow at the hillslope scale with explicit representation of preferential flow paths

NASA Astrophysics Data System (ADS)

Wienhöfer, J.; Zehe, E.

2012-04-01

Rapid lateral flow processes via preferential flow paths are widely accepted to play a key role for rainfall-runoff response in temperate humid headwater catchments. A quantitative description of these processes, however, is still a major challenge in hydrological research, not least because detailed information about the architecture of subsurface flow paths are often impossible to obtain at a natural site without disturbing the system. Our study combines physically based modelling and field observations with the objective to better understand how flow network configurations influence the hydrological response of hillslopes. The system under investigation is a forested hillslope with a small perennial spring at the study area Heumöser, a headwater catchment of the Dornbirnerach in Vorarlberg, Austria. In-situ points measurements of field-saturated hydraulic conductivity and dye staining experiments at the plot scale revealed that shrinkage cracks and biogenic macropores function as preferential flow paths in the fine-textured soils of the study area, and these preferential flow structures were active in fast subsurface transport of artificial tracers at the hillslope scale. For modelling of water and solute transport, we followed the approach of implementing preferential flow paths as spatially explicit structures of high hydraulic conductivity and low retention within the 2D process-based model CATFLOW. Many potential configurations of the flow path network were generated as realisations of a stochastic process informed by macropore characteristics derived from the plot scale observations. Together with different realisations of soil hydraulic parameters, this approach results in a Monte Carlo study. The model setups were used for short-term simulation of a sprinkling and tracer experiment, and the results were evaluated against measured discharges and tracer breakthrough curves. Although both criteria were taken for model evaluation, still several model setups produced acceptable matches to the observed behaviour. These setups were selected for long-term simulation, the results of which were compared against water level measurements at two piezometers along the hillslope and the integral discharge response of the spring to reject some non-behavioural model setups and further reduce equifinality. The results of this study indicate that process-based modelling can provide a means to distinguish preferential flow networks on the hillslope scale when complementary measurements to constrain the range of behavioural model setups are available. These models can further be employed as a virtual reality to investigate the characteristics of flow path architectures and explore effective parameterisations for larger scale applications.

Two modelling approaches to water-quality simulation in a flooded iron-ore mine (Saizerais, Lorraine, France): a semi-distributed chemical reactor model and a physically based distributed reactive transport pipe network model.

PubMed

Hamm, V; Collon-Drouaillet, P; Fabriol, R

2008-02-19

The flooding of abandoned mines in the Lorraine Iron Basin (LIB) over the past 25 years has degraded the quality of the groundwater tapped for drinking water. High concentrations of dissolved sulphate have made the water unsuitable for human consumption. This problematic issue has led to the development of numerical tools to support water-resource management in mining contexts. Here we examine two modelling approaches using different numerical tools that we tested on the Saizerais flooded iron-ore mine (Lorraine, France). A first approach considers the Saizerais Mine as a network of two chemical reactors (NCR). The second approach is based on a physically distributed pipe network model (PNM) built with EPANET 2 software. This approach considers the mine as a network of pipes defined by their geometric and chemical parameters. Each reactor in the NCR model includes a detailed chemical model built to simulate quality evolution in the flooded mine water. However, in order to obtain a robust PNM, we simplified the detailed chemical model into a specific sulphate dissolution-precipitation model that is included as sulphate source/sink in both a NCR model and a pipe network model. Both the NCR model and the PNM, based on different numerical techniques, give good post-calibration agreement between the simulated and measured sulphate concentrations in the drinking-water well and overflow drift. The NCR model incorporating the detailed chemical model is useful when a detailed chemical behaviour at the overflow is needed. The PNM incorporating the simplified sulphate dissolution-precipitation model provides better information of the physics controlling the effect of flow and low flow zones, and the time of solid sulphate removal whereas the NCR model will underestimate clean-up time due to the complete mixing assumption. In conclusion, the detailed NCR model will give a first assessment of chemical processes at overflow, and in a second time, the PNM model will provide more detailed information on flow and chemical behaviour (dissolved sulphate concentrations, remaining mass of solid sulphate) in the network. Nevertheless, both modelling methods require hydrological and chemical parameters (recharge flow rate, outflows, volume of mine voids, mass of solids, kinetic constants of the dissolution-precipitation reactions), which are commonly not available for a mine and therefore call for calibration data.

River network bedload model: a tool to investigate the impact of flow regulation on grain size distribution in a large Alpine catchment

NASA Astrophysics Data System (ADS)

Costa, Anna; Molnar, Peter

2017-04-01

Sediment transport rates along rivers and the grain size distribution (GSD) of coarse channel bed sediment are the result of the long term balance between transport capacity and sediment supply. Transport capacity, mainly a function of channel geometry and flow competence, can be altered by changes in climatic forcing as well as by human activities. In Alpine rivers it is hydropower production systems that are the main causes of modification to the transport capacity of water courses through flow regulation, leading over longer time scales to the adjustment of river bed GSDs. We developed a river network bedload transport model to evaluate the impacts of hydropower on the transfer of sediments and the GSDs of the Upper Rhône basin, a 5,200 km2 catchment located in the Swiss Alps. Many large reservoirs for hydropower production have been built along the main tributaries of the Rhône River since the 1960s, resulting in a complex system of intakes, tunnels, and pumping stations. Sediment storage behind dams and intakes, is accompanied by altered discharge due to hydropower operations, mainly higher flow in winter and lower in summer. It is expected that this change in flow regime may have resulted in different bedload transport. However, due the non-linear, threshold-based nature of the relation between discharge and sediment mobilization, the effects of changed hydraulic conditions are not easily deducible, and because observations of bedload in pre- and post-dam conditions are usually not available, a modelling approach is often necessary. In our modelling approach, the river network is conceptualized as a series of connected links (river reaches). Average geometric characteristics of each link (width, length, and slope of cross section) are extracted from digital elevation data, while surface roughness coefficients are assigned based on the GSD. Under the assumptions of rectangular prismatic cross sections and normal flow conditions, bed shear stress is estimated from available time series of daily discharge distributed along the river network. Potential bedload transport is estimated by the Wilcock and Crowe surface-based model for the entire GSD. Mass balance between transport capacity and sediment supply, applied to each individual grain size, determines the actual transport and the resulting GSD of the channel bed. Channel bed erosion is allowed through a long-term erosion rate. Sediment input from hillslopes is included as lateral sediment flux. Initial and boundary conditions are set based on available data of GSDs, while an approximation of the depth of the mobile bed is selected through sensitivity analysis. With the river network bedload model we aim to estimate the effect of flow regulation, i.e. altered transport capacity, on sediment transport and GSD of the entire Rhône river system. The model can also be applied as a tool to explore possible changes in bedload transport and channel GSDs under different discharge scenarios based, for example, on climate change projections or modified hydropower operation policies.

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

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.

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

A recurrence network approach for the analysis of skin blood flow dynamics in response to loading pressure.

PubMed

Liao, Fuyuan; Jan, Yih-Kuen

2012-06-01

This paper presents a recurrence network approach for the analysis of skin blood flow dynamics in response to loading pressure. Recurrence is a fundamental property of many dynamical systems, which can be explored in phase spaces constructed from observational time series. A visualization tool of recurrence analysis called recurrence plot (RP) has been proved to be highly effective to detect transitions in the dynamics of the system. However, it was found that delay embedding can produce spurious structures in RPs. Network-based concepts have been applied for the analysis of nonlinear time series recently. We demonstrate that time series with different types of dynamics exhibit distinct global clustering coefficients and distributions of local clustering coefficients and that the global clustering coefficient is robust to the embedding parameters. We applied the approach to study skin blood flow oscillations (BFO) response to loading pressure. The results showed that global clustering coefficients of BFO significantly decreased in response to loading pressure (p<0.01). Moreover, surrogate tests indicated that such a decrease was associated with a loss of nonlinearity of BFO. Our results suggest that the recurrence network approach can practically quantify the nonlinear dynamics of BFO.

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.

The Atlas of Chinese World Wide Web Ecosystem Shaped by the Collective Attention Flows

PubMed Central

Lou, Xiaodan; Li, Yong; Gu, Weiwei; Zhang, Jiang

2016-01-01

The web can be regarded as an ecosystem of digital resources connected and shaped by collective successive behaviors of users. Knowing how people allocate limited attention on different resources is of great importance. To answer this, we embed the most popular Chinese web sites into a high dimensional Euclidean space based on the open flow network model of a large number of Chinese users’ collective attention flows, which both considers the connection topology of hyperlinks between the sites and the collective behaviors of the users. With these tools, we rank the web sites and compare their centralities based on flow distances with other metrics. We also study the patterns of attention flow allocation, and find that a large number of web sites concentrate on the central area of the embedding space, and only a small fraction of web sites disperse in the periphery. The entire embedding space can be separated into 3 regions(core, interim, and periphery). The sites in the core (1%) occupy a majority of the attention flows (40%), and the sites (34%) in the interim attract 40%, whereas other sites (65%) only take 20% flows. What’s more, we clustered the web sites into 4 groups according to their positions in the space, and found that similar web sites in contents and topics are grouped together. In short, by incorporating the open flow network model, we can clearly see how collective attention allocates and flows on different web sites, and how web sites connected each other. PMID:27812133

Spread of hospital-acquired infections: A comparison of healthcare networks

PubMed Central

Astagneau, Pascal; Crépey, Pascal

2017-01-01

Hospital-acquired infections (HAIs), including emerging multi-drug resistant organisms, threaten healthcare systems worldwide. Efficient containment measures of HAIs must mobilize the entire healthcare network. Thus, to best understand how to reduce the potential scale of HAI epidemic spread, we explore patient transfer patterns in the French healthcare system. Using an exhaustive database of all hospital discharge summaries in France in 2014, we construct and analyze three patient networks based on the following: transfers of patients with HAI (HAI-specific network); patients with suspected HAI (suspected-HAI network); and all patients (general network). All three networks have heterogeneous patient flow and demonstrate small-world and scale-free characteristics. Patient populations that comprise these networks are also heterogeneous in their movement patterns. Ranking of hospitals by centrality measures and comparing community clustering using community detection algorithms shows that despite the differences in patient population, the HAI-specific and suspected-HAI networks rely on the same underlying structure as that of the general network. As a result, the general network may be more reliable in studying potential spread of HAIs. Finally, we identify transfer patterns at both the French regional and departmental (county) levels that are important in the identification of key hospital centers, patient flow trajectories, and regional clusters that may serve as a basis for novel wide-scale infection control strategies. PMID:28837555

Flow assignment model for quantitative analysis of diverting bulk freight from road to railway

PubMed Central

Liu, Chang; Wang, Jiaxi; Xiao, Jie; Liu, Siqi; Wu, Jianping; Li, Jian

2017-01-01

Since railway transport possesses the advantage of high volume and low carbon emissions, diverting some freight from road to railway will help reduce the negative environmental impacts associated with transport. This paper develops a flow assignment model for quantitative analysis of diverting truck freight to railway. First, a general network which considers road transportation, railway transportation, handling and transferring is established according to all the steps in the whole transportation process. Then general functions which embody the factors which the shippers will pay attention to when choosing mode and path are formulated. The general functions contain the congestion cost on road, the capacity constraints of railways and freight stations. Based on the general network and general cost function, a user equilibrium flow assignment model is developed to simulate the flow distribution on the general network under the condition that all shippers choose transportation mode and path independently. Since the model is nonlinear and challenging, we adopt a method that uses tangent lines to constitute envelope curve to linearize it. Finally, a numerical example is presented to test the model and show the method of making quantitative analysis of bulk freight modal shift between road and railway. PMID:28771536

Computer Simulations of the Tumor Vasculature: Applications to Interstitial Fluid Flow, Drug Delivery, and Oxygen Supply.

PubMed

Welter, Michael; Rieger, Heiko

2016-01-01

Tumor vasculature, the blood vessel network supplying a growing tumor with nutrients such as oxygen or glucose, is in many respects different from the hierarchically organized arterio-venous blood vessel network in normal tissues. Angiogenesis (the formation of new blood vessels), vessel cooption (the integration of existing blood vessels into the tumor vasculature), and vessel regression remodel the healthy vascular network into a tumor-specific vasculature. Integrative models, based on detailed experimental data and physical laws, implement, in silico, the complex interplay of molecular pathways, cell proliferation, migration, and death, tissue microenvironment, mechanical and hydrodynamic forces, and the fine structure of the host tissue vasculature. With the help of computer simulations high-precision information about blood flow patterns, interstitial fluid flow, drug distribution, oxygen and nutrient distribution can be obtained and a plethora of therapeutic protocols can be tested before clinical trials. This chapter provides an overview over the current status of computer simulations of vascular remodeling during tumor growth including interstitial fluid flow, drug delivery, and oxygen supply within the tumor. The model predictions are compared with experimental and clinical data and a number of longstanding physiological paradigms about tumor vasculature and intratumoral solute transport are critically scrutinized.

Intelligent Control via Wireless Sensor Networks for Advanced Coal Combustion Systems

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

Aman Behal; Sunil Kumar; Goodarz Ahmadi

2007-08-05

Numerical Modeling of Solid Gas Flow, System Identification for purposes of modeling and control, and Wireless Sensor and Actor Network design were pursued as part of this project. Time series input-output data was obtained from NETL's Morgantown CFB facility courtesy of Dr. Lawrence Shadle. It was run through a nonlinear kernel estimator and nonparametric models were obtained for the system. Linear and first-order nonlinear kernels were then utilized to obtain a state-space description of the system. Neural networks were trained that performed better at capturing the plant dynamics. It is possible to use these networks to find a plant modelmore » and the inversion of this model can be used to control the system. These models allow one to compare with physics based models whose parameters can then be determined by comparing them against the available data based model. On a parallel track, Dr. Kumar designed an energy-efficient and reliable transport protocol for wireless sensor and actor networks, where the sensors could be different types of wireless sensors used in CFB based coal combustion systems and actors are more powerful wireless nodes to set up a communication network while avoiding the data congestion. Dr. Ahmadi's group studied gas solid flow in a duct. It was seen that particle concentration clearly shows a preferential distribution. The particles strongly interact with the turbulence eddies and are concentrated in narrow bands that are evolving with time. It is believed that observed preferential concentration is due to the fact that these particles are flung out of eddies by centrifugal force.« less

Cumulative Significance of Hyporheic Exchange and Biogeochemical Processing in River Networks

NASA Astrophysics Data System (ADS)

Harvey, J. W.; Gomez-Velez, J. D.

2014-12-01

Biogeochemical reactions in rivers that decrease excessive loads of nutrients, metals, organic compounds, etc. are enhanced by hydrologic interactions with microbially and geochemically active sediments of the hyporheic zone. The significance of reactions in individual hyporheic flow paths has been shown to be controlled by the contact time between river water and sediment and the intrinsic reaction rate in the sediment. However, little is known about how the cumulative effects of hyporheic processing in large river basins. We used the river network model NEXSS (Gomez-Velez and Harvey, submitted) to simulate hyporheic exchange through synthetic river networks based on the best available models of network topology, hydraulic geometry and scaling of geomorphic features, grain size, hydraulic conductivity, and intrinsic reaction rates of nutrients and metals in river sediment. The dimensionless reaction significance factor, RSF (Harvey et al., 2013) was used to quantify the cumulative removal fraction of a reactive solute by hyporheic processing. SF scales reaction progress in a single pass through the hyporheic zone with the proportion of stream discharge passing through the hyporheic zone for a specified distance. Reaction progress is optimal where the intrinsic reaction timescale in sediment matches the residence time of hyporheic flow and is less efficient in longer residence time hyporheic flow as a result of the decreasing proportion of river flow that is processed by longer residence time hyporheic flow paths. In contrast, higher fluxes through short residence time hyporheic flow paths may be inefficient because of the repeated surface-subsurface exchanges required to complete the reaction. Using NEXSS we found that reaction efficiency may be high in both small streams and large rivers, although for different reasons. In small streams reaction progress generally is dominated by faster pathways of vertical exchange beneath submerged bedforms. Slower exchange beneath meandering river banks mainly has importance only in large rivers. For solutes entering networks in proportion to water inputs it is the lower order streams that tend to dominate cumulative reaction progress.

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.

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.

What Is a "Good" Social Network for a System?: The Flow of Know-How for Organizational Change. Working Paper #48

ERIC Educational Resources Information Center

Frank, Kenneth

2014-01-01

This study concerns how intra-organizational networks affect the implementation of policies and practices in organizations. In particular, we attend to the role of the informal subgroup or clique in cultivating and distributing locally adapted and integrated knowledge, or know-how. We develop two hypotheses based on the importance of…

The flow of power law fluids in elastic networks and porous media.

PubMed

Sochi, Taha

2016-02-01

The flow of power law fluids, which include shear thinning and shear thickening as well as Newtonian as a special case, in networks of interconnected elastic tubes is investigated using a residual-based pore scale network modeling method with the employment of newly derived formulae. Two relations describing the mechanical interaction between the local pressure and local cross-sectional area in distensible tubes of elastic nature are considered in the derivation of these formulae. The model can be used to describe shear dependent flows of mainly viscous nature. The behavior of the proposed model is vindicated by several tests in a number of special and limiting cases where the results can be verified quantitatively or qualitatively. The model, which is the first of its kind, incorporates more than one major nonlinearity corresponding to the fluid rheology and conduit mechanical properties, that is non-Newtonian effects and tube distensibility. The formulation, implementation, and performance indicate that the model enjoys certain advantages over the existing models such as being exact within the restricting assumptions on which the model is based, easy implementation, low computational costs, reliability, and smooth convergence. The proposed model can, therefore, be used as an alternative to the existing Newtonian distensible models; moreover, it stretches the capabilities of the existing modeling approaches to reach non-Newtonian rheologies.

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.

Supply Chain Engineering and the Use of a Supporting Knowledge Management Application

NASA Astrophysics Data System (ADS)

Laakmann, Frank

The future competition in markets will happen between logistics networks and no longer between enterprises. A new approach for supporting the engineering of logistics networks is developed by this research as a part of the Collaborative Research Centre (SFB) 559: "Modeling of Large Networks in Logistics" at the University of Dortmund together with the Fraunhofer-Institute of Material Flow and Logistics founded by Deutsche Forschungsgemeinschaft (DFG). Based on a reference model for logistics processes, the process chain model, a guideline for logistics engineers is developed to manage the different types of design tasks of logistics networks. The technical background of this solution is a collaborative knowledge management application. This paper will introduce how new Internet-based technologies support supply chain design projects.

Research on moving target defense based on SDN

NASA Astrophysics Data System (ADS)

Chen, Mingyong; Wu, Weimin

2017-08-01

An address mutation strategy was proposed. This strategy provided an unpredictable change in address, replacing the real address of the packet forwarding process and path mutation, thus hiding the real address of the host and path. a mobile object defense technology based on Spatio-temporal Mutation on this basis is proposed, Using the software Defined Network centralized control architecture advantage combines sFlow traffic monitoring technology and Moving Target Defense. A mutated time period which can be changed in real time according to the network traffic is changed, and the destination address is changed while the controller abruptly changes the address while the data packet is transferred between the switches to construct a moving target, confusing the host within the network, thereby protecting the host and network.

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.

Tensor Spectral Clustering for Partitioning Higher-order Network Structures.

PubMed

Benson, Austin R; Gleich, David F; Leskovec, Jure

2015-01-01

Spectral graph theory-based methods represent an important class of tools for studying the structure of networks. Spectral methods are based on a first-order Markov chain derived from a random walk on the graph and thus they cannot take advantage of important higher-order network substructures such as triangles, cycles, and feed-forward loops. Here we propose a Tensor Spectral Clustering (TSC) algorithm that allows for modeling higher-order network structures in a graph partitioning framework. Our TSC algorithm allows the user to specify which higher-order network structures (cycles, feed-forward loops, etc.) should be preserved by the network clustering. Higher-order network structures of interest are represented using a tensor, which we then partition by developing a multilinear spectral method. Our framework can be applied to discovering layered flows in networks as well as graph anomaly detection, which we illustrate on synthetic networks. In directed networks, a higher-order structure of particular interest is the directed 3-cycle, which captures feedback loops in networks. We demonstrate that our TSC algorithm produces large partitions that cut fewer directed 3-cycles than standard spectral clustering algorithms.

Tensor Spectral Clustering for Partitioning Higher-order Network Structures

PubMed Central

Benson, Austin R.; Gleich, David F.; Leskovec, Jure

2016-01-01

Spectral graph theory-based methods represent an important class of tools for studying the structure of networks. Spectral methods are based on a first-order Markov chain derived from a random walk on the graph and thus they cannot take advantage of important higher-order network substructures such as triangles, cycles, and feed-forward loops. Here we propose a Tensor Spectral Clustering (TSC) algorithm that allows for modeling higher-order network structures in a graph partitioning framework. Our TSC algorithm allows the user to specify which higher-order network structures (cycles, feed-forward loops, etc.) should be preserved by the network clustering. Higher-order network structures of interest are represented using a tensor, which we then partition by developing a multilinear spectral method. Our framework can be applied to discovering layered flows in networks as well as graph anomaly detection, which we illustrate on synthetic networks. In directed networks, a higher-order structure of particular interest is the directed 3-cycle, which captures feedback loops in networks. We demonstrate that our TSC algorithm produces large partitions that cut fewer directed 3-cycles than standard spectral clustering algorithms. PMID:27812399

Examining Food Risk in the Large using a Complex, Networked System-of-sytems Approach

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

Ambrosiano, John; Newkirk, Ryan; Mc Donald, Mark P

2010-12-03

The food production infrastructure is a highly complex system of systems. Characterizing the risks of intentional contamination in multi-ingredient manufactured foods is extremely challenging because the risks depend on the vulnerabilities of food processing facilities and on the intricacies of the supply-distribution networks that link them. A pure engineering approach to modeling the system is impractical because of the overall system complexity and paucity of data. A methodology is needed to assess food contamination risk 'in the large', based on current, high-level information about manufacturing facilities, corrunodities and markets, that will indicate which food categories are most at risk ofmore » intentional contamination and warrant deeper analysis. The approach begins by decomposing the system for producing a multi-ingredient food into instances of two subsystem archetypes: (1) the relevant manufacturing and processing facilities, and (2) the networked corrunodity flows that link them to each other and consumers. Ingredient manufacturing subsystems are modeled as generic systems dynamics models with distributions of key parameters that span the configurations of real facilities. Networks representing the distribution systems are synthesized from general information about food corrunodities. This is done in a series of steps. First, probability networks representing the aggregated flows of food from manufacturers to wholesalers, retailers, other manufacturers, and direct consumers are inferred from high-level approximate information. This is followed by disaggregation of the general flows into flows connecting 'large' and 'small' categories of manufacturers, wholesalers, retailers, and consumers. Optimization methods are then used to determine the most likely network flows consistent with given data. Vulnerability can be assessed for a potential contamination point using a modified CARVER + Shock model. Once the facility and corrunodity flow models are instantiated, a risk consequence analysis can be performed by injecting contaminant at chosen points in the system and propagating the event through the overarching system to arrive at morbidity and mortality figures. A generic chocolate snack cake model, consisting of fluid milk, liquid eggs, and cocoa, is described as an intended proof of concept for multi-ingredient food systems. We aim for an eventual tool that can be used directly by policy makers and planners.« less

Polyvinylpyrrolidone-based semi-interpenetrating polymer networks as highly selective and chemically stable membranes for all vanadium redox flow batteries

NASA Astrophysics Data System (ADS)

Zeng, L.; Zhao, T. S.; Wei, L.; Zeng, Y. K.; Zhang, Z. H.

2016-09-01

Vanadium redox flow batteries (VRFBs) with their high flexibility in configuration and operation, as well as long cycle life are competent for the requirement of future energy storage systems. Nevertheless, due to the application of perfluorinated membranes, VRFBs are plagued by not only the severe migration issue of vanadium ions, but also their high cost. Herein, we fabricate semi-interpenetrating polymer networks (SIPNs), consisting of cross-linked polyvinylpyrrolidone (PVP) and polysulfone (PSF), as alternative membranes for VRFBs. It is demonstrated that the PVP-based SIPNs exhibit extremely low vanadium permeabilities, which contribute to the well-established hydrophilic/hydrophobic microstructures and the Donnan exclusion effect. As a result, the coulombic efficiencies of VRFBs with PVP-based SIPNs reach almost 100% at 40 mA cm-2 to 100 mA cm-2; the energy efficiencies are more than 3% higher than those of VRFBs with Nafion 212. More importantly, the PVP-based SIPNs exhibit a superior chemical stability, as demonstrated both by an ex situ immersion test and continuously cycling test. Hence, all the characterizations and performance tests reported here suggest that PVP-based SIPNs are a promising alternative membrane for redox flow batteries to achieve superior cell performance and excellent cycling stability at the fraction of the cost of perfluorinated membranes.

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

Role of Distance-Based Routing in Traffic Dynamics on Mobile Networks

NASA Astrophysics Data System (ADS)

Yang, Han-Xin; Wang, Wen-Xu

2013-06-01

Despite of intensive investigations on transportation dynamics taking place on complex networks with fixed structures, a deep understanding of networks consisting of mobile nodes is challenging yet, especially the lacking of insight into the effects of routing strategies on transmission efficiency. We introduce a distance-based routing strategy for networks of mobile agents toward enhancing the network throughput and the transmission efficiency. We study the transportation capacity and delivering time of data packets associated with mobility and communication ability. Interestingly, we find that the transportation capacity is optimized at moderate moving speed, which is quite different from random routing strategy. In addition, both continuous and discontinuous transitions from free flow to congestions are observed. Degree distributions are explored in order to explain the enhancement of network throughput and other observations. Our work is valuable toward understanding complex transportation dynamics and designing effective routing protocols.

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.

Design of Control Plane Architecture Based on Cloud Platform and Experimental Network Demonstration for Multi-domain SDON

NASA Astrophysics Data System (ADS)

Li, Ming; Yin, Hongxi; Xing, Fangyuan; Wang, Jingchao; Wang, Honghuan

2016-02-01

With the features of network virtualization and resource programming, Software Defined Optical Network (SDON) is considered as the future development trend of optical network, provisioning a more flexible, efficient and open network function, supporting intraconnection and interconnection of data centers. Meanwhile cloud platform can provide powerful computing, storage and management capabilities. In this paper, with the coordination of SDON and cloud platform, a multi-domain SDON architecture based on cloud control plane has been proposed, which is composed of data centers with database (DB), path computation element (PCE), SDON controller and orchestrator. In addition, the structure of the multidomain SDON orchestrator and OpenFlow-enabled optical node are proposed to realize the combination of centralized and distributed effective management and control platform. Finally, the functional verification and demonstration are performed through our optical experiment network.

Multilane Traffic Flow Modeling Using Cellular Automata Theory

NASA Astrophysics Data System (ADS)

Chechina, Antonina; Churbanova, Natalia; Trapeznikova, Marina

2018-02-01

The paper deals with the mathematical modeling of traffic flows on urban road networks using microscopic approach. The model is based on the cellular automata theory and presents a generalization of the Nagel-Schreckenberg model to a multilane case. The created program package allows to simulate traffic on various types of road fragments (T or X type intersection, strait road elements, etc.) and on road networks that consist of these elements. Besides that, it allows to predict the consequences of various decisions regarding road infrastructure changes, such as: number of lanes increasing/decreasing, putting new traffic lights into operation, building new roads, entrances/exits, road junctions.

Equivalent model and power flow model for electric railway traction network

NASA Astrophysics Data System (ADS)

Wang, Feng

2018-05-01

An equivalent model of the Cable Traction Network (CTN) considering the distributed capacitance effect of the cable system is proposed. The model can be divided into 110kV side and 27.5kV side two kinds. The 110kV side equivalent model can be used to calculate the power supply capacity of the CTN. The 27.5kV side equivalent model can be used to solve the voltage of the catenary. Based on the equivalent simplified model of CTN, the power flow model of CTN which involves the reactive power compensation coefficient and the interaction of voltage and current, is derived.

Designing Industrial Networks Using Ecological Food Web Metrics.

PubMed

Layton, Astrid; Bras, Bert; Weissburg, Marc

2016-10-18

Biologically Inspired Design (biomimicry) and Industrial Ecology both look to natural systems to enhance the sustainability and performance of engineered products, systems and industries. Bioinspired design (BID) traditionally has focused on a unit operation and single product level. In contrast, this paper describes how principles of network organization derived from analysis of ecosystem properties can be applied to industrial system networks. Specifically, this paper examines the applicability of particular food web matrix properties as design rules for economically and biologically sustainable industrial networks, using an optimization model developed for a carpet recycling network. Carpet recycling network designs based on traditional cost and emissions based optimization are compared to designs obtained using optimizations based solely on ecological food web metrics. The analysis suggests that networks optimized using food web metrics also were superior from a traditional cost and emissions perspective; correlations between optimization using ecological metrics and traditional optimization ranged generally from 0.70 to 0.96, with flow-based metrics being superior to structural parameters. Four structural food parameters provided correlations nearly the same as that obtained using all structural parameters, but individual structural parameters provided much less satisfactory correlations. The analysis indicates that bioinspired design principles from ecosystems can lead to both environmentally and economically sustainable industrial resource networks, and represent guidelines for designing sustainable industry networks.

CCSDS Advanced Orbiting Systems Virtual Channel Access Service for QoS MACHETE Model

NASA Technical Reports Server (NTRS)

Jennings, Esther H.; Segui, John S.

2011-01-01

To support various communications requirements imposed by different missions, interplanetary communication protocols need to be designed, validated, and evaluated carefully. Multimission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE), described in "Simulator of Space Communication Networks" (NPO-41373), NASA Tech Briefs, Vol. 29, No. 8 (August 2005), p. 44, combines various tools for simulation and performance analysis of space networks. The MACHETE environment supports orbital analysis, link budget analysis, communications network simulations, and hardware-in-the-loop testing. By building abstract behavioral models of network protocols, one can validate performance after identifying the appropriate metrics of interest. The innovators have extended the MACHETE model library to include a generic link-layer Virtual Channel (VC) model supporting quality-of-service (QoS) controls based on IP streams. The main purpose of this generic Virtual Channel model addition was to interface fine-grain flow-based QoS (quality of service) between the network and MAC layers of the QualNet simulator, a commercial component of MACHETE. This software model adds the capability of mapping IP streams, based on header fields, to virtual channel numbers, allowing extended QoS handling at link layer. This feature further refines the QoS v existing at the network layer. QoS at the network layer (e.g. diffserv) supports few QoS classes, so data from one class will be aggregated together; differentiating between flows internal to a class/priority is not supported. By adding QoS classification capability between network and MAC layers through VC, one maps multiple VCs onto the same physical link. Users then specify different VC weights, and different queuing and scheduling policies at the link layer. This VC model supports system performance analysis of various virtual channel link-layer QoS queuing schemes independent of the network-layer QoS systems.

Neural contributions to flow experience during video game playing.

PubMed

Klasen, Martin; Weber, René; Kircher, Tilo T J; Mathiak, Krystyna A; Mathiak, Klaus

2012-04-01

Video games are an exciting part of new media. Although game play has been intensively studied, the underlying neurobiology is still poorly understood. Flow theory is a well-established model developed to describe subjective game experience. In 13 healthy male subjects, we acquired fMRI data during free play of a video game and analyzed brain activity based on the game content. In accordance with flow theory, we extracted the following factors from the game content: (i) balance between ability and challenge; (ii) concentration and focus; (iii) direct feedback of action results; (iv) clear goals; and (v) control over the situation/activity. We suggest that flow is characterized by specific neural activation patterns and that the latter can be assessed-at least partially-by content factors contributing to the emergence of flow. Each of the content factors was characterized by specific and distinguishable brain activation patterns, encompassing reward-related midbrain structures, as well as cognitive and sensorimotor networks. The activation of sensory and motor networks in the conjunction analyses underpinned the central role of simulation for flow experience. Flow factors can be validated with functional brain imaging which can improve the understanding of human emotions and motivational processes during media entertainment.

Neural contributions to flow experience during video game playing

PubMed Central

Weber, René; Kircher, Tilo T. J.; Mathiak, Krystyna A.; Mathiak, Klaus

2012-01-01

Video games are an exciting part of new media. Although game play has been intensively studied, the underlying neurobiology is still poorly understood. Flow theory is a well-established model developed to describe subjective game experience. In 13 healthy male subjects, we acquired fMRI data during free play of a video game and analyzed brain activity based on the game content. In accordance with flow theory, we extracted the following factors from the game content: (i) balance between ability and challenge; (ii) concentration and focus; (iii) direct feedback of action results; (iv) clear goals; and (v) control over the situation/activity. We suggest that flow is characterized by specific neural activation patterns and that the latter can be assessed—at least partially—by content factors contributing to the emergence of flow. Each of the content factors was characterized by specific and distinguishable brain activation patterns, encompassing reward-related midbrain structures, as well as cognitive and sensorimotor networks. The activation of sensory and motor networks in the conjunction analyses underpinned the central role of simulation for flow experience. Flow factors can be validated with functional brain imaging which can improve the understanding of human emotions and motivational processes during media entertainment. PMID:21596764

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.

Testing seismic amplitude source location for fast debris-flow detection at Illgraben, Switzerland

NASA Astrophysics Data System (ADS)

Walter, Fabian; Burtin, Arnaud; McArdell, Brian W.; Hovius, Niels; Weder, Bianca; Turowski, Jens M.

2017-06-01

Heavy precipitation can mobilize tens to hundreds of thousands of cubic meters of sediment in steep Alpine torrents in a short time. The resulting debris flows (mixtures of water, sediment and boulders) move downstream with velocities of several meters per second and have a high destruction potential. Warning protocols for affected communities rely on raising awareness about the debris-flow threat, precipitation monitoring and rapid detection methods. The latter, in particular, is a challenge because debris-flow-prone torrents have their catchments in steep and inaccessible terrain, where instrumentation is difficult to install and maintain. Here we test amplitude source location (ASL) as a processing scheme for seismic network data for early warning purposes. We use debris-flow and noise seismograms from the Illgraben catchment, Switzerland, a torrent system which produces several debris-flow events per year. Automatic in situ detection is currently based on geophones mounted on concrete check dams and radar stage sensors suspended above the channel. The ASL approach has the advantage that it uses seismometers, which can be installed at more accessible locations where a stable connection to mobile phone networks is available for data communication. Our ASL processing uses time-averaged ground vibration amplitudes to estimate the location of the debris-flow front. Applied to continuous data streams, inversion of the seismic amplitude decay throughout the network is robust and efficient, requires no manual identification of seismic phase arrivals and eliminates the need for a local seismic velocity model. We apply the ASL technique to a small debris-flow event on 19 July 2011, which was captured with a temporary seismic monitoring network. The processing rapidly detects the debris-flow event half an hour before arrival at the outlet of the torrent and several minutes before detection by the in situ alarm system. An analysis of continuous seismic records furthermore indicates that detectability of Illgraben debris flows of this size is unaffected by changing environmental and anthropogenic seismic noise and that false detections can be greatly reduced with simple processing steps.

Discovering SIFIs in Interbank Communities

PubMed Central

Pecora, Nicolò; Rovira Kaltwasser, Pablo; Spelta, Alessandro

2016-01-01

This paper proposes a new methodology based on non-negative matrix factorization to detect communities and to identify central nodes in a network as well as within communities. The method is specifically designed for directed weighted networks and, consequently, it has been applied to the interbank network derived from the e-MID interbank market. In an interbank network indeed links are directed, representing flows of funds between lenders and borrowers. Besides distinguishing between Systemically Important Borrowers and Lenders, the technique complements the detection of systemically important banks, revealing the community structure of the network, that proxies the most plausible areas of contagion of institutions’ distress. PMID:28002445

Key Technology of Real-Time Road Navigation Method Based on Intelligent Data Research

PubMed Central

Tang, Haijing; Liang, Yu; Huang, Zhongnan; Wang, Taoyi; He, Lin; Du, Yicong; Ding, Gangyi

2016-01-01

The effect of traffic flow prediction plays an important role in routing selection. Traditional traffic flow forecasting methods mainly include linear, nonlinear, neural network, and Time Series Analysis method. However, all of them have some shortcomings. This paper analyzes the existing algorithms on traffic flow prediction and characteristics of city traffic flow and proposes a road traffic flow prediction method based on transfer probability. This method first analyzes the transfer probability of upstream of the target road and then makes the prediction of the traffic flow at the next time by using the traffic flow equation. Newton Interior-Point Method is used to obtain the optimal value of parameters. Finally, it uses the proposed model to predict the traffic flow at the next time. By comparing the existing prediction methods, the proposed model has proven to have good performance. It can fast get the optimal value of parameters faster and has higher prediction accuracy, which can be used to make real-time traffic flow prediction. PMID:27872637

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.

Application of Fuzzy-Logic Controller and Neural Networks Controller in Gas Turbine Speed Control and Overheating Control and Surge Control on Transient Performance

NASA Astrophysics Data System (ADS)

Torghabeh, A. A.; Tousi, A. M.

2007-08-01

This paper presents Fuzzy Logic and Neural Networks approach to Gas Turbine Fuel schedules. Modeling of non-linear system using feed forward artificial Neural Networks using data generated by a simulated gas turbine program is introduced. Two artificial Neural Networks are used , depicting the non-linear relationship between gas generator speed and fuel flow, and turbine inlet temperature and fuel flow respectively . Off-line fast simulations are used for engine controller design for turbojet engine based on repeated simulation. The Mamdani and Sugeno models are used to expression the Fuzzy system . The linguistic Fuzzy rules and membership functions are presents and a Fuzzy controller will be proposed to provide an Open-Loop control for the gas turbine engine during acceleration and deceleration . MATLAB Simulink was used to apply the Fuzzy Logic and Neural Networks analysis. Both systems were able to approximate functions characterizing the acceleration and deceleration schedules . Surge and Flame-out avoidance during acceleration and deceleration phases are then checked . Turbine Inlet Temperature also checked and controls by Neural Networks controller. This Fuzzy Logic and Neural Network Controllers output results are validated and evaluated by GSP software . The validation results are used to evaluate the generalization ability of these artificial Neural Networks and Fuzzy Logic controllers.

Locating an imaging radar in Canada for identifying spaceborne objects

NASA Astrophysics Data System (ADS)

Schick, William G.

1992-12-01

This research presents a study of the maximal coverage p-median facility location problem as applied to the location of an imaging radar in Canada for imaging spaceborne objects. The classical mathematical formulation of the maximal coverage p-median problem is converted into network-flow with side constraint formulations that are developed using a scaled down version of the imaging radar location problem. Two types of network-flow with side constraint formulations are developed: a network using side constraints that simulates the gains in a generalized network; and a network resembling a multi-commodity flow problem that uses side constraints to force flow along identical arcs. These small formulations are expanded to encompass a case study using 12 candidate radar sites, and 48 satellites divided into three states. SAS/OR PROC NETFLOW was used to solve the network-flow with side constraint formulations. The case study show that potential for both formulations, although the simulated gains formulation encountered singular matrix computational difficulties as a result of the very organized nature of its side constraint matrix. The multi-commodity flow formulation, when combined with equi-distribution of flow constraints, provided solutions for various values of p, the number of facilities to be selected.

Clustering and Flow Conservation Monitoring Tool for Software Defined Networks

PubMed Central

Puente Fernández, Jesús Antonio

2018-01-01

Prediction systems present some challenges on two fronts: the relation between video quality and observed session features and on the other hand, dynamics changes on the video quality. Software Defined Networks (SDN) is a new concept of network architecture that provides the separation of control plane (controller) and data plane (switches) in network devices. Due to the existence of the southbound interface, it is possible to deploy monitoring tools to obtain the network status and retrieve a statistics collection. Therefore, achieving the most accurate statistics depends on a strategy of monitoring and information requests of network devices. In this paper, we propose an enhanced algorithm for requesting statistics to measure the traffic flow in SDN networks. Such an algorithm is based on grouping network switches in clusters focusing on their number of ports to apply different monitoring techniques. Such grouping occurs by avoiding monitoring queries in network switches with common characteristics and then, by omitting redundant information. In this way, the present proposal decreases the number of monitoring queries to switches, improving the network traffic and preventing the switching overload. We have tested our optimization in a video streaming simulation using different types of videos. The experiments and comparison with traditional monitoring techniques demonstrate the feasibility of our proposal maintaining similar values decreasing the number of queries to the switches. PMID:29614049

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.

Real-time determination of fringe pattern frequencies: An application to pressure measurement

NASA Astrophysics Data System (ADS)

Sciammarella, Cesar A.; Piroozan, Parham

2007-05-01

Retrieving information in real time from fringe patterns is a topic of a great deal of interest in scientific and engineering applications of optical methods. This paper presents a method for fringe frequency determination based on the capability of neural networks to recognize signals that are similar but not identical to signals used to train the neural network. Sampled patterns are generated by calibration and stored in memory. Incoming patterns are analyzed by a back-propagation neural network at the speed of the recording device, a CCD camera. This method of information retrieval is utilized to measure pressures on a boundary layer flow. The sensor combines optics and electronics to analyze dynamic pressure distributions and to feed information to a control system that is capable to preserve the stability of the flow.

Analysis of methods to estimate spring flows in a karst aquifer

USGS Publications Warehouse

Sepulveda, N.

2009-01-01

Hydraulically and statistically based methods were analyzed to identify the most reliable method to predict spring flows in a karst aquifer. Measured water levels at nearby observation wells, measured spring pool altitudes, and the distance between observation wells and the spring pool were the parameters used to match measured spring flows. Measured spring flows at six Upper Floridan aquifer springs in central Florida were used to assess the reliability of these methods to predict spring flows. Hydraulically based methods involved the application of the Theis, Hantush-Jacob, and Darcy-Weisbach equations, whereas the statistically based methods were the multiple linear regressions and the technology of artificial neural networks (ANNs). Root mean square errors between measured and predicted spring flows using the Darcy-Weisbach method ranged between 5% and 15% of the measured flows, lower than the 7% to 27% range for the Theis or Hantush-Jacob methods. Flows at all springs were estimated to be turbulent based on the Reynolds number derived from the Darcy-Weisbach equation for conduit flow. The multiple linear regression and the Darcy-Weisbach methods had similar spring flow prediction capabilities. The ANNs provided the lowest residuals between measured and predicted spring flows, ranging from 1.6% to 5.3% of the measured flows. The model prediction efficiency criteria also indicated that the ANNs were the most accurate method predicting spring flows in a karst aquifer. ?? 2008 National Ground Water Association.

Analysis of methods to estimate spring flows in a karst aquifer.

PubMed

Sepúlveda, Nicasio

2009-01-01

Hydraulically and statistically based methods were analyzed to identify the most reliable method to predict spring flows in a karst aquifer. Measured water levels at nearby observation wells, measured spring pool altitudes, and the distance between observation wells and the spring pool were the parameters used to match measured spring flows. Measured spring flows at six Upper Floridan aquifer springs in central Florida were used to assess the reliability of these methods to predict spring flows. Hydraulically based methods involved the application of the Theis, Hantush-Jacob, and Darcy-Weisbach equations, whereas the statistically based methods were the multiple linear regressions and the technology of artificial neural networks (ANNs). Root mean square errors between measured and predicted spring flows using the Darcy-Weisbach method ranged between 5% and 15% of the measured flows, lower than the 7% to 27% range for the Theis or Hantush-Jacob methods. Flows at all springs were estimated to be turbulent based on the Reynolds number derived from the Darcy-Weisbach equation for conduit flow. The multiple linear regression and the Darcy-Weisbach methods had similar spring flow prediction capabilities. The ANNs provided the lowest residuals between measured and predicted spring flows, ranging from 1.6% to 5.3% of the measured flows. The model prediction efficiency criteria also indicated that the ANNs were the most accurate method predicting spring flows in a karst aquifer.

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.

Backbone of complex networks of corporations: the flow of control.

PubMed

Glattfelder, J B; Battiston, S

2009-09-01

We present a methodology to extract the backbone of complex networks based on the weight and direction of links, as well as on nontopological properties of nodes. We show how the methodology can be applied in general to networks in which mass or energy is flowing along the links. In particular, the procedure enables us to address important questions in economics, namely, how control and wealth are structured and concentrated across national markets. We report on the first cross-country investigation of ownership networks, focusing on the stock markets of 48 countries around the world. On the one hand, our analysis confirms results expected on the basis of the literature on corporate control, namely, that in Anglo-Saxon countries control tends to be dispersed among numerous shareholders. On the other hand, it also reveals that in the same countries, control is found to be highly concentrated at the global level, namely, lying in the hands of very few important shareholders. Interestingly, the exact opposite is observed for European countries. These results have previously not been reported as they are not observable without the kind of network analysis developed here.

Backbone of complex networks of corporations: The flow of control

NASA Astrophysics Data System (ADS)

Glattfelder, J. B.; Battiston, S.

2009-09-01

We present a methodology to extract the backbone of complex networks based on the weight and direction of links, as well as on nontopological properties of nodes. We show how the methodology can be applied in general to networks in which mass or energy is flowing along the links. In particular, the procedure enables us to address important questions in economics, namely, how control and wealth are structured and concentrated across national markets. We report on the first cross-country investigation of ownership networks, focusing on the stock markets of 48 countries around the world. On the one hand, our analysis confirms results expected on the basis of the literature on corporate control, namely, that in Anglo-Saxon countries control tends to be dispersed among numerous shareholders. On the other hand, it also reveals that in the same countries, control is found to be highly concentrated at the global level, namely, lying in the hands of very few important shareholders. Interestingly, the exact opposite is observed for European countries. These results have previously not been reported as they are not observable without the kind of network analysis developed here.

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.

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

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.

Microfluidic System Simulation Including the Electro-Viscous Effect

NASA Technical Reports Server (NTRS)

Rojas, Eileen; Chen, C. P.; Majumdar, Alok

2007-01-01

This paper describes a practical approach using a general purpose lumped-parameter computer program, GFSSP (Generalized Fluid System Simulation Program) for calculating flow distribution in a network of micro-channels including electro-viscous effects due to the existence of electrical double layer (EDL). In this study, an empirical formulation for calculating an effective viscosity of ionic solutions based on dimensional analysis is described to account for surface charge and bulk fluid conductivity, which give rise to electro-viscous effect in microfluidics network. Two dimensional slit micro flow data was used to determine the model coefficients. Geometry effect is then included through a Poiseuille number correlation in GFSSP. The bi-power model was used to calculate flow distribution of isotropically etched straight channel and T-junction microflows involving ionic solutions. Performance of the proposed model is assessed against experimental test data.

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.

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.

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

Intra-Urban Movement Flow Estimation Using Location Based Social Networking Data

NASA Astrophysics Data System (ADS)

Kheiri, A.; Karimipour, F.; Forghani, M.

2015-12-01

In recent years, there has been a rapid growth of location-based social networking services, such as Foursquare and Facebook, which have attracted an increasing number of users and greatly enriched their urban experience. Location-based social network data, as a new travel demand data source, seems to be an alternative or complement to survey data in the study of mobility behavior and activity analysis because of its relatively high access and low cost. In this paper, three OD estimation models have been utilized in order to investigate their relative performance when using Location-Based Social Networking (LBSN) data. For this, the Foursquare LBSN data was used to analyze the intra-urban movement behavioral patterns for the study area, Manhattan, the most densely populated of the five boroughs of New York city. The outputs of models are evaluated using real observations based on different criterions including distance distribution, destination travel constraints. The results demonstrate the promising potential of using LBSN data for urban travel demand analysis and monitoring.

A Markovian model of evolving world input-output network

PubMed Central

Isacchini, Giulio

2017-01-01

The initial theoretical connections between Leontief input-output models and Markov chains were established back in 1950s. However, considering the wide variety of mathematical properties of Markov chains, so far there has not been a full investigation of evolving world economic networks with Markov chain formalism. In this work, using the recently available world input-output database, we investigated the evolution of the world economic network from 1995 to 2011 through analysis of a time series of finite Markov chains. We assessed different aspects of this evolving system via different known properties of the Markov chains such as mixing time, Kemeny constant, steady state probabilities and perturbation analysis of the transition matrices. First, we showed how the time series of mixing times and Kemeny constants could be used as an aggregate index of globalization. Next, we focused on the steady state probabilities as a measure of structural power of the economies that are comparable to GDP shares of economies as the traditional index of economies welfare. Further, we introduced two measures of systemic risk, called systemic influence and systemic fragility, where the former is the ratio of number of influenced nodes to the total number of nodes, caused by a shock in the activity of a node, and the latter is based on the number of times a specific economic node is affected by a shock in the activity of any of the other nodes. Finally, focusing on Kemeny constant as a global indicator of monetary flow across the network, we showed that there is a paradoxical effect of a change in activity levels of economic nodes on the overall flow of the world economic network. While the economic slowdown of the majority of nodes with high structural power results to a slower average monetary flow over the network, there are some nodes, where their slowdowns improve the overall quality of the network in terms of connectivity and the average flow of the money. PMID:29065145

Analysis of critical operating conditions for LV distribution networks with microgrids

NASA Astrophysics Data System (ADS)

Zehir, M. A.; Batman, A.; Sonmez, M. A.; Font, A.; Tsiamitros, D.; Stimoniaris, D.; Kollatou, T.; Bagriyanik, M.; Ozdemir, A.; Dialynas, E.

2016-11-01

Increase in the penetration of Distributed Generation (DG) in distribution networks, raises the risk of voltage limit violations while contributing to line losses. Especially in low voltage (LV) distribution networks (secondary distribution networks), impacts of active power flows on the bus voltages and on the network losses are more dominant. As network operators must meet regulatory limitations, they have to take into account the most critical operating conditions in their systems. In this study, it is aimed to present the impact of the worst operation cases of LV distribution networks comprising microgrids. Simulation studies are performed on a field data-based virtual test-bed. The simulations are repeated for several cases consisting different microgrid points of connection with different network loading and microgrid supply/demand conditions.

Percolation connectivity, pore size, and gas apparent permeability: Network simulations and comparison to experimental data

NASA Astrophysics Data System (ADS)

Li, M.; Tang, Y. B.; Bernabé, Y.; Zhao, J. Z.; Li, X. F.; Li, T.

2017-07-01

We modeled single-phase gas flow through porous media using percolation networks. Gas permeability is different from liquid permeability. The latter is only related to the geometry and topology of the pore space, while the former depends on the specific gas considered and varies with gas pressure. As gas pressure decreases, four flow regimes can be distinguished as viscous flow, slip flow, transition flow, and free molecular diffusion. Here we use a published conductance model presumably capable of predicting the flow rate of an arbitrary gas through a cylindrical pipe in the four regimes. We incorporated this model into pipe network simulations. We considered 3-D simple cubic, body-centered cubic, and face-centered cubic lattices, in which we varied the pipe radius distribution and the bond coordination number. Gas flow was simulated at different gas pressures. The simulation results showed that the gas apparent permeability kapp obeys an identical scaling law in all three lattices, kapp (z-zc)β, where the exponent β depends on the width of the pipe radius distribution, z is the mean coordination number, and zc its critical value at the percolation threshold. Surprisingly, (z-zc) had a very weak effect on the ratio of the apparent gas permeability to the absolute liquid permeability, kapp/kabs, suggesting that the Klinkenberg gas slippage correction factor is nearly independent of connectivity. We constructed models of kapp and kapp/kabs based on the observed power law and tested them by comparison with published experimental data on glass beads and other materials.

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.

Experimental evidence for intraplate deformation controlled by netlike plastic-flow in central-eastern Asia

NASA Astrophysics Data System (ADS)

Wang, Sheng-zu; Li, Jian-guo; Zhou, Yong-sheng

2007-12-01

The experimental results of brittle/ductile two-layer analogue models verify that intraplate tectonic deformation in central-eastern Asia is controlled mainly by the netlike plastic-flow (NPF) occurring in the lower lithosphere, including the lower crust and lithospheric mantle. The ductile lower layer in the model, corresponding to the lower lithosphere in the natural prototype, is made of a mixture of gum rosin and turpentine oil and the brittle upper one, to the upper crust, is formed by the consolidation of talc-powder slurry. The NPF hypothesis for continental dynamics can be regarded as a combination and development of two kinds of seemingly mutually exclusive ones, which are based on the theories of slip-line field and viscous (plastic) flow, respectively. In contrast to "homogeneous" viscous (plastic) flow considered usually in fluid mechanics and rheology, NPF is a viscous (plastic) flow accompanied with shear strain localization, forming plastic-flow network in the flow field. Plastic-flow network, being composed of two families of plastic-flow belts intersecting each other with their initial conjugate angles (i.e. the included angles facing the compression direction) equal to 90°, is similar to but different from the traditional slip-line network, which is assumed as a critical state of yield in elastoplastic medium. The experiments show that there are several NPF-controlled tectonic network systems to be developed in the models and two of them correspond to those in central-eastern Asia, which have the Himalayan and Taiwan arcs as their driving boundaries, respectively. The existence of "stable blocks" in the ductile lower layer has promoted some types of tectonic deformation, including the formation of large-scale compressional basins, corresponding to the Tarim, Ordos, Sichuan basins, etc., the development of compression-shear tectonic zones between some of these basins, corresponding to those shown by the Tianshan and Altay mountain ranges, and the uplift of some areas of the "plateau", corresponding to a contribution to the formation of the Qinghai-Tibet plateau. The distributions of maximum compressive stress directions and strains in the ductile lower layer estimated using the "conjugate-angle-bisector" and "conjugate-angle-increment" methods, respectively, are coincident in general tendency and framework with those in the prototype for the major part of the central-eastern Asian continent. It is also inferred that the westward influence of the horizontal compression component of the Pacific plate has reached North China by means of the interaction between adjacent plastic-flow networks although the tectonic network resulting directly from this horizontal compression has not spread westward beyond the Japan Sea.

Driving and driven architectures of directed small-world human brain functional networks.

PubMed

Yan, Chaogan; He, Yong

2011-01-01

Recently, increasing attention has been focused on the investigation of the human brain connectome that describes the patterns of structural and functional connectivity networks of the human brain. Many studies of the human connectome have demonstrated that the brain network follows a small-world topology with an intrinsically cohesive modular structure and includes several network hubs in the medial parietal regions. However, most of these studies have only focused on undirected connections between regions in which the directions of information flow are not taken into account. How the brain regions causally influence each other and how the directed network of human brain is topologically organized remain largely unknown. Here, we applied linear multivariate Granger causality analysis (GCA) and graph theoretical approaches to a resting-state functional MRI dataset with a large cohort of young healthy participants (n = 86) to explore connectivity patterns of the population-based whole-brain functional directed network. This directed brain network exhibited prominent small-world properties, which obviously improved previous results of functional MRI studies showing weak small-world properties in the directed brain networks in terms of a kernel-based GCA and individual analysis. This brain network also showed significant modular structures associated with 5 well known subsystems: fronto-parietal, visual, paralimbic/limbic, subcortical and primary systems. Importantly, we identified several driving hubs predominantly located in the components of the attentional network (e.g., the inferior frontal gyrus, supplementary motor area, insula and fusiform gyrus) and several driven hubs predominantly located in the components of the default mode network (e.g., the precuneus, posterior cingulate gyrus, medial prefrontal cortex and inferior parietal lobule). Further split-half analyses indicated that our results were highly reproducible between two independent subgroups. The current study demonstrated the directions of spontaneous information flow and causal influences in the directed brain networks, thus providing new insights into our understanding of human brain functional connectome.

Performance evaluation of multi-stratum resources optimization with network functions virtualization for cloud-based radio over optical fiber networks.

PubMed

Yang, Hui; He, Yongqi; Zhang, Jie; Ji, Yuefeng; Bai, Wei; Lee, Young

2016-04-18

Cloud radio access network (C-RAN) has become a promising scenario to accommodate high-performance services with ubiquitous user coverage and real-time cloud computing using cloud BBUs. In our previous work, we implemented cross stratum optimization of optical network and application stratums resources that allows to accommodate the services in optical networks. In view of this, this study extends to consider the multiple dimensional resources optimization of radio, optical and BBU processing in 5G age. We propose a novel multi-stratum resources optimization (MSRO) architecture with network functions virtualization for cloud-based radio over optical fiber networks (C-RoFN) using software defined control. A global evaluation scheme (GES) for MSRO in C-RoFN is introduced based on the proposed architecture. The MSRO can enhance the responsiveness to dynamic end-to-end user demands and globally optimize radio frequency, optical and BBU resources effectively to maximize radio coverage. The efficiency and feasibility of the proposed architecture are experimentally demonstrated on OpenFlow-based enhanced SDN testbed. The performance of GES under heavy traffic load scenario is also quantitatively evaluated based on MSRO architecture in terms of resource occupation rate and path provisioning latency, compared with other provisioning scheme.

Analyzing psychotherapy process as intersubjective sensemaking: an approach based on discourse analysis and neural networks.

PubMed

Nitti, Mariangela; Ciavolino, Enrico; Salvatore, Sergio; Gennaro, Alessandro

2010-09-01

The authors propose a method for analyzing the psychotherapy process: discourse flow analysis (DFA). DFA is a technique representing the verbal interaction between therapist and patient as a discourse network, aimed at measuring the therapist-patient discourse ability to generate new meanings through time. DFA assumes that the main function of psychotherapy is to produce semiotic novelty. DFA is applied to the verbatim transcript of the psychotherapy. It defines the main meanings active within the therapeutic discourse by means of the combined use of text analysis and statistical techniques. Subsequently, it represents the dynamic interconnections among these meanings in terms of a "discursive network." The dynamic and structural indexes of the discursive network have been shown to provide a valid representation of the patient-therapist communicative flow as well as an estimation of its clinical quality. Finally, a neural network is designed specifically to identify patterns of functioning of the discursive network and to verify the clinical validity of these patterns in terms of their association with specific phases of the psychotherapy process. An application of the DFA to a case of psychotherapy is provided to illustrate the method and the kinds of results it produces.

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)

Cellular automata model for traffic flow at intersections in internet of vehicles

NASA Astrophysics Data System (ADS)

Zhao, Han-Tao; Liu, Xin-Ru; Chen, Xiao-Xu; Lu, Jian-Cheng

2018-03-01

Considering the effect of the front vehicle's speed, the influence of the brake light and the conflict of the traffic flow, we established a cellular automata model called CE-NS for traffic flow at the intersection in the non-vehicle networking environment. According to the information interaction of Internet of Vehicles (IoV), introducing parameters describing the congestion and the accurate speed of the front vehicle into the CE-NS model, we improved the rules of acceleration, deceleration and conflict, and finally established a cellular automata model for traffic flow at intersections of IoV. The relationship between traffic parameters such as vehicle speed, flow and average travel time is obtained by numerical simulation of two models. Based on this, we compared the traffic situation of the non-vehicle networking environment with conditions of IoV environment, and analyzed the influence of the different degree of IoV on the traffic flow. The results show that the traffic speed is increased, the travel time is reduced, the flux of intersections is increased and the traffic flow is more smoothly under IoV environment. After the vehicle which achieves IoV reaches a certain proportion, the operation effect of the traffic flow begins to improve obviously.

Forecasting inundation from debris flows that grow during travel, with application to the Oregon Coast Range, USA

USGS Publications Warehouse

Reid, Mark E.; Coe, Jeffrey A.; Brien, Dianne

2016-01-01

Many debris flows increase in volume as they travel downstream, enhancing their mobility and hazard. Volumetric growth can result from diverse physical processes, such as channel sediment entrainment, stream bank collapse, adjacent landsliding, hillslope erosion and rilling, and coalescence of multiple debris flows; incorporating these varied phenomena into physics-based debris-flow models is challenging. As an alternative, we embedded effects of debris-flow growth into an empirical/statistical approach to forecast potential inundation areas within digital landscapes in a GIS framework. Our approach used an empirical debris-growth function to account for the effects of growth phenomena. We applied this methodology to a debris-flow-prone area in the Oregon Coast Range, USA, where detailed mapping revealed areas of erosion and deposition along paths of debris flows that occurred during a large storm in 1996. Erosion was predominant in stream channels with slopes > 5°. Using pre- and post-event aerial photography, we derived upslope contributing area and channel-length growth factors. Our method reproduced the observed inundation patterns produced by individual debris flows; it also generated reproducible, objective potential inundation maps for entire drainage networks. These maps better matched observations than those using previous methods that focus on proximal or distal regions of a drainage network.

Hydrodynamics and Connectivity of Channelized Floodplains: Insights from the Meandering East Fork White River, Indiana, USA

NASA Astrophysics Data System (ADS)

Czuba, J. A.; David, S. R.; Edmonds, D. A.

2017-12-01

High resolution topography reveals that meandering river floodplains in Indiana commonly have networks of channels. These floodplain channel networks are most prevalent in agricultural, low-gradient, wide floodplains. It appears that these networks are formed when floodplain channels connect oxbows to each other and the main river channel. Collectively, the channels in the floodplain create an interconnected network of pathways that convey water beginning at flows less than bankfull, and as stage increases, more of the floodplain becomes dissected by floodplain channels. In this work, we quantify the hydrodynamics and connectivity of the flow on the floodplain and in the main channel of the East Fork White River near Seymour, Indiana, USA. We constructed a two-dimensional numerical model using HECRAS of the river-floodplain system from LiDAR data and from main-channel river bathymetry to elucidate the behaviour of these floodplain channels across a range of flows. Model calibration and verification data included stage from a USGS gage, high-water marks at a high and medium flow, and an aerial photograph of inundation in the floodplain channels. The numerical model simulated flow depth and velocity, which was used to quantify connectivity of the floodplain channels, exchange between the main channel and floodplain channels, and residence time of water on the floodplain. Model simulations suggest that the floodplain channels convey roughly 50% of the total flow at what is typically considered "bankfull" flow. Overall, we present a process-based approach for analyzing complex floodplain-river systems where an individual floodplain-river system can be distilled down to a set of characteristic curves. Notably, we map the East Fork White River system to exchange-residence time space and argue that this characterization forms the basis for thinking about morphologic evolution (e.g., sediment deposition and erosion) and biogeochemistry (e.g., nitrate removal) in floodplain-river systems.

A Laminar Flow-Based Microfluidic Tesla Pump via Lithography Enabled 3D Printing.

PubMed

Habhab, Mohammed-Baker; Ismail, Tania; Lo, Joe Fujiou

2016-11-23

Tesla turbine and its applications in power generation and fluid flow were demonstrated by Nicholas Tesla in 1913. However, its real-world implementations were limited by the difficulty to maintain laminar flow between rotor disks, transient efficiencies during rotor acceleration, and the lack of other applications that fully utilize the continuous flow outputs. All of the aforementioned limits of Tesla turbines can be addressed by scaling to the microfluidic flow regime. Demonstrated here is a microscale Tesla pump designed and fabricated using a Digital Light Processing (DLP) based 3D printer with 43 µm lateral and 30 µm thickness resolutions. The miniaturized pump is characterized by low Reynolds number of 1000 and a flow rate of up to 12.6 mL/min at 1200 rpm, unloaded. It is capable of driving a mixer network to generate microfluidic gradient. The continuous, laminar flow from Tesla turbines is well-suited to the needs of flow-sensitive microfluidics, where the integrated pump will enable numerous compact lab-on-a-chip applications.

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...

An Application of Data Mining Techniques for Flood Forecasting: Application in Rivers Daya and Bhargavi, India

NASA Astrophysics Data System (ADS)

Panigrahi, Binay Kumar; Das, Soumya; Nath, Tushar Kumar; Senapati, Manas Ranjan

2018-05-01

In the present study, with a view to speculate the water flow of two rivers in eastern India namely river Daya and river Bhargavi, the focus was on developing Cascaded Functional Link Artificial Neural Network (C-FLANN) model. Parameters of C-FLANN architecture were updated using Harmony Search (HS) and Differential Evolution (DE). As the numbers of samples are very low, there is a risk of over fitting. To avoid this Map reduce based ANOVA technique is used to select important features. These features were used and provided to the architecture which is used to predict the water flow in both the rivers, one day, one week and two weeks ahead. The results of both the techniques were compared with Radial Basis Functional Neural Network (RBFNN) and Multilayer Perceptron (MLP), two widely used artificial neural network for prediction. From the result it was confirmed that C-FLANN trained through HS gives better prediction result than being trained through DE or RBFNN or MLP and can be used for predicting water flow in different rivers.

Dynamic optical resource allocation for mobile core networks with software defined elastic optical networking.

PubMed

Zhao, Yongli; Chen, Zhendong; Zhang, Jie; Wang, Xinbo

2016-07-25

Driven by the forthcoming of 5G mobile communications, the all-IP architecture of mobile core networks, i.e. evolved packet core (EPC) proposed by 3GPP, has been greatly challenged by the users' demands for higher data rate and more reliable end-to-end connection, as well as operators' demands for low operational cost. These challenges can be potentially met by software defined optical networking (SDON), which enables dynamic resource allocation according to the users' requirement. In this article, a novel network architecture for mobile core network is proposed based on SDON. A software defined network (SDN) controller is designed to realize the coordinated control over different entities in EPC networks. We analyze the requirement of EPC-lightpath (EPCL) in data plane and propose an optical switch load balancing (OSLB) algorithm for resource allocation in optical layer. The procedure of establishment and adjustment of EPCLs is demonstrated on a SDON-based EPC testbed with extended OpenFlow protocol. We also evaluate the OSLB algorithm through simulation in terms of bandwidth blocking ratio, traffic load distribution, and resource utilization ratio compared with link-based load balancing (LLB) and MinHops algorithms.

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.

The research of service provision based on service-oriented architecture for NGN

NASA Astrophysics Data System (ADS)

Jie, Yin; Nian, Zhou; Qian, Mao

2007-11-01

Service convergence is an important characteristic of NGN(Next Generation Networking). How to integrate the service capabilities of telecommunication network and Internet. At first, this article puts forward the concepts and characteristics of SOA (Service-Oriented Architecture) and Web Service, then discusses relationship between them. Secondly, combined with five kinds of Service Provision in NGN, A service platform architecture design of NGN and a service development mode based on SOA are brought up. At last, a specific example is analyzed with BPEL (Business Process Execution Language) in order to describe service development flow based on SOA for NGN.

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.

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.

Non-Newtonian fluid flow in 2D fracture networks

NASA Astrophysics Data System (ADS)

Zou, L.; Håkansson, U.; Cvetkovic, V.

2017-12-01

Modeling of non-Newtonian fluid (e.g., drilling fluids and cement grouts) flow in fractured rocks is of interest in many geophysical and industrial practices, such as drilling operations, enhanced oil recovery and rock grouting. In fractured rock masses, the flow paths are dominated by fractures, which are often represented as discrete fracture networks (DFN). In the literature, many studies have been devoted to Newtonian fluid (e.g., groundwater) flow in fractured rock using the DFN concept, but few works are dedicated to non-Newtonian fluids.In this study, a generalized flow equation for common non-Newtonian fluids (such as Bingham, power-law and Herschel-Bulkley) in a single fracture is obtained from the analytical solutions for non-Newtonian fluid discharge between smooth parallel plates. Using Monte Carlo sampling based on site characterization data for the distribution of geometrical features (e.g., density, length, aperture and orientations) in crystalline fractured rock, a two dimensional (2D) DFN model is constructed for generic flow simulations. Due to complex properties of non-Newtonian fluids, the relationship between fluid discharge and the pressure gradient is nonlinear. A Galerkin finite element method solver is developed to iteratively solve the obtained nonlinear governing equations for the 2D DFN model. Using DFN realizations, simulation results for different geometrical distributions of the fracture network and different non-Newtonian fluid properties are presented to illustrate the spatial discharge distributions. The impact of geometrical structures and the fluid properties on the non-Newtonian fluid flow in 2D DFN is examined statistically. The results generally show that modeling non-Newtonian fluid flow in fractured rock as a DFN is feasible, and that the discharge distribution may be significantly affected by the geometrical structures as well as by the fluid constitutive properties.

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.

How Did the Information Flow in the #AlphaGo Hashtag Network? A Social Network Analysis of the Large-Scale Information Network on Twitter.

PubMed

Kim, Jinyoung

2017-12-01

As it becomes common for Internet users to use hashtags when posting and searching information on social media, it is important to understand who builds a hashtag network and how information is circulated within the network. This article focused on unlocking the potential of the #AlphaGo hashtag network by addressing the following questions. First, the current study examined whether traditional opinion leadership (i.e., the influentials hypothesis) or grassroot participation by the public (i.e., the interpersonal hypothesis) drove dissemination of information in the hashtag network. Second, several unique patterns of information distribution by key users were identified. Finally, the association between attributes of key users who exerted great influence on information distribution (i.e., the number of followers and follows) and their central status in the network was tested. To answer the proffered research questions, a social network analysis was conducted using a large-scale hashtag network data set from Twitter (n = 21,870). The results showed that the leading actors in the network were actively receiving information from their followers rather than serving as intermediaries between the original information sources and the public. Moreover, the leading actors played several roles (i.e., conversation starters, influencers, and active engagers) in the network. Furthermore, the number of their follows and followers were significantly associated with their central status in the hashtag network. Based on the results, the current research explained how the information was exchanged in the hashtag network by proposing the reciprocal model of information flow.

Sonification of network traffic flow for monitoring and situational awareness

PubMed Central

2018-01-01

Maintaining situational awareness of what is happening within a computer network is challenging, not only because the behaviour happens within machines, but also because data traffic speeds and volumes are beyond human ability to process. Visualisation techniques are widely used to present information about network traffic dynamics. Although they provide operators with an overall view and specific information about particular traffic or attacks on the network, they often still fail to represent the events in an understandable way. Also, because they require visual attention they are not well suited to continuous monitoring scenarios in which network administrators must carry out other tasks. Here we present SoNSTAR (Sonification of Networks for SiTuational AwaReness), a real-time sonification system for monitoring computer networks to support network administrators’ situational awareness. SoNSTAR provides an auditory representation of all the TCP/IP traffic within a network based on the different traffic flows between between network hosts. A user study showed that SoNSTAR raises situational awareness levels by enabling operators to understand network behaviour and with the benefit of lower workload demands (as measured by the NASA TLX method) than visual techniques. SoNSTAR identifies network traffic features by inspecting the status flags of TCP/IP packet headers. Combinations of these features define particular traffic events which are mapped to recorded sounds to generate a soundscape that represents the real-time status of the network traffic environment. The sequence, timing, and loudness of the different sounds allow the network to be monitored and anomalous behaviour to be detected without the need to continuously watch a monitor screen. PMID:29672543

Sonification of network traffic flow for monitoring and situational awareness.

PubMed

Debashi, Mohamed; Vickers, Paul

2018-01-01

Maintaining situational awareness of what is happening within a computer network is challenging, not only because the behaviour happens within machines, but also because data traffic speeds and volumes are beyond human ability to process. Visualisation techniques are widely used to present information about network traffic dynamics. Although they provide operators with an overall view and specific information about particular traffic or attacks on the network, they often still fail to represent the events in an understandable way. Also, because they require visual attention they are not well suited to continuous monitoring scenarios in which network administrators must carry out other tasks. Here we present SoNSTAR (Sonification of Networks for SiTuational AwaReness), a real-time sonification system for monitoring computer networks to support network administrators' situational awareness. SoNSTAR provides an auditory representation of all the TCP/IP traffic within a network based on the different traffic flows between between network hosts. A user study showed that SoNSTAR raises situational awareness levels by enabling operators to understand network behaviour and with the benefit of lower workload demands (as measured by the NASA TLX method) than visual techniques. SoNSTAR identifies network traffic features by inspecting the status flags of TCP/IP packet headers. Combinations of these features define particular traffic events which are mapped to recorded sounds to generate a soundscape that represents the real-time status of the network traffic environment. The sequence, timing, and loudness of the different sounds allow the network to be monitored and anomalous behaviour to be detected without the need to continuously watch a monitor screen.

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

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

Hyman, Jeffrey De'Haven; Hagberg, Aric Arild; Mohd-Yusof, Jamaludin

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths.more » First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.« less

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

DOE PAGES

Hyman, Jeffrey De'Haven; Hagberg, Aric Arild; Mohd-Yusof, Jamaludin; ...

2017-07-10

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths.more » First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.« 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 ),

Flow model for open-channel reach or network

USGS Publications Warehouse

Schaffranek, R.W.

1987-01-01

Formulation of a one-dimensional model for simulating unsteady flow in a single open-channel reach or in a network of interconnected channels is presented. 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. It is based on a four-point (box), implicit, finite-difference approximation of the governing nonlinear flow equations with user-definable weighting coefficients to permit varying the solution scheme from box-centered to fully forward. Unique transformation equations are formulated that permit correlation of the unknowns at the extremities of the channels, thereby reducing coefficient matrix and execution time requirements. Discharges and water-surface elevations computed at intermediate locations within a channel are determined following solution of the transformation equations. The matrix of transformation and boundary-condition equations is solved by Gauss elimination using maximum pivot strategy. Two diverse applications of the model are presented to illustrate its broad utility. (USGS)

Multiport power router and its impact on future smart grids

NASA Astrophysics Data System (ADS)

Kado, Yuichi; Shichijo, Daiki; Wada, Keiji; Iwatsuki, Katsumi

2016-07-01

We propose a Y configuration power router as a unit cell to easily construct a power delivery system that can meet many types of user requirements. The Y configuration power router controls the direction and magnitude of power flows between three ports regardless of DC or AC. We constructed a prototype three-way isolated DC/DC converter that is the core unit of the Y configuration power router. The electrical insulation between three ports assures safety and reliability for power network systems. We then tested the operation of power flow control. The experimental results revealed that our methodology based on a governing equation was appropriate to control the power flow of the three-way DC/DC converter. In addition, a distribution network composed of power routers had the ability to easily enable interchanges of electrical power between autonomous microgrid cells. We also explored the requirements for communication between energy routers to achieve dynamic adjustments of energy flows in a coordinated manner and their impact on resilient power grid systems.

Catchment organisation, free energy dynamics and network control on critical zone water flows

NASA Astrophysics Data System (ADS)

Zehe, E.; Ehret, U.; Kleidon, A.; Jackisch, C.; Scherer, U.; Blume, T.

2012-04-01

From a functional point of view the catchment system is compiled by patterns of permeable and less permeable textural elements - soils and mother rock. Theses textural elements provide a mechanical stabile matrix for growth of terrestrial biota and soil formation. They furthermore organize subsurface storage of water against gravity, dissolved nutrients and heat. Storage against gravity is only possible because water acts as wetting fluid and is thus attracted by capillary forces in the pores space. Capillarity increases non-linearly with decreasing pore size and is zero at local saturation. The pore size distribution of a soil is thus characteristic of its capability to store water against losses such as drainage, evaporation and root extraction and at the same time a fingerprint of the work that has been performed by physical, chemical and biological processes to weather solid mother rock and form a soil. A strong spatial covariance of soil hydraulic properties within the same soil type is due to a fingerprint of strong spatial organization at small scales. Spatial organization at the hillslope scale implies the existence of a typical soil catena i.e. that hillslopes exhibit the same/ downslope sequence of different soils types. Textural storage elements are separated by strikingly self-similar network like structures, we name them flow structures. These flow structures are created in a self-reinforcing manner by work performed either by biota like earth worms and plant roots or by dissipative processes such as soil cracking and water/fluvial erosion. Regardless of their different origin connected flow structures exhibit a highly similar functioning and similar characteristics: they allow for high mass flows at small driving potential gradients because specific flow resistance along the network is continuously very small. This implies temporal stability even during small extremes, due to the small amount of local momentum dissipation per unit mass flow, as well as that these flow structures organize and dominate flows of water, dissolved matter and sediments during rainfall driven conditions at various scales: - Surface connected vertical flow structures of anecic worm burrows or soil cracks organize and dominated vertical flows at the plot scale - this is usually referred to as preferential flow; - Rill networks at the soil surface organise and dominate hillslope scale overland flow response and sediment yields; - Subsurface pipe networks at the bedrock interface organize and dominate hillslope scale lateral subsurface water and tracer flows; - The river net organizes and dominates flows of water, dissolved matter and sediments to the catchment outlet and finally across continental gradients to the sea. Fundamental progress with respect to the parameterization of hydrological models, subscale flow networks and to understand the adaptation of hydro-geo ecosystems to change could be achieved by discovering principles that govern the organization of catchments flow networks in particular at least during steady state conditions. This insight has inspired various scientists to suggest principles for organization of ecosystems, landscapes and flow networks; as Bejans constructural law, Minimum Energy Expenditure , Maximum Entropy Production. In line with these studies we suggest that a thermodynamic/energetic treatment of the catchment is might be a key for understanding the underlying principles that govern organisation of flow and transport. Our approach is to employ a) physically based hydrological model that address at least all the relevant hydrological processes in the critical zone in a coupled way, behavioural representations of the observed organisation of flow structures and textural elements, that are consistent with observations in two well investigated research catchments and have been tested against distributed observations of soil moisture and catchment scale discharge; to simulate the full concert of hydrological processes using the behavioural system architecture and small perturbations and compare them with respect to their efficiency to dissipate free energy which is equivalent to produce entropy. The study will present the underlying theory and discuss simulation results with respect to the following core hypotheses: H1: A macro scale configuration of a hydro-geo-ecosystem, is in stationary non equilibrium closer to a functional optimum as other possible configurations, if it "dissipates" more of the available free energy to maintain the stationary cycles that redistribute and export mass and energy within/from the system. This implies (I1) that the system approaches faster a dynamic equilibrium state characterised by a minimum in free energy, and less free energy from persistent gradients is available to perform work in the system. H2: Macroscopically connected flow networks enhance redistribution of mass against macroscale gradients and thus dissipation of free energy, because they minimise local energy dissipation per unit mass flow along the flow path. This implies (I2) mechanic stability of the flow network, of the textural storage elements and thus of the entire system against frequent disturbances under stationary conditions.

The prediction of shallow landslide location and size using a multidimensional landslide analysis in a digital terrain model

Treesearch

W. E. Dietrich; J. McKean; D. Bellugi; T. Perron

2007-01-01

Shallow landslides on steep slopes often mobilize as debris flows. The size of the landslide controls the initial size of the debris flows, defines the sediment discharge to the channel network, affects rates and scales of landform development, and influences the relative hazard potential. Currently the common practice in digital terrain-based models is to set the...

Peak-flow frequency relations and evaluation of the peak-flow gaging network in Nebraska

USGS Publications Warehouse

Soenksen, Philip J.; Miller, Lisa D.; Sharpe, Jennifer B.; Watton, Jason R.

1999-01-01

Estimates of peak-flow magnitude and frequency are required for the efficient design of structures that convey flood flows or occupy floodways, such as bridges, culverts, and roads. The U.S. Geological Survey, in cooperation with the Nebraska Department of Roads, conducted a study to update peak-flow frequency analyses for selected streamflow-gaging stations, develop a new set of peak-flow frequency relations for ungaged streams, and evaluate the peak-flow gaging-station network for Nebraska. Data from stations located in or within about 50 miles of Nebraska were analyzed using guidelines of the Interagency Advisory Committee on Water Data in Bulletin 17B. New generalized skew relations were developed for use in frequency analyses of unregulated streams. Thirty-three drainage-basin characteristics related to morphology, soils, and precipitation were quantified using a geographic information system, related computer programs, and digital spatial data.For unregulated streams, eight sets of regional regression equations relating drainage-basin to peak-flow characteristics were developed for seven regions of the state using a generalized least squares procedure. Two sets of regional peak-flow frequency equations were developed for basins with average soil permeability greater than 4 inches per hour, and six sets of equations were developed for specific geographic areas, usually based on drainage-basin boundaries. Standard errors of estimate for the 100-year frequency equations (1percent probability) ranged from 12.1 to 63.8 percent. For regulated reaches of nine streams, graphs of peak flow for standard frequencies and distance upstream of the mouth were estimated.The regional networks of streamflow-gaging stations on unregulated streams were analyzed to evaluate how additional data might affect the average sampling errors of the newly developed peak-flow equations for the 100-year frequency occurrence. Results indicated that data from new stations, rather than more data from existing stations, probably would produce the greatest reduction in average sampling errors of the equations.

Spreading Effect in Industrial Complex Network Based on Revised Structural Holes Theory

PubMed Central

Ye, Qing; Guan, Jun

2016-01-01

This paper analyzed the spreading effect of industrial sectors with complex network model under perspective of econophysics. Input-output analysis, as an important research tool, focuses more on static analysis. However, the fundamental aim of industry analysis is to figure out how interaction between different industries makes impacts on economic development, which turns out to be a dynamic process. Thus, industrial complex network based on input-output tables from WIOD is proposed to be a bridge connecting accurate static quantitative analysis and comparable dynamic one. With application of revised structural holes theory, flow betweenness and random walk centrality were respectively chosen to evaluate industrial sectors’ long-term and short-term spreading effect process in this paper. It shows that industries with higher flow betweenness or random walk centrality would bring about more intensive industrial spreading effect to the industrial chains they stands in, because value stream transmission of industrial sectors depends on how many products or services it can get from the other ones, and they are regarded as brokers with bigger information superiority and more intermediate interests. PMID:27218468

Spreading Effect in Industrial Complex Network Based on Revised Structural Holes Theory.

PubMed

Xing, Lizhi; Ye, Qing; Guan, Jun

2016-01-01

This paper analyzed the spreading effect of industrial sectors with complex network model under perspective of econophysics. Input-output analysis, as an important research tool, focuses more on static analysis. However, the fundamental aim of industry analysis is to figure out how interaction between different industries makes impacts on economic development, which turns out to be a dynamic process. Thus, industrial complex network based on input-output tables from WIOD is proposed to be a bridge connecting accurate static quantitative analysis and comparable dynamic one. With application of revised structural holes theory, flow betweenness and random walk centrality were respectively chosen to evaluate industrial sectors' long-term and short-term spreading effect process in this paper. It shows that industries with higher flow betweenness or random walk centrality would bring about more intensive industrial spreading effect to the industrial chains they stands in, because value stream transmission of industrial sectors depends on how many products or services it can get from the other ones, and they are regarded as brokers with bigger information superiority and more intermediate interests.

Cascading failures in interconnected networks with dynamical redistribution of loads

NASA Astrophysics Data System (ADS)

Zhao, Zhuang; Zhang, Peng; Yang, Hujiang

2015-09-01

Cascading failures of loads in isolated networks and coupled networks have been studied in the past few years. In most of the corresponding results, the topologies of the networks are destroyed. Here, we present an interconnected network model considering cascading failures based on the dynamic redistribution of flow in the networks. Compared with the results of single scale-free networks, we find that interconnected scale-free networks have higher vulnerability. Additionally, the network heterogeneity plays an important role in the robustness of interconnected networks under intentional attacks. Considering the effects of various coupling preferences, the results show that there are almost no differences. Finally, the application of our model to the Beijing interconnected traffic network, which consists of a subway network and a bus network, shows that the subway network suffers more damage under the attack. Moreover, the interconnected traffic network may be more exposed to damage after initial attacks on the bus network. These discussions are important for the design and optimization of interconnected networks.

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.

Identification of critical paralog groups with indispensable roles in the regulation of signaling flow

PubMed Central

Modos, Dezso; Brooks, Johanne; Fazekas, David; Ari, Eszter; Vellai, Tibor; Csermely, Peter; Korcsmaros, Tamas; Lenti, Katalin

2016-01-01

Extensive cross-talk between signaling pathways is required to integrate the myriad of extracellular signal combinations at the cellular level. Gene duplication events may lead to the emergence of novel functions, leaving groups of similar genes - termed paralogs - in the genome. To distinguish critical paralog groups (CPGs) from other paralogs in human signaling networks, we developed a signaling network-based method using cross-talk annotation and tissue-specific signaling flow analysis. 75 CPGs were found with higher degree, betweenness centrality, closeness, and ‘bowtieness’ when compared to other paralogs or other proteins in the signaling network. CPGs had higher diversity in all these measures, with more varied biological functions and more specific post-transcriptional regulation than non-critical paralog groups (non-CPG). Using TGF-beta, Notch and MAPK pathways as examples, SMAD2/3, NOTCH1/2/3 and MEK3/6-p38 CPGs were found to regulate the signaling flow of their respective pathways. Additionally, CPGs showed a higher mutation rate in both inherited diseases and cancer, and were enriched in drug targets. In conclusion, the results revealed two distinct types of paralog groups in the signaling network: CPGs and non-CPGs. Thus highlighting the importance of CPGs as compared to non-CPGs in drug discovery and disease pathogenesis. PMID:27922122

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.

Economic model for QoS guarantee on the Internet

NASA Astrophysics Data System (ADS)

Zhang, Chi; Wei, Jiaolong

2001-09-01

This paper describes a QoS guarantee architecture suited for best-effort environments, based on ideas from microeconomics and non-cooperative game theory. First, an analytic model is developed for the study of the resource allocation in the Internet. Then we show that with a simple pricing mechanism (from network implementation and users' points-of-view), we were able to provide QoS guarantee at per flow level without resource allocation or complicated scheduling mechanisms or maintaining per flow state in the core network. Unlike the previous work on this area, we extend the basic model to support inelastic applications which require minimum bandwidth guarantees for a given time period by introducing derivative market.

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.

Two betweenness centrality measures based on Randomized Shortest Paths

PubMed Central

Kivimäki, Ilkka; Lebichot, Bertrand; Saramäki, Jari; Saerens, Marco

2016-01-01

This paper introduces two new closely related betweenness centrality measures based on the Randomized Shortest Paths (RSP) framework, which fill a gap between traditional network centrality measures based on shortest paths and more recent methods considering random walks or current flows. The framework defines Boltzmann probability distributions over paths of the network which focus on the shortest paths, but also take into account longer paths depending on an inverse temperature parameter. RSP’s have previously proven to be useful in defining distance measures on networks. In this work we study their utility in quantifying the importance of the nodes of a network. The proposed RSP betweenness centralities combine, in an optimal way, the ideas of using the shortest and purely random paths for analysing the roles of network nodes, avoiding issues involving these two paradigms. We present the derivations of these measures and how they can be computed in an efficient way. In addition, we show with real world examples the potential of the RSP betweenness centralities in identifying interesting nodes of a network that more traditional methods might fail to notice. PMID:26838176

Autoblocker: a system for detecting and blocking of network scanning based on analysis of netflow data

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

Bobyshev, A.; Lamore, D.; Demar, P.

2004-12-01

In a large campus network, such at Fermilab, with tens of thousands of nodes, scanning initiated from either outside of or within the campus network raises security concerns. This scanning may have very serious impact on network performance, and even disrupt normal operation of many services. In this paper we introduce a system for detecting and automatic blocking excessive traffic of different kinds of scanning, DoS attacks, virus infected computers. The system, called AutoBlocker, is a distributed computing system based on quasi-real time analysis of network flow data collected from the border router and core switches. AutoBlocker also has anmore » interface to accept alerts from IDS systems (e.g. BRO, SNORT) that are based on other technologies. The system has multiple configurable alert levels for the detection of anomalous behavior and configurable trigger criteria for automated blocking of scans at the core or border routers. It has been in use at Fermilab for about 2 years, and has become a very valuable tool to curtail scan activity within the Fermilab campus network.« less

Optical interconnection network for parallel access to multi-rank memory in future computing systems.

PubMed

Wang, Kang; Gu, Huaxi; Yang, Yintang; Wang, Kun

2015-08-10

With the number of cores increasing, there is an emerging need for a high-bandwidth low-latency interconnection network, serving core-to-memory communication. In this paper, aiming at the goal of simultaneous access to multi-rank memory, we propose an optical interconnection network for core-to-memory communication. In the proposed network, the wavelength usage is delicately arranged so that cores can communicate with different ranks at the same time and broadcast for flow control can be achieved. A distributed memory controller architecture that works in a pipeline mode is also designed for efficient optical communication and transaction address processes. The scaling method and wavelength assignment for the proposed network are investigated. Compared with traditional electronic bus-based core-to-memory communication, the simulation results based on the PARSEC benchmark show that the bandwidth enhancement and latency reduction are apparent.

Scalable software-defined optical networking with high-performance routing and wavelength assignment algorithms.

PubMed

Lee, Chankyun; Cao, Xiaoyuan; Yoshikane, Noboru; Tsuritani, Takehiro; Rhee, June-Koo Kevin

2015-10-19

The feasibility of software-defined optical networking (SDON) for a practical application critically depends on scalability of centralized control performance. The paper, highly scalable routing and wavelength assignment (RWA) algorithms are investigated on an OpenFlow-based SDON testbed for proof-of-concept demonstration. Efficient RWA algorithms are proposed to achieve high performance in achieving network capacity with reduced computation cost, which is a significant attribute in a scalable centralized-control SDON. The proposed heuristic RWA algorithms differ in the orders of request processes and in the procedures of routing table updates. Combined in a shortest-path-based routing algorithm, a hottest-request-first processing policy that considers demand intensity and end-to-end distance information offers both the highest throughput of networks and acceptable computation scalability. We further investigate trade-off relationship between network throughput and computation complexity in routing table update procedure by a simulation study.

Discovering urban mobility patterns with PageRank based traffic modeling and prediction

NASA Astrophysics Data System (ADS)

Wang, Minjie; Yang, Su; Sun, Yi; Gao, Jun

2017-11-01

Urban transportation system can be viewed as complex network with time-varying traffic flows as links to connect adjacent regions as networked nodes. By computing urban traffic evolution on such temporal complex network with PageRank, it is found that for most regions, there exists a linear relation between the traffic congestion measure at present time and the PageRank value of the last time. Since the PageRank measure of a region does result from the mutual interactions of the whole network, it implies that the traffic state of a local region does not evolve independently but is affected by the evolution of the whole network. As a result, the PageRank values can act as signatures in predicting upcoming traffic congestions. We observe the aforementioned laws experimentally based on the trajectory data of 12000 taxies in Beijing city for one month.

Modeling of workflow-engaged networks on radiology transfers across a metro network.

PubMed

Camorlinga, Sergio; Schofield, Bruce

2006-04-01

Radiology metro networks bear the challenging proposition of interconnecting several hospitals in a region to provide a comprehensive diagnostic imaging service. Consequences of a poorly designed and implemented metro network could cause delays or no access at all when health care providers try to retrieve medical cases across the network. This could translate into limited diagnostic services to patients, resulting in negative impacts to the patients' medical treatment. A workflow-engaged network (WEN) is a new network paradigm. A WEN appreciates radiology workflows and priorities in using the network. A WEN greatly improves the network performance by guaranteeing that critical image transfers experience minimal delay. It adjusts network settings to ensure the application's requirements are met. This means that high-priority image transfers will have guaranteed and known delay times, whereas lower-priority traffic will have increased delays. This paper introduces a modeling to understand the benefits that WEN brings to a radiology metro network. The modeling uses actual data patterns and flows found in a hospital metro region. The workflows considered are based on the Integrating the Healthcare Enterprise profiles. This modeling has been applied to metropolitan workflows of a health region. The modeling helps identify the kind of metro network that supports data patterns and flows in a metro area. The results of the modeling show that a 155-Mb/s metropolitan area network (MAN) with WEN operates virtually equal to a normal 622-Mb/s MAN without WEN, with potential cost savings for leased line services measured in the millions of dollars per year.

Migratory connectivity magnifies the consequences of habitat loss from sea-level rise for shorebird populations.

PubMed

Iwamura, Takuya; Possingham, Hugh P; Chadès, Iadine; Minton, Clive; Murray, Nicholas J; Rogers, Danny I; Treml, Eric A; Fuller, Richard A

2013-06-22

Sea-level rise (SLR) will greatly alter littoral ecosystems, causing habitat change and loss for coastal species. Habitat loss is widely used as a measurement of the risk of extinction, but because many coastal species are migratory, the impact of habitat loss will depend not only on its extent, but also on where it occurs. Here, we develop a novel graph-theoretic approach to measure the vulnerability of a migratory network to the impact of habitat loss from SLR based on population flow through the network. We show that reductions in population flow far exceed the proportion of habitat lost for 10 long-distance migrant shorebirds using the East Asian-Australasian Flyway. We estimate that SLR will inundate 23-40% of intertidal habitat area along their migration routes, but cause a reduction in population flow of up to 72 per cent across the taxa. This magnifying effect was particularly strong for taxa whose migration routes contain bottlenecks-sites through which a large fraction of the population travels. We develop the bottleneck index, a new network metric that positively correlates with the predicted impacts of habitat loss on overall population flow. Our results indicate that migratory species are at greater risk than previously realized.

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

[Characterization of access to normal childbirth care in Bahia State, Brazil, based on graph theory].

PubMed

Sousa, Ludmilla Monfort Oliveira; Araújo, Edna Maria de; Miranda, José Garcia Vivas

2017-12-18

Origin-destination flow is a phenomenon that can be modeled as a network. Graph theory is a mathematical tool to characterize a network and thus allows studying the topological properties and temporal and spatial development of a set of related elements. The article aims to estimate the topological evolution of an inter-municipal network of normal deliveries. We selected the admissions for normal deliveries in the Hospital Information System of the Brazilian Unified National Health System, from 2008 to 2014, for women residing in Bahia State, Brazil. The following indices were applied: entry degree (from how many municipalities the women came for childbirth), exit degree (to how many municipalities they left), entry flow (how many women came), exit flow (how many women left), and the mean size of the exit edge (distance traveled). Analyses between macro-regions used the following indicators: proportion of normal deliveries performed outside the municipality of residence and mean size of the exit edge. The results indicate an increase in deliveries performed outside the municipality of residence, in addition to the persistence of concentration of deliveries in the hub municipalities in the Health Regions, and an increase in the distance between the municipality of residence and the municipality where the delivery took place. The organization of networks for normal childbirth poses an on-going challenge. It is important to analyze the flow of women for childbirth care in order to support the establishment of inter-municipal references to guarantee safe labor and childbirth. In conclusion, it is necessary to develop a regionalized network to meet the demand by pregnant women in the territory with universal and equitable coverage.

Design of artificial neural networks using a genetic algorithm to predict collection efficiency in venturi scrubbers.

PubMed

Taheri, Mahboobeh; Mohebbi, Ali

2008-08-30

In this study, a new approach for the auto-design of neural networks, based on a genetic algorithm (GA), has been used to predict collection efficiency in venturi scrubbers. The experimental input data, including particle diameter, throat gas velocity, liquid to gas flow rate ratio, throat hydraulic diameter, pressure drop across the venturi scrubber and collection efficiency as an output, have been used to create a GA-artificial neural network (ANN) model. The testing results from the model are in good agreement with the experimental data. Comparison of the results of the GA optimized ANN model with the results from the trial-and-error calibrated ANN model indicates that the GA-ANN model is more efficient. Finally, the effects of operating parameters such as liquid to gas flow rate ratio, throat gas velocity, and particle diameter on collection efficiency were determined.

Voltage collapse in complex power grids

PubMed Central

Simpson-Porco, John W.; Dörfler, Florian; Bullo, Francesco

2016-01-01

A large-scale power grid's ability to transfer energy from producers to consumers is constrained by both the network structure and the nonlinear physics of power flow. Violations of these constraints have been observed to result in voltage collapse blackouts, where nodal voltages slowly decline before precipitously falling. However, methods to test for voltage collapse are dominantly simulation-based, offering little theoretical insight into how grid structure influences stability margins. For a simplified power flow model, here we derive a closed-form condition under which a power network is safe from voltage collapse. The condition combines the complex structure of the network with the reactive power demands of loads to produce a node-by-node measure of grid stress, a prediction of the largest nodal voltage deviation, and an estimate of the distance to collapse. We extensively test our predictions on large-scale systems, highlighting how our condition can be leveraged to increase grid stability margins. PMID:26887284

Virtual CO2 Emission Flows in the Global Electricity Trade Network.

PubMed

Qu, Shen; Li, Yun; Liang, Sai; Yuan, Jiahai; Xu, Ming

2018-06-05

Quantifying greenhouse gas emissions due to electricity consumption is crucial for climate mitigation in the electric power sector. Current practices primarily use production-based emission factors to quantify emissions for electricity consumption, assuming production and consumption of electricity take place within the same region. The increasingly intensified cross-border electricity trade complicates the accounting for emissions of electricity consumption. This study employs a network approach to account for the flows in the whole electricity trade network to estimate CO 2 emissions of electricity consumption for 137 major countries/regions in 2014. Results show that in some countries, especially those in Europe and Southern Africa, the impacts of electricity trade on the estimation of emission factors and embodied emissions are significant. The changes made to emission factors by considering intergrid electricity trade can have significant implications for emission accounting and climate mitigation when multiplied by total electricity consumption of the corresponding countries/regions.

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.

Optimization of Turbine Blade Design for Reusable Launch Vehicles

NASA Technical Reports Server (NTRS)

Shyy, Wei

1998-01-01

To facilitate design optimization of turbine blade shape for reusable launching vehicles, appropriate techniques need to be developed to process and estimate the characteristics of the design variables and the response of the output with respect to the variations of the design variables. The purpose of this report is to offer insight into developing appropriate techniques for supporting such design and optimization needs. Neural network and polynomial-based techniques are applied to process aerodynamic data obtained from computational simulations for flows around a two-dimensional airfoil and a generic three- dimensional wing/blade. For the two-dimensional airfoil, a two-layered radial-basis network is designed and trained. The performances of two different design functions for radial-basis networks, one based on the accuracy requirement, whereas the other one based on the limit on the network size. While the number of neurons needed to satisfactorily reproduce the information depends on the size of the data, the neural network technique is shown to be more accurate for large data set (up to 765 simulations have been used) than the polynomial-based response surface method. For the three-dimensional wing/blade case, smaller aerodynamic data sets (between 9 to 25 simulations) are considered, and both the neural network and the polynomial-based response surface techniques improve their performance as the data size increases. It is found while the relative performance of two different network types, a radial-basis network and a back-propagation network, depends on the number of input data, the number of iterations required for radial-basis network is less than that for the back-propagation network.

Visualizing and measuring flow in shale matrix using in situ synchrotron X-ray microtomography

NASA Astrophysics Data System (ADS)

Kohli, A. H.; Kiss, A. M.; Kovscek, A. R.; Bargar, J.

2017-12-01

Natural gas production via hydraulic fracturing of shale has proliferated on a global scale, yet recovery factors remain low because production strategies are not based on the physics of flow in shale reservoirs. In particular, the physical mechanisms and time scales of depletion from the matrix into the simulated fracture network are not well understood, limiting the potential to optimize operations and reduce environmental impacts. Studying matrix flow is challenging because shale is heterogeneous and has porosity from the μm- to nm-scale. Characterizing nm-scale flow paths requires electron microscopy but the limited field of view does not capture the connectivity and heterogeneity observed at the mm-scale. Therefore, pore-scale models must link to larger volumes to simulate flow on the reservoir-scale. Upscaled models must honor the physics of flow, but at present there is a gap between cm-scale experiments and μm-scale simulations based on ex situ image data. To address this gap, we developed a synchrotron X-ray microscope with an in situ cell to simultaneously visualize and measure flow. We perform coupled flow and microtomography experiments on mm-scale samples from the Barnett, Eagle Ford and Marcellus reservoirs. We measure permeability at various pressures via the pulse-decay method to quantify effective stress dependence and the relative contributions of advective and diffusive mechanisms. Images at each pressure step document how microfractures, interparticle pores, and organic matter change with effective stress. Linking changes in the pore network to flow measurements motivates a physical model for depletion. To directly visualize flow, we measure imbibition rates using inert, high atomic number gases and image periodically with monochromatic beam. By imaging above/below X-ray adsorption edges, we magnify the signal of gas saturation in μm-scale porosity and nm-scale, sub-voxel features. Comparing vacuumed and saturated states yields image-based measurements of the distribution and time scales of imbibition. We also characterize nm-scale structure via focused ion beam tomography to quantify sub-voxel porosity and connectivity. The multi-scale image and flow data is used to develop a framework to upscale and benchmark pore-scale models.

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

Explore the Impacts of River Flow and Water Quality on Fish Communities

NASA Astrophysics Data System (ADS)

Tsai, W. P.; Chang, F. J.; Lin, C. Y.; Hu, J. H.; Yu, C. J.; Chu, T. J.

2015-12-01

Owing to the limitation of geographical environment in Taiwan, the uneven temporal and spatial distribution of rainfall would cause significant impacts on river ecosystems. To pursue sustainable water resources development, integrity and rationality is important to water management planning. The water quality and the flow regimes of rivers are closely related to each other and affect river ecosystems simultaneously. Therefore, this study collects long-term observational heterogeneity data, which includes water quality parameters, stream flow and fish species in the Danshui River of norther Taiwan, and aims to explore the complex impacts of water quality and flow regime on fish communities in order to comprehend the situations of the eco-hydrological system in this river basin. First, this study improves the understanding of the relationship between water quality parameters, flow regime and fish species by using artificial neural networks (ANNs). The Self-organizing feature map (SOM) is an unsupervised learning process used to cluster, analyze and visualize a large number of data. The results of SOM show that nine clusters (3x3) forms the optimum map size based on the local minimum values of both quantization error (QE) and topographic error (TE). Second, the fish diversity indexes are estimated by using the Adapted network-based fuzzy inference system (ANFIS) based on key input factors determined by the Gamma Test (GT), which is a useful tool for reducing model dimension and the structure complexity of ANNs. The result reveals that the constructed models can effectively estimate fish diversity indexes and produce good estimation performance based on the 9 clusters identified by the SOM, in which RMSE is 0.18 and CE is 0.84 for the training data set while RMSE is 0.20 and CE is 0.80 for the testing data set.

Fuzzy-driven energy storage system for mitigating voltage unbalance factor on distribution network with photovoltaic system

NASA Astrophysics Data System (ADS)

Wong, Jianhui; Lim, Yun Seng; Morris, Stella; Morris, Ezra; Chua, Kein Huat

2017-04-01

The amount of small-scaled renewable energy sources is anticipated to increase on the low-voltage distribution networks for the improvement of energy efficiency and reduction of greenhouse gas emission. The growth of the PV systems on the low-voltage distribution networks can create voltage unbalance, voltage rise, and reverse-power flow. Usually these issues happen with little fluctuation. However, it tends to fluctuate severely as Malaysia is a region with low clear sky index. A large amount of clouds often passes over the country, hence making the solar irradiance to be highly scattered. Therefore, the PV power output fluctuates substantially. These issues can lead to the malfunction of the electronic based equipment, reduction in the network efficiency and improper operation of the power protection system. At the current practice, the amount of PV system installed on the distribution network is constraint by the utility company. As a result, this can limit the reduction of carbon footprint. Therefore, energy storage system is proposed as a solution for these power quality issues. To ensure an effective operation of the distribution network with PV system, a fuzzy control system is developed and implemented to govern the operation of an energy storage system. The fuzzy driven energy storage system is able to mitigate the fluctuating voltage rise and voltage unbalance on the electrical grid by actively manipulates the flow of real power between the grid and the batteries. To verify the effectiveness of the proposed fuzzy driven energy storage system, an experimental network integrated with 7.2kWp PV system was setup. Several case studies are performed to evaluate the response of the proposed solution to mitigate voltage rises, voltage unbalance and reduce the amount of reverse power flow under highly intermittent PV power output.

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.

Size-dependent survival of brook trout Salvelinus fontinalis in summer: effects of water temperature and stream flow.

PubMed

Xu, C L; Letcher, B H; Nislow, K H

2010-06-01

A 5 year individual-based data set was used to estimate size-specific survival rates in a wild brook trout Salvelinus fontinalis population in a stream network encompassing a mainstem and three tributaries (1.5-6 m wetted width), western Massachusetts, U.S.A. The relationships between survival in summer and temperature and flow metrics derived from continuous monitoring data were then tested. Increased summer temperatures significantly reduced summer survival rates for S. fontinalis in almost all size classes in all four sites throughout the network. In contrast, extreme low summer flows reduced survival of large fish, but only in small tributaries, and had no significant effects on fish in smaller size classes in any location. These results provide direct evidence of a link between season-specific survival and environmental factors likely to be affected by climate change and have important consequences for the management of both habitats and populations.

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.

A Real-Time Method to Estimate Speed of Object Based on Object Detection and Optical Flow Calculation

NASA Astrophysics Data System (ADS)

Liu, Kaizhan; Ye, Yunming; Li, Xutao; Li, Yan

2018-04-01

In recent years Convolutional Neural Network (CNN) has been widely used in computer vision field and makes great progress in lots of contents like object detection and classification. Even so, combining Convolutional Neural Network, which means making multiple CNN frameworks working synchronously and sharing their output information, could figure out useful message that each of them cannot provide singly. Here we introduce a method to real-time estimate speed of object by combining two CNN: YOLOv2 and FlowNet. In every frame, YOLOv2 provides object size; object location and object type while FlowNet providing the optical flow of whole image. On one hand, object size and object location help to select out the object part of optical flow image thus calculating out the average optical flow of every object. On the other hand, object type and object size help to figure out the relationship between optical flow and true speed by means of optics theory and priori knowledge. Therefore, with these two key information, speed of object can be estimated. This method manages to estimate multiple objects at real-time speed by only using a normal camera even in moving status, whose error is acceptable in most application fields like manless driving or robot vision.

Prediction based active ramp metering control strategy with mobility and safety assessment

NASA Astrophysics Data System (ADS)

Fang, Jie; Tu, Lili

2018-04-01

Ramp metering is one of the most direct and efficient motorway traffic flow management measures so as to improve traffic conditions. However, owing to short of traffic conditions prediction, in earlier studies, the impact on traffic flow dynamics of the applied RM control was not quantitatively evaluated. In this study, a RM control algorithm adopting Model Predictive Control (MPC) framework to predict and assess future traffic conditions, which taking both the current traffic conditions and the RM-controlled future traffic states into consideration, was presented. The designed RM control algorithm targets at optimizing the network mobility and safety performance. The designed algorithm is evaluated in a field-data-based simulation. Through comparing the presented algorithm controlled scenario with the uncontrolled scenario, it was proved that the proposed RM control algorithm can effectively relieve the congestion of traffic network with no significant compromises in safety aspect.

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.

Cross layer optimization for cloud-based radio over optical fiber networks

NASA Astrophysics Data System (ADS)

Shao, Sujie; Guo, Shaoyong; Qiu, Xuesong; Yang, Hui; Meng, Luoming

2016-07-01

To adapt the 5G communication, the cloud radio access network is a paradigm introduced by operators which aggregates all base stations computational resources into a cloud BBU pool. The interaction between RRH and BBU or resource schedule among BBUs in cloud have become more frequent and complex with the development of system scale and user requirement. It can promote the networking demand among RRHs and BBUs, and force to form elastic optical fiber switching and networking. In such network, multiple stratum resources of radio, optical and BBU processing unit have interweaved with each other. In this paper, we propose a novel multiple stratum optimization (MSO) architecture for cloud-based radio over optical fiber networks (C-RoFN) with software defined networking. Additionally, a global evaluation strategy (GES) is introduced in the proposed architecture. MSO can enhance the responsiveness to end-to-end user demands and globally optimize radio frequency, optical spectrum and BBU processing resources effectively to maximize radio coverage. The feasibility and efficiency of the proposed architecture with GES strategy are experimentally verified on OpenFlow-enabled testbed in terms of resource occupation and path provisioning latency.

Performance evaluation of multi-stratum resources integration based on network function virtualization in software defined elastic data center optical interconnect.

PubMed

Yang, Hui; Zhang, Jie; Ji, Yuefeng; Tian, Rui; Han, Jianrui; Lee, Young

2015-11-30

Data center interconnect with elastic optical network is a promising scenario to meet the high burstiness and high-bandwidth requirements of data center services. In our previous work, we implemented multi-stratum resilience between IP and elastic optical networks that allows to accommodate data center services. In view of this, this study extends to consider the resource integration by breaking the limit of network device, which can enhance the resource utilization. We propose a novel multi-stratum resources integration (MSRI) architecture based on network function virtualization in software defined elastic data center optical interconnect. A resource integrated mapping (RIM) scheme for MSRI is introduced in the proposed architecture. The MSRI can accommodate the data center services with resources integration when the single function or resource is relatively scarce to provision the services, and enhance globally integrated optimization of optical network and application resources. The overall feasibility and efficiency of the proposed architecture are experimentally verified on the control plane of OpenFlow-based enhanced software defined networking (eSDN) testbed. The performance of RIM scheme under heavy traffic load scenario is also quantitatively evaluated based on MSRI architecture in terms of path blocking probability, provisioning latency and resource utilization, compared with other provisioning schemes.

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.

Rayleigh Scattering Diagnostic for Simultaneous Measurements of Dynamic Density and Velocity

NASA Technical Reports Server (NTRS)

Seasholtz, Richard G.; Panda, J.

2000-01-01

A flow diagnostic technique based on the molecular Rayleigh scattering of laser light is used to obtain dynamic density and velocity data in turbulent flows. The technique is based on analyzing the Rayleigh scattered light with a Fabry-Perot interferometer and recording information about the interference pattern with a multiple anode photomultiplier tube (PMT). An artificial neural network is used to process the signals from the PMT to recover the velocity time history, which is then used to calculate the velocity power spectrum. The technique is illustrated using simulated data. The results of an experiment to measure the velocity power spectrum in a low speed (100 rn/sec) flow are also presented.