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

Concept development and needs identification for intelligent network flow optimization (INFLO) : functional and performance requirements, and high-level data and communication needs.

DOT National Transportation Integrated Search

2012-11-01

The purpose of this project is to develop for the Intelligent Network Flow Optimization (INFLO), which is one collection (or bundle) of high-priority transformative applications identified by the United States Department of Transportation (USDOT) Mob...

Flow rate of transport network controls uniform metabolite supply to tissue

PubMed Central

Meigel, Felix J.

2018-01-01

Life and functioning of higher organisms depends on the continuous supply of metabolites to tissues and organs. What are the requirements on the transport network pervading a tissue to provide a uniform supply of nutrients, minerals or hormones? To theoretically answer this question, we present an analytical scaling argument and numerical simulations on how flow dynamics and network architecture control active spread and uniform supply of metabolites by studying the example of xylem vessels in plants. We identify the fluid inflow rate as the key factor for uniform supply. While at low inflow rates metabolites are already exhausted close to flow inlets, too high inflow flushes metabolites through the network and deprives tissue close to inlets of supply. In between these two regimes, there exists an optimal inflow rate that yields a uniform supply of metabolites. We determine this optimal inflow analytically in quantitative agreement with numerical results. Optimizing network architecture by reducing the supply variance over all network tubes, we identify patterns of tube dilation or contraction that compensate sub-optimal supply for the case of too low or too high inflow rate. PMID:29720455

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

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

A revised model of fluid transport optimization in Physarum polycephalum.

PubMed

Bonifaci, Vincenzo

2017-02-01

Optimization of fluid transport in the slime mold Physarum polycephalum has been the subject of several modeling efforts in recent literature. Existing models assume that the tube adaptation mechanism in P. polycephalum's tubular network is controlled by the sheer amount of fluid flow through the tubes. We put forward the hypothesis that the controlling variable may instead be the flow's pressure gradient along the tube. We carry out the stability analysis of such a revised mathematical model for a parallel-edge network, proving that the revised model supports the global flow-optimizing behavior of the slime mold for a substantially wider class of response functions compared to previous models. Simulations also suggest that the same conclusion may be valid for arbitrary network topologies.

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.

Contrast research of CDMA and GSM network optimization

NASA Astrophysics Data System (ADS)

Wu, Yanwen; Liu, Zehong; Zhou, Guangyue

2004-03-01

With the development of mobile telecommunication network, users of CDMA advanced their request of network service quality. While the operators also change their network management object from signal coverage to performance improvement. In that case, reasonably layout & optimization of mobile telecommunication network, reasonably configuration of network resource, improvement of the service quality, and increase the enterprise's core competition ability, all those have been concerned by the operator companies. This paper firstly looked into the flow of CDMA network optimization. Then it dissertated to some keystones in the CDMA network optimization, like PN code assignment, calculation of soft handover, etc. As GSM is also the similar cellular mobile telecommunication system like CDMA, so this paper also made a contrast research of CDMA and GSM network optimization in details, including the similarity and the different. In conclusion, network optimization is a long time job; it will run through the whole process of network construct. By the adjustment of network hardware (like BTS equipments, RF systems, etc.) and network software (like parameter optimized, configuration optimized, capacity optimized, etc.), network optimization work can improve the performance and service quality of the network.

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

NASA Astrophysics Data System (ADS)

Hooda, Nikhil; Damani, Om

2017-06-01

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

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

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

NASA Astrophysics Data System (ADS)

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

2013-05-01

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

Optimal fractal tree-like microchannel networks with slip for laminar-flow-modified Murray's law.

PubMed

Jing, Dalei; Song, Shiyu; Pan, Yunlu; Wang, Xiaoming

2018-01-01

The fractal tree-like branched network is an effective channel design structure to reduce the hydraulic resistance as compared with the conventional parallel channel network. In order for a laminar flow to achieve minimum hydraulic resistance, it is believed that the optimal fractal tree-like channel network obeys the well-accepted Murray's law of β m = N -1/3 (β m is the optimal diameter ratio between the daughter channel and the parent channel and N is the branching number at every level), which is obtained under the assumption of no-slip conditions at the channel wall-liquid interface. However, at the microscale, the no-slip condition is not always reasonable; the slip condition should indeed be considered at some solid-liquid interfaces for the optimal design of the fractal tree-like channel network. The present work reinvestigates Murray's law for laminar flow in a fractal tree-like microchannel network considering slip condition. It is found that the slip increases the complexity of the optimal design of the fractal tree-like microchannel network to achieve the minimum hydraulic resistance. The optimal diameter ratio to achieve minimum hydraulic resistance is not only dependent on the branching number, as stated by Murray's law, but also dependent on the slip length, the level number, the length ratio between the daughter channel and the parent channel, and the diameter of the channel. The optimal diameter ratio decreases with the increasing slip length, the increasing level number and the increasing length ratio between the daughter channel and the parent channel, and decreases with decreasing channel diameter. These complicated relations were found to become relaxed and simplified to Murray's law when the ratio between the slip length and the diameter of the channel is small enough.

Graphical models for optimal power flow

DOE PAGES

Dvijotham, Krishnamurthy; Chertkov, Michael; Van Hentenryck, Pascal; ...

2016-09-13

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithmmore » for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. In conclusion, numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.« less

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

NASA Astrophysics Data System (ADS)

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

2018-07-01

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

Optimizing Natural Gas Networks through Dynamic Manifold Theory and a Decentralized Algorithm: Belgium Case Study

NASA Astrophysics Data System (ADS)

Koch, Caleb; Winfrey, Leigh

2014-10-01

Natural Gas is a major energy source in Europe, yet political instabilities have the potential to disrupt access and supply. Energy resilience is an increasingly essential construct and begins with transmission network design. This study proposes a new way of thinking about modelling natural gas flow. Rather than relying on classical economic models, this problem is cast into a time-dependent Hamiltonian dynamics discussion. Traditional Natural Gas constraints, including inelastic demand and maximum/minimum pipe flows, are portrayed as energy functions and built into the dynamics of each pipe flow. Doing so allows the constraints to be built into the dynamics of each pipeline. As time progresses in the model, natural gas flow rates find the minimum energy, thus the optimal gas flow rates. The most important result of this study is using dynamical principles to ensure the output of natural gas at demand nodes remains constant, which is important for country to country natural gas transmission. Another important step in this study is building the dynamics of each flow in a decentralized algorithm format. Decentralized regulation has solved congestion problems for internet data flow, traffic flow, epidemiology, and as demonstrated in this study can solve the problem of Natural Gas congestion. A mathematical description is provided for how decentralized regulation leads to globally optimized network flow. Furthermore, the dynamical principles and decentralized algorithm are applied to a case study of the Fluxys Belgium Natural Gas Network.

A generalized network flow model for the multi-mode resource-constrained project scheduling problem with discounted cash flows

NASA Astrophysics Data System (ADS)

Chen, Miawjane; Yan, Shangyao; Wang, Sin-Siang; Liu, Chiu-Lan

2015-02-01

An effective project schedule is essential for enterprises to increase their efficiency of project execution, to maximize profit, and to minimize wastage of resources. Heuristic algorithms have been developed to efficiently solve the complicated multi-mode resource-constrained project scheduling problem with discounted cash flows (MRCPSPDCF) that characterize real problems. However, the solutions obtained in past studies have been approximate and are difficult to evaluate in terms of optimality. In this study, a generalized network flow model, embedded in a time-precedence network, is proposed to formulate the MRCPSPDCF with the payment at activity completion times. Mathematically, the model is formulated as an integer network flow problem with side constraints, which can be efficiently solved for optimality, using existing mathematical programming software. To evaluate the model performance, numerical tests are performed. The test results indicate that the model could be a useful planning tool for project scheduling in the real world.

Propagation of Disturbances in Traffic Flow

DOT National Transportation Integrated Search

1977-09-01

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

Construction of pore network models for Berea and Fontainebleau sandstones using non-linear programing and optimization techniques

NASA Astrophysics Data System (ADS)

Sharqawy, Mostafa H.

2016-12-01

Pore network models (PNM) of Berea and Fontainebleau sandstones were constructed using nonlinear programming (NLP) and optimization methods. The constructed PNMs are considered as a digital representation of the rock samples which were based on matching the macroscopic properties of the porous media and used to conduct fluid transport simulations including single and two-phase flow. The PNMs consisted of cubic networks of randomly distributed pores and throats sizes and with various connectivity levels. The networks were optimized such that the upper and lower bounds of the pore sizes are determined using the capillary tube bundle model and the Nelder-Mead method instead of guessing them, which reduces the optimization computational time significantly. An open-source PNM framework was employed to conduct transport and percolation simulations such as invasion percolation and Darcian flow. The PNM model was subsequently used to compute the macroscopic properties; porosity, absolute permeability, specific surface area, breakthrough capillary pressure, and primary drainage curve. The pore networks were optimized to allow for the simulation results of the macroscopic properties to be in excellent agreement with the experimental measurements. This study demonstrates that non-linear programming and optimization methods provide a promising method for pore network modeling when computed tomography imaging may not be readily available.

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

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

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

2015-07-01

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

Optimal resource allocation strategy for two-layer complex networks

NASA Astrophysics Data System (ADS)

Ma, Jinlong; Wang, Lixin; Li, Sufeng; Duan, Congwen; Liu, Yu

2018-02-01

We study the traffic dynamics on two-layer complex networks, and focus on its delivery capacity allocation strategy to enhance traffic capacity measured by the critical value Rc. With the limited packet-delivering capacity, we propose a delivery capacity allocation strategy which can balance the capacities of non-hub nodes and hub nodes to optimize the data flow. With the optimal value of parameter αc, the maximal network capacity is reached because most of the nodes have shared the appropriate delivery capacity by the proposed delivery capacity allocation strategy. Our work will be beneficial to network service providers to design optimal networked traffic dynamics.

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

Optimal pipe size design for looped irrigation water supply system using harmony search: Saemangeum project area.

PubMed

Yoo, Do Guen; Lee, Ho Min; Sadollah, Ali; Kim, Joong Hoon

2015-01-01

Water supply systems are mainly classified into branched and looped network systems. The main difference between these two systems is that, in a branched network system, the flow within each pipe is a known value, whereas in a looped network system, the flow in each pipe is considered an unknown value. Therefore, an analysis of a looped network system is a more complex task. This study aims to develop a technique for estimating the optimal pipe diameter for a looped agricultural irrigation water supply system using a harmony search algorithm, which is an optimization technique. This study mainly serves two purposes. The first is to develop an algorithm and a program for estimating a cost-effective pipe diameter for agricultural irrigation water supply systems using optimization techniques. The second is to validate the developed program by applying the proposed optimized cost-effective pipe diameter to an actual study region (Saemangeum project area, zone 6). The results suggest that the optimal design program, which applies an optimization theory and enhances user convenience, can be effectively applied for the real systems of a looped agricultural irrigation water supply.

Optimal Pipe Size Design for Looped Irrigation Water Supply System Using Harmony Search: Saemangeum Project Area

PubMed Central

Lee, Ho Min; Sadollah, Ali

2015-01-01

Water supply systems are mainly classified into branched and looped network systems. The main difference between these two systems is that, in a branched network system, the flow within each pipe is a known value, whereas in a looped network system, the flow in each pipe is considered an unknown value. Therefore, an analysis of a looped network system is a more complex task. This study aims to develop a technique for estimating the optimal pipe diameter for a looped agricultural irrigation water supply system using a harmony search algorithm, which is an optimization technique. This study mainly serves two purposes. The first is to develop an algorithm and a program for estimating a cost-effective pipe diameter for agricultural irrigation water supply systems using optimization techniques. The second is to validate the developed program by applying the proposed optimized cost-effective pipe diameter to an actual study region (Saemangeum project area, zone 6). The results suggest that the optimal design program, which applies an optimization theory and enhances user convenience, can be effectively applied for the real systems of a looped agricultural irrigation water supply. PMID:25874252

Software defined network architecture based research on load balancing strategy

NASA Astrophysics Data System (ADS)

You, Xiaoqian; Wu, Yang

2018-05-01

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

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.

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.

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.

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

Compressing Test and Evaluation by Using Flow Data for Scalable Network Traffic Analysis

DTIC Science & Technology

2014-10-01

test events, quality of service and other key metrics of military systems and networks are evaluated. Network data captured in standard flow formats...mentioned here. The Ozone Widget Framework (Next Century, n.d.) has proven to be very useful. Also, an extensive, clean, and optimized JavaScript ...library for visualizing many types of data can be found in D3–Data Driven Documents (Bostock, 2013). Quality of Service from Flow Two essential metrics of

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

Distributed Coordination for Optimal Energy Generation and Distribution in Cyber-Physical Energy Networks.

PubMed

Ahn, Hyo-Sung; Kim, Byeong-Yeon; Lim, Young-Hun; Lee, Byung-Hun; Oh, Kwang-Kyo

2018-03-01

This paper proposes three coordination laws for optimal energy generation and distribution in energy network, which is composed of physical flow layer and cyber communication layer. The physical energy flows through the physical layer; but all the energies are coordinated to generate and flow by distributed coordination algorithms on the basis of communication information. First, distributed energy generation and energy distribution laws are proposed in a decoupled manner without considering the interactive characteristics between the energy generation and energy distribution. Second, a joint coordination law to treat the energy generation and energy distribution in a coupled manner taking account of the interactive characteristics is designed. Third, to handle over- or less-energy generation cases, an energy distribution law for networks with batteries is designed. The coordination laws proposed in this paper are fully distributed in the sense that they are decided optimally only using relative information among neighboring nodes. Through numerical simulations, the validity of the proposed distributed coordination laws is illustrated.

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

PubMed

Pagadrai, Sasikanth; Yilmaz, Muhittin; Valluri, Pratyush

2016-08-01

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

Guidelines on CV networking information flow optimization for Texas.

DOT National Transportation Integrated Search

2017-03-01

Recognizing the fundamental role of information flow in future transportation applications, the research team investigated the quality and security of information flow in the connected vehicle (CV) environment. The research team identified key challe...

LinkMind: link optimization in swarming mobile sensor networks.

PubMed

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation.

LinkMind: Link Optimization in Swarming Mobile Sensor Networks

PubMed Central

Ngo, Trung Dung

2011-01-01

A swarming mobile sensor network is comprised of a swarm of wirelessly connected mobile robots equipped with various sensors. Such a network can be applied in an uncertain environment for services such as cooperative navigation and exploration, object identification and information gathering. One of the most advantageous properties of the swarming wireless sensor network is that mobile nodes can work cooperatively to organize an ad-hoc network and optimize the network link capacity to maximize the transmission of gathered data from a source to a target. This paper describes a new method of link optimization of swarming mobile sensor networks. The new method is based on combination of the artificial potential force guaranteeing connectivities of the mobile sensor nodes and the max-flow min-cut theorem of graph theory ensuring optimization of the network link capacity. The developed algorithm is demonstrated and evaluated in simulation. PMID:22164070

Toward Optimal Transport Networks

NASA Technical Reports Server (NTRS)

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

2008-01-01

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

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.

Near-optimality of special periodic protocols for fluid models of single server switched networks with switchover times

NASA Astrophysics Data System (ADS)

Matveev, A. S.; Ishchenko, R.

2017-11-01

We consider a generic deterministic time-invariant fluid model of a single server switched network, which consists of finitely many infinite size buffers (queues) and receives constant rate inflows of jobs from the outside. Any flow undergoes a multi-phase service, entering a specific buffer after every phase, and ultimately leaves the network; the route of the flow over the buffers is pre-specified, and flows may merge inside the network. They share a common source of service, which can serve at most one buffer at a time and has to switch among buffers from time to time; any switch consumes a nonzero switchover period. With respect to the long-run maximal scaled wip (work in progress) performance metric, near-optimality of periodic scheduling and service protocols is established: the deepest optimum (that is over all feasible processes in the network, irrespective of the initial state) is furnished by such a protocol up to as small error as desired. Moreover, this can be achieved with a special periodic protocol introduced in the paper. It is also shown that the exhaustive policy is optimal for any buffer whose service at the maximal rate does not cause growth of the scaled wip.

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

Exploring 3D optimal channel networks by multiple organizing principles

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

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.

Flow experience and the mobilization of attentional resources.

PubMed

de Sampaio Barros, Marcelo Felipe; Araújo-Moreira, Fernando M; Trevelin, Luis Carlos; Radel, Rémi

2018-05-07

The present study attempts to better identify the neurophysiological changes occurring during flow experience and how this can be related to the mobilization of attentional resources. Self-reports of flow (using a flow feelings scale) and attention (using thought probes), autonomic activity (heart rate, heart rate variability, and breathing rate), and cerebral oxygenation (using near-infrared spectroscopy) in two regions of the frontoparietal attention network (right lateral frontal cortex and right inferior parietal lobe) were measured during the practice of two simple video games (Tetris and Pong) played at different difficulty conditions (easy, optimal, hard, or self-selected). Our results indicated that an optimal level of difficulty, compared with an easy or hard level of difficulty led to greater flow feelings and a higher concentration of oxygenated hemoglobin in the regions of the frontoparietal network. The self-selected, named autonomy condition did not lead to more flow feelings than the optimal condition; however, the autonomy condition led to greater sympathetic activity (reduced heart rate variability and greater breathing rate) and higher activation of the frontoparietal regions. Our study suggests that flow feelings are highly connected to the mobilization of attentional resources, and all the more in a condition that promotes individuals' choice and autonomy.

Design of robust flow processing networks with time-programmed responses

NASA Astrophysics Data System (ADS)

Kaluza, P.; Mikhailov, A. S.

2012-04-01

Can artificially designed networks reach the levels of robustness against local damage which are comparable with those of the biochemical networks of a living cell? We consider a simple model where the flow applied to an input node propagates through the network and arrives at different times to the output nodes, thus generating a pattern of coordinated responses. By using evolutionary optimization algorithms, functional networks - with required time-programmed responses - were constructed. Then, continuing the evolution, such networks were additionally optimized for robustness against deletion of individual nodes or links. In this manner, large ensembles of functional networks with different kinds of robustness were obtained, making statistical investigations and comparison of their structural properties possible. We have found that, generally, different architectures are needed for various kinds of robustness. The differences are statistically revealed, for example, in the Laplacian spectra of the respective graphs. On the other hand, motif distributions of robust networks do not differ from those of the merely functional networks; they are found to belong to the first Alon superfamily, the same as that of the gene transcription networks of single-cell organisms.

A Practically Validated Intelligent Calibration Circuit Using Optimized ANN for Flow Measurement by Venturi

NASA Astrophysics Data System (ADS)

Venkata, Santhosh Krishnan; Roy, Binoy Krishna

2016-03-01

Design of an intelligent flow measurement technique using venturi flow meter is reported in this paper. The objectives of the present work are: (1) to extend the linearity range of measurement to 100 % of full scale input range, (2) to make the measurement technique adaptive to variations in discharge coefficient, diameter ratio of venturi nozzle and pipe (β), liquid density, and liquid temperature, and (3) to achieve the objectives (1) and (2) using an optimized neural network. The output of venturi flow meter is differential pressure. It is converted to voltage by using a suitable data conversion unit. A suitable optimized artificial neural network (ANN) is added, in place of conventional calibration circuit. ANN is trained, tested with simulated data considering variations in discharge coefficient, diameter ratio between venturi nozzle and pipe, liquid density, and liquid temperature. The proposed technique is then subjected to practical data for validation. Results show that the proposed technique has fulfilled the objectives.

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.

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

Adaptation, Growth, and Resilience in Biological Distribution Networks

NASA Astrophysics Data System (ADS)

Ronellenfitsch, Henrik; Katifori, Eleni

Highly optimized complex transport networks serve crucial functions in many man-made and natural systems such as power grids and plant or animal vasculature. Often, the relevant optimization functional is nonconvex and characterized by many local extrema. In general, finding the global, or nearly global optimum is difficult. In biological systems, it is believed that such an optimal state is slowly achieved through natural selection. However, general coarse grained models for flow networks with local positive feedback rules for the vessel conductivity typically get trapped in low efficiency, local minima. We show how the growth of the underlying tissue, coupled to the dynamical equations for network development, can drive the system to a dramatically improved optimal state. This general model provides a surprisingly simple explanation for the appearance of highly optimized transport networks in biology such as plant and animal vasculature. In addition, we show how the incorporation of spatially collective fluctuating sources yields a minimal model of realistic reticulation in distribution networks and thus resilience against damage.

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

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

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

Study on Coagulant Dosing Control System of Micro Vortex Water Treatment

NASA Astrophysics Data System (ADS)

Fengping, Hu; Qi, Fan; Wenjie, Hu; Xizhen, He; Hongling, Dai

2018-03-01

In view of the characteristics of nonlinearity, large time delay and multi disturbance in the process of coagulant dosing in water treatment, it is difficult to control the dosage of coagulant. According to the four indexes of raw water quality parameters (raw water flow, turbidity, pH value) and turbidity of sedimentation tank, the micro vortex coagulation dosing control model is constructed based on BP neural network and GA. The forecast results of BP neural network model are ideal, and after the optimization of GA, the prediction accuracy of the model is partly improved. The prediction error of the optimized network is ±0.5 mg/L, and has a better performance than non-optimized network.

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

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.

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.

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

Numerical Modeling of Surface and Volumetric Cooling using Optimal T- and Y-shaped Flow Channels

NASA Astrophysics Data System (ADS)

Kosaraju, Srinivas

2017-11-01

The layout of T- and V-shaped flow channel networks on a surface can be optimized for minimum pressure drop and pumping power. The results of the optimization are in the form of geometric parameters such as length and diameter ratios of the stem and branch sections. While these flow channels are optimized for minimum pressure drop, they can also be used for surface and volumetric cooling applications such as heat exchangers, air conditioning and electronics cooling. In this paper, an effort has been made to study the heat transfer characteristics of multiple T- and Y-shaped flow channel configurations using numerical simulations. All configurations are subjected to same input parameters and heat generation constraints. Comparisons are made with similar results published in literature.

Designing area optimized application-specific network-on-chip architectures while providing hard QoS guarantees.

PubMed

Khawaja, Sajid Gul; Mushtaq, Mian Hamza; Khan, Shoab A; Akram, M Usman; Jamal, Habib Ullah

2015-01-01

With the increase of transistors' density, popularity of System on Chip (SoC) has increased exponentially. As a communication module for SoC, Network on Chip (NoC) framework has been adapted as its backbone. In this paper, we propose a methodology for designing area-optimized application specific NoC while providing hard Quality of Service (QoS) guarantees for real time flows. The novelty of the proposed system lies in derivation of a Mixed Integer Linear Programming model which is then used to generate a resource optimal Network on Chip (NoC) topology and architecture while considering traffic and QoS requirements. We also present the micro-architectural design features used for enabling traffic and latency guarantees and discuss how the solution adapts for dynamic variations in the application traffic. The paper highlights the effectiveness of proposed method by generating resource efficient NoC solutions for both industrial and benchmark applications. The area-optimized results are generated in few seconds by proposed technique, without resorting to heuristics, even for an application with 48 traffic flows.

Designing Area Optimized Application-Specific Network-On-Chip Architectures while Providing Hard QoS Guarantees

PubMed Central

Khawaja, Sajid Gul; Mushtaq, Mian Hamza; Khan, Shoab A.; Akram, M. Usman; Jamal, Habib ullah

2015-01-01

With the increase of transistors' density, popularity of System on Chip (SoC) has increased exponentially. As a communication module for SoC, Network on Chip (NoC) framework has been adapted as its backbone. In this paper, we propose a methodology for designing area-optimized application specific NoC while providing hard Quality of Service (QoS) guarantees for real time flows. The novelty of the proposed system lies in derivation of a Mixed Integer Linear Programming model which is then used to generate a resource optimal Network on Chip (NoC) topology and architecture while considering traffic and QoS requirements. We also present the micro-architectural design features used for enabling traffic and latency guarantees and discuss how the solution adapts for dynamic variations in the application traffic. The paper highlights the effectiveness of proposed method by generating resource efficient NoC solutions for both industrial and benchmark applications. The area-optimized results are generated in few seconds by proposed technique, without resorting to heuristics, even for an application with 48 traffic flows. PMID:25898016

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.

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

How does network design constrain optimal operation of intermittent water supply?

NASA Astrophysics Data System (ADS)

Lieb, Anna; Wilkening, Jon; Rycroft, Chris

2015-11-01

Urban water distribution systems do not always supply water continuously or reliably. As pipes fill and empty, pressure transients may contribute to degraded infrastructure and poor water quality. To help understand and manage this undesirable side effect of intermittent water supply--a phenomenon affecting hundreds of millions of people in cities around the world--we study the relative contributions of fixed versus dynamic properties of the network. Using a dynamical model of unsteady transition pipe flow, we study how different elements of network design, such as network geometry, pipe material, and pipe slope, contribute to undesirable pressure transients. Using an optimization framework, we then investigate to what extent network operation decisions such as supply timing and inflow rate may mitigate these effects. We characterize some aspects of network design that make them more or less amenable to operational optimization.

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

NASA Astrophysics Data System (ADS)

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

2006-04-01

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

Application of SNODAS and hydrologic models to enhance entropy-based snow monitoring network design

NASA Astrophysics Data System (ADS)

Keum, Jongho; Coulibaly, Paulin; Razavi, Tara; Tapsoba, Dominique; Gobena, Adam; Weber, Frank; Pietroniro, Alain

2018-06-01

Snow has a unique characteristic in the water cycle, that is, snow falls during the entire winter season, but the discharge from snowmelt is typically delayed until the melting period and occurs in a relatively short period. Therefore, reliable observations from an optimal snow monitoring network are necessary for an efficient management of snowmelt water for flood prevention and hydropower generation. The Dual Entropy and Multiobjective Optimization is applied to design snow monitoring networks in La Grande River Basin in Québec and Columbia River Basin in British Columbia. While the networks are optimized to have the maximum amount of information with minimum redundancy based on entropy concepts, this study extends the traditional entropy applications to the hydrometric network design by introducing several improvements. First, several data quantization cases and their effects on the snow network design problems were explored. Second, the applicability the Snow Data Assimilation System (SNODAS) products as synthetic datasets of potential stations was demonstrated in the design of the snow monitoring network of the Columbia River Basin. Third, beyond finding the Pareto-optimal networks from the entropy with multi-objective optimization, the networks obtained for La Grande River Basin were further evaluated by applying three hydrologic models. The calibrated hydrologic models simulated discharges using the updated snow water equivalent data from the Pareto-optimal networks. Then, the model performances for high flows were compared to determine the best optimal network for enhanced spring runoff forecasting.

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

NASA Astrophysics Data System (ADS)

Sung, Woong Je

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

Design of Flow Systems for Improved Networking and Reduced Noise in Biomolecular Signal Processing in Biocomputing and Biosensing Applications

PubMed Central

Verma, Arjun; Fratto, Brian E.; Privman, Vladimir; Katz, Evgeny

2016-01-01

We consider flow systems that have been utilized for small-scale biomolecular computing and digital signal processing in binary-operating biosensors. Signal measurement is optimized by designing a flow-reversal cuvette and analyzing the experimental data to theoretically extract the pulse shape, as well as reveal the level of noise it possesses. Noise reduction is then carried out numerically. We conclude that this can be accomplished physically via the addition of properly designed well-mixing flow-reversal cell(s) as an integral part of the flow system. This approach should enable improved networking capabilities and potentially not only digital but analog signal-processing in such systems. Possible applications in complex biocomputing networks and various sense-and-act systems are discussed. PMID:27399702

Optimal Assembly of Psychological and Educational Tests.

ERIC Educational Resources Information Center

van der Linden, Wim J.

1998-01-01

Reviews optimal test-assembly literature and introduces the contributions to this special issue. Discusses four approaches to computerized test assembly: (1) heuristic-based test assembly; (2) 0-1 linear programming; (3) network-flow programming; and (4) an optimal design approach. Contains a bibliography of 90 sources on test assembly.…

Optimal placement of FACTS devices using optimization techniques: A review

NASA Astrophysics Data System (ADS)

Gaur, Dipesh; Mathew, Lini

2018-03-01

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

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

PubMed

Suen, Jonathan Y; Navlakha, Saket

2017-05-01

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

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.

Treelike networks accelerating capillary flow.

PubMed

Shou, Dahua; Ye, Lin; Fan, Jintu

2014-05-01

Transport in treelike networks has received wide attention in natural systems, oil recovery, microelectronic cooling systems, and textiles. Existing studies are focused on transport behaviors under a constant potential difference (including pressure, temperature, and voltage) in a steady state [B. Yu and B. Li, Phys. Rev. E 73, 066302 (2006); J. Chen, B. Yu, P. Xu, and Y. Li, Phys. Rev. E 75, 056301 (2007)]. However, dynamic (time-dependent) transport in such systems has rarely been concerned. In this work, we theoretically investigate the dynamics of capillary flow in treelike networks and design the distribution of radius and length of local branches for the fastest capillary flow. It is demonstrated that capillary flow in the optimized tree networks is faster than in traditional parallel tube nets under fixed constraints. As well, the flow time of the liquid is found to increase approximately linearly with penetration distance, which differs from Washburn's classic description that flow time increases as the square of penetration distance in a uniform tube.

Optimal design of a gas transmission network: A case study of the Turkish natural gas pipeline network system

NASA Astrophysics Data System (ADS)

Gunes, Ersin Fatih

Turkey is located between Europe, which has increasing demand for natural gas and the geographies of Middle East, Asia and Russia, which have rich and strong natural gas supply. Because of the geographical location, Turkey has strategic importance according to energy sources. To supply this demand, a pipeline network configuration with the optimal and efficient lengths, pressures, diameters and number of compressor stations is extremely needed. Because, Turkey has a currently working and constructed network topology, obtaining an optimal configuration of the pipelines, including an optimal number of compressor stations with optimal locations, is the focus of this study. Identifying a network design with lowest costs is important because of the high maintenance and set-up costs. The quantity of compressor stations, the pipeline segments' lengths, the diameter sizes and pressures at compressor stations, are considered to be decision variables in this study. Two existing optimization models were selected and applied to the case study of Turkey. Because of the fixed cost of investment, both models are formulated as mixed integer nonlinear programs, which require branch and bound combined with the nonlinear programming solution methods. The differences between these two models are related to some factors that can affect the network system of natural gas such as wall thickness, material balance compressor isentropic head and amount of gas to be delivered. The results obtained by these two techniques are compared with each other and with the current system. Major differences between results are costs, pressures and flow rates. These solution techniques are able to find a solution with minimum cost for each model both of which are less than the current cost of the system while satisfying all the constraints on diameter, length, flow rate and pressure. These results give the big picture of an ideal configuration for the future state network for the country of Turkey.

Network flow of mobile agents enhances the evolution of cooperation

NASA Astrophysics Data System (ADS)

Ichinose, G.; Satotani, Y.; Nagatani, T.

2018-01-01

We study the effect of contingent movement on the persistence of cooperation on complex networks with empty nodes. Each agent plays the Prisoner's Dilemma game with its neighbors and then it either updates the strategy depending on the payoff difference with neighbors or it moves to another empty node if not satisfied with its own payoff. If no neighboring node is empty, each agent stays at the same site. By extensive evolutionary simulations, we show that the medium density of agents enhances cooperation where the network flow of mobile agents is also medium. Moreover, if the movements of agents are more frequent than the strategy updating, cooperation is further promoted. In scale-free networks, the optimal density for cooperation is lower than other networks because agents get stuck at hubs. Our study suggests that keeping a smooth network flow is significant for the persistence of cooperation in ever-changing societies.

Optimal Information Processing in Biochemical Networks

NASA Astrophysics Data System (ADS)

Wiggins, Chris

2012-02-01

A variety of experimental results over the past decades provide examples of near-optimal information processing in biological networks, including in biochemical and transcriptional regulatory networks. Computing information-theoretic quantities requires first choosing or computing the joint probability distribution describing multiple nodes in such a network --- for example, representing the probability distribution of finding an integer copy number of each of two interacting reactants or gene products while respecting the `intrinsic' small copy number noise constraining information transmission at the scale of the cell. I'll given an overview of some recent analytic and numerical work facilitating calculation of such joint distributions and the associated information, which in turn makes possible numerical optimization of information flow in models of noisy regulatory and biochemical networks. Illustrating cases include quantification of form-function relations, ideal design of regulatory cascades, and response to oscillatory driving.

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.

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.

Random network peristalsis in Physarum polycephalum organizes fluid flows across an individual

PubMed Central

Alim, Karen; Amselem, Gabriel; Peaudecerf, François; Brenner, Michael P.; Pringle, Anne

2013-01-01

Individuals can function as integrated organisms only when information and resources are shared across a body. Signals and substrates are commonly moved using fluids, often channeled through a network of tubes. Peristalsis is one mechanism for fluid transport and is caused by a wave of cross-sectional contractions along a tube. We extend the concept of peristalsis from the canonical case of one tube to a random network. Transport is maximized within the network when the wavelength of the peristaltic wave is of the order of the size of the network. The slime mold Physarum polycephalum grows as a random network of tubes, and our experiments confirm peristalsis is used by the slime mold to drive internal cytoplasmic flows. Comparisons of theoretically generated contraction patterns with the patterns exhibited by individuals of P. polycephalum demonstrate that individuals maximize internal flows by adapting patterns of contraction to size, thus optimizing transport throughout an organism. This control of fluid flow may be the key to coordinating growth and behavior, including the dynamic changes in network architecture seen over time in an individual. PMID:23898203

Random network peristalsis in Physarum polycephalum organizes fluid flows across an individual.

PubMed

Alim, Karen; Amselem, Gabriel; Peaudecerf, François; Brenner, Michael P; Pringle, Anne

2013-08-13

Individuals can function as integrated organisms only when information and resources are shared across a body. Signals and substrates are commonly moved using fluids, often channeled through a network of tubes. Peristalsis is one mechanism for fluid transport and is caused by a wave of cross-sectional contractions along a tube. We extend the concept of peristalsis from the canonical case of one tube to a random network. Transport is maximized within the network when the wavelength of the peristaltic wave is of the order of the size of the network. The slime mold Physarum polycephalum grows as a random network of tubes, and our experiments confirm peristalsis is used by the slime mold to drive internal cytoplasmic flows. Comparisons of theoretically generated contraction patterns with the patterns exhibited by individuals of P. polycephalum demonstrate that individuals maximize internal flows by adapting patterns of contraction to size, thus optimizing transport throughout an organism. This control of fluid flow may be the key to coordinating growth and behavior, including the dynamic changes in network architecture seen over time in an individual.

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.

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.

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

NASA Technical Reports Server (NTRS)

Rai, Man Mohan

2006-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

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

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

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

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

Simulation Model for Scenario Optimization of the Ready-Mix Concrete Delivery Problem

NASA Astrophysics Data System (ADS)

Galić, Mario; Kraus, Ivan

2016-12-01

This paper introduces a discrete simulation model for solving routing and network material flow problems in construction projects. Before the description of the model a detailed literature review is provided. The model is verified using a case study of solving the ready-mix concrete network flow and routing problem in metropolitan area in Croatia. Within this study real-time input parameters were taken into account. Simulation model is structured in Enterprise Dynamics simulation software and Microsoft Excel linked with Google Maps. The model is dynamic, easily managed and adjustable, but also provides good estimation for minimization of costs and realization time in solving discrete routing and material network flow problems.

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.

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

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

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

2017-08-01

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

Social networks in primates: smart and tolerant species have more efficient networks.

PubMed

Pasquaretta, Cristian; Levé, Marine; Claidière, Nicolas; van de Waal, Erica; Whiten, Andrew; MacIntosh, Andrew J J; Pelé, Marie; Bergstrom, Mackenzie L; Borgeaud, Christèle; Brosnan, Sarah F; Crofoot, Margaret C; Fedigan, Linda M; Fichtel, Claudia; Hopper, Lydia M; Mareno, Mary Catherine; Petit, Odile; Schnoell, Anna Viktoria; di Sorrentino, Eugenia Polizzi; Thierry, Bernard; Tiddi, Barbara; Sueur, Cédric

2014-12-23

Network optimality has been described in genes, proteins and human communicative networks. In the latter, optimality leads to the efficient transmission of information with a minimum number of connections. Whilst studies show that differences in centrality exist in animal networks with central individuals having higher fitness, network efficiency has never been studied in animal groups. Here we studied 78 groups of primates (24 species). We found that group size and neocortex ratio were correlated with network efficiency. Centralisation (whether several individuals are central in the group) and modularity (how a group is clustered) had opposing effects on network efficiency, showing that tolerant species have more efficient networks. Such network properties affecting individual fitness could be shaped by natural selection. Our results are in accordance with the social brain and cultural intelligence hypotheses, which suggest that the importance of network efficiency and information flow through social learning relates to cognitive abilities.

Social networks in primates: smart and tolerant species have more efficient networks

PubMed Central

Pasquaretta, Cristian; Levé, Marine; Claidière, Nicolas; van de Waal, Erica; Whiten, Andrew; MacIntosh, Andrew J. J.; Pelé, Marie; Bergstrom, Mackenzie L.; Borgeaud, Christèle; Brosnan, Sarah F.; Crofoot, Margaret C.; Fedigan, Linda M.; Fichtel, Claudia; Hopper, Lydia M.; Mareno, Mary Catherine; Petit, Odile; Schnoell, Anna Viktoria; di Sorrentino, Eugenia Polizzi; Thierry, Bernard; Tiddi, Barbara; Sueur, Cédric

2014-01-01

Network optimality has been described in genes, proteins and human communicative networks. In the latter, optimality leads to the efficient transmission of information with a minimum number of connections. Whilst studies show that differences in centrality exist in animal networks with central individuals having higher fitness, network efficiency has never been studied in animal groups. Here we studied 78 groups of primates (24 species). We found that group size and neocortex ratio were correlated with network efficiency. Centralisation (whether several individuals are central in the group) and modularity (how a group is clustered) had opposing effects on network efficiency, showing that tolerant species have more efficient networks. Such network properties affecting individual fitness could be shaped by natural selection. Our results are in accordance with the social brain and cultural intelligence hypotheses, which suggest that the importance of network efficiency and information flow through social learning relates to cognitive abilities. PMID:25534964

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.

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

All-Optical Implementation of the Ant Colony Optimization Algorithm

PubMed Central

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

2016-01-01

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

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.

Criticism of generally accepted fundamentals and methodologies of traffic and transportation theory

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

Kerner, Boris S.

It is explained why the set of the fundamental empirical features of traffic breakdown (a transition from free flow to congested traffic) should be the empirical basis for any traffic and transportation theory that can be reliable used for control and optimization in traffic networks. It is shown that generally accepted fundamentals and methodologies of traffic and transportation theory are not consistent with the set of the fundamental empirical features of traffic breakdown at a highway bottleneck. To these fundamentals and methodologies of traffic and transportation theory belong (i) Lighthill-Whitham-Richards (LWR) theory, (ii) the General Motors (GM) model class (formore » example, Herman, Gazis et al. GM model, Gipps’s model, Payne’s model, Newell’s optimal velocity (OV) model, Wiedemann’s model, Bando et al. OV model, Treiber’s IDM, Krauß’s model), (iii) the understanding of highway capacity as a particular stochastic value, and (iv) principles for traffic and transportation network optimization and control (for example, Wardrop’s user equilibrium (UE) and system optimum (SO) principles). Alternatively to these generally accepted fundamentals and methodologies of traffic and transportation theory, we discuss three-phase traffic theory as the basis for traffic flow modeling as well as briefly consider the network breakdown minimization (BM) principle for the optimization of traffic and transportation networks with road bottlenecks.« less

An optimal general type-2 fuzzy controller for Urban Traffic Network.

PubMed

Khooban, Mohammad Hassan; Vafamand, Navid; Liaghat, Alireza; Dragicevic, Tomislav

2017-01-01

Urban traffic network model is illustrated by state-charts and object-diagram. However, they have limitations to show the behavioral perspective of the Traffic Information flow. Consequently, a state space model is used to calculate the half-value waiting time of vehicles. In this study, a combination of the general type-2 fuzzy logic sets and the Modified Backtracking Search Algorithm (MBSA) techniques are used in order to control the traffic signal scheduling and phase succession so as to guarantee a smooth flow of traffic with the least wait times and average queue length. The parameters of input and output membership functions are optimized simultaneously by the novel heuristic algorithm MBSA. A comparison is made between the achieved results with those of optimal and conventional type-1 fuzzy logic controllers. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.

PubMed

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A

2016-08-25

There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

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

Purvine, Emilie AH; Monson, Kyle E.; Jurrus, Elizabeth R.

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which verticesmore » (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.« less

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

PubMed Central

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A.

2016-01-01

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of “maximum flow-minimum cut” graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174

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.

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

NASA Astrophysics Data System (ADS)

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

2014-04-01

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

Principles of Biomimetic Vascular Network Design Applied to a Tissue-Engineered Liver Scaffold

PubMed Central

Hoganson, David M.; Pryor, Howard I.; Spool, Ira D.; Burns, Owen H.; Gilmore, J. Randall

2010-01-01

Branched vascular networks are a central component of scaffold architecture for solid organ tissue engineering. In this work, seven biomimetic principles were established as the major guiding technical design considerations of a branched vascular network for a tissue-engineered scaffold. These biomimetic design principles were applied to a branched radial architecture to develop a liver-specific vascular network. Iterative design changes and computational fluid dynamic analysis were used to optimize the network before mold manufacturing. The vascular network mold was created using a new mold technique that achieves a 1:1 aspect ratio for all channels. In vitro blood flow testing confirmed the physiologic hemodynamics of the network as predicted by computational fluid dynamic analysis. These results indicate that this biomimetic liver vascular network design will provide a foundation for developing complex vascular networks for solid organ tissue engineering that achieve physiologic blood flow. PMID:20001254

Principles of biomimetic vascular network design applied to a tissue-engineered liver scaffold.

PubMed

Hoganson, David M; Pryor, Howard I; Spool, Ira D; Burns, Owen H; Gilmore, J Randall; Vacanti, Joseph P

2010-05-01

Branched vascular networks are a central component of scaffold architecture for solid organ tissue engineering. In this work, seven biomimetic principles were established as the major guiding technical design considerations of a branched vascular network for a tissue-engineered scaffold. These biomimetic design principles were applied to a branched radial architecture to develop a liver-specific vascular network. Iterative design changes and computational fluid dynamic analysis were used to optimize the network before mold manufacturing. The vascular network mold was created using a new mold technique that achieves a 1:1 aspect ratio for all channels. In vitro blood flow testing confirmed the physiologic hemodynamics of the network as predicted by computational fluid dynamic analysis. These results indicate that this biomimetic liver vascular network design will provide a foundation for developing complex vascular networks for solid organ tissue engineering that achieve physiologic blood flow.

Scheduling work zones in multi-modal networks phase 1: scheduling work zones in transportation service networks.

DOT National Transportation Integrated Search

2016-06-01

The purpose of this project is to study the optimal scheduling of work zones so that they have minimum negative impact (e.g., travel delay, gas consumption, accidents, etc.) on transport service vehicle flows. In this project, a mixed integer linear ...

Resilience-based optimal design of water distribution network

NASA Astrophysics Data System (ADS)

Suribabu, C. R.

2017-11-01

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

FLOWER IPv4/IPv6 Network Flow Summarization software

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

Nickless, Bill; Curtis, Darren; Christy, Jason

FLOWER was written as a refactoring/reimplementation of the existing Flo software used by the Cooperative Protection Program (CPP) to provide network flow summaries for analysis by the Operational Analysis Center (OAC) and other US Department of Energy cyber security elements. FLOWER is designed and tested to operate at 10 gigabits/second, nearly 10 times faster than competing solutions. FLOWER output is optimized for importation into SQL databases for categorization and analysis. FLOWER is written in C++ using current best software engineering practices.

Optimal Power Flow Pursuit

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

Dall'Anese, Emiliano; Simonetto, Andrea

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

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.

Community Microgrid Scheduling Considering Network Operational Constraints and Building Thermal Dynamics

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

Liu, Guodong; Ollis, Thomas B.; Xiao, Bailu

Here, this paper proposes a Mixed Integer Conic Programming (MICP) model for community microgrids considering the network operational constraints and building thermal dynamics. The proposed optimization model optimizes not only the operating cost, including fuel cost, purchasing cost, battery degradation cost, voluntary load shedding cost and the cost associated with customer discomfort due to room temperature deviation from the set point, but also several performance indices, including voltage deviation, network power loss and power factor at the Point of Common Coupling (PCC). In particular, the detailed thermal dynamic model of buildings is integrated into the distribution optimal power flow (D-OPF)more » model for the optimal operation of community microgrids. The heating, ventilation and air-conditioning (HVAC) systems can be scheduled intelligently to reduce the electricity cost while maintaining the indoor temperature in the comfort range set by customers. Numerical simulation results show the effectiveness of the proposed model and significant saving in electricity cost could be achieved with network operational constraints satisfied.« less

Community Microgrid Scheduling Considering Network Operational Constraints and Building Thermal Dynamics

DOE PAGES

Liu, Guodong; Ollis, Thomas B.; Xiao, Bailu; ...

2017-10-10

Here, this paper proposes a Mixed Integer Conic Programming (MICP) model for community microgrids considering the network operational constraints and building thermal dynamics. The proposed optimization model optimizes not only the operating cost, including fuel cost, purchasing cost, battery degradation cost, voluntary load shedding cost and the cost associated with customer discomfort due to room temperature deviation from the set point, but also several performance indices, including voltage deviation, network power loss and power factor at the Point of Common Coupling (PCC). In particular, the detailed thermal dynamic model of buildings is integrated into the distribution optimal power flow (D-OPF)more » model for the optimal operation of community microgrids. The heating, ventilation and air-conditioning (HVAC) systems can be scheduled intelligently to reduce the electricity cost while maintaining the indoor temperature in the comfort range set by customers. Numerical simulation results show the effectiveness of the proposed model and significant saving in electricity cost could be achieved with network operational constraints satisfied.« less

A biologically inspired network design model.

PubMed

Zhang, Xiaoge; Adamatzky, Andrew; Chan, Felix T S; Deng, Yong; Yang, Hai; Yang, Xin-She; Tsompanas, Michail-Antisthenis I; Sirakoulis, Georgios Ch; Mahadevan, Sankaran

2015-06-04

A network design problem is to select a subset of links in a transport network that satisfy passengers or cargo transportation demands while minimizing the overall costs of the transportation. We propose a mathematical model of the foraging behaviour of slime mould P. polycephalum to solve the network design problem and construct optimal transport networks. In our algorithm, a traffic flow between any two cities is estimated using a gravity model. The flow is imitated by the model of the slime mould. The algorithm model converges to a steady state, which represents a solution of the problem. We validate our approach on examples of major transport networks in Mexico and China. By comparing networks developed in our approach with the man-made highways, networks developed by the slime mould, and a cellular automata model inspired by slime mould, we demonstrate the flexibility and efficiency of our approach.

A Biologically Inspired Network Design Model

PubMed Central

Zhang, Xiaoge; Adamatzky, Andrew; Chan, Felix T.S.; Deng, Yong; Yang, Hai; Yang, Xin-She; Tsompanas, Michail-Antisthenis I.; Sirakoulis, Georgios Ch.; Mahadevan, Sankaran

2015-01-01

A network design problem is to select a subset of links in a transport network that satisfy passengers or cargo transportation demands while minimizing the overall costs of the transportation. We propose a mathematical model of the foraging behaviour of slime mould P. polycephalum to solve the network design problem and construct optimal transport networks. In our algorithm, a traffic flow between any two cities is estimated using a gravity model. The flow is imitated by the model of the slime mould. The algorithm model converges to a steady state, which represents a solution of the problem. We validate our approach on examples of major transport networks in Mexico and China. By comparing networks developed in our approach with the man-made highways, networks developed by the slime mould, and a cellular automata model inspired by slime mould, we demonstrate the flexibility and efficiency of our approach. PMID:26041508

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

NASA Astrophysics Data System (ADS)

Huang, Lei; Pan, Feng

2007-09-01

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

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

NASA Astrophysics Data System (ADS)

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

2016-12-01

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

Decentralized Optimal Dispatch of Photovoltaic Inverters in Residential Distribution Systems

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

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

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

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.

Competitive game theoretic optimal routing in optical networks

NASA Astrophysics Data System (ADS)

Yassine, Abdulsalam; Kabranov, Ognian; Makrakis, Dimitrios

2002-09-01

Optical transport service providers need control and optimization strategies for wavelength management, network provisioning, restoration and protection, allowing them to define and deploy new services and maintain competitiveness. In this paper, we investigate a game theory based model for wavelength and flow assignment in multi wavelength optical networks, consisting of several backbone long-haul optical network transport service providers (TSPs) who are offering their services -in terms of bandwidth- to Internet service providers (ISPs). The ISPs act as brokers or agents between the TSP and end user. The agent (ISP) buys services (bandwidth) from the TSP. The TSPs compete among themselves to sell their services and maintain profitability. We present a case study, demonstrating the impact of different bandwidth broker demands on the supplier's profit and the price paid by the network broker.

Graph Design via Convex Optimization: Online and Distributed Perspectives

NASA Astrophysics Data System (ADS)

Meng, De

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

Optimized Structure of the Traffic Flow Forecasting Model With a Deep Learning Approach.

PubMed

Yang, Hao-Fan; Dillon, Tharam S; Chen, Yi-Ping Phoebe

2017-10-01

Forecasting accuracy is an important issue for successful intelligent traffic management, especially in the domain of traffic efficiency and congestion reduction. The dawning of the big data era brings opportunities to greatly improve prediction accuracy. In this paper, we propose a novel model, stacked autoencoder Levenberg-Marquardt model, which is a type of deep architecture of neural network approach aiming to improve forecasting accuracy. The proposed model is designed using the Taguchi method to develop an optimized structure and to learn traffic flow features through layer-by-layer feature granulation with a greedy layerwise unsupervised learning algorithm. It is applied to real-world data collected from the M6 freeway in the U.K. and is compared with three existing traffic predictors. To the best of our knowledge, this is the first time that an optimized structure of the traffic flow forecasting model with a deep learning approach is presented. The evaluation results demonstrate that the proposed model with an optimized structure has superior performance in traffic flow forecasting.

Optimal interdependence between networks for the evolution of cooperation.

PubMed

Wang, Zhen; Szolnoki, Attila; Perc, Matjaž

2013-01-01

Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality.

Optimal interdependence between networks for the evolution of cooperation

PubMed Central

Wang, Zhen; Szolnoki, Attila; Perc, Matjaž

2013-01-01

Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity and enhanced reciprocity that is out of reach on isolated networks, we here address the question just how much interdependence there should be. Intuitively, one might assume the more the better. However, we show that in fact only an intermediate density of sufficiently strong interactions between networks warrants an optimal resolution of social dilemmas. This is due to an intricate interplay between the heterogeneity that causes an asymmetric strategy flow because of the additional links between the networks, and the independent formation of cooperative patterns on each individual network. Presented results are robust to variations of the strategy updating rule, the topology of interdependent networks, and the governing social dilemma, thus suggesting a high degree of universality. PMID:23959086

A Neural Network Aero Design System for Advanced Turbo-Engines

NASA Technical Reports Server (NTRS)

Sanz, Jose M.

1999-01-01

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

Advanced Distribution Network Modelling with Distributed Energy Resources

NASA Astrophysics Data System (ADS)

O'Connell, Alison

The addition of new distributed energy resources, such as electric vehicles, photovoltaics, and storage, to low voltage distribution networks means that these networks will undergo major changes in the future. Traditionally, distribution systems would have been a passive part of the wider power system, delivering electricity to the customer and not needing much control or management. However, the introduction of these new technologies may cause unforeseen issues for distribution networks, due to the fact that they were not considered when the networks were originally designed. This thesis examines different types of technologies that may begin to emerge on distribution systems, as well as the resulting challenges that they may impose. Three-phase models of distribution networks are developed and subsequently utilised as test cases. Various management strategies are devised for the purposes of controlling distributed resources from a distribution network perspective. The aim of the management strategies is to mitigate those issues that distributed resources may cause, while also keeping customers' preferences in mind. A rolling optimisation formulation is proposed as an operational tool which can manage distributed resources, while also accounting for the uncertainties that these resources may present. Network sensitivities for a particular feeder are extracted from a three-phase load flow methodology and incorporated into an optimisation. Electric vehicles are the focus of the work, although the method could be applied to other types of resources. The aim is to minimise the cost of electric vehicle charging over a 24-hour time horizon by controlling the charge rates and timings of the vehicles. The results demonstrate the advantage that controlled EV charging can have over an uncontrolled case, as well as the benefits provided by the rolling formulation and updated inputs in terms of cost and energy delivered to customers. Building upon the rolling optimisation, a three-phase optimal power flow method is developed. The formulation has the capability to provide optimal solutions for distribution system control variables, for a chosen objective function, subject to required constraints. It can, therefore, be utilised for numerous technologies and applications. The three-phase optimal power flow is employed to manage various distributed resources, such as photovoltaics and storage, as well as distribution equipment, including tap changers and switches. The flexibility of the methodology allows it to be applied in both an operational and a planning capacity. The three-phase optimal power flow is employed in an operational planning capacity to determine volt-var curves for distributed photovoltaic inverters. The formulation finds optimal reactive power settings for a number of load and solar scenarios and uses these reactive power points to create volt-var curves. Volt-var curves are determined for 10 PV systems on a test feeder. A universal curve is also determined which is applicable to all inverters. The curves are validated by testing them in a power flow setting over a 24-hour test period. The curves are shown to provide advantages to the feeder in terms of reduction of voltage deviations and unbalance, with the individual curves proving to be more effective. It is also shown that adding a new PV system to the feeder only requires analysis for that system. In order to represent the uncertainties that inherently occur on distribution systems, an information gap decision theory method is also proposed and integrated into the three-phase optimal power flow formulation. This allows for robust network decisions to be made using only an initial prediction for what the uncertain parameter will be. The work determines tap and switch settings for a test network with demand being treated as uncertain. The aim is to keep losses below a predefined acceptable value. The results provide the decision maker with the maximum possible variation in demand for a given acceptable variation in the losses. A validation is performed with the resulting tap and switch settings being implemented, and shows that the control decisions provided by the formulation keep losses below the acceptable value while adhering to the limits imposed by the network.

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

NASA Astrophysics Data System (ADS)

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

2016-03-01

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

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

PubMed Central

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

2016-01-01

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

An iteration algorithm for optimal network flows

NASA Astrophysics Data System (ADS)

Woong, C. J.

1983-09-01

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

Vascularized networks with two optimized channel sizes

NASA Astrophysics Data System (ADS)

Wang, K.-M.; Lorente, S.; Bejan, A.

2006-07-01

This paper reports the development of optimal vascularization for supplying self-healing smart materials with liquid that fills and seals the cracks that may occur throughout their volume. The vascularization consists of two-dimensional grids of interconnected orthogonal channels with two hydraulic diameters (D1, D2). The smallest square loop is designed to match the size (d) of the smallest crack. The network is sealed with respect to the outside and is filled with pressurized liquid. In this work, the crack site is modelled as a small spherical volume of diameter d. When a crack is formed, fluid flows from neighbouring channels to the crack site. This volume-to-point flow is optimized using two formulations: (1) incompressible liquid from steady constant-strength sources located in every node of the grid and from sources located equidistantly on the perimeter of the vascularized body of length scale L and (2) slightly compressible liquid from an initially pressurized grid discharging in time-dependent fashion into one crack site. The flow in every channel is laminar and fully developed. The objectives are (a) to minimize the global resistance to the flow from the grid to the crack site and (b) to minimize the time of discharge from the pressurized grid to the crack site. It is shown that methods (a) and (b) yield similar results. There is an optimal ratio of channel diameters D2/D1 < 1, and it decreases as the grid fineness (L/d) increases. The global flow resistance of the grid with optimized ratio of diameters is approximately half of the resistance of the corresponding grid with one channel size (D1 = D2). The optimized ratio of diameters and the minimized global resistance depend on how the grid intersects the crack site: this effect is minor and stresses the robustness of the vascularized design.

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

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

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

2016-09-01

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

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.

Structural Efficiency of Percolated Landscapes in Flow Networks

PubMed Central

Serrano, M. Ángeles; De Los Rios, Paolo

2008-01-01

The large-scale structure of complex systems is intimately related to their functionality and evolution. In particular, global transport processes in flow networks rely on the presence of directed pathways from input to output nodes and edges, which organize in macroscopic connected components. However, the precise relation between such structures and functional or evolutionary aspects remains to be understood. Here, we investigate which are the constraints that the global structure of directed networks imposes on transport phenomena. We define quantitatively under minimal assumptions the structural efficiency of networks to determine how robust communication between the core and the peripheral components through interface edges could be. Furthermore, we assess that optimal topologies in terms of access to the core should look like “hairy balls” so to minimize bottleneck effects and the sensitivity to failures. We illustrate our investigation with the analysis of three real networks with very different purposes and shaped by very different dynamics and time-scales–the Internet customer-provider set of relationships, the nervous system of the worm Caenorhabditis elegans, and the metabolism of the bacterium Escherichia coli. Our findings prove that different global connectivity structures result in different levels of structural efficiency. In particular, biological networks seem to be close to the optimal layout. PMID:18985157

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

NASA Astrophysics Data System (ADS)

Giang, Pham Thanh; Nakagawa, Kenji

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

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

Altered Cerebral Blood Flow Covariance Network in Schizophrenia.

PubMed

Liu, Feng; Zhuo, Chuanjun; Yu, Chunshui

2016-01-01

Many studies have shown abnormal cerebral blood flow (CBF) in schizophrenia; however, it remains unclear how topological properties of CBF network are altered in this disorder. Here, arterial spin labeling (ASL) MRI was employed to measure resting-state CBF in 96 schizophrenia patients and 91 healthy controls. CBF covariance network of each group was constructed by calculating across-subject CBF covariance between 90 brain regions. Graph theory was used to compare intergroup differences in global and nodal topological measures of the network. Both schizophrenia patients and healthy controls had small-world topology in CBF covariance networks, implying an optimal balance between functional segregation and integration. Compared with healthy controls, schizophrenia patients showed reduced small-worldness, normalized clustering coefficient and local efficiency of the network, suggesting a shift toward randomized network topology in schizophrenia. Furthermore, schizophrenia patients exhibited altered nodal centrality in the perceptual-, affective-, language-, and spatial-related regions, indicating functional disturbance of these systems in schizophrenia. This study demonstrated for the first time that schizophrenia patients have disrupted topological properties in CBF covariance network, which provides a new perspective (efficiency of blood flow distribution between brain regions) for understanding neural mechanisms of schizophrenia.

An optimization model for the US Air-Traffic System

NASA Technical Reports Server (NTRS)

Mulvey, J. M.

1986-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2015-12-01

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

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.

Networking for large-scale science: infrastructure, provisioning, transport and application mapping

NASA Astrophysics Data System (ADS)

Rao, Nageswara S.; Carter, Steven M.; Wu, Qishi; Wing, William R.; Zhu, Mengxia; Mezzacappa, Anthony; Veeraraghavan, Malathi; Blondin, John M.

2005-01-01

Large-scale science computations and experiments require unprecedented network capabilities in the form of large bandwidth and dynamically stable connections to support data transfers, interactive visualizations, and monitoring and steering operations. A number of component technologies dealing with the infrastructure, provisioning, transport and application mappings must be developed and/or optimized to achieve these capabilities. We present a brief account of the following technologies that contribute toward achieving these network capabilities: (a) DOE UltraScienceNet and NSF CHEETAH network testbeds that provide on-demand and scheduled dedicated network connections; (b) experimental results on transport protocols that achieve close to 100% utilization on dedicated 1Gbps wide-area channels; (c) a scheme for optimally mapping a visualization pipeline onto a network to minimize the end-to-end delays; and (d) interconnect configuration and protocols that provides multiple Gbps flows from Cray X1 to external hosts.

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…

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

NASA Astrophysics Data System (ADS)

Wu, Dongjun

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

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

PubMed Central

Tengku Hashim, Tengku Juhana; Mohamed, Azah

2017-01-01

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

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

PubMed

Tengku Hashim, Tengku Juhana; Mohamed, Azah

2017-01-01

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

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

NASA Astrophysics Data System (ADS)

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

2017-01-01

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

Optimization of Operation Parameters for Helical Flow Cleanout with Supercritical CO2 in Horizontal Wells Using Back-Propagation Artificial Neural Network.

PubMed

Song, Xianzhi; Peng, Chi; Li, Gensheng; He, Zhenguo; Wang, Haizhu

2016-01-01

Sand production and blockage are common during the drilling and production of horizontal oil and gas wells as a result of formation breakdown. The use of high-pressure rotating jets and annular helical flow is an effective way to enhance horizontal wellbore cleanout. In this paper, we propose the idea of using supercritical CO2 (SC-CO2) as washing fluid in water-sensitive formation. SC-CO2 is manifested to be effective in preventing formation damage and enhancing production rate as drilling fluid, which justifies tis potential in wellbore cleanout. In order to investigate the effectiveness of SC-CO2 helical flow cleanout, we perform the numerical study on the annular flow field, which significantly affects sand cleanout efficiency, of SC-CO2 jets in horizontal wellbore. Based on the field data, the geometry model and mathematical models were built. Then a numerical simulation of the annular helical flow field by SC-CO2 jets was accomplished. The influences of several key parameters were investigated, and SC-CO2 jets were compared to conventional water jets. The results show that flow rate, ambient temperature, jet temperature, and nozzle assemblies play the most important roles on wellbore flow field. Once the difference between ambient temperatures and jet temperatures is kept constant, the wellbore velocity distributions will not change. With increasing lateral nozzle size or decreasing rear/forward nozzle size, suspending ability of SC-CO2 flow improves obviously. A back-propagation artificial neural network (BP-ANN) was successfully employed to match the operation parameters and SC-CO2 flow velocities. A comprehensive model was achieved to optimize the operation parameters according to two strategies: cost-saving strategy and local optimal strategy. This paper can help to understand the distinct characteristics of SC-CO2 flow. And it is the first time that the BP-ANN is introduced to analyze the flow field during wellbore cleanout in horizontal wells.

Optimization of Operation Parameters for Helical Flow Cleanout with Supercritical CO2 in Horizontal Wells Using Back-Propagation Artificial Neural Network

PubMed Central

Song, Xianzhi; Peng, Chi; Li, Gensheng

2016-01-01

Sand production and blockage are common during the drilling and production of horizontal oil and gas wells as a result of formation breakdown. The use of high-pressure rotating jets and annular helical flow is an effective way to enhance horizontal wellbore cleanout. In this paper, we propose the idea of using supercritical CO2 (SC-CO2) as washing fluid in water-sensitive formation. SC-CO2 is manifested to be effective in preventing formation damage and enhancing production rate as drilling fluid, which justifies tis potential in wellbore cleanout. In order to investigate the effectiveness of SC-CO2 helical flow cleanout, we perform the numerical study on the annular flow field, which significantly affects sand cleanout efficiency, of SC-CO2 jets in horizontal wellbore. Based on the field data, the geometry model and mathematical models were built. Then a numerical simulation of the annular helical flow field by SC-CO2 jets was accomplished. The influences of several key parameters were investigated, and SC-CO2 jets were compared to conventional water jets. The results show that flow rate, ambient temperature, jet temperature, and nozzle assemblies play the most important roles on wellbore flow field. Once the difference between ambient temperatures and jet temperatures is kept constant, the wellbore velocity distributions will not change. With increasing lateral nozzle size or decreasing rear/forward nozzle size, suspending ability of SC-CO2 flow improves obviously. A back-propagation artificial neural network (BP-ANN) was successfully employed to match the operation parameters and SC-CO2 flow velocities. A comprehensive model was achieved to optimize the operation parameters according to two strategies: cost-saving strategy and local optimal strategy. This paper can help to understand the distinct characteristics of SC-CO2 flow. And it is the first time that the BP-ANN is introduced to analyze the flow field during wellbore cleanout in horizontal wells. PMID:27249026

Do Vascular Networks Branch Optimally or Randomly across Spatial Scales?

PubMed Central

Newberry, Mitchell G.; Savage, Van M.

2016-01-01

Modern models that derive allometric relationships between metabolic rate and body mass are based on the architectural design of the cardiovascular system and presume sibling vessels are symmetric in terms of radius, length, flow rate, and pressure. Here, we study the cardiovascular structure of the human head and torso and of a mouse lung based on three-dimensional images processed via our software Angicart. In contrast to modern allometric theories, we find systematic patterns of asymmetry in vascular branching, potentially explaining previously documented mismatches between predictions (power-law or concave curvature) and observed empirical data (convex curvature) for the allometric scaling of metabolic rate. To examine why these systematic asymmetries in vascular branching might arise, we construct a mathematical framework to derive predictions based on local, junction-level optimality principles that have been proposed to be favored in the course of natural selection and development. The two most commonly used principles are material-cost optimizations (construction materials or blood volume) and optimization of efficient flow via minimization of power loss. We show that material-cost optimization solutions match with distributions for asymmetric branching across the whole network but do not match well for individual junctions. Consequently, we also explore random branching that is constrained at scales that range from local (junction-level) to global (whole network). We find that material-cost optimizations are the strongest predictor of vascular branching in the human head and torso, whereas locally or intermediately constrained random branching is comparable to material-cost optimizations for the mouse lung. These differences could be attributable to developmentally-programmed local branching for larger vessels and constrained random branching for smaller vessels. PMID:27902691

Machine Learning Interface for Medical Image Analysis.

PubMed

Zhang, Yi C; Kagen, Alexander C

2017-10-01

TensorFlow is a second-generation open-source machine learning software library with a built-in framework for implementing neural networks in wide variety of perceptual tasks. Although TensorFlow usage is well established with computer vision datasets, the TensorFlow interface with DICOM formats for medical imaging remains to be established. Our goal is to extend the TensorFlow API to accept raw DICOM images as input; 1513 DaTscan DICOM images were obtained from the Parkinson's Progression Markers Initiative (PPMI) database. DICOM pixel intensities were extracted and shaped into tensors, or n-dimensional arrays, to populate the training, validation, and test input datasets for machine learning. A simple neural network was constructed in TensorFlow to classify images into normal or Parkinson's disease groups. Training was executed over 1000 iterations for each cross-validation set. The gradient descent optimization and Adagrad optimization algorithms were used to minimize cross-entropy between the predicted and ground-truth labels. Cross-validation was performed ten times to produce a mean accuracy of 0.938 ± 0.047 (95 % CI 0.908-0.967). The mean sensitivity was 0.974 ± 0.043 (95 % CI 0.947-1.00) and mean specificity was 0.822 ± 0.207 (95 % CI 0.694-0.950). We extended the TensorFlow API to enable DICOM compatibility in the context of DaTscan image analysis. We implemented a neural network classifier that produces diagnostic accuracies on par with excellent results from previous machine learning models. These results indicate the potential role of TensorFlow as a useful adjunct diagnostic tool in the clinical setting.

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.

Optical multicast system for data center networks.

PubMed

Samadi, Payman; Gupta, Varun; Xu, Junjie; Wang, Howard; Zussman, Gil; Bergman, Keren

2015-08-24

We present the design and experimental evaluation of an Optical Multicast System for Data Center Networks, a hardware-software system architecture that uniquely integrates passive optical splitters in a hybrid network architecture for faster and simpler delivery of multicast traffic flows. An application-driven control plane manages the integrated optical and electronic switched traffic routing in the data plane layer. The control plane includes a resource allocation algorithm to optimally assign optical splitters to the flows. The hardware architecture is built on a hybrid network with both Electronic Packet Switching (EPS) and Optical Circuit Switching (OCS) networks to aggregate Top-of-Rack switches. The OCS is also the connectivity substrate of splitters to the optical network. The optical multicast system implementation requires only commodity optical components. We built a prototype and developed a simulation environment to evaluate the performance of the system for bulk multicasting. Experimental and numerical results show simultaneous delivery of multicast flows to all receivers with steady throughput. Compared to IP multicast that is the electronic counterpart, optical multicast performs with less protocol complexity and reduced energy consumption. Compared to peer-to-peer multicast methods, it achieves at minimum an order of magnitude higher throughput for flows under 250 MB with significantly less connection overheads. Furthermore, for delivering 20 TB of data containing only 15% multicast flows, it reduces the total delivery energy consumption by 50% and improves latency by 55% compared to a data center with a sole non-blocking EPS network.

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

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.

Transitions from trees to cycles in adaptive flow networks

NASA Astrophysics Data System (ADS)

Martens, Erik A.; Klemm, Konstantin

2017-11-01

Transport networks are crucial to the functioning of natural and technological systems. Nature features transport networks that are adaptive over a vast range of parameters, thus providing an impressive level of robustness in supply. Theoretical and experimental studies have found that real-world transport networks exhibit both tree-like motifs and cycles. When the network is subject to load fluctuations, the presence of cyclic motifs may help to reduce flow fluctuations and, thus, render supply in the network more robust. While previous studies considered network topology via optimization principles, here, we take a dynamical systems approach and study a simple model of a flow network with dynamically adapting weights (conductances). We assume a spatially non-uniform distribution of rapidly fluctuating loads in the sinks and investigate what network configurations are dynamically stable. The network converges to a spatially non-uniform stable configuration composed of both cyclic and tree-like structures. Cyclic structures emerge locally in a transcritical bifurcation as the amplitude of the load fluctuations is increased. The resulting adaptive dynamics thus partitions the network into two distinct regions with cyclic and tree-like structures. The location of the boundary between these two regions is determined by the amplitude of the fluctuations. These findings may explain why natural transport networks display cyclic structures in the micro-vascular regions near terminal nodes, but tree-like features in the regions with larger veins.

Report on architecture description for the INFLO prototype.

DOT National Transportation Integrated Search

2014-01-01

This report documents the Architecture Description for the implementation of the Intelligent Network Flow Optimization (INFLO) Prototype bundle within the Dynamic Mobility Applications (DMA) portion of the Connected Vehicle Program. The intent is to ...

Network aggregation in transportation planning models

DOT National Transportation Integrated Search

1979-06-01

This report contains six papers addressed at mathematical and computation aspects of an extraction aggregation model often employed in transportation planning studies. This model concerns the optimal flowing of an extracted subnetwork of a given netw...

Communication efficiency and congestion of signal traffic in large-scale brain networks.

PubMed

Mišić, Bratislav; Sporns, Olaf; McIntosh, Anthony R

2014-01-01

The complex connectivity of the cerebral cortex suggests that inter-regional communication is a primary function. Using computational modeling, we show that anatomical connectivity may be a major determinant for global information flow in brain networks. A macaque brain network was implemented as a communication network in which signal units flowed between grey matter nodes along white matter paths. Compared to degree-matched surrogate networks, information flow on the macaque brain network was characterized by higher loss rates, faster transit times and lower throughput, suggesting that neural connectivity may be optimized for speed rather than fidelity. Much of global communication was mediated by a "rich club" of hub regions: a sub-graph comprised of high-degree nodes that are more densely interconnected with each other than predicted by chance. First, macaque communication patterns most closely resembled those observed for a synthetic rich club network, but were less similar to those seen in a synthetic small world network, suggesting that the former is a more fundamental feature of brain network topology. Second, rich club regions attracted the most signal traffic and likewise, connections between rich club regions carried more traffic than connections between non-rich club regions. Third, a number of rich club regions were significantly under-congested, suggesting that macaque connectivity actively shapes information flow, funneling traffic towards some nodes and away from others. Together, our results indicate a critical role of the rich club of hub nodes in dynamic aspects of global brain communication.

Communication Efficiency and Congestion of Signal Traffic in Large-Scale Brain Networks

PubMed Central

Mišić, Bratislav; Sporns, Olaf; McIntosh, Anthony R.

2014-01-01

The complex connectivity of the cerebral cortex suggests that inter-regional communication is a primary function. Using computational modeling, we show that anatomical connectivity may be a major determinant for global information flow in brain networks. A macaque brain network was implemented as a communication network in which signal units flowed between grey matter nodes along white matter paths. Compared to degree-matched surrogate networks, information flow on the macaque brain network was characterized by higher loss rates, faster transit times and lower throughput, suggesting that neural connectivity may be optimized for speed rather than fidelity. Much of global communication was mediated by a “rich club” of hub regions: a sub-graph comprised of high-degree nodes that are more densely interconnected with each other than predicted by chance. First, macaque communication patterns most closely resembled those observed for a synthetic rich club network, but were less similar to those seen in a synthetic small world network, suggesting that the former is a more fundamental feature of brain network topology. Second, rich club regions attracted the most signal traffic and likewise, connections between rich club regions carried more traffic than connections between non-rich club regions. Third, a number of rich club regions were significantly under-congested, suggesting that macaque connectivity actively shapes information flow, funneling traffic towards some nodes and away from others. Together, our results indicate a critical role of the rich club of hub nodes in dynamic aspects of global brain communication. PMID:24415931

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.

Data-driven modeling of solar-powered urban microgrids

PubMed Central

Halu, Arda; Scala, Antonio; Khiyami, Abdulaziz; González, Marta C.

2016-01-01

Distributed generation takes center stage in today’s rapidly changing energy landscape. Particularly, locally matching demand and generation in the form of microgrids is becoming a promising alternative to the central distribution paradigm. Infrastructure networks have long been a major focus of complex networks research with their spatial considerations. We present a systemic study of solar-powered microgrids in the urban context, obeying real hourly consumption patterns and spatial constraints of the city. We propose a microgrid model and study its citywide implementation, identifying the self-sufficiency and temporal properties of microgrids. Using a simple optimization scheme, we find microgrid configurations that result in increased resilience under cost constraints. We characterize load-related failures solving power flows in the networks, and we show the robustness behavior of urban microgrids with respect to optimization using percolation methods. Our findings hint at the existence of an optimal balance between cost and robustness in urban microgrids. PMID:26824071

Data-driven modeling of solar-powered urban microgrids.

PubMed

Halu, Arda; Scala, Antonio; Khiyami, Abdulaziz; González, Marta C

2016-01-01

Distributed generation takes center stage in today's rapidly changing energy landscape. Particularly, locally matching demand and generation in the form of microgrids is becoming a promising alternative to the central distribution paradigm. Infrastructure networks have long been a major focus of complex networks research with their spatial considerations. We present a systemic study of solar-powered microgrids in the urban context, obeying real hourly consumption patterns and spatial constraints of the city. We propose a microgrid model and study its citywide implementation, identifying the self-sufficiency and temporal properties of microgrids. Using a simple optimization scheme, we find microgrid configurations that result in increased resilience under cost constraints. We characterize load-related failures solving power flows in the networks, and we show the robustness behavior of urban microgrids with respect to optimization using percolation methods. Our findings hint at the existence of an optimal balance between cost and robustness in urban microgrids.

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

NASA Technical Reports Server (NTRS)

Press, J.

1972-01-01

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

The Impact of Large Urban Structural Elements on Traffic Flow   a Case Study of Danwei and Xiaoqu in Shanghai

NASA Astrophysics Data System (ADS)

Lyu, H.; Ding, L.; Fan, H.; Meng, L.

2017-09-01

Danwei (working unit) and Xiaoqu (residential community) are two typical and unique structural urban elements in China. The interior roads of Danwei and Xiaoqu are usually not accessible for the public. Recently, there is a call for opening these interior roads to the public to improve road network structure and optimize traffic flow. In this paper we investigate the impact of Danwei and Xiaoqu on their neighbouring traffic quantitatively. By taking into consideration of origins and destinations (ODs) distributions and route selection behaviours (e.g., shortest paths), we propose an extended betweenness centrality to investigate the traffic flow in two scenarios 1) the interior roads of Danwei and Xiaoqu are excluded from urban road network, 2) the interior roads are integrated into road network. A Danwei and a Xiaoqu in Shanghai are used as the study area. The preliminary results show the feasibility of our extended betweenness centrality in investigating the traffic flow patterns and reveal the quantitative changes of the traffic flow after opening interior roads.

The Loss of Efficiency Caused by Agents’ Uncoordinated Routing in Transport Networks

PubMed Central

Wang, Junjie; Wang, Pu

2014-01-01

Large-scale daily commuting data were combined with detailed geographical information system (GIS) data to analyze the loss of transport efficiency caused by drivers’ uncoordinated routing in urban road networks. We used Price of Anarchy (POA) to quantify the loss of transport efficiency and found that both volume and distribution of human mobility demand determine the POA. In order to reduce POA, a small number of highways require considerable decreases in traffic, and their neighboring arterial roads need to attract more traffic. The magnitude of the adjustment in traffic flow can be estimated using the fundamental measure traffic flow only, which is widely available and easy to collect. Surprisingly, the most congested roads or the roads with largest traffic flow were not those requiring the most reduction of traffic. This study can offer guidance for the optimal control of urban traffic and facilitate improvements in the efficiency of transport networks. PMID:25349995

Machine learning framework for analysis of transport through complex networks in porous, granular media: A focus on permeability

NASA Astrophysics Data System (ADS)

van der Linden, Joost H.; Narsilio, Guillermo A.; Tordesillas, Antoinette

2016-08-01

We present a data-driven framework to study the relationship between fluid flow at the macroscale and the internal pore structure, across the micro- and mesoscales, in porous, granular media. Sphere packings with varying particle size distribution and confining pressure are generated using the discrete element method. For each sample, a finite element analysis of the fluid flow is performed to compute the permeability. We construct a pore network and a particle contact network to quantify the connectivity of the pores and particles across the mesoscopic spatial scales. Machine learning techniques for feature selection are employed to identify sets of microstructural properties and multiscale complex network features that optimally characterize permeability. We find a linear correlation (in log-log scale) between permeability and the average closeness centrality of the weighted pore network. With the pore network links weighted by the local conductance, the average closeness centrality represents a multiscale measure of efficiency of flow through the pore network in terms of the mean geodesic distance (or shortest path) between all pore bodies in the pore network. Specifically, this study objectively quantifies a hypothesized link between high permeability and efficient shortest paths that thread through relatively large pore bodies connected to each other by high conductance pore throats, embodying connectivity and pore structure.

An Efficacious Multi-Objective Fuzzy Linear Programming Approach for Optimal Power Flow Considering Distributed Generation.

PubMed

Warid, Warid; Hizam, Hashim; Mariun, Norman; Abdul-Wahab, Noor Izzri

2016-01-01

This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality.

An Efficacious Multi-Objective Fuzzy Linear Programming Approach for Optimal Power Flow Considering Distributed Generation

PubMed Central

Warid, Warid; Hizam, Hashim; Mariun, Norman; Abdul-Wahab, Noor Izzri

2016-01-01

This paper proposes a new formulation for the multi-objective optimal power flow (MOOPF) problem for meshed power networks considering distributed generation. An efficacious multi-objective fuzzy linear programming optimization (MFLP) algorithm is proposed to solve the aforementioned problem with and without considering the distributed generation (DG) effect. A variant combination of objectives is considered for simultaneous optimization, including power loss, voltage stability, and shunt capacitors MVAR reserve. Fuzzy membership functions for these objectives are designed with extreme targets, whereas the inequality constraints are treated as hard constraints. The multi-objective fuzzy optimal power flow (OPF) formulation was converted into a crisp OPF in a successive linear programming (SLP) framework and solved using an efficient interior point method (IPM). To test the efficacy of the proposed approach, simulations are performed on the IEEE 30-busand IEEE 118-bus test systems. The MFLP optimization is solved for several optimization cases. The obtained results are compared with those presented in the literature. A unique solution with a high satisfaction for the assigned targets is gained. Results demonstrate the effectiveness of the proposed MFLP technique in terms of solution optimality and rapid convergence. Moreover, the results indicate that using the optimal DG location with the MFLP algorithm provides the solution with the highest quality. PMID:26954783

Multi-objective optimization of a low specific speed centrifugal pump using an evolutionary algorithm

NASA Astrophysics Data System (ADS)

An, Zhao; Zhounian, Lai; Peng, Wu; Linlin, Cao; Dazhuan, Wu

2016-07-01

This paper describes the shape optimization of a low specific speed centrifugal pump at the design point. The target pump has already been manually modified on the basis of empirical knowledge. A genetic algorithm (NSGA-II) with certain enhancements is adopted to improve its performance further with respect to two goals. In order to limit the number of design variables without losing geometric information, the impeller is parametrized using the Bézier curve and a B-spline. Numerical simulation based on a Reynolds averaged Navier-Stokes (RANS) turbulent model is done in parallel to evaluate the flow field. A back-propagating neural network is constructed as a surrogate for performance prediction to save computing time, while initial samples are selected according to an orthogonal array. Then global Pareto-optimal solutions are obtained and analysed. The results manifest that unexpected flow structures, such as the secondary flow on the meridian plane, have diminished or vanished in the optimized pump.

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.

System design document for the INFLO prototype.

DOT National Transportation Integrated Search

2014-03-01

This report documents the high level System Design Document (SDD) for the prototype development and demonstration of the Intelligent Network Flow Optimization (INFLO) application bundle, with a focus on the Speed Harmonization (SPD-HARM) and Queue Wa...

Report on dynamic speed harmonization and queue warning algorithm design.

DOT National Transportation Integrated Search

2014-02-01

This report provides a detailed description of the algorithms that will be used to generate harmonized recommended speeds and queue warning information in the proposed Intelligent Network Flow Optimization (INFLO) prototype. This document describes t...

Report on detailed requirements for the INFLO prototype.

DOT National Transportation Integrated Search

2013-12-01

This report documents the System Requirements for the implementation of the Intelligent Network Flow Optimization (INFLO) Prototype bundle within the Dynamic Mobility Applications (DMA) portion of the Connected Vehicle Program. It builds off of the p...

Intelligent Network Flow Optimization (INFLO) prototype : Seattle small-scale demonstration plan.

DOT National Transportation Integrated Search

2015-01-01

This report describes the INFLO Prototype Small-Scale Demonstration to be performed in Seattle Washington. This demonstration is intended to demonstrate that the INFLO Prototype, previously demonstrated in a controlled environment, functions well in ...

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.

Loop optimization for tensor network renormalization

NASA Astrophysics Data System (ADS)

Yang, Shuo; Gu, Zheng-Cheng; Wen, Xiao-Gang

We introduce a tensor renormalization group scheme for coarse-graining a two-dimensional tensor network, which can be successfully applied to both classical and quantum systems on and off criticality. The key idea of our scheme is to deform a 2D tensor network into small loops and then optimize tensors on each loop. In this way we remove short-range entanglement at each iteration step, and significantly improve the accuracy and stability of the renormalization flow. We demonstrate our algorithm in the classical Ising model and a frustrated 2D quantum model. NSF Grant No. DMR-1005541 and NSFC 11274192, BMO Financial Group, John Templeton Foundation, Government of Canada through Industry Canada, Province of Ontario through the Ministry of Economic Development & Innovation.

Robust Distribution Network Reconfiguration

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

Lee, Changhyeok; Liu, Cong; Mehrotra, Sanjay

2015-03-01

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

Prediction of silicon oxynitride plasma etching using a generalized regression neural network

NASA Astrophysics Data System (ADS)

Kim, Byungwhan; Lee, Byung Teak

2005-08-01

A prediction model of silicon oxynitride (SiON) etching was constructed using a neural network. Model prediction performance was improved by means of genetic algorithm. The etching was conducted in a C2F6 inductively coupled plasma. A 24 full factorial experiment was employed to systematically characterize parameter effects on SiON etching. The process parameters include radio frequency source power, bias power, pressure, and C2F6 flow rate. To test the appropriateness of the trained model, additional 16 experiments were conducted. For comparison, four types of statistical regression models were built. Compared to the best regression model, the optimized neural network model demonstrated an improvement of about 52%. The optimized model was used to infer etch mechanisms as a function of parameters. The pressure effect was noticeably large only as relatively large ion bombardment was maintained in the process chamber. Ion-bombardment-activated polymer deposition played the most significant role in interpreting the complex effect of bias power or C2F6 flow rate. Moreover, [CF2] was expected to be the predominant precursor to polymer deposition.

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.

Models based on "out-of Kilter" algorithm

NASA Astrophysics Data System (ADS)

Adler, M. J.; Drobot, R.

2012-04-01

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

Cascade Optimization for Aircraft Engines With Regression and Neural Network Analysis - Approximators

NASA Technical Reports Server (NTRS)

Patnaik, Surya N.; Guptill, James D.; Hopkins, Dale A.; Lavelle, Thomas M.

2000-01-01

The NASA Engine Performance Program (NEPP) can configure and analyze almost any type of gas turbine engine that can be generated through the interconnection of a set of standard physical components. In addition, the code can optimize engine performance by changing adjustable variables under a set of constraints. However, for engine cycle problems at certain operating points, the NEPP code can encounter difficulties: nonconvergence in the currently implemented Powell's optimization algorithm and deficiencies in the Newton-Raphson solver during engine balancing. A project was undertaken to correct these deficiencies. Nonconvergence was avoided through a cascade optimization strategy, and deficiencies associated with engine balancing were eliminated through neural network and linear regression methods. An approximation-interspersed cascade strategy was used to optimize the engine's operation over its flight envelope. Replacement of Powell's algorithm by the cascade strategy improved the optimization segment of the NEPP code. The performance of the linear regression and neural network methods as alternative engine analyzers was found to be satisfactory. This report considers two examples-a supersonic mixed-flow turbofan engine and a subsonic waverotor-topped engine-to illustrate the results, and it discusses insights gained from the improved version of the NEPP code.

Multidisciplinary Modeling Software for Analysis, Design, and Optimization of HRRLS Vehicles

NASA Technical Reports Server (NTRS)

Spradley, Lawrence W.; Lohner, Rainald; Hunt, James L.

2011-01-01

The concept for Highly Reliable Reusable Launch Systems (HRRLS) under the NASA Hypersonics project is a two-stage-to-orbit, horizontal-take-off / horizontal-landing, (HTHL) architecture with an air-breathing first stage. The first stage vehicle is a slender body with an air-breathing propulsion system that is highly integrated with the airframe. The light weight slender body will deflect significantly during flight. This global deflection affects the flow over the vehicle and into the engine and thus the loads and moments on the vehicle. High-fidelity multi-disciplinary analyses that accounts for these fluid-structures-thermal interactions are required to accurately predict the vehicle loads and resultant response. These predictions of vehicle response to multi physics loads, calculated with fluid-structural-thermal interaction, are required in order to optimize the vehicle design over its full operating range. This contract with ResearchSouth addresses one of the primary objectives of the Vehicle Technology Integration (VTI) discipline: the development of high-fidelity multi-disciplinary analysis and optimization methods and tools for HRRLS vehicles. The primary goal of this effort is the development of an integrated software system that can be used for full-vehicle optimization. This goal was accomplished by: 1) integrating the master code, FEMAP, into the multidiscipline software network to direct the coupling to assure accurate fluid-structure-thermal interaction solutions; 2) loosely-coupling the Euler flow solver FEFLO to the available and proven aeroelasticity and large deformation (FEAP) code; 3) providing a coupled Euler-boundary layer capability for rapid viscous flow simulation; 4) developing and implementing improved Euler/RANS algorithms into the FEFLO CFD code to provide accurate shock capturing, skin friction, and heat-transfer predictions for HRRLS vehicles in hypersonic flow, 5) performing a Reynolds-averaged Navier-Stokes computation on an HRRLS configuration; 6) integrating the RANS solver with the FEAP code for coupled fluid-structure-thermal capability; and 7) integrating the existing NASA SRGULL propulsion flow path prediction software with the FEFLO software for quasi-3D propulsion flow path predictions, 8) improving and integrating into the network, an existing adjoint-based design optimization code.

Optimal Sparse Upstream Sensor Placement for Hydrokinetic Turbines

NASA Astrophysics Data System (ADS)

Cavagnaro, Robert; Strom, Benjamin; Ross, Hannah; Hill, Craig; Polagye, Brian

2016-11-01

Accurate measurement of the flow field incident upon a hydrokinetic turbine is critical for performance evaluation during testing and setting boundary conditions in simulation. Additionally, turbine controllers may leverage real-time flow measurements. Particle image velocimetry (PIV) is capable of rendering a flow field over a wide spatial domain in a controlled, laboratory environment. However, PIV's lack of suitability for natural marine environments, high cost, and intensive post-processing diminish its potential for control applications. Conversely, sensors such as acoustic Doppler velocimeters (ADVs), are designed for field deployment and real-time measurement, but over a small spatial domain. Sparsity-promoting regression analysis such as LASSO is utilized to improve the efficacy of point measurements for real-time applications by determining optimal spatial placement for a small number of ADVs using a training set of PIV velocity fields and turbine data. The study is conducted in a flume (0.8 m2 cross-sectional area, 1 m/s flow) with laboratory-scale axial and cross-flow turbines. Predicted turbine performance utilizing the optimal sparse sensor network and associated regression model is compared to actual performance with corresponding PIV measurements.

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.

Design and optimization of non-clogging counter-flow microconcentrator for enriching epidermoid cervical carcinoma cells.

PubMed

Tran-Minh, Nhut; Dong, Tao; Su, Qianhua; Yang, Zhaochu; Jakobsen, Henrik; Karlsen, Frank

2011-02-01

Clogging failure is common for microfilters in living cells concentration; for instance, the CaSki Cell-lines (Epidermoid cervical carcinoma cells) utilizing the flat membrane structure. In order to avoid the clogging, counter-flow concentration units with turbine blade-like micropillar are proposed in microconcentrator design. Due to the unusual geometrical-profiles and extraordinary microfluidic performance, the cells blocking does not occur even at permeate entrances. A counter-flow microconcentrator was designed, with both processing layer and collecting layer arranged in terms of the fractal based honeycomb structure. The device was optimized by coupling Artificial Neuron Network (ANN) and Computational Fluid Dynamics (CFD). The excellent concentration ratio of a final microconcentrator was presented in numerical results.

Branching pattern in natural drainage network

NASA Astrophysics Data System (ADS)

Hooshyar, M.; Singh, A.; Wang, D.

2017-12-01

The formation and growth of river channels and their network evolution are governed by the erosional and depositional processes operating on the landscape due to movement of water. The branching structure of drainage network is an important feature related to the network topology and contain valuable information about the forming mechanisms of the landscape. We studied the branching patterns in natural drainage networks, extracted from 1 m Digital Elevation Models (DEMs) of 120 catchments with minimal human impacts across the United States. We showed that the junction angles have two distinct modes an the observed modes are physically explained as the optimal angles that result in minimum energy dissipation and are linked to the exponent characterizing slope-area curve. Our findings suggest that the flow regimes, debris-flow dominated or fluvial, have distinct characteristic angles which are functions of the scaling exponent of the slope-area curve. These findings enable us to understand the geomorphological signature of hydrological processes on drainage networks and develop more refined landscape evolution models.

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.

Neural Net-Based Redesign of Transonic Turbines for Improved Unsteady Aerodynamic Performance

NASA Technical Reports Server (NTRS)

Madavan, Nateri K.; Rai, Man Mohan; Huber, Frank W.

1998-01-01

A recently developed neural net-based aerodynamic design procedure is used in the redesign of a transonic turbine stage to improve its unsteady aerodynamic performance. The redesign procedure used incorporates the advantages of both traditional response surface methodology (RSM) and neural networks by employing a strategy called parameter-based partitioning of the design space. Starting from the reference design, a sequence of response surfaces based on both neural networks and polynomial fits are constructed to traverse the design space in search of an optimal solution that exhibits improved unsteady performance. The procedure combines the power of neural networks and the economy of low-order polynomials (in terms of number of simulations required and network training requirements). A time-accurate, two-dimensional, Navier-Stokes solver is used to evaluate the various intermediate designs and provide inputs to the optimization procedure. The optimization procedure yields a modified design that improves the aerodynamic performance through small changes to the reference design geometry. The computed results demonstrate the capabilities of the neural net-based design procedure, and also show the tremendous advantages that can be gained by including high-fidelity unsteady simulations that capture the relevant flow physics in the design optimization process.

A Survey on Multimedia-Based Cross-Layer Optimization in Visual Sensor Networks

PubMed Central

Costa, Daniel G.; Guedes, Luiz Affonso

2011-01-01

Visual sensor networks (VSNs) comprised of battery-operated electronic devices endowed with low-resolution cameras have expanded the applicability of a series of monitoring applications. Those types of sensors are interconnected by ad hoc error-prone wireless links, imposing stringent restrictions on available bandwidth, end-to-end delay and packet error rates. In such context, multimedia coding is required for data compression and error-resilience, also ensuring energy preservation over the path(s) toward the sink and improving the end-to-end perceptual quality of the received media. Cross-layer optimization may enhance the expected efficiency of VSNs applications, disrupting the conventional information flow of the protocol layers. When the inner characteristics of the multimedia coding techniques are exploited by cross-layer protocols and architectures, higher efficiency may be obtained in visual sensor networks. This paper surveys recent research on multimedia-based cross-layer optimization, presenting the proposed strategies and mechanisms for transmission rate adjustment, congestion control, multipath selection, energy preservation and error recovery. We note that many multimedia-based cross-layer optimization solutions have been proposed in recent years, each one bringing a wealth of contributions to visual sensor networks. PMID:22163908

Pilot-scale treatment of atrazine production wastewater by UV/O3/ultrasound: Factor effects and system optimization.

PubMed

Jing, Liang; Chen, Bing; Wen, Diya; Zheng, Jisi; Zhang, Baiyu

2017-12-01

This study shed light on removing atrazine from pesticide production wastewater using a pilot-scale UV/O 3 /ultrasound flow-through system. A significant quadratic polynomial prediction model with an adjusted R 2 of 0.90 was obtained from central composite design with response surface methodology. The optimal atrazine removal rate (97.68%) was obtained at the conditions of 75 W UV power, 10.75 g h -1 O 3 flow rate and 142.5 W ultrasound power. A Monte Carlo simulation aided artificial neural networks model was further developed to quantify the importance of O 3 flow rate (40%), UV power (30%) and ultrasound power (30%). Their individual and interaction effects were also discussed in terms of reaction kinetics. UV and ultrasound could both enhance the decomposition of O 3 and promote hydroxyl radical (OH·) formation. Nonetheless, the dose of O 3 was the dominant factor and must be optimized because excess O 3 can react with OH·, thereby reducing the rate of atrazine degradation. The presence of other organic compounds in the background matrix appreciably inhibited the degradation of atrazine, while the effects of Cl - , CO 3 2- and HCO 3 - were comparatively negligible. It was concluded that the optimization of system performance using response surface methodology and neural networks would be beneficial for scaling up the treatment by UV/O 3 /ultrasound at industrial level. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

DTIC Science & Technology

2012-10-01

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

Challenges of CAC in Heterogeneous Wireless Cognitive Networks

NASA Astrophysics Data System (ADS)

Wang, Jiazheng; Fu, Xiuhua

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

Using a genetic algorithm to optimize a water-monitoring network for accuracy and cost effectiveness

NASA Astrophysics Data System (ADS)

Julich, R. J.

2004-05-01

The purpose of this project is to determine the optimal spatial distribution of water-monitoring wells to maximize important data collection and to minimize the cost of managing the network. We have employed a genetic algorithm (GA) towards this goal. The GA uses a simple fitness measure with two parts: the first part awards a maximal score to those combinations of hydraulic head observations whose net uncertainty is closest to the value representing all observations present, thereby maximizing accuracy; the second part applies a penalty function to minimize the number of observations, thereby minimizing the overall cost of the monitoring network. We used the linear statistical inference equation to calculate standard deviations on predictions from a numerical model generated for the 501-observation Death Valley Regional Flow System as the basis for our uncertainty calculations. We have organized the results to address the following three questions: 1) what is the optimal design strategy for a genetic algorithm to optimize this problem domain; 2) what is the consistency of solutions over several optimization runs; and 3) how do these results compare to what is known about the conceptual hydrogeology? Our results indicate the genetic algorithms are a more efficient and robust method for solving this class of optimization problems than have been traditional optimization approaches.

Prediction of Aerodynamic Coefficient using Genetic Algorithm Optimized Neural Network for Sparse Data

NASA Technical Reports Server (NTRS)

Rajkumar, T.; Bardina, Jorge; Clancy, Daniel (Technical Monitor)

2002-01-01

Wind tunnels use scale models to characterize aerodynamic coefficients, Wind tunnel testing can be slow and costly due to high personnel overhead and intensive power utilization. Although manual curve fitting can be done, it is highly efficient to use a neural network to define the complex relationship between variables. Numerical simulation of complex vehicles on the wide range of conditions required for flight simulation requires static and dynamic data. Static data at low Mach numbers and angles of attack may be obtained with simpler Euler codes. Static data of stalled vehicles where zones of flow separation are usually present at higher angles of attack require Navier-Stokes simulations which are costly due to the large processing time required to attain convergence. Preliminary dynamic data may be obtained with simpler methods based on correlations and vortex methods; however, accurate prediction of the dynamic coefficients requires complex and costly numerical simulations. A reliable and fast method of predicting complex aerodynamic coefficients for flight simulation I'S presented using a neural network. The training data for the neural network are derived from numerical simulations and wind-tunnel experiments. The aerodynamic coefficients are modeled as functions of the flow characteristics and the control surfaces of the vehicle. The basic coefficients of lift, drag and pitching moment are expressed as functions of angles of attack and Mach number. The modeled and training aerodynamic coefficients show good agreement. This method shows excellent potential for rapid development of aerodynamic models for flight simulation. Genetic Algorithms (GA) are used to optimize a previously built Artificial Neural Network (ANN) that reliably predicts aerodynamic coefficients. Results indicate that the GA provided an efficient method of optimizing the ANN model to predict aerodynamic coefficients. The reliability of the ANN using the GA includes prediction of aerodynamic coefficients to an accuracy of 110% . In our problem, we would like to get an optimized neural network architecture and minimum data set. This has been accomplished within 500 training cycles of a neural network. After removing training pairs (outliers), the GA has produced much better results. The neural network constructed is a feed forward neural network with a back propagation learning mechanism. The main goal has been to free the network design process from constraints of human biases, and to discover better forms of neural network architectures. The automation of the network architecture search by genetic algorithms seems to have been the best way to achieve this goal.

Guidance on Soil Vapor Extraction Optimization

DTIC Science & Technology

2001-06-01

propagate further from the extraction well, increasing the advective flow zone round the well. Pneumatic and hydraulic fracturing are the primary methods...enhancing existing fractures and increasing the secondary fracture network. Hydraulic fracturing involves the injection of water or slurry into the

Intelligent Network Flow Optimization (INFLO) prototype : Seattle small-scale demonstration report.

DOT National Transportation Integrated Search

2015-05-01

This report describes the performance and results of the INFLO Prototype Small-Scale Demonstration. The purpose of the Small-Scale Demonstration was to deploy the INFLO Prototype System to demonstrate its functionality and performance in an operation...

Linear model describing three components of flow in karst aquifers using 18O data

USGS Publications Warehouse

Long, Andrew J.; Putnam, L.D.

2004-01-01

The stable isotope of oxygen, 18O, is used as a naturally occurring ground-water tracer. Time-series data for ??18O are analyzed to model the distinct responses and relative proportions of the conduit, intermediate, and diffuse flow components in karst aquifers. This analysis also describes mathematically the dynamics of the transient fluid interchange between conduits and diffusive networks. Conduit and intermediate flow are described by linear-systems methods, whereas diffuse flow is described by mass-balance methods. An automated optimization process estimates parameters of lognormal, Pearson type III, and gamma distributions, which are used as transfer functions in linear-systems analysis. Diffuse flow and mixing parameters also are estimated by these optimization methods. Results indicate the relative proximity of a well to a main conduit flowpath and can help to predict the movement and residence times of potential contaminants. The three-component linear model is applied to five wells, which respond to changes in the isotopic composition of point recharge water from a sinking stream in the Madison aquifer in the Black Hills of South Dakota. Flow velocities as much as 540 m/d and system memories of as much as 71 years are estimated by this method. Also, the mean, median, and standard deviation of traveltimes; time to peak response; and the relative fraction of flow for each of the three components are determined for these wells. This analysis infers that flow may branch apart and rejoin as a result of an anastomotic (or channeled) karst network.

A characterization of the coupled evolution of grain fabric and pore space using complex networks: Pore connectivity and optimized flows in the presence of shear bands

NASA Astrophysics Data System (ADS)

Russell, Scott; Walker, David M.; Tordesillas, Antoinette

2016-03-01

A framework for the multiscale characterization of the coupled evolution of the solid grain fabric and its associated pore space in dense granular media is developed. In this framework, a pseudo-dual graph transformation of the grain contact network produces a graph of pores which can be readily interpreted as a pore space network. Survivability, a new metric succinctly summarizing the connectivity of the solid grain and pore space networks, measures material robustness. The size distribution and the connectivity of pores can be characterized quantitatively through various network properties. Assortativity characterizes the pore space with respect to the parity of the number of particles enclosing the pore. Multiscale clusters of odd parity versus even parity contact cycles alternate spatially along the shear band: these represent, respectively, local jamming and unjamming regions that continually switch positions in time throughout the failure regime. Optimal paths, established using network shortest paths in favor of large pores, provide clues on preferential paths for interstitial matter transport. In systems with higher rolling resistance at contacts, less tortuous shortest paths thread through larger pores in shear bands. Notably the structural patterns uncovered in the pore space suggest that more robust models of interstitial pore flow through deforming granular systems require a proper consideration of the evolution of in situ shear band and fracture patterns - not just globally, but also inside these localized failure zones.

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.

Fixed Point Learning Based Intelligent Traffic Control System

NASA Astrophysics Data System (ADS)

Zongyao, Wang; Cong, Sui; Cheng, Shao

2017-10-01

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

Entanglement branching operator

NASA Astrophysics Data System (ADS)

Harada, Kenji

2018-01-01

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

Application of Chitosan-Zinc Oxide Nanoparticles for Lead Extraction From Water Samples by Combining Ant Colony Optimization with Artificial Neural Network

NASA Astrophysics Data System (ADS)

Khajeh, M.; Pourkarami, A.; Arefnejad, E.; Bohlooli, M.; Khatibi, A.; Ghaffari-Moghaddam, M.; Zareian-Jahromi, S.

2017-09-01

Chitosan-zinc oxide nanoparticles (CZPs) were developed for solid-phase extraction. Combined artificial neural network-ant colony optimization (ANN-ACO) was used for the simultaneous preconcentration and determination of lead (Pb2+) ions in water samples prior to graphite furnace atomic absorption spectrometry (GF AAS). The solution pH, mass of adsorbent CZPs, amount of 1-(2-pyridylazo)-2-naphthol (PAN), which was used as a complexing agent, eluent volume, eluent concentration, and flow rates of sample and eluent were used as input parameters of the ANN model, and the percentage of extracted Pb2+ ions was used as the output variable of the model. A multilayer perception network with a back-propagation learning algorithm was used to fit the experimental data. The optimum conditions were obtained based on the ACO. Under the optimized conditions, the limit of detection for Pb2+ ions was found to be 0.078 μg/L. This procedure was also successfully used to determine the amounts of Pb2+ ions in various natural water samples.

Connectivity Restoration in Wireless Sensor Networks via Space Network Coding.

PubMed

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

2017-04-20

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

Real-time optimizations for integrated smart network camera

NASA Astrophysics Data System (ADS)

Desurmont, Xavier; Lienard, Bruno; Meessen, Jerome; Delaigle, Jean-Francois

2005-02-01

We present an integrated real-time smart network camera. This system is composed of an image sensor, an embedded PC based electronic card for image processing and some network capabilities. The application detects events of interest in visual scenes, highlights alarms and computes statistics. The system also produces meta-data information that could be shared between other cameras in a network. We describe the requirements of such a system and then show how the design of the system is optimized to process and compress video in real-time. Indeed, typical video-surveillance algorithms as background differencing, tracking and event detection should be highly optimized and simplified to be used in this hardware. To have a good adequation between hardware and software in this light embedded system, the software management is written on top of the java based middle-ware specification established by the OSGi alliance. We can integrate easily software and hardware in complex environments thanks to the Java Real-Time specification for the virtual machine and some network and service oriented java specifications (like RMI and Jini). Finally, we will report some outcomes and typical case studies of such a camera like counter-flow detection.

Improving the Unsteady Aerodynamic Performance of Transonic Turbines using Neural Networks

NASA Technical Reports Server (NTRS)

Rai, Man Mohan; Madavan, Nateri K.; Huber, Frank W.

1999-01-01

A recently developed neural net-based aerodynamic design procedure is used in the redesign of a transonic turbine stage to improve its unsteady aerodynamic performance. The redesign procedure used incorporates the advantages of both traditional response surface methodology and neural networks by employing a strategy called parameter-based partitioning of the design space. Starting from the reference design, a sequence of response surfaces based on both neural networks and polynomial fits are constructed to traverse the design space in search of an optimal solution that exhibits improved unsteady performance. The procedure combines the power of neural networks and the economy of low-order polynomials (in terms of number of simulations required and network training requirements). A time-accurate, two-dimensional, Navier-Stokes solver is used to evaluate the various intermediate designs and provide inputs to the optimization procedure. The procedure yielded a modified design that improves the aerodynamic performance through small changes to the reference design geometry. These results demonstrate the capabilities of the neural net-based design procedure, and also show the advantages of including high-fidelity unsteady simulations that capture the relevant flow physics in the design optimization process.

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

NASA Astrophysics Data System (ADS)

Guex, Guillaume

2016-05-01

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

Integrating Predictive Modeling with Control System Design for Managed Aquifer Recharge and Recovery Applications

NASA Astrophysics Data System (ADS)

Drumheller, Z. W.; Regnery, J.; Lee, J. H.; Illangasekare, T. H.; Kitanidis, P. K.; Smits, K. M.

2014-12-01

Aquifers around the world show troubling signs of irreversible depletion and seawater intrusion as climate change, population growth, and urbanization led to reduced natural recharge rates and overuse. Scientists and engineers have begun to re-investigate the technology of managed aquifer recharge and recovery (MAR) as a means to increase the reliability of the diminishing and increasingly variable groundwater supply. MAR systems offer the possibility of naturally increasing groundwater storage while improving the quality of impaired water used for recharge. Unfortunately, MAR systems remain wrought with operational challenges related to the quality and quantity of recharged and recovered water stemming from a lack of data-driven, real-time control. Our project seeks to ease the operational challenges of MAR facilities through the implementation of active sensor networks, adaptively calibrated flow and transport models, and simulation-based meta-heuristic control optimization methods. The developed system works by continually collecting hydraulic and water quality data from a sensor network embedded within the aquifer. The data is fed into an inversion algorithm, which calibrates the parameters and initial conditions of a predictive flow and transport model. The calibrated model is passed to a meta-heuristic control optimization algorithm (e.g. genetic algorithm) to execute the simulations and determine the best course of action, i.e., the optimal pumping policy for current aquifer conditions. The optimal pumping policy is manually or autonomously applied. During operation, sensor data are used to assess the accuracy of the optimal prediction and augment the pumping strategy as needed. At laboratory-scale, a small (18"H x 46"L) and an intermediate (6'H x 16'L) two-dimensional synthetic aquifer were constructed and outfitted with sensor networks. Data collection and model inversion components were developed and sensor data were validated by analytical measurements.

Optimal Control of Connected and Automated Vehicles at Roundabouts

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

Zhao, Liuhui; Malikopoulos, Andreas; Rios-Torres, Jackeline

Connectivity and automation in vehicles provide the most intriguing opportunity for enabling users to better monitor transportation network conditions and make better operating decisions to improve safety and reduce pollution, energy consumption, and travel delays. This study investigates the implications of optimally coordinating vehicles that are wirelessly connected to each other and to an infrastructure in roundabouts to achieve a smooth traffic flow without stop-and-go driving. We apply an optimization framework and an analytical solution that allows optimal coordination of vehicles for merging in such traffic scenario. The effectiveness of the efficiency of the proposed approach is validated through simulationmore » and it is shown that coordination of vehicles can reduce total travel time by 3~49% and fuel consumption by 2~27% with respect to different traffic levels. In addition, network throughput is improved by up to 25% due to elimination of stop-and-go driving behavior.« less

Advances in optimal routing through computer networks

NASA Technical Reports Server (NTRS)

Paz, I. M.

1977-01-01

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

Cerebrospinal and Interstitial Fluid Transport via the Glymphatic Pathway Modeled by Optimal Mass Transport

PubMed Central

Ratner, Vadim; Gao, Yi; Lee, Hedok; Elkin, Rena; Nedergaard, Maiken; Benveniste, Helene; Tannenbaum, Allen

2017-01-01

The glymphatic pathway is a system which facilitates continuous cerebrospinal fluid (CSF) and interstitial fluid (ISF) exchange and plays a key role in removing waste products from the rodent brain. Dysfunction of the glymphatic pathway may be implicated in the pathophysiology of Alzheimer's disease. Intriguingly, the glymphatic system is most active during deep wave sleep general anesthesia. By using paramagnetic tracers administered into CSF of rodents, we previously showed the utility of MRI in characterizing a macroscopic whole brain view of glymphatic transport but we have yet to define and visualize the specific flow patterns. Here we have applied an alternative mathematical analysis approach to a dynamic time series of MRI images acquired every 4 min over ∼3 hrs in anesthetized rats, following administration of a small molecular weight paramagnetic tracer into the CSF reservoir of the cisterna magna. We use Optimal Mass Transport (OMT) to model the glymphatic flow vector field, and then analyze the flow to find the network of CSF-ISF flow channels. We use 3D visualization computational tools to visualize the OMT defined network of CSF-ISF flow channels in relation to anatomical and vascular key landmarks from the live rodent brain. The resulting OMT model of the glymphatic transport network agrees largely with the current understanding of the glymphatic transport patterns defined by dynamic contrast-enhanced MRI revealing key CSF transport pathways along the ventral surface of the brain with a trajectory towards the pineal gland, cerebellum, hypothalamus and olfactory bulb. In addition, the OMT analysis also revealed some interesting previously unnoticed behaviors regarding CSF transport involving parenchymal streamlines moving from ventral reservoirs towards the surface of the brain, olfactory bulb and large central veins. PMID:28323163

Cerebrospinal and interstitial fluid transport via the glymphatic pathway modeled by optimal mass transport.

PubMed

Ratner, Vadim; Gao, Yi; Lee, Hedok; Elkin, Rena; Nedergaard, Maiken; Benveniste, Helene; Tannenbaum, Allen

2017-05-15

The glymphatic pathway is a system which facilitates continuous cerebrospinal fluid (CSF) and interstitial fluid (ISF) exchange and plays a key role in removing waste products from the rodent brain. Dysfunction of the glymphatic pathway may be implicated in the pathophysiology of Alzheimer's disease. Intriguingly, the glymphatic system is most active during deep wave sleep general anesthesia. By using paramagnetic tracers administered into CSF of rodents, we previously showed the utility of MRI in characterizing a macroscopic whole brain view of glymphatic transport but we have yet to define and visualize the specific flow patterns. Here we have applied an alternative mathematical analysis approach to a dynamic time series of MRI images acquired every 4min over ∼3h in anesthetized rats, following administration of a small molecular weight paramagnetic tracer into the CSF reservoir of the cisterna magna. We use Optimal Mass Transport (OMT) to model the glymphatic flow vector field, and then analyze the flow to find the network of CSF-ISF flow channels. We use 3D visualization computational tools to visualize the OMT defined network of CSF-ISF flow channels in relation to anatomical and vascular key landmarks from the live rodent brain. The resulting OMT model of the glymphatic transport network agrees largely with the current understanding of the glymphatic transport patterns defined by dynamic contrast-enhanced MRI revealing key CSF transport pathways along the ventral surface of the brain with a trajectory towards the pineal gland, cerebellum, hypothalamus and olfactory bulb. In addition, the OMT analysis also revealed some interesting previously unnoticed behaviors regarding CSF transport involving parenchymal streamlines moving from ventral reservoirs towards the surface of the brain, olfactory bulb and large central veins. Copyright © 2017. Published by Elsevier Inc.

Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks

NASA Astrophysics Data System (ADS)

Langner, Tobias; Schindelhauer, Christian; Souza, Alexander

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

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.

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.

Allometric scaling law in a simple oxygen exchanging network: possible implications on the biological allometric scaling laws.

PubMed

Santillán, Moisés

2003-07-21

A simple model of an oxygen exchanging network is presented and studied. This network's task is to transfer a given oxygen rate from a source to an oxygen consuming system. It consists of a pipeline, that interconnects the oxygen consuming system and the reservoir and of a fluid, the active oxygen transporting element, moving through the pipeline. The network optimal design (total pipeline surface) and dynamics (volumetric flow of the oxygen transporting fluid), which minimize the energy rate expended in moving the fluid, are calculated in terms of the oxygen exchange rate, the pipeline length, and the pipeline cross-section. After the oxygen exchanging network is optimized, the energy converting system is shown to satisfy a 3/4-like allometric scaling law, based upon the assumption that its performance regime is scale invariant as well as on some feasible geometric scaling assumptions. Finally, the possible implications of this result on the allometric scaling properties observed elsewhere in living beings are discussed.

Information Processing in Living Systems

NASA Astrophysics Data System (ADS)

Tkačik, Gašper; Bialek, William

2016-03-01

Life depends as much on the flow of information as on the flow of energy. Here we review the many efforts to make this intuition precise. Starting with the building blocks of information theory, we explore examples where it has been possible to measure, directly, the flow of information in biological networks, or more generally where information-theoretic ideas have been used to guide the analysis of experiments. Systems of interest range from single molecules (the sequence diversity in families of proteins) to groups of organisms (the distribution of velocities in flocks of birds), and all scales in between. Many of these analyses are motivated by the idea that biological systems may have evolved to optimize the gathering and representation of information, and we review the experimental evidence for this optimization, again across a wide range of scales.

Optimal Phase Oscillatory Network

NASA Astrophysics Data System (ADS)

Follmann, Rosangela

2013-03-01

Important topics as preventive detection of epidemics, collective self-organization, information flow and systemic robustness in clusters are typical examples of processes that can be studied in the context of the theory of complex networks. It is an emerging theory in a field, which has recently attracted much interest, involving the synchronization of dynamical systems associated to nodes, or vertices, of the network. Studies have shown that synchronization in oscillatory networks depends not only on the individual dynamics of each element, but also on the combination of the topology of the connections as well as on the properties of the interactions of these elements. Moreover, the response of the network to small damages, caused at strategic points, can enhance the global performance of the whole network. In this presentation we explore an optimal phase oscillatory network altered by an additional term in the coupling function. The application to associative-memory network shows improvement on the correct information retrieval as well as increase of the storage capacity. The inclusion of some small deviations on the nodes, when solutions are attracted to a false state, results in additional enhancement of the performance of the associative-memory network. Supported by FAPESP - Sao Paulo Research Foundation, grant number 2012/12555-4

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.

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.

Optimization of green infrastructure network at semi-urbanized watersheds to manage stormwater volume, peak flow and life cycle cost: Case study of Dead Run watershed in Maryland

NASA Astrophysics Data System (ADS)

Heidari Haratmeh, B.; Rai, A.; Minsker, B. S.

2016-12-01

Green Infrastructure (GI) has become widely known as a sustainable solution for stormwater management in urban environments. Despite more recognition and acknowledgment, researchers and practitioners lack clear and explicit guidelines on how GI practices should be implemented in urban settings. This study is developing a noisy-based multi-objective, multi-scaled genetic algorithm that determines optimal GI networks for environmental, economic and social objectives. The methodology accounts for uncertainty in modeling results and is designed to perform at sub-watershed as well as patch scale using two different simulation models, SWMM and RHESSys, in a Cloud-based implementation using a Web interface. As an initial case study, a semi-urbanized watershed— DeadRun 5— in Baltimore County, Maryland, is selected. The objective of the study is to minimize life cycle cost, maximize human preference for human well-being and the difference between pre-development hydrographs generated from current rainfall events and design storms, as well as those that result from proposed GI scenarios. Initial results for DeadRun5 watershed suggest that placing GI in the proximity of the watershed outlet optimizes life cycle cost, stormwater volume, and peak flow capture. The framework can easily present outcomes of GI design scenarios to both designers and local stakeholders, and future plans include receiving feedback from users on candidate designs, and interactively updating optimal GI network designs in a crowd-sourced design process. This approach can also be helpful in deriving design guidelines that better meet stakeholder needs.

System and Method for Modeling the Flow Performance Features of an Object

NASA Technical Reports Server (NTRS)

Jorgensen, Charles (Inventor); Ross, James (Inventor)

1997-01-01

The method and apparatus includes a neural network for generating a model of an object in a wind tunnel from performance data on the object. The network is trained from test input signals (e.g., leading edge flap position, trailing edge flap position, angle of attack, and other geometric configurations, and power settings) and test output signals (e.g., lift, drag, pitching moment, or other performance features). In one embodiment, the neural network training method employs a modified Levenberg-Marquardt optimization technique. The model can be generated 'real time' as wind tunnel testing proceeds. Once trained, the model is used to estimate performance features associated with the aircraft given geometric configuration and/or power setting input. The invention can also be applied in other similar static flow modeling applications in aerodynamics, hydrodynamics, fluid dynamics, and other such disciplines. For example, the static testing of cars, sails, and foils, propellers, keels, rudders, turbines, fins, and the like, in a wind tunnel, water trough, or other flowing medium.

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.

An Optimal Balance between Efficiency and Safety of Urban Drainage Networks

NASA Astrophysics Data System (ADS)

Seo, Y.

2014-12-01

Urban drainage networks have been developed to promote the efficiency of a system in terms of drainage time so far. Typically, a drainage system is designed to drain water from developed areas promptly as much as possible during floods. In this regard, an artificial drainage system have been considered to be more efficient compared to river networks in nature. This study examined artificial drainage networks and the results indicate they can be less efficient in terms of network configuration compared with river networks, which is counter-intuitive. The case study of 20 catchments in Seoul, South Korea shows that they have wide range of efficiency in terms of network configuration and consequently, drainage time. This study also demonstrates that efficient drainage networks are more sensitive to spatial and temporal rainfall variation such as rainstorm movement. Peak flows increase more than two times greater in effective drainage networks compared with inefficient and highly sinuous drainage networks. Combining these results, this study implies that the layout of a drainage network is an important factor in terms of efficient drainage and also safety in urban catchments. Design of an optimal layout of the drainage network can be an alternative non-structural measures that mitigate potential risks and it is crucial for the sustainability of urban environments.

Hydraulic Fracturing and Production Optimization in Eagle Ford Shale Using Coupled Geomechanics and Fluid Flow Model

NASA Astrophysics Data System (ADS)

Suppachoknirun, Theerapat; Tutuncu, Azra N.

2017-12-01

With increasing production from shale gas and tight oil reservoirs, horizontal drilling and multistage hydraulic fracturing processes have become a routine procedure in unconventional field development efforts. Natural fractures play a critical role in hydraulic fracture growth, subsequently affecting stimulated reservoir volume and the production efficiency. Moreover, the existing fractures can also contribute to the pressure-dependent fluid leak-off during the operations. Hence, a reliable identification of the discrete fracture network covering the zone of interest prior to the hydraulic fracturing design needs to be incorporated into the hydraulic fracturing and reservoir simulations for realistic representation of the in situ reservoir conditions. In this research study, an integrated 3-D fracture and fluid flow model have been developed using a new approach to simulate the fluid flow and deliver reliable production forecasting in naturally fractured and hydraulically stimulated tight reservoirs. The model was created with three key modules. A complex 3-D discrete fracture network model introduces realistic natural fracture geometry with the associated fractured reservoir characteristics. A hydraulic fracturing model is created utilizing the discrete fracture network for simulation of the hydraulic fracture and flow in the complex discrete fracture network. Finally, a reservoir model with the production grid system is used allowing the user to efficiently perform the fluid flow simulation in tight formations with complex fracture networks. The complex discrete natural fracture model, the integrated discrete fracture model for the hydraulic fracturing, the fluid flow model, and the input dataset have been validated against microseismic fracture mapping and commingled production data obtained from a well pad with three horizontal production wells located in the Eagle Ford oil window in south Texas. Two other fracturing geometries were also evaluated to optimize the cumulative production and for the three wells individually. Significant reduction in the production rate in early production times is anticipated in tight reservoirs regardless of the fracturing techniques implemented. The simulations conducted using the alternating fracturing technique led to more oil production than when zipper fracturing was used for a 20-year production period. Yet, due to the decline experienced, the differences in cumulative production get smaller, and the alternating fracturing is not practically implementable while field application of zipper fracturing technique is more practical and widely used.

A stochastic flow-capturing model to optimize the location of fast-charging stations with uncertain electric vehicle flows

DOE PAGES

Wu, Fei; Sioshansi, Ramteen

2017-05-04

Here, we develop a model to optimize the location of public fast charging stations for electric vehicles (EVs). A difficulty in planning the placement of charging stations is uncertainty in where EV charging demands appear. For this reason, we use a stochastic flow-capturing location model (SFCLM). A sample-average approximation method and an averaged two-replication procedure are used to solve the problem and estimate the solution quality. We demonstrate the use of the SFCLM using a Central-Ohio based case study. We find that most of the stations built are concentrated around the urban core of the region. As the number ofmore » stations built increases, some appear on the outskirts of the region to provide an extended charging network. We find that the sets of optimal charging station locations as a function of the number of stations built are approximately nested. We demonstrate the benefits of the charging-station network in terms of how many EVs are able to complete their daily trips by charging midday—six public charging stations allow at least 60% of EVs that would otherwise not be able to complete their daily tours without the stations to do so. We finally compare the SFCLM to a deterministic model, in which EV flows are set equal to their expected values. We show that if a limited number of charging stations are to be built, the SFCLM outperforms the deterministic model. As the number of stations to be built increases, the SFCLM and deterministic model select very similar station locations.« less

Analytical approach to cross-layer protocol optimization in wireless sensor networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

2008-04-01

In the distributed operations of route discovery and maintenance, strong interaction occurs across mobile ad hoc network (MANET) protocol layers. Quality of service (QoS) requirements of multimedia service classes must be satisfied by the cross-layer protocol, along with minimization of the distributed power consumption at nodes and along routes to battery-limited energy constraints. In previous work by the author, cross-layer interactions in the MANET protocol are modeled in terms of a set of concatenated design parameters and associated resource levels by multivariate point processes (MVPPs). Determination of the "best" cross-layer design is carried out using the optimal control of martingale representations of the MVPPs. In contrast to the competitive interaction among nodes in a MANET for multimedia services using limited resources, the interaction among the nodes of a wireless sensor network (WSN) is distributed and collaborative, based on the processing of data from a variety of sensors at nodes to satisfy common mission objectives. Sensor data originates at the nodes at the periphery of the WSN, is successively transported to other nodes for aggregation based on information-theoretic measures of correlation and ultimately sent as information to one or more destination (decision) nodes. The "multimedia services" in the MANET model are replaced by multiple types of sensors, e.g., audio, seismic, imaging, thermal, etc., at the nodes; the QoS metrics associated with MANETs become those associated with the quality of fused information flow, i.e., throughput, delay, packet error rate, data correlation, etc. Significantly, the essential analytical approach to MANET cross-layer optimization, now based on the MVPPs for discrete random events occurring in the WSN, can be applied to develop the stochastic characteristics and optimality conditions for cross-layer designs of sensor network protocols. Functional dependencies of WSN performance metrics are described in terms of the concatenated protocol parameters. New source-to-destination routes are sought that optimize cross-layer interdependencies to achieve the "best available" performance in the WSN. The protocol design, modified from a known reactive protocol, adapts the achievable performance to the transient network conditions and resource levels. Control of network behavior is realized through the conditional rates of the MVPPs. Optimal cross-layer protocol parameters are determined by stochastic dynamic programming conditions derived from models of transient packetized sensor data flows. Moreover, the defining conditions for WSN configurations, grouping sensor nodes into clusters and establishing data aggregation at processing nodes within those clusters, lead to computationally tractable solutions to the stochastic differential equations that describe network dynamics. Closed-form solution characteristics provide an alternative to the "directed diffusion" methods for resource-efficient WSN protocols published previously by other researchers. Performance verification of the resulting cross-layer designs is found by embedding the optimality conditions for the protocols in actual WSN scenarios replicated in a wireless network simulation environment. Performance tradeoffs among protocol parameters remain for a sequel to the paper.

Topography-based Flood Planning and Optimization Capability Development Report

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

Judi, David R.; Tasseff, Byron A.; Bent, Russell W.

2014-02-26

Globally, water-related disasters are among the most frequent and costly natural hazards. Flooding inflicts catastrophic damage on critical infrastructure and population, resulting in substantial economic and social costs. NISAC is developing LeveeSim, a suite of nonlinear and network optimization models, to predict optimal barrier placement to protect critical regions and infrastructure during flood events. LeveeSim currently includes a high-performance flood model to simulate overland flow, as well as a network optimization model to predict optimal barrier placement during a flood event. The LeveeSim suite models the effects of flooding in predefined regions. By manipulating a domain’s underlying topography, developers alteredmore » flood propagation to reduce detrimental effects in areas of interest. This numerical altering of a domain’s topography is analogous to building levees, placing sandbags, etc. To induce optimal changes in topography, NISAC used a novel application of an optimization algorithm to minimize flooding effects in regions of interest. To develop LeveeSim, NISAC constructed and coupled hydrodynamic and optimization algorithms. NISAC first implemented its existing flood modeling software to use massively parallel graphics processing units (GPUs), which allowed for the simulation of larger domains and longer timescales. NISAC then implemented a network optimization model to predict optimal barrier placement based on output from flood simulations. As proof of concept, NISAC developed five simple test scenarios, and optimized topographic solutions were compared with intuitive solutions. Finally, as an early validation example, barrier placement was optimized to protect an arbitrary region in a simulation of the historic Taum Sauk dam breach.« less

Concept development and needs identification for Intelligent Network Flow Optimization (INFLO) : assessment of relevant prior and ongoing research.

DOT National Transportation Integrated Search

2012-03-01

Through the USDOT Dynamic Mobility Applications (DMA) program, a number of high-priority mobility applications have been assessed and identified that can connect vehicles, travelers, and infrastructure in order to provide better information to travel...

Impacts assessment of dynamic speed harmonization with queue warning : task 3, impacts assessment report.

DOT National Transportation Integrated Search

2015-06-01

This report assesses the impacts of a prototype of Dynamic Speed Harmonization (SPD-HARM) with Queue Warning (Q-WARN), which are two component applications of the Intelligent Network Flow Optimization (INFLO) bundle. The assessment is based on an ext...

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.

Aero-thermal optimization of film cooling flow parameters on the suction surface of a high pressure turbine blade

NASA Astrophysics Data System (ADS)

El Ayoubi, Carole; Hassan, Ibrahim; Ghaly, Wahid

2012-11-01

This paper aims to optimize film coolant flow parameters on the suction surface of a high-pressure gas turbine blade in order to obtain an optimum compromise between a superior cooling performance and a minimum aerodynamic penalty. An optimization algorithm coupled with three-dimensional Reynolds-averaged Navier Stokes analysis is used to determine the optimum film cooling configuration. The VKI blade with two staggered rows of axially oriented, conically flared, film cooling holes on its suction surface is considered. Two design variables are selected; the coolant to mainstream temperature ratio and total pressure ratio. The optimization objective consists of maximizing the spatially averaged film cooling effectiveness and minimizing the aerodynamic penalty produced by film cooling. The effect of varying the coolant flow parameters on the film cooling effectiveness and the aerodynamic loss is analyzed using an optimization method and three dimensional steady CFD simulations. The optimization process consists of a genetic algorithm and a response surface approximation of the artificial neural network type to provide low-fidelity predictions of the objective function. The CFD simulations are performed using the commercial software CFX. The numerical predictions of the aero-thermal performance is validated against a well-established experimental database.

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.

The influence of branch order on optimal leaf vein geometries: Murray's law and area preserving branching.

PubMed

Price, Charles A; Knox, Sarah-Jane C; Brodribb, Tim J

2013-01-01

Models that predict the form of hierarchical branching networks typically invoke optimization based on biomechanical similitude, the minimization of impedance to fluid flow, or construction costs. Unfortunately, due to the small size and high number of vein segments found in real biological networks, complete descriptions of networks needed to evaluate such models are rare. To help address this we report results from the analysis of the branching geometry of 349 leaf vein networks comprising over 1.5 million individual vein segments. In addition to measuring the diameters of individual veins before and after vein bifurcations, we also assign vein orders using the Horton-Strahler ordering algorithm adopted from the study of river networks. Our results demonstrate that across all leaves, both radius tapering and the ratio of daughter to parent branch areas for leaf veins are in strong agreement with the expectation from Murray's law. However, as veins become larger, area ratios shift systematically toward values expected under area-preserving branching. Our work supports the idea that leaf vein networks differentiate roles of leaf support and hydraulic supply between hierarchical orders.

United States Air Force Environmental Restoration Program. Guidance on Soil Vapor Extraction Optimization

DTIC Science & Technology

2001-06-01

Pump Exposed Capillary Fringe SVE System Pneumatic/ Hydraulic Fracturing Points Increased Advective Flow draw\\svehandbk1.cdr aee p1 4/5/01 022/736300...propagate further from the extraction well, increasing the advective flow zone round the well. Pneumatic and hydraulic fracturing are the primary methods...enhancing existing fractures and increasing the secondary fracture network. Hydraulic fracturing involves the injection of water or slurry into the

An exact algorithm for optimal MAE stack filter design.

PubMed

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

2007-02-01

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

Adaptive Optimization of Aircraft Engine Performance Using Neural Networks

NASA Technical Reports Server (NTRS)

Simon, Donald L.; Long, Theresa W.

1995-01-01

Preliminary results are presented on the development of an adaptive neural network based control algorithm to enhance aircraft engine performance. This work builds upon a previous National Aeronautics and Space Administration (NASA) effort known as Performance Seeking Control (PSC). PSC is an adaptive control algorithm which contains a model of the aircraft's propulsion system which is updated on-line to match the operation of the aircraft's actual propulsion system. Information from the on-line model is used to adapt the control system during flight to allow optimal operation of the aircraft's propulsion system (inlet, engine, and nozzle) to improve aircraft engine performance without compromising reliability or operability. Performance Seeking Control has been shown to yield reductions in fuel flow, increases in thrust, and reductions in engine fan turbine inlet temperature. The neural network based adaptive control, like PSC, will contain a model of the propulsion system which will be used to calculate optimal control commands on-line. Hopes are that it will be able to provide some additional benefits above and beyond those of PSC. The PSC algorithm is computationally intensive, it is valid only at near steady-state flight conditions, and it has no way to adapt or learn on-line. These issues are being addressed in the development of the optimal neural controller. Specialized neural network processing hardware is being developed to run the software, the algorithm will be valid at steady-state and transient conditions, and will take advantage of the on-line learning capability of neural networks. Future plans include testing the neural network software and hardware prototype against an aircraft engine simulation. In this paper, the proposed neural network software and hardware is described and preliminary neural network training results are presented.

Optimization of a hydrometric network extension using specific flow, kriging and simulated annealing

NASA Astrophysics Data System (ADS)

Chebbi, Afef; Kebaili Bargaoui, Zoubeida; Abid, Nesrine; da Conceição Cunha, Maria

2017-12-01

In hydrometric stations, water levels are continuously observed and discharge rating curves are constantly updated to achieve accurate river levels and discharge observations. An adequate spatial distribution of hydrological gauging stations presents a lot of interest in linkage with the river regime characterization, water infrastructures design, water resources management and ecological survey. Due to the increase of riverside population and the associated flood risk, hydrological networks constantly need to be developed. This paper suggests taking advantage of kriging approaches to improve the design of a hydrometric network. The context deals with the application of an optimization approach using ordinary kriging and simulated annealing (SA) in order to identify the best locations to install new hydrometric gauges. The task at hand is to extend an existing hydrometric network in order to estimate, at ungauged sites, the average specific annual discharge which is a key basin descriptor. This methodology is developed for the hydrometric network of the transboundary Medjerda River in the North of Tunisia. A Geographic Information System (GIS) is adopted to delineate basin limits and centroids. The latter are adopted to assign the location of basins in kriging development. Scenarios where the size of an existing 12 stations network is alternatively increased by 1, 2, 3, 4 and 5 new station(s) are investigated using geo-regression and minimization of the variance of kriging errors. The analysis of the optimized locations from a scenario to another shows a perfect conformity with respect to the location of the new sites. The new locations insure a better spatial coverage of the study area as seen with the increase of both the average and the maximum of inter-station distances after optimization. The optimization procedure selects the basins that insure the shifting of the mean drainage area towards higher specific discharges.

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

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

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

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

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

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

Biologically plausible learning in neural networks: a lesson from bacterial chemotaxis.

PubMed

Shimansky, Yury P

2009-12-01

Learning processes in the brain are usually associated with plastic changes made to optimize the strength of connections between neurons. Although many details related to biophysical mechanisms of synaptic plasticity have been discovered, it is unclear how the concurrent performance of adaptive modifications in a huge number of spatial locations is organized to minimize a given objective function. Since direct experimental observation of even a relatively small subset of such changes is not feasible, computational modeling is an indispensable investigation tool for solving this problem. However, the conventional method of error back-propagation (EBP) employed for optimizing synaptic weights in artificial neural networks is not biologically plausible. This study based on computational experiments demonstrated that such optimization can be performed rather efficiently using the same general method that bacteria employ for moving closer to an attractant or away from a repellent. With regard to neural network optimization, this method consists of regulating the probability of an abrupt change in the direction of synaptic weight modification according to the temporal gradient of the objective function. Neural networks utilizing this method (regulation of modification probability, RMP) can be viewed as analogous to swimming in the multidimensional space of their parameters in the flow of biochemical agents carrying information about the optimality criterion. The efficiency of RMP is comparable to that of EBP, while RMP has several important advantages. Since the biological plausibility of RMP is beyond a reasonable doubt, the RMP concept provides a constructive framework for the experimental analysis of learning in natural neural networks.

On optimal designs of transparent WDM networks with 1 + 1 protection leveraged by all-optical XOR network coding schemes

NASA Astrophysics Data System (ADS)

Dao, Thanh Hai

2018-01-01

Network coding techniques are seen as the new dimension to improve the network performances thanks to the capability of utilizing network resources more efficiently. Indeed, the application of network coding to the realm of failure recovery in optical networks has been marking a major departure from traditional protection schemes as it could potentially achieve both rapid recovery and capacity improvement, challenging the prevailing wisdom of trading capacity efficiency for speed recovery and vice versa. In this context, the maturing of all-optical XOR technologies appears as a good match to the necessity of a more efficient protection in transparent optical networks. In addressing this opportunity, we propose to use a practical all-optical XOR network coding to leverage the conventional 1 + 1 optical path protection in transparent WDM optical networks. The network coding-assisted protection solution combines protection flows of two demands sharing the same destination node in supportive conditions, paving the way for reducing the backup capacity. A novel mathematical model taking into account the operation of new protection scheme for optimal network designs is formulated as the integer linear programming. Numerical results based on extensive simulations on realistic topologies, COST239 and NSFNET networks, are presented to highlight the benefits of our proposal compared to the conventional approach in terms of wavelength resources efficiency and network throughput.

Photovoltaic Inverter Controllers Seeking AC Optimal Power Flow Solutions

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

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

This paper considers future distribution networks featuring inverter-interfaced photovoltaic (PV) systems, and addresses the synthesis of feedback controllers that seek real- and reactive-power inverter setpoints corresponding to AC optimal power flow (OPF) solutions. The objective is to bridge the temporal gap between long-term system optimization and real-time inverter control, and enable seamless PV-owner participation without compromising system efficiency and stability. The design of the controllers is grounded on a dual ..epsilon..-subgradient method, while semidefinite programming relaxations are advocated to bypass the non-convexity of AC OPF formulations. Global convergence of inverter output powers is analytically established for diminishing stepsize rules formore » cases where: i) computational limits dictate asynchronous updates of the controller signals, and ii) inverter reference inputs may be updated at a faster rate than the power-output settling time.« less

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.

Linear Power-Flow Models in Multiphase Distribution Networks: Preprint

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

Bernstein, Andrey; Dall'Anese, Emiliano

This paper considers multiphase unbalanced distribution systems and develops approximate power-flow models where bus-voltages, line-currents, and powers at the point of common coupling are linearly related to the nodal net power injections. The linearization approach is grounded on a fixed-point interpretation of the AC power-flow equations, and it is applicable to distribution systems featuring (i) wye connections; (ii) ungrounded delta connections; (iii) a combination of wye-connected and delta-connected sources/loads; and, (iv) a combination of line-to-line and line-to-grounded-neutral devices at the secondary of distribution transformers. The proposed linear models can facilitate the development of computationally-affordable optimization and control applications -- frommore » advanced distribution management systems settings to online and distributed optimization routines. Performance of the proposed models is evaluated on different test feeders.« less

Networks of channels for self-healing composite materials

NASA Astrophysics Data System (ADS)

Bejan, A.; Lorente, S.; Wang, K.-M.

2006-08-01

This is a fundamental study of how to vascularize a self-healing composite material so that healing fluid reaches all the crack sites that may occur randomly through the material. The network of channels is built into the material and is filled with pressurized healing fluid. When a crack forms, the pressure drops at the crack site and fluid flows from the network into the crack. The objective is to discover the network configuration that is capable of delivering fluid to all the cracks the fastest. The crack site dimension and the total volume of the channels are fixed. It is argued that the network must be configured as a grid and not as a tree. Two classes of grids are considered and optimized: (i) grids with one channel diameter and regular polygonal loops (square, triangle, hexagon) and (ii) grids with two channel sizes. The best architecture of type (i) is the grid with triangular loops. The best architecture of type (ii) has a particular (optimal) ratio of diameters that departs from 1 as the crack length scale becomes smaller than the global scale of the vascularized structure from which the crack draws its healing fluid. The optimization of the ratio of channel diameters cuts in half the time of fluid delivery to the crack.

Salinity-oriented environmental flows for keystone species in the Modaomen Estuary, China

NASA Astrophysics Data System (ADS)

Zhang, Menglu; Cui, Baoshan; Zhang, Zhiming; Jiang, Xuelian

2017-12-01

Rapid development and urbanization in recent years have contributed to a reduction in freshwater discharge and intensified saltwater intrusion in the Pearl River Delta. This comprises a significant threat to potable water supplies and overall estuary ecosystem health. In this study, the environmental flows of the Modaomen Estuary, one of the estuaries of the Pearl River Delta in China, were determined based on the salinity demand of keystone species and the linear relationship between river discharge and estuarine salinity. The estimated minimum and optimal annual environmental flows in the Modaomen Estuary were 116.8 × 109 m3 and 273.8 × 109 m3, respectively, representing 59.3% and 139.0% of the natural runoff. Water quality assessments in recent years indicate that the environmental flows have not been satisfied most of the time, particularly the optimal environmental flow, despite implementation of various water regulations since 2005. Therefore, water regulations and wetland network recoveries based on rational environmental flows should be implemented to alleviate saltwater intrusion and for the creation of an ideal estuarine habitat.

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.

Co-optimization of CO 2 -EOR and Storage Processes under Geological Uncertainty

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

Ampomah, William; Balch, Robert; Will, Robert

This paper presents an integrated numerical framework to co-optimize EOR and CO 2 storage performance in the Farnsworth field unit (FWU), Ochiltree County, Texas. The framework includes a field-scale compositional reservoir flow model, an uncertainty quantification model and a neural network optimization process. The reservoir flow model has been constructed based on the field geophysical, geological, and engineering data. A laboratory fluid analysis was tuned to an equation of state and subsequently used to predict the thermodynamic minimum miscible pressure (MMP). A history match of primary and secondary recovery processes was conducted to estimate the reservoir and multiphase flow parametersmore » as the baseline case for analyzing the effect of recycling produced gas, infill drilling and water alternating gas (WAG) cycles on oil recovery and CO 2 storage. A multi-objective optimization model was defined for maximizing both oil recovery and CO 2 storage. The uncertainty quantification model comprising the Latin Hypercube sampling, Monte Carlo simulation, and sensitivity analysis, was used to study the effects of uncertain variables on the defined objective functions. Uncertain variables such as bottom hole injection pressure, WAG cycle, injection and production group rates, and gas-oil ratio among others were selected. The most significant variables were selected as control variables to be used for the optimization process. A neural network optimization algorithm was utilized to optimize the objective function both with and without geological uncertainty. The vertical permeability anisotropy (Kv/Kh) was selected as one of the uncertain parameters in the optimization process. The simulation results were compared to a scenario baseline case that predicted CO 2 storage of 74%. The results showed an improved approach for optimizing oil recovery and CO 2 storage in the FWU. The optimization process predicted more than 94% of CO 2 storage and most importantly about 28% of incremental oil recovery. The sensitivity analysis reduced the number of control variables to decrease computational time. A risk aversion factor was used to represent results at various confidence levels to assist management in the decision-making process. The defined objective functions were proved to be a robust approach to co-optimize oil recovery and CO 2 storage. The Farnsworth CO 2 project will serve as a benchmark for future CO 2–EOR or CCUS projects in the Anadarko basin or geologically similar basins throughout the world.« less

Co-optimization of CO 2 -EOR and Storage Processes under Geological Uncertainty

DOE PAGES

Ampomah, William; Balch, Robert; Will, Robert; ...

2017-07-01

This paper presents an integrated numerical framework to co-optimize EOR and CO 2 storage performance in the Farnsworth field unit (FWU), Ochiltree County, Texas. The framework includes a field-scale compositional reservoir flow model, an uncertainty quantification model and a neural network optimization process. The reservoir flow model has been constructed based on the field geophysical, geological, and engineering data. A laboratory fluid analysis was tuned to an equation of state and subsequently used to predict the thermodynamic minimum miscible pressure (MMP). A history match of primary and secondary recovery processes was conducted to estimate the reservoir and multiphase flow parametersmore » as the baseline case for analyzing the effect of recycling produced gas, infill drilling and water alternating gas (WAG) cycles on oil recovery and CO 2 storage. A multi-objective optimization model was defined for maximizing both oil recovery and CO 2 storage. The uncertainty quantification model comprising the Latin Hypercube sampling, Monte Carlo simulation, and sensitivity analysis, was used to study the effects of uncertain variables on the defined objective functions. Uncertain variables such as bottom hole injection pressure, WAG cycle, injection and production group rates, and gas-oil ratio among others were selected. The most significant variables were selected as control variables to be used for the optimization process. A neural network optimization algorithm was utilized to optimize the objective function both with and without geological uncertainty. The vertical permeability anisotropy (Kv/Kh) was selected as one of the uncertain parameters in the optimization process. The simulation results were compared to a scenario baseline case that predicted CO 2 storage of 74%. The results showed an improved approach for optimizing oil recovery and CO 2 storage in the FWU. The optimization process predicted more than 94% of CO 2 storage and most importantly about 28% of incremental oil recovery. The sensitivity analysis reduced the number of control variables to decrease computational time. A risk aversion factor was used to represent results at various confidence levels to assist management in the decision-making process. The defined objective functions were proved to be a robust approach to co-optimize oil recovery and CO 2 storage. The Farnsworth CO 2 project will serve as a benchmark for future CO 2–EOR or CCUS projects in the Anadarko basin or geologically similar basins throughout the world.« less

Effects of spatial configuration of imperviousness and green infrastructure networks on hydrologic response in a residential sewershed

NASA Astrophysics Data System (ADS)

Lim, Theodore C.; Welty, Claire

2017-09-01

Green infrastructure (GI) is an approach to stormwater management that promotes natural processes of infiltration and evapotranspiration, reducing surface runoff to conventional stormwater drainage infrastructure. As more urban areas incorporate GI into their stormwater management plans, greater understanding is needed on the effects of spatial configuration of GI networks on hydrological performance, especially in the context of potential subsurface and lateral interactions between distributed facilities. In this research, we apply a three-dimensional, coupled surface-subsurface, land-atmosphere model, ParFlow.CLM, to a residential urban sewershed in Washington DC that was retrofitted with a network of GI installations between 2009 and 2015. The model was used to test nine additional GI and imperviousness spatial network configurations for the site and was compared with monitored pipe-flow data. Results from the simulations show that GI located in higher flow-accumulation areas of the site intercepted more surface runoff, even during wetter and multiday events. However, a comparison of the differences between scenarios and levels of variation and noise in monitored data suggests that the differences would only be detectable between the most and least optimal GI/imperviousness configurations.

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.

Global Design Optimization for Aerodynamics and Rocket Propulsion Components

NASA Technical Reports Server (NTRS)

Shyy, Wei; Papila, Nilay; Vaidyanathan, Rajkumar; Tucker, Kevin; Turner, James E. (Technical Monitor)

2000-01-01

Modern computational and experimental tools for aerodynamics and propulsion applications have matured to a stage where they can provide substantial insight into engineering processes involving fluid flows, and can be fruitfully utilized to help improve the design of practical devices. In particular, rapid and continuous development in aerospace engineering demands that new design concepts be regularly proposed to meet goals for increased performance, robustness and safety while concurrently decreasing cost. To date, the majority of the effort in design optimization of fluid dynamics has relied on gradient-based search algorithms. Global optimization methods can utilize the information collected from various sources and by different tools. These methods offer multi-criterion optimization, handle the existence of multiple design points and trade-offs via insight into the entire design space, can easily perform tasks in parallel, and are often effective in filtering the noise intrinsic to numerical and experimental data. However, a successful application of the global optimization method needs to address issues related to data requirements with an increase in the number of design variables, and methods for predicting the model performance. In this article, we review recent progress made in establishing suitable global optimization techniques employing neural network and polynomial-based response surface methodologies. Issues addressed include techniques for construction of the response surface, design of experiment techniques for supplying information in an economical manner, optimization procedures and multi-level techniques, and assessment of relative performance between polynomials and neural networks. Examples drawn from wing aerodynamics, turbulent diffuser flows, gas-gas injectors, and supersonic turbines are employed to help demonstrate the issues involved in an engineering design context. Both the usefulness of the existing knowledge to aid current design practices and the need for future research are identified.

A new traffic control design method for large networks with signalized intersections

NASA Technical Reports Server (NTRS)

Leininger, G. G.; Colony, D. C.; Seldner, K.

1979-01-01

The paper presents a traffic control design technique for application to large traffic networks with signalized intersections. It is shown that the design method adopts a macroscopic viewpoint to establish a new traffic modelling procedure in which vehicle platoons are subdivided into main stream queues and turning queues. Optimization of the signal splits minimizes queue lengths in the steady state condition and improves traffic flow conditions, from the viewpoint of the traveling public. Finally, an application of the design method to a traffic network with thirty-three signalized intersections is used to demonstrate the effectiveness of the proposed technique.

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

Neural network river forecasting through baseflow separation and binary-coded swarm optimization

NASA Astrophysics Data System (ADS)

Taormina, Riccardo; Chau, Kwok-Wing; Sivakumar, Bellie

2015-10-01

The inclusion of expert knowledge in data-driven streamflow modeling is expected to yield more accurate estimates of river quantities. Modular models (MMs) designed to work on different parts of the hydrograph are preferred ways to implement such approach. Previous studies have suggested that better predictions of total streamflow could be obtained via modular Artificial Neural Networks (ANNs) trained to perform an implicit baseflow separation. These MMs fit separately the baseflow and excess flow components as produced by a digital filter, and reconstruct the total flow by adding these two signals at the output. The optimization of the filter parameters and ANN architectures is carried out through global search techniques. Despite the favorable premises, the real effectiveness of such MMs has been tested only on a few case studies, and the quality of the baseflow separation they perform has never been thoroughly assessed. In this work, we compare the performance of MM against global models (GMs) for nine different gaging stations in the northern United States. Binary-coded swarm optimization is employed for the identification of filter parameters and model structure, while Extreme Learning Machines, instead of ANN, are used to drastically reduce the large computational times required to perform the experiments. The results show that there is no evidence that MM outperform global GM for predicting the total flow. In addition, the baseflow produced by the MM largely underestimates the actual baseflow component expected for most of the considered gages. This occurs because the values of the filter parameters maximizing overall accuracy do not reflect the geological characteristics of the river basins. The results indeed show that setting the filter parameters according to expert knowledge results in accurate baseflow separation but lower accuracy of total flow predictions, suggesting that these two objectives are intrinsically conflicting rather than compatible.

AI techniques for optimizing multi-objective reservoir operation upon human and riverine ecosystem demands

NASA Astrophysics Data System (ADS)

Tsai, Wen-Ping; Chang, Fi-John; Chang, Li-Chiu; Herricks, Edwin E.

2015-11-01

Flow regime is the key driver of the riverine ecology. This study proposes a novel hybrid methodology based on artificial intelligence (AI) techniques for quantifying riverine ecosystems requirements and delivering suitable flow regimes that sustain river and floodplain ecology through optimizing reservoir operation. This approach addresses issues to better fit riverine ecosystem requirements with existing human demands. We first explored and characterized the relationship between flow regimes and fish communities through a hybrid artificial neural network (ANN). Then the non-dominated sorting genetic algorithm II (NSGA-II) was established for river flow management over the Shihmen Reservoir in northern Taiwan. The ecosystem requirement took the form of maximizing fish diversity, which could be estimated by the hybrid ANN. The human requirement was to provide a higher satisfaction degree of water supply. The results demonstrated that the proposed methodology could offer a number of diversified alternative strategies for reservoir operation and improve reservoir operational strategies producing downstream flows that could meet both human and ecosystem needs. Applications that make this methodology attractive to water resources managers benefit from the wide spread of Pareto-front (optimal) solutions allowing decision makers to easily determine the best compromise through the trade-off between reservoir operational strategies for human and ecosystem needs.

Prediction of forced expiratory volume in pulmonary function test using radial basis neural networks and k-means clustering.

PubMed

Manoharan, Sujatha C; Ramakrishnan, Swaminathan

2009-10-01

In this work, prediction of forced expiratory volume in pulmonary function test, carried out using spirometry and neural networks is presented. The pulmonary function data were recorded from volunteers using commercial available flow volume spirometer in standard acquisition protocol. The Radial Basis Function neural networks were used to predict forced expiratory volume in 1 s (FEV1) from the recorded flow volume curves. The optimal centres of the hidden layer of radial basis function were determined by k-means clustering algorithm. The performance of the neural network model was evaluated by computing their prediction error statistics of average value, standard deviation, root mean square and their correlation with the true data for normal, restrictive and obstructive cases. Results show that the adopted neural networks are capable of predicting FEV1 in both normal and abnormal cases. Prediction accuracy was more in obstructive abnormality when compared to restrictive cases. It appears that this method of assessment is useful in diagnosing the pulmonary abnormalities with incomplete data and data with poor recording.

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.

Active matter logic for autonomous microfluidics

NASA Astrophysics Data System (ADS)

Woodhouse, Francis G.; Dunkel, Jörn

2017-04-01

Chemically or optically powered active matter plays an increasingly important role in materials design, but its computational potential has yet to be explored systematically. The competition between energy consumption and dissipation imposes stringent physical constraints on the information transport in active flow networks, facilitating global optimization strategies that are not well understood. Here, we combine insights from recent microbial experiments with concepts from lattice-field theory and non-equilibrium statistical mechanics to introduce a generic theoretical framework for active matter logic. Highlighting conceptual differences with classical and quantum computation, we demonstrate how the inherent non-locality of incompressible active flow networks can be utilized to construct universal logical operations, Fredkin gates and memory storage in set-reset latches through the synchronized self-organization of many individual network components. Our work lays the conceptual foundation for developing autonomous microfluidic transport devices driven by bacterial fluids, active liquid crystals or chemically engineered motile colloids.

Combinatorial optimization games

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

Deng, X.; Ibaraki, Toshihide; Nagamochi, Hiroshi

1997-06-01

We introduce a general integer programming formulation for a class of combinatorial optimization games, which immediately allows us to improve the algorithmic result for finding amputations in the core (an important solution concept in cooperative game theory) of the network flow game on simple networks by Kalai and Zemel. An interesting result is a general theorem that the core for this class of games is nonempty if and only if a related linear program has an integer optimal solution. We study the properties for this mathematical condition to hold for several interesting problems, and apply them to resolve algorithmic andmore » complexity issues for their cores along the line as put forward in: decide whether the core is empty; if the core is empty, find an imputation in the core; given an imputation x, test whether x is in the core. We also explore the properties of totally balanced games in this succinct formulation of cooperative games.« less

Uncertainty analysis of neural network based flood forecasting models: An ensemble based approach for constructing prediction interval

NASA Astrophysics Data System (ADS)

Kasiviswanathan, K.; Sudheer, K.

2013-05-01

Artificial neural network (ANN) based hydrologic models have gained lot of attention among water resources engineers and scientists, owing to their potential for accurate prediction of flood flows as compared to conceptual or physics based hydrologic models. The ANN approximates the non-linear functional relationship between the complex hydrologic variables in arriving at the river flow forecast values. Despite a large number of applications, there is still some criticism that ANN's point prediction lacks in reliability since the uncertainty of predictions are not quantified, and it limits its use in practical applications. A major concern in application of traditional uncertainty analysis techniques on neural network framework is its parallel computing architecture with large degrees of freedom, which makes the uncertainty assessment a challenging task. Very limited studies have considered assessment of predictive uncertainty of ANN based hydrologic models. In this study, a novel method is proposed that help construct the prediction interval of ANN flood forecasting model during calibration itself. The method is designed to have two stages of optimization during calibration: at stage 1, the ANN model is trained with genetic algorithm (GA) to obtain optimal set of weights and biases vector, and during stage 2, the optimal variability of ANN parameters (obtained in stage 1) is identified so as to create an ensemble of predictions. During the 2nd stage, the optimization is performed with multiple objectives, (i) minimum residual variance for the ensemble mean, (ii) maximum measured data points to fall within the estimated prediction interval and (iii) minimum width of prediction interval. The method is illustrated using a real world case study of an Indian basin. The method was able to produce an ensemble that has an average prediction interval width of 23.03 m3/s, with 97.17% of the total validation data points (measured) lying within the interval. The derived prediction interval for a selected hydrograph in the validation data set is presented in Fig 1. It is noted that most of the observed flows lie within the constructed prediction interval, and therefore provides information about the uncertainty of the prediction. One specific advantage of the method is that when ensemble mean value is considered as a forecast, the peak flows are predicted with improved accuracy by this method compared to traditional single point forecasted ANNs. Fig. 1 Prediction Interval for selected hydrograph

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.

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

NASA Astrophysics Data System (ADS)

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

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

Research on Closed Residential Area Based on Balanced Distribution Theory

NASA Astrophysics Data System (ADS)

Lan, Si; Fang, Ni; Lin, Hai Peng; Ye, Shi Qi

2018-06-01

With the promotion of the street system, residential quarters and units of the compound gradually open. In this paper, the relationship between traffic flow and traffic flow is established for external roads, and the road resistance model is established by internal roads. We propose a balanced distribution model from the two aspects of road opening conditions and traffic flow inside and outside the district, and quantitatively analyze the impact of the opening and closing on the surrounding roads. Finally, it puts forward feasible suggestions to improve the traffic situation and optimize the network structure.

Qualitative modeling of silica plasma etching using neural network

NASA Astrophysics Data System (ADS)

Kim, Byungwhan; Kwon, Kwang Ho

2003-01-01

An etching of silica thin film is qualitatively modeled by using a neural network. The process was characterized by a 23 full factorial experiment plus one center point, in which the experimental factors and ranges include 100-800 W radio-frequency source power, 100-400 W bias power and gas flow rate ratio CHF3/CF4. The gas flow rate ratio varied from 0.2 to 5.0. The backpropagation neural network (BPNN) was trained on nine experiments and tested on six experiments, not pertaining to the original training data. The prediction ability of the BPNN was optimized as a function of the training parameters. Prediction errors are 180 Å/min and 1.33, for the etch rate and anisotropy models, respectively. Physical etch mechanisms were estimated from the three-dimensional plots generated from the optimized models. Predicted response surfaces were consistent with experimentally measured etch data. The dc bias was correlated to the etch responses to evaluate its contribution. Both the source power (plasma density) and bias power (ion directionality) strongly affected the etch rate. The source power was the most influential factor for the etch rate. A conflicting effect between the source and bias powers was noticed with respect to the anisotropy. The dc bias played an important role in understanding or separating physical etch mechanisms.

Optimum periodicity of repeated contractile actions applied in mass transport

NASA Astrophysics Data System (ADS)

Ahn, Sungsook; Lee, Sang Joon

2015-01-01

Dynamically repeated periodic patterns are abundant in natural and artificial systems, such as tides, heart beats, stock prices, and the like. The characteristic repeatability and periodicity are expected to be optimized in effective system-specific functions. In this study, such optimum periodicity is experimentally evaluated in terms of effective mass transport using one-valve and multi-valve systems working in contractile fluid flows. A set of nanoscale gating functions is utilized, operating in nanocomposite networks through which permeates selectively pass under characteristic contractile actions. Optimized contractile periodicity exists for effective energy impartment to flow in a one-valve system. In the sequential contractile actions for a multi-valve system, synchronization with the fluid flow is critical for effective mass transport. This study provides fundamental understanding on the various repeated periodic patterns and dynamic repeatability occurring in nature and mechanical systems, which are useful for broad applications.

Artificial neural network modeling of a deflector in a grooved channel as well as optimization of its effective parameters

NASA Astrophysics Data System (ADS)

Abdollahi, Azita; Shams, Mehrzad; Abdollahi, Anita

2018-01-01

One of methods available to increase the rate of heat transfer in channels with parallel plates is making grooves in them. But, the fundamental problem of this method is the formation of stagnation zone in the grooves and as a result formation a zone with low energy transfer. In this paper, the effect of placing curved deflectors (geometries with elliptical forms) in channel on thermal and hydraulic characteristic of the fluid flow- with the aim of directing of the flow into the grooves and as a result increasing the rate of heat transfer in this zone- are investigated and heat transfer coefficient and pressure drop are calculated for different values of Reynolds number and geometrical parameters of the deflector (its small and large radiuses). The results show that the presence of the deflector in the channel significantly increases the heat transfer rate compare to the channel without deflector. Of course, it should be noted that this work also increases the pressure drop. So, finally in order to determine configurations of the deflector causing minimum pressure drop, maximum Nusselt number or a balance between them, optimization algorithm consisting of artificial neural network and multi-objective genetic algorithm was utilized to calculate the optimal values of these parameters.

Multi-objective Decision Based Available Transfer Capability in Deregulated Power System Using Heuristic Approaches

NASA Astrophysics Data System (ADS)

Pasam, Gopi Krishna; Manohar, T. Gowri

2016-09-01

Determination of available transfer capability (ATC) requires the use of experience, intuition and exact judgment in order to meet several significant aspects in the deregulated environment. Based on these points, this paper proposes two heuristic approaches to compute ATC. The first proposed heuristic algorithm integrates the five methods known as continuation repeated power flow, repeated optimal power flow, radial basis function neural network, back propagation neural network and adaptive neuro fuzzy inference system to obtain ATC. The second proposed heuristic model is used to obtain multiple ATC values. Out of these, a specific ATC value will be selected based on a number of social, economic, deregulated environmental constraints and related to specific applications like optimization, on-line monitoring, and ATC forecasting known as multi-objective decision based optimal ATC. The validity of results obtained through these proposed methods are scrupulously verified on various buses of the IEEE 24-bus reliable test system. The results presented and derived conclusions in this paper are very useful for planning, operation, maintaining of reliable power in any power system and its monitoring in an on-line environment of deregulated power system. In this way, the proposed heuristic methods would contribute the best possible approach to assess multiple objective ATC using integrated methods.

PcapDB: Search Optimized Packet Capture, Version 0.1.0.0

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

Ferrell, Paul; Steinfadt, Shannon

PcapDB is a packet capture system designed to optimize the captured data for fast search in the typical (network incident response) use case. The technology involved in this software has been submitted via the IDEAS system and has been filed as a provisional patent. It includes the following primary components: capture: The capture component utilizes existing capture libraries to retrieve packets from network interfaces. Once retrieved the packets are passed to additional threads for sorting into flows and indexing. The sorted flows and indexes are passed to other threads so that they can be written to disk. These components aremore » written in the C programming language. search: The search components provide a means to find relevant flows and the associated packets. A search query is parsed and represented as a search tree. Various search commands, written in C, are then used resolve this tree into a set of search results. The tree generation and search execution management components are written in python. interface: The PcapDB web interface is written in Python on the Django framework. It provides a series of pages, API's, and asynchronous tasks that allow the user to manage the capture system, perform searches, and retrieve results. Web page components are written in HTML,CSS and Javascript.« less

Maintaining network activity in submerged hippocampal slices: importance of oxygen supply.

PubMed

Hájos, Norbert; Ellender, Tommas J; Zemankovics, Rita; Mann, Edward O; Exley, Richard; Cragg, Stephanie J; Freund, Tamás F; Paulsen, Ole

2009-01-01

Studies in brain slices have provided a wealth of data on the basic features of neurons and synapses. In the intact brain, these properties may be strongly influenced by ongoing network activity. Although physiologically realistic patterns of network activity have been successfully induced in brain slices maintained in interface-type recording chambers, they have been harder to obtain in submerged-type chambers, which offer significant experimental advantages, including fast exchange of pharmacological agents, visually guided patch-clamp recordings, and imaging techniques. Here, we investigated conditions for the emergence of network oscillations in submerged slices prepared from the hippocampus of rats and mice. We found that the local oxygen level is critical for generation and propagation of both spontaneously occurring sharp wave-ripple oscillations and cholinergically induced fast oscillations. We suggest three ways to improve the oxygen supply to slices under submerged conditions: (i) optimizing chamber design for laminar flow of superfusion fluid; (ii) increasing the flow rate of superfusion fluid; and (iii) superfusing both surfaces of the slice. These improvements to the recording conditions enable detailed studies of neurons under more realistic conditions of network activity, which are essential for a better understanding of neuronal network operation.

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

The Application of Social Characteristic and L1 Optimization in the Error Correction for Network Coding in Wireless Sensor Networks

PubMed Central

Zhang, Guangzhi; Cai, Shaobin; Xiong, Naixue

2018-01-01

One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C/2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C/2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi’s model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments. PMID:29401668

The Application of Social Characteristic and L1 Optimization in the Error Correction for Network Coding in Wireless Sensor Networks.

PubMed

Zhang, Guangzhi; Cai, Shaobin; Xiong, Naixue

2018-02-03

One of the remarkable challenges about Wireless Sensor Networks (WSN) is how to transfer the collected data efficiently due to energy limitation of sensor nodes. Network coding will increase network throughput of WSN dramatically due to the broadcast nature of WSN. However, the network coding usually propagates a single original error over the whole network. Due to the special property of error propagation in network coding, most of error correction methods cannot correct more than C /2 corrupted errors where C is the max flow min cut of the network. To maximize the effectiveness of network coding applied in WSN, a new error-correcting mechanism to confront the propagated error is urgently needed. Based on the social network characteristic inherent in WSN and L1 optimization, we propose a novel scheme which successfully corrects more than C /2 corrupted errors. What is more, even if the error occurs on all the links of the network, our scheme also can correct errors successfully. With introducing a secret channel and a specially designed matrix which can trap some errors, we improve John and Yi's model so that it can correct the propagated errors in network coding which usually pollute exactly 100% of the received messages. Taking advantage of the social characteristic inherent in WSN, we propose a new distributed approach that establishes reputation-based trust among sensor nodes in order to identify the informative upstream sensor nodes. With referred theory of social networks, the informative relay nodes are selected and marked with high trust value. The two methods of L1 optimization and utilizing social characteristic coordinate with each other, and can correct the propagated error whose fraction is even exactly 100% in WSN where network coding is performed. The effectiveness of the error correction scheme is validated through simulation experiments.

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

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

NASA Astrophysics Data System (ADS)

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

2015-03-01

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

Engine With Regression and Neural Network Approximators Designed

NASA Technical Reports Server (NTRS)

Patnaik, Surya N.; Hopkins, Dale A.

2001-01-01

At the NASA Glenn Research Center, the NASA engine performance program (NEPP, ref. 1) and the design optimization testbed COMETBOARDS (ref. 2) with regression and neural network analysis-approximators have been coupled to obtain a preliminary engine design methodology. The solution to a high-bypass-ratio subsonic waverotor-topped turbofan engine, which is shown in the preceding figure, was obtained by the simulation depicted in the following figure. This engine is made of 16 components mounted on two shafts with 21 flow stations. The engine is designed for a flight envelope with 47 operating points. The design optimization utilized both neural network and regression approximations, along with the cascade strategy (ref. 3). The cascade used three algorithms in sequence: the method of feasible directions, the sequence of unconstrained minimizations technique, and sequential quadratic programming. The normalized optimum thrusts obtained by the three methods are shown in the following figure: the cascade algorithm with regression approximation is represented by a triangle, a circle is shown for the neural network solution, and a solid line indicates original NEPP results. The solutions obtained from both approximate methods lie within one standard deviation of the benchmark solution for each operating point. The simulation improved the maximum thrust by 5 percent. The performance of the linear regression and neural network methods as alternate engine analyzers was found to be satisfactory for the analysis and operation optimization of air-breathing propulsion engines (ref. 4).

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.

Conservation of high-flux backbone in alternate optimal and near-optimal flux distributions of metabolic networks.

PubMed

Samal, Areejit

2008-12-01

Constraint-based flux balance analysis (FBA) has proven successful in predicting the flux distribution of metabolic networks in diverse environmental conditions. FBA finds one of the alternate optimal solutions that maximizes the biomass production rate. Almaas et al. have shown that the flux distribution follows a power law, and it is possible to associate with most metabolites two reactions which maximally produce and consume a given metabolite, respectively. This observation led to the concept of high-flux backbone (HFB) in metabolic networks. In previous work, the HFB has been computed using a particular optima obtained using FBA. In this paper, we investigate the conservation of HFB of a particular solution for a given medium across different alternate optima and near-optima in metabolic networks of E. coli and S. cerevisiae. Using flux variability analysis (FVA), we propose a method to determine reactions that are guaranteed to be in HFB regardless of alternate solutions. We find that the HFB of a particular optima is largely conserved across alternate optima in E. coli, while it is only moderately conserved in S. cerevisiae. However, the HFB of a particular near-optima shows a large variation across alternate near-optima in both organisms. We show that the conserved set of reactions in HFB across alternate near-optima has a large overlap with essential reactions and reactions which are both uniquely consuming (UC) and uniquely producing (UP). Our findings suggest that the structure of the metabolic network admits a high degree of redundancy and plasticity in near-optimal flow patterns enhancing system robustness for a given environmental condition.

Experimental demonstration of multi-dimensional resources integration for service provisioning in cloud radio over fiber network

NASA Astrophysics Data System (ADS)

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

2016-07-01

Cloud radio access network (C-RAN) becomes a promising scenario to accommodate high-performance services with ubiquitous user coverage and real-time cloud computing in 5G area. However, the radio network, optical network and processing unit cloud have been decoupled from each other, so that their resources are controlled independently. Traditional architecture cannot implement the resource optimization and scheduling for the high-level service guarantee due to the communication obstacle among them with the growing number of mobile internet users. In this paper, we report a study on multi-dimensional resources integration (MDRI) for service provisioning in cloud radio over fiber network (C-RoFN). A resources integrated provisioning (RIP) scheme using an auxiliary graph is introduced based on the proposed architecture. The MDRI can enhance the responsiveness to dynamic end-to-end user demands and globally optimize radio frequency, optical network and processing resources effectively to maximize radio coverage. The feasibility of the proposed architecture is experimentally verified on OpenFlow-based enhanced SDN testbed. The performance of RIP scheme under heavy traffic load scenario is also quantitatively evaluated to demonstrate the efficiency of the proposal based on MDRI architecture in terms of resource utilization, path blocking probability, network cost and path provisioning latency, compared with other provisioning schemes.

Experimental demonstration of multi-dimensional resources integration for service provisioning in cloud radio over fiber network.

PubMed

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

2016-07-28

Cloud radio access network (C-RAN) becomes a promising scenario to accommodate high-performance services with ubiquitous user coverage and real-time cloud computing in 5G area. However, the radio network, optical network and processing unit cloud have been decoupled from each other, so that their resources are controlled independently. Traditional architecture cannot implement the resource optimization and scheduling for the high-level service guarantee due to the communication obstacle among them with the growing number of mobile internet users. In this paper, we report a study on multi-dimensional resources integration (MDRI) for service provisioning in cloud radio over fiber network (C-RoFN). A resources integrated provisioning (RIP) scheme using an auxiliary graph is introduced based on the proposed architecture. The MDRI can enhance the responsiveness to dynamic end-to-end user demands and globally optimize radio frequency, optical network and processing resources effectively to maximize radio coverage. The feasibility of the proposed architecture is experimentally verified on OpenFlow-based enhanced SDN testbed. The performance of RIP scheme under heavy traffic load scenario is also quantitatively evaluated to demonstrate the efficiency of the proposal based on MDRI architecture in terms of resource utilization, path blocking probability, network cost and path provisioning latency, compared with other provisioning schemes.

Experimental demonstration of multi-dimensional resources integration for service provisioning in cloud radio over fiber network

PubMed Central

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

2016-01-01

Cloud radio access network (C-RAN) becomes a promising scenario to accommodate high-performance services with ubiquitous user coverage and real-time cloud computing in 5G area. However, the radio network, optical network and processing unit cloud have been decoupled from each other, so that their resources are controlled independently. Traditional architecture cannot implement the resource optimization and scheduling for the high-level service guarantee due to the communication obstacle among them with the growing number of mobile internet users. In this paper, we report a study on multi-dimensional resources integration (MDRI) for service provisioning in cloud radio over fiber network (C-RoFN). A resources integrated provisioning (RIP) scheme using an auxiliary graph is introduced based on the proposed architecture. The MDRI can enhance the responsiveness to dynamic end-to-end user demands and globally optimize radio frequency, optical network and processing resources effectively to maximize radio coverage. The feasibility of the proposed architecture is experimentally verified on OpenFlow-based enhanced SDN testbed. The performance of RIP scheme under heavy traffic load scenario is also quantitatively evaluated to demonstrate the efficiency of the proposal based on MDRI architecture in terms of resource utilization, path blocking probability, network cost and path provisioning latency, compared with other provisioning schemes. PMID:27465296

Hydraulic tomography of discrete networks of conduits and fractures in a karstic aquifer by using a deterministic inversion algorithm

NASA Astrophysics Data System (ADS)

Fischer, P.; Jardani, A.; Lecoq, N.

2018-02-01

In this paper, we present a novel inverse modeling method called Discrete Network Deterministic Inversion (DNDI) for mapping the geometry and property of the discrete network of conduits and fractures in the karstified aquifers. The DNDI algorithm is based on a coupled discrete-continuum concept to simulate numerically water flows in a model and a deterministic optimization algorithm to invert a set of observed piezometric data recorded during multiple pumping tests. In this method, the model is partioned in subspaces piloted by a set of parameters (matrix transmissivity, and geometry and equivalent transmissivity of the conduits) that are considered as unknown. In this way, the deterministic optimization process can iteratively correct the geometry of the network and the values of the properties, until it converges to a global network geometry in a solution model able to reproduce the set of data. An uncertainty analysis of this result can be performed from the maps of posterior uncertainties on the network geometry or on the property values. This method has been successfully tested for three different theoretical and simplified study cases with hydraulic responses data generated from hypothetical karstic models with an increasing complexity of the network geometry, and of the matrix heterogeneity.

Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows

PubMed Central

Wang, Di; Kleinberg, Robert D.

2009-01-01

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

Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows.

PubMed

Wang, Di; Kleinberg, Robert D

2009-11-28

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

Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 1. Flow without reactions

NASA Astrophysics Data System (ADS)

Cocco, Alex P.; Nakajo, Arata; Chiu, Wilson K. S.

2017-12-01

We present a fully analytical, heuristic model - the "Analytical Transport Network Model" - for steady-state, diffusive, potential flow through a 3-D network. Employing a combination of graph theory, linear algebra, and geometry, the model explicitly relates a microstructural network's topology and the morphology of its channels to an effective material transport coefficient (a general term meant to encompass, e.g., conductivity or diffusion coefficient). The model's transport coefficient predictions agree well with those from electrochemical fin (ECF) theory and finite element analysis (FEA), but are computed 0.5-1.5 and 5-6 orders of magnitude faster, respectively. In addition, the theory explicitly relates a number of morphological and topological parameters directly to the transport coefficient, whereby the distributions that characterize the structure are readily available for further analysis. Furthermore, ATN's explicit development provides insight into the nature of the tortuosity factor and offers the potential to apply theory from network science and to consider the optimization of a network's effective resistance in a mathematically rigorous manner. The ATN model's speed and relative ease-of-use offer the potential to aid in accelerating the design (with respect to transport), and thus reducing the cost, of energy materials.

Optimal Output of Distributed Generation Based On Complex Power Increment

NASA Astrophysics Data System (ADS)

Wu, D.; Bao, H.

2017-12-01

In order to meet the growing demand for electricity and improve the cleanliness of power generation, new energy generation, represented by wind power generation, photovoltaic power generation, etc has been widely used. The new energy power generation access to distribution network in the form of distributed generation, consumed by local load. However, with the increase of the scale of distribution generation access to the network, the optimization of its power output is becoming more and more prominent, which needs further study. Classical optimization methods often use extended sensitivity method to obtain the relationship between different power generators, but ignore the coupling parameter between nodes makes the results are not accurate; heuristic algorithm also has defects such as slow calculation speed, uncertain outcomes. This article proposes a method called complex power increment, the essence of this method is the analysis of the power grid under steady power flow. After analyzing the results we can obtain the complex scaling function equation between the power supplies, the coefficient of the equation is based on the impedance parameter of the network, so the description of the relation of variables to the coefficients is more precise Thus, the method can accurately describe the power increment relationship, and can obtain the power optimization scheme more accurately and quickly than the extended sensitivity method and heuristic method.

River landscapes and optimal channel networks.

PubMed

Balister, Paul; Balogh, József; Bertuzzo, Enrico; Bollobás, Béla; Caldarelli, Guido; Maritan, Amos; Mastrandrea, Rossana; Morris, Robert; Rinaldo, Andrea

2018-06-26

We study tree structures termed optimal channel networks (OCNs) that minimize the total gravitational energy loss in the system, an exact property of steady-state landscape configurations that prove dynamically accessible and strikingly similar to natural forms. Here, we show that every OCN is a so-called natural river tree, in the sense that there exists a height function such that the flow directions are always directed along steepest descent. We also study the natural river trees in an arbitrary graph in terms of forbidden substructures, which we call k-path obstacles, and OCNs on a d-dimensional lattice, improving earlier results by determining the minimum energy up to a constant factor for every [Formula: see text] Results extend our capabilities in environmental statistical mechanics. Copyright © 2018 the Author(s). Published by PNAS.

Mixed Criticality Scheduling for Industrial Wireless Sensor Networks

PubMed Central

Jin, Xi; Xia, Changqing; Xu, Huiting; Wang, Jintao; Zeng, Peng

2016-01-01

Wireless sensor networks (WSNs) have been widely used in industrial systems. Their real-time performance and reliability are fundamental to industrial production. Many works have studied the two aspects, but only focus on single criticality WSNs. Mixed criticality requirements exist in many advanced applications in which different data flows have different levels of importance (or criticality). In this paper, first, we propose a scheduling algorithm, which guarantees the real-time performance and reliability requirements of data flows with different levels of criticality. The algorithm supports centralized optimization and adaptive adjustment. It is able to improve both the scheduling performance and flexibility. Then, we provide the schedulability test through rigorous theoretical analysis. We conduct extensive simulations, and the results demonstrate that the proposed scheduling algorithm and analysis significantly outperform existing ones. PMID:27589741

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.

A distributed approach to the OPF problem

NASA Astrophysics Data System (ADS)

Erseghe, Tomaso

2015-12-01

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

Modeling and Optimization for Management of Intermittent Water Supply

NASA Astrophysics Data System (ADS)

Lieb, A. M.; Wilkening, J.; Rycroft, C.

2014-12-01

In many urban areas, piped water is supplied only intermittently, as valves direct water to different parts of the water distribution system at different times. The flow is transient, and may transition between free-surface and pressurized, resulting in complex dynamical features with important consequences for water suppliers and users. These consequences include degradation of distribution system components, compromised water quality, and inequitable water availability. The goal of this work is to model the important dynamics and identify operating conditions that mitigate certain negative effects of intermittent water supply. Specifically, we will look at controlling valve parameters occurring as boundary conditions in a network model of transient, transition flow through closed pipes. Gradient-based optimization will be used to find boundary values to minimize pressure gradients and ensure equitable water availability at system endpoints.

Optimal Dynamics of Intermittent Water Supply

NASA Astrophysics Data System (ADS)

Lieb, Anna; Wilkening, Jon; Rycroft, Chris

2014-11-01

In many urban areas of the developing world, piped water is supplied only intermittently, as valves direct water to different parts of the water distribution system at different times. The flow is transient, and may transition between free-surface and pressurized, resulting in complex dynamical features with important consequences for water suppliers and users. These consequences include degradation of distribution system components, compromised water quality, and inequitable water availability. The goal of this work is to model the important dynamics and identify operating conditions that mitigate certain negative effects of intermittent water supply. Specifically, we will look at valve parameters occurring as boundary conditions in a network model of transient, transition flow through closed pipes. Optimization will be used to find boundary values to minimize pressure gradients and ensure equitable water availability.

River water quality management considering agricultural return flows: application of a nonlinear two-stage stochastic fuzzy programming.

PubMed

Tavakoli, Ali; Nikoo, Mohammad Reza; Kerachian, Reza; Soltani, Maryam

2015-04-01

In this paper, a new fuzzy methodology is developed to optimize water and waste load allocation (WWLA) in rivers under uncertainty. An interactive two-stage stochastic fuzzy programming (ITSFP) method is utilized to handle parameter uncertainties, which are expressed as fuzzy boundary intervals. An iterative linear programming (ILP) is also used for solving the nonlinear optimization model. To accurately consider the impacts of the water and waste load allocation strategies on the river water quality, a calibrated QUAL2Kw model is linked with the WWLA optimization model. The soil, water, atmosphere, and plant (SWAP) simulation model is utilized to determine the quantity and quality of each agricultural return flow. To control pollution loads of agricultural networks, it is assumed that a part of each agricultural return flow can be diverted to an evaporation pond and also another part of it can be stored in a detention pond. In detention ponds, contaminated water is exposed to solar radiation for disinfecting pathogens. Results of applying the proposed methodology to the Dez River system in the southwestern region of Iran illustrate its effectiveness and applicability for water and waste load allocation in rivers. In the planning phase, this methodology can be used for estimating the capacities of return flow diversion system and evaporation and detention ponds.

From Cellular Attractor Selection to Adaptive Signal Control for Traffic Networks

PubMed Central

Tian, Daxin; Zhou, Jianshan; Sheng, Zhengguo; Wang, Yunpeng; Ma, Jianming

2016-01-01

The management of varying traffic flows essentially depends on signal controls at intersections. However, design an optimal control that considers the dynamic nature of a traffic network and coordinates all intersections simultaneously in a centralized manner is computationally challenging. Inspired by the stable gene expressions of Escherichia coli in response to environmental changes, we explore the robustness and adaptability performance of signalized intersections by incorporating a biological mechanism in their control policies, specifically, the evolution of each intersection is induced by the dynamics governing an adaptive attractor selection in cells. We employ a mathematical model to capture such biological attractor selection and derive a generic, adaptive and distributed control algorithm which is capable of dynamically adapting signal operations for the entire dynamical traffic network. We show that the proposed scheme based on attractor selection can not only promote the balance of traffic loads on each link of the network but also allows the global network to accommodate dynamical traffic demands. Our work demonstrates the potential of bio-inspired intelligence emerging from cells and provides a deep understanding of adaptive attractor selection-based control formation that is useful to support the designs of adaptive optimization and control in other domains. PMID:26972968

From Cellular Attractor Selection to Adaptive Signal Control for Traffic Networks.

PubMed

Tian, Daxin; Zhou, Jianshan; Sheng, Zhengguo; Wang, Yunpeng; Ma, Jianming

2016-03-14

The management of varying traffic flows essentially depends on signal controls at intersections. However, design an optimal control that considers the dynamic nature of a traffic network and coordinates all intersections simultaneously in a centralized manner is computationally challenging. Inspired by the stable gene expressions of Escherichia coli in response to environmental changes, we explore the robustness and adaptability performance of signalized intersections by incorporating a biological mechanism in their control policies, specifically, the evolution of each intersection is induced by the dynamics governing an adaptive attractor selection in cells. We employ a mathematical model to capture such biological attractor selection and derive a generic, adaptive and distributed control algorithm which is capable of dynamically adapting signal operations for the entire dynamical traffic network. We show that the proposed scheme based on attractor selection can not only promote the balance of traffic loads on each link of the network but also allows the global network to accommodate dynamical traffic demands. Our work demonstrates the potential of bio-inspired intelligence emerging from cells and provides a deep understanding of adaptive attractor selection-based control formation that is useful to support the designs of adaptive optimization and control in other domains.

Performance evaluation of data center service localization based on virtual resource migration in software defined elastic optical network.

PubMed

Yang, Hui; Zhang, Jie; Ji, Yuefeng; Tan, Yuanlong; Lin, Yi; Han, Jianrui; Lee, Young

2015-09-07

Data center interconnection 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 cross stratum optimization of optical network and application stratums resources that allows to accommodate data center services. In view of this, this study extends the data center resources to user side to enhance the end-to-end quality of service. We propose a novel data center service localization (DCSL) architecture based on virtual resource migration in software defined elastic data center optical network. A migration evaluation scheme (MES) is introduced for DCSL based on the proposed architecture. The DCSL can enhance the responsiveness to the dynamic end-to-end data center demands, and effectively reduce the blocking probability to globally optimize optical network and application resources. The overall feasibility and efficiency of the proposed architecture are experimentally verified on the control plane of our OpenFlow-based enhanced SDN testbed. The performance of MES scheme under heavy traffic load scenario is also quantitatively evaluated based on DCSL architecture in terms of path blocking probability, provisioning latency and resource utilization, compared with other provisioning scheme.

Multiobjective evolutionary optimization of water distribution systems: Exploiting diversity with infeasible solutions.

PubMed

Tanyimboh, Tiku T; Seyoum, Alemtsehay G

2016-12-01

This article investigates the computational efficiency of constraint handling in multi-objective evolutionary optimization algorithms for water distribution systems. The methodology investigated here encourages the co-existence and simultaneous development including crossbreeding of subpopulations of cost-effective feasible and infeasible solutions based on Pareto dominance. This yields a boundary search approach that also promotes diversity in the gene pool throughout the progress of the optimization by exploiting the full spectrum of non-dominated infeasible solutions. The relative effectiveness of small and moderate population sizes with respect to the number of decision variables is investigated also. The results reveal the optimization algorithm to be efficient, stable and robust. It found optimal and near-optimal solutions reliably and efficiently. The real-world system based optimization problem involved multiple variable head supply nodes, 29 fire-fighting flows, extended period simulation and multiple demand categories including water loss. The least cost solutions found satisfied the flow and pressure requirements consistently. The best solutions achieved indicative savings of 48.1% and 48.2% based on the cost of the pipes in the existing network, for populations of 200 and 1000, respectively. The population of 1000 achieved slightly better results overall. Copyright © 2016 The Authors. Published by Elsevier Ltd.. All rights reserved.

Performance and Power Optimization for Cognitive Processor Design Using Deep-Submicron Very Large Scale Integration (VLSI) Technology

DTIC Science & Technology

2010-03-01

DATES COVERED (From - To) October 2008 – October 2009 4 . TITLE AND SUBTITLE PERFORMANCE AND POWER OPTIMIZATION FOR COGNITIVE PROCESSOR DESIGN USING...Computations 2  2.2  Cognitive Models and Algorithms for Intelligent Text Recognition 4   2.2.1 Brain-State-in-a-Box Neural Network Model. 4   2.2.2...The ASIC-style design and synthesis flow for FPU 8  Figure 4 : Screen shots of the final layouts 10  Figure 5: Projected performance and power roadmap

Optimal Sizing and Placement of Battery Energy Storage in Distribution System Based on Solar Size for Voltage Regulation

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

Nazaripouya, Hamidreza; Wang, Yubo; Chu, Peter

2016-07-26

This paper proposes a new strategy to achieve voltage regulation in distributed power systems in the presence of solar energy sources and battery storage systems. The goal is to find the minimum size of battery storage and its corresponding location in the network based on the size and place of the integrated solar generation. The proposed method formulates the problem by employing the network impedance matrix to obtain an analytical solution instead of using a recursive algorithm such as power flow. The required modifications for modeling the slack and PV buses (generator buses) are utilized to increase the accuracy ofmore » the approach. The use of reactive power control to regulate the voltage regulation is not always an optimal solution as in distribution systems R/X is large. In this paper the minimum size and the best place of battery storage is achieved by optimizing the amount of both active and reactive power exchanged by battery storage and its gridtie inverter (GTI) based on the network topology and R/X ratios in the distribution system. Simulation results for the IEEE 14-bus system verify the effectiveness of the proposed approach.« less

A Two-Stage Algorithm for Origin-Destination Matrices Estimation Considering Dynamic Dispersion Parameter for Route Choice

PubMed Central

Wang, Yong; Ma, Xiaolei; Liu, Yong; Gong, Ke; Henricakson, Kristian C.; Xu, Maozeng; Wang, Yinhai

2016-01-01

This paper proposes a two-stage algorithm to simultaneously estimate origin-destination (OD) matrix, link choice proportion, and dispersion parameter using partial traffic counts in a congested network. A non-linear optimization model is developed which incorporates a dynamic dispersion parameter, followed by a two-stage algorithm in which Generalized Least Squares (GLS) estimation and a Stochastic User Equilibrium (SUE) assignment model are iteratively applied until the convergence is reached. To evaluate the performance of the algorithm, the proposed approach is implemented in a hypothetical network using input data with high error, and tested under a range of variation coefficients. The root mean squared error (RMSE) of the estimated OD demand and link flows are used to evaluate the model estimation results. The results indicate that the estimated dispersion parameter theta is insensitive to the choice of variation coefficients. The proposed approach is shown to outperform two established OD estimation methods and produce parameter estimates that are close to the ground truth. In addition, the proposed approach is applied to an empirical network in Seattle, WA to validate the robustness and practicality of this methodology. In summary, this study proposes and evaluates an innovative computational approach to accurately estimate OD matrices using link-level traffic flow data, and provides useful insight for optimal parameter selection in modeling travelers’ route choice behavior. PMID:26761209

Algorithms for constructing optimal paths and statistical analysis of passenger traffic

NASA Astrophysics Data System (ADS)

Trofimov, S. P.; Druzhinina, N. G.; Trofimova, O. G.

2018-01-01

Several existing information systems of urban passenger transport (UPT) are considered. Author’s UPT network model is presented. To a passenger a new service is offered that is the best path from one stop to another stop at a specified time. The algorithm and software implementation for finding the optimal path are presented. The algorithm uses the current UPT schedule. The article also describes the algorithm of statistical analysis of trip payments by the electronic E-cards. The algorithm allows obtaining the density of passenger traffic during the day. This density is independent of the network topology and UPT schedules. The resulting density of the traffic flow can solve a number of practical problems. In particular, the forecast for the overflow of passenger transport in the «rush» hours, the quantitative comparison of different topologies transport networks, constructing of the best UPT timetable. The efficiency of the proposed integrated approach is demonstrated by the example of the model town with arbitrary dimensions.

Influence of vascular network design on gas transfer in lung assist device technology.

PubMed

Bassett, Erik K; Hoganson, David M; Lo, Justin H; Penson, Elliot J N; Vacanti, Joseph P

2011-01-01

Blood oxygenators are vital for the critically ill, but their use is limited to the hospital setting. A portable blood oxygenator or a lung assist device for ambulatory or long-term use would greatly benefit patients with chronic lung disease. In this work, a biomimetic blood oxygenator system was developed which consisted of a microfluidic vascular network covered by a gas permeable silicone membrane. This system was used to determine the influence of key microfluidic parameters-channel size, oxygen exposure length, and blood shear rate-on blood oxygenation and carbon dioxide removal. Total gas transfer increased linearly with flow rate, independent of channel size and oxygen exposure length. On average, CO(2) transfer was 4.3 times higher than oxygen transfer. Blood oxygen saturation was also found to depend on the flow rate per channel but in an inverse manner; oxygenation decreased and approached an asymptote as the flow rate per channel increased. These relationships can be used to optimize future biomimetic vascular networks for specific lung applications: gas transfer for carbon dioxide removal in patients with chronic obstructive pulmonary disease or oxygenation for premature infants requiring complete lung replacement therapy.

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

Knowledge-based modularization and global optimization of artificial neural network models in hydrological forecasting.

PubMed

Corzo, Gerald; Solomatine, Dimitri

2007-05-01

Natural phenomena are multistationary and are composed of a number of interacting processes, so one single model handling all processes often suffers from inaccuracies. A solution is to partition data in relation to such processes using the available domain knowledge or expert judgment, to train separate models for each of the processes, and to merge them in a modular model (committee). In this paper a problem of water flow forecast in watershed hydrology is considered where the flow process can be presented as consisting of two subprocesses -- base flow and excess flow, so that these two processes can be separated. Several approaches to data separation techniques are studied. Two case studies with different forecast horizons are considered. Parameters of the algorithms responsible for data partitioning are optimized using genetic algorithms and global pattern search. It was found that modularization of ANN models using domain knowledge makes models more accurate, if compared with a global model trained on the whole data set, especially when forecast horizon (and hence the complexity of the modelled processes) is increased.

Nomadic ecology shaped the highland geography of Asia's Silk Roads.

PubMed

Frachetti, Michael D; Smith, C Evan; Traub, Cynthia M; Williams, Tim

2017-03-08

There are many unanswered questions about the evolution of the ancient 'Silk Roads' across Asia. This is especially the case in their mountainous stretches, where harsh terrain is seen as an impediment to travel. Considering the ecology and mobility of inner Asian mountain pastoralists, we use 'flow accumulation' modelling to calculate the annual routes of nomadic societies (from 750 m to 4,000 m elevation). Aggregating 500 iterations of the model reveals a high-resolution flow network that simulates how centuries of seasonal nomadic herding could shape discrete routes of connectivity across the mountains of Asia. We then compare the locations of known high-elevation Silk Road sites with the geography of these optimized herding flows, and find a significant correspondence in mountainous regions. Thus, we argue that highland Silk Road networks (from 750 m to 4,000 m) emerged slowly in relation to long-established mobility patterns of nomadic herders in the mountains of inner Asia.

Nomadic ecology shaped the highland geography of Asia’s Silk Roads

NASA Astrophysics Data System (ADS)

Frachetti, Michael D.; Smith, C. Evan; Traub, Cynthia M.; Williams, Tim

2017-03-01

There are many unanswered questions about the evolution of the ancient ‘Silk Roads’ across Asia. This is especially the case in their mountainous stretches, where harsh terrain is seen as an impediment to travel. Considering the ecology and mobility of inner Asian mountain pastoralists, we use ‘flow accumulation’ modelling to calculate the annual routes of nomadic societies (from 750 m to 4,000 m elevation). Aggregating 500 iterations of the model reveals a high-resolution flow network that simulates how centuries of seasonal nomadic herding could shape discrete routes of connectivity across the mountains of Asia. We then compare the locations of known high-elevation Silk Road sites with the geography of these optimized herding flows, and find a significant correspondence in mountainous regions. Thus, we argue that highland Silk Road networks (from 750 m to 4,000 m) emerged slowly in relation to long-established mobility patterns of nomadic herders in the mountains of inner Asia.

A mixed-mode traffic assignment model with new time-flow impedance function

NASA Astrophysics Data System (ADS)

Lin, Gui-Hua; Hu, Yu; Zou, Yuan-Yang

2018-01-01

Recently, with the wide adoption of electric vehicles, transportation network has shown different characteristics and been further developed. In this paper, we present a new time-flow impedance function, which may be more realistic than the existing time-flow impedance functions. Based on this new impedance function, we present an optimization model for a mixed-mode traffic network in which battery electric vehicles (BEVs) and gasoline vehicles (GVs) are chosen. We suggest two approaches to handle the model: One is to use the interior point (IP) algorithm and the other is to employ the sequential quadratic programming (SQP) algorithm. Three numerical examples are presented to illustrate the efficiency of these approaches. In particular, our numerical results show that more travelers prefer to choosing BEVs when the distance limit of BEVs is long enough and the unit operating cost of GVs is higher than that of BEVs, and the SQP algorithm is faster than the IP algorithm.

A Missing Puzzle Piece in Murray's Law: the Optimal Angle of Junctions

NASA Astrophysics Data System (ADS)

Wang, Ruo-Qian; Taylor, Katherine; Winter, Amos G.; Global Engineering; Research Lab Team

2014-11-01

Branching flows are common in biological systems, such as the circulatory and respiratory systems of animals. The optimal radii of parent and daughter branches can be explained with Murray's law, which dictates that the sum of metabolic and pumping costs is minimized. Murray's Law can be used to determine the diameter of cascading channels but misses an important parameter: the angles of the branches. Past hydraulic studies have investigated the angle effect, but have not focused on whether this geometry follows Murray's Law; while a simple network optimization is able to show that at low Reynolds numbers a branch with a parent channel connecting to n equally distant channels obeying Murray's Law has a minimum total head loss with a branching angle θ, such that cos θ =n-2/3 , but it's not valid for high Reynolds number flows, which may experience separation and turbulence at the branches. The present study is focused on determining the optimal branch angle that complies with Murray's Law for moderate Reynolds numbers. Computational studies using Open FOAM and experiments using 3D printed branched channels will be presented. These results will be used to quantify the effect of Reynolds number on optimal branch geometry.

BFL: a node and edge betweenness based fast layout algorithm for large scale networks

PubMed Central

Hashimoto, Tatsunori B; Nagasaki, Masao; Kojima, Kaname; Miyano, Satoru

2009-01-01

Background Network visualization would serve as a useful first step for analysis. However, current graph layout algorithms for biological pathways are insensitive to biologically important information, e.g. subcellular localization, biological node and graph attributes, or/and not available for large scale networks, e.g. more than 10000 elements. Results To overcome these problems, we propose the use of a biologically important graph metric, betweenness, a measure of network flow. This metric is highly correlated with many biological phenomena such as lethality and clusters. We devise a new fast parallel algorithm calculating betweenness to minimize the preprocessing cost. Using this metric, we also invent a node and edge betweenness based fast layout algorithm (BFL). BFL places the high-betweenness nodes to optimal positions and allows the low-betweenness nodes to reach suboptimal positions. Furthermore, BFL reduces the runtime by combining a sequential insertion algorim with betweenness. For a graph with n nodes, this approach reduces the expected runtime of the algorithm to O(n2) when considering edge crossings, and to O(n log n) when considering only density and edge lengths. Conclusion Our BFL algorithm is compared against fast graph layout algorithms and approaches requiring intensive optimizations. For gene networks, we show that our algorithm is faster than all layout algorithms tested while providing readability on par with intensive optimization algorithms. We achieve a 1.4 second runtime for a graph with 4000 nodes and 12000 edges on a standard desktop computer. PMID:19146673

Transport and percolation in complex networks

NASA Astrophysics Data System (ADS)

Li, Guanliang

To design complex networks with optimal transport properties such as flow efficiency, we consider three approaches to understanding transport and percolation in complex networks. We analyze the effects of randomizing the strengths of connections, randomly adding long-range connections to regular lattices, and percolation of spatially constrained networks. Various real-world networks often have links that are differentiated in terms of their strength, intensity, or capacity. We study the distribution P(σ) of the equivalent conductance for Erdoḧs-Rényi (ER) and scale-free (SF) weighted resistor networks with N nodes, for which links are assigned with conductance σ i ≡ e-axi, where xi is a random variable with 0 < xi < 1. We find, both analytically and numerically, that P(σ) for ER networks exhibits two regimes: (i) For σ < e-apc, P(σ) is independent of N and scales as a power law P(σ) ˜ sk/a-1 . Here pc = 1/ is the critical percolation threshold of the network and is the average degree of the network. (ii) For σ > e -apc, P(σ) has strong N dependence and scales as P(σ) ˜ f(σ, apc/N1/3). Transport properties are greatly affected by the topology of networks. We investigate the transport problem in lattices with long-range connections and subject to a cost constraint, seeking design principles for optimal transport networks. Our network is built from a regular d-dimensional lattice to be improved by adding long-range connections with probability Pij ˜ r-aij , where rij is the lattice distance between site i and j. We introduce a cost constraint on the total length of the additional links and find optimal transport in the system for α = d + 1, established here for d = 1, 2 and 3 for regular lattices and df for fractals. Remarkably, this cost constraint approach remains optimal, regardless of the strategy used for transport, whether based on local or global knowledge of the network structure. To further understand the role that long-range connections play in optimizing the transport of complex systems, we study the percolation of spatially constrained networks. We now consider originally empty lattices embedded in d dimensions by adding long-range connections with the same power law probability p(r) ˜ r -α. We find that, for α ≤ d, the percolation transition belongs to the universality class of percolation in ER networks, while for α > 2d it belongs to the universality class of percolation in regular lattices (for one-dimensional linear chain, there is no percolation transition). However for d < α < 2d, the percolation properties show new intermediate behavior different from ER networks, with critical exponents that depend on α.

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.

Remote Sensing of Subsurface Fractures in the Otway Basin, South Australia

NASA Astrophysics Data System (ADS)

Bailey, Adam; King, Rosalind; Holford, Simon; Hand, Martin

2013-04-01

A detailed understanding of naturally occurring fracture networks within the subsurface is becoming increasingly important to the energy sector, as the focus of exploration has expanded to include unconventional reservoirs such as coal seam gas, shale gas, tight gas, and engineered geothermal systems. Successful production from such reservoirs, where primary porosity and permeability is often negligible, is heavily reliant on structural permeability provided by naturally occurring and induced fracture networks, permeability, which is often not provided for through primary porosity and permeability. In this study the Penola Trough, located within the onshore Otway Basin in South Australia, is presented as a case study for remotely detecting and defining subsurface fracture networks that may contribute to secondary permeability. This area is prospective for shale and tight gas and geothermal energy. The existence and nature of natural fractures is verified through an integrated analysis of geophysical logs (including wellbore image logs) and 3D seismic data. Wellbore image logs from 11 petroleum wells within the Penola Trough were interpreted for both stress indicators and natural fractures. A total of 507 naturally occurring fractures were identified, striking approximately WNE-ESE. Fractures which are aligned in the in-situ stress field are optimally oriented for reactivation, and are hence likely to be open to fluid flow. Fractures are identifiable as being either resistive or conductive sinusoids on the resistivity image logs used in this study. Resistive fractures, of which 239 were identified, are considered to be cemented with electrically resistive cements (such as quartz or calcite) and thus closed to fluid flow. Conductive fractures, of which 268 were identified, are considered to be uncemented and open to fluid flow, and thus important to geothermal exploration. Fracture susceptibility diagrams constructed for the identified fractures illustrate that the conductive fractures are optimally oriented for reactivation in the present-day strike-slip fault regime, and so are likely to be open to fluid flow. To gain an understanding of the broader extent of these natural fractures, it is necessary to analyse more regional 3D seismic data. It is well documented that fault and fracture networks like those generally observed in image logs lie well below seismic amplitude resolution, making them difficult to observe directly on amplitude data. However, seismic attributes can be calculated to provide some information on sub-seismic scale structural and stratigraphic features. Using the merged Balnaves/Haselgrove 3D seismic cube acquired over the Penola Trough, attribute maps of complex multi-trace dip-steered coherency and most positive curvature, among others, were used to document the presence of discontinuities within the seismic data which area likely to represent natural fractures, and to best constrain the likely extent of the fracture network which they form. The resulting fracture network model displays relatively good connectivity surrounding structural features intersecting the studied horizons, although large areas lacking significant discontinuities are observed. These areas make it unlikely that the fracture network contributes to permeability on a basin-wide scale, though observed features are optimally oriented for reactivation under contemporary stress conditions and are thus likely to provide at least local increases in permeability.

Efficient quantum transmission in multiple-source networks.

PubMed

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

2014-04-02

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

Optimal design of structures for earthquake loads by a hybrid RBF-BPSO method

NASA Astrophysics Data System (ADS)

Salajegheh, Eysa; Gholizadeh, Saeed; Khatibinia, Mohsen

2008-03-01

The optimal seismic design of structures requires that time history analyses (THA) be carried out repeatedly. This makes the optimal design process inefficient, in particular, if an evolutionary algorithm is used. To reduce the overall time required for structural optimization, two artificial intelligence strategies are employed. In the first strategy, radial basis function (RBF) neural networks are used to predict the time history responses of structures in the optimization flow. In the second strategy, a binary particle swarm optimization (BPSO) is used to find the optimum design. Combining the RBF and BPSO, a hybrid RBF-BPSO optimization method is proposed in this paper, which achieves fast optimization with high computational performance. Two examples are presented and compared to determine the optimal weight of structures under earthquake loadings using both exact and approximate analyses. The numerical results demonstrate the computational advantages and effectiveness of the proposed hybrid RBF-BPSO optimization method for the seismic design of structures.

An effective and comprehensive model for optimal rehabilitation of separate sanitary sewer systems.

PubMed

Diogo, António Freire; Barros, Luís Tiago; Santos, Joana; Temido, Jorge Santos

2018-01-15

In the field of rehabilitation of separate sanitary sewer systems, a large number of technical, environmental, and economic aspects are often relevant in the decision-making process, which may be modelled as a multi-objective optimization problem. Examples are those related with the operation and assessment of networks, optimization of structural, hydraulic, sanitary, and environmental performance, rehabilitation programmes, and execution works. In particular, the cost of investment, operation and maintenance needed to reduce or eliminate Infiltration from the underground water table and Inflows of storm water surface runoff (I/I) using rehabilitation techniques or related methods can be significantly lower than the cost of transporting and treating these flows throughout the lifespan of the systems or period studied. This paper presents a comprehensive I/I cost-benefit approach for rehabilitation that explicitly considers all elements of the systems and shows how the approximation is incorporated as an objective function in a general evolutionary multi-objective optimization model. It takes into account network performance and wastewater treatment costs, average values of several input variables, and rates that can reflect the adoption of different predictable or limiting scenarios. The approach can be used as a practical and fast tool to support decision-making in sewer network rehabilitation in any phase of a project. The fundamental aspects, modelling, implementation details and preliminary results of a two-objective optimization rehabilitation model using a genetic algorithm, with a second objective function related to the structural condition of the network and the service failure risk, are presented. The basic approach is applied to three real world cases studies of sanitary sewerage systems in Coimbra and the results show the simplicity, suitability, effectiveness, and usefulness of the approximation implemented and of the objective function proposed. Copyright © 2017 Elsevier B.V. All rights reserved.

GIS as a tool for efficient management of transport streams

NASA Astrophysics Data System (ADS)

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

2015-10-01

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

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

NASA Technical Reports Server (NTRS)

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

1988-01-01

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

Tumor Blood Vessel Dynamics

NASA Astrophysics Data System (ADS)

Munn, Lance

2009-11-01

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

Military Interoperable Digital Hospital Testbed (MIDHT)

DTIC Science & Technology

2010-07-01

solutions to optimize healthcare resources for rural communities and identify lessons learned and best practices that benefit both the global MHS...providers and three CHS facilities on their business practices and process flows. Research initiatives will focus on the impact of an electronic...strategic goals and the Nationwide Health Information Network (NHIN). The MIDHT will continue to identify lessons learned/best practices that benefit

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.

Coupling of active motion and advection shapes intracellular cargo transport.

PubMed

Khuc Trong, Philipp; Guck, Jochen; Goldstein, Raymond E

2012-07-13

Intracellular cargo transport can arise from passive diffusion, active motor-driven transport along cytoskeletal filament networks, and passive advection by fluid flows entrained by such cargo-motor motion. Active and advective transport are thus intrinsically coupled as related, yet different representations of the same underlying network structure. A reaction-advection-diffusion system is used here to show that this coupling affects the transport and localization of a passive tracer in a confined geometry. For sufficiently low diffusion, cargo localization to a target zone is optimized either by low reaction kinetics and decoupling of bound and unbound states, or by a mostly disordered cytoskeletal network with only weak directional bias. These generic results may help to rationalize subtle features of cytoskeletal networks, for example as observed for microtubules in fly oocytes.

Marine vessels as substitutes for heavy-duty trucks in Great Lakes freight transportation.

PubMed

Comer, Bryan; Corbett, James J; Hawker, J Scott; Korfmacher, Karl; Lee, Earl E; Prokop, Chris; Winebrake, James J

2010-07-01

This paper applies a geospatial network optimization model to explore environmental, economic, and time-of-delivery tradeoffs associated with the application of marine vessels as substitutes for heavy-duty trucks operating in the Great Lakes region. The geospatial model integrates U.S. and Canadian highway, rail, and waterway networks to create an intermodal network and characterizes this network using temporal, economic, and environmental attributes (including emissions of carbon dioxide, particulate matter, carbon monoxide, sulfur oxides, volatile organic compounds, and nitrogen oxides). A case study evaluates tradeoffs associated with containerized traffic flow in the Great Lakes region, demonstrating how choice of freight mode affects the environmental performance of movement of goods. These results suggest opportunities to improve the environmental performance of freight transport through infrastructure development, technology implementation, and economic incentives.

Attainable region analysis for continuous production of second generation bioethanol

PubMed Central

2013-01-01

Background Despite its semi-commercial status, ethanol production from lignocellulosics presents many complexities not yet fully solved. Since the pretreatment stage has been recognized as a complex and yield-determining step, it has been extensively studied. However, economic success of the production process also requires optimization of the biochemical conversion stage. This work addresses the search of bioreactor configurations with improved residence times for continuous enzymatic saccharification and fermentation operations. Instead of analyzing each possible configuration through simulation, we apply graphical methods to optimize the residence time of reactor networks composed of steady-state reactors. Although this can be easily made for processes described by a single kinetic expression, reactions under analysis do not exhibit this feature. Hence, the attainable region method, able to handle multiple species and its reactions, was applied for continuous reactors. Additionally, the effects of the sugars contained in the pretreatment liquor over the enzymatic hydrolysis and simultaneous saccharification and fermentation (SSF) were assessed. Results We obtained candidate attainable regions for separate enzymatic hydrolysis and fermentation (SHF) and SSF operations, both fed with pretreated corn stover. Results show that, despite the complexity of the reaction networks and underlying kinetics, the reactor networks that minimize the residence time can be constructed by using plug flow reactors and continuous stirred tank reactors. Regarding the effect of soluble solids in the feed stream to the reactor network, for SHF higher glucose concentration and yield are achieved for enzymatic hydrolysis with washed solids. Similarly, for SSF, higher yields and bioethanol titers are obtained using this substrate. Conclusions In this work, we demonstrated the capabilities of the attainable region analysis as a tool to assess the optimal reactor network with minimum residence time applied to the SHF and SSF operations for lignocellulosic ethanol production. The methodology can be readily modified to evaluate other kinetic models of different substrates, enzymes and microorganisms when available. From the obtained results, the most suitable reactor configuration considering residence time and rheological aspects is a continuous stirred tank reactor followed by a plug flow reactor (both in SSF mode) using washed solids as substrate. PMID:24286451

Attainable region analysis for continuous production of second generation bioethanol.

PubMed

Scott, Felipe; Conejeros, Raúl; Aroca, Germán

2013-11-29

Despite its semi-commercial status, ethanol production from lignocellulosics presents many complexities not yet fully solved. Since the pretreatment stage has been recognized as a complex and yield-determining step, it has been extensively studied. However, economic success of the production process also requires optimization of the biochemical conversion stage. This work addresses the search of bioreactor configurations with improved residence times for continuous enzymatic saccharification and fermentation operations. Instead of analyzing each possible configuration through simulation, we apply graphical methods to optimize the residence time of reactor networks composed of steady-state reactors. Although this can be easily made for processes described by a single kinetic expression, reactions under analysis do not exhibit this feature. Hence, the attainable region method, able to handle multiple species and its reactions, was applied for continuous reactors. Additionally, the effects of the sugars contained in the pretreatment liquor over the enzymatic hydrolysis and simultaneous saccharification and fermentation (SSF) were assessed. We obtained candidate attainable regions for separate enzymatic hydrolysis and fermentation (SHF) and SSF operations, both fed with pretreated corn stover. Results show that, despite the complexity of the reaction networks and underlying kinetics, the reactor networks that minimize the residence time can be constructed by using plug flow reactors and continuous stirred tank reactors. Regarding the effect of soluble solids in the feed stream to the reactor network, for SHF higher glucose concentration and yield are achieved for enzymatic hydrolysis with washed solids. Similarly, for SSF, higher yields and bioethanol titers are obtained using this substrate. In this work, we demonstrated the capabilities of the attainable region analysis as a tool to assess the optimal reactor network with minimum residence time applied to the SHF and SSF operations for lignocellulosic ethanol production. The methodology can be readily modified to evaluate other kinetic models of different substrates, enzymes and microorganisms when available. From the obtained results, the most suitable reactor configuration considering residence time and rheological aspects is a continuous stirred tank reactor followed by a plug flow reactor (both in SSF mode) using washed solids as substrate.

Landscape genetics for the empirical assessment of resistance surfaces: the European pine marten (Martes martes) as a target-species of a regional ecological network.

PubMed

Ruiz-González, Aritz; Gurrutxaga, Mikel; Cushman, Samuel A; Madeira, María José; Randi, Ettore; Gómez-Moliner, Benjamin J

2014-01-01

Coherent ecological networks (EN) composed of core areas linked by ecological corridors are being developed worldwide with the goal of promoting landscape connectivity and biodiversity conservation. However, empirical assessment of the performance of EN designs is critical to evaluate the utility of these networks to mitigate effects of habitat loss and fragmentation. Landscape genetics provides a particularly valuable framework to address the question of functional connectivity by providing a direct means to investigate the effects of landscape structure on gene flow. The goals of this study are (1) to evaluate the landscape features that drive gene flow of an EN target species (European pine marten), and (2) evaluate the optimality of a regional EN design in providing connectivity for this species within the Basque Country (North Spain). Using partial Mantel tests in a reciprocal causal modeling framework we competed 59 alternative models, including isolation by distance and the regional EN. Our analysis indicated that the regional EN was among the most supported resistance models for the pine marten, but was not the best supported model. Gene flow of pine marten in northern Spain is facilitated by natural vegetation, and is resisted by anthropogenic landcover types and roads. Our results suggest that the regional EN design being implemented in the Basque Country will effectively facilitate gene flow of forest dwelling species at regional scale.

Research on Flow Field Perception Based on Artificial Lateral Line Sensor System.

PubMed

Liu, Guijie; Wang, Mengmeng; Wang, Anyi; Wang, Shirui; Yang, Tingting; Malekian, Reza; Li, Zhixiong

2018-03-11

In nature, the lateral line of fish is a peculiar and important organ for sensing the surrounding hydrodynamic environment, preying, escaping from predators and schooling. In this paper, by imitating the mechanism of fish lateral canal neuromasts, we developed an artificial lateral line system composed of micro-pressure sensors. Through hydrodynamic simulations, an optimized sensor structure was obtained and the pressure distribution models of the lateral surface were established in uniform flow and turbulent flow. Carrying out the corresponding underwater experiment, the validity of the numerical simulation method is verified by the comparison between the experimental data and the simulation results. In addition, a variety of effective research methods are proposed and validated for the flow velocity estimation and attitude perception in turbulent flow, respectively and the shape recognition of obstacles is realized by the neural network algorithm.

Many-objective Groundwater Monitoring Network Design Using Bias-Aware Ensemble Kalman Filtering and Evolutionary Optimization

NASA Astrophysics Data System (ADS)

Kollat, J. B.; Reed, P. M.

2009-12-01

This study contributes the ASSIST (Adaptive Strategies for Sampling in Space and Time) framework for improving long-term groundwater monitoring decisions across space and time while accounting for the influences of systematic model errors (or predictive bias). The ASSIST framework combines contaminant flow-and-transport modeling, bias-aware ensemble Kalman filtering (EnKF) and many-objective evolutionary optimization. Our goal in this work is to provide decision makers with a fuller understanding of the information tradeoffs they must confront when performing long-term groundwater monitoring network design. Our many-objective analysis considers up to 6 design objectives simultaneously and consequently synthesizes prior monitoring network design methodologies into a single, flexible framework. This study demonstrates the ASSIST framework using a tracer study conducted within a physical aquifer transport experimental tank located at the University of Vermont. The tank tracer experiment was extensively sampled to provide high resolution estimates of tracer plume behavior. The simulation component of the ASSIST framework consists of stochastic ensemble flow-and-transport predictions using ParFlow coupled with the Lagrangian SLIM transport model. The ParFlow and SLIM ensemble predictions are conditioned with tracer observations using a bias-aware EnKF. The EnKF allows decision makers to enhance plume transport predictions in space and time in the presence of uncertain and biased model predictions by conditioning them on uncertain measurement data. In this initial demonstration, the position and frequency of sampling were optimized to: (i) minimize monitoring cost, (ii) maximize information provided to the EnKF, (iii) minimize failure to detect the tracer, (iv) maximize the detection of tracer flux, (v) minimize error in quantifying tracer mass, and (vi) minimize error in quantifying the moment of the tracer plume. The results demonstrate that the many-objective problem formulation provides a tremendous amount of information for decision makers. Specifically our many-objective analysis highlights the limitations and potentially negative design consequences of traditional single and two-objective problem formulations. These consequences become apparent through visual exploration of high-dimensional tradeoffs and the identification of regions with interesting compromise solutions. The prediction characteristics of these compromise designs are explored in detail, as well as their implications for subsequent design decisions in both space and time.

Optimization of monitoring networks based on uncertainty quantification of model predictions of contaminant transport

NASA Astrophysics Data System (ADS)

Vesselinov, V. V.; Harp, D.

2010-12-01

The process of decision making to protect groundwater resources requires a detailed estimation of uncertainties in model predictions. Various uncertainties associated with modeling a natural system, such as: (1) measurement and computational errors; (2) uncertainties in the conceptual model and model-parameter estimates; (3) simplifications in model setup and numerical representation of governing processes, contribute to the uncertainties in the model predictions. Due to this combination of factors, the sources of predictive uncertainties are generally difficult to quantify individually. Decision support related to optimal design of monitoring networks requires (1) detailed analyses of existing uncertainties related to model predictions of groundwater flow and contaminant transport, (2) optimization of the proposed monitoring network locations in terms of their efficiency to detect contaminants and provide early warning. We apply existing and newly-proposed methods to quantify predictive uncertainties and to optimize well locations. An important aspect of the analysis is the application of newly-developed optimization technique based on coupling of Particle Swarm and Levenberg-Marquardt optimization methods which proved to be robust and computationally efficient. These techniques and algorithms are bundled in a software package called MADS. MADS (Model Analyses for Decision Support) is an object-oriented code that is capable of performing various types of model analyses and supporting model-based decision making. The code can be executed under different computational modes, which include (1) sensitivity analyses (global and local), (2) Monte Carlo analysis, (3) model calibration, (4) parameter estimation, (5) uncertainty quantification, and (6) model selection. The code can be externally coupled with any existing model simulator through integrated modules that read/write input and output files using a set of template and instruction files (consistent with the PEST I/O protocol). MADS can also be internally coupled with a series of built-in analytical simulators. MADS provides functionality to work directly with existing control files developed for the code PEST (Doherty 2009). To perform the computational modes mentioned above, the code utilizes (1) advanced Latin-Hypercube sampling techniques (including Improved Distributed Sampling), (2) various gradient-based Levenberg-Marquardt optimization methods, (3) advanced global optimization methods (including Particle Swarm Optimization), and (4) a selection of alternative objective functions. The code has been successfully applied to perform various model analyses related to environmental management of real contamination sites. Examples include source identification problems, quantification of uncertainty, model calibration, and optimization of monitoring networks. The methodology and software codes are demonstrated using synthetic and real case studies where monitoring networks are optimized taking into account the uncertainty in model predictions of contaminant transport.

Integrated systems optimization model for biofuel development: The influence of environmental constraints

NASA Astrophysics Data System (ADS)

Housh, M.; Ng, T.; Cai, X.

2012-12-01

The environmental impact is one of the major concerns of biofuel development. While many other studies have examined the impact of biofuel expansion on stream flow and water quality, this study examines the problem from the other side - will and how a biofuel production target be affected by given environmental constraints. For this purpose, an integrated model comprises of different sub-systems of biofuel refineries, transportation, agriculture, water resources and crops/ethanol market has been developed. The sub-systems are integrated into one large-scale model to guide the optimal development plan considering the interdependency between the subsystems. The optimal development plan includes biofuel refineries location and capacity, refinery operation, land allocation between biofuel and food crops, and the corresponding stream flow and nitrate load in the watershed. The watershed is modeled as a network flow, in which the nodes represent sub-watersheds and the arcs are defined as the linkage between the sub-watersheds. The runoff contribution of each sub-watershed is determined based on the land cover and the water uses in that sub-watershed. Thus, decisions of other sub-systems such as the land allocation in the land use sub-system and the water use in the refinery sub-system define the sources and the sinks of the network. Environmental policies will be addressed in the integrated model by imposing stream flow and nitrate load constraints. These constraints can be specified by location and time in the watershed to reflect the spatial and temporal variation of the regulations. Preliminary results show that imposing monthly water flow constraints and yearly nitrate load constraints will change the biofuel development plan dramatically. Sensitivity analysis is performed to examine how the environmental constraints and their spatial and the temporal distribution influence the overall biofuel development plan and the performance of each of the sub-systems. Additional scenarios are analyzed to show the synergies of crop pattern choice (first versus second generation of biofuel crops), refinery technology adaptation (particularly on water use), refinery plant distribution, and economic incentives in terms of balanced environmental protection and bioenergy development objectives.

Feedback-Based Projected-Gradient Method for Real-Time Optimization of Aggregations of Energy Resources

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

Dall-Anese, Emiliano; Bernstein, Andrey; Simonetto, Andrea

This paper develops an online optimization method to maximize operational objectives of distribution-level distributed energy resources (DERs), while adjusting the aggregate power generated (or consumed) in response to services requested by grid operators. The design of the online algorithm is based on a projected-gradient method, suitably modified to accommodate appropriate measurements from the distribution network and the DERs. By virtue of this approach, the resultant algorithm can cope with inaccuracies in the representation of the AC power flows, it avoids pervasive metering to gather the state of noncontrollable resources, and it naturally lends itself to a distributed implementation. Optimality claimsmore » are established in terms of tracking of the solution of a well-posed time-varying convex optimization problem.« less

A Risk-Based Multi-Objective Optimization Concept for Early-Warning Monitoring Networks

NASA Astrophysics Data System (ADS)

Bode, F.; Loschko, M.; Nowak, W.

2014-12-01

Groundwater is a resource for drinking water and hence needs to be protected from contaminations. However, many well catchments include an inventory of known and unknown risk sources which cannot be eliminated, especially in urban regions. As matter of risk control, all these risk sources should be monitored. A one-to-one monitoring situation for each risk source would lead to a cost explosion and is even impossible for unknown risk sources. However, smart optimization concepts could help to find promising low-cost monitoring network designs.In this work we develop a concept to plan monitoring networks using multi-objective optimization. Our considered objectives are to maximize the probability of detecting all contaminations and the early warning time and to minimize the installation and operating costs of the monitoring network. A qualitative risk ranking is used to prioritize the known risk sources for monitoring. The unknown risk sources can neither be located nor ranked. Instead, we represent them by a virtual line of risk sources surrounding the production well.We classify risk sources into four different categories: severe, medium and tolerable for known risk sources and an extra category for the unknown ones. With that, early warning time and detection probability become individual objectives for each risk class. Thus, decision makers can identify monitoring networks which are valid for controlling the top risk sources, and evaluate the capabilities (or search for least-cost upgrade) to also cover moderate, tolerable and unknown risk sources. Monitoring networks which are valid for the remaining risk also cover all other risk sources but the early-warning time suffers.The data provided for the optimization algorithm are calculated in a preprocessing step by a flow and transport model. Uncertainties due to hydro(geo)logical phenomena are taken into account by Monte-Carlo simulations. To avoid numerical dispersion during the transport simulations we use the particle-tracking random walk method.

Optimization design of urban expressway ramp control

NASA Astrophysics Data System (ADS)

Xu, Hongke; Li, Peiqi; Zheng, Jinnan; Sun, Xiuzhen; Lin, Shan

2017-05-01

In this paper, various types of expressway systems are analyzed, and a variety of signal combinations are proposed to mitigate traffic congestion. And various signal combinations are used to verify the effectiveness of the multi-signal combinatorial control strategy. The simulation software VISSIM was used to simulate the system. Based on the network model of 25 kinds of road length combinations and the simulation results, an optimization scheme suitable for the practical road model is summarized. The simulation results show that the controller can reduce the travel time by 25% under the large traffic flow and improve the road capacity by about 20%.

Optimal investments in digital communication systems in primary exchange area

NASA Astrophysics Data System (ADS)

Garcia, R.; Hornung, R.

1980-11-01

Integer linear optimization theory, following Gomory's method, was applied to the model planning of telecommunication networks in which all future investments are made in digital systems only. The integer decision variables are the number of digital systems set up on cable or radiorelay links that can be installed. The objective function is the total cost of the extension of the existing line capacity to meet the demand between primary and local exchanges. Traffic volume constraints and flow conservation in transit nodes complete the model. Results indicating computing time and method efficiency are illustrated by an example.

Efficient Quantum Transmission in Multiple-Source Networks

PubMed Central

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

2014-01-01

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

Flume Computer-Aided Design (CAD): Integrated CAD for Microflume Components and Systems

DTIC Science & Technology

2002-04-01

31 3.3: Matching the Mix Ratio (Part B...sizes) will be optimized based on the required flow rates and mixing ratios of the different species. The influence of etch depth is investigated on a...Inhibition Study In this network, the target protein is mixed with protease (i.e. enzyme that cleaves the target protein) and the protease inhibitor (the

Intercluster Connection in Cognitive Wireless Mesh Networks Based on Intelligent Network Coding

NASA Astrophysics Data System (ADS)

Chen, Xianfu; Zhao, Zhifeng; Jiang, Tao; Grace, David; Zhang, Honggang

2009-12-01

Cognitive wireless mesh networks have great flexibility to improve spectrum resource utilization, within which secondary users (SUs) can opportunistically access the authorized frequency bands while being complying with the interference constraint as well as the QoS (Quality-of-Service) requirement of primary users (PUs). In this paper, we consider intercluster connection between the neighboring clusters under the framework of cognitive wireless mesh networks. Corresponding to the collocated clusters, data flow which includes the exchanging of control channel messages usually needs four time slots in traditional relaying schemes since all involved nodes operate in half-duplex mode, resulting in significant bandwidth efficiency loss. The situation is even worse at the gateway node connecting the two colocated clusters. A novel scheme based on network coding is proposed in this paper, which needs only two time slots to exchange the same amount of information mentioned above. Our simulation shows that the network coding-based intercluster connection has the advantage of higher bandwidth efficiency compared with the traditional strategy. Furthermore, how to choose an optimal relaying transmission power level at the gateway node in an environment of coexisting primary and secondary users is discussed. We present intelligent approaches based on reinforcement learning to solve the problem. Theoretical analysis and simulation results both show that the intelligent approaches can achieve optimal throughput for the intercluster relaying in the long run.

The Value Estimation of an HFGW Frequency Time Standard for Telecommunications Network Optimization

NASA Astrophysics Data System (ADS)

Harper, Colby; Stephenson, Gary

2007-01-01

The emerging technology of gravitational wave control is used to augment a communication system using a development roadmap suggested in Stephenson (2003) for applications emphasized in Baker (2005). In the present paper consideration is given to the value of a High Frequency Gravitational Wave (HFGW) channel purely as providing a method of frequency and time reference distribution for use within conventional Radio Frequency (RF) telecommunications networks. Specifically, the native value of conventional telecommunications networks may be optimized by using an unperturbed frequency time standard (FTS) to (1) improve terminal navigation and Doppler estimation performance via improved time difference of arrival (TDOA) from a universal time reference, and (2) improve acquisition speed, coding efficiency, and dynamic bandwidth efficiency through the use of a universal frequency reference. A model utilizing a discounted cash flow technique provides an estimation of the additional value using HFGW FTS technology could bring to a mixed technology HFGW/RF network. By applying a simple net present value analysis with supporting reference valuations to such a network, it is demonstrated that an HFGW FTS could create a sizable improvement within an otherwise conventional RF telecommunications network. Our conservative model establishes a low-side value estimate of approximately 50B USD Net Present Value for an HFGW FTS service, with reasonable potential high-side values to significant multiples of this low-side value floor.

The General-Use Nodal Network Solver (GUNNS) Modeling Package for Space Vehicle Flow System Simulation

NASA Technical Reports Server (NTRS)

Harvey, Jason; Moore, Michael

2013-01-01

The General-Use Nodal Network Solver (GUNNS) is a modeling software package that combines nodal analysis and the hydraulic-electric analogy to simulate fluid, electrical, and thermal flow systems. GUNNS is developed by L-3 Communications under the TS21 (Training Systems for the 21st Century) project for NASA Johnson Space Center (JSC), primarily for use in space vehicle training simulators at JSC. It has sufficient compactness and fidelity to model the fluid, electrical, and thermal aspects of space vehicles in real-time simulations running on commodity workstations, for vehicle crew and flight controller training. It has a reusable and flexible component and system design, and a Graphical User Interface (GUI), providing capability for rapid GUI-based simulator development, ease of maintenance, and associated cost savings. GUNNS is optimized for NASA's Trick simulation environment, but can be run independently of Trick.

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.

A Parallel Multigrid Solver for Viscous Flows on Anisotropic Structured Grids

NASA Technical Reports Server (NTRS)

Prieto, Manuel; Montero, Ruben S.; Llorente, Ignacio M.; Bushnell, Dennis M. (Technical Monitor)

2001-01-01

This paper presents an efficient parallel multigrid solver for speeding up the computation of a 3-D model that treats the flow of a viscous fluid over a flat plate. The main interest of this simulation lies in exhibiting some basic difficulties that prevent optimal multigrid efficiencies from being achieved. As the computing platform, we have used Coral, a Beowulf-class system based on Intel Pentium processors and equipped with GigaNet cLAN and switched Fast Ethernet networks. Our study not only examines the scalability of the solver but also includes a performance evaluation of Coral where the investigated solver has been used to compare several of its design choices, namely, the interconnection network (GigaNet versus switched Fast-Ethernet) and the node configuration (dual nodes versus single nodes). As a reference, the performance results have been compared with those obtained with the NAS-MG benchmark.

Influence of TCSC Devices on Congestion Management in a Deregulated Power System Using Evolutionary Programming Technique

NASA Astrophysics Data System (ADS)

Ananthichristy, A., Dr.; Elanthirayan, R.; Brindha, R., Dr.; Siddhiq, M. S.; Venkatesh, N.; Harshit, M. V.; Nikhilreddy, M.

2018-04-01

Congestion management is one of the technical challenges in power system deregulation. In deregulated electricity market it may always not be possible to dispatch all of the contracted power transactions due to congestion of the transmission corridors. Transmission congestion occurs when there is insufficient transmission capacity to simultaneously accommodate all constraints for transmission of a line. Flexible Alternative Current Transmission System (FACTS) devices can be an alternative to reduce the flows in the heavily loaded lines, resulting in an increased loadability, low system loss, improved stability of the network, reduced cost of production and fulfilled contractual requirement by controlling the power flow in the network. A method to determine the optimal location of FACTS has been suggested based on reduction of total system VAR power losses. The simulation was done on IEEE 14 bus system and results were obtained.

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

NASA Technical Reports Server (NTRS)

Hopkins, Dale A.

1998-01-01

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

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

PubMed

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

2015-02-21

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

Research on Flow Field Perception Based on Artificial Lateral Line Sensor System

PubMed Central

Wang, Anyi; Wang, Shirui; Yang, Tingting

2018-01-01

In nature, the lateral line of fish is a peculiar and important organ for sensing the surrounding hydrodynamic environment, preying, escaping from predators and schooling. In this paper, by imitating the mechanism of fish lateral canal neuromasts, we developed an artificial lateral line system composed of micro-pressure sensors. Through hydrodynamic simulations, an optimized sensor structure was obtained and the pressure distribution models of the lateral surface were established in uniform flow and turbulent flow. Carrying out the corresponding underwater experiment, the validity of the numerical simulation method is verified by the comparison between the experimental data and the simulation results. In addition, a variety of effective research methods are proposed and validated for the flow velocity estimation and attitude perception in turbulent flow, respectively and the shape recognition of obstacles is realized by the neural network algorithm. PMID:29534499

A Dynamic Resilience Approach for WDM Optical Networks

NASA Astrophysics Data System (ADS)

Garg, Amit Kumar

2017-12-01

Optical fibres have been developed as a transmission medium to carry traffic in order to provide various services in telecommunications platform. Failure of this fibre caused loss of data which can interrupt communication services. This paper has been focused only on survivable schemes in order to guarantee both protection and restoration in WDM optical networks. In this paper, a dynamic resilience approach has been proposed whose objective is to route the flows in a way which minimizes the total amount of bandwidth used for working and protection paths. In the proposed approach, path-based protection is utilized because it yields lower overhead and is also suitable for global optimization where, in case of a single link failure, all the flows utilizing the failed link are re-routed to a pre-computed set of paths. The simulation results demonstrate that proposed approach is much more efficient as it provides better quality of services (QoS) in terms of network resource utilization, blocking probability etc. as compared to conventional protection and restoration schemes. The proposed approach seems to offer an attractive combination of features, with both ring like speed and mesh-like efficiency.

How to Decide? Multi-Objective Early-Warning Monitoring Networks for Water Suppliers

NASA Astrophysics Data System (ADS)

Bode, Felix; Loschko, Matthias; Nowak, Wolfgang

2015-04-01

Groundwater is a resource for drinking water and hence needs to be protected from contaminations. However, many well catchments include an inventory of known and unknown risk sources, which cannot be eliminated, especially in urban regions. As a matter of risk control, all these risk sources should be monitored. A one-to-one monitoring situation for each risk source would lead to a cost explosion and is even impossible for unknown risk sources. However, smart optimization concepts could help to find promising low-cost monitoring network designs. In this work we develop a concept to plan monitoring networks using multi-objective optimization. Our considered objectives are to maximize the probability of detecting all contaminations, to enhance the early warning time before detected contaminations reach the drinking water well, and to minimize the installation and operating costs of the monitoring network. Using multi-objectives optimization, we avoid the problem of having to weight these objectives to a single objective-function. These objectives are clearly competing, and it is impossible to know their mutual trade-offs beforehand - each catchment differs in many points and it is hardly possible to transfer knowledge between geological formations and risk inventories. To make our optimization results more specific to the type of risk inventory in different catchments we do risk prioritization of all known risk sources. Due to the lack of the required data, quantitative risk ranking is impossible. Instead, we use a qualitative risk ranking to prioritize the known risk sources for monitoring. Additionally, we allow for the existence of unknown risk sources that are totally uncertain in location and in their inherent risk. Therefore, they can neither be located nor ranked. Instead, we represent them by a virtual line of risk sources surrounding the production well. We classify risk sources into four different categories: severe, medium and tolerable for known risk sources and an extra category for the unknown ones. With that, early warning time and detection probability become individual objectives for each risk class. Thus, decision makers can identify monitoring networks valid for controlling the top risk sources, and evaluate the capabilities (or search for least-cost upgrades) to also cover moderate, tolerable and unknown risk sources. Monitoring networks, which are valid for the remaining risk also cover all other risk sources, but only with a relatively poor early-warning time. The data provided for the optimization algorithm are calculated in a preprocessing step by a flow and transport model. It simulates, which potential contaminant plumes from the risk sources would be detectable where and when by all possible candidate positions for monitoring wells. Uncertainties due to hydro(geo)logical phenomena are taken into account by Monte-Carlo simulations. These include uncertainty in ambient flow direction of the groundwater, uncertainty of the conductivity field, and different scenarios for the pumping rates of the production wells. To avoid numerical dispersion during the transport simulations, we use particle-tracking random walk methods when simulating transport.

Fuel efficient traffic signal operation and evaluation: Garden Grove Demonstration Project

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

Not Available

1983-02-01

The procedures and results of a case study of fuel efficient traffic signal operation and evaluation in the City of Garden Grove, California are documented. Improved traffic signal timing was developed for a 70-intersection test network in Garden Grove using an optimization tool called the TRANSYT Version 8 computer program. Full-scale field testing of five alternative timing plans was conducted using two instrumented vehicles equipped to measure traffic performance characteristics and fuel consumption. The field tests indicated that significant improvements in traffic flow and fuel consumption result from the use of timing plans generated by the TRANSYT optimization model. Changingmore » from pre-existing to an optimized timing plan yields a networkwide 5 percent reduction in total travel time, more than 10 percent reduction in both the number of stops and stopped delay time, and 6 percent reduction in fuel consumption. Projections are made of the benefits and costs of implementing such a program at the 20,000 traffic signals in networks throughout the State of California.« less

The locus coeruleus-norepinephrine network optimizes coupling of cerebral blood volume with oxygen demand.

PubMed

Bekar, Lane K; Wei, Helen S; Nedergaard, Maiken

2012-12-01

Given the brain's uniquely high cell density and tissue oxygen levels bordering on hypoxia, the ability to rapidly and precisely match blood flow to constantly changing patterns in neural activity is an essential feature of cerebrovascular regulation. Locus coeruleus-norepinephrine (LC-NE) projections innervate the cerebral vasculature and can mediate vasoconstriction. However, function of the LC-mediated constriction in blood-flow regulation has never been addressed. Here, using intrinsic optical imaging coupled with an anesthesia regimen that only minimally interferes with LC activity, we show that NE enhances spatial and temporal aspects of functional hyperemia in the mouse somatosensory cortex. Increasing NE levels in the cortex using an α(2)-adrenergic receptor antagonist paradoxically reduces the extent of functional hyperemia while enhancing the surround blood-flow reduction. However, the NE-mediated vasoconstriction optimizes spatial and temporal focusing of the hyperemic response resulting in a sixfold decrease in the disparity between blood volume and oxygen demand. In addition, NE-mediated vasoconstriction accelerated redistribution to subsequently active regions, enhancing temporal synchronization of blood delivery. These observations show an important role for NE in optimizing neurovascular coupling. As LC neuron loss is prominent in Alzheimer and Parkinson diseases, the diminished ability to couple blood volume to oxygen demand may contribute to their pathogenesis.

Steam distribution and energy delivery optimization using wireless sensors

NASA Astrophysics Data System (ADS)

Olama, Mohammed M.; Allgood, Glenn O.; Kuruganti, Teja P.; Sukumar, Sreenivas R.; Djouadi, Seddik M.; Lake, Joe E.

2011-05-01

The Extreme Measurement Communications Center at Oak Ridge National Laboratory (ORNL) explores the deployment of a wireless sensor system with a real-time measurement-based energy efficiency optimization framework in the ORNL campus. With particular focus on the 12-mile long steam distribution network in our campus, we propose an integrated system-level approach to optimize the energy delivery within the steam distribution system. We address the goal of achieving significant energy-saving in steam lines by monitoring and acting on leaking steam valves/traps. Our approach leverages an integrated wireless sensor and real-time monitoring capabilities. We make assessments on the real-time status of the distribution system by mounting acoustic sensors on the steam pipes/traps/valves and observe the state measurements of these sensors. Our assessments are based on analysis of the wireless sensor measurements. We describe Fourier-spectrum based algorithms that interpret acoustic vibration sensor data to characterize flows and classify the steam system status. We are able to present the sensor readings, steam flow, steam trap status and the assessed alerts as an interactive overlay within a web-based Google Earth geographic platform that enables decision makers to take remedial action. We believe our demonstration serves as an instantiation of a platform that extends implementation to include newer modalities to manage water flow, sewage and energy consumption.

Understanding Hydraulic Fracturing: A Multi-Scale Problem

DOE PAGES

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

2016-09-05

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

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

NASA Astrophysics Data System (ADS)

Tokarev, V. V.

2018-06-01

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

Predictive modelling-based design and experiments for synthesis and spinning of bioinspired silk fibres

PubMed Central

Gronau, Greta; Jacobsen, Matthew M.; Huang, Wenwen; Rizzo, Daniel J.; Li, David; Staii, Cristian; Pugno, Nicola M.; Wong, Joyce Y.; Kaplan, David L.; Buehler, Markus J.

2016-01-01

Scalable computational modelling tools are required to guide the rational design of complex hierarchical materials with predictable functions. Here, we utilize mesoscopic modelling, integrated with genetic block copolymer synthesis and bioinspired spinning process, to demonstrate de novo materials design that incorporates chemistry, processing and material characterization. We find that intermediate hydrophobic/hydrophilic block ratios observed in natural spider silks and longer chain lengths lead to outstanding silk fibre formation. This design by nature is based on the optimal combination of protein solubility, self-assembled aggregate size and polymer network topology. The original homogeneous network structure becomes heterogeneous after spinning, enhancing the anisotropic network connectivity along the shear flow direction. Extending beyond the classical polymer theory, with insights from the percolation network model, we illustrate the direct proportionality between network conductance and fibre Young's modulus. This integrated approach provides a general path towards de novo functional network materials with enhanced mechanical properties and beyond (optical, electrical or thermal) as we have experimentally verified. PMID:26017575

Predictive modelling-based design and experiments for synthesis and spinning of bioinspired silk fibres.

PubMed

Lin, Shangchao; Ryu, Seunghwa; Tokareva, Olena; Gronau, Greta; Jacobsen, Matthew M; Huang, Wenwen; Rizzo, Daniel J; Li, David; Staii, Cristian; Pugno, Nicola M; Wong, Joyce Y; Kaplan, David L; Buehler, Markus J

2015-05-28

Scalable computational modelling tools are required to guide the rational design of complex hierarchical materials with predictable functions. Here, we utilize mesoscopic modelling, integrated with genetic block copolymer synthesis and bioinspired spinning process, to demonstrate de novo materials design that incorporates chemistry, processing and material characterization. We find that intermediate hydrophobic/hydrophilic block ratios observed in natural spider silks and longer chain lengths lead to outstanding silk fibre formation. This design by nature is based on the optimal combination of protein solubility, self-assembled aggregate size and polymer network topology. The original homogeneous network structure becomes heterogeneous after spinning, enhancing the anisotropic network connectivity along the shear flow direction. Extending beyond the classical polymer theory, with insights from the percolation network model, we illustrate the direct proportionality between network conductance and fibre Young's modulus. This integrated approach provides a general path towards de novo functional network materials with enhanced mechanical properties and beyond (optical, electrical or thermal) as we have experimentally verified.

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.

Landscape Genetics for the Empirical Assessment of Resistance Surfaces: The European Pine Marten (Martes martes) as a Target-Species of a Regional Ecological Network

PubMed Central

Ruiz-González, Aritz; Gurrutxaga, Mikel; Cushman, Samuel A.; Madeira, María José; Randi, Ettore; Gómez-Moliner, Benjamin J.

2014-01-01

Coherent ecological networks (EN) composed of core areas linked by ecological corridors are being developed worldwide with the goal of promoting landscape connectivity and biodiversity conservation. However, empirical assessment of the performance of EN designs is critical to evaluate the utility of these networks to mitigate effects of habitat loss and fragmentation. Landscape genetics provides a particularly valuable framework to address the question of functional connectivity by providing a direct means to investigate the effects of landscape structure on gene flow. The goals of this study are (1) to evaluate the landscape features that drive gene flow of an EN target species (European pine marten), and (2) evaluate the optimality of a regional EN design in providing connectivity for this species within the Basque Country (North Spain). Using partial Mantel tests in a reciprocal causal modeling framework we competed 59 alternative models, including isolation by distance and the regional EN. Our analysis indicated that the regional EN was among the most supported resistance models for the pine marten, but was not the best supported model. Gene flow of pine marten in northern Spain is facilitated by natural vegetation, and is resisted by anthropogenic landcover types and roads. Our results suggest that the regional EN design being implemented in the Basque Country will effectively facilitate gene flow of forest dwelling species at regional scale. PMID:25329047

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

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.

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

Optimization of radioactive sources to achieve the highest precision in three-phase flow meters using Jaya algorithm.

PubMed

Roshani, G H; Karami, A; Khazaei, A; Olfateh, A; Nazemi, E; Omidi, M

2018-05-17

Gamma ray source has very important role in precision of multi-phase flow metering. In this study, different combination of gamma ray sources (( 133 Ba- 137 Cs), ( 133 Ba- 60 Co), ( 241 Am- 137 Cs), ( 241 Am- 60 Co), ( 133 Ba- 241 Am) and ( 60 Co- 137 Cs)) were investigated in order to optimize the three-phase flow meter. Three phases were water, oil and gas and the regime was considered annular. The required data was numerically generated using MCNP-X code which is a Monte-Carlo code. Indeed, the present study devotes to forecast the volume fractions in the annular three-phase flow, based on a multi energy metering system including various radiation sources and also one NaI detector, using a hybrid model of artificial neural network and Jaya Optimization algorithm. Since the summation of volume fractions is constant, a constraint modeling problem exists, meaning that the hybrid model must forecast only two volume fractions. Six hybrid models associated with the number of used radiation sources are designed. The models are employed to forecast the gas and water volume fractions. The next step is to train the hybrid models based on numerically obtained data. The results show that, the best forecast results are obtained for the gas and water volume fractions of the system including the ( 241 Am- 137 Cs) as the radiation source. Copyright © 2018 Elsevier Ltd. All rights reserved.

An application of different dioids in public key cryptography

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

Durcheva, Mariana I., E-mail: mdurcheva66@gmail.com

2014-11-18

Dioids provide a natural framework for analyzing a broad class of discrete event dynamical systems such as the design and analysis of bus and railway timetables, scheduling of high-throughput industrial processes, solution of combinatorial optimization problems, the analysis and improvement of flow systems in communication networks. They have appeared in several branches of mathematics such as functional analysis, optimization, stochastic systems and dynamic programming, tropical geometry, fuzzy logic. In this paper we show how to involve dioids in public key cryptography. The main goal is to create key – exchange protocols based on dioids. Additionally the digital signature scheme ismore » presented.« less

Global Design Optimization for Fluid Machinery Applications

NASA Technical Reports Server (NTRS)

Shyy, Wei; Papila, Nilay; Tucker, Kevin; Vaidyanathan, Raj; Griffin, Lisa

2000-01-01

Recent experiences in utilizing the global optimization methodology, based on polynomial and neural network techniques for fluid machinery design are summarized. Global optimization methods can utilize the information collected from various sources and by different tools. These methods offer multi-criterion optimization, handle the existence of multiple design points and trade-offs via insight into the entire design space can easily perform tasks in parallel, and are often effective in filtering the noise intrinsic to numerical and experimental data. Another advantage is that these methods do not need to calculate the sensitivity of each design variable locally. However, a successful application of the global optimization method needs to address issues related to data requirements with an increase in the number of design variables and methods for predicting the model performance. Examples of applications selected from rocket propulsion components including a supersonic turbine and an injector element and a turbulent flow diffuser are used to illustrate the usefulness of the global optimization method.

Creating a water depth map from Earth Observation-derived flood extent and topography data

NASA Astrophysics Data System (ADS)

Matgen, Patrick; Giustarini, Laura; Chini, Marco; Hostache, Renaud; Pelich, Ramona; Schlaffer, Stefan

2017-04-01

Enhanced methods for monitoring temporal and spatial variations of water depth in rivers and floodplains are very important in operational water management. Currently, variations of water elevation can be estimated indirectly at the land-water interface using sequences of satellite EO imagery in combination with topographic data. In recent years high-resolution digital elevation models (DEM) and satellite EO data have become more readily available at global scale. This study introduces an approach for efficiently converting remote sensing-derived flood extent maps into water depth maps using a floodplain's topography information. For this we make the assumption of uniform flow, that is the depth of flow with respect to the drainage network is considered to be the same at every section of the floodplain. In other words, the depth of water above the nearest drainage is expected to be constant for a given river reach. To determine this value we first need the Height Above Nearest Drainage (HAND) raster obtained by using the area of interest's DEM as source topography and a shapefile of the river network. The HAND model normalizes the topography with respect to the drainage network. Next, the HAND raster is thresholded in order to generate a binary mask that optimally fits, over the entire region of study, the flood extent map obtained from SAR or any other remote sensing product, including aerial photographs. The optimal threshold value corresponds to the height of the water line above the nearest drainage, termed HANDWATER, and is considered constant for a given subreach. Once the HANDWATER has been optimized, a water depth map can be generated by subtracting the value of the HAND raster at the each location from this parameter value. These developments enable large scale and near real-time applications and only require readily available EO data, a DEM and the river network as input data. The approach is based on a hierarchical split-based approach that subdivides a drainage network into segments of variable length with evidence of uniform flow. The method has been tested with remote sensing data and DEM data that differ in terms of spatial resolution and accuracy. A comprehensive evaluation of the obtained water depth maps with hydrodynamic modelling results and in situ measured water level recordings was carried out on a reach of the river Severn located in the United Kingdom. First results show that the obtained root mean squared difference is 10 cm when using high resolution high precision data sets (i.e. aerial photographs of flood extent and a LiDAR-derived DEM) and amount to 50 cm when using as inputs moderate resolution SAR imagery from ENVISAT and a SRTM-derived DEM.

A Fault Tolerance Mechanism for On-Road Sensor Networks

PubMed Central

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

2016-01-01

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

Situational Awareness of Network System Roles (SANSR)

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

Huffer, Kelly M; Reed, Joel W

In a large enterprise it is difficult for cyber security analysts to know what services and roles every machine on the network is performing (e.g., file server, domain name server, email server). Using network flow data, already collected by most enterprises, we developed a proof-of-concept tool that discovers the roles of a system using both clustering and categorization techniques. The tool's role information would allow cyber analysts to detect consequential changes in the network, initiate incident response plans, and optimize their security posture. The results of this proof-of-concept tool proved to be quite accurate on three real data sets. Wemore » will present the algorithms used in the tool, describe the results of preliminary testing, provide visualizations of the results, and discuss areas for future work. Without this kind of situational awareness, cyber analysts cannot quickly diagnose an attack or prioritize remedial actions.« less

Dynamic Network Model for Smart City Data-Loss Resilience Case Study: City-to-City Network for Crime Analytics

PubMed Central

Kotevska, Olivera; Kusne, A. Gilad; Samarov, Daniel V.; Lbath, Ahmed; Battou, Abdella

2017-01-01

Today’s cities generate tremendous amounts of data, thanks to a boom in affordable smart devices and sensors. The resulting big data creates opportunities to develop diverse sets of context-aware services and systems, ensuring smart city services are optimized to the dynamic city environment. Critical resources in these smart cities will be more rapidly deployed to regions in need, and those regions predicted to have an imminent or prospective need. For example, crime data analytics may be used to optimize the distribution of police, medical, and emergency services. However, as smart city services become dependent on data, they also become susceptible to disruptions in data streams, such as data loss due to signal quality reduction or due to power loss during data collection. This paper presents a dynamic network model for improving service resilience to data loss. The network model identifies statistically significant shared temporal trends across multivariate spatiotemporal data streams and utilizes these trends to improve data prediction performance in the case of data loss. Dynamics also allow the system to respond to changes in the data streams such as the loss or addition of new information flows. The network model is demonstrated by city-based crime rates reported in Montgomery County, MD, USA. A resilient network is developed utilizing shared temporal trends between cities to provide improved crime rate prediction and robustness to data loss, compared with the use of single city-based auto-regression. A maximum improvement in performance of 7.8% for Silver Spring is found and an average improvement of 5.6% among cities with high crime rates. The model also correctly identifies all the optimal network connections, according to prediction error minimization. City-to-city distance is designated as a predictor of shared temporal trends in crime and weather is shown to be a strong predictor of crime in Montgomery County. PMID:29250476

Dynamic Network Model for Smart City Data-Loss Resilience Case Study: City-to-City Network for Crime Analytics.

PubMed

Kotevska, Olivera; Kusne, A Gilad; Samarov, Daniel V; Lbath, Ahmed; Battou, Abdella

2017-01-01

Today's cities generate tremendous amounts of data, thanks to a boom in affordable smart devices and sensors. The resulting big data creates opportunities to develop diverse sets of context-aware services and systems, ensuring smart city services are optimized to the dynamic city environment. Critical resources in these smart cities will be more rapidly deployed to regions in need, and those regions predicted to have an imminent or prospective need. For example, crime data analytics may be used to optimize the distribution of police, medical, and emergency services. However, as smart city services become dependent on data, they also become susceptible to disruptions in data streams, such as data loss due to signal quality reduction or due to power loss during data collection. This paper presents a dynamic network model for improving service resilience to data loss. The network model identifies statistically significant shared temporal trends across multivariate spatiotemporal data streams and utilizes these trends to improve data prediction performance in the case of data loss. Dynamics also allow the system to respond to changes in the data streams such as the loss or addition of new information flows. The network model is demonstrated by city-based crime rates reported in Montgomery County, MD, USA. A resilient network is developed utilizing shared temporal trends between cities to provide improved crime rate prediction and robustness to data loss, compared with the use of single city-based auto-regression. A maximum improvement in performance of 7.8% for Silver Spring is found and an average improvement of 5.6% among cities with high crime rates. The model also correctly identifies all the optimal network connections, according to prediction error minimization. City-to-city distance is designated as a predictor of shared temporal trends in crime and weather is shown to be a strong predictor of crime in Montgomery County.

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

NASA Astrophysics Data System (ADS)

Nœtinger, B.

2015-02-01

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

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.

Campaign-level dynamic network modelling for spaceflight logistics for the flexible path concept

NASA Astrophysics Data System (ADS)

Ho, Koki; de Weck, Olivier L.; Hoffman, Jeffrey A.; Shishko, Robert

2016-06-01

This paper develops a network optimization formulation for dynamic campaign-level space mission planning. Although many past space missions have been designed mainly from a mission-level perspective, a campaign-level perspective will be important for future space exploration. In order to find the optimal campaign-level space transportation architecture, a mixed-integer linear programming (MILP) formulation with a generalized multi-commodity flow and a time-expanded network is developed. Particularly, a new heuristics-based method, a partially static time-expanded network, is developed to provide a solution quickly. The developed method is applied to a case study containing human exploration of a near-Earth object (NEO) and Mars, related to the concept of the Flexible Path. The numerical results show that using the specific combinations of propulsion technologies, in-situ resource utilization (ISRU), and other space infrastructure elements can reduce the initial mass in low-Earth orbit (IMLEO) significantly. In addition, the case study results also show that we can achieve large IMLEO reduction by designing NEO and Mars missions together as a campaign compared with designing them separately owing to their common space infrastructure pre-deployment. This research will be an important step toward efficient and flexible campaign-level space mission planning.

Flow Interactions of Two- and Three-Dimensional Networked Bio-Inspired Control Elements in an In-Line Arrangement.

PubMed

Kurt, Melike; Moored, Keith

2018-04-19

We present experiments that examine the modes of interaction, the collective performance and the role of three-dimensionality in two pitching propulsors in an in-line arrangement. Both two-dimensional foils and three-dimensional rectangular wings of $AR = 2$ are examined. \\kwm{In contrast to previous work, two interaction modes distinguished as the coherent and branched wake modes are not observed to be directly linked to the propulsive efficiency, although they are linked to peak thrust performance and minimum power consumption as previously described \\cite[]{boschitsch2014propulsive}.} \\kwm{In fact, in closely-spaced propulsors peak propulsive efficiency of the follower occurs near its minimum power and this condition \\kwm{ reveals a} branched wake mode. Alternatively, for propulsors spaced far apart peak propulsive efficiency of the follower occurs near its peak thrust and this condition \\kwm{reveals a} coherent wake mode.} By examining the collective performance, it is discovered that there is an optimal spacing between the propulsors to maximize the collective efficiency. For two-dimensional foils the optimal spacing of $X^* = 0.75$ and the synchrony of $\\phi = 2\\pi /3$ leads to a collective efficiency and thrust enhancement of 50\\% and 32\\%, respectively, as compared to two isolated foils. In comparison, for $AR = 2$ wings the optimal spacing of $X^* = 0.25$ and the synchrony of $\\phi = 7\\pi /6$ leads to a collective efficiency and thrust enhancement of 30\\% and 22\\%, respectively. In addition, at the optimal conditions the collective lateral force coefficients in both the two- and three-dimensional cases are negligible, while operating off these conditions can lead to non-negligible lateral forces. Finally, the peak efficiency of the collective and the follower are shown to have opposite trends with increasing spacing in two- and three-dimensional flows. This is correlated to the breakdown of the impinging vortex on the follower wing in three-dimensions. These results can aid in the design of networked bio-inspired control elements that through integrated sensing can synchronize to three-dimensional flow interactions. © 2018 IOP Publishing Ltd.

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.

Age-dependent modulation of the somatosensory network upon eye closure.

PubMed

Brodoehl, Stefan; Klingner, Carsten; Witte, Otto W

2016-02-01

Eye closure even in complete darkness can improve somatosensory perception by switching the brain to a uni-sensory processing mode. This causes an increased information flow between the thalamus and the somatosensory cortex while decreasing modulation by the visual cortex. Previous work suggests that these modulations are age-dependent and that the benefit in somatosensory performance due to eye closing diminishes with age. The cause of this age-dependency and to what extent somatosensory processing is involved remains unclear. Therefore, we intended to characterize the underlying age-dependent modifications in the interaction and connectivity of different sensory networks caused by eye closure. We performed functional MR-imaging with tactile stimulation of the right hand under the conditions of opened and closed eyes in healthy young and elderly participants. Conditional Granger causality analysis was performed to assess the somatosensory and visual networks, including the thalamus. Independent of age, eye closure improved the information transfer from the thalamus to and within the somatosensory cortex. However, beyond that, we found an age-dependent recruitment strategy. Whereas young participants were characterized by an optimized information flow within the relays of the somatosensory network, elderly participants revealed a stronger modulatory influence of the visual network upon the somatosensory cortex. Our results demonstrate that the modulation of the somatosensory and visual networks by eye closure diminishes with age and that the dominance of the visual system is more pronounced in the aging brain. Copyright © 2015 Elsevier B.V. All rights reserved.

Optimal Regulation of Virtual Power Plants

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

Dall Anese, Emiliano; Guggilam, Swaroop S.; Simonetto, Andrea

This paper develops a real-time algorithmic framework for aggregations of distributed energy resources (DERs) in distribution networks to provide regulation services in response to transmission-level requests. Leveraging online primal-dual-type methods for time-varying optimization problems and suitable linearizations of the nonlinear AC power-flow equations, we believe this work establishes the system-theoretic foundation to realize the vision of distribution-level virtual power plants. The optimization framework controls the output powers of dispatchable DERs such that, in aggregate, they respond to automatic-generation-control and/or regulation-services commands. This is achieved while concurrently regulating voltages within the feeder and maximizing customers' and utility's performance objectives. Convergence andmore » tracking capabilities are analytically established under suitable modeling assumptions. Simulations are provided to validate the proposed approach.« less

Price of anarchy on heterogeneous traffic-flow networks.

PubMed

Rose, A; O'Dea, R; Hopcraft, K I

2016-09-01

The efficiency of routing traffic through a network, comprising nodes connected by links whose cost of traversal is either fixed or varies in proportion to volume of usage, can be measured by the "price of anarchy." This is the ratio of the cost incurred by agents who act to minimize their individual expenditure to the optimal cost borne by the entire system. As the total traffic load and the network variability-parameterized by the proportion of variable-cost links in the network-changes, the behaviors that the system presents can be understood with the introduction of a network of simpler structure. This is constructed from classes of nonoverlapping paths connecting source to destination nodes that are characterized by the number of variable-cost edges they contain. It is shown that localized peaks in the price of anarchy occur at critical traffic volumes at which it becomes beneficial to exploit ostensibly more expensive paths as the network becomes more congested. Simulation results verifying these findings are presented for the variation of the price of anarchy with the network's size, aspect ratio, variability, and traffic load.

Current-flow efficiency of networks

NASA Astrophysics Data System (ADS)

Liu, Kai; Yan, Xiaoyong

2018-02-01

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

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

PubMed

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

2018-01-01

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

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

PubMed Central

2018-01-01

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

A Dynamic Neural Network Approach to CBM

DTIC Science & Technology

2011-03-15

high efficiency water cooled heat exchanger positioned on the side of the engine. The air temperature was controlled at the desired set-point by...regulating the inlet water flow in the heat exchanger. The temperature of the cooling water was not regulated. The typical set-point for the air charge...temperature was 127 degF, as used in other durability tests carried out in these facilities. Because the heat exchanger controller was optimized for

Gaussian Random Fields Methods for Fork-Join Network with Synchronization Constraints

DTIC Science & Technology

2014-12-22

substantial efforts were dedicated to the study of the max-plus recursions [21, 3, 12]. More recently, Atar et al. [2] have studied a fork-join...feedback and NES, Atar et al. [2] show that a dynamic priority discipline achieves throughput optimal- ity asymptotically in the conventional heavy...2011) Patient flow in hospitals: a data-based queueing-science perspective. Submitted to Stochastic Systems, 20. [2] R. Atar , A. Mandelbaum and A

Mapping Flows onto Networks to Optimize Organizational Processes

DTIC Science & Technology

2005-01-01

And G . Porter, “Assessments of Simulated Performance of Alternative Architectures for Command and Control: The Role of Coordination”, Proceedings of...the 1999 Command & Control Research & Technology Symposium, NWC, Newport, RI, June 1999, pp. 123-143. [Iverson95] M. Iverson, F. Ozguner, G . Follen...Technology Symposium, NPS, Monterrey, CA, June, 2002. [Wu88] Min-You Wu, D. Gajski . “A Programming Aid for Hypercube Architectures.” The Journal of Supercomputing, 2(1988), pp. 349-372.

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

PubMed Central

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

2016-01-01

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

Simulation-Optimization Model for Seawater Intrusion Management at Pingtung Coastal Area, Taiwan

NASA Astrophysics Data System (ADS)

Huang, P. S.; Chiu, Y.

2015-12-01

In 1970's, the agriculture and aquaculture were rapidly developed at Pingtung coastal area in southern Taiwan. The groundwater aquifers were over-pumped and caused the seawater intrusion. In order to remedy the contaminated groundwater and find the best strategies of groundwater usage, a management model to search the optimal groundwater operational strategies is developed in this study. The objective function is to minimize the total amount of injection water and a set of constraints are applied to ensure the groundwater levels and concentrations are satisfied. A three-dimension density-dependent flow and transport simulation model, called SEAWAT developed by U.S. Geological Survey, is selected to simulate the phenomenon of seawater intrusion. The simulation model is well calibrated by the field measurements and replaced by the surrogate model of trained artificial neural networks (ANNs) to reduce the computational time. The ANNs are embedded in the management model to link the simulation and optimization models, and the global optimizer of differential evolution (DE) is applied for solving the management model. The optimal results show that the fully trained ANNs could substitute the original simulation model and reduce much computational time. Under appropriate setting of objective function and constraints, DE can find the optimal injection rates at predefined barriers. The concentrations at the target locations could decrease more than 50 percent within the planning horizon of 20 years. Keywords : Seawater intrusion, groundwater management, numerical model, artificial neural networks, differential evolution

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.

Optimal topologies for maximizing network transmission capacity

NASA Astrophysics Data System (ADS)

Chen, Zhenhao; Wu, Jiajing; Rong, Zhihai; Tse, Chi K.

2018-04-01

It has been widely demonstrated that the structure of a network is a major factor that affects its traffic dynamics. In this work, we try to identify the optimal topologies for maximizing the network transmission capacity, as well as to build a clear relationship between structural features of a network and the transmission performance in terms of traffic delivery. We propose an approach for designing optimal network topologies against traffic congestion by link rewiring and apply them on the Barabási-Albert scale-free, static scale-free and Internet Autonomous System-level networks. Furthermore, we analyze the optimized networks using complex network parameters that characterize the structure of networks, and our simulation results suggest that an optimal network for traffic transmission is more likely to have a core-periphery structure. However, assortative mixing and the rich-club phenomenon may have negative impacts on network performance. Based on the observations of the optimized networks, we propose an efficient method to improve the transmission capacity of large-scale networks.

IMPACT OF VENTILATION FREQUENCY AND PARENCHYMAL STIFFNESS ON FLOW AND PRESSURE DISTRIBUTION IN A CANINE LUNG MODEL

PubMed Central

Amini, Reza; Kaczka, David W.

2013-01-01

To determine the impact of ventilation frequency, lung volume, and parenchymal stiffness on ventilation distribution, we developed an anatomically-based computational model of the canine lung. Each lobe of the model consists of an asymmetric branching airway network subtended by terminal, viscoelastic acinar units. The model allows for empiric dependencies of airway segment dimensions and parenchymal stiffness on transpulmonary pressure. We simulated the effects of lung volume and parenchymal recoil on global lung impedance and ventilation distribution from 0.1 to 100 Hz, with mean transpulmonary pressures from 5 to 25 cmH2O. With increasing lung volume, the distribution of acinar flows narrowed and became more synchronous for frequencies below resonance. At higher frequencies, large variations in acinar flow were observed. Maximum acinar flow occurred at first antiresonance frequency, where lung impedance achieved a local maximum. The distribution of acinar pressures became very heterogeneous and amplified relative to tracheal pressure at the resonant frequency. These data demonstrate the important interaction between frequency and lung tissue stiffness on the distribution of acinar flows and pressures. These simulations provide useful information for the optimization of frequency, lung volume, and mean airway pressure during conventional ventilation or high frequency oscillation (HFOV). Moreover our model indicates that an optimal HFOV bandwidth exists between the resonant and antiresonant frequencies, for which interregional gas mixing is maximized. PMID:23872936

Locations of Sampling Stations for Water Quality Monitoring in Water Distribution Networks.

PubMed

Rathi, Shweta; Gupta, Rajesh

2014-04-01

Water quality is required to be monitored in the water distribution networks (WDNs) at salient locations to assure the safe quality of water supplied to the consumers. Such monitoring stations (MSs) provide warning against any accidental contaminations. Various objectives like demand coverage, time for detection, volume of water contaminated before detection, extent of contamination, expected population affected prior to detection, detection likelihood and others, have been independently or jointly considered in determining optimal number and location of MSs in WDNs. "Demand coverage" defined as the percentage of network demand monitored by a particular monitoring station is a simple measure to locate MSs. Several methods based on formulation of coverage matrix using pre-specified coverage criteria and optimization have been suggested. Coverage criteria is defined as some minimum percentage of total flow received at the monitoring stations that passed through any upstream node included then as covered node of the monitoring station. Number of monitoring stations increases with the increase in the value of coverage criteria. Thus, the design of monitoring station becomes subjective. A simple methodology is proposed herein which priority wise iteratively selects MSs to achieve targeted demand coverage. The proposed methodology provided the same number and location of MSs for illustrative network as an optimization method did. Further, the proposed method is simple and avoids subjectivity that could arise from the consideration of coverage criteria. The application of methodology is also shown on a WDN of Dharampeth zone (Nagpur city WDN in Maharashtra, India) having 285 nodes and 367 pipes.

A variational approach to probing extreme events in turbulent dynamical systems

PubMed Central

Farazmand, Mohammad; Sapsis, Themistoklis P.

2017-01-01

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

Strategic biopharmaceutical portfolio development: an analysis of constraint-induced implications.

PubMed

George, Edmund D; Farid, Suzanne S

2008-01-01

Optimizing the structure and development pathway of biopharmaceutical drug portfolios are core concerns to the developer that come with several attached complexities. These include strategic decisions for the choice of drugs, the scheduling of critical activities, and the possible involvement of third parties for development and manufacturing at various stages for each drug. Additional complexities that must be considered include the impact of making such decisions in an uncertain environment. Presented here is the development of a stochastic multi-objective optimization framework designed to address these issues. The framework harnesses the ability of Bayesian networks to characterize the probabilistic structure of superior decisions via machine learning and evolve them to multi-objective optimality. Case studies that entailed three- and five-drug portfolios alongside a range of cash flow constraints were constructed to derive insight from the framework where results demonstrate that a variety of options exist for formulating nondominated strategies in the objective space considered, giving the manufacturer a range of pursuable options. In all cases limitations on cash flow reduce the potential for generating profits for a given probability of success. For the sizes of portfolio considered, results suggest that naïvely applying strategies optimal for a particular size of portfolio to a portfolio of another size is inappropriate. For the five-drug portfolio the most preferred means for development across the set of optimized strategies is to fully integrate development and commercial activities in-house. For the three-drug portfolio, the preferred means of development involves a mixture of in-house, outsourced, and partnered activities. Also, the size of the portfolio appears to have a larger impact on strategy and the quality of objectives than the magnitude of cash flow constraint.

Optimal cost design of water distribution networks using a decomposition approach

NASA Astrophysics Data System (ADS)

Lee, Ho Min; Yoo, Do Guen; Sadollah, Ali; Kim, Joong Hoon

2016-12-01

Water distribution network decomposition, which is an engineering approach, is adopted to increase the efficiency of obtaining the optimal cost design of a water distribution network using an optimization algorithm. This study applied the source tracing tool in EPANET, which is a hydraulic and water quality analysis model, to the decomposition of a network to improve the efficiency of the optimal design process. The proposed approach was tested by carrying out the optimal cost design of two water distribution networks, and the results were compared with other optimal cost designs derived from previously proposed optimization algorithms. The proposed decomposition approach using the source tracing technique enables the efficient decomposition of an actual large-scale network, and the results can be combined with the optimal cost design process using an optimization algorithm. This proves that the final design in this study is better than those obtained with other previously proposed optimization algorithms.

An Optimization-Based State Estimatioin Framework for Large-Scale Natural Gas Networks

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

Jalving, Jordan; Zavala, Victor M.

We propose an optimization-based state estimation framework to track internal spacetime flow and pressure profiles of natural gas networks during dynamic transients. We find that the estimation problem is ill-posed (because of the infinite-dimensional nature of the states) and that this leads to instability of the estimator when short estimation horizons are used. To circumvent this issue, we propose moving horizon strategies that incorporate prior information. In particular, we propose a strategy that initializes the prior using steady-state information and compare its performance against a strategy that does not initialize the prior. We find that both strategies are capable ofmore » tracking the state profiles but we also find that superior performance is obtained with steady-state prior initialization. We also find that, under the proposed framework, pressure sensor information at junctions is sufficient to track the state profiles. We also derive approximate transport models and show that some of these can be used to achieve significant computational speed-ups without sacrificing estimation performance. We show that the estimator can be easily implemented in the graph-based modeling framework Plasmo.jl and use a multipipeline network study to demonstrate the developments.« less

Automation of route identification and optimisation based on data-mining and chemical intuition.

PubMed

Lapkin, A A; Heer, P K; Jacob, P-M; Hutchby, M; Cunningham, W; Bull, S D; Davidson, M G

2017-09-21

Data-mining of Reaxys and network analysis of the combined literature and in-house reactions set were used to generate multiple possible reaction routes to convert a bio-waste feedstock, limonene, into a pharmaceutical API, paracetamol. The network analysis of data provides a rich knowledge-base for generation of the initial reaction screening and development programme. Based on the literature and the in-house data, an overall flowsheet for the conversion of limonene to paracetamol was proposed. Each individual reaction-separation step in the sequence was simulated as a combination of the continuous flow and batch steps. The linear model generation methodology allowed us to identify the reaction steps requiring further chemical optimisation. The generated model can be used for global optimisation and generation of environmental and other performance indicators, such as cost indicators. However, the identified further challenge is to automate model generation to evolve optimal multi-step chemical routes and optimal process configurations.

An Optimization Model for the Selection of Bus-Only Lanes in a City.

PubMed

Chen, Qun

2015-01-01

The planning of urban bus-only lane networks is an important measure to improve bus service and bus priority. To determine the effective arrangement of bus-only lanes, a bi-level programming model for urban bus lane layout is developed in this study that considers accessibility and budget constraints. The goal of the upper-level model is to minimize the total travel time, and the lower-level model is a capacity-constrained traffic assignment model that describes the passenger flow assignment on bus lines, in which the priority sequence of the transfer times is reflected in the passengers' route-choice behaviors. Using the proposed bi-level programming model, optimal bus lines are selected from a set of candidate bus lines; thus, the corresponding bus lane network on which the selected bus lines run is determined. The solution method using a genetic algorithm in the bi-level programming model is developed, and two numerical examples are investigated to demonstrate the efficacy of the proposed model.

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

Spatiotemporal coding in the cortex: information flow-based learning in spiking neural networks.

PubMed

Deco, G; Schürmann, B

1999-05-15

We introduce a learning paradigm for networks of integrate-and-fire spiking neurons that is based on an information-theoretic criterion. This criterion can be viewed as a first principle that demonstrates the experimentally observed fact that cortical neurons display synchronous firing for some stimuli and not for others. The principle can be regarded as the postulation of a nonparametric reconstruction method as optimization criteria for learning the required functional connectivity that justifies and explains synchronous firing for binding of features as a mechanism for spatiotemporal coding. This can be expressed in an information-theoretic way by maximizing the discrimination ability between different sensory inputs in minimal time.

A chronometric functional sub-network in the thalamo-cortical system regulates the flow of neural information necessary for conscious cognitive processes.

PubMed

León-Domínguez, Umberto; Vela-Bueno, Antonio; Froufé-Torres, Manuel; León-Carrión, Jose

2013-06-01

The thalamo-cortical system has been defined as a neural network associated with consciousness. While there seems to be wide agreement that the thalamo-cortical system directly intervenes in vigilance and arousal, a divergence of opinion persists regarding its intervention in the control of other cognitive processes necessary for consciousness. In the present manuscript, we provide a review of recent scientific findings on the thalamo-cortical system and its role in the control and regulation of the flow of neural information necessary for conscious cognitive processes. We suggest that the axis formed by the medial prefrontal cortex and different thalamic nuclei (reticular nucleus, intralaminar nucleus, and midline nucleus), represents a core component for consciousness. This axis regulates different cerebral structures which allow basic cognitive processes like attention, arousal and memory to emerge. In order to produce a synchronized coherent response, neural communication between cerebral structures must have exact timing (chronometry). Thus, a chronometric functional sub-network within the thalamo-cortical system keeps us in an optimal and continuous functional state, allowing high-order cognitive processes, essential to awareness and qualia, to take place. Copyright © 2013 Elsevier Ltd. All rights reserved.

Modelling information flow along the human connectome using maximum flow.

PubMed

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

2018-01-01

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

A method of network topology optimization design considering application process characteristic

NASA Astrophysics Data System (ADS)

Wang, Chunlin; Huang, Ning; Bai, Yanan; Zhang, Shuo

2018-03-01

Communication networks are designed to meet the usage requirements of users for various network applications. The current studies of network topology optimization design mainly considered network traffic, which is the result of network application operation, but not a design element of communication networks. A network application is a procedure of the usage of services by users with some demanded performance requirements, and has obvious process characteristic. In this paper, we first propose a method to optimize the design of communication network topology considering the application process characteristic. Taking the minimum network delay as objective, and the cost of network design and network connective reliability as constraints, an optimization model of network topology design is formulated, and the optimal solution of network topology design is searched by Genetic Algorithm (GA). Furthermore, we investigate the influence of network topology parameter on network delay under the background of multiple process-oriented applications, which can guide the generation of initial population and then improve the efficiency of GA. Numerical simulations show the effectiveness and validity of our proposed method. Network topology optimization design considering applications can improve the reliability of applications, and provide guidance for network builders in the early stage of network design, which is of great significance in engineering practices.

Price of anarchy on heterogeneous traffic-flow networks

NASA Astrophysics Data System (ADS)

Rose, A.; O'Dea, R.; Hopcraft, K. I.

2016-09-01

The efficiency of routing traffic through a network, comprising nodes connected by links whose cost of traversal is either fixed or varies in proportion to volume of usage, can be measured by the "price of anarchy." This is the ratio of the cost incurred by agents who act to minimize their individual expenditure to the optimal cost borne by the entire system. As the total traffic load and the network variability—parameterized by the proportion of variable-cost links in the network—changes, the behaviors that the system presents can be understood with the introduction of a network of simpler structure. This is constructed from classes of nonoverlapping paths connecting source to destination nodes that are characterized by the number of variable-cost edges they contain. It is shown that localized peaks in the price of anarchy occur at critical traffic volumes at which it becomes beneficial to exploit ostensibly more expensive paths as the network becomes more congested. Simulation results verifying these findings are presented for the variation of the price of anarchy with the network's size, aspect ratio, variability, and traffic load.

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

Automated and Cooperative Vehicle Merging at Highway On-Ramps

DOE PAGES

Rios-Torres, Jackeline; Malikopoulos, Andreas A.

2016-08-05

Recognition of necessities of connected and automated vehicles (CAVs) is gaining momentum. CAVs can improve both transportation network efficiency and safety through control algorithms that can harmonically use all existing information to coordinate the vehicles. This paper addresses the problem of optimally coordinating CAVs at merging roadways to achieve smooth traffic flow without stop-and-go driving. Here we present an optimization framework and an analytical closed-form solution that allows online coordination of vehicles at merging zones. The effectiveness of the efficiency of the proposed solution is validated through a simulation, and it is shown that coordination of vehicles can significantly reducemore » both fuel consumption and travel time.« less

Advanced power analysis methodology targeted to the optimization of a digital pixel readout chip design and its critical serial powering system

NASA Astrophysics Data System (ADS)

Marconi, S.; Orfanelli, S.; Karagounis, M.; Hemperek, T.; Christiansen, J.; Placidi, P.

2017-02-01

A dedicated power analysis methodology, based on modern digital design tools and integrated with the VEPIX53 simulation framework developed within RD53 collaboration, is being used to guide vital choices for the design and optimization of the next generation ATLAS and CMS pixel chips and their critical serial powering circuit (shunt-LDO). Power consumption is studied at different stages of the design flow under different operating conditions. Significant effort is put into extensive investigations of dynamic power variations in relation with the decoupling seen by the powering network. Shunt-LDO simulations are also reported to prove the reliability at the system level.

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.

Mathematical model of highways network optimization

NASA Astrophysics Data System (ADS)

Sakhapov, R. L.; Nikolaeva, R. V.; Gatiyatullin, M. H.; Makhmutov, M. M.

2017-12-01

The article deals with the issue of highways network design. Studies show that the main requirement from road transport for the road network is to ensure the realization of all the transport links served by it, with the least possible cost. The goal of optimizing the network of highways is to increase the efficiency of transport. It is necessary to take into account a large number of factors that make it difficult to quantify and qualify their impact on the road network. In this paper, we propose building an optimal variant for locating the road network on the basis of a mathematical model. The article defines the criteria for optimality and objective functions that reflect the requirements for the road network. The most fully satisfying condition for optimality is the minimization of road and transport costs. We adopted this indicator as a criterion of optimality in the economic-mathematical model of a network of highways. Studies have shown that each offset point in the optimal binding road network is associated with all other corresponding points in the directions providing the least financial costs necessary to move passengers and cargo from this point to the other corresponding points. The article presents general principles for constructing an optimal network of roads.

Practical synchronization on complex dynamical networks via optimal pinning control

NASA Astrophysics Data System (ADS)

Li, Kezan; Sun, Weigang; Small, Michael; Fu, Xinchu

2015-07-01

We consider practical synchronization on complex dynamical networks under linear feedback control designed by optimal control theory. The control goal is to minimize global synchronization error and control strength over a given finite time interval, and synchronization error at terminal time. By utilizing the Pontryagin's minimum principle, and based on a general complex dynamical network, we obtain an optimal system to achieve the control goal. The result is verified by performing some numerical simulations on Star networks, Watts-Strogatz networks, and Barabási-Albert networks. Moreover, by combining optimal control and traditional pinning control, we propose an optimal pinning control strategy which depends on the network's topological structure. Obtained results show that optimal pinning control is very effective for synchronization control in real applications.

Optimal river monitoring network using optimal partition analysis: a case study of Hun River, Northeast China.

PubMed

Wang, Hui; Liu, Chunyue; Rong, Luge; Wang, Xiaoxu; Sun, Lina; Luo, Qing; Wu, Hao

2018-01-09

River monitoring networks play an important role in water environmental management and assessment, and it is critical to develop an appropriate method to optimize the monitoring network. In this study, an effective method was proposed based on the attainment rate of National Grade III water quality, optimal partition analysis and Euclidean distance, and Hun River was taken as a method validation case. There were 7 sampling sites in the monitoring network of the Hun River, and 17 monitoring items were analyzed once a month during January 2009 to December 2010. The results showed that the main monitoring items in the surface water of Hun River were ammonia nitrogen (NH 4 + -N), chemical oxygen demand, and biochemical oxygen demand. After optimization, the required number of monitoring sites was reduced from seven to three, and 57% of the cost was saved. In addition, there were no significant differences between non-optimized and optimized monitoring networks, and the optimized monitoring networks could correctly represent the original monitoring network. The duplicate setting degree of monitoring sites decreased after optimization, and the rationality of the monitoring network was improved. Therefore, the optimal method was identified as feasible, efficient, and economic.

Stochastic cycle selection in active flow networks.

PubMed

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

2016-07-19

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

Stochastic cycle selection in active flow networks

NASA Astrophysics Data System (ADS)

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

2016-11-01

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

Stochastic cycle selection in active flow networks

PubMed Central

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

2016-01-01

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

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

PubMed

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

2007-07-01

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

Geometrical effect characterization of femtosecond-laser manufactured glass microfluidic chips based on optical manipulation of submicroparticles

NASA Astrophysics Data System (ADS)

Kotsifaki, Domna G.; Mackenzie, Mark D.; Polydefki, Georgia; Kar, Ajoy K.; Makropoulou, Mersini; Serafetinides, Alexandros A.

2017-12-01

Microfluidic devices provide a platform with wide ranging applications from environmental monitoring to disease diagnosis. They offer substantive advantages but are often not optimized or designed to be used by nonexpert researchers. Microchannels of a microanalysis platform and their geometrical characterization are of eminent importance when designing such devices. We present a method that is used to optimize each microchannel within a device using high-throughput particle manipulation. For this purpose, glass-based microfluidic devices, with three-dimensional channel networks of several geometrical sizes, were fabricated by employing laser fabrication techniques. The effect of channel geometry was investigated by employing an optical tweezer. The optical trapping force depends on the flow velocity that is associated with the dimensions of the microchannel. We observe a linear dependence of the trapping efficiency and of the fluid flow velocity, with the channel dimensions. We determined that the highest trapping efficiency was achieved for microchannels with aspect ratio equal to one. Numerical simulation validated the impact of the device design dimensions on the trapping efficiency. This investigation indicates that the geometrical characteristics, the flow velocity, and trapping efficiency are crucial and should be considered when fabricating microfluidic devices for cell studies.

On sequential data assimilation for scalar macroscopic traffic flow models

NASA Astrophysics Data System (ADS)

Blandin, Sébastien; Couque, Adrien; Bayen, Alexandre; Work, Daniel

2012-09-01

We consider the problem of sequential data assimilation for transportation networks using optimal filtering with a scalar macroscopic traffic flow model. Properties of the distribution of the uncertainty on the true state related to the specific nonlinearity and non-differentiability inherent to macroscopic traffic flow models are investigated, derived analytically and analyzed. We show that nonlinear dynamics, by creating discontinuities in the traffic state, affect the performances of classical filters and in particular that the distribution of the uncertainty on the traffic state at shock waves is a mixture distribution. The non-differentiability of traffic dynamics around stationary shock waves is also proved and the resulting optimality loss of the estimates is quantified numerically. The properties of the estimates are explicitly studied for the Godunov scheme (and thus the Cell-Transmission Model), leading to specific conclusions about their use in the context of filtering, which is a significant contribution of this article. Analytical proofs and numerical tests are introduced to support the results presented. A Java implementation of the classical filters used in this work is available on-line at http://traffic.berkeley.edu for facilitating further efforts on this topic and fostering reproducible research.

Information theory-based decision support system for integrated design of multivariable hydrometric networks

NASA Astrophysics Data System (ADS)

Keum, Jongho; Coulibaly, Paulin

2017-07-01

Adequate and accurate hydrologic information from optimal hydrometric networks is an essential part of effective water resources management. Although the key hydrologic processes in the water cycle are interconnected, hydrometric networks (e.g., streamflow, precipitation, groundwater level) have been routinely designed individually. A decision support framework is proposed for integrated design of multivariable hydrometric networks. The proposed method is applied to design optimal precipitation and streamflow networks simultaneously. The epsilon-dominance hierarchical Bayesian optimization algorithm was combined with Shannon entropy of information theory to design and evaluate hydrometric networks. Specifically, the joint entropy from the combined networks was maximized to provide the most information, and the total correlation was minimized to reduce redundant information. To further optimize the efficiency between the networks, they were designed by maximizing the conditional entropy of the streamflow network given the information of the precipitation network. Compared to the traditional individual variable design approach, the integrated multivariable design method was able to determine more efficient optimal networks by avoiding the redundant stations. Additionally, four quantization cases were compared to evaluate their effects on the entropy calculations and the determination of the optimal networks. The evaluation results indicate that the quantization methods should be selected after careful consideration for each design problem since the station rankings and the optimal networks can change accordingly.

Optimizing location of manufacturing industries in the context of economic globalization: A bi-level model based approach

NASA Astrophysics Data System (ADS)

Wu, Shanhua; Yang, Zhongzhen

2018-07-01

This paper aims to optimize the locations of manufacturing industries in the context of economic globalization by proposing a bi-level programming model which integrates the location optimization model with the traffic assignment model. In the model, the transport network is divided into the subnetworks of raw materials and products respectively. The upper-level model is used to determine the location of industries and the OD matrices of raw materials and products. The lower-level model is used to calculate the attributes of traffic flow under given OD matrices. To solve the model, the genetic algorithm is designed. The proposed method is tested using the Chinese steel industry as an example. The result indicates that the proposed method could help the decision-makers to implement the location decisions for the manufacturing industries effectively.

Accelerating global optimization of aerodynamic shapes using a new surrogate-assisted parallel genetic algorithm

NASA Astrophysics Data System (ADS)

Ebrahimi, Mehdi; Jahangirian, Alireza

2017-12-01

An efficient strategy is presented for global shape optimization of wing sections with a parallel genetic algorithm. Several computational techniques are applied to increase the convergence rate and the efficiency of the method. A variable fidelity computational evaluation method is applied in which the expensive Navier-Stokes flow solver is complemented by an inexpensive multi-layer perceptron neural network for the objective function evaluations. A population dispersion method that consists of two phases, of exploration and refinement, is developed to improve the convergence rate and the robustness of the genetic algorithm. Owing to the nature of the optimization problem, a parallel framework based on the master/slave approach is used. The outcomes indicate that the method is able to find the global optimum with significantly lower computational time in comparison to the conventional genetic algorithm.

Modeling thermal stress propagation during hydraulic stimulation of geothermal wells

NASA Astrophysics Data System (ADS)

Jansen, Gunnar; Miller, Stephen A.

2017-04-01

A large fraction of the world's water and energy resources are located in naturally fractured reservoirs within the earth's crust. Depending on the lithology and tectonic history of a formation, fracture networks can range from dense and homogeneous highly fractured networks to single large scale fractures dominating the flow behavior. Understanding the dynamics of such reservoirs in terms of flow and transport is crucial to successful application of engineered geothermal systems (also known as enhanced geothermal systems or EGS) for geothermal energy production in the future. Fractured reservoirs are considered to consist of two distinct separate media, namely the fracture and matrix space respectively. Fractures are generally thin, highly conductive containing only small amounts of fluid, whereas the matrix rock provides high fluid storage but typically has much smaller permeability. Simulation of flow and transport through fractured porous media is challenging due to the high permeability contrast between the fractures and the surrounding rock matrix. However, accurate and efficient simulation of flow through a fracture network is crucial in order to understand, optimize and engineer reservoirs. It has been a research topic for several decades and is still under active research. Accurate fluid flow simulations through field-scale fractured reservoirs are still limited by the power of current computer processing units (CPU). We present an efficient implementation of the embedded discrete fracture model, which is a promising new technique in modeling the behavior of enhanced geothermal systems. An efficient coupling strategy is determined for numerical performance of the model. We provide new insight into the coupled modeling of fluid flow, heat transport of engineered geothermal reservoirs with focus on the thermal stress changes during the stimulation process. We further investigate the interplay of thermal and poro-elastic stress changes in the reservoir. Combined with a analytical formulation for the injection temperatures in the open hole section of a geothermal well, the stress changes induced during the injection period of reservoir development can be studied.

A one-layer recurrent neural network for constrained pseudoconvex optimization and its application for dynamic portfolio optimization.

PubMed

Liu, Qingshan; Guo, Zhishan; Wang, Jun

2012-02-01

In this paper, a one-layer recurrent neural network is proposed for solving pseudoconvex optimization problems subject to linear equality and bound constraints. Compared with the existing neural networks for optimization (e.g., the projection neural networks), the proposed neural network is capable of solving more general pseudoconvex optimization problems with equality and bound constraints. Moreover, it is capable of solving constrained fractional programming problems as a special case. The convergence of the state variables of the proposed neural network to achieve solution optimality is guaranteed as long as the designed parameters in the model are larger than the derived lower bounds. Numerical examples with simulation results illustrate the effectiveness and characteristics of the proposed neural network. In addition, an application for dynamic portfolio optimization is discussed. Copyright © 2011 Elsevier Ltd. All rights reserved.

Network placement optimization for large-scale distributed system

NASA Astrophysics Data System (ADS)

Ren, Yu; Liu, Fangfang; Fu, Yunxia; Zhou, Zheng

2018-01-01

The network geometry strongly influences the performance of the distributed system, i.e., the coverage capability, measurement accuracy and overall cost. Therefore the network placement optimization represents an urgent issue in the distributed measurement, even in large-scale metrology. This paper presents an effective computer-assisted network placement optimization procedure for the large-scale distributed system and illustrates it with the example of the multi-tracker system. To get an optimal placement, the coverage capability and the coordinate uncertainty of the network are quantified. Then a placement optimization objective function is developed in terms of coverage capabilities, measurement accuracy and overall cost. And a novel grid-based encoding approach for Genetic algorithm is proposed. So the network placement is optimized by a global rough search and a local detailed search. Its obvious advantage is that there is no need for a specific initial placement. At last, a specific application illustrates this placement optimization procedure can simulate the measurement results of a specific network and design the optimal placement efficiently.

A graph decomposition-based approach for water distribution network optimization

NASA Astrophysics Data System (ADS)

Zheng, Feifei; Simpson, Angus R.; Zecchin, Aaron C.; Deuerlein, Jochen W.

2013-04-01

A novel optimization approach for water distribution network design is proposed in this paper. Using graph theory algorithms, a full water network is first decomposed into different subnetworks based on the connectivity of the network's components. The original whole network is simplified to a directed augmented tree, in which the subnetworks are substituted by augmented nodes and directed links are created to connect them. Differential evolution (DE) is then employed to optimize each subnetwork based on the sequence specified by the assigned directed links in the augmented tree. Rather than optimizing the original network as a whole, the subnetworks are sequentially optimized by the DE algorithm. A solution choice table is established for each subnetwork (except for the subnetwork that includes a supply node) and the optimal solution of the original whole network is finally obtained by use of the solution choice tables. Furthermore, a preconditioning algorithm is applied to the subnetworks to produce an approximately optimal solution for the original whole network. This solution specifies promising regions for the final optimization algorithm to further optimize the subnetworks. Five water network case studies are used to demonstrate the effectiveness of the proposed optimization method. A standard DE algorithm (SDE) and a genetic algorithm (GA) are applied to each case study without network decomposition to enable a comparison with the proposed method. The results show that the proposed method consistently outperforms the SDE and GA (both with tuned parameters) in terms of both the solution quality and efficiency.

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.

Optimal information transfer in enzymatic networks: A field theoretic formulation

NASA Astrophysics Data System (ADS)

Samanta, Himadri S.; Hinczewski, Michael; Thirumalai, D.

2017-07-01

Signaling in enzymatic networks is typically triggered by environmental fluctuations, resulting in a series of stochastic chemical reactions, leading to corruption of the signal by noise. For example, information flow is initiated by binding of extracellular ligands to receptors, which is transmitted through a cascade involving kinase-phosphatase stochastic chemical reactions. For a class of such networks, we develop a general field-theoretic approach to calculate the error in signal transmission as a function of an appropriate control variable. Application of the theory to a simple push-pull network, a module in the kinase-phosphatase cascade, recovers the exact results for error in signal transmission previously obtained using umbral calculus [Hinczewski and Thirumalai, Phys. Rev. X 4, 041017 (2014), 10.1103/PhysRevX.4.041017]. We illustrate the generality of the theory by studying the minimal errors in noise reduction in a reaction cascade with two connected push-pull modules. Such a cascade behaves as an effective three-species network with a pseudointermediate. In this case, optimal information transfer, resulting in the smallest square of the error between the input and output, occurs with a time delay, which is given by the inverse of the decay rate of the pseudointermediate. Surprisingly, in these examples the minimum error computed using simulations that take nonlinearities and discrete nature of molecules into account coincides with the predictions of a linear theory. In contrast, there are substantial deviations between simulations and predictions of the linear theory in error in signal propagation in an enzymatic push-pull network for a certain range of parameters. Inclusion of second-order perturbative corrections shows that differences between simulations and theoretical predictions are minimized. Our study establishes that a field theoretic formulation of stochastic biological signaling offers a systematic way to understand error propagation in networks of arbitrary complexity.

Dynamic Power Distribution System Management With a Locally Connected Communication Network

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

Dall-Anese, Emiliano; Zhang, Kaiqing; Basar, Tamer

Coordinated optimization and control of distribution-level assets can enable a reliable and optimal integration of massive amount of distributed energy resources (DERs) and facilitate distribution system management (DSM). Accordingly, the objective is to coordinate the power injection at the DERs to maintain certain quantities across the network, e.g., voltage magnitude, line flows, or line losses, to be close to a desired profile. By and large, the performance of the DSM algorithms has been challenged by two factors: i) the possibly non-strongly connected communication network over DERs that hinders the coordination; ii) the dynamics of the real system caused by themore » DERs with heterogeneous capabilities, time-varying operating conditions, and real-time measurement mismatches. In this paper, we investigate the modeling and algorithm design and analysis with the consideration of these two factors. In particular, a game theoretic characterization is first proposed to account for a locally connected communication network over DERs, along with the analysis of the existence and uniqueness of the Nash equilibrium (NE) therein. To achieve the equilibrium in a distributed fashion, a projected-gradient-based asynchronous DSM algorithm is then advocated. The algorithm performance, including the convergence speed and the tracking error, is analytically guaranteed under the dynamic setting. Extensive numerical tests on both synthetic and realistic cases corroborate the analytical results derived.« less

Optimizing Dynamical Network Structure for Pinning Control

NASA Astrophysics Data System (ADS)

Orouskhani, Yasin; Jalili, Mahdi; Yu, Xinghuo

2016-04-01

Controlling dynamics of a network from any initial state to a final desired state has many applications in different disciplines from engineering to biology and social sciences. In this work, we optimize the network structure for pinning control. The problem is formulated as four optimization tasks: i) optimizing the locations of driver nodes, ii) optimizing the feedback gains, iii) optimizing simultaneously the locations of driver nodes and feedback gains, and iv) optimizing the connection weights. A newly developed population-based optimization technique (cat swarm optimization) is used as the optimization method. In order to verify the methods, we use both real-world networks, and model scale-free and small-world networks. Extensive simulation results show that the optimal placement of driver nodes significantly outperforms heuristic methods including placing drivers based on various centrality measures (degree, betweenness, closeness and clustering coefficient). The pinning controllability is further improved by optimizing the feedback gains. We also show that one can significantly improve the controllability by optimizing the connection weights.

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.

ATLAS DataFlow Infrastructure: Recent results from ATLAS cosmic and first-beam data-taking

NASA Astrophysics Data System (ADS)

Vandelli, Wainer; ATLAS TDAQ Collaboration

2010-04-01

The ATLAS DataFlow infrastructure is responsible for the collection and conveyance of event data from the detector front-end electronics to the mass storage. Several optimized and multi-threaded applications fulfill this purpose operating over a multi-stage Gigabit Ethernet network which is the backbone of the ATLAS Trigger and Data Acquisition System. The system must be able to efficiently transport event-data with high reliability, while providing aggregated bandwidths larger than 5 GByte/s and coping with many thousands network connections. Nevertheless, routing and streaming capabilities and monitoring and data accounting functionalities are also fundamental requirements. During 2008, a few months of ATLAS cosmic data-taking and the first experience with the LHC beams provided an unprecedented test-bed for the evaluation of the performance of the ATLAS DataFlow, in terms of functionality, robustness and stability. Besides, operating the system far from its design specifications helped in exercising its flexibility and contributed in understanding its limitations. Moreover, the integration with the detector and the interfacing with the off-line data processing and management have been able to take advantage of this extended data taking-period as well. In this paper we report on the usage of the DataFlow infrastructure during the ATLAS data-taking. These results, backed-up by complementary performance tests, validate the architecture of the ATLAS DataFlow and prove that the system is robust, flexible and scalable enough to cope with the final requirements of the ATLAS experiment.

Cross-layer protocol design for QoS optimization in real-time wireless sensor networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

2010-04-01

The metrics of quality of service (QoS) for each sensor type in a wireless sensor network can be associated with metrics for multimedia that describe the quality of fused information, e.g., throughput, delay, jitter, packet error rate, information correlation, etc. These QoS metrics are typically set at the highest, or application, layer of the protocol stack to ensure that performance requirements for each type of sensor data are satisfied. Application-layer metrics, in turn, depend on the support of the lower protocol layers: session, transport, network, data link (MAC), and physical. The dependencies of the QoS metrics on the performance of the higher layers of the Open System Interconnection (OSI) reference model of the WSN protocol, together with that of the lower three layers, are the basis for a comprehensive approach to QoS optimization for multiple sensor types in a general WSN model. The cross-layer design accounts for the distributed power consumption along energy-constrained routes and their constituent nodes. Following the author's previous work, the cross-layer interactions in the WSN protocol are represented by a set of concatenated protocol parameters and enabling resource levels. The "best" cross-layer designs to achieve optimal QoS are established by applying the general theory of martingale representations to the parameterized multivariate point processes (MVPPs) for discrete random events occurring in the WSN. Adaptive control of network behavior through the cross-layer design is realized through the parametric factorization of the stochastic conditional rates of the MVPPs. The cross-layer protocol parameters for optimal QoS are determined in terms of solutions to stochastic dynamic programming conditions derived from models of transient flows for heterogeneous sensor data and aggregate information over a finite time horizon. Markov state processes, embedded within the complex combinatorial history of WSN events, are more computationally tractable and lead to simplifications for any simulated or analytical performance evaluations of the cross-layer designs.

Steady state security assessment in deregulated power systems

NASA Astrophysics Data System (ADS)

Manjure, Durgesh Padmakar

Power system operations are undergoing changes, brought about primarily due to deregulation and subsequent restructuring of the power industry. The primary intention of the introduction of deregulation in power systems was to bring about competition and improved customer focus. The underlying motive was increased economic benefit. Present day power system analysis is much different than what it was earlier, essentially due to the transformation of the power industry from being cost-based to one that is price-based and due to open access of transmission networks to the various market participants. Power is now treated as a commodity and is traded in an open market. The resultant interdependence of the technical criteria and the economic considerations has only accentuated the need for accurate analysis in power systems. The main impetus in security analysis studies is on efficient assessment of the post-contingency status of the system, accuracy being of secondary consideration. In most cases, given the time frame involved, it is not feasible to run a complete AC load flow for determining the post-contingency state of the system. Quite often, it is not warranted as well, as an indication of the state of the system is desired rather than the exact quantification of the various state variables. With the inception of deregulation, transmission networks are subjected to a host of multilateral transactions, which would influence physical system quantities like real power flows, security margins and voltage levels. For efficient asset utilization and maximization of the revenue, more often than not, transmission networks are operated under stressed conditions, close to security limits. Therefore, a quantitative assessment of the extent to which each transaction adversely affects the transmission network is required. This needs to be done accurately as the feasibility of the power transactions and subsequent decisions (execution, curtailment, pricing) would depend upon the outcome of the analysis. Also considering the large number of transactions occurring in the power market, and the massive sizes of transmission networks, the need for efficient analysis techniques is further highlighted. Thus on the whole, for present-day power systems, security assessment has acquired predominant importance. The primary emphasis of the work done in this dissertation is on development of techniques for fast assessment of the state of the transmission network following credible contingencies in traditional and deregulated power systems. In addition, methodologies for optimal correction strategies in the event of violation of security limits are also proposed. The work done can be enumerated as: (1) development of fast methods to assess the state of the transmission network from the point of view of loading margin and power flows, following increased loading conditions and line outages; (2) development of a comprehensive scheme to assess the impact of bilateral transactions on the operating state of the network; (3) optimal rescheduling of generation and curtailable loads for relieving the system of congestion and simultaneously maximizing the security margins.

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

NASA Astrophysics Data System (ADS)

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

2017-05-01

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

Optimal synchronization in space

NASA Astrophysics Data System (ADS)

Brede, Markus

2010-02-01

In this Rapid Communication we investigate spatially constrained networks that realize optimal synchronization properties. After arguing that spatial constraints can be imposed by limiting the amount of “wire” available to connect nodes distributed in space, we use numerical optimization methods to construct networks that realize different trade offs between optimal synchronization and spatial constraints. Over a large range of parameters such optimal networks are found to have a link length distribution characterized by power-law tails P(l)∝l-α , with exponents α increasing as the networks become more constrained in space. It is also shown that the optimal networks, which constitute a particular type of small world network, are characterized by the presence of nodes of distinctly larger than average degree around which long-distance links are centered.

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

PubMed

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

2015-02-04

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

Toward controlling perturbations in robotic sensor networks

NASA Astrophysics Data System (ADS)

Banerjee, Ashis G.; Majumder, Saikat R.

2014-06-01

Robotic sensor networks (RSNs), which consist of networks of sensors placed on mobile robots, are being increasingly used for environment monitoring applications. In particular, a lot of work has been done on simultaneous localization and mapping of the robots, and optimal sensor placement for environment state estimation1. The deployment of RSNs, however, remains challenging in harsh environments where the RSNs have to deal with significant perturbations in the forms of wind gusts, turbulent water flows, sand storms, or blizzards that disrupt inter-robot communication and individual robot stability. Hence, there is a need to be able to control such perturbations and bring the networks to desirable states with stable nodes (robots) and minimal operational performance (environment sensing). Recent work has demonstrated the feasibility of controlling the non-linear dynamics in other communication networks like emergency management systems and power grids by introducing compensatory perturbations to restore network stability and operation2. In this paper, we develop a computational framework to investigate the usefulness of this approach for RSNs in marine environments. Preliminary analysis shows promising performance and identifies bounds on the original perturbations within which it is possible to control the networks.

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.

Computational benefits using artificial intelligent methodologies for the solution of an environmental design problem: saltwater intrusion.

PubMed

Papadopoulou, Maria P; Nikolos, Ioannis K; Karatzas, George P

2010-01-01

Artificial Neural Networks (ANNs) comprise a powerful tool to approximate the complicated behavior and response of physical systems allowing considerable reduction in computation time during time-consuming optimization runs. In this work, a Radial Basis Function Artificial Neural Network (RBFN) is combined with a Differential Evolution (DE) algorithm to solve a water resources management problem, using an optimization procedure. The objective of the optimization scheme is to cover the daily water demand on the coastal aquifer east of the city of Heraklion, Crete, without reducing the subsurface water quality due to seawater intrusion. The RBFN is utilized as an on-line surrogate model to approximate the behavior of the aquifer and to replace some of the costly evaluations of an accurate numerical simulation model which solves the subsurface water flow differential equations. The RBFN is used as a local approximation model in such a way as to maintain the robustness of the DE algorithm. The results of this procedure are compared to the corresponding results obtained by using the Simplex method and by using the DE procedure without the surrogate model. As it is demonstrated, the use of the surrogate model accelerates the convergence of the DE optimization procedure and additionally provides a better solution at the same number of exact evaluations, compared to the original DE algorithm.

Tabu Search enhances network robustness under targeted attacks

NASA Astrophysics Data System (ADS)

Sun, Shi-wen; Ma, Yi-lin; Li, Rui-qi; Wang, Li; Xia, Cheng-yi

2016-03-01

We focus on the optimization of network robustness with respect to intentional attacks on high-degree nodes. Given an existing network, this problem can be considered as a typical single-objective combinatorial optimization problem. Based on the heuristic Tabu Search optimization algorithm, a link-rewiring method is applied to reconstruct the network while keeping the degree of every node unchanged. Through numerical simulations, BA scale-free network and two real-world networks are investigated to verify the effectiveness of the proposed optimization method. Meanwhile, we analyze how the optimization affects other topological properties of the networks, including natural connectivity, clustering coefficient and degree-degree correlation. The current results can help to improve the robustness of existing complex real-world systems, as well as to provide some insights into the design of robust networks.

Multiscale modelling of Flow-Induced Blood Cell Damage

NASA Astrophysics Data System (ADS)

Liu, Yaling; Sohrabi, Salman

2017-11-01

We study red blood cell (RBC) damage and hemolysis at cellular level. Under high shear rates, pores form on RBC membranes through which hemoglobin (Hb) leaks out and increases free Hb content of plasma leading to hemolysis. By coupling lattice Boltzmann and spring connected network models through immersed boundary method, we estimate hemolysis of a single RBC under various shear rates. The developed cellular damage model can be used as a predictive tool for hydrodynamic and hematologic design optimization of blood-wetting medical devices.

Modeling and Performance Optimization of Large-Scale Data-Communication Networks.

DTIC Science & Technology

1981-06-01

IT-17, no. 1, pp. 71-76, 1971. 12. Y. Ho, M. Kastner, and E. Wong, "Teams, market signalling, and information theory," IEEE Trans. Automat. Contr...modifies the flow assignment to satisfy end-to-end delay constraints. 3.2.1 Rationale for Min-Hop Strategr The Min-Hop algorithm proposed in this...Prentice-Hall, 1980. Ho, Y., M. Kostner and E. Wong, "Teams, market signalling, and information theory," IEEE Trans. Automat. Contr., vol. AC-23, pp

Modeling Signaling Networks to Advance New Cancer Therapies.

PubMed

Saez-Rodriguez, Julio; MacNamara, Aidan; Cook, Simon

2015-01-01

Cell signaling pathways control cells' responses to their environment through an intricate network of proteins and small molecules partitioned by intracellular structures, such as the cytoskeleton and nucleus. Our understanding of these pathways has been revised recently with the advent of more advanced experimental techniques; no longer are signaling pathways viewed as linear cascades of information flowing from membrane-bound receptors to the nucleus. Instead, such pathways must be understood in the context of networks, and studying such networks requires an integration of computational and experimental approaches. This understanding is becoming more important in designing novel therapies for diseases such as cancer. Using the MAPK (mitogen-activated protein kinase) and PI3K (class I phosphoinositide-3' kinase) pathways as case studies of cellular signaling, we give an overview of these pathways and their functions. We then describe, using a number of case studies, how computational modeling has aided in understanding these pathways' deregulation in cancer, and how such understanding can be used to optimally tailor current therapies or help design new therapies against cancer.

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Network structure of subway passenger flows

NASA Astrophysics Data System (ADS)

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

2016-03-01

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

Investigation of Coupled model of Pore network and Continuum in shale gas

NASA Astrophysics Data System (ADS)

Cao, G.; Lin, M.

2016-12-01

Flow in shale spanning over many scales, makes the majority of conventional treatment methods disabled. For effectively simulating, a coupled model of pore-scale and continuum-scale was proposed in this paper. Based on the SEM image, we decompose organic-rich-shale into two subdomains: kerogen and inorganic matrix. In kerogen, the nanoscale pore-network is the main storage space and migration pathway so that the molecular phenomena (slip and diffusive transport) is significant. Whereas, inorganic matrix, with relatively large pores and micro fractures, the flow is approximate to Darcy. We use pore-scale network models (PNM) to represent kerogen and continuum-scale models (FVM or FEM) to represent matrix. Finite element mortars are employed to couple pore- and continuum-scale models by enforcing continuity of pressures and fluxes at shared boundary interfaces. In our method, the process in the coupled model is described by pressure square equation, and uses Dirichlet boundary conditions. We discuss several problems: the optimal element number of mortar faces, two categories boundary faces of pore network, the difference between 2D and 3D models, and the difference between continuum models FVM and FEM in mortars. We conclude that: (1) too coarse mesh in mortars will decrease the accuracy, while too fine mesh will lead to an ill-condition even singular system, the optimal element number is depended on boundary pores and nodes number. (2) pore network models are adjacent to two different mortar faces (PNM to PNM, PNM to continuum model), incidental repeated mortar nodes must be deleted. (3) 3D models can be replaced by 2D models under certain condition. (4) FVM is more convenient than FEM, for its simplicity in assigning interface nodes pressure and calculating interface fluxes. This work is supported by the Strategic Priority Research Program of the Chinese Academy of Sciences (XDB10020302), the 973 Program (2014CB239004), the Key Instrument Developing Project of the CAS (ZDYZ2012-1-08-02), the National Natural Science Foundation of China (41574129).

Optimizing Nutrient Uptake in Biological Transport Networks

NASA Astrophysics Data System (ADS)

Ronellenfitsch, Henrik; Katifori, Eleni

2013-03-01

Many biological systems employ complex networks of vascular tubes to facilitate transport of solute nutrients, examples include the vascular system of plants (phloem), some fungi, and the slime-mold Physarum. It is believed that such networks are optimized through evolution for carrying out their designated task. We propose a set of hydrodynamic governing equations for solute transport in a complex network, and obtain the optimal network architecture for various classes of optimizing functionals. We finally discuss the topological properties and statistical mechanics of the resulting complex networks, and examine correspondence of the obtained networks to those found in actual biological systems.

Intelligent Distribution Voltage Control with Distributed Generation =

NASA Astrophysics Data System (ADS)

Castro Mendieta, Jose

In this thesis, three methods for the optimal participation of the reactive power of distributed generations (DGs) in unbalanced distributed network have been proposed, developed, and tested. These new methods were developed with the objectives of maintain voltage within permissible limits and reduce losses. The first method proposes an optimal participation of reactive power of all devices available in the network. The propose approach is validated by comparing the results with other methods reported in the literature. The proposed method was implemented using Simulink of Matlab and OpenDSS. Optimization techniques and the presentation of results are from Matlab. The co-simulation of Electric Power Research Institute's (EPRI) OpenDSS program solves a three-phase optimal power flow problem in the unbalanced IEEE 13 and 34-node test feeders. The results from this work showed a better loss reduction compared to the Coordinated Voltage Control (CVC) method. The second method aims to minimize the voltage variation on the pilot bus on distribution network using DGs. It uses Pareto and Fuzzy-PID logic to reduce the voltage variation. Results indicate that the proposed method reduces the voltage variation more than the other methods. Simulink of Matlab and OpenDSS is used in the development of the proposed approach. The performance of the method is evaluated on IEEE 13-node test feeder with one and three DGs. Variables and unbalanced loads are used, based on real consumption data, over a time window of 48 hours. The third method aims to minimize the reactive losses using DGs on distribution networks. This method analyzes the problem using the IEEE 13-node test feeder with three different loads and the IEEE 123-node test feeder with four DGs. The DGs can be fixed or variables. Results indicate that integration of DGs to optimize the reactive power of the network helps to maintain the voltage within the allowed limits and to reduce the reactive power losses. The thesis is presented in the form of the three articles. The first article is published in the journal Electrical Power and Energy System, the second is published in the international journal Energies and the third was submitted to the journal Electrical Power and Energy System. Two other articles have been published in conferences with reviewing committee. This work is based on six chapters, which are detailed in the various sections of the thesis.

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

Feed Forward Neural Network and Optimal Control Problem with Control and State Constraints

NASA Astrophysics Data System (ADS)

Kmet', Tibor; Kmet'ová, Mária

2009-09-01

A feed forward neural network based optimal control synthesis is presented for solving optimal control problems with control and state constraints. The paper extends adaptive critic neural network architecture proposed by [5] to the optimal control problems with control and state constraints. The optimal control problem is transcribed into a nonlinear programming problem which is implemented with adaptive critic neural network. The proposed simulation method is illustrated by the optimal control problem of nitrogen transformation cycle model. Results show that adaptive critic based systematic approach holds promise for obtaining the optimal control with control and state constraints.

Estimation of Blood Flow Rates in Large Microvascular Networks

PubMed Central

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

2012-01-01

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

Optimal orientation in flows: providing a benchmark for animal movement strategies.

PubMed

McLaren, James D; Shamoun-Baranes, Judy; Dokter, Adriaan M; Klaassen, Raymond H G; Bouten, Willem

2014-10-06

Animal movements in air and water can be strongly affected by experienced flow. While various flow-orientation strategies have been proposed and observed, their performance in variable flow conditions remains unclear. We apply control theory to establish a benchmark for time-minimizing (optimal) orientation. We then define optimal orientation for movement in steady flow patterns and, using dynamic wind data, for short-distance mass movements of thrushes (Turdus sp.) and 6000 km non-stop migratory flights by great snipes, Gallinago media. Relative to the optimal benchmark, we assess the efficiency (travel speed) and reliability (success rate) of three generic orientation strategies: full compensation for lateral drift, vector orientation (single-heading movement) and goal orientation (continually heading towards the goal). Optimal orientation is characterized by detours to regions of high flow support, especially when flow speeds approach and exceed the animal's self-propelled speed. In strong predictable flow (short distance thrush flights), vector orientation adjusted to flow on departure is nearly optimal, whereas for unpredictable flow (inter-continental snipe flights), only goal orientation was near-optimally reliable and efficient. Optimal orientation provides a benchmark for assessing efficiency of responses to complex flow conditions, thereby offering insight into adaptive flow-orientation across taxa in the light of flow strength, predictability and navigation capacity.

Optimal orientation in flows: providing a benchmark for animal movement strategies

PubMed Central

McLaren, James D.; Shamoun-Baranes, Judy; Dokter, Adriaan M.; Klaassen, Raymond H. G.; Bouten, Willem

2014-01-01

Animal movements in air and water can be strongly affected by experienced flow. While various flow-orientation strategies have been proposed and observed, their performance in variable flow conditions remains unclear. We apply control theory to establish a benchmark for time-minimizing (optimal) orientation. We then define optimal orientation for movement in steady flow patterns and, using dynamic wind data, for short-distance mass movements of thrushes (Turdus sp.) and 6000 km non-stop migratory flights by great snipes, Gallinago media. Relative to the optimal benchmark, we assess the efficiency (travel speed) and reliability (success rate) of three generic orientation strategies: full compensation for lateral drift, vector orientation (single-heading movement) and goal orientation (continually heading towards the goal). Optimal orientation is characterized by detours to regions of high flow support, especially when flow speeds approach and exceed the animal's self-propelled speed. In strong predictable flow (short distance thrush flights), vector orientation adjusted to flow on departure is nearly optimal, whereas for unpredictable flow (inter-continental snipe flights), only goal orientation was near-optimally reliable and efficient. Optimal orientation provides a benchmark for assessing efficiency of responses to complex flow conditions, thereby offering insight into adaptive flow-orientation across taxa in the light of flow strength, predictability and navigation capacity. PMID:25056213

A Petri Net model for distributed energy system

NASA Astrophysics Data System (ADS)

Konopko, Joanna

2015-12-01

Electrical networks need to evolve to become more intelligent, more flexible and less costly. The smart grid is the next generation power energy, uses two-way flows of electricity and information to create a distributed automated energy delivery network. Building a comprehensive smart grid is a challenge for system protection, optimization and energy efficient. Proper modeling and analysis is needed to build an extensive distributed energy system and intelligent electricity infrastructure. In this paper, the whole model of smart grid have been proposed using Generalized Stochastic Petri Nets (GSPN). The simulation of created model is also explored. The simulation of the model has allowed the analysis of how close the behavior of the model is to the usage of the real smart grid.

Algorithm Optimally Orders Forward-Chaining Inference Rules

NASA Technical Reports Server (NTRS)

James, Mark

2008-01-01

People typically develop knowledge bases in a somewhat ad hoc manner by incrementally adding rules with no specific organization. This often results in a very inefficient execution of those rules since they are so often order sensitive. This is relevant to tasks like Deep Space Network in that it allows the knowledge base to be incrementally developed and have it automatically ordered for efficiency. Although data flow analysis was first developed for use in compilers for producing optimal code sequences, its usefulness is now recognized in many software systems including knowledge-based systems. However, this approach for exhaustively computing data-flow information cannot directly be applied to inference systems because of the ubiquitous execution of the rules. An algorithm is presented that efficiently performs a complete producer/consumer analysis for each antecedent and consequence clause in a knowledge base to optimally order the rules to minimize inference cycles. An algorithm was developed that optimally orders a knowledge base composed of forwarding chaining inference rules such that independent inference cycle executions are minimized, thus, resulting in significantly faster execution. This algorithm was integrated into the JPL tool Spacecraft Health Inference Engine (SHINE) for verification and it resulted in a significant reduction in inference cycles for what was previously considered an ordered knowledge base. For a knowledge base that is completely unordered, then the improvement is much greater.

Performance improvement of optical CDMA networks with stochastic artificial bee colony optimization technique

NASA Astrophysics Data System (ADS)

Panda, Satyasen

2018-05-01

This paper proposes a modified artificial bee colony optimization (ABC) algorithm based on levy flight swarm intelligence referred as artificial bee colony levy flight stochastic walk (ABC-LFSW) optimization for optical code division multiple access (OCDMA) network. The ABC-LFSW algorithm is used to solve asset assignment problem based on signal to noise ratio (SNR) optimization in OCDM networks with quality of service constraints. The proposed optimization using ABC-LFSW algorithm provides methods for minimizing various noises and interferences, regulating the transmitted power and optimizing the network design for improving the power efficiency of the optical code path (OCP) from source node to destination node. In this regard, an optical system model is proposed for improving the network performance with optimized input parameters. The detailed discussion and simulation results based on transmitted power allocation and power efficiency of OCPs are included. The experimental results prove the superiority of the proposed network in terms of power efficiency and spectral efficiency in comparison to networks without any power allocation approach.

Research on robust optimization of emergency logistics network considering the time dependence characteristic

NASA Astrophysics Data System (ADS)

WANG, Qingrong; ZHU, Changfeng; LI, Ying; ZHANG, Zhengkun

2017-06-01

Considering the time dependence of emergency logistic network and complexity of the environment that the network exists in, in this paper the time dependent network optimization theory and robust discrete optimization theory are combined, and the emergency logistics dynamic network optimization model with characteristics of robustness is built to maximize the timeliness of emergency logistics. On this basis, considering the complexity of dynamic network and the time dependence of edge weight, an improved ant colony algorithm is proposed to realize the coupling of the optimization algorithm and the network time dependence and robustness. Finally, a case study has been carried out in order to testify validity of this robustness optimization model and its algorithm, and the value of different regulation factors was analyzed considering the importance of the value of the control factor in solving the optimal path. Analysis results show that this model and its algorithm above-mentioned have good timeliness and strong robustness.

Online Learning of Genetic Network Programming and its Application to Prisoner’s Dilemma Game

NASA Astrophysics Data System (ADS)

Mabu, Shingo; Hirasawa, Kotaro; Hu, Jinglu; Murata, Junichi

A new evolutionary model with the network structure named Genetic Network Programming (GNP) has been proposed recently. GNP, that is, an expansion of GA and GP, represents solutions as a network structure and evolves it by using “offline learning (selection, mutation, crossover)”. GNP can memorize the past action sequences in the network flow, so it can deal with Partially Observable Markov Decision Process (POMDP) well. In this paper, in order to improve the ability of GNP, Q learning (an off-policy TD control algorithm) that is one of the famous online methods is introduced for online learning of GNP. Q learning is suitable for GNP because (1) in reinforcement learning, the rewards an agent will get in the future can be estimated, (2) TD control doesn’t need much memory and can learn quickly, and (3) off-policy is suitable in order to search for an optimal solution independently of the policy. Finally, in the simulations, online learning of GNP is applied to a player for “Prisoner’s dilemma game” and its ability for online adaptation is confirmed.

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

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

Dall'Anese, Emiliano

Past works that focused on addressing power-quality and reliability concerns related to renewable energy resources (RESs) operating with business-as-usual practices have looked at the design of Volt/VAr and Volt/Watt strategies to regulate real or reactive powers based on local voltage measurements, so that terminal voltages are within acceptable levels. These control strategies have the potential of operating at the same time scale of distribution-system dynamics, and can therefore mitigate disturbances precipitated fast time-varying loads and ambient conditions; however, they do not necessarily guarantee system-level optimality, and stability claims are mainly based on empirical evidences. On a different time scale, centralizedmore » and distributed optimal power flow (OPF) algorithms have been proposed to compute optimal steady-state inverter setpoints, so that power losses and voltage deviations are minimized and economic benefits to end-users providing ancillary services are maximized. However, traditional OPF schemes may offer decision making capabilities that do not match the dynamics of distribution systems. Particularly, during the time required to collect data from all the nodes of the network (e.g., loads), solve the OPF, and subsequently dispatch setpoints, the underlying load, ambient, and network conditions may have already changed; in this case, the DER output powers would be consistently regulated around outdated setpoints, leading to suboptimal system operation and violation of relevant electrical limits. The present work focuses on the synthesis of distributed RES-inverter controllers that leverage the opportunities for fast feedback offered by power-electronics interfaced RESs. The overarching objective is to bridge the temporal gap between long-term system optimization and real-time control, to enable seamless RES integration in large scale with stability and efficiency guarantees, while congruently pursuing system-level optimization objectives. The design of the control framework is based on suitable linear approximations of the AC power-flow equations as well as Lagrangian regularization methods. The proposed controllers enable an update of the power outputs at a time scale that is compatible with the underlying dynamics of loads and ambient conditions, and continuously drive the system operation towards OPF-based solutions.« less

Optimal percolation on multiplex networks.

PubMed

Osat, Saeed; Faqeeh, Ali; Radicchi, Filippo

2017-11-16

Optimal percolation is the problem of finding the minimal set of nodes whose removal from a network fragments the system into non-extensive disconnected clusters. The solution to this problem is important for strategies of immunization in disease spreading, and influence maximization in opinion dynamics. Optimal percolation has received considerable attention in the context of isolated networks. However, its generalization to multiplex networks has not yet been considered. Here we show that approximating the solution of the optimal percolation problem on a multiplex network with solutions valid for single-layer networks extracted from the multiplex may have serious consequences in the characterization of the true robustness of the system. We reach this conclusion by extending many of the methods for finding approximate solutions of the optimal percolation problem from single-layer to multiplex networks, and performing a systematic analysis on synthetic and real-world multiplex networks.

A One-Layer Recurrent Neural Network for Real-Time Portfolio Optimization With Probability Criterion.

PubMed

Liu, Qingshan; Dang, Chuangyin; Huang, Tingwen

2013-02-01

This paper presents a decision-making model described by a recurrent neural network for dynamic portfolio optimization. The portfolio-optimization problem is first converted into a constrained fractional programming problem. Since the objective function in the programming problem is not convex, the traditional optimization techniques are no longer applicable for solving this problem. Fortunately, the objective function in the fractional programming is pseudoconvex on the feasible region. It leads to a one-layer recurrent neural network modeled by means of a discontinuous dynamic system. To ensure the optimal solutions for portfolio optimization, the convergence of the proposed neural network is analyzed and proved. In fact, the neural network guarantees to get the optimal solutions for portfolio-investment advice if some mild conditions are satisfied. A numerical example with simulation results substantiates the effectiveness and illustrates the characteristics of the proposed neural network.

A generic methodology for the optimisation of sewer systems using stochastic programming and self-optimizing control.

PubMed

Mauricio-Iglesias, Miguel; Montero-Castro, Ignacio; Mollerup, Ane L; Sin, Gürkan

2015-05-15

The design of sewer system control is a complex task given the large size of the sewer networks, the transient dynamics of the water flow and the stochastic nature of rainfall. This contribution presents a generic methodology for the design of a self-optimising controller in sewer systems. Such controller is aimed at keeping the system close to the optimal performance, thanks to an optimal selection of controlled variables. The definition of an optimal performance was carried out by a two-stage optimisation (stochastic and deterministic) to take into account both the overflow during the current rain event as well as the expected overflow given the probability of a future rain event. The methodology is successfully applied to design an optimising control strategy for a subcatchment area in Copenhagen. The results are promising and expected to contribute to the advance of the operation and control problem of sewer systems. Copyright © 2015 Elsevier Ltd. All rights reserved.

Blood pressure long term regulation: A neural network model of the set point development

PubMed Central

2011-01-01

Background The notion of the nucleus tractus solitarius (NTS) as a comparator evaluating the error signal between its rostral neural structures (RNS) and the cardiovascular receptor afferents into it has been recently presented. From this perspective, stress can cause hypertension via set point changes, so offering an answer to an old question. Even though the local blood flow to tissues is influenced by circulating vasoactive hormones and also by local factors, there is yet significant sympathetic control. It is well established that the state of maturation of sympathetic innervation of blood vessels at birth varies across animal species and it takes place mostly during the postnatal period. During ontogeny, chemoreceptors are functional; they discharge when the partial pressures of oxygen and carbon dioxide in the arterial blood are not normal. Methods The model is a simple biological plausible adaptative neural network to simulate the development of the sympathetic nervous control. It is hypothesized that during ontogeny, from the RNS afferents to the NTS, the optimal level of each sympathetic efferent discharge is learned through the chemoreceptors' feedback. Its mean discharge leads to normal oxygen and carbon dioxide levels in each tissue. Thus, the sympathetic efferent discharge sets at the optimal level if, despite maximal drift, the local blood flow is compensated for by autoregulation. Such optimal level produces minimum chemoreceptor output, which must be maintained by the nervous system. Since blood flow is controlled by arterial blood pressure, the long-term mean level is stabilized to regulate oxygen and carbon dioxide levels. After development, the cardiopulmonary reflexes play an important role in controlling efferent sympathetic nerve activity to the kidneys and modulating sodium and water excretion. Results Starting from fixed RNS afferents to the NTS and random synaptic weight values, the sympathetic efferents converged to the optimal values. When learning was completed, the output from the chemoreceptors became zero because the sympathetic efferents led to normal partial pressures of oxygen and carbon dioxide. Conclusions We introduce here a simple simulating computational theory to study, from a neurophysiologic point of view, the sympathetic development of cardiovascular regulation due to feedback signals sent off by cardiovascular receptors. The model simulates, too, how the NTS, as emergent property, acts as a comparator and how its rostral afferents behave as set point. PMID:21693057

Marginal Loss Calculations for the DCOPF

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

Eldridge, Brent; O'Neill, Richard P.; Castillo, Andrea R.

2016-12-05

The purpose of this paper is to explain some aspects of including a marginal line loss approximation in the DCOPF. The DCOPF optimizes electric generator dispatch using simplified power flow physics. Since the standard assumptions in the DCOPF include a lossless network, a number of modifications have to be added to the model. Calculating marginal losses allows the DCOPF to optimize the location of power generation, so that generators that are closer to demand centers are relatively cheaper than remote generation. The problem formulations discussed in this paper will simplify many aspects of practical electric dispatch implementations in use today,more » but will include sufficient detail to demonstrate a few points with regard to the handling of losses.« less

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.

Global case management: Scotland. Real-time monitoring of patient flow as an instrument to optimize quality of care in acute receiving units.

PubMed

Thuemmler, Christoph; Morris, Carole

2005-01-01

Recent audits within our hospital suggest that especially during peak phases the patient flow from our acute admission units downstream into hospital beds is not directed in the most efficient way and patients may be placed inappropriately. This inevitably causes time delays and potentially increases the risk of malpractice as patients have to spend an extended period of time in admission areas with a high workload and very busy staff. Using latest information technology, such as wireless local area networks and handheld devices, can improve the efficiency of patient management and can increase the quality of care by helping to avoid unnecessary treatment delays in overcrowded admission areas.

RIACS

NASA Technical Reports Server (NTRS)

Oliger, Joseph

1997-01-01

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

Performance study of a data flow architecture

NASA Technical Reports Server (NTRS)

Adams, George

1985-01-01

Teams of scientists studied data flow concepts, static data flow machine architecture, and the VAL language. Each team mapped its application onto the machine and coded it in VAL. The principal findings of the study were: (1) Five of the seven applications used the full power of the target machine. The galactic simulation and multigrid fluid flow teams found that a significantly smaller version of the machine (16 processing elements) would suffice. (2) A number of machine design parameters including processing element (PE) function unit numbers, array memory size and bandwidth, and routing network capability were found to be crucial for optimal machine performance. (3) The study participants readily acquired VAL programming skills. (4) Participants learned that application-based performance evaluation is a sound method of evaluating new computer architectures, even those that are not fully specified. During the course of the study, participants developed models for using computers to solve numerical problems and for evaluating new architectures. These models form the bases for future evaluation studies.

A parallel adaptive quantum genetic algorithm for the controllability of arbitrary networks.

PubMed

Li, Yuhong; Gong, Guanghong; Li, Ni

2018-01-01

In this paper, we propose a novel algorithm-parallel adaptive quantum genetic algorithm-which can rapidly determine the minimum control nodes of arbitrary networks with both control nodes and state nodes. The corresponding network can be fully controlled with the obtained control scheme. We transformed the network controllability issue into a combinational optimization problem based on the Popov-Belevitch-Hautus rank condition. A set of canonical networks and a list of real-world networks were experimented. Comparison results demonstrated that the algorithm was more ideal to optimize the controllability of networks, especially those larger-size networks. We demonstrated subsequently that there were links between the optimal control nodes and some network statistical characteristics. The proposed algorithm provides an effective approach to improve the controllability optimization of large networks or even extra-large networks with hundreds of thousands nodes.

78 FR 57845 - Notice of Availability (NOA) for Strategic Network Optimization (SNO) Program Environmental...

Federal Register 2010, 2011, 2012, 2013, 2014

2013-09-20

... (NOA) for Strategic Network Optimization (SNO) Program Environmental Assessment AGENCY: Defense Logistics Agency, DoD. ACTION: Notice of Availability (NOA) for Strategic Network Optimization (SNO) Program... implement the SNO initiative for improvements to material distribution network for the Department of Defense...

Coordinated and uncoordinated optimization of networks

NASA Astrophysics Data System (ADS)

Brede, Markus

2010-06-01

In this paper, we consider spatial networks that realize a balance between an infrastructure cost (the cost of wire needed to connect the network in space) and communication efficiency, measured by average shortest path length. A global optimization procedure yields network topologies in which this balance is optimized. These are compared with network topologies generated by a competitive process in which each node strives to optimize its own cost-communication balance. Three phases are observed in globally optimal configurations for different cost-communication trade offs: (i) regular small worlds, (ii) starlike networks, and (iii) trees with a center of interconnected hubs. In the latter regime, i.e., for very expensive wire, power laws in the link length distributions P(w)∝w-α are found, which can be explained by a hierarchical organization of the networks. In contrast, in the local optimization process the presence of sharp transitions between different network regimes depends on the dimension of the underlying space. Whereas for d=∞ sharp transitions between fully connected networks, regular small worlds, and highly cliquish periphery-core networks are found, for d=1 sharp transitions are absent and the power law behavior in the link length distribution persists over a much wider range of link cost parameters. The measured power law exponents are in agreement with the hypothesis that the locally optimized networks consist of multiple overlapping suboptimal hierarchical trees.

Energy optimization in mobile sensor networks

NASA Astrophysics Data System (ADS)

Yu, Shengwei

Mobile sensor networks are considered to consist of a network of mobile robots, each of which has computation, communication and sensing capabilities. Energy efficiency is a critical issue in mobile sensor networks, especially when mobility (i.e., locomotion control), routing (i.e., communications) and sensing are unique characteristics of mobile robots for energy optimization. This thesis focuses on the problem of energy optimization of mobile robotic sensor networks, and the research results can be extended to energy optimization of a network of mobile robots that monitors the environment, or a team of mobile robots that transports materials from stations to stations in a manufacturing environment. On the energy optimization of mobile robotic sensor networks, our research focuses on the investigation and development of distributed optimization algorithms to exploit the mobility of robotic sensor nodes for network lifetime maximization. In particular, the thesis studies these five problems: 1. Network-lifetime maximization by controlling positions of networked mobile sensor robots based on local information with distributed optimization algorithms; 2. Lifetime maximization of mobile sensor networks with energy harvesting modules; 3. Lifetime maximization using joint design of mobility and routing; 4. Optimal control for network energy minimization; 5. Network lifetime maximization in mobile visual sensor networks. In addressing the first problem, we consider only the mobility strategies of the robotic relay nodes in a mobile sensor network in order to maximize its network lifetime. By using variable substitutions, the original problem is converted into a convex problem, and a variant of the sub-gradient method for saddle-point computation is developed for solving this problem. An optimal solution is obtained by the method. Computer simulations show that mobility of robotic sensors can significantly prolong the lifetime of the whole robotic sensor network while consuming negligible amount of energy for mobility cost. For the second problem, the problem is extended to accommodate mobile robotic nodes with energy harvesting capability, which makes it a non-convex optimization problem. The non-convexity issue is tackled by using the existing sequential convex approximation method, based on which we propose a novel procedure of modified sequential convex approximation that has fast convergence speed. For the third problem, the proposed procedure is used to solve another challenging non-convex problem, which results in utilizing mobility and routing simultaneously in mobile robotic sensor networks to prolong the network lifetime. The results indicate that joint design of mobility and routing has an edge over other methods in prolonging network lifetime, which is also the justification for the use of mobility in mobile sensor networks for energy efficiency purpose. For the fourth problem, we include the dynamics of the robotic nodes in the problem by modeling the networked robotic system using hybrid systems theory. A novel distributed method for the networked hybrid system is used to solve the optimal moving trajectories for robotic nodes and optimal network links, which are not answered by previous approaches. Finally, the fact that mobility is more effective in prolonging network lifetime for a data-intensive network leads us to apply our methods to study mobile visual sensor networks, which are useful in many applications. We investigate the joint design of mobility, data routing, and encoding power to help improving the video quality while maximizing the network lifetime. This study leads to a better understanding of the role mobility can play in data-intensive surveillance sensor networks.

Application of the PROMETHEE technique to determine depression outlet location and flow direction in DEM

NASA Astrophysics Data System (ADS)

Chou, Tien-Yin; Lin, Wen-Tzu; Lin, Chao-Yuan; Chou, Wen-Chieh; Huang, Pi-Hui

2004-02-01

With the fast growing progress of computer technologies, spatial information on watersheds such as flow direction, watershed boundaries and the drainage network can be automatically calculated or extracted from a digital elevation model (DEM). The stubborn problem that depressions exist in DEMs has been frequently encountered while extracting the spatial information of terrain. Several filling-up methods have been proposed for solving depressions. However, their suitability for large-scale flat areas is inadequate. This study proposes a depression watershed method coupled with the Preference Ranking Organization METHod for Enrichment Evaluations (PROMETHEEs) theory to determine the optimal outlet and calculate the flow direction in depressions. Three processing procedures are used to derive the depressionless flow direction: (1) calculating the incipient flow direction; (2) establishing the depression watershed by tracing the upstream drainage area and determining the depression outlet using PROMETHEE theory; (3) calculating the depressionless flow direction. The developed method was used to delineate the Shihmen Reservoir watershed located in Northern Taiwan. The results show that the depression watershed method can effectively solve the shortcomings such as depression outlet differentiating and looped flow direction between depressions. The suitability of the proposed approach was verified.

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.

Toward the Limits of Uniformity of Mixed Metallicity SWCNT TFT Arrays with Spark-Synthesized and Surface-Density-Controlled Nanotube Networks.

PubMed

Kaskela, Antti; Mustonen, Kimmo; Laiho, Patrik; Ohno, Yutaka; Kauppinen, Esko I

2015-12-30

We report the fabrication of thin film transistors (TFTs) from networks of nonbundled single-walled carbon nanotubes with controlled surface densities. Individual nanotubes were synthesized by using a spark generator-based floating catalyst CVD process. High uniformity and the control of SWCNT surface density were realized by mixing of the SWCNT aerosol in a turbulent flow mixer and monitoring the online number concentration with a condensation particle counter at the reactor outlet in real time. The networks consist of predominantly nonbundled SWCNTs with diameters of 1.0-1.3 nm, mean length of 3.97 μm, and metallic to semiconducting tube ratio of 1:2. The ON/OFF ratio and charge carrier mobility of SWCNT TFTs were simultaneously optimized through fabrication of devices with SWCNT surface densities ranging from 0.36 to 1.8 μm(-2) and channel lengths and widths from 5 to 100 μm and from 100 to 500 μm, respectively. The density optimized TFTs exhibited excellent performance figures with charge carrier mobilities up to 100 cm(2) V(-1) s(-1) and ON/OFF current ratios exceeding 1 × 10(6), combined with high uniformity and more than 99% of devices working as theoretically expected.

Non-dimensional physics of pulsatile cardiovascular networks and energy efficiency.

PubMed

Yigit, Berk; Pekkan, Kerem

2016-01-01

In Nature, there exist a variety of cardiovascular circulation networks in which the energetic ventricular load has both steady and pulsatile components. Steady load is related to the mean cardiac output (CO) and the haemodynamic resistance of the peripheral vascular system. On the other hand, the pulsatile load is determined by the simultaneous pressure and flow waveforms at the ventricular outlet, which in turn are governed through arterial wave dynamics (transmission) and pulse decay characteristics (windkessel effect). Both the steady and pulsatile contributions of the haemodynamic power load are critical for characterizing/comparing disease states and for predicting the performance of cardiovascular devices. However, haemodynamic performance parameters vary significantly from subject to subject because of body size, heart rate and subject-specific CO. Therefore, a 'normalized' energy dissipation index, as a function of the 'non-dimensional' physical parameters that govern the circulation networks, is needed for comparative/integrative biological studies and clinical decision-making. In this paper, a complete network-independent non-dimensional formulation that incorporates pulsatile flow regimes is developed. Mechanical design variables of cardiovascular flow systems are identified and the Buckingham Pi theorem is formally applied to obtain the corresponding non-dimensional scaling parameter sets. Two scaling approaches are considered to address both the lumped parameter networks and the distributed circulation components. The validity of these non-dimensional number sets is tested extensively through the existing empirical allometric scaling laws of circulation systems. Additional validation studies are performed using a parametric numerical arterial model that represents the transmission and windkessel characteristics, which are adjusted to represent different body sizes and non-dimensional haemodynamic states. Simulations demonstrate that the proposed non-dimensional indices are independent of body size for healthy conditions, but are sensitive to deviations caused by off-design disease states that alter the energetic load. Sensitivity simulations are used to identify the relationship between pulsatile power loss and non-dimensional characteristics, and optimal operational states are computed. © 2016 The Author(s).

Application of Neural Network Optimized by Mind Evolutionary Computation in Building Energy Prediction

NASA Astrophysics Data System (ADS)

Song, Chen; Zhong-Cheng, Wu; Hong, Lv

2018-03-01

Building Energy forecasting plays an important role in energy management and plan. Using mind evolutionary algorithm to find the optimal network weights and threshold, to optimize the BP neural network, can overcome the problem of the BP neural network into a local minimum point. The optimized network is used for time series prediction, and the same month forecast, to get two predictive values. Then two kinds of predictive values are put into neural network, to get the final forecast value. The effectiveness of the method was verified by experiment with the energy value of three buildings in Hefei.

Thermodynamic characterization of synchronization-optimized oscillator networks

NASA Astrophysics Data System (ADS)

Yanagita, Tatsuo; Ichinomiya, Takashi

2014-12-01

We consider a canonical ensemble of synchronization-optimized networks of identical oscillators under external noise. By performing a Markov chain Monte Carlo simulation using the Kirchhoff index, i.e., the sum of the inverse eigenvalues of the Laplacian matrix (as a graph Hamiltonian of the network), we construct more than 1 000 different synchronization-optimized networks. We then show that the transition from star to core-periphery structure depends on the connectivity of the network, and is characterized by the node degree variance of the synchronization-optimized ensemble. We find that thermodynamic properties such as heat capacity show anomalies for sparse networks.

Application of experimental design for the optimization of artificial neural network-based water quality model: a case study of dissolved oxygen prediction.

PubMed

Šiljić Tomić, Aleksandra; Antanasijević, Davor; Ristić, Mirjana; Perić-Grujić, Aleksandra; Pocajt, Viktor

2018-04-01

This paper presents an application of experimental design for the optimization of artificial neural network (ANN) for the prediction of dissolved oxygen (DO) content in the Danube River. The aim of this research was to obtain a more reliable ANN model that uses fewer monitoring records, by simultaneous optimization of the following model parameters: number of monitoring sites, number of historical monitoring data (expressed in years), and number of input water quality parameters used. Box-Behnken three-factor at three levels experimental design was applied for simultaneous spatial, temporal, and input variables optimization of the ANN model. The prediction of DO was performed using a feed-forward back-propagation neural network (BPNN), while the selection of most important inputs was done off-model using multi-filter approach that combines a chi-square ranking in the first step with a correlation-based elimination in the second step. The contour plots of absolute and relative error response surfaces were utilized to determine the optimal values of design factors. From the contour plots, two BPNN models that cover entire Danube flow through Serbia are proposed: an upstream model (BPNN-UP) that covers 8 monitoring sites prior to Belgrade and uses 12 inputs measured in the 7-year period and a downstream model (BPNN-DOWN) which covers 9 monitoring sites and uses 11 input parameters measured in the 6-year period. The main difference between the two models is that BPNN-UP utilizes inputs such as BOD, P, and PO 4 3- , which is in accordance with the fact that this model covers northern part of Serbia (Vojvodina Autonomous Province) which is well-known for agricultural production and extensive use of fertilizers. Both models have shown very good agreement between measured and predicted DO (with R 2  ≥ 0.86) and demonstrated that they can effectively forecast DO content in the Danube River.

Technology, energy and the environment

NASA Astrophysics Data System (ADS)

Mitchell, Glenn Terry

This dissertation consists of three distinct papers concerned with technology, energy and the environment. The first paper is an empirical analysis of production under uncertainty, using agricultural production data from the central United States. Unlike previous work, this analysis identifies the effect of actual realizations of weather as well as farmers' expectations about weather. The results indicate that both of these are significant factors explaining short run profits in agriculture. Expectations about weather, called climate, affect production choices, and actual weather affects realized output. These results provide better understanding of the effect of climate change in agriculture. The second paper examines how emissions taxes induce innovation that reduces pollution. A polluting firm chooses technical improvement to minimize cost over an infinite horizon, given an emission tax set by a planner. This leads to a solution path for technical change. Changes in the tax rate affect the path for innovation. Setting the tax at equal to the marginal damage (which is optimal in a static setting with no technical change) is not optimal in the presence of technical change. When abatement is also available as an alternative to technical change, changes in the tax can have mixed effects, due to substitution effects. The third paper extends the theoretical framework for exploring the diffusion of new technologies. Information about new technologies spreads through the economy by means of a network. The pattern of diffusion will depend on the structure of this network. Observed networks are the result of an evolutionary process. This paper identifies how these evolutionary outcomes compare with optimal solutions. The conditions guaranteeing convergence to an optimal outcome are quite stringent. It is useful to determine the set of initial population states that do converge to an optimal outcome. The distribution of costs and benefits among the agents within an information processing structure plays a critical role in defining this set. These distributional arrangements represent alternative institutional regimes. Institutional changes can improve outcomes, free the flow of information, and encourage the diffusion of profitable new technologies.

Dynamic Flow Management Problems in Air Transportation

NASA Technical Reports Server (NTRS)

Patterson, Sarah Stock

1997-01-01

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

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.

Wireless Sensor Network Optimization: Multi-Objective Paradigm.

PubMed

Iqbal, Muhammad; Naeem, Muhammad; Anpalagan, Alagan; Ahmed, Ashfaq; Azam, Muhammad

2015-07-20

Optimization problems relating to wireless sensor network planning, design, deployment and operation often give rise to multi-objective optimization formulations where multiple desirable objectives compete with each other and the decision maker has to select one of the tradeoff solutions. These multiple objectives may or may not conflict with each other. Keeping in view the nature of the application, the sensing scenario and input/output of the problem, the type of optimization problem changes. To address different nature of optimization problems relating to wireless sensor network design, deployment, operation, planing and placement, there exist a plethora of optimization solution types. We review and analyze different desirable objectives to show whether they conflict with each other, support each other or they are design dependent. We also present a generic multi-objective optimization problem relating to wireless sensor network which consists of input variables, required output, objectives and constraints. A list of constraints is also presented to give an overview of different constraints which are considered while formulating the optimization problems in wireless sensor networks. Keeping in view the multi facet coverage of this article relating to multi-objective optimization, this will open up new avenues of research in the area of multi-objective optimization relating to wireless sensor networks.

Performance evaluation of time-aware enhanced software defined networking (TeSDN) for elastic data center optical interconnection.

PubMed

Yang, Hui; Zhang, Jie; Zhao, Yongli; Ji, Yuefeng; Li, Hui; Lin, Yi; Li, Gang; Han, Jianrui; Lee, Young; Ma, Teng

2014-07-28

Data center interconnection with elastic optical networks is a promising scenario to meet the high burstiness and high-bandwidth requirements of data center services. We previously implemented enhanced software defined networking over elastic optical network for data center application [Opt. Express 21, 26990 (2013)]. On the basis of it, this study extends to consider the time-aware data center service scheduling with elastic service time and service bandwidth according to the various time sensitivity requirements. A novel time-aware enhanced software defined networking (TeSDN) architecture for elastic data center optical interconnection has been proposed in this paper, by introducing a time-aware resources scheduling (TaRS) scheme. The TeSDN can accommodate the data center services with required QoS considering the time dimensionality, and enhance cross stratum optimization of application and elastic optical network stratums resources based on spectrum elasticity, application elasticity and time elasticity. The overall feasibility and efficiency of the proposed architecture is experimentally verified on our OpenFlow-based testbed. The performance of TaRS scheme under heavy traffic load scenario is also quantitatively evaluated based on TeSDN architecture in terms of blocking probability and resource occupation rate.

Key role of coupling, delay, and noise in resting brain fluctuations

PubMed Central

Deco, Gustavo; Jirsa, Viktor; McIntosh, A. R.; Sporns, Olaf; Kötter, Rolf

2009-01-01

A growing body of neuroimaging research has documented that, in the absence of an explicit task, the brain shows temporally coherent activity. This so-called “resting state” activity or, more explicitly, the default-mode network, has been associated with daydreaming, free association, stream of consciousness, or inner rehearsal in humans, but similar patterns have also been found under anesthesia and in monkeys. Spatiotemporal activity patterns in the default-mode network are both complex and consistent, which raises the question whether they are the expression of an interesting cognitive architecture or the consequence of intrinsic network constraints. In numerical simulation, we studied the dynamics of a simplified cortical network using 38 noise-driven (Wilson–Cowan) oscillators, which in isolation remain just below their oscillatory threshold. Time delay coupling based on lengths and strengths of primate corticocortical pathways leads to the emergence of 2 sets of 40-Hz oscillators. The sets showed synchronization that was anticorrelated at <0.1 Hz across the sets in line with a wide range of recent experimental observations. Systematic variation of conduction velocity, coupling strength, and noise level indicate a high sensitivity of emerging synchrony as well as simulated blood flow blood oxygen level-dependent (BOLD) on the underlying parameter values. Optimal sensitivity was observed around conduction velocities of 1–2 m/s, with very weak coupling between oscillators. An additional finding was that the optimal noise level had a characteristic scale, indicating the presence of stochastic resonance, which allows the network dynamics to respond with high sensitivity to changes in diffuse feedback activity. PMID:19497858