Convergence and approximate calculation of average degree under different network sizes for decreasing random birth-and-death networks

NASA Astrophysics Data System (ADS)

Long, Yin; Zhang, Xiao-Jun; Wang, Kui

2018-05-01

In this paper, convergence and approximate calculation of average degree under different network sizes for decreasing random birth-and-death networks (RBDNs) are studied. First, we find and demonstrate that the average degree is convergent in the form of power law. Meanwhile, we discover that the ratios of the back items to front items of convergent reminder are independent of network link number for large network size, and we theoretically prove that the limit of the ratio is a constant. Moreover, since it is difficult to calculate the analytical solution of the average degree for large network sizes, we adopt numerical method to obtain approximate expression of the average degree to approximate its analytical solution. Finally, simulations are presented to verify our theoretical results.

Almost periodic cellular neural networks with neutral-type proportional delays

NASA Astrophysics Data System (ADS)

Xiao, Songlin

2018-03-01

This paper presents a new result on the existence, uniqueness and generalised exponential stability of almost periodic solutions for cellular neural networks with neutral-type proportional delays and D operator. Based on some novel differential inequality techniques, a testable condition is derived to ensure that all the state trajectories of the system converge to an almost periodic solution with a positive exponential convergence rate. The effectiveness of the obtained result is illustrated by a numerical example.

Limit Theorems and Their Relation to Solute Transport in Simulated Fractured Media

NASA Astrophysics Data System (ADS)

Reeves, D. M.; Benson, D. A.; Meerschaert, M. M.

2003-12-01

Solute particles that travel through fracture networks are subject to wide velocity variations along a restricted set of directions. This may result in super-Fickian dispersion along a few primary scaling directions. The fractional advection-dispersion equation (FADE), a modification of the original advection-dispersion equation in which a fractional derivative replaces the integer-order dispersion term, has the ability to model rapid, non-Gaussian solute transport. The FADE assumes that solute particle motions converge to either α -stable or operator stable densities, which are modeled by spatial fractional derivatives. In multiple dimensions, the multi-fractional dispersion derivative dictates the order and weight of differentiation in all directions, which correspond to the statistics of large particle motions in all directions. This study numerically investigates the presence of super- Fickian solute transport through simulated two-dimensional fracture networks. An ensemble of networks is gen

Architectural and Mobility Management Designs in Internet-Based Infrastructure Wireless Mesh Networks

ERIC Educational Resources Information Center

Zhao, Weiyi

2011-01-01

Wireless mesh networks (WMNs) have recently emerged to be a cost-effective solution to support large-scale wireless Internet access. They have numerous applications, such as broadband Internet access, building automation, and intelligent transportation systems. One research challenge for Internet-based WMNs is to design efficient mobility…

Graph Theory-Based Technique for Isolating Corrupted Boundary Conditions in Continental-Scale River Network Hydrodynamic Simulation

NASA Astrophysics Data System (ADS)

Yu, C. W.; Hodges, B. R.; Liu, F.

2017-12-01

Development of continental-scale river network models creates challenges where the massive amount of boundary condition data encounters the sensitivity of a dynamic nu- merical model. The topographic data sets used to define the river channel characteristics may include either corrupt data or complex configurations that cause instabilities in a numerical solution of the Saint-Venant equations. For local-scale river models (e.g. HEC- RAS), modelers typically rely on past experience to make ad hoc boundary condition adjustments that ensure a stable solution - the proof of the adjustment is merely the sta- bility of the solution. To date, there do not exist any formal methodologies or automated procedures for a priori detecting/fixing boundary conditions that cause instabilities in a dynamic model. Formal methodologies for data screening and adjustment are a critical need for simulations with a large number of river reaches that draw their boundary con- dition data from a wide variety of sources. At the continental scale, we simply cannot assume that we will have access to river-channel cross-section data that has been ade- quately analyzed and processed. Herein, we argue that problematic boundary condition data for unsteady dynamic modeling can be identified through numerical modeling with the steady-state Saint-Venant equations. The fragility of numerical stability increases with the complexity of branching in river network system and instabilities (even in an unsteady solution) are typically triggered by the nonlinear advection term in Saint-Venant equations. It follows that the behavior of the simpler steady-state equations (which retain the nonlin- ear term) can be used to screen the boundary condition data for problematic regions. In this research, we propose a graph-theory based method to isolate the location of corrupted boundary condition data in a continental-scale river network and demonstrate its utility with a network of O(10^4) elements. Acknowledgement: This research is supported by the National Science Foundation un- der grant number CCF-1331610.

Shortest path problem on a grid network with unordered intermediate points

NASA Astrophysics Data System (ADS)

Saw, Veekeong; Rahman, Amirah; Eng Ong, Wen

2017-10-01

We consider a shortest path problem with single cost factor on a grid network with unordered intermediate points. A two stage heuristic algorithm is proposed to find a feasible solution path within a reasonable amount of time. To evaluate the performance of the proposed algorithm, computational experiments are performed on grid maps of varying size and number of intermediate points. Preliminary results for the problem are reported. Numerical comparisons against brute forcing show that the proposed algorithm consistently yields solutions that are within 10% of the optimal solution and uses significantly less computation time.

Numerical Aerodynamic Simulation (NAS)

NASA Technical Reports Server (NTRS)

Peterson, V. L.; Ballhaus, W. F., Jr.; Bailey, F. R.

1983-01-01

The history of the Numerical Aerodynamic Simulation Program, which is designed to provide a leading-edge capability to computational aerodynamicists, is traced back to its origin in 1975. Factors motivating its development and examples of solutions to successively refined forms of the governing equations are presented. The NAS Processing System Network and each of its eight subsystems are described in terms of function and initial performance goals. A proposed usage allocation policy is discussed and some initial problems being readied for solution on the NAS system are identified.

An Artificial Neural Networks Method for Solving Partial Differential Equations

NASA Astrophysics Data System (ADS)

Alharbi, Abir

2010-09-01

While there already exists many analytical and numerical techniques for solving PDEs, this paper introduces an approach using artificial neural networks. The approach consists of a technique developed by combining the standard numerical method, finite-difference, with the Hopfield neural network. The method is denoted Hopfield-finite-difference (HFD). The architecture of the nets, energy function, updating equations, and algorithms are developed for the method. The HFD method has been used successfully to approximate the solution of classical PDEs, such as the Wave, Heat, Poisson and the Diffusion equations, and on a system of PDEs. The software Matlab is used to obtain the results in both tabular and graphical form. The results are similar in terms of accuracy to those obtained by standard numerical methods. In terms of speed, the parallel nature of the Hopfield nets methods makes them easier to implement on fast parallel computers while some numerical methods need extra effort for parallelization.

Comment on high resolution simulations of cosmic strings. 1: Network evoloution

NASA Technical Reports Server (NTRS)

Turok, Neil; Albrecht, Andreas

1990-01-01

Comments are made on recent claims (Albrecht and Turok, 1989) regarding simulations of cosmic string evolution. Specially, it was claimed that results were dominated by a numerical artifact which rounds out kinks on a scale of the order of the correlation length on the network. This claim was based on an approximate analysis of an interpolation equation which is solved herein. The typical rounding scale is actually less than one fifth of the correlation length, and comparable with other numerical cutoffs. Results confirm previous estimates of numerical uncertainties, and show that the approximations poorly represent the real solutions to the interpolation equation.

A novel recurrent neural network with finite-time convergence for linear programming.

PubMed

Liu, Qingshan; Cao, Jinde; Chen, Guanrong

2010-11-01

In this letter, a novel recurrent neural network based on the gradient method is proposed for solving linear programming problems. Finite-time convergence of the proposed neural network is proved by using the Lyapunov method. Compared with the existing neural networks for linear programming, the proposed neural network is globally convergent to exact optimal solutions in finite time, which is remarkable and rare in the literature of neural networks for optimization. Some numerical examples are given to show the effectiveness and excellent performance of the new recurrent neural network.

Synchrony, waves and ripple in spatially coupled Kuramoto oscillators with Mexican hat connectivity.

PubMed

Heitmann, Stewart; Ermentrout, G Bard

2015-06-01

Spatiotemporal waves of synchronized activity are known to arise in oscillatory neural networks with lateral inhibitory coupling. How such patterns respond to dynamic changes in coupling strength is largely unexplored. The present study uses analysis and simulation to investigate the evolution of wave patterns when the strength of lateral inhibition is varied dynamically. Neural synchronization was modeled by a spatial ring of Kuramoto oscillators with Mexican hat lateral coupling. Broad bands of coexisting stable wave solutions were observed at all levels of inhibition. The stability of these waves was formally analyzed in both the infinite ring and the finite ring. The broad range of multi-stability predicted hysteresis in transitions between neighboring wave solutions when inhibition is slowly varied. Numerical simulation confirmed the predicted transitions when inhibition was ramped down from a high initial value. However, non-wave solutions emerged from the uniform solution when inhibition was ramped upward from zero. These solutions correspond to spatially periodic deviations of phase that we call ripple states. Numerical continuation showed that stable ripple states emerge from synchrony via a supercritical pitchfork bifurcation. The normal form of this bifurcation was derived analytically, and its predictions compared against the numerical results. Ripple states were also found to bifurcate from wave solutions, but these were locally unstable. Simulation also confirmed the existence of hysteresis and ripple states in two spatial dimensions. Our findings show that spatial synchronization patterns can remain structurally stable despite substantial changes in network connectivity.

Localized states in an unbounded neural field equation with smooth firing rate function: a multi-parameter analysis.

PubMed

Faye, Grégory; Rankin, James; Chossat, Pascal

2013-05-01

The existence of spatially localized solutions in neural networks is an important topic in neuroscience as these solutions are considered to characterize working (short-term) memory. We work with an unbounded neural network represented by the neural field equation with smooth firing rate function and a wizard hat spatial connectivity. Noting that stationary solutions of our neural field equation are equivalent to homoclinic orbits in a related fourth order ordinary differential equation, we apply normal form theory for a reversible Hopf bifurcation to prove the existence of localized solutions; further, we present results concerning their stability. Numerical continuation is used to compute branches of localized solution that exhibit snaking-type behaviour. We describe in terms of three parameters the exact regions for which localized solutions persist.

Reducing neural network training time with parallel processing

NASA Technical Reports Server (NTRS)

Rogers, James L., Jr.; Lamarsh, William J., II

1995-01-01

Obtaining optimal solutions for engineering design problems is often expensive because the process typically requires numerous iterations involving analysis and optimization programs. Previous research has shown that a near optimum solution can be obtained in less time by simulating a slow, expensive analysis with a fast, inexpensive neural network. A new approach has been developed to further reduce this time. This approach decomposes a large neural network into many smaller neural networks that can be trained in parallel. Guidelines are developed to avoid some of the pitfalls when training smaller neural networks in parallel. These guidelines allow the engineer: to determine the number of nodes on the hidden layer of the smaller neural networks; to choose the initial training weights; and to select a network configuration that will capture the interactions among the smaller neural networks. This paper presents results describing how these guidelines are developed.

Harmony search optimization algorithm for a novel transportation problem in a consolidation network

NASA Astrophysics Data System (ADS)

Davod Hosseini, Seyed; Akbarpour Shirazi, Mohsen; Taghi Fatemi Ghomi, Seyed Mohammad

2014-11-01

This article presents a new harmony search optimization algorithm to solve a novel integer programming model developed for a consolidation network. In this network, a set of vehicles is used to transport goods from suppliers to their corresponding customers via two transportation systems: direct shipment and milk run logistics. The objective of this problem is to minimize the total shipping cost in the network, so it tries to reduce the number of required vehicles using an efficient vehicle routing strategy in the solution approach. Solving several numerical examples confirms that the proposed solution approach based on the harmony search algorithm performs much better than CPLEX in reducing both the shipping cost in the network and computational time requirement, especially for realistic size problem instances.

Energy-Efficient Cognitive Radio Sensor Networks: Parametric and Convex Transformations

PubMed Central

Naeem, Muhammad; Illanko, Kandasamy; Karmokar, Ashok; Anpalagan, Alagan; Jaseemuddin, Muhammad

2013-01-01

Designing energy-efficient cognitive radio sensor networks is important to intelligently use battery energy and to maximize the sensor network life. In this paper, the problem of determining the power allocation that maximizes the energy-efficiency of cognitive radio-based wireless sensor networks is formed as a constrained optimization problem, where the objective function is the ratio of network throughput and the network power. The proposed constrained optimization problem belongs to a class of nonlinear fractional programming problems. Charnes-Cooper Transformation is used to transform the nonlinear fractional problem into an equivalent concave optimization problem. The structure of the power allocation policy for the transformed concave problem is found to be of a water-filling type. The problem is also transformed into a parametric form for which a ε-optimal iterative solution exists. The convergence of the iterative algorithms is proven, and numerical solutions are presented. The iterative solutions are compared with the optimal solution obtained from the transformed concave problem, and the effects of different system parameters (interference threshold level, the number of primary users and secondary sensor nodes) on the performance of the proposed algorithms are investigated. PMID:23966194

Coordinated Platoon Routing in a Metropolitan Network

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

Larson, Jeffrey; Munson, Todd; Sokolov, Vadim

2016-10-10

Platooning vehicles—connected and automated vehicles traveling with small intervehicle distances—use less fuel because of reduced aerodynamic drag. Given a network de- fined by vertex and edge sets and a set of vehicles with origin/destination nodes/times, we model and solve the combinatorial optimization problem of coordinated routing of vehicles in a manner that routes them to their destination on time while using the least amount of fuel. Common approaches decompose the platoon coordination and vehicle routing into separate problems. Our model addresses both problems simultaneously to obtain the best solution. We use modern modeling techniques and constraints implied from analyzing themore » platoon routing problem to address larger numbers of vehicles and larger networks than previously considered. While the numerical method used is unable to certify optimality for candidate solutions to all networks and parameters considered, we obtain excellent solutions in approximately one minute for much larger networks and vehicle sets than previously considered in the literature.« less

Convergence of Asymptotic Systems of Non-autonomous Neural Network Models with Infinite Distributed Delays

NASA Astrophysics Data System (ADS)

Oliveira, José J.

2017-10-01

In this paper, we investigate the global convergence of solutions of non-autonomous Hopfield neural network models with discrete time-varying delays, infinite distributed delays, and possible unbounded coefficient functions. Instead of using Lyapunov functionals, we explore intrinsic features between the non-autonomous systems and their asymptotic systems to ensure the boundedness and global convergence of the solutions of the studied models. Our results are new and complement known results in the literature. The theoretical analysis is illustrated with some examples and numerical simulations.

Percolation and epidemics in a two-dimensional small world

NASA Astrophysics Data System (ADS)

Newman, M. E.; Jensen, I.; Ziff, R. M.

2002-02-01

Percolation on two-dimensional small-world networks has been proposed as a model for the spread of plant diseases. In this paper we give an analytic solution of this model using a combination of generating function methods and high-order series expansion. Our solution gives accurate predictions for quantities such as the position of the percolation threshold and the typical size of disease outbreaks as a function of the density of ``shortcuts'' in the small-world network. Our results agree with scaling hypotheses and numerical simulations for the same model.

Essentially nonoscillatory postprocessing filtering methods

NASA Technical Reports Server (NTRS)

Lafon, F.; Osher, S.

1992-01-01

High order accurate centered flux approximations used in the computation of numerical solutions to nonlinear partial differential equations produce large oscillations in regions of sharp transitions. Here, we present a new class of filtering methods denoted by Essentially Nonoscillatory Least Squares (ENOLS), which constructs an upgraded filtered solution that is close to the physically correct weak solution of the original evolution equation. Our method relies on the evaluation of a least squares polynomial approximation to oscillatory data using a set of points which is determined via the ENO network. Numerical results are given in one and two space dimensions for both scalar and systems of hyperbolic conservation laws. Computational running time, efficiency, and robustness of method are illustrated in various examples such as Riemann initial data for both Burgers' and Euler's equations of gas dynamics. In all standard cases, the filtered solution appears to converge numerically to the correct solution of the original problem. Some interesting results based on nonstandard central difference schemes, which exactly preserve entropy, and have been recently shown generally not to be weakly convergent to a solution of the conservation law, are also obtained using our filters.

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.

Mean Field Analysis of Large-Scale Interacting Populations of Stochastic Conductance-Based Spiking Neurons Using the Klimontovich Method

NASA Astrophysics Data System (ADS)

Gandolfo, Daniel; Rodriguez, Roger; Tuckwell, Henry C.

2017-03-01

We investigate the dynamics of large-scale interacting neural populations, composed of conductance based, spiking model neurons with modifiable synaptic connection strengths, which are possibly also subjected to external noisy currents. The network dynamics is controlled by a set of neural population probability distributions (PPD) which are constructed along the same lines as in the Klimontovich approach to the kinetic theory of plasmas. An exact non-closed, nonlinear, system of integro-partial differential equations is derived for the PPDs. As is customary, a closing procedure leads to a mean field limit. The equations we have obtained are of the same type as those which have been recently derived using rigorous techniques of probability theory. The numerical solutions of these so called McKean-Vlasov-Fokker-Planck equations, which are only valid in the limit of infinite size networks, actually shows that the statistical measures as obtained from PPDs are in good agreement with those obtained through direct integration of the stochastic dynamical system for large but finite size networks. Although numerical solutions have been obtained for networks of Fitzhugh-Nagumo model neurons, which are often used to approximate Hodgkin-Huxley model neurons, the theory can be readily applied to networks of general conductance-based model neurons of arbitrary dimension.

Bidirectional reaction steps in metabolic networks: I. Modeling and simulation of carbon isotope labeling experiments.

PubMed

Wiechert, W; de Graaf, A A

1997-07-05

The extension of metabolite balancing with carbon labeling experiments, as described by Marx et al. (Biotechnol. Bioeng. 49: 11-29), results in a much more detailed stationary metabolic flux analysis. As opposed to basic metabolite flux balancing alone, this method enables both flux directions of bidirectional reaction steps to be quantitated. However, the mathematical treatment of carbon labeling systems is much more complicated, because it requires the solution of numerous balance equations that are bilinear with respect to fluxes and fractional labeling. In this study, a universal modeling framework is presented for describing the metabolite and carbon atom flux in a metabolic network. Bidirectional reaction steps are extensively treated and their impact on the system's labeling state is investigated. Various kinds of modeling assumptions, as usually made for metabolic fluxes, are expressed by linear constraint equations. A numerical algorithm for the solution of the resulting linear constrained set of nonlinear equations is developed. The numerical stability problems caused by large bidirectional fluxes are solved by a specially developed transformation method. Finally, the simulation of carbon labeling experiments is facilitated by a flexible software tool for network synthesis. An illustrative simulation study on flux identifiability from available flux and labeling measurements in the cyclic pentose phosphate pathway of a recombinant strain of Zymomonas mobilis concludes this contribution.

An Algorithm for the Mixed Transportation Network Design Problem

PubMed Central

Liu, Xinyu; Chen, Qun

2016-01-01

This paper proposes an optimization algorithm, the dimension-down iterative algorithm (DDIA), for solving a mixed transportation network design problem (MNDP), which is generally expressed as a mathematical programming with equilibrium constraint (MPEC). The upper level of the MNDP aims to optimize the network performance via both the expansion of the existing links and the addition of new candidate links, whereas the lower level is a traditional Wardrop user equilibrium (UE) problem. The idea of the proposed solution algorithm (DDIA) is to reduce the dimensions of the problem. A group of variables (discrete/continuous) is fixed to optimize another group of variables (continuous/discrete) alternately; then, the problem is transformed into solving a series of CNDPs (continuous network design problems) and DNDPs (discrete network design problems) repeatedly until the problem converges to the optimal solution. The advantage of the proposed algorithm is that its solution process is very simple and easy to apply. Numerical examples show that for the MNDP without budget constraint, the optimal solution can be found within a few iterations with DDIA. For the MNDP with budget constraint, however, the result depends on the selection of initial values, which leads to different optimal solutions (i.e., different local optimal solutions). Some thoughts are given on how to derive meaningful initial values, such as by considering the budgets of new and reconstruction projects separately. PMID:27626803

Algorithms for Performance, Dependability, and Performability Evaluation using Stochastic Activity Networks

NASA Technical Reports Server (NTRS)

Deavours, Daniel D.; Qureshi, M. Akber; Sanders, William H.

1997-01-01

Modeling tools and technologies are important for aerospace development. At the University of Illinois, we have worked on advancing the state of the art in modeling by Markov reward models in two important areas: reducing the memory necessary to numerically solve systems represented as stochastic activity networks and other stochastic Petri net extensions while still obtaining solutions in a reasonable amount of time, and finding numerically stable and memory-efficient methods to solve for the reward accumulated during a finite mission time. A long standing problem when modeling with high level formalisms such as stochastic activity networks is the so-called state space explosion, where the number of states increases exponentially with size of the high level model. Thus, the corresponding Markov model becomes prohibitively large and solution is constrained by the the size of primary memory. To reduce the memory necessary to numerically solve complex systems, we propose new methods that can tolerate such large state spaces that do not require any special structure in the model (as many other techniques do). First, we develop methods that generate row and columns of the state transition-rate-matrix on-the-fly, eliminating the need to explicitly store the matrix at all. Next, we introduce a new iterative solution method, called modified adaptive Gauss-Seidel, that exhibits locality in its use of data from the state transition-rate-matrix, permitting us to cache portions of the matrix and hence reduce the solution time. Finally, we develop a new memory and computationally efficient technique for Gauss-Seidel based solvers that avoids the need for generating rows of A in order to solve Ax = b. This is a significant performance improvement for on-the-fly methods as well as other recent solution techniques based on Kronecker operators. Taken together, these new results show that one can solve very large models without any special structure.

A Floating Node Method for the Modelling of Discontinuities Within a Finite Element

NASA Technical Reports Server (NTRS)

Pinho, Silvestre T.; Chen, B. Y.; DeCarvalho, Nelson V.; Baiz, P. M.; Tay, T. E.

2013-01-01

This paper focuses on the accurate numerical representation of complex networks of evolving discontinuities in solids, with particular emphasis on cracks. The limitation of the standard finite element method (FEM) in approximating discontinuous solutions has motivated the development of re-meshing, smeared crack models, the eXtended Finite Element Method (XFEM) and the Phantom Node Method (PNM). We propose a new method which has some similarities to the PNM, but crucially: (i) does not introduce an error on the crack geometry when mapping to natural coordinates; (ii) does not require numerical integration over only part of a domain; (iii) can incorporate weak discontinuities and cohesive cracks more readily; (iv) is ideally suited for the representation of multiple and complex networks of (weak, strong and cohesive) discontinuities; (v) leads to the same solution as a finite element mesh where the discontinuity is represented explicitly; and (vi) is conceptually simpler than the PNM.

A Multi-Verse Optimizer with Levy Flights for Numerical Optimization and Its Application in Test Scheduling for Network-on-Chip.

PubMed

Hu, Cong; Li, Zhi; Zhou, Tian; Zhu, Aijun; Xu, Chuanpei

2016-01-01

We propose a new meta-heuristic algorithm named Levy flights multi-verse optimizer (LFMVO), which incorporates Levy flights into multi-verse optimizer (MVO) algorithm to solve numerical and engineering optimization problems. The Original MVO easily falls into stagnation when wormholes stochastically re-span a number of universes (solutions) around the best universe achieved over the course of iterations. Since Levy flights are superior in exploring unknown, large-scale search space, they are integrated into the previous best universe to force MVO out of stagnation. We test this method on three sets of 23 well-known benchmark test functions and an NP complete problem of test scheduling for Network-on-Chip (NoC). Experimental results prove that the proposed LFMVO is more competitive than its peers in both the quality of the resulting solutions and convergence speed.

A Multi-Verse Optimizer with Levy Flights for Numerical Optimization and Its Application in Test Scheduling for Network-on-Chip

PubMed Central

Hu, Cong; Li, Zhi; Zhou, Tian; Zhu, Aijun; Xu, Chuanpei

2016-01-01

We propose a new meta-heuristic algorithm named Levy flights multi-verse optimizer (LFMVO), which incorporates Levy flights into multi-verse optimizer (MVO) algorithm to solve numerical and engineering optimization problems. The Original MVO easily falls into stagnation when wormholes stochastically re-span a number of universes (solutions) around the best universe achieved over the course of iterations. Since Levy flights are superior in exploring unknown, large-scale search space, they are integrated into the previous best universe to force MVO out of stagnation. We test this method on three sets of 23 well-known benchmark test functions and an NP complete problem of test scheduling for Network-on-Chip (NoC). Experimental results prove that the proposed LFMVO is more competitive than its peers in both the quality of the resulting solutions and convergence speed. PMID:27926946

Synchronization properties of network motifs: Influence of coupling delay and symmetry

NASA Astrophysics Data System (ADS)

D'Huys, O.; Vicente, R.; Erneux, T.; Danckaert, J.; Fischer, I.

2008-09-01

We investigate the effect of coupling delays on the synchronization properties of several network motifs. In particular, we analyze the synchronization patterns of unidirectionally coupled rings, bidirectionally coupled rings, and open chains of Kuramoto oscillators. Our approach includes an analytical and semianalytical study of the existence and stability of different in-phase and out-of-phase periodic solutions, complemented by numerical simulations. The delay is found to act differently on networks possessing different symmetries. While for the unidirectionally coupled ring the coupling delay is mainly observed to induce multistability, its effect on bidirectionally coupled rings is to enhance the most symmetric solution. We also study the influence of feedback and conclude that it also promotes the in-phase solution of the coupled oscillators. We finally discuss the relation between our theoretical results on delay-coupled Kuramoto oscillators and the synchronization properties of networks consisting of real-world delay-coupled oscillators, such as semiconductor laser arrays and neuronal circuits.

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

Stability and Hopf bifurcation in a simplified BAM neural network with two time delays.

PubMed

Cao, Jinde; Xiao, Min

2007-03-01

Various local periodic solutions may represent different classes of storage patterns or memory patterns, and arise from the different equilibrium points of neural networks (NNs) by applying Hopf bifurcation technique. In this paper, a bidirectional associative memory NN with four neurons and multiple delays is considered. By applying the normal form theory and the center manifold theorem, analysis of its linear stability and Hopf bifurcation is performed. An algorithm is worked out for determining the direction and stability of the bifurcated periodic solutions. Numerical simulation results supporting the theoretical analysis are also given.

Generalized master equations for non-Poisson dynamics on networks.

PubMed

Hoffmann, Till; Porter, Mason A; Lambiotte, Renaud

2012-10-01

The traditional way of studying temporal networks is to aggregate the dynamics of the edges to create a static weighted network. This implicitly assumes that the edges are governed by Poisson processes, which is not typically the case in empirical temporal networks. Accordingly, we examine the effects of non-Poisson inter-event statistics on the dynamics of edges, and we apply the concept of a generalized master equation to the study of continuous-time random walks on networks. We show that this equation reduces to the standard rate equations when the underlying process is Poissonian and that its stationary solution is determined by an effective transition matrix whose leading eigenvector is easy to calculate. We conduct numerical simulations and also derive analytical results for the stationary solution under the assumption that all edges have the same waiting-time distribution. We discuss the implications of our work for dynamical processes on temporal networks and for the construction of network diagnostics that take into account their nontrivial stochastic nature.

Generalized master equations for non-Poisson dynamics on networks

NASA Astrophysics Data System (ADS)

Hoffmann, Till; Porter, Mason A.; Lambiotte, Renaud

2012-10-01

The traditional way of studying temporal networks is to aggregate the dynamics of the edges to create a static weighted network. This implicitly assumes that the edges are governed by Poisson processes, which is not typically the case in empirical temporal networks. Accordingly, we examine the effects of non-Poisson inter-event statistics on the dynamics of edges, and we apply the concept of a generalized master equation to the study of continuous-time random walks on networks. We show that this equation reduces to the standard rate equations when the underlying process is Poissonian and that its stationary solution is determined by an effective transition matrix whose leading eigenvector is easy to calculate. We conduct numerical simulations and also derive analytical results for the stationary solution under the assumption that all edges have the same waiting-time distribution. We discuss the implications of our work for dynamical processes on temporal networks and for the construction of network diagnostics that take into account their nontrivial stochastic nature.

Periodicity and stability for variable-time impulsive neural networks.

PubMed

Li, Hongfei; Li, Chuandong; Huang, Tingwen

2017-10-01

The paper considers a general neural networks model with variable-time impulses. It is shown that each solution of the system intersects with every discontinuous surface exactly once via several new well-proposed assumptions. Moreover, based on the comparison principle, this paper shows that neural networks with variable-time impulse can be reduced to the corresponding neural network with fixed-time impulses under well-selected conditions. Meanwhile, the fixed-time impulsive systems can be regarded as the comparison system of the variable-time impulsive neural networks. Furthermore, a series of sufficient criteria are derived to ensure the existence and global exponential stability of periodic solution of variable-time impulsive neural networks, and to illustrate the same stability properties between variable-time impulsive neural networks and the fixed-time ones. The new criteria are established by applying Schaefer's fixed point theorem combined with the use of inequality technique. Finally, a numerical example is presented to show the effectiveness of the proposed results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Supply network configuration—A benchmarking problem

NASA Astrophysics Data System (ADS)

Brandenburg, Marcus

2018-03-01

Managing supply networks is a highly relevant task that strongly influences the competitiveness of firms from various industries. Designing supply networks is a strategic process that considerably affects the structure of the whole network. In contrast, supply networks for new products are configured without major adaptations of the existing structure, but the network has to be configured before the new product is actually launched in the marketplace. Due to dynamics and uncertainties, the resulting planning problem is highly complex. However, formal models and solution approaches that support supply network configuration decisions for new products are scant. The paper at hand aims at stimulating related model-based research. To formulate mathematical models and solution procedures, a benchmarking problem is introduced which is derived from a case study of a cosmetics manufacturer. Tasks, objectives, and constraints of the problem are described in great detail and numerical values and ranges of all problem parameters are given. In addition, several directions for future research are suggested.

Application of neural networks to autonomous rendezvous and docking of space vehicles

NASA Technical Reports Server (NTRS)

Dabney, Richard W.

1992-01-01

NASA-Marshall has investigated the feasibility of numerous autonomous rendezvous and docking (ARD) candidate techniques. Neural networks have been studied as a viable basis for such systems' implementation, due to their intrinsic representation of such nonlinear functions as those for which analytical solutions are either difficult or nonexistent. Neural networks are also able to recognize and adapt to changes in their dynamic environment, thereby enhancing redundancy and fault tolerance. Outstanding performance has been obtained from ARD azimuth, elevation, and roll networks of this type.

Rumor diffusion model with spatio-temporal diffusion and uncertainty of behavior decision in complex social networks

NASA Astrophysics Data System (ADS)

Zhu, Liang; Wang, Youguo

2018-07-01

In this paper, a rumor diffusion model with uncertainty of human behavior under spatio-temporal diffusion framework is established. Take physical significance of spatial diffusion into account, a diffusion threshold is set under which the rumor is not a trend topic and only spreads along determined physical connections. Heterogeneity of degree distribution and distance distribution has also been considered in theoretical model at the same time. The global existence and uniqueness of classical solution are proved with a Lyapunov function and an approximate classical solution in form of infinite series is constructed with a system of eigenfunction. Simulations and numerical solutions both on Watts-Strogatz (WS) network and Barabási-Albert (BA) network display the variation of density of infected connections from spatial and temporal dimensions. Relevant results show that the density of infected connections is dominated by network topology and uncertainty of human behavior at threshold time. With increase of social capability, rumor diffuses to the steady state in a higher speed. And the variation trends of diffusion size with uncertainty are diverse on different artificial networks.

Elimination of numerical diffusion in 1 - phase and 2 - phase flows

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

Rajamaeki, M.

1997-07-01

The new hydraulics solution method PLIM (Piecewise Linear Interpolation Method) is capable of avoiding the excessive errors, numerical diffusion and also numerical dispersion. The hydraulics solver CFDPLIM uses PLIM and solves the time-dependent one-dimensional flow equations in network geometry. An example is given for 1-phase flow in the case when thermal-hydraulics and reactor kinetics are strongly coupled. Another example concerns oscillations in 2-phase flow. Both the example computations are not possible with conventional methods.

A simulated annealing approach for redesigning a warehouse network problem

NASA Astrophysics Data System (ADS)

Khairuddin, Rozieana; Marlizawati Zainuddin, Zaitul; Jiun, Gan Jia

2017-09-01

Now a day, several companies consider downsizing their distribution networks in ways that involve consolidation or phase-out of some of their current warehousing facilities due to the increasing competition, mounting cost pressure and taking advantage on the economies of scale. Consequently, the changes on economic situation after a certain period of time require an adjustment on the network model in order to get the optimal cost under the current economic conditions. This paper aimed to develop a mixed-integer linear programming model for a two-echelon warehouse network redesign problem with capacitated plant and uncapacitated warehouses. The main contribution of this study is considering capacity constraint for existing warehouses. A Simulated Annealing algorithm is proposed to tackle with the proposed model. The numerical solution showed the model and method of solution proposed was practical.

Using NCAR Yellowstone for PhotoVoltaic Power Forecasts with Artificial Neural Networks and an Analog Ensemble

NASA Astrophysics Data System (ADS)

Cervone, G.; Clemente-Harding, L.; Alessandrini, S.; Delle Monache, L.

2016-12-01

A methodology based on Artificial Neural Networks (ANN) and an Analog Ensemble (AnEn) is presented to generate 72-hour deterministic and probabilistic forecasts of power generated by photovoltaic (PV) power plants using input from a numerical weather prediction model and computed astronomical variables. ANN and AnEn are used individually and in combination to generate forecasts for three solar power plant located in Italy. The computational scalability of the proposed solution is tested using synthetic data simulating 4,450 PV power stations. The NCAR Yellowstone supercomputer is employed to test the parallel implementation of the proposed solution, ranging from 1 node (32 cores) to 4,450 nodes (141,140 cores). Results show that a combined AnEn + ANN solution yields best results, and that the proposed solution is well suited for massive scale computation.

Particle Interactions Mediated by Dynamical Networks: Assessment of Macroscopic Descriptions

NASA Astrophysics Data System (ADS)

Barré, J.; Carrillo, J. A.; Degond, P.; Peurichard, D.; Zatorska, E.

2018-02-01

We provide a numerical study of the macroscopic model of Barré et al. (Multiscale Model Simul, 2017, to appear) derived from an agent-based model for a system of particles interacting through a dynamical network of links. Assuming that the network remodeling process is very fast, the macroscopic model takes the form of a single aggregation-diffusion equation for the density of particles. The theoretical study of the macroscopic model gives precise criteria for the phase transitions of the steady states, and in the one-dimensional case, we show numerically that the stationary solutions of the microscopic model undergo the same phase transitions and bifurcation types as the macroscopic model. In the two-dimensional case, we show that the numerical simulations of the macroscopic model are in excellent agreement with the predicted theoretical values. This study provides a partial validation of the formal derivation of the macroscopic model from a microscopic formulation and shows that the former is a consistent approximation of an underlying particle dynamics, making it a powerful tool for the modeling of dynamical networks at a large scale.

Particle Interactions Mediated by Dynamical Networks: Assessment of Macroscopic Descriptions.

PubMed

Barré, J; Carrillo, J A; Degond, P; Peurichard, D; Zatorska, E

2018-01-01

We provide a numerical study of the macroscopic model of Barré et al. (Multiscale Model Simul, 2017, to appear) derived from an agent-based model for a system of particles interacting through a dynamical network of links. Assuming that the network remodeling process is very fast, the macroscopic model takes the form of a single aggregation-diffusion equation for the density of particles. The theoretical study of the macroscopic model gives precise criteria for the phase transitions of the steady states, and in the one-dimensional case, we show numerically that the stationary solutions of the microscopic model undergo the same phase transitions and bifurcation types as the macroscopic model. In the two-dimensional case, we show that the numerical simulations of the macroscopic model are in excellent agreement with the predicted theoretical values. This study provides a partial validation of the formal derivation of the macroscopic model from a microscopic formulation and shows that the former is a consistent approximation of an underlying particle dynamics, making it a powerful tool for the modeling of dynamical networks at a large scale.

Modeling and simulation of different and representative engineering problems using Network Simulation Method

PubMed Central

2018-01-01

Mathematical models simulating different and representative engineering problem, atomic dry friction, the moving front problems and elastic and solid mechanics are presented in the form of a set of non-linear, coupled or not coupled differential equations. For different parameters values that influence the solution, the problem is numerically solved by the network method, which provides all the variables of the problems. Although the model is extremely sensitive to the above parameters, no assumptions are considered as regards the linearization of the variables. The design of the models, which are run on standard electrical circuit simulation software, is explained in detail. The network model results are compared with common numerical methods or experimental data, published in the scientific literature, to show the reliability of the model. PMID:29518121

Modeling and simulation of different and representative engineering problems using Network Simulation Method.

PubMed

Sánchez-Pérez, J F; Marín, F; Morales, J L; Cánovas, M; Alhama, F

2018-01-01

Mathematical models simulating different and representative engineering problem, atomic dry friction, the moving front problems and elastic and solid mechanics are presented in the form of a set of non-linear, coupled or not coupled differential equations. For different parameters values that influence the solution, the problem is numerically solved by the network method, which provides all the variables of the problems. Although the model is extremely sensitive to the above parameters, no assumptions are considered as regards the linearization of the variables. The design of the models, which are run on standard electrical circuit simulation software, is explained in detail. The network model results are compared with common numerical methods or experimental data, published in the scientific literature, to show the reliability of the model.

Design and characterization of hydrogel-based microfluidic devices with biomimetic solute transport networks

PubMed Central

Koo, Hyung-Jun

2017-01-01

Hydrogel could serve as a matrix material of new classes of solar cells and photoreactors with embedded microfluidic networks. These devices mimic the structure and function of plant leaves, which are a natural soft matter based microfluidic system. These unusual microfluidic-hydrogel devices with fluid-penetrable medium operate on the basis of convective-diffusive mechanism, where the liquid is transported between the non-connected channels via molecular permeation through the hydrogel. We define three key designs of such hydrogel devices, having linear, T-shaped, and branched channels and report results of numerical simulation of the process of their infusion with solute carried by the incoming fluid. The computational procedure takes into account both pressure-driven convection and concentration gradient-driven diffusion in the permeable gel matrix. We define the criteria for evaluation of the fluid infusion rate, uniformity, solute loss by outflow and overall performance. The T-shaped channel network was identified as the most efficient one and was improved further by investigating the effect of the channel-end secondary branches. Our parallel experimental data on the pattern of solute infusions are in excellent agreement with the simulation. These network designs can be applied to a broad range of novel microfluidic materials and soft matter devices with distributed microchannel networks. PMID:28396708

A novel neural network for variational inequalities with linear and nonlinear constraints.

PubMed

Gao, Xing-Bao; Liao, Li-Zhi; Qi, Liqun

2005-11-01

Variational inequality is a uniform approach for many important optimization and equilibrium problems. Based on the sufficient and necessary conditions of the solution, this paper presents a novel neural network model for solving variational inequalities with linear and nonlinear constraints. Three sufficient conditions are provided to ensure that the proposed network with an asymmetric mapping is stable in the sense of Lyapunov and converges to an exact solution of the original problem. Meanwhile, the proposed network with a gradient mapping is also proved to be stable in the sense of Lyapunov and to have a finite-time convergence under some mild condition by using a new energy function. Compared with the existing neural networks, the new model can be applied to solve some nonmonotone problems, has no adjustable parameter, and has lower complexity. Thus, the structure of the proposed network is very simple. Since the proposed network can be used to solve a broad class of optimization problems, it has great application potential. The validity and transient behavior of the proposed neural network are demonstrated by several numerical examples.

Geopolitical model of investment power station construction project implementation

NASA Astrophysics Data System (ADS)

Malafeyev, Oleg; Farvazov, Konstantin; Zenovich, Olga; Zaitseva, Irina; Kostyukov, Konstantin; Svechinskaya, Tatiana

2018-04-01

Two geopolitical actors implement a geopolitical project that involves transportaion and storage of some commodities. They interact with each other through a transport network. The network consists of several interconnected vertices. Some of the vetrices are trading hubs, storage spaces, production hubs and goods buyers. Actors wish to satify the demand of buyers and recieve the highest possible profit subject to compromise solution principle. A numerical example is given.

MaxEnt analysis of a water distribution network in Canberra, ACT, Australia

NASA Astrophysics Data System (ADS)

Waldrip, Steven H.; Niven, Robert K.; Abel, Markus; Schlegel, Michael; Noack, Bernd R.

2015-01-01

A maximum entropy (MaxEnt) method is developed to infer the state of a pipe flow network, for situations in which there is insufficient information to form a closed equation set. This approach substantially extends existing deterministic methods for the analysis of engineered flow networks (e.g. Newton's method or the Hardy Cross scheme). The network is represented as an undirected graph structure, in which the uncertainty is represented by a continuous relative entropy on the space of internal and external flow rates. The head losses (potential differences) on the network are treated as dependent variables, using specified pipe-flow resistance functions. The entropy is maximised subject to "observable" constraints on the mean values of certain flow rates and/or potential differences, and also "physical" constraints arising from the frictional properties of each pipe and from Kirchhoff's nodal and loop laws. A numerical method is developed in Matlab for solution of the integral equation system, based on multidimensional quadrature. Several nonlinear resistance functions (e.g. power-law and Colebrook) are investigated, necessitating numerical solution of the implicit Lagrangian by a double iteration scheme. The method is applied to a 1123-node, 1140-pipe water distribution network for the suburb of Torrens in the Australian Capital Territory, Australia, using network data supplied by water authority ACTEW Corporation Limited. A number of different assumptions are explored, including various network geometric representations, prior probabilities and constraint settings, yielding useful predictions of network demand and performance. We also propose this methodology be used in conjunction with in-flow monitoring systems, to obtain better inferences of user consumption without large investments in monitoring equipment and maintenance.

Convergence dynamics and pseudo almost periodicity of a class of nonautonomous RFDEs with applications

NASA Astrophysics Data System (ADS)

Fan, Meng; Ye, Dan

2005-09-01

This paper studies the dynamics of a system of retarded functional differential equations (i.e., RF=Es), which generalize the Hopfield neural network models, the bidirectional associative memory neural networks, the hybrid network models of the cellular neural network type, and some population growth model. Sufficient criteria are established for the globally exponential stability and the existence and uniqueness of pseudo almost periodic solution. The approaches are based on constructing suitable Lyapunov functionals and the well-known Banach contraction mapping principle. The paper ends with some applications of the main results to some neural network models and population growth models and numerical simulations.

An economic analysis on optical Ethernet in the access network

NASA Astrophysics Data System (ADS)

Kim, Sung Hwi; Nam, Dohyun; Yoo, Gunil; Kim, WoonHa

2004-04-01

Nowadays, Broadband service subscribers have increased exponentially and have almost saturated in Korea. Several types of solutions for broadband service applied to the field. Among several types of broadband services, most of subscribers provided xDSL service like ADSL or VDSL. Usually, they who live in an apartment provided Internet service by Ntopia network as FTTC structure that is a dormant network in economical view at KT. Under competitive telecom environment for new services like video, we faced with needing to expand or rebuild portions of our access networks, are looking for ways to provide any service that competitors might offer presently or in the near future. In order to look for new business model like FTTH service, we consider deploying optical access network. In spite of numerous benefits of PON until now, we cannot believe that PON is the best solution in Korea. Because we already deployed optical access network of ring type feeder cable and have densely population of subscribers that mainly distributed inside 6km from central office. So we try to utilize an existing Ntopia network for FTTH service under optical access environment. Despite of such situations, we try to deploy PON solution in the field as FTTC or FTTH architecture. Therefore we analyze PON structure in comparison with AON structure in order to look for optimized structure in Korea. At first, we describe the existing optical access networks and network architecture briefly. Secondly we investigate the cost of building optical access networks by modeling cost functions on AON and PON structure which based on Ethernet protocol, and analyze two different network architectures according to different deployment scenarios: Urban, small town, rural. Finally we suggest the economic and best solution with PON structure to optimize to optical access environment of KT.

Equilibrium paths analysis of materials with rheological properties by using the chaos theory

NASA Astrophysics Data System (ADS)

Bednarek, Paweł; Rządkowski, Jan

2018-01-01

The numerical equilibrium path analysis of the material with random rheological properties by using standard procedures and specialist computer programs was not successful. The proper solution for the analysed heuristic model of the material was obtained on the base of chaos theory elements and neural networks. The paper deals with mathematical reasons of used computer programs and also are elaborated the properties of the attractor used in analysis. There are presented results of conducted numerical analysis both in a numerical and in graphical form for the used procedures.

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

A Hardware-Supported Algorithm for Self-Managed and Choreographed Task Execution in Sensor Networks.

PubMed

Bordel, Borja; Miguel, Carlos; Alcarria, Ramón; Robles, Tomás

2018-03-07

Nowadays, sensor networks are composed of a great number of tiny resource-constraint nodes, whose management is increasingly more complex. In fact, although collaborative or choreographic task execution schemes are which fit in the most perfect way with the nature of sensor networks, they are rarely implemented because of the high resource consumption of these algorithms (especially if networks include many resource-constrained devices). On the contrary, hierarchical networks are usually designed, in whose cusp it is included a heavy orchestrator with a remarkable processing power, being able to implement any necessary management solution. However, although this orchestration approach solves most practical management problems of sensor networks, a great amount of the operation time is wasted while nodes request the orchestrator to address a conflict and they obtain the required instructions to operate. Therefore, in this paper it is proposed a new mechanism for self-managed and choreographed task execution in sensor networks. The proposed solution considers only a lightweight gateway instead of traditional heavy orchestrators and a hardware-supported algorithm, which consume a negligible amount of resources in sensor nodes. The gateway avoids the congestion of the entire sensor network and the hardware-supported algorithm enables a choreographed task execution scheme, so no particular node is overloaded. The performance of the proposed solution is evaluated through numerical and electronic ModelSim-based simulations.

A Hardware-Supported Algorithm for Self-Managed and Choreographed Task Execution in Sensor Networks

PubMed Central

2018-01-01

Nowadays, sensor networks are composed of a great number of tiny resource-constraint nodes, whose management is increasingly more complex. In fact, although collaborative or choreographic task execution schemes are which fit in the most perfect way with the nature of sensor networks, they are rarely implemented because of the high resource consumption of these algorithms (especially if networks include many resource-constrained devices). On the contrary, hierarchical networks are usually designed, in whose cusp it is included a heavy orchestrator with a remarkable processing power, being able to implement any necessary management solution. However, although this orchestration approach solves most practical management problems of sensor networks, a great amount of the operation time is wasted while nodes request the orchestrator to address a conflict and they obtain the required instructions to operate. Therefore, in this paper it is proposed a new mechanism for self-managed and choreographed task execution in sensor networks. The proposed solution considers only a lightweight gateway instead of traditional heavy orchestrators and a hardware-supported algorithm, which consume a negligible amount of resources in sensor nodes. The gateway avoids the congestion of the entire sensor network and the hardware-supported algorithm enables a choreographed task execution scheme, so no particular node is overloaded. The performance of the proposed solution is evaluated through numerical and electronic ModelSim-based simulations. PMID:29518986

Reinforcement learning for resource allocation in LEO satellite networks.

PubMed

Usaha, Wipawee; Barria, Javier A

2007-06-01

In this paper, we develop and assess online decision-making algorithms for call admission and routing for low Earth orbit (LEO) satellite networks. It has been shown in a recent paper that, in a LEO satellite system, a semi-Markov decision process formulation of the call admission and routing problem can achieve better performance in terms of an average revenue function than existing routing methods. However, the conventional dynamic programming (DP) numerical solution becomes prohibited as the problem size increases. In this paper, two solution methods based on reinforcement learning (RL) are proposed in order to circumvent the computational burden of DP. The first method is based on an actor-critic method with temporal-difference (TD) learning. The second method is based on a critic-only method, called optimistic TD learning. The algorithms enhance performance in terms of requirements in storage, computational complexity and computational time, and in terms of an overall long-term average revenue function that penalizes blocked calls. Numerical studies are carried out, and the results obtained show that the RL framework can achieve up to 56% higher average revenue over existing routing methods used in LEO satellite networks with reasonable storage and computational requirements.

SINDA, Systems Improved Numerical Differencing Analyzer

NASA Technical Reports Server (NTRS)

Fink, L. C.; Pan, H. M. Y.; Ishimoto, T.

1972-01-01

Computer program has been written to analyze group of 100-node areas and then provide for summation of any number of 100-node areas to obtain temperature profile. SINDA program options offer user variety of methods for solution of thermal analog modes presented in network format.

Joint physical and numerical modeling of water distribution networks.

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

Zimmerman, Adam; O'Hern, Timothy John; Orear, Leslie Jr.

2009-01-01

This report summarizes the experimental and modeling effort undertaken to understand solute mixing in a water distribution network conducted during the last year of a 3-year project. The experimental effort involves measurement of extent of mixing within different configurations of pipe networks, measurement of dynamic mixing in a single mixing tank, and measurement of dynamic solute mixing in a combined network-tank configuration. High resolution analysis of turbulence mixing is carried out via high speed photography as well as 3D finite-volume based Large Eddy Simulation turbulence models. Macroscopic mixing rules based on flow momentum balance are also explored, and in somemore » cases, implemented in EPANET. A new version EPANET code was developed to yield better mixing predictions. The impact of a storage tank on pipe mixing in a combined pipe-tank network during diurnal fill-and-drain cycles is assessed. Preliminary comparison between dynamic pilot data and EPANET-BAM is also reported.« less

Numerical solution of differential equations by artificial neural networks

NASA Technical Reports Server (NTRS)

Meade, Andrew J., Jr.

1995-01-01

Conventionally programmed digital computers can process numbers with great speed and precision, but do not easily recognize patterns or imprecise or contradictory data. Instead of being programmed in the conventional sense, artificial neural networks (ANN's) are capable of self-learning through exposure to repeated examples. However, the training of an ANN can be a time consuming and unpredictable process. A general method is being developed by the author to mate the adaptability of the ANN with the speed and precision of the digital computer. This method has been successful in building feedforward networks that can approximate functions and their partial derivatives from examples in a single iteration. The general method also allows the formation of feedforward networks that can approximate the solution to nonlinear ordinary and partial differential equations to desired accuracy without the need of examples. It is believed that continued research will produce artificial neural networks that can be used with confidence in practical scientific computing and engineering applications.

Memetic Algorithm-Based Multi-Objective Coverage Optimization for Wireless Sensor Networks

PubMed Central

Chen, Zhi; Li, Shuai; Yue, Wenjing

2014-01-01

Maintaining effective coverage and extending the network lifetime as much as possible has become one of the most critical issues in the coverage of WSNs. In this paper, we propose a multi-objective coverage optimization algorithm for WSNs, namely MOCADMA, which models the coverage control of WSNs as the multi-objective optimization problem. MOCADMA uses a memetic algorithm with a dynamic local search strategy to optimize the coverage of WSNs and achieve the objectives such as high network coverage, effective node utilization and more residual energy. In MOCADMA, the alternative solutions are represented as the chromosomes in matrix form, and the optimal solutions are selected through numerous iterations of the evolution process, including selection, crossover, mutation, local enhancement, and fitness evaluation. The experiment and evaluation results show MOCADMA can have good capabilities in maintaining the sensing coverage, achieve higher network coverage while improving the energy efficiency and effectively prolonging the network lifetime, and have a significant improvement over some existing algorithms. PMID:25360579

Memetic algorithm-based multi-objective coverage optimization for wireless sensor networks.

PubMed

Chen, Zhi; Li, Shuai; Yue, Wenjing

2014-10-30

Maintaining effective coverage and extending the network lifetime as much as possible has become one of the most critical issues in the coverage of WSNs. In this paper, we propose a multi-objective coverage optimization algorithm for WSNs, namely MOCADMA, which models the coverage control of WSNs as the multi-objective optimization problem. MOCADMA uses a memetic algorithm with a dynamic local search strategy to optimize the coverage of WSNs and achieve the objectives such as high network coverage, effective node utilization and more residual energy. In MOCADMA, the alternative solutions are represented as the chromosomes in matrix form, and the optimal solutions are selected through numerous iterations of the evolution process, including selection, crossover, mutation, local enhancement, and fitness evaluation. The experiment and evaluation results show MOCADMA can have good capabilities in maintaining the sensing coverage, achieve higher network coverage while improving the energy efficiency and effectively prolonging the network lifetime, and have a significant improvement over some existing algorithms.

Stable architectures for deep neural networks

NASA Astrophysics Data System (ADS)

Haber, Eldad; Ruthotto, Lars

2018-01-01

Deep neural networks have become invaluable tools for supervised machine learning, e.g. classification of text or images. While often offering superior results over traditional techniques and successfully expressing complicated patterns in data, deep architectures are known to be challenging to design and train such that they generalize well to new data. Critical issues with deep architectures are numerical instabilities in derivative-based learning algorithms commonly called exploding or vanishing gradients. In this paper, we propose new forward propagation techniques inspired by systems of ordinary differential equations (ODE) that overcome this challenge and lead to well-posed learning problems for arbitrarily deep networks. The backbone of our approach is our interpretation of deep learning as a parameter estimation problem of nonlinear dynamical systems. Given this formulation, we analyze stability and well-posedness of deep learning and use this new understanding to develop new network architectures. We relate the exploding and vanishing gradient phenomenon to the stability of the discrete ODE and present several strategies for stabilizing deep learning for very deep networks. While our new architectures restrict the solution space, several numerical experiments show their competitiveness with state-of-the-art networks.

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

NASA Astrophysics Data System (ADS)

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

2017-05-01

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

Study on the influence of stochastic properties of correction terms on the reliability of instantaneous network RTK

NASA Astrophysics Data System (ADS)

Próchniewicz, Dominik

2014-03-01

The reliability of precision GNSS positioning primarily depends on correct carrier-phase ambiguity resolution. An optimal estimation and correct validation of ambiguities necessitates a proper definition of mathematical positioning model. Of particular importance in the model definition is the taking into account of the atmospheric errors (ionospheric and tropospheric refraction) as well as orbital errors. The use of the network of reference stations in kinematic positioning, known as Network-based Real-Time Kinematic (Network RTK) solution, facilitates the modeling of such errors and their incorporation, in the form of correction terms, into the functional description of positioning model. Lowered accuracy of corrections, especially during atmospheric disturbances, results in the occurrence of unaccounted biases, the so-called residual errors. The taking into account of such errors in Network RTK positioning model is possible by incorporating the accuracy characteristics of the correction terms into the stochastic model of observations. In this paper we investigate the impact of the expansion of the stochastic model to include correction term variances on the reliability of the model solution. In particular the results of instantaneous solution that only utilizes a single epoch of GPS observations, is analyzed. Such a solution mode due to the low number of degrees of freedom is very sensitive to an inappropriate mathematical model definition. Thus the high level of the solution reliability is very difficult to achieve. Numerical tests performed for a test network located in mountain area during ionospheric disturbances allows to verify the described method for the poor measurement conditions. The results of the ambiguity resolution as well as the rover positioning accuracy shows that the proposed method of stochastic modeling can increase the reliability of instantaneous Network RTK performance.

Dynamic Analysis of a Reaction-Diffusion Rumor Propagation Model

NASA Astrophysics Data System (ADS)

Zhao, Hongyong; Zhu, Linhe

2016-06-01

The rapid development of the Internet, especially the emergence of the social networks, leads rumor propagation into a new media era. Rumor propagation in social networks has brought new challenges to network security and social stability. This paper, based on partial differential equations (PDEs), proposes a new SIS rumor propagation model by considering the effect of the communication between the different rumor infected users on rumor propagation. The stabilities of a nonrumor equilibrium point and a rumor-spreading equilibrium point are discussed by linearization technique and the upper and lower solutions method, and the existence of a traveling wave solution is established by the cross-iteration scheme accompanied by the technique of upper and lower solutions and Schauder’s fixed point theorem. Furthermore, we add the time delay to rumor propagation and deduce the conditions of Hopf bifurcation and stability switches for the rumor-spreading equilibrium point by taking the time delay as the bifurcation parameter. Finally, numerical simulations are performed to illustrate the theoretical results.

New computer program solves wide variety of heat flow problems

NASA Technical Reports Server (NTRS)

Almond, J. C.

1966-01-01

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

Modeling of matter-wave solitons in a nonlinear inductor-capacitor network through a Gross-Pitaevskii equation with time-dependent linear potential

NASA Astrophysics Data System (ADS)

Kengne, E.; Lakhssassi, A.; Liu, W. M.

2017-08-01

A lossless nonlinear L C transmission network is considered. With the use of the reductive perturbation method in the semidiscrete limit, we show that the dynamics of matter-wave solitons in the network can be modeled by a one-dimensional Gross-Pitaevskii (GP) equation with a time-dependent linear potential in the presence of a chemical potential. An explicit expression for the growth rate of a purely growing modulational instability (MI) is presented and analyzed. We find that the potential parameter of the GP equation of the system does not affect the different regions of the MI. Neglecting the chemical potential in the GP equation, we derive exact analytical solutions which describe the propagation of both bright and dark solitary waves on continuous-wave (cw) backgrounds. Using the found exact analytical solutions of the GP equation, we investigate numerically the transmission of both bright and dark solitary voltage signals in the network. Our numerical studies show that the amplitude of a bright solitary voltage signal and the depth of a dark solitary voltage signal as well as their width, their motion, and their behavior depend on (i) the propagation frequencies, (ii) the potential parameter, and (iii) the amplitude of the cw background. The GP equation derived in this paper with a time-dependent linear potential opens up different ideas that may be of considerable theoretical interest for the management of matter-wave solitons in nonlinear L C transmission networks.

Neural network for solving convex quadratic bilevel programming problems.

PubMed

He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie

2014-03-01

In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network. Copyright © 2013 Elsevier Ltd. All rights reserved.

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

NASA Astrophysics Data System (ADS)

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

2018-04-01

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

Incentive-Based Voltage Regulation in Distribution Networks: Preprint

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

Zhou, Xinyang; Chen, Lijun; Dall'Anese, Emiliano

This paper considers distribution networks fea- turing distributed energy resources, and designs incentive-based mechanisms that allow the network operator and end-customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Two different network-customer coordination mechanisms that require different amounts of information shared between the network operator and end-customers are developed to identify a solution of a well-defined social-welfare maximization prob- lem. Notably, the signals broadcast by the network operator assume the connotation of prices/incentives that induce the end- customers to adjust the generated/consumed powers in order to avoid the violation of the voltagemore » constraints. Stability of the proposed schemes is analytically established and numerically corroborated.« less

Incentive-Based Voltage Regulation in Distribution Networks

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

Dall-Anese, Emiliano; Baker, Kyri A; Zhou, Xinyang

This paper considers distribution networks fea- turing distributed energy resources, and designs incentive-based mechanisms that allow the network operator and end-customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Two different network-customer coordination mechanisms that require different amounts of information shared between the network operator and end-customers are developed to identify a solution of a well-defined social-welfare maximization prob- lem. Notably, the signals broadcast by the network operator assume the connotation of prices/incentives that induce the end- customers to adjust the generated/consumed powers in order to avoid the violation of the voltagemore » constraints. Stability of the proposed schemes is analytically established and numerically corroborated.« less

Attractors in complex networks

NASA Astrophysics Data System (ADS)

Rodrigues, Alexandre A. P.

2017-10-01

In the framework of the generalized Lotka-Volterra model, solutions representing multispecies sequential competition can be predictable with high probability. In this paper, we show that it occurs because the corresponding "heteroclinic channel" forms part of an attractor. We prove that, generically, in an attracting heteroclinic network involving a finite number of hyperbolic and non-resonant saddle-equilibria whose linearization has only real eigenvalues, the connections corresponding to the most positive expanding eigenvalues form part of an attractor (observable in numerical simulations).

Attractors in complex networks.

PubMed

Rodrigues, Alexandre A P

2017-10-01

In the framework of the generalized Lotka-Volterra model, solutions representing multispecies sequential competition can be predictable with high probability. In this paper, we show that it occurs because the corresponding "heteroclinic channel" forms part of an attractor. We prove that, generically, in an attracting heteroclinic network involving a finite number of hyperbolic and non-resonant saddle-equilibria whose linearization has only real eigenvalues, the connections corresponding to the most positive expanding eigenvalues form part of an attractor (observable in numerical simulations).

SPIR: The potential spreaders involved SIR model for information diffusion in social networks

NASA Astrophysics Data System (ADS)

Rui, Xiaobin; Meng, Fanrong; Wang, Zhixiao; Yuan, Guan; Du, Changjiang

2018-09-01

The Susceptible-Infective-Removed (SIR) model is one of the most widely used models for the information diffusion research in social networks. Many researchers have devoted themselves to improving the classic SIR model in different aspects. However, on the one hand, the equations of these improved models are regarded as continuous functions, while the corresponding simulation experiments use discrete time, leading to the mismatch between numerical solutions got from mathematical method and experimental results obtained by simulating the spreading behaviour of each node. On the other hand, if the equations of these improved models are solved discretely, susceptible nodes will be calculated repeatedly, resulting in a big deviation from the actual value. In order to solve the above problem, this paper proposes a Susceptible-Potential-Infective-Removed (SPIR) model that analyses the diffusion process based on the discrete time according to simulation. Besides, this model also introduces a potential spreader set which solve the problem of repeated calculation effectively. To test the SPIR model, various experiments have been carried out from different angles on both artificial networks and real world networks. The Pearson correlation coefficient between numerical solutions of our SPIR equations and corresponding simulation results is mostly bigger than 0.95, which reveals that the proposed SPIR model is able to depict the information diffusion process with high accuracy.

A solution to neural field equations by a recurrent neural network method

NASA Astrophysics Data System (ADS)

Alharbi, Abir

2012-09-01

Neural field equations (NFE) are used to model the activity of neurons in the brain, it is introduced from a single neuron 'integrate-and-fire model' starting point. The neural continuum is spatially discretized for numerical studies, and the governing equations are modeled as a system of ordinary differential equations. In this article the recurrent neural network approach is used to solve this system of ODEs. This consists of a technique developed by combining the standard numerical method of finite-differences with the Hopfield neural network. The architecture of the net, energy function, updating equations, and algorithms are developed for the NFE model. A Hopfield Neural Network is then designed to minimize the energy function modeling the NFE. Results obtained from the Hopfield-finite-differences net show excellent performance in terms of accuracy and speed. The parallelism nature of the Hopfield approaches may make them easier to implement on fast parallel computers and give them the speed advantage over the traditional methods.

Automated smoother for the numerical decoupling of dynamics models.

PubMed

Vilela, Marco; Borges, Carlos C H; Vinga, Susana; Vasconcelos, Ana Tereza R; Santos, Helena; Voit, Eberhard O; Almeida, Jonas S

2007-08-21

Structure identification of dynamic models for complex biological systems is the cornerstone of their reverse engineering. Biochemical Systems Theory (BST) offers a particularly convenient solution because its parameters are kinetic-order coefficients which directly identify the topology of the underlying network of processes. We have previously proposed a numerical decoupling procedure that allows the identification of multivariate dynamic models of complex biological processes. While described here within the context of BST, this procedure has a general applicability to signal extraction. Our original implementation relied on artificial neural networks (ANN), which caused slight, undesirable bias during the smoothing of the time courses. As an alternative, we propose here an adaptation of the Whittaker's smoother and demonstrate its role within a robust, fully automated structure identification procedure. In this report we propose a robust, fully automated solution for signal extraction from time series, which is the prerequisite for the efficient reverse engineering of biological systems models. The Whittaker's smoother is reformulated within the context of information theory and extended by the development of adaptive signal segmentation to account for heterogeneous noise structures. The resulting procedure can be used on arbitrary time series with a nonstationary noise process; it is illustrated here with metabolic profiles obtained from in-vivo NMR experiments. The smoothed solution that is free of parametric bias permits differentiation, which is crucial for the numerical decoupling of systems of differential equations. The method is applicable in signal extraction from time series with nonstationary noise structure and can be applied in the numerical decoupling of system of differential equations into algebraic equations, and thus constitutes a rather general tool for the reverse engineering of mechanistic model descriptions from multivariate experimental time series.

Neural dynamic programming and its application to control systems

NASA Astrophysics Data System (ADS)

Seong, Chang-Yun

There are few general practical feedback control methods for nonlinear MIMO (multi-input-multi-output) systems, although such methods exist for their linear counterparts. Neural Dynamic Programming (NDP) is proposed as a practical design method of optimal feedback controllers for nonlinear MIMO systems. NDP is an offspring of both neural networks and optimal control theory. In optimal control theory, the optimal solution to any nonlinear MIMO control problem may be obtained from the Hamilton-Jacobi-Bellman equation (HJB) or the Euler-Lagrange equations (EL). The two sets of equations provide the same solution in different forms: EL leads to a sequence of optimal control vectors, called Feedforward Optimal Control (FOC); HJB yields a nonlinear optimal feedback controller, called Dynamic Programming (DP). DP produces an optimal solution that can reject disturbances and uncertainties as a result of feedback. Unfortunately, computation and storage requirements associated with DP solutions can be problematic, especially for high-order nonlinear systems. This dissertation presents an approximate technique for solving the DP problem based on neural network techniques that provides many of the performance benefits (e.g., optimality and feedback) of DP and benefits from the numerical properties of neural networks. We formulate neural networks to approximate optimal feedback solutions whose existence DP justifies. We show the conditions under which NDP closely approximates the optimal solution. Finally, we introduce the learning operator characterizing the learning process of the neural network in searching the optimal solution. The analysis of the learning operator provides not only a fundamental understanding of the learning process in neural networks but also useful guidelines for selecting the number of weights of the neural network. As a result, NDP finds---with a reasonable amount of computation and storage---the optimal feedback solutions to nonlinear MIMO control problems that would be very difficult to solve with DP. NDP was demonstrated on several applications such as the lateral autopilot logic for a Boeing 747, the minimum fuel control of a double-integrator plant with bounded control, the backward steering of a two-trailer truck, and the set-point control of a two-link robot arm.

Application of stochastic automata networks for creation of continuous time Markov chain models of voltage gating of gap junction channels.

PubMed

Snipas, Mindaugas; Pranevicius, Henrikas; Pranevicius, Mindaugas; Pranevicius, Osvaldas; Paulauskas, Nerijus; Bukauskas, Feliksas F

2015-01-01

The primary goal of this work was to study advantages of numerical methods used for the creation of continuous time Markov chain models (CTMC) of voltage gating of gap junction (GJ) channels composed of connexin protein. This task was accomplished by describing gating of GJs using the formalism of the stochastic automata networks (SANs), which allowed for very efficient building and storing of infinitesimal generator of the CTMC that allowed to produce matrices of the models containing a distinct block structure. All of that allowed us to develop efficient numerical methods for a steady-state solution of CTMC models. This allowed us to accelerate CPU time, which is necessary to solve CTMC models, ~20 times.

A Novel Capacity Analysis for Wireless Backhaul Mesh Networks

NASA Astrophysics Data System (ADS)

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

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

Thermal radiation characteristics of nonisothermal cylindrical enclosures using a numerical ray tracing technique

NASA Technical Reports Server (NTRS)

Baumeister, Joseph F.

1990-01-01

Analysis of energy emitted from simple or complex cavity designs can lead to intricate solutions due to nonuniform radiosity and irradiation within a cavity. A numerical ray tracing technique was applied to simulate radiation propagating within and from various cavity designs. To obtain the energy balance relationships between isothermal and nonisothermal cavity surfaces and space, the computer code NEVADA was utilized for its statistical technique applied to numerical ray tracing. The analysis method was validated by comparing results with known theoretical and limiting solutions, and the electrical resistance network method. In general, for nonisothermal cavities the performance (apparent emissivity) is a function of cylinder length-to-diameter ratio, surface emissivity, and cylinder surface temperatures. The extent of nonisothermal conditions in a cylindrical cavity significantly affects the overall cavity performance. Results are presented over a wide range of parametric variables for use as a possible design reference.

Pattern Formation on Networks: from Localised Activity to Turing Patterns

PubMed Central

McCullen, Nick; Wagenknecht, Thomas

2016-01-01

Networks of interactions between competing species are used to model many complex systems, such as in genetics, evolutionary biology or sociology and knowledge of the patterns of activity they can exhibit is important for understanding their behaviour. The emergence of patterns on complex networks with reaction-diffusion dynamics is studied here, where node dynamics interact via diffusion via the network edges. Through the application of a generalisation of dynamical systems analysis this work reveals a fundamental connection between small-scale modes of activity on networks and localised pattern formation seen throughout science, such as solitons, breathers and localised buckling. The connection between solutions with a single and small numbers of activated nodes and the fully developed system-scale patterns are investigated computationally using numerical continuation methods. These techniques are also used to help reveal a much larger portion of of the full number of solutions that exist in the system at different parameter values. The importance of network structure is also highlighted, with a key role being played by nodes with a certain so-called optimal degree, on which the interaction between the reaction kinetics and the network structure organise the behaviour of the system. PMID:27273339

A numerical procedure for transient free surface seepage through fracture networks

NASA Astrophysics Data System (ADS)

Jiang, Qinghui; Ye, Zuyang; Zhou, Chuangbing

2014-11-01

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

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network.

PubMed

Goto, Hayato

2016-02-22

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

NASA Astrophysics Data System (ADS)

Goto, Hayato

2016-02-01

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.

Pseudo-orthogonalization of memory patterns for associative memory.

PubMed

Oku, Makito; Makino, Takaki; Aihara, Kazuyuki

2013-11-01

A new method for improving the storage capacity of associative memory models on a neural network is proposed. The storage capacity of the network increases in proportion to the network size in the case of random patterns, but, in general, the capacity suffers from correlation among memory patterns. Numerous solutions to this problem have been proposed so far, but their high computational cost limits their scalability. In this paper, we propose a novel and simple solution that is locally computable without any iteration. Our method involves XNOR masking of the original memory patterns with random patterns, and the masked patterns and masks are concatenated. The resulting decorrelated patterns allow higher storage capacity at the cost of the pattern length. Furthermore, the increase in the pattern length can be reduced through blockwise masking, which results in a small amount of capacity loss. Movie replay and image recognition are presented as examples to demonstrate the scalability of the proposed method.

Innovative solutions in monitoring systems in flood protection

NASA Astrophysics Data System (ADS)

Sekuła, Klaudia; Połeć, Marzena; Borecka, Aleksandra

2018-02-01

The article presents the possibilities of ISMOP - IT System of Levee Monitoring. This system is able to collecting data from the reference and experimental control and measurement network. The experimental levee is build in a 1:1 scale and located in the village of Czernichow, near Cracow. The innovation is the utilization of a series of sensors monitoring the changes in the body of levee. It can be done by comparing the results of numerical simulations with results from installed two groups of sensors: reference sensors and experimental sensors. The reference control and measurement sensors create network based on pore pressure and temperature sensors. Additionally, it contains the fiber-optic technology. The second network include design experimental sensors, constructed for the development of solutions that can be used in existing flood embankments. The results are important to create the comprehensive and inexpensive monitoring system, which could be helpful for state authorities and local governments in flood protection.

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.

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

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

Verification and Optimal Control of Context-Sensitive Probabilistic Boolean Networks Using Model Checking and Polynomial Optimization

PubMed Central

Hiraishi, Kunihiko

2014-01-01

One of the significant topics in systems biology is to develop control theory of gene regulatory networks (GRNs). In typical control of GRNs, expression of some genes is inhibited (activated) by manipulating external stimuli and expression of other genes. It is expected to apply control theory of GRNs to gene therapy technologies in the future. In this paper, a control method using a Boolean network (BN) is studied. A BN is widely used as a model of GRNs, and gene expression is expressed by a binary value (ON or OFF). In particular, a context-sensitive probabilistic Boolean network (CS-PBN), which is one of the extended models of BNs, is used. For CS-PBNs, the verification problem and the optimal control problem are considered. For the verification problem, a solution method using the probabilistic model checker PRISM is proposed. For the optimal control problem, a solution method using polynomial optimization is proposed. Finally, a numerical example on the WNT5A network, which is related to melanoma, is presented. The proposed methods provide us useful tools in control theory of GRNs. PMID:24587766

Stability analysis for stochastic BAM nonlinear neural network with delays

NASA Astrophysics Data System (ADS)

Lv, Z. W.; Shu, H. S.; Wei, G. L.

2008-02-01

In this paper, stochastic bidirectional associative memory neural networks with constant or time-varying delays is considered. Based on a Lyapunov-Krasovskii functional and the stochastic stability analysis theory, we derive several sufficient conditions in order to guarantee the global asymptotically stable in the mean square. Our investigation shows that the stochastic bidirectional associative memory neural networks are globally asymptotically stable in the mean square if there are solutions to some linear matrix inequalities(LMIs). Hence, the global asymptotic stability of the stochastic bidirectional associative memory neural networks can be easily checked by the Matlab LMI toolbox. A numerical example is given to demonstrate the usefulness of the proposed global asymptotic stability criteria.

A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks

PubMed Central

Hammad, Karim; El Bakly, Ahmed M.

2018-01-01

A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem—subject to various Quality-of-Service (QoS) constraints—represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms. PMID:29509760

A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks.

PubMed

Ramadan, Rahab M; Gasser, Safa M; El-Mahallawy, Mohamed S; Hammad, Karim; El Bakly, Ahmed M

2018-01-01

A mobile ad hoc network is a conventional self-configuring network where the routing optimization problem-subject to various Quality-of-Service (QoS) constraints-represents a major challenge. Unlike previously proposed solutions, in this paper, we propose a memetic algorithm (MA) employing an adaptive mutation parameter, to solve the multicast routing problem with higher search ability and computational efficiency. The proposed algorithm utilizes an updated scheme, based on statistical analysis, to estimate the best values for all MA parameters and enhance MA performance. The numerical results show that the proposed MA improved the delay and jitter of the network, while reducing computational complexity as compared to existing algorithms.

Analytical solution for a class of network dynamics with mechanical and financial applications

NASA Astrophysics Data System (ADS)

Krejčí, P.; Lamba, H.; Melnik, S.; Rachinskii, D.

2014-09-01

We show that for a certain class of dynamics at the nodes the response of a network of any topology to arbitrary inputs is defined in a simple way by its response to a monotone input. The nodes may have either a discrete or continuous set of states and there is no limit on the complexity of the network. The results provide both an efficient numerical method and the potential for accurate analytic approximation of the dynamics on such networks. As illustrative applications, we introduce a quasistatic mechanical model with objects interacting via frictional forces and a financial market model with avalanches and critical behavior that are generated by momentum trading strategies.

Zero-sum two-player game theoretic formulation of affine nonlinear discrete-time systems using neural networks.

PubMed

Mehraeen, Shahab; Dierks, Travis; Jagannathan, S; Crow, Mariesa L

2013-12-01

In this paper, the nearly optimal solution for discrete-time (DT) affine nonlinear control systems in the presence of partially unknown internal system dynamics and disturbances is considered. The approach is based on successive approximate solution of the Hamilton-Jacobi-Isaacs (HJI) equation, which appears in optimal control. Successive approximation approach for updating control and disturbance inputs for DT nonlinear affine systems are proposed. Moreover, sufficient conditions for the convergence of the approximate HJI solution to the saddle point are derived, and an iterative approach to approximate the HJI equation using a neural network (NN) is presented. Then, the requirement of full knowledge of the internal dynamics of the nonlinear DT system is relaxed by using a second NN online approximator. The result is a closed-loop optimal NN controller via offline learning. A numerical example is provided illustrating the effectiveness of the approach.

Nested Fork-Join Queuing Networks and Their Application to Mobility Airfield Operations Analysis.

DTIC Science & Technology

1997-03-01

shortest queue length. Setia , Squillante, and Tripathi [109] extend Makowski and Nelson’s work by performing a quantitative assessment of a range of...Markov chains." Numerical Solution of Markov Chains, edited by W. J. Stewart, 63- 88. Basel: Marcel Dekker, 1991. [109] Setia , S. K., and others

Global dynamic optimization approach to predict activation in metabolic pathways.

PubMed

de Hijas-Liste, Gundián M; Klipp, Edda; Balsa-Canto, Eva; Banga, Julio R

2014-01-06

During the last decade, a number of authors have shown that the genetic regulation of metabolic networks may follow optimality principles. Optimal control theory has been successfully used to compute optimal enzyme profiles considering simple metabolic pathways. However, applying this optimal control framework to more general networks (e.g. branched networks, or networks incorporating enzyme production dynamics) yields problems that are analytically intractable and/or numerically very challenging. Further, these previous studies have only considered a single-objective framework. In this work we consider a more general multi-objective formulation and we present solutions based on recent developments in global dynamic optimization techniques. We illustrate the performance and capabilities of these techniques considering two sets of problems. First, we consider a set of single-objective examples of increasing complexity taken from the recent literature. We analyze the multimodal character of the associated non linear optimization problems, and we also evaluate different global optimization approaches in terms of numerical robustness, efficiency and scalability. Second, we consider generalized multi-objective formulations for several examples, and we show how this framework results in more biologically meaningful results. The proposed strategy was used to solve a set of single-objective case studies related to unbranched and branched metabolic networks of different levels of complexity. All problems were successfully solved in reasonable computation times with our global dynamic optimization approach, reaching solutions which were comparable or better than those reported in previous literature. Further, we considered, for the first time, multi-objective formulations, illustrating how activation in metabolic pathways can be explained in terms of the best trade-offs between conflicting objectives. This new methodology can be applied to metabolic networks with arbitrary topologies, non-linear dynamics and constraints.

Identification of Correlated GRACE Monthly Harmonic Coefficients Using Pattern Recognition and Neural Networks

NASA Astrophysics Data System (ADS)

Piretzidis, D.; Sra, G.; Sideris, M. G.

2016-12-01

This study explores new methods for identifying correlation errors in harmonic coefficients derived from monthly solutions of the Gravity Recovery and Climate Experiment (GRACE) satellite mission using pattern recognition and neural network algorithms. These correlation errors are evidenced in the differences between monthly solutions and can be suppressed using a de-correlation filter. In all studies so far, the implementation of the de-correlation filter starts from a specific minimum order (i.e., 11 for RL04 and 38 for RL05) until the maximum order of the monthly solution examined. This implementation method has two disadvantages, namely, the omission of filtering correlated coefficients of order less than the minimum order and the filtering of uncorrelated coefficients of order higher than the minimum order. In the first case, the filtered solution is not completely free of correlated errors, whereas the second case results in a monthly solution that suffers from loss of geophysical signal. In the present study, a new method of implementing the de-correlation filter is suggested, by identifying and filtering only the coefficients that show indications of high correlation. Several numerical and geometric properties of the harmonic coefficient series of all orders are examined. Extreme cases of both correlated and uncorrelated coefficients are selected, and their corresponding properties are used to train a two-layer feed-forward neural network. The objective of the neural network is to identify and quantify the correlation by providing the probability of an order of coefficients to be correlated. Results show good performance of the neural network, both in the validation stage of the training procedure and in the subsequent use of the trained network to classify independent coefficients. The neural network is also capable of identifying correlated coefficients even when a small number of training samples and neurons are used (e.g.,100 and 10, respectively).

Application of Stochastic Automata Networks for Creation of Continuous Time Markov Chain Models of Voltage Gating of Gap Junction Channels

PubMed Central

Pranevicius, Henrikas; Pranevicius, Mindaugas; Pranevicius, Osvaldas; Bukauskas, Feliksas F.

2015-01-01

The primary goal of this work was to study advantages of numerical methods used for the creation of continuous time Markov chain models (CTMC) of voltage gating of gap junction (GJ) channels composed of connexin protein. This task was accomplished by describing gating of GJs using the formalism of the stochastic automata networks (SANs), which allowed for very efficient building and storing of infinitesimal generator of the CTMC that allowed to produce matrices of the models containing a distinct block structure. All of that allowed us to develop efficient numerical methods for a steady-state solution of CTMC models. This allowed us to accelerate CPU time, which is necessary to solve CTMC models, ∼20 times. PMID:25705700

First-order design of geodetic networks using the simulated annealing method

NASA Astrophysics Data System (ADS)

Berné, J. L.; Baselga, S.

2004-09-01

The general problem of the optimal design for a geodetic network subject to any extrinsic factors, namely the first-order design problem, can be dealt with as a numeric optimization problem. The classic theory of this problem and the optimization methods are revised. Then the innovative use of the simulated annealing method, which has been successfully applied in other fields, is presented for this classical geodetic problem. This method, belonging to iterative heuristic techniques in operational research, uses a thermodynamical analogy to crystalline networks to offer a solution that converges probabilistically to the global optimum. Basic formulation and some examples are studied.

Global Mittag-Leffler stability analysis of fractional-order impulsive neural networks with one-side Lipschitz condition.

PubMed

Zhang, Xinxin; Niu, Peifeng; Ma, Yunpeng; Wei, Yanqiao; Li, Guoqiang

2017-10-01

This paper is concerned with the stability analysis issue of fractional-order impulsive neural networks. Under the one-side Lipschitz condition or the linear growth condition of activation function, the existence of solution is analyzed respectively. In addition, the existence, uniqueness and global Mittag-Leffler stability of equilibrium point of the fractional-order impulsive neural networks with one-side Lipschitz condition are investigated by the means of contraction mapping principle and Lyapunov direct method. Finally, an example with numerical simulation is given to illustrate the validity and feasibility of the proposed results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Numerical simulation of freshwater/seawater interaction in a dual-permeability karst system with conduits: the development of discrete-continuum VDFST-CFP model

NASA Astrophysics Data System (ADS)

Xu, Zexuan; Hu, Bill

2016-04-01

Dual-permeability karst aquifers of porous media and conduit networks with significant different hydrological characteristics are widely distributed in the world. Discrete-continuum numerical models, such as MODFLOW-CFP and CFPv2, have been verified as appropriate approaches to simulate groundwater flow and solute transport in numerical modeling of karst hydrogeology. On the other hand, seawater intrusion associated with fresh groundwater resources contamination has been observed and investigated in numbers of coastal aquifers, especially under conditions of sea level rise. Density-dependent numerical models including SEAWAT are able to quantitatively evaluate the seawater/freshwater interaction processes. A numerical model of variable-density flow and solute transport - conduit flow process (VDFST-CFP) is developed to provide a better description of seawater intrusion and submarine groundwater discharge in a coastal karst aquifer with conduits. The coupling discrete-continuum VDFST-CFP model applies Darcy-Weisbach equation to simulate non-laminar groundwater flow in the conduit system in which is conceptualized and discretized as pipes, while Darcy equation is still used in continuum porous media. Density-dependent groundwater flow and solute transport equations with appropriate density terms in both conduit and porous media systems are derived and numerically solved using standard finite difference method with an implicit iteration procedure. Synthetic horizontal and vertical benchmarks are created to validate the newly developed VDFST-CFP model by comparing with other numerical models such as variable density SEAWAT, couplings of constant density groundwater flow and solute transport MODFLOW/MT3DMS and discrete-continuum CFPv2/UMT3D models. VDFST-CFP model improves the simulation of density dependent seawater/freshwater mixing processes and exchanges between conduit and matrix. Continuum numerical models greatly overestimated the flow rate under turbulent flow condition but discrete-continuum models provide more accurate results. Parameters sensitivities analysis indicates that conduit diameter and friction factor, matrix hydraulic conductivity and porosity are important parameters that significantly affect variable-density flow and solute transport simulation. The pros and cons of model assumptions, conceptual simplifications and numerical techniques in VDFST-CFP are discussed. In general, the development of VDFST-CFP model is an innovation in numerical modeling methodology and could be applied to quantitatively evaluate the seawater/freshwater interaction in coastal karst aquifers. Keywords: Discrete-continuum numerical model; Variable density flow and transport; Coastal karst aquifer; Non-laminar flow

Gas network model allows full reservoir coupling

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

Methnani, M.M.

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

Spread of epidemic disease on networks

NASA Astrophysics Data System (ADS)

Newman, M. E.

2002-07-01

The study of social networks, and in particular the spread of disease on networks, has attracted considerable recent attention in the physics community. In this paper, we show that a large class of standard epidemiological models, the so-called susceptible/infective/removed (SIR) models can be solved exactly on a wide variety of networks. In addition to the standard but unrealistic case of fixed infectiveness time and fixed and uncorrelated probability of transmission between all pairs of individuals, we solve cases in which times and probabilities are nonuniform and correlated. We also consider one simple case of an epidemic in a structured population, that of a sexually transmitted disease in a population divided into men and women. We confirm the correctness of our exact solutions with numerical simulations of SIR epidemics on networks.

Fast Neural Solution Of A Nonlinear Wave Equation

NASA Technical Reports Server (NTRS)

Barhen, Jacob; Toomarian, Nikzad

1996-01-01

Neural algorithm for simulation of class of nonlinear wave phenomena devised. Numerically solves special one-dimensional case of Korteweg-deVries equation. Intended to be executed rapidly by neural network implemented as charge-coupled-device/charge-injection device, very-large-scale integrated-circuit analog data processor of type described in "CCD/CID Processors Would Offer Greater Precision" (NPO-18972).

Chrysler improved numerical differencing analyzer for third generation computers CINDA-3G

NASA Technical Reports Server (NTRS)

Gaski, J. D.; Lewis, D. R.; Thompson, L. R.

1972-01-01

New and versatile method has been developed to supplement or replace use of original CINDA thermal analyzer program in order to take advantage of improved systems software and machine speeds of third generation computers. CINDA-3G program options offer variety of methods for solution of thermal analog models presented in network format.

Simulation of heart rate variability model in a network

NASA Astrophysics Data System (ADS)

Cascaval, Radu C.; D'Apice, Ciro; D'Arienzo, Maria Pia

2017-07-01

We consider a 1-D model for the simulation of the blood flow in the cardiovascular system. As inflow condition we consider a model for the aortic valve. The opening and closing of the valve is dynamically determined by the pressure difference between the left ventricular and aortic pressures. At the outflow we impose a peripheral resistance model. To approximate the solution we use a numerical scheme based on the discontinuous Galerkin method. We also considering a variation in heart rate and terminal reflection coefficient due to monitoring of the pressure in the network.

Chaotic itinerancy in the oscillator neural network without Lyapunov functions.

PubMed

Uchiyama, Satoki; Fujisaka, Hirokazu

2004-09-01

Chaotic itinerancy (CI), which is defined as an incessant spontaneous switching phenomenon among attractor ruins in deterministic dynamical systems without Lyapunov functions, is numerically studied in the case of an oscillator neural network model. The model is the pseudoinverse-matrix version of the previous model [S. Uchiyama and H. Fujisaka, Phys. Rev. E 65, 061912 (2002)] that was studied theoretically with the aid of statistical neurodynamics. It is found that CI in neural nets can be understood as the intermittent dynamics of weakly destabilized chaotic retrieval solutions. Copyright 2004 American Institute of Physics

Exponentially convergent state estimation for delayed switched recurrent neural networks.

PubMed

Ahn, Choon Ki

2011-11-01

This paper deals with the delay-dependent exponentially convergent state estimation problem for delayed switched neural networks. A set of delay-dependent criteria is derived under which the resulting estimation error system is exponentially stable. It is shown that the gain matrix of the proposed state estimator is characterised in terms of the solution to a set of linear matrix inequalities (LMIs), which can be checked readily by using some standard numerical packages. An illustrative example is given to demonstrate the effectiveness of the proposed state estimator.

Mittag-Leffler synchronization of delayed fractional-order bidirectional associative memory neural networks with discontinuous activations: state feedback control and impulsive control schemes.

PubMed

Ding, Xiaoshuai; Cao, Jinde; Zhao, Xuan; Alsaadi, Fuad E

2017-08-01

This paper is concerned with the drive-response synchronization for a class of fractional-order bidirectional associative memory neural networks with time delays, as well as in the presence of discontinuous activation functions. The global existence of solution under the framework of Filippov for such networks is firstly obtained based on the fixed-point theorem for condensing map. Then the state feedback and impulsive controllers are, respectively, designed to ensure the Mittag-Leffler synchronization of these neural networks and two new synchronization criteria are obtained, which are expressed in terms of a fractional comparison principle and Razumikhin techniques. Numerical simulations are presented to validate the proposed methodologies.

A mathematical model for mesenchymal and chemosensitive cell dynamics.

PubMed

Häcker, Anita

2012-01-01

The structure of an underlying tissue network has a strong impact on cell dynamics. If, in addition, cells alter the network by mechanical and chemical interactions, their movement is called mesenchymal. Important examples for mesenchymal movement include fibroblasts in wound healing and metastatic tumour cells. This paper is focused on the latter. Based on the anisotropic biphasic theory of Barocas and Tranquillo, which models a fibre network and interstitial solution as two-component fluid, a mathematical model for the interactions of cells with a fibre network is developed. A new description for fibre reorientation is given and orientation-dependent proteolysis is added to the model. With respect to cell dynamics, the equation, based on anisotropic diffusion, is extended by haptotaxis and chemotaxis. The chemoattractants are the solute network fragments, emerging from proteolysis, and the epidermal growth factor which may guide the cells to a blood vessel. Moreover the cell migration is impeded at either high or low network density. This new model enables us to study chemotactic cell migration in a complex fibre network and the consequential network deformation. Numerical simulations for the cell migration and network deformation are carried out in two space dimensions. Simulations of cell migration in underlying tissue networks visualise the impact of the network structure on cell dynamics. In a scenario for fibre reorientation between cell clusters good qualitative agreement with experimental results is achieved. The invasion speeds of cells in an aligned and an isotropic fibre network are compared. © Springer-Verlag 2011

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.

Fast numerical methods for simulating large-scale integrate-and-fire neuronal networks.

PubMed

Rangan, Aaditya V; Cai, David

2007-02-01

We discuss numerical methods for simulating large-scale, integrate-and-fire (I&F) neuronal networks. Important elements in our numerical methods are (i) a neurophysiologically inspired integrating factor which casts the solution as a numerically tractable integral equation, and allows us to obtain stable and accurate individual neuronal trajectories (i.e., voltage and conductance time-courses) even when the I&F neuronal equations are stiff, such as in strongly fluctuating, high-conductance states; (ii) an iterated process of spike-spike corrections within groups of strongly coupled neurons to account for spike-spike interactions within a single large numerical time-step; and (iii) a clustering procedure of firing events in the network to take advantage of localized architectures, such as spatial scales of strong local interactions, which are often present in large-scale computational models-for example, those of the primary visual cortex. (We note that the spike-spike corrections in our methods are more involved than the correction of single neuron spike-time via a polynomial interpolation as in the modified Runge-Kutta methods commonly used in simulations of I&F neuronal networks.) Our methods can evolve networks with relatively strong local interactions in an asymptotically optimal way such that each neuron fires approximately once in [Formula: see text] operations, where N is the number of neurons in the system. We note that quantifications used in computational modeling are often statistical, since measurements in a real experiment to characterize physiological systems are typically statistical, such as firing rate, interspike interval distributions, and spike-triggered voltage distributions. We emphasize that it takes much less computational effort to resolve statistical properties of certain I&F neuronal networks than to fully resolve trajectories of each and every neuron within the system. For networks operating in realistic dynamical regimes, such as strongly fluctuating, high-conductance states, our methods are designed to achieve statistical accuracy when very large time-steps are used. Moreover, our methods can also achieve trajectory-wise accuracy when small time-steps are used.

An adaptive random search for short term generation scheduling with network constraints.

PubMed

Marmolejo, J A; Velasco, Jonás; Selley, Héctor J

2017-01-01

This paper presents an adaptive random search approach to address a short term generation scheduling with network constraints, which determines the startup and shutdown schedules of thermal units over a given planning horizon. In this model, we consider the transmission network through capacity limits and line losses. The mathematical model is stated in the form of a Mixed Integer Non Linear Problem with binary variables. The proposed heuristic is a population-based method that generates a set of new potential solutions via a random search strategy. The random search is based on the Markov Chain Monte Carlo method. The main key of the proposed method is that the noise level of the random search is adaptively controlled in order to exploring and exploiting the entire search space. In order to improve the solutions, we consider coupling a local search into random search process. Several test systems are presented to evaluate the performance of the proposed heuristic. We use a commercial optimizer to compare the quality of the solutions provided by the proposed method. The solution of the proposed algorithm showed a significant reduction in computational effort with respect to the full-scale outer approximation commercial solver. Numerical results show the potential and robustness of our approach.

An optimal modeling of multidimensional wave digital filtering network for free vibration analysis of symmetrically laminated composite FSDT plates

NASA Astrophysics Data System (ADS)

Tseng, Chien-Hsun

2015-02-01

The technique of multidimensional wave digital filtering (MDWDF) that builds on traveling wave formulation of lumped electrical elements, is successfully implemented on the study of dynamic responses of symmetrically laminated composite plate based on the first order shear deformation theory. The philosophy applied for the first time in this laminate mechanics relies on integration of certain principles involving modeling and simulation, circuit theory, and MD digital signal processing to provide a great variety of outstanding features. Especially benefited by the conservation of passivity gives rise to a nonlinear programming problem (NLP) for the issue of numerical stability of a MD discrete system. Adopting the augmented Lagrangian genetic algorithm, an effective optimization technique for rapidly achieving solution spaces of NLP models, numerical stability of the MDWDF network is well received at all time by the satisfaction of the Courant-Friedrichs-Levy stability criterion with the least restriction. In particular, optimum of the NLP has led to the optimality of the network in terms of effectively and accurately predicting the desired fundamental frequency, and thus to give an insight into the robustness of the network by looking at the distribution of system energies. To further explore the application of the optimum network, more numerical examples are engaged in efforts to achieve a qualitative understanding of the behavior of the laminar system. These are carried out by investigating various effects based on different stacking sequences, stiffness and span-to-thickness ratios, mode shapes and boundary conditions. Results are scrupulously validated by cross referencing with early published works, which show that the present method is in excellent agreement with other numerical and analytical methods.

Intercomparison of 3D pore-scale flow and solute transport simulation methods

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

Yang, Xiaofan; Mehmani, Yashar; Perkins, William A.

2016-09-01

Multiple numerical approaches have been developed to simulate porous media fluid flow and solute transport at the pore scale. These include methods that 1) explicitly model the three-dimensional geometry of pore spaces and 2) those that conceptualize the pore space as a topologically consistent set of stylized pore bodies and pore throats. In previous work we validated a model of class 1, based on direct numerical simulation using computational fluid dynamics (CFD) codes, against magnetic resonance velocimetry (MRV) measurements of pore-scale velocities. Here we expand that validation to include additional models of class 1 based on the immersed-boundary method (IMB),more » lattice Boltzmann method (LBM), smoothed particle hydrodynamics (SPH), as well as a model of class 2 (a pore-network model or PNM). The PNM approach used in the current study was recently improved and demonstrated to accurately simulate solute transport in a two-dimensional experiment. While the PNM approach is computationally much less demanding than direct numerical simulation methods, the effect of conceptualizing complex three-dimensional pore geometries on solute transport in the manner of PNMs has not been fully determined. We apply all four approaches (CFD, LBM, SPH and PNM) to simulate pore-scale velocity distributions and nonreactive solute transport, and intercompare the model results with previously reported experimental observations. Experimental observations are limited to measured pore-scale velocities, so solute transport comparisons are made only among the various models. Comparisons are drawn both in terms of macroscopic variables (e.g., permeability, solute breakthrough curves) and microscopic variables (e.g., local velocities and concentrations).« less

Cyclic deformation-induced solute transport in tissue scaffolds with computer designed, interconnected, pore networks: experiments and simulations.

PubMed

Den Buijs, Jorn Op; Dragomir-Daescu, Dan; Ritman, Erik L

2009-08-01

Nutrient supply and waste removal in porous tissue engineering scaffolds decrease from the periphery to the center, leading to limited depth of ingrowth of new tissue into the scaffold. However, as many tissues experience cyclic physiological strains, this may provide a mechanism to enhance solute transport in vivo before vascularization of the scaffold. The hypothesis of this study was that pore cross-sectional geometry and interconnectivity are of major importance for the effectiveness of cyclic deformation-induced solute transport. Transparent elastic polyurethane scaffolds, with computer-programmed design of pore networks in the form of interconnected channels, were fabricated using a 3D printing and injection molding technique. The scaffold pores were loaded with a colored tracer for optical contrast, cyclically compressed with deformations of 10 and 15% of the original undeformed height at 1.0 Hz. Digital imaging was used to quantify the spatial distribution of the tracer concentration within the pores. Numerical simulations of a fluid-structure interaction model of deformation-induced solute transport were compared to the experimental data. The results of experiments and modeling agreed well and showed that pore interconnectivity heavily influences deformation-induced solute transport. Pore cross-sectional geometry appears to be of less relative importance in interconnected pore networks. Validated computer models of solute transport can be used to design optimal scaffold pore geometries that will enhance the convective transport of nutrients inside the scaffold and the removal of waste, thus improving the cell survivability deep inside the scaffold.

Neural Network and Regression Soft Model Extended for PAX-300 Aircraft Engine

NASA Technical Reports Server (NTRS)

Patnaik, Surya N.; Hopkins, Dale A.

2002-01-01

In fiscal year 2001, the neural network and regression capabilities of NASA Glenn Research Center's COMETBOARDS design optimization testbed were extended to generate approximate models for the PAX-300 aircraft engine. The analytical model of the engine is defined through nine variables: the fan efficiency factor, the low pressure of the compressor, the high pressure of the compressor, the high pressure of the turbine, the low pressure of the turbine, the operating pressure, and three critical temperatures (T(sub 4), T(sub vane), and T(sub metal)). Numerical Propulsion System Simulation (NPSS) calculations of the specific fuel consumption (TSFC), as a function of the variables can become time consuming, and numerical instabilities can occur during these design calculations. "Soft" models can alleviate both deficiencies. These approximate models are generated from a set of high-fidelity input-output pairs obtained from the NPSS code and a design of the experiment strategy. A neural network and a regression model with 45 weight factors were trained for the input/output pairs. Then, the trained models were validated through a comparison with the original NPSS code. Comparisons of TSFC versus the operating pressure and of TSFC versus the three temperatures (T(sub 4), T(sub vane), and T(sub metal)) are depicted in the figures. The overall performance was satisfactory for both the regression and the neural network model. The regression model required fewer calculations than the neural network model, and it produced marginally superior results. Training the approximate methods is time consuming. Once trained, the approximate methods generated the solution with only a trivial computational effort, reducing the solution time from hours to less than a minute.

Connecting source aggregating areas with distributive regions via Optimal Transportation theory.

NASA Astrophysics Data System (ADS)

Lanzoni, S.; Putti, M.

2016-12-01

We study the application of Optimal Transport (OT) theory to the transfer of water and sediments from a distributed aggregating source to a distributing area connected by a erodible hillslope. Starting from the Monge-Kantorovich equations, We derive a global energy functional that nonlinearly combines the cost of constructing the drainage network over the entire domain and the cost of water and sediment transportation through the network. It can be shown that the minimization of this functional is equivalent to the infinite time solution of a system of diffusion partial differential equations coupled with transient ordinary differential equations, that closely resemble the classical conservation laws of water and sediments mass and momentum. We present several numerical simulations applied to realstic test cases. For example, the solution of the proposed model forms network configurations that share strong similiratities with rill channels formed on an hillslope. At a larger scale, we obtain promising results in simulating the network patterns that ensure a progressive and continuous transition from a drainage drainage area to a distributive receiving region.

On the time to steady state: insights from numerical modeling

NASA Astrophysics Data System (ADS)

Goren, L.; Willett, S.; McCoy, S. W.; Perron, J.

2013-12-01

How fast do fluvial landscapes approach steady state after an application of tectonic or climatic perturbation? While theory and some numerical models predict that the celerity of the advective wave (knickpoint) controls the response time for perturbations, experiments and other landscape evolution models demonstrate that the time to steady state is much longer than the theoretically predicted response time. We posit that the longevity of transient features and the time to steady state are controlled by the stability of the topology and geometry of channel networks. Evolution of a channel network occurs by a combination of discrete capture events and continuous migration of water divides, processes, which are difficult to represent accurately in landscape evolution models. We therefore address the question of the time to steady state using the DAC landscape evolution model that solves accurately for the location of water divides, using a combination of analytical solution for hillslopes and low-order channels together with a numerical solution for higher order channels. DAC also includes an explicit capture criterion. We have tested fundamental predictions from DAC and show that modeled networks reproduce natural network characteristics such as the Hack's exponent and coefficient and the fractal dimension. We define two steady-state criteria: a topographic steady state, defined by global, pointwise steady elevation, and a topological steady state defined as the state in which no further reorganization of the drainage network takes place. Analyzing block uplift simulations, we find that the time to achieve either topographic or topological steady state exceeds by an order of magnitude the theoretical response time of the fluvial network. The longevity of the transient state is the result of the area feedback, by which, migration of a divide changes the local contributing area. This change propagates downstream as a slope adjustment, forcing further divide migrations and area change in adjacent tributaries and basins. In order to characterize the evolution of the drainage network on its way to steady state, we define a proxy to steady state elevation, χ, which is also the characteristic parameter of the transient stream power PDE. Through simulations of tectonic tilting we find that reorganization tends to minimize moments of the χ distribution of the landscape and of Δχ across divides.

Gap Excitations and Series Loads in Microstrip Lines: Equivalent Network Characterization with Application to THz Circuits

NASA Technical Reports Server (NTRS)

Neto, Andrea; Siegel, Peter H.

2001-01-01

At submillimeter wavelengths typical gap discontinuities in microstrip, CPW lines or at antenna terminals, which might contain diodes or active elements, cannot be viewed as simple quasi statically evaluated lumped elements. Planar Schottky diodes at 2.5 THz, for example, have a footprint that is comparable to a wavelength. Thus, apart from modelling the diodes themselves, the connection with their exciting elements (antennas or microstrip) gives rise to parasitics. Full wave or strictly numeric approaches can be used to account for these parasitics but at the expense of generality of the solution and the CPU time of the calculation. In this paper an equivalent network is derived that accurately accounts for large gap discontinuities (with respect to a wavelength) without suffering from the limitations of available numeric techniques.

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.

Flight control with adaptive critic neural network

NASA Astrophysics Data System (ADS)

Han, Dongchen

2001-10-01

In this dissertation, the adaptive critic neural network technique is applied to solve complex nonlinear system control problems. Based on dynamic programming, the adaptive critic neural network can embed the optimal solution into a neural network. Though trained off-line, the neural network forms a real-time feedback controller. Because of its general interpolation properties, the neurocontroller has inherit robustness. The problems solved here are an agile missile control for U.S. Air Force and a midcourse guidance law for U.S. Navy. In the first three papers, the neural network was used to control an air-to-air agile missile to implement a minimum-time heading-reverse in a vertical plane corresponding to following conditions: a system without constraint, a system with control inequality constraint, and a system with state inequality constraint. While the agile missile is a one-dimensional problem, the midcourse guidance law is the first test-bed for multiple-dimensional problem. In the fourth paper, the neurocontroller is synthesized to guide a surface-to-air missile to a fixed final condition, and to a flexible final condition from a variable initial condition. In order to evaluate the adaptive critic neural network approach, the numerical solutions for these cases are also obtained by solving two-point boundary value problem with a shooting method. All of the results showed that the adaptive critic neural network could solve complex nonlinear system control problems.

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-02-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks.

Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network

PubMed Central

Goto, Hayato

2016-01-01

The dynamics of nonlinear systems qualitatively change depending on their parameters, which is called bifurcation. A quantum-mechanical nonlinear oscillator can yield a quantum superposition of two oscillation states, known as a Schrödinger cat state, via quantum adiabatic evolution through its bifurcation point. Here we propose a quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems. The nonlinear oscillator network finds optimal solutions via quantum adiabatic evolution, where nonlinear terms are increased slowly, in contrast to conventional adiabatic quantum computation or quantum annealing, where quantum fluctuation terms are decreased slowly. As a result of numerical simulations, it is concluded that quantum superposition and quantum fluctuation work effectively to find optimal solutions. It is also notable that the present computer is analogous to neural computers, which are also networks of nonlinear components. Thus, the present scheme will open new possibilities for quantum computation, nonlinear science, and artificial intelligence. PMID:26899997

[CYTED-RITMOS network: toward the search for solutions to promote mobile health in Latin America].

PubMed

Saigí-Rubió, Francesc; Novillo-Ortiz, David; Piette, John D

2017-05-25

The area of mobile technologies applied to health (mHealth) is a growing worldwide trend that has generated enormous expectations for the mitigation of problems related to medical services delivery and public health stemming from a lack of resources and the limited number of specialists. The numerous opportunities offered by mobile technologies, together with their ease of use, have attracted the interest both of governments and universities. This is the case of the Ibero-American Mobile Technologies and Health Network (CYTED-RITMOS, Spanish acronym). As a result of the network's first year of activity, in October 2015 the RITMOS International Workshop was held in Barcelona to present the priority areas in Latin America where research, development, and innovation (R&D+i) projects on mobile health could be carried out and possible solutions found. The objective of this article is to present the potentialities and applicability of mHealth in the Region of the Americas.

Dynamics of coupled mode solitons in bursting neural networks

NASA Astrophysics Data System (ADS)

Nfor, N. Oma; Ghomsi, P. Guemkam; Moukam Kakmeni, F. M.

2018-02-01

Using an electrically coupled chain of Hindmarsh-Rose neural models, we analytically derived the nonlinearly coupled complex Ginzburg-Landau equations. This is realized by superimposing the lower and upper cutoff modes of wave propagation and by employing the multiple scale expansions in the semidiscrete approximation. We explore the modified Hirota method to analytically obtain the bright-bright pulse soliton solutions of our nonlinearly coupled equations. With these bright solitons as initial conditions of our numerical scheme, and knowing that electrical signals are the basis of information transfer in the nervous system, it is found that prior to collisions at the boundaries of the network, neural information is purely conveyed by bisolitons at lower cutoff mode. After collision, the bisolitons are completely annihilated and neural information is now relayed by the upper cutoff mode via the propagation of plane waves. It is also shown that the linear gain of the system is inextricably linked to the complex physiological mechanisms of ion mobility, since the speeds and spatial profiles of the coupled nerve impulses vary with the gain. A linear stability analysis performed on the coupled system mainly confirms the instability of plane waves in the neural network, with a glaring example of the transition of weak plane waves into a dark soliton and then static kinks. Numerical simulations have confirmed the annihilation phenomenon subsequent to collision in neural systems. They equally showed that the symmetry breaking of the pulse solution of the system leaves in the network static internal modes, sometime referred to as Goldstone modes.

Dynamics of coupled mode solitons in bursting neural networks.

PubMed

Nfor, N Oma; Ghomsi, P Guemkam; Moukam Kakmeni, F M

2018-02-01

Using an electrically coupled chain of Hindmarsh-Rose neural models, we analytically derived the nonlinearly coupled complex Ginzburg-Landau equations. This is realized by superimposing the lower and upper cutoff modes of wave propagation and by employing the multiple scale expansions in the semidiscrete approximation. We explore the modified Hirota method to analytically obtain the bright-bright pulse soliton solutions of our nonlinearly coupled equations. With these bright solitons as initial conditions of our numerical scheme, and knowing that electrical signals are the basis of information transfer in the nervous system, it is found that prior to collisions at the boundaries of the network, neural information is purely conveyed by bisolitons at lower cutoff mode. After collision, the bisolitons are completely annihilated and neural information is now relayed by the upper cutoff mode via the propagation of plane waves. It is also shown that the linear gain of the system is inextricably linked to the complex physiological mechanisms of ion mobility, since the speeds and spatial profiles of the coupled nerve impulses vary with the gain. A linear stability analysis performed on the coupled system mainly confirms the instability of plane waves in the neural network, with a glaring example of the transition of weak plane waves into a dark soliton and then static kinks. Numerical simulations have confirmed the annihilation phenomenon subsequent to collision in neural systems. They equally showed that the symmetry breaking of the pulse solution of the system leaves in the network static internal modes, sometime referred to as Goldstone modes.

Optimal Routing and Control of Multiple Agents Moving in a Transportation Network and Subject to an Arrival Schedule and Separation Constraints

NASA Technical Reports Server (NTRS)

Sadovsky, A. V.; Davis, D.; Isaacson, D. R.

2012-01-01

We address the problem of navigating a set of moving agents, e.g. automated guided vehicles, through a transportation network so as to bring each agent to its destination at a specified time. Each pair of agents is required to be separated by a minimal distance, generally agent-dependent, at all times. The speed range, initial position, required destination, and required time of arrival at destination for each agent are assumed provided. The movement of each agent is governed by a controlled differential equation (state equation). The problem consists in choosing for each agent a path and a control strategy so as to meet the constraints and reach the destination at the required time. This problem arises in various fields of transportation, including Air Traffic Management and train coordination, and in robotics. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver.

Reduced-Order Direct Numerical Simulation of Solute Transport in Porous Media

NASA Astrophysics Data System (ADS)

Mehmani, Yashar; Tchelepi, Hamdi

2017-11-01

Pore-scale models are an important tool for analyzing fluid dynamics in porous materials (e.g., rocks, soils, fuel cells). Current direct numerical simulation (DNS) techniques, while very accurate, are computationally prohibitive for sample sizes that are statistically representative of the porous structure. Reduced-order approaches such as pore-network models (PNM) aim to approximate the pore-space geometry and physics to remedy this problem. Predictions from current techniques, however, have not always been successful. This work focuses on single-phase transport of a passive solute under advection-dominated regimes and delineates the minimum set of approximations that consistently produce accurate PNM predictions. Novel network extraction (discretization) and particle simulation techniques are developed and compared to high-fidelity DNS simulations for a wide range of micromodel heterogeneities and a single sphere pack. Moreover, common modeling assumptions in the literature are analyzed and shown that they can lead to first-order errors under advection-dominated regimes. This work has implications for optimizing material design and operations in manufactured (electrodes) and natural (rocks) porous media pertaining to energy systems. This work was supported by the Stanford University Petroleum Research Institute for Reservoir Simulation (SUPRI-B).

Convex relaxations for gas expansion planning

DOE PAGES

Borraz-Sanchez, Conrado; Bent, Russell Whitford; Backhaus, Scott N.; ...

2016-01-01

Expansion of natural gas networks is a critical process involving substantial capital expenditures with complex decision-support requirements. Here, given the non-convex nature of gas transmission constraints, global optimality and infeasibility guarantees can only be offered by global optimisation approaches. Unfortunately, state-of-the-art global optimisation solvers are unable to scale up to real-world size instances. In this study, we present a convex mixed-integer second-order cone relaxation for the gas expansion planning problem under steady-state conditions. The underlying model offers tight lower bounds with high computational efficiency. In addition, the optimal solution of the relaxation can often be used to derive high-quality solutionsmore » to the original problem, leading to provably tight optimality gaps and, in some cases, global optimal solutions. The convex relaxation is based on a few key ideas, including the introduction of flux direction variables, exact McCormick relaxations, on/off constraints, and integer cuts. Numerical experiments are conducted on the traditional Belgian gas network, as well as other real larger networks. The results demonstrate both the accuracy and computational speed of the relaxation and its ability to produce high-quality solution« less

A generalized optimization principle for asymmetric branching in fluidic networks

PubMed Central

Stephenson, David

2016-01-01

When applied to a branching network, Murray’s law states that the optimal branching of vascular networks is achieved when the cube of the parent channel radius is equal to the sum of the cubes of the daughter channel radii. It is considered integral to understanding biological networks and for the biomimetic design of artificial fluidic systems. However, despite its ubiquity, we demonstrate that Murray’s law is only optimal (i.e. maximizes flow conductance per unit volume) for symmetric branching, where the local optimization of each individual channel corresponds to the global optimum of the network as a whole. In this paper, we present a generalized law that is valid for asymmetric branching, for any cross-sectional shape, and for a range of fluidic models. We verify our analytical solutions with the numerical optimization of a bifurcating fluidic network for the examples of laminar, turbulent and non-Newtonian fluid flows. PMID:27493583

pth moment exponential stability of stochastic memristor-based bidirectional associative memory (BAM) neural networks with time delays.

PubMed

Wang, Fen; Chen, Yuanlong; Liu, Meichun

2018-02-01

Stochastic memristor-based bidirectional associative memory (BAM) neural networks with time delays play an increasingly important role in the design and implementation of neural network systems. Under the framework of Filippov solutions, the issues of the pth moment exponential stability of stochastic memristor-based BAM neural networks are investigated. By using the stochastic stability theory, Itô's differential formula and Young inequality, the criteria are derived. Meanwhile, with Lyapunov approach and Cauchy-Schwarz inequality, we derive some sufficient conditions for the mean square exponential stability of the above systems. The obtained results improve and extend previous works on memristor-based or usual neural networks dynamical systems. Four numerical examples are provided to illustrate the effectiveness of the proposed results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Limitations of demand- and pressure-driven modeling for large deficient networks

NASA Astrophysics Data System (ADS)

Braun, Mathias; Piller, Olivier; Deuerlein, Jochen; Mortazavi, Iraj

2017-10-01

The calculation of hydraulic state variables for a network is an important task in managing the distribution of potable water. Over the years the mathematical modeling process has been improved by numerous researchers for utilization in new computer applications and the more realistic modeling of water distribution networks. But, in spite of these continuous advances, there are still a number of physical phenomena that may not be tackled correctly by current models. This paper will take a closer look at the two modeling paradigms given by demand- and pressure-driven modeling. The basic equations are introduced and parallels are drawn with the optimization formulations from electrical engineering. These formulations guarantee the existence and uniqueness of the solution. One of the central questions of the French and German research project ResiWater is the investigation of the network resilience in the case of extreme events or disasters. Under such extraordinary conditions where models are pushed beyond their limits, we talk about deficient network models. Examples of deficient networks are given by highly regulated flow, leakage or pipe bursts and cases where pressure falls below the vapor pressure of water. These examples will be presented and analyzed on the solvability and physical correctness of the solution with respect to demand- and pressure-driven models.

Hopf Bifurcation Analysis of a Gene Regulatory Network Mediated by Small Noncoding RNA with Time Delays and Diffusion

NASA Astrophysics Data System (ADS)

Li, Chengxian; Liu, Haihong; Zhang, Tonghua; Yan, Fang

2017-12-01

In this paper, a gene regulatory network mediated by small noncoding RNA involving two time delays and diffusion under the Neumann boundary conditions is studied. Choosing the sum of delays as the bifurcation parameter, the stability of the positive equilibrium and the existence of spatially homogeneous and spatially inhomogeneous periodic solutions are investigated by analyzing the corresponding characteristic equation. It is shown that the sum of delays can induce Hopf bifurcation and the diffusion incorporated into the system can effect the amplitude of periodic solutions. Furthermore, the spatially homogeneous periodic solution always exists and the spatially inhomogeneous periodic solution will arise when the diffusion coefficients of protein and mRNA are suitably small. Particularly, the small RNA diffusion coefficient is more robust and its effect on model is much less than protein and mRNA. Finally, the explicit formulae for determining the direction of Hopf bifurcation and the stability of the bifurcating periodic solutions are derived by employing the normal form theory and center manifold theorem for partial functional differential equations. Finally, numerical simulations are carried out to illustrate our theoretical analysis.

Toward efficiency in heterogeneous multispecies reactive transport modeling: A particle-tracking solution for first-order network reactions

NASA Astrophysics Data System (ADS)

Henri, Christopher; Fernàndez-Garcia, Daniel

2015-04-01

Modeling multi-species reactive transport in natural systems with strong heterogeneities and complex biochemical reactions is a major challenge for assessing groundwater polluted sites with organic and inorganic contaminants. A large variety of these contaminants react according to serial-parallel reaction networks commonly simplified by a combination of first-order kinetic reactions. In this context, a random-walk particle tracking method is presented. This method is capable of efficiently simulating the motion of particles affected by first-order network reactions in three-dimensional systems, which are represented by spatially variable physical and biochemical coefficients described at high resolution. The approach is based on the development of transition probabilities that describe the likelihood that particles belonging to a given species and location at a given time will be transformed into and moved to another species and location afterwards. These probabilities are derived from the solution matrix of the spatial moments governing equations. The method is fully coupled with reactions, free of numerical dispersion and overcomes the inherent numerical problems stemming from the incorporation of heterogeneities to reactive transport codes. In doing this, we demonstrate that the motion of particles follows a standard random walk with time-dependent effective retardation and dispersion parameters that depend on the initial and final chemical state of the particle. The behavior of effective parameters develops as a result of differential retardation effects among species. Moreover, explicit analytic solutions of the transition probability matrix and related particle motions are provided for serial reactions. An example of the effect of heterogeneity on the dechlorination of organic solvents in a three-dimensional random porous media shows that the power-law behavior typically observed in conservative tracers breakthrough curves can be largely compromised by the effect of biochemical reactions.

Toward efficiency in heterogeneous multispecies reactive transport modeling: A particle-tracking solution for first-order network reactions

NASA Astrophysics Data System (ADS)

Henri, Christopher V.; Fernàndez-Garcia, Daniel

2014-09-01

Modeling multispecies reactive transport in natural systems with strong heterogeneities and complex biochemical reactions is a major challenge for assessing groundwater polluted sites with organic and inorganic contaminants. A large variety of these contaminants react according to serial-parallel reaction networks commonly simplified by a combination of first-order kinetic reactions. In this context, a random-walk particle tracking method is presented. This method is capable of efficiently simulating the motion of particles affected by first-order network reactions in three-dimensional systems, which are represented by spatially variable physical and biochemical coefficients described at high resolution. The approach is based on the development of transition probabilities that describe the likelihood that particles belonging to a given species and location at a given time will be transformed into and moved to another species and location afterward. These probabilities are derived from the solution matrix of the spatial moments governing equations. The method is fully coupled with reactions, free of numerical dispersion and overcomes the inherent numerical problems stemming from the incorporation of heterogeneities to reactive transport codes. In doing this, we demonstrate that the motion of particles follows a standard random walk with time-dependent effective retardation and dispersion parameters that depend on the initial and final chemical state of the particle. The behavior of effective parameters develops as a result of differential retardation effects among species. Moreover, explicit analytic solutions of the transition probability matrix and related particle motions are provided for serial reactions. An example of the effect of heterogeneity on the dechlorination of organic solvents in a three-dimensional random porous media shows that the power-law behavior typically observed in conservative tracers breakthrough curves can be largely compromised by the effect of biochemical reactions.

Cournot games with network effects for electric power markets

NASA Astrophysics Data System (ADS)

Spezia, Carl John

The electric utility industry is moving from regulated monopolies with protected service areas to an open market with many wholesale suppliers competing for consumer load. This market is typically modeled by a Cournot game oligopoly where suppliers compete by selecting profit maximizing quantities. The classical Cournot model can produce multiple solutions when the problem includes typical power system constraints. This work presents a mathematical programming formulation of oligopoly that produces unique solutions when constraints limit the supplier outputs. The formulation casts the game as a supply maximization problem with power system physical limits and supplier incremental profit functions as constraints. The formulation gives Cournot solutions identical to other commonly used algorithms when suppliers operate within the constraints. Numerical examples demonstrate the feasibility of the theory. The results show that the maximization formulation will give system operators more transmission capacity when compared to the actions of suppliers in a classical constrained Cournot game. The results also show that the profitability of suppliers in constrained networks depends on their location relative to the consumers' load concentration.

A new surface-process model for landscape evolution at a mountain belt scale

NASA Astrophysics Data System (ADS)

Willett, Sean D.; Braun, Jean; Herman, Frederic

2010-05-01

We present a new surface process model designed for modeling surface erosion and mass transport at an orogenic scale. Modeling surface processes at a large-scale is difficult because surface geomorphic processes are frequently described at the scale of a few meters, and such resolution cannot be represented in orogen-scale models operating over hundreds of square kilometers. We circumvent this problem by implementing a hybrid numerical -- analytical model. Like many previous models, the model is based on a numerical fluvial network represented by a series of nodes linked by model rivers in a descending network, with fluvial incision and sediment transport defined by laws operating on this network. However we only represent the largest rivers in the landscape by nodes in this model. Low-order rivers and water divides between large rivers are determined from analytical solutions assuming steady-state conditions with respect to the local river channel. The analytical solution includes the same fluvial incision law as the large rivers and a channel head with a specified size and mean slope. This permits a precise representation of the position of water divides between river basins. This is a key characteristic in landscape evolution as divide migration provides a positive feedback between river incision and a consequent increase in drainage area. The analytical solution also provides an explicit criterion for river capture, which occurs once a water divide migrates to its neighboring channel. This algorithm avoids the artificial network organization that often results from meshing and remeshing algorithms in numerical models. We demonstrate the use of this model with several simple examples including uniform uplift of a block, simultaneous uplift and shortening of a block, and a model involving strike slip faulting. We find a strong dependence on initial condition, but also a surprisingly strong dependence on channel head height parameters. Low channel heads, as expected, lead to more fluvial capture, but with low initial relief initial and a small channel-head height, runaway capture is common, with a few rivers capturing much of the available drainage area. With larger channel-head relief, lateral capture of rivers is less common, resulting in evenly spaced river basins. Basin spacing ratios matching those observed in nature are obtained for specific channel head parameters. These models thus demonstrate the mixed control on basin characteristics by antecedent river networks and channel-head parameters, which control the mobility of drainage basin water divides.

An Incentive-based Online Optimization Framework for Distribution Grids

DOE PAGES

Zhou, Xinyang; Dall'Anese, Emiliano; Chen, Lijun; ...

2017-10-09

This article formulates a time-varying social-welfare maximization problem for distribution grids with distributed energy resources (DERs) and develops online distributed algorithms to identify (and track) its solutions. In the considered setting, network operator and DER-owners pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. The proposed algorithm affords an online implementation to enable tracking of the solutions in the presence of time-varying operational conditions and changing optimization objectives. It involves a strategy where the network operator collects voltage measurements throughout the feeder to build incentive signals for the DER-owners in real time; DERs thenmore » adjust the generated/consumed powers in order to avoid the violation of the voltage constraints while maximizing given objectives. Stability of the proposed schemes is analytically established and numerically corroborated.« less

An Incentive-based Online Optimization Framework for Distribution Grids

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

Zhou, Xinyang; Dall'Anese, Emiliano; Chen, Lijun

This article formulates a time-varying social-welfare maximization problem for distribution grids with distributed energy resources (DERs) and develops online distributed algorithms to identify (and track) its solutions. In the considered setting, network operator and DER-owners pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. The proposed algorithm affords an online implementation to enable tracking of the solutions in the presence of time-varying operational conditions and changing optimization objectives. It involves a strategy where the network operator collects voltage measurements throughout the feeder to build incentive signals for the DER-owners in real time; DERs thenmore » adjust the generated/consumed powers in order to avoid the violation of the voltage constraints while maximizing given objectives. Stability of the proposed schemes is analytically established and numerically corroborated.« less

A gradual update method for simulating the steady-state solution of stiff differential equations in metabolic circuits.

PubMed

Shiraishi, Emi; Maeda, Kazuhiro; Kurata, Hiroyuki

2009-02-01

Numerical simulation of differential equation systems plays a major role in the understanding of how metabolic network models generate particular cellular functions. On the other hand, the classical and technical problems for stiff differential equations still remain to be solved, while many elegant algorithms have been presented. To relax the stiffness problem, we propose new practical methods: the gradual update of differential-algebraic equations based on gradual application of the steady-state approximation to stiff differential equations, and the gradual update of the initial values in differential-algebraic equations. These empirical methods show a high efficiency for simulating the steady-state solutions for the stiff differential equations that existing solvers alone cannot solve. They are effective in extending the applicability of dynamic simulation to biochemical network models.

Fluid Stochastic Petri Nets: Theory, Applications, and Solution

NASA Technical Reports Server (NTRS)

Horton, Graham; Kulkarni, Vidyadhar G.; Nicol, David M.; Trivedi, Kishor S.

1996-01-01

In this paper we introduce a new class of stochastic Petri nets in which one or more places can hold fluid rather than discrete tokens. We define a class of fluid stochastic Petri nets in such a way that the discrete and continuous portions may affect each other. Following this definition we provide equations for their transient and steady-state behavior. We present several examples showing the utility of the construct in communication network modeling and reliability analysis, and discuss important special cases. We then discuss numerical methods for computing the transient behavior of such nets. Finally, some numerical examples are presented.

Modeling transmission parameters of polymer microstructured fibers for applications in FTTH networks

NASA Astrophysics Data System (ADS)

Gdula, P.; Welikow, K.; Szczepański, P.; Buczyński, R.; Piramidowicz, R.

2011-10-01

This paper is focused on selected aspects of designing and modeling of transmission parameters of plastic optical fibers (POFs), considered in the context of their potential applications in optical access networks and, specifically, in Fiber-To- The-Home (FTTH) systems. The survey of state-of-the-art solutions is presented and possibility of improving transmission properties of POFs by microstructurization is discussed on the basis of the first results of numerical modeling. In particular, the microstructured POF was designed supporting propagation of limited number of modes while keeping relatively large mode area and, simultaneously, significantly lowered bending losses.

Modeling the controllable pH-responsive swelling and pore size of networked alginate based biomaterials.

PubMed

Chan, Ariel W; Neufeld, Ronald J

2009-10-01

Semisynthetic network alginate polymer (SNAP), synthesized by acetalization of linear alginate with di-aldehyde, is a pH-responsive tetrafunctionally linked 3D gel network, and has potential application in oral delivery of protein therapeutics and active biologicals, and as tissue bioscaffold for regenerative medicine. A constitutive polyelectrolyte gel model based on non-Gaussian polymer elasticity, Flory-Huggins liquid lattice theory, and non-ideal Donnan membrane equilibria was derived, to describe SNAP gel swelling in dilute and ionic solutions containing uni-univalent, uni-bivalent, bi-univalent or bi-bi-valent electrolyte solutions. Flory-Huggins interaction parameters as a function of ionic strength and characteristic ratio of alginates of various molecular weights were determined experimentally to numerically predict SNAP hydrogel swelling. SNAP hydrogel swells pronouncedly to 1000 times in dilute solution, compared to its compact polymer volume, while behaving as a neutral polymer with limited swelling in high ionic strength or low pH solutions. The derived model accurately describes the pH-responsive swelling of SNAP hydrogel in acid and alkaline solutions of wide range of ionic strength. The pore sizes of the synthesized SNAP hydrogels of various crosslink densities were estimated from the derived model to be in the range of 30-450 nm which were comparable to that measured by thermoporometry, and diffusion of bovine serum albumin. The derived equilibrium swelling model can characterize hydrogel structure such as molecular weight between crosslinks and crosslinking density, or can be used as predictive model for swelling, pore size and mechanical properties if gel structural information is known, and can potentially be applied to other point-link network polyelectrolytes such as hyaluronic acid gel.

Cyclic Deformation-Induced Solute Transport in Tissue Scaffolds with Computer Designed, Interconnected, Pore Networks: Experiments and Simulations

PubMed Central

Op Den Buijs, Jorn; Dragomir-Daescu, Dan; Ritman, Erik L.

2014-01-01

Nutrient supply and waste removal in porous tissue engineering scaffolds decrease from the periphery to the center, leading to limited depth of ingrowth of new tissue into the scaffold. However, as many tissues experience cyclic physiological strains, this may provide a mechanism to enhance solute transport in vivo before vascularization of the scaffold. The hypothesis of this study was that pore cross-sectional geometry and interconnectivity are of major importance for the effectiveness of cyclic deformation-induced solute transport. Transparent elastic polyurethane scaffolds, with computer-programmed design of pore networks in the form of interconnected channels, were fabricated using a 3D printing and injection molding technique. The scaffold pores were loaded with a colored tracer for optical contrast, cyclically compressed with deformations of 10 and 15% of the original undeformed height at 1.0 Hz. Digital imaging was used to quantify the spatial distribution of the tracer concentration within the pores. Numerical simulations of a fluid–structure interaction model of deformation-induced solute transport were compared to the experimental data. The results of experiments and modeling agreed well and showed that pore interconnectivity heavily influences deformation-induced solute transport. Pore cross-sectional geometry appears to be of less relative importance in interconnected pore networks. Validated computer models of solute transport can be used to design optimal scaffold pore geometries that will enhance the convective transport of nutrients inside the scaffold and the removal of waste, thus improving the cell survivability deep inside the scaffold. PMID:19466547

Construction of 3-D Earth Models for Station Specific Path Corrections by Dynamic Ray Tracing

DTIC Science & Technology

2001-10-01

the numerical eikonal solution method of Vidale (1988) being used by the MIT led consortium. The model construction described in this report relies...assembled. REFERENCES Barazangi, M., Fielding, E., Isacks, B. & Seber, D., (1996), Geophysical And Geological Databases And Ctbt...preprint download6). Fielding, E., Isacks, B.L., and Baragangi. M. (1992), A Network Accessible Geological and Geophysical Database for

Uncertainty in Damage Detection, Dynamic Propagation and Just-in-Time Networks

DTIC Science & Technology

2015-08-03

estimated parameter uncertainty in dynamic data sets; high order compact finite difference schemes for Helmholtz equations with discontinuous wave numbers...delay differential equations with a Gamma distributed delay. We found that with the same population size the histogram plots for the solution to the...schemes for Helmholtz equations with discontinuous wave numbers across interfaces. • We carried out numerical sensitivity analysis with respect to

Elements of an algorithm for optimizing a parameter-structural neural network

NASA Astrophysics Data System (ADS)

Mrówczyńska, Maria

2016-06-01

The field of processing information provided by measurement results is one of the most important components of geodetic technologies. The dynamic development of this field improves classic algorithms for numerical calculations in the aspect of analytical solutions that are difficult to achieve. Algorithms based on artificial intelligence in the form of artificial neural networks, including the topology of connections between neurons have become an important instrument connected to the problem of processing and modelling processes. This concept results from the integration of neural networks and parameter optimization methods and makes it possible to avoid the necessity to arbitrarily define the structure of a network. This kind of extension of the training process is exemplified by the algorithm called the Group Method of Data Handling (GMDH), which belongs to the class of evolutionary algorithms. The article presents a GMDH type network, used for modelling deformations of the geometrical axis of a steel chimney during its operation.

Hand-waving and interpretive dance: an introductory course on tensor networks

NASA Astrophysics Data System (ADS)

Bridgeman, Jacob C.; Chubb, Christopher T.

2017-06-01

The curse of dimensionality associated with the Hilbert space of spin systems provides a significant obstruction to the study of condensed matter systems. Tensor networks have proven an important tool in attempting to overcome this difficulty in both the numerical and analytic regimes. These notes form the basis for a seven lecture course, introducing the basics of a range of common tensor networks and algorithms. In particular, we cover: introductory tensor network notation, applications to quantum information, basic properties of matrix product states, a classification of quantum phases using tensor networks, algorithms for finding matrix product states, basic properties of projected entangled pair states, and multiscale entanglement renormalisation ansatz states. The lectures are intended to be generally accessible, although the relevance of many of the examples may be lost on students without a background in many-body physics/quantum information. For each lecture, several problems are given, with worked solutions in an ancillary file.

Capacity planning of a wide-sense nonblocking generalized survivable network

NASA Astrophysics Data System (ADS)

Ho, Kwok Shing; Cheung, Kwok Wai

2006-06-01

Generalized survivable networks (GSNs) have two interesting properties that are essential attributes for future backbone networks--full survivability against link failures and support for dynamic traffic demands. GSNs incorporate the nonblocking network concept into the survivable network models. Given a set of nodes and a topology that is at least two-edge connected, a certain minimum capacity is required for each edge to form a GSN. The edge capacity is bounded because each node has an input-output capacity limit that serves as a constraint for any allowable traffic demand matrix. The GSN capacity planning problem is nondeterministic polynomial time (NP) hard. We first give a rigorous mathematical framework; then we offer two different solution approaches. The two-phase approach is fast, but the joint optimization approach yields a better bound. We carried out numerical computations for eight networks with different topologies and found that the cost of a GSN is only a fraction (from 52% to 89%) more than that of a static survivable network.

A simple model for the evolution of a non-Abelian cosmic string network

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

Cella, G.; Pieroni, M., E-mail: giancarlo.cella@pi.infn.it, E-mail: mauro.pieroni@apc.univ-paris7.fr

2016-06-01

In this paper we present the results of numerical simulations intended to study the behavior of non-Abelian cosmic strings networks. In particular we are interested in discussing the variations in the asymptotic behavior of the system as we variate the number of generators for the topological defects. A simple model which allows for cosmic strings is presented and its lattice discretization is discussed. The evolution of the generated cosmic string networks is then studied for different values for the number of generators for the topological defects. Scaling solution appears to be approached in most cases and we present an argumentmore » to justify the lack of scaling for the residual cases.« less

Coverage-maximization in networks under resource constraints.

PubMed

Nandi, Subrata; Brusch, Lutz; Deutsch, Andreas; Ganguly, Niloy

2010-06-01

Efficient coverage algorithms are essential for information search or dispersal in all kinds of networks. We define an extended coverage problem which accounts for constrained resources of consumed bandwidth B and time T . Our solution to the network challenge is here studied for regular grids only. Using methods from statistical mechanics, we develop a coverage algorithm with proliferating message packets and temporally modulated proliferation rate. The algorithm performs as efficiently as a single random walker but O(B(d-2)/d) times faster, resulting in significant service speed-up on a regular grid of dimension d . The algorithm is numerically compared to a class of generalized proliferating random walk strategies and on regular grids shown to perform best in terms of the product metric of speed and efficiency.

Preferential attachment in multiple trade networks

NASA Astrophysics Data System (ADS)

Foschi, Rachele; Riccaboni, Massimo; Schiavo, Stefano

2014-08-01

In this paper we develop a model for the evolution of multiple networks which is able to replicate the concentrated and sparse nature of world trade data. Our model is an extension of the preferential attachment growth model to the case of multiple networks. Countries trade a variety of goods of different complexity. Every country progressively evolves from trading less sophisticated to high-tech goods. The probabilities of capturing more trade opportunities at a given level of complexity and of starting to trade more complex goods are both proportional to the number of existing trade links. We provide a set of theoretical predictions and simulative results. A calibration exercise shows that our model replicates the same concentration level of world trade as well as the sparsity pattern of the trade matrix. We also discuss a set of numerical solutions to deal with large multiple networks.

The Statistical Mechanics of Dilute, Disordered Systems

NASA Astrophysics Data System (ADS)

Blackburn, Roger Michael

Available from UMI in association with The British Library. Requires signed TDF. A graph partitioning problem with variable inter -partition costs is studied by exploiting its mapping on to the Ashkin-Teller spin glass. The cavity method is used to derive the TAP equations and free energy for both extensively connected and dilute systems. Unlike Ising and Potts spin glasses, the self-consistent equation for the distribution of effective fields does not have a solution solely made up of delta functions. Numerical integration is used to find the stable solution, from which the ground state energy is calculated. Simulated annealing is used to test the results. The retrieving activity distribution for networks of boolean functions trained as associative memories for optimal capacity is derived. For infinite networks, outputs are shown to be frozen, in contrast to dilute asymmetric networks trained with the Hebb rule. For finite networks, a steady leaking to the non-retrieving attractor is demonstrated. Simulations of quenched networks are reported which show a departure from this picture: some configurations remain frozen for all time, while others follow cycles of small periods. An estimate of the critical capacity from the simulations is found to be in broad agreement with recent analytical results. The existing theory is extended to include noise on recall, and the behaviour is found to be robust to noise up to order 1/c^2 for networks with connectivity c.

Generation of Complex Karstic Conduit Networks with a Hydro-chemical Model

NASA Astrophysics Data System (ADS)

De Rooij, R.; Graham, W. D.

2016-12-01

The discrete-continuum approach is very well suited to simulate flow and solute transport within karst aquifers. Using this approach, discrete one-dimensional conduits are embedded within a three-dimensional continuum representative of the porous limestone matrix. Typically, however, little is known about the geometry of the karstic conduit network. As such the discrete-continuum approach is rarely used for practical applications. It may be argued, however, that the uncertainty associated with the geometry of the network could be handled by modeling an ensemble of possible karst conduit networks within a stochastic framework. We propose to generate stochastically realistic karst conduit networks by simulating the widening of conduits as caused by the dissolution of limestone over geological relevant timescales. We illustrate that advanced numerical techniques permit to solve the non-linear and coupled hydro-chemical processes efficiently, such that relatively large and complex networks can be generated in acceptable time frames. Instead of specifying flow boundary conditions on conduit cells to recharge the network as is typically done in classical speleogenesis models, we specify an effective rainfall rate over the land surface and let model physics determine the amount of water entering the network. This is advantageous since the amount of water entering the network is extremely difficult to reconstruct, whereas the effective rainfall rate may be quantified using paleoclimatic data. Furthermore, we show that poorly known flow conditions may be constrained by requiring a realistic flow field. Using our speleogenesis model we have investigated factors that influence the geometry of simulated conduit networks. We illustrate that our model generates typical branchwork, network and anastomotic conduit systems. Flow, solute transport and water ages in karst aquifers are simulated using a few illustrative networks.

Large-scale P2P network based distributed virtual geographic environment (DVGE)

NASA Astrophysics Data System (ADS)

Tan, Xicheng; Yu, Liang; Bian, Fuling

2007-06-01

Virtual Geographic Environment has raised full concern as a kind of software information system that helps us understand and analyze the real geographic environment, and it has also expanded to application service system in distributed environment--distributed virtual geographic environment system (DVGE), and gets some achievements. However, limited by the factor of the mass data of VGE, the band width of network, as well as numerous requests and economic, etc. DVGE still faces some challenges and problems which directly cause the current DVGE could not provide the public with high-quality service under current network mode. The Rapid development of peer-to-peer network technology has offered new ideas of solutions to the current challenges and problems of DVGE. Peer-to-peer network technology is able to effectively release and search network resources so as to realize efficient share of information. Accordingly, this paper brings forth a research subject on Large-scale peer-to-peer network extension of DVGE as well as a deep study on network framework, routing mechanism, and DVGE data management on P2P network.

Separation-Compliant, Optimal Routing and Control of Scheduled Arrivals in a Terminal Airspace

NASA Technical Reports Server (NTRS)

Sadovsky, Alexander V.; Davis, Damek; Isaacson, Douglas R.

2013-01-01

We address the problem of navigating a set (fleet) of aircraft in an aerial route network so as to bring each aircraft to its destination at a specified time and with minimal distance separation assured between all aircraft at all times. The speed range, initial position, required destination, and required time of arrival at destination for each aircraft are assumed provided. Each aircraft's movement is governed by a controlled differential equation (state equation). The problem consists in choosing for each aircraft a path in the route network and a control strategy so as to meet the constraints and reach the destination at the required time. The main contribution of the paper is a model that allows to recast this problem as a decoupled collection of problems in classical optimal control and is easily generalized to the case when inertia cannot be neglected. Some qualitative insight into solution behavior is obtained using the Pontryagin Maximum Principle. Sample numerical solutions are computed using a numerical optimal control solver. The proposed model is first step toward increasing the fidelity of continuous time control models of air traffic in a terminal airspace. The Pontryagin Maximum Principle implies the polygonal shape of those portions of the state trajectories away from those states in which one or more aircraft pair are at minimal separation. The model also confirms the intuition that, the narrower the allowed speed ranges of the aircraft, the smaller the space of optimal solutions, and that an instance of the optimal control problem may not have a solution at all (i.e., no control strategy that meets the separation requirement and other constraints).

Mixed Integer Programming and Heuristic Scheduling for Space Communication

NASA Technical Reports Server (NTRS)

Lee, Charles H.; Cheung, Kar-Ming

2013-01-01

Optimal planning and scheduling for a communication network was created where the nodes within the network are communicating at the highest possible rates while meeting the mission requirements and operational constraints. The planning and scheduling problem was formulated in the framework of Mixed Integer Programming (MIP) to introduce a special penalty function to convert the MIP problem into a continuous optimization problem, and to solve the constrained optimization problem using heuristic optimization. The communication network consists of space and ground assets with the link dynamics between any two assets varying with respect to time, distance, and telecom configurations. One asset could be communicating with another at very high data rates at one time, and at other times, communication is impossible, as the asset could be inaccessible from the network due to planetary occultation. Based on the network's geometric dynamics and link capabilities, the start time, end time, and link configuration of each view period are selected to maximize the communication efficiency within the network. Mathematical formulations for the constrained mixed integer optimization problem were derived, and efficient analytical and numerical techniques were developed to find the optimal solution. By setting up the problem using MIP, the search space for the optimization problem is reduced significantly, thereby speeding up the solution process. The ratio of the dimension of the traditional method over the proposed formulation is approximately an order N (single) to 2*N (arraying), where N is the number of receiving antennas of a node. By introducing a special penalty function, the MIP problem with non-differentiable cost function and nonlinear constraints can be converted into a continuous variable problem, whose solution is possible.

Whole Brain Networks for Treatment for Epilepsy

DTIC Science & Technology

2012-07-01

target. For the numerical approach, we applied both a simultaneous over- relaxation method (e.g. Gauss - Seidel ) and a biconjugate gradient...with b=1000sec/mm 2 and 7 b=0 acquisitions) was acquired on a Siemens TIM Trio (Siemens Medical Solutions, Erlangen) followed by iterative motion...partly from the difficulty with which the Monte Carlo approach is able to determine track densities at regions distal to the seed. Much iteration is

Aiding flow Thermo-Solutal Convection in Porous Cavity: ANN approach

NASA Astrophysics Data System (ADS)

Jafer Kazi1, Mohammed; Ameer Ahamad, N.; Yunus Khan, T. M.

2017-08-01

The transfer of thermal energy along with the diffusion of mass is common phenomenon that occurs in nature. The thermos-solutal convection in porous medium arises due to combined effect of diffusion of heat as well as mass inside the domain. The density variation of fluid due to absorbed heat at one end of porous cavity leads to fluid movement which in turn initiates the heat transfer. The mass diffusion inside the porous regime occurs due to concentration difference between two ends of cavity. Generally this phenomenon is studied with the help of numerical methods but current work emphasis the successful usage of artificial neural network in predicting the thermos-solutal convection of aiding flow in porous medium.

Electrical circuit modeling and analysis of microwave acoustic interaction with biological tissues.

PubMed

Gao, Fei; Zheng, Qian; Zheng, Yuanjin

2014-05-01

Numerical study of microwave imaging and microwave-induced thermoacoustic imaging utilizes finite difference time domain (FDTD) analysis for simulation of microwave and acoustic interaction with biological tissues, which is time consuming due to complex grid-segmentation and numerous calculations, not straightforward due to no analytical solution and physical explanation, and incompatible with hardware development requiring circuit simulator such as SPICE. In this paper, instead of conventional FDTD numerical simulation, an equivalent electrical circuit model is proposed to model the microwave acoustic interaction with biological tissues for fast simulation and quantitative analysis in both one and two dimensions (2D). The equivalent circuit of ideal point-like tissue for microwave-acoustic interaction is proposed including transmission line, voltage-controlled current source, envelop detector, and resistor-inductor-capacitor (RLC) network, to model the microwave scattering, thermal expansion, and acoustic generation. Based on which, two-port network of the point-like tissue is built and characterized using pseudo S-parameters and transducer gain. Two dimensional circuit network including acoustic scatterer and acoustic channel is also constructed to model the 2D spatial information and acoustic scattering effect in heterogeneous medium. Both FDTD simulation, circuit simulation, and experimental measurement are performed to compare the results in terms of time domain, frequency domain, and pseudo S-parameters characterization. 2D circuit network simulation is also performed under different scenarios including different sizes of tumors and the effect of acoustic scatterer. The proposed circuit model of microwave acoustic interaction with biological tissue could give good agreement with FDTD simulated and experimental measured results. The pseudo S-parameters and characteristic gain could globally evaluate the performance of tumor detection. The 2D circuit network enables the potential to combine the quasi-numerical simulation and circuit simulation in a uniform simulator for codesign and simulation of a microwave acoustic imaging system, bridging bioeffect study and hardware development seamlessly.

A fully coupled method for massively parallel simulation of hydraulically driven fractures in 3-dimensions: FULLY COUPLED PARALLEL SIMULATION OF HYDRAULIC FRACTURES IN 3-D

DOE PAGES

Settgast, Randolph R.; Fu, Pengcheng; Walsh, Stuart D. C.; ...

2016-09-18

This study describes a fully coupled finite element/finite volume approach for simulating field-scale hydraulically driven fractures in three dimensions, using massively parallel computing platforms. The proposed method is capable of capturing realistic representations of local heterogeneities, layering and natural fracture networks in a reservoir. A detailed description of the numerical implementation is provided, along with numerical studies comparing the model with both analytical solutions and experimental results. The results demonstrate the effectiveness of the proposed method for modeling large-scale problems involving hydraulically driven fractures in three dimensions.

A fully coupled method for massively parallel simulation of hydraulically driven fractures in 3-dimensions: FULLY COUPLED PARALLEL SIMULATION OF HYDRAULIC FRACTURES IN 3-D

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

Settgast, Randolph R.; Fu, Pengcheng; Walsh, Stuart D. C.

This study describes a fully coupled finite element/finite volume approach for simulating field-scale hydraulically driven fractures in three dimensions, using massively parallel computing platforms. The proposed method is capable of capturing realistic representations of local heterogeneities, layering and natural fracture networks in a reservoir. A detailed description of the numerical implementation is provided, along with numerical studies comparing the model with both analytical solutions and experimental results. The results demonstrate the effectiveness of the proposed method for modeling large-scale problems involving hydraulically driven fractures in three dimensions.

Parallel Computation of Unsteady Flows on a Network of Workstations

NASA Technical Reports Server (NTRS)

1997-01-01

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

Periodicity and global exponential stability of generalized Cohen-Grossberg neural networks with discontinuous activations and mixed delays.

PubMed

Wang, Dongshu; Huang, Lihong

2014-03-01

In this paper, we investigate the periodic dynamical behaviors for a class of general Cohen-Grossberg neural networks with discontinuous right-hand sides, time-varying and distributed delays. By means of retarded differential inclusions theory and the fixed point theorem of multi-valued maps, the existence of periodic solutions for the neural networks is obtained. After that, we derive some sufficient conditions for the global exponential stability and convergence of the neural networks, in terms of nonsmooth analysis theory with generalized Lyapunov approach. Without assuming the boundedness (or the growth condition) and monotonicity of the discontinuous neuron activation functions, our results will also be valid. Moreover, our results extend previous works not only on discrete time-varying and distributed delayed neural networks with continuous or even Lipschitz continuous activations, but also on discrete time-varying and distributed delayed neural networks with discontinuous activations. We give some numerical examples to show the applicability and effectiveness of our main results. Copyright © 2013 Elsevier Ltd. All rights reserved.

A recurrent neural network for solving bilevel linear programming problem.

PubMed

He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie; Huang, Junjian

2014-04-01

In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.

The Artificial Neural Networks Based on Scalarization Method for a Class of Bilevel Biobjective Programming Problem

PubMed Central

Chen, Zhong; Liu, June; Li, Xiong

2017-01-01

A two-stage artificial neural network (ANN) based on scalarization method is proposed for bilevel biobjective programming problem (BLBOP). The induced set of the BLBOP is firstly expressed as the set of minimal solutions of a biobjective optimization problem by using scalar approach, and then the whole efficient set of the BLBOP is derived by the proposed two-stage ANN for exploring the induced set. In order to illustrate the proposed method, seven numerical examples are tested and compared with results in the classical literature. Finally, a practical problem is solved by the proposed algorithm. PMID:29312446

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.

A link prediction method for heterogeneous networks based on BP neural network

NASA Astrophysics Data System (ADS)

Li, Ji-chao; Zhao, Dan-ling; Ge, Bing-Feng; Yang, Ke-Wei; Chen, Ying-Wu

2018-04-01

Most real-world systems, composed of different types of objects connected via many interconnections, can be abstracted as various complex heterogeneous networks. Link prediction for heterogeneous networks is of great significance for mining missing links and reconfiguring networks according to observed information, with considerable applications in, for example, friend and location recommendations and disease-gene candidate detection. In this paper, we put forward a novel integrated framework, called MPBP (Meta-Path feature-based BP neural network model), to predict multiple types of links for heterogeneous networks. More specifically, the concept of meta-path is introduced, followed by the extraction of meta-path features for heterogeneous networks. Next, based on the extracted meta-path features, a supervised link prediction model is built with a three-layer BP neural network. Then, the solution algorithm of the proposed link prediction model is put forward to obtain predicted results by iteratively training the network. Last, numerical experiments on the dataset of examples of a gene-disease network and a combat network are conducted to verify the effectiveness and feasibility of the proposed MPBP. It shows that the MPBP with very good performance is superior to the baseline methods.

A reaction-based paradigm to model reactive chemical transport in groundwater with general kinetic and equilibrium reactions.

PubMed

Zhang, Fan; Yeh, Gour-Tsyh; Parker, Jack C; Brooks, Scott C; Pace, Molly N; Kim, Young-Jin; Jardine, Philip M; Watson, David B

2007-06-16

This paper presents a reaction-based water quality transport model in subsurface flow systems. Transport of chemical species with a variety of chemical and physical processes is mathematically described by M partial differential equations (PDEs). Decomposition via Gauss-Jordan column reduction of the reaction network transforms M species reactive transport equations into two sets of equations: a set of thermodynamic equilibrium equations representing N(E) equilibrium reactions and a set of reactive transport equations of M-N(E) kinetic-variables involving no equilibrium reactions (a kinetic-variable is a linear combination of species). The elimination of equilibrium reactions from reactive transport equations allows robust and efficient numerical integration. The model solves the PDEs of kinetic-variables rather than individual chemical species, which reduces the number of reactive transport equations and simplifies the reaction terms in the equations. A variety of numerical methods are investigated for solving the coupled transport and reaction equations. Simulation comparisons with exact solutions were performed to verify numerical accuracy and assess the effectiveness of various numerical strategies to deal with different application circumstances. Two validation examples involving simulations of uranium transport in soil columns are presented to evaluate the ability of the model to simulate reactive transport with complex reaction networks involving both kinetic and equilibrium reactions.

Unifying Pore Network Modeling, Continuous Time Random Walk Theory and Experiment - Accomplishments and Future Directions

NASA Astrophysics Data System (ADS)

Bijeljic, B.

2008-05-01

This talk will describe and highlight the advantages offered by a methodology that unifies pore network modeling, CTRW theory and experiment in description of solute dispersion in porous media. Solute transport in a porous medium is characterized by the interplay of advection and diffusion (described by Peclet number, Pe) that cause spreading of solute particles. This spreading is traditionally described by dispersion coefficients, D, defined by σ 2 = 2Dt, where σ 2 is the variance of the solute position and t is the time. Using a pore-scale network model based on particle tracking, the rich Peclet- number dependence of dispersion coefficient is predicted from first principles and is shown to compare well with experimental data for restricted diffusion, transition, power-law and mechanical dispersion regimes in the asymptotic limit. In the asymptotic limit D is constant and can be used in an averaged advection-dispersion equation. However, it is highly important to recognize that, until the velocity field is fully sampled, the particle transport is non-Gaussian and D possesses temporal or spatial variation. Furthermore, temporal probability density functions (PDF) of tracer particles are studied in pore networks and an excellent agreement for the spectrum of transition times for particles from pore to pore is obtained between network model results and CTRW theory. Based on the truncated power-law interpretation of PDF-s, the physical origin of the power-law scaling of dispersion coefficient vs. Peclet number has been explained for unconsolidated porous media, sands and a number of sandstones, arriving at the same conclusion from numerical network modelling, analytic CTRW theory and experiment. Future directions for further applications of the methodology presented are discussed in relation to the scale- dependent solute dispersion and reactive transport. Significance of pre-asymptotic dispersion in porous media is addressed from pore-scale upwards and the impact of heterogeneity is discussed. The length traveled by solute plumes before Gaussian behaviour is reached increases with an increase in heterogeneity and/or Pe. This opens up the question on the nature of dispersion in natural systems where the heterogeneities at the larger scales will profoundly increase the range of velocities in the aquifer, thus considerably delaying the asymptotic approach to Gaussian behaviour. As a consequence, the asymptotic behaviour might not be reached at the field scale.

Application of the Undifferenced GNSS Precise Positioning in Determining Coordinates in National Reference Frames

NASA Astrophysics Data System (ADS)

Krzan, Grzegorz; Stępniak, Katarzyna

2017-09-01

In high-accuracy positioning using GNSS, the most common solution is still relative positioning using double-difference observations of dual-frequency measurements. An increasingly popular alternative to relative positioning are undifferenced approaches, which are designed to make full use of modern satellite systems and signals. Positions referenced to global International Terrestrial Reference Frame (ITRF2008) obtained from Precise Point Positioning (PPP) or Undifferenced (UD) network solutions have to be transformed to national (regional) reference frame, which introduces additional bases related to the transformation process. In this paper, satellite observations from two test networks using different observation time series were processed. The first test concerns the positioning accuracy from processing one year of dual-frequency GPS observations from 14 EUREF Permanent Network (EPN) stations using NAPEOS 3.3.1 software. The results were transformed into a national reference frame (PL-ETRF2000) and compared to positions from an EPN cumulative solution, which was adopted as the true coordinates. Daily observations were processed using PPP and UD multi-station solutions to determine the final accuracy resulting from satellite positioning, the transformation to national coordinate systems and Eurasian intraplate plate velocities. The second numerical test involved similar processing strategies of post-processing carried out using different observation time series (30 min., 1 hour, 2 hours, daily) and different classes of GNSS receivers. The centimeter accuracy of results presented in the national coordinate system satisfies the requirements of many surveying and engineering applications.

A novel profit-allocation strategy for SDN enterprises

NASA Astrophysics Data System (ADS)

Hu, Wei; Hou, Ye; Tian, Longwei; Li, Yuan

2017-01-01

Aiming to solve the problem of profit allocation for supply and demand network (SDN) enterprises that ignores risk factors and generates low satisfaction, a novel profit-allocation model based on cooperative game theory and TOPSIS is proposed. This new model avoids the defect of the single-profit allocation model by introducing risk factors, compromise coefficients and high negotiation points. By measuring the Euclidean distance between the ideal solution vector and the negative ideal solution vector, every node's satisfaction problem for the SDN was resolved, and the mess phenomenon was avoided. Finally, the rationality and effectiveness of the proposed model was verified using a numerical example.

Efficient implementation of a 3-dimensional ADI method on the iPSC/860

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

Van der Wijngaart, R.F.

1993-12-31

A comparison is made between several domain decomposition strategies for the solution of three-dimensional partial differential equations on a MIMD distributed memory parallel computer. The grids used are structured, and the numerical algorithm is ADI. Important implementation issues regarding load balancing, storage requirements, network latency, and overlap of computations and communications are discussed. Results of the solution of the three-dimensional heat equation on the Intel iPSC/860 are presented for the three most viable methods. It is found that the Bruno-Cappello decomposition delivers optimal computational speed through an almost complete elimination of processor idle time, while providing good memory efficiency.

Controllability of switched singular mix-valued logical control networks with constraints

NASA Astrophysics Data System (ADS)

Deng, Lei; Gong, Mengmeng; Zhu, Peiyong

2018-03-01

The present paper investigates the controllability problem of switched singular mix-valued logical control networks (SSMLCNs) with constraints on states and controls. First, using the semi-tenser product (STP) of matrices, the SSMLCN is expressed in an algebraic form, based on which a necessary and sufficient condition is given for the uniqueness of solution of SSMLCNs. Second, a necessary and sufficient criteria is derived for the controllability of constrained SSMLCNs, by converting a constrained SSMLCN into a parallel constrained switched mix-valued logical control network. Third, an algorithm is presented to design a proper switching sequence and a control scheme which force a state to a reachable state. Finally, a numerical example is given to demonstrate the efficiency of the results obtained in this paper.

O(t-α)-synchronization and Mittag-Leffler synchronization for the fractional-order memristive neural networks with delays and discontinuous neuron activations.

PubMed

Chen, Jiejie; Chen, Boshan; Zeng, Zhigang

2018-04-01

This paper investigates O(t -α )-synchronization and adaptive Mittag-Leffler synchronization for the fractional-order memristive neural networks with delays and discontinuous neuron activations. Firstly, based on the framework of Filippov solution and differential inclusion theory, using a Razumikhin-type method, some sufficient conditions ensuring the global O(t -α )-synchronization of considered networks are established via a linear-type discontinuous control. Next, a new fractional differential inequality is established and two new discontinuous adaptive controller is designed to achieve Mittag-Leffler synchronization between the drive system and the response systems using this inequality. Finally, two numerical simulations are given to show the effectiveness of the theoretical results. Our approach and theoretical results have a leading significance in the design of synchronized fractional-order memristive neural networks circuits involving discontinuous activations and time-varying delays. Copyright © 2018 Elsevier Ltd. All rights reserved.

Transition Characteristic Analysis of Traffic Evolution Process for Urban Traffic Network

PubMed Central

Chen, Hong; Li, Yang

2014-01-01

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

H∞ state estimation of stochastic memristor-based neural networks with time-varying delays.

PubMed

Bao, Haibo; Cao, Jinde; Kurths, Jürgen; Alsaedi, Ahmed; Ahmad, Bashir

2018-03-01

This paper addresses the problem of H ∞ state estimation for a class of stochastic memristor-based neural networks with time-varying delays. Under the framework of Filippov solution, the stochastic memristor-based neural networks are transformed into systems with interval parameters. The present paper is the first to investigate the H ∞ state estimation problem for continuous-time Itô-type stochastic memristor-based neural networks. By means of Lyapunov functionals and some stochastic technique, sufficient conditions are derived to ensure that the estimation error system is asymptotically stable in the mean square with a prescribed H ∞ performance. An explicit expression of the state estimator gain is given in terms of linear matrix inequalities (LMIs). Compared with other results, our results reduce control gain and control cost effectively. Finally, numerical simulations are provided to demonstrate the efficiency of the theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

Physical approach to quantum networks with massive particles

NASA Astrophysics Data System (ADS)

Andersen, Molte Emil Strange; Zinner, Nikolaj Thomas

2018-04-01

Assembling large-scale quantum networks is a key goal of modern physics research with applications in quantum information and computation. Quantum wires and waveguides in which massive particles propagate in tailored confinement is one promising platform for realizing a quantum network. In the literature, such networks are often treated as quantum graphs, that is, the wave functions are taken to live on graphs of one-dimensional edges meeting in vertices. Hitherto, it has been unclear what boundary conditions on the vertices produce the physical states one finds in nature. This paper treats a quantum network from a physical approach, explicitly finds the physical eigenstates and compares them to the quantum-graph description. The basic building block of a quantum network is an X-shaped potential well made by crossing two quantum wires, and we consider a massive particle in such an X well. The system is analyzed using a variational method based on an expansion into modes with fast convergence and it provides a very clear intuition for the physics of the problem. The particle is found to have a ground state that is exponentially localized to the center of the X well, and the other symmetric solutions are formed so to be orthogonal to the ground state. This is in contrast to the predictions of the conventionally used so-called Kirchoff boundary conditions in quantum graph theory that predict a different sequence of symmetric solutions that cannot be physically realized. Numerical methods have previously been the only source of information on the ground-state wave function and our results provide a different perspective with strong analytical insights. The ground-state wave function has a spatial profile that looks very similar to the shape of a solitonic solution to a nonlinear Schrödinger equation, enabling an analytical prediction of the wave number. When combining multiple X wells into a network or grid, each site supports a solitonlike localized state. These localized solutions only couple to each other and are able to jump from one site to another as if they were trapped in a discrete lattice.

3D printing application and numerical simulations in a fracture system

NASA Astrophysics Data System (ADS)

Yoon, H.; Martinez, M. J.

2017-12-01

The hydrogeological and mechanical properties in fractured and porous media are fundamental to predicting coupled multiphysics processes in the subsurface. Recent advances in experimental methods and multi-scale imaging capabilities have revolutionized our ability to quantitatively characterize geomaterials and digital counterparts are now routinely used for numerical simulations to characterize petrophysical and mechanical properties across scales. 3D printing is a very effective and creative technique that reproduce the digital images in a controlled way. For geoscience applications, 3D printing can be co-opted to print reproducible porous and fractured structures derived from CT-imaging of actual rocks and theoretical algorithms for experimental testing. In this work we used a stereolithography (SLA) method to create a single fracture network. The fracture in shale was first scanned using a microCT system and then the digital fracture network was printed into two parts and assembled. Aperture ranges from 0.3 to 1 mm. In particular, we discuss the design of single fracture network and the progress of printing practices to reproduce the fracture network system. Printed samples at different scales are used to measure the permeability and surface roughness. Various numerical simulations including (non-)reactive transport and multiphase flow cases are performed to study fluid flow characterization. We will also discuss the innovative advancement of 3D printing techniques applicable for coupled processes in the subsurface. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC., a wholly owned subsidiary of Honeywell International, Inc., for the U.S. Department of Energy's National Nuclear Security Administration under contract DE-NA0003525.

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-03-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to:

Hermite Functional Link Neural Network for Solving the Van der Pol-Duffing Oscillator Equation.

PubMed

Mall, Susmita; Chakraverty, S

2016-08-01

Hermite polynomial-based functional link artificial neural network (FLANN) is proposed here to solve the Van der Pol-Duffing oscillator equation. A single-layer hermite neural network (HeNN) model is used, where a hidden layer is replaced by expansion block of input pattern using Hermite orthogonal polynomials. A feedforward neural network model with the unsupervised error backpropagation principle is used for modifying the network parameters and minimizing the computed error function. The Van der Pol-Duffing and Duffing oscillator equations may not be solved exactly. Here, approximate solutions of these types of equations have been obtained by applying the HeNN model for the first time. Three mathematical example problems and two real-life application problems of Van der Pol-Duffing oscillator equation, extracting the features of early mechanical failure signal and weak signal detection problems, are solved using the proposed HeNN method. HeNN approximate solutions have been compared with results obtained by the well known Runge-Kutta method. Computed results are depicted in term of graphs. After training the HeNN model, we may use it as a black box to get numerical results at any arbitrary point in the domain. Thus, the proposed HeNN method is efficient. The results reveal that this method is reliable and can be applied to other nonlinear problems too.

Hybrid optical CDMA-FSO communications network under spatially correlated gamma-gamma scintillation.

PubMed

Jurado-Navas, Antonio; Raddo, Thiago R; Garrido-Balsells, José María; Borges, Ben-Hur V; Olmos, Juan José Vegas; Monroy, Idelfonso Tafur

2016-07-25

In this paper, we propose a new hybrid network solution based on asynchronous optical code-division multiple-access (OCDMA) and free-space optical (FSO) technologies for last-mile access networks, where fiber deployment is impractical. The architecture of the proposed hybrid OCDMA-FSO network is thoroughly described. The users access the network in a fully asynchronous manner by means of assigned fast frequency hopping (FFH)-based codes. In the FSO receiver, an equal gain-combining technique is employed along with intensity modulation and direct detection. New analytical formalisms for evaluating the average bit error rate (ABER) performance are also proposed. These formalisms, based on the spatially correlated gamma-gamma statistical model, are derived considering three distinct scenarios, namely, uncorrelated, totally correlated, and partially correlated channels. Numerical results show that users can successfully achieve error-free ABER levels for the three scenarios considered as long as forward error correction (FEC) algorithms are employed. Therefore, OCDMA-FSO networks can be a prospective alternative to deliver high-speed communication services to access networks with deficient fiber infrastructure.

An evolutionary game approach for determination of the structural conflicts in signed networks

PubMed Central

Tan, Shaolin; Lü, Jinhu

2016-01-01

Social or biochemical networks can often divide into two opposite alliances in response to structural conflicts between positive (friendly, activating) and negative (hostile, inhibiting) interactions. Yet, the underlying dynamics on how the opposite alliances are spontaneously formed to minimize the structural conflicts is still unclear. Here, we demonstrate that evolutionary game dynamics provides a felicitous possible tool to characterize the evolution and formation of alliances in signed networks. Indeed, an evolutionary game dynamics on signed networks is proposed such that each node can adaptively adjust its choice of alliances to maximize its own fitness, which yet leads to a minimization of the structural conflicts in the entire network. Numerical experiments show that the evolutionary game approach is universally efficient in quality and speed to find optimal solutions for all undirected or directed, unweighted or weighted signed networks. Moreover, the evolutionary game approach is inherently distributed. These characteristics thus suggest the evolutionary game dynamic approach as a feasible and effective tool for determining the structural conflicts in large-scale on-line signed networks. PMID:26915581

Solute drag in polycrystalline materials: Derivation and numerical analysis of a variational model for the effect of solute on the motion of boundaries and junctions during coarsening

NASA Astrophysics Data System (ADS)

Wilson, Seth Robert

A mathematical model that results in an expression for the local acceleration of a network of sharp interfaces interacting with an ambient solute field is proposed. This expression comprises a first-order differential equation for the local velocity that, given the appropriate initial conditions, may be used to predict the subsequent time evolution of the system, including non-steady state absorption and desorption of solute. Evolution equations for both interfaces and the junction of interfaces are derived by maximizing a functional approximating the rate at which the local Gibbs free energy density decreases, as a function of the local solute content and the instantaneous velocity. The model has been formulated in three dimensions, and non-equilibrium effects such as grain boundary diffusion, solute gradients, and time-dependant segregation are taken into account. As a consequence of this model, it is shown that both interfaces and the junctions between interfaces obey evolution equations that closely resemble Newton's second law. In particular, the concept of "thrust" in variable-mass systems is shown to have a direct analog in solute-interface interaction. Numerical analysis of the equations that result reveals that a double cusp catastrophe governs the behavior of the solute-interface system, for which trajectories that include hysteresis, slip-stick motion, and jerky motion are all conceivable. The geometry of the cusp catastrophe is quantified, and a number of relations between physical parameters and system behavior are consequently predicted.

Prediction of matching condition for a microstrip subsystem using artificial neural network and adaptive neuro-fuzzy inference system

NASA Astrophysics Data System (ADS)

Salehi, Mohammad Reza; Noori, Leila; Abiri, Ebrahim

2016-11-01

In this paper, a subsystem consisting of a microstrip bandpass filter and a microstrip low noise amplifier (LNA) is designed for WLAN applications. The proposed filter has a small implementation area (49 mm2), small insertion loss (0.08 dB) and wide fractional bandwidth (FBW) (61%). To design the proposed LNA, the compact microstrip cells, an field effect transistor, and only a lumped capacitor are used. It has a low supply voltage and a low return loss (-40 dB) at the operation frequency. The matching condition of the proposed subsystem is predicted using subsystem analysis, artificial neural network (ANN) and adaptive neuro-fuzzy inference system (ANFIS). To design the proposed filter, the transmission matrix of the proposed resonator is obtained and analysed. The performance of the proposed ANN and ANFIS models is tested using the numerical data by four performance measures, namely the correlation coefficient (CC), the mean absolute error (MAE), the average percentage error (APE) and the root mean square error (RMSE). The obtained results show that these models are in good agreement with the numerical data, and a small error between the predicted values and numerical solution is obtained.

On the Deduction of Galactic Abundances with Evolutionary Neural Networks

NASA Astrophysics Data System (ADS)

Taylor, M.; Diaz, A. I.

2007-12-01

A growing number of indicators are now being used with some confidence to measure the metallicity(Z) of photoionisation regions in planetary nebulae, galactic HII regions(GHIIRs), extra-galactic HII regions(EGHIIRs) and HII galaxies(HIIGs). However, a universal indicator valid also at high metallicities has yet to be found. Here, we report on a new artificial intelligence-based approach to determine metallicity indicators that shows promise for the provision of improved empirical fits. The method hinges on the application of an evolutionary neural network to observational emission line data. The network's DNA, encoded in its architecture, weights and neuron transfer functions, is evolved using a genetic algorithm. Furthermore, selection, operating on a set of 10 distinct neuron transfer functions, means that the empirical relation encoded in the network solution architecture is in functional rather than numerical form. Thus the network solutions provide an equation for the metallicity in terms of line ratios without a priori assumptions. Tapping into the mathematical power offered by this approach, we applied the network to detailed observations of both nebula and auroral emission lines from 0.33μ m-1μ m for a sample of 96 HII-type regions and we were able to obtain an empirical relation between Z and S_{23} with a dispersion of only 0.16 dex. We show how the method can be used to identify new diagnostics as well as the nonlinear relationship supposed to exist between the metallicity Z, ionisation parameter U and effective (or equivalent) temperature T*.

The impact of competing zealots on opinion dynamics

NASA Astrophysics Data System (ADS)

Verma, Gunjan; Swami, Ananthram; Chan, Kevin

2014-02-01

An individual’s opinion on an issue is greatly impacted by others in his or her social network. Most people are open-minded and ready to change their opinion when presented evidence; however, some are zealots or inflexibles, that is, individuals who refuse to change their opinion while staunchly advocating an opinion in hopes of convincing others. Zealotry is present in opinions of significant personal investment, such as political, religious or corporate affiliation; it tends to be less commonplace in opinions involving rumors or fashion trends. In this paper, we examine the effect that zealots have in a population whose opinion dynamics obey the naming game model. We present numerical and analytical results about the number and nature of steady state solutions, demonstrating the existence of a bifurcation in the space of zealot fractions. Our analysis indicates conditions under which a minority zealot opinion ultimately prevails, and conditions under which neither opinion attains a majority. We also present numerical and simulation analysis of finite populations and on networks with partial connectivity.

Generalized networking engineering: optimal pricing and routing in multiservice networks

NASA Astrophysics Data System (ADS)

Mitra, Debasis; Wang, Qiong

2002-07-01

One of the functions of network engineering is to allocate resources optimally to forecasted demand. We generalize the mechanism by incorporating price-demand relationships into the problem formulation, and optimizing pricing and routing jointly to maximize total revenue. We consider a network, with fixed topology and link bandwidths, that offers multiple services, such as voice and data, each having characteristic price elasticity of demand, and quality of service and policy requirements on routing. Prices, which depend on service type and origin-destination, determine demands, that are routed, subject to their constraints, so as to maximize revenue. We study the basic properties of the optimal solution and prove that link shadow costs provide the basis for both optimal prices and optimal routing policies. We investigate the impact of input parameters, such as link capacities and price elasticities, on prices, demand growth, and routing policies. Asymptotic analyses, in which network bandwidth is scaled to grow, give results that are noteworthy for their qualitative insights. Several numerical examples illustrate the analyses.

Estimation of parameters in rational reaction rates of molecular biological systems via weighted least squares

NASA Astrophysics Data System (ADS)

Wu, Fang-Xiang; Mu, Lei; Shi, Zhong-Ke

2010-01-01

The models of gene regulatory networks are often derived from statistical thermodynamics principle or Michaelis-Menten kinetics equation. As a result, the models contain rational reaction rates which are nonlinear in both parameters and states. It is challenging to estimate parameters nonlinear in a model although there have been many traditional nonlinear parameter estimation methods such as Gauss-Newton iteration method and its variants. In this article, we develop a two-step method to estimate the parameters in rational reaction rates of gene regulatory networks via weighted linear least squares. This method takes the special structure of rational reaction rates into consideration. That is, in the rational reaction rates, the numerator and the denominator are linear in parameters. By designing a special weight matrix for the linear least squares, parameters in the numerator and the denominator can be estimated by solving two linear least squares problems. The main advantage of the developed method is that it can produce the analytical solutions to the estimation of parameters in rational reaction rates which originally is nonlinear parameter estimation problem. The developed method is applied to a couple of gene regulatory networks. The simulation results show the superior performance over Gauss-Newton method.

Utilizing Maximal Independent Sets as Dominating Sets in Scale-Free Networks

NASA Astrophysics Data System (ADS)

Derzsy, N.; Molnar, F., Jr.; Szymanski, B. K.; Korniss, G.

Dominating sets provide key solution to various critical problems in networked systems, such as detecting, monitoring, or controlling the behavior of nodes. Motivated by graph theory literature [Erdos, Israel J. Math. 4, 233 (1966)], we studied maximal independent sets (MIS) as dominating sets in scale-free networks. We investigated the scaling behavior of the size of MIS in artificial scale-free networks with respect to multiple topological properties (size, average degree, power-law exponent, assortativity), evaluated its resilience to network damage resulting from random failure or targeted attack [Molnar et al., Sci. Rep. 5, 8321 (2015)], and compared its efficiency to previously proposed dominating set selection strategies. We showed that, despite its small set size, MIS provides very high resilience against network damage. Using extensive numerical analysis on both synthetic and real-world (social, biological, technological) network samples, we demonstrate that our method effectively satisfies four essential requirements of dominating sets for their practical applicability on large-scale real-world systems: 1.) small set size, 2.) minimal network information required for their construction scheme, 3.) fast and easy computational implementation, and 4.) resiliency to network damage. Supported by DARPA, DTRA, and NSF.

A novel method for the production of core-shell microparticles by inverse gelation optimized with artificial intelligent tools.

PubMed

Rodríguez-Dorado, Rosalia; Landín, Mariana; Altai, Ayça; Russo, Paola; Aquino, Rita P; Del Gaudio, Pasquale

2018-03-01

Numerous studies have been focused on hydrophobic compounds encapsulation as oils. In fact, oils can provide numerous health benefits as synergic ingredient combined with other hydrophobic active ingredients. However, stable microparticles for pharmaceutical purposes are difficult to achieve when commonly techniques are used. In this work, sunflower oil was encapsulated in calcium-alginate capsules by prilling technique in co-axial configuration. Core-shell beads were produced by inverse gelation directly at the nozzle using a w/o emulsion containing aqueous calcium chloride solution in sunflower oil pumped through the inner nozzle while an aqueous alginate solution, coming out from the annular nozzle, produced the beads shell. To optimize process parameters artificial intelligence tools were proposed to optimize the numerous prilling process variables. Homogeneous and spherical microcapsules with narrow size distribution and a thin alginate shell were obtained when the parameters as w/o constituents, polymer concentrations, flow rates and frequency of vibration were optimized by two commercial software, FormRules® and INForm®, which implement neurofuzzy logic and Artificial Neural Networks together with genetic algorithms, respectively. This technique constitutes an innovative approach for hydrophobic compounds microencapsulation. Copyright © 2018 Elsevier B.V. All rights reserved.

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-06-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to: Optical access network architectures and protocols Passive optical networks (BPON, EPON, GPON, etc.) Active optical networks Multiple access control Multiservices and QoS provisioning Network survivability Field trials and standards Performance modeling and analysis

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan; Jersey Inst Ansari, New; Jersey Inst, New

2005-04-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to: Optical access network architectures and protocols Passive optical networks (BPON, EPON, GPON, etc.) Active optical networks Multiple access control Multiservices and QoS provisioning Network survivability Field trials and standards Performance modeling and analysis

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-05-01

Call for Papers: Optical Access Networks With the wide deployment of fiber-optic technology over the past two decades, we have witnessed a tremendous growth of bandwidth capacity in the backbone networks of today's telecommunications infrastructure. However, access networks, which cover the "last-mile" areas and serve numerous residential and small business users, have not been scaled up commensurately. The local subscriber lines for telephone and cable television are still using twisted pairs and coaxial cables. Most residential connections to the Internet are still through dial-up modems operating at a low speed on twisted pairs. As the demand for access bandwidth increases with emerging high-bandwidth applications, such as distance learning, high-definition television (HDTV), and video on demand (VoD), the last-mile access networks have become a bandwidth bottleneck in today's telecommunications infrastructure. To ease this bottleneck, it is imperative to provide sufficient bandwidth capacity in the access networks to open the bottleneck and thus present more opportunities for the provisioning of multiservices. Optical access solutions promise huge bandwidth to service providers and low-cost high-bandwidth services to end users and are therefore widely considered the technology of choice for next-generation access networks. To realize the vision of optical access networks, however, many key issues still need to be addressed, such as network architectures, signaling protocols, and implementation standards. The major challenges lie in the fact that an optical solution must be not only robust, scalable, and flexible, but also implemented at a low cost comparable to that of existing access solutions in order to increase the economic viability of many potential high-bandwidth applications. In recent years, optical access networks have been receiving tremendous attention from both academia and industry. A large number of research activities have been carried out or are now underway this hot area. The purpose of this feature issue is to expose the networking community to the latest research breakthroughs and progresses in the area of optical access networks. This feature issue aims to present a collection of papers that focus on the state-of-the-art research in various networking aspects of optical access networks. Original papers are solicited from all researchers involved in area of optical access networks. Topics of interest include but not limited to: Optical access network architectures and protocols Passive optical networks (BPON, EPON, GPON, etc.) Active optical networks Multiple access control Multiservices and QoS provisioning Network survivability Field trials and standards Performance modeling and analysis

Examining the Return on Investment of a Security Information and Event Management Solution in a Notional Department of Defense Network Environment

DTIC Science & Technology

2013-06-01

collection are the facts that devices the lack encryption or compression methods and that the log file must be saved on the host system prior to transfer...time. Statistical correlation utilizes numerical algorithms to detect deviations from normal event levels and other routine activities (Chuvakin...can also assist in detecting low volume threats. Although easy and logical to implement, the implementation of statistical correlation algorithms

Pattern Storage, Bifurcations, and Groupwise Correlation Structure of an Exactly Solvable Asymmetric Neural Network Model.

PubMed

Fasoli, Diego; Cattani, Anna; Panzeri, Stefano

2018-05-01

Despite their biological plausibility, neural network models with asymmetric weights are rarely solved analytically, and closed-form solutions are available only in some limiting cases or in some mean-field approximations. We found exact analytical solutions of an asymmetric spin model of neural networks with arbitrary size without resorting to any approximation, and we comprehensively studied its dynamical and statistical properties. The network had discrete time evolution equations and binary firing rates, and it could be driven by noise with any distribution. We found analytical expressions of the conditional and stationary joint probability distributions of the membrane potentials and the firing rates. By manipulating the conditional probability distribution of the firing rates, we extend to stochastic networks the associating learning rule previously introduced by Personnaz and coworkers. The new learning rule allowed the safe storage, under the presence of noise, of point and cyclic attractors, with useful implications for content-addressable memories. Furthermore, we studied the bifurcation structure of the network dynamics in the zero-noise limit. We analytically derived examples of the codimension 1 and codimension 2 bifurcation diagrams of the network, which describe how the neuronal dynamics changes with the external stimuli. This showed that the network may undergo transitions among multistable regimes, oscillatory behavior elicited by asymmetric synaptic connections, and various forms of spontaneous symmetry breaking. We also calculated analytically groupwise correlations of neural activity in the network in the stationary regime. This revealed neuronal regimes where, statistically, the membrane potentials and the firing rates are either synchronous or asynchronous. Our results are valid for networks with any number of neurons, although our equations can be realistically solved only for small networks. For completeness, we also derived the network equations in the thermodynamic limit of infinite network size and we analytically studied their local bifurcations. All the analytical results were extensively validated by numerical simulations.

Revealing Numerical Solutions of a Differential Equation

ERIC Educational Resources Information Center

Glaister, P.

2006-01-01

In this article, the author considers a student exercise that involves determining the exact and numerical solutions of a particular differential equation. He shows how a typical student solution is at variance with a numerical solution, suggesting that the numerical solution is incorrect. However, further investigation shows that this numerical…

Delay-induced Turing-like waves for one-species reaction-diffusion model on a network

NASA Astrophysics Data System (ADS)

Petit, Julien; Carletti, Timoteo; Asllani, Malbor; Fanelli, Duccio

2015-09-01

A one-species time-delay reaction-diffusion system defined on a complex network is studied. Traveling waves are predicted to occur following a symmetry-breaking instability of a homogeneous stationary stable solution, subject to an external nonhomogeneous perturbation. These are generalized Turing-like waves that materialize in a single-species populations dynamics model, as the unexpected byproduct of the imposed delay in the diffusion part. Sufficient conditions for the onset of the instability are mathematically provided by performing a linear stability analysis adapted to time-delayed differential equations. The method here developed exploits the properties of the Lambert W-function. The prediction of the theory are confirmed by direct numerical simulation carried out for a modified version of the classical Fisher model, defined on a Watts-Strogatz network and with the inclusion of the delay.

QKD-Based Secured Burst Integrity Design for Optical Burst Switched Networks

NASA Astrophysics Data System (ADS)

Balamurugan, A. M.; Sivasubramanian, A.; Parvathavarthini, B.

2016-03-01

The field of optical transmission has undergone numerous advancements and is still being researched mainly due to the fact that optical data transmission can be done at enormous speeds. It is quite evident that people prefer optical communication when it comes to large amount of data involving its transmission. The concept of switching in networks has matured enormously with several researches, architecture to implement and methods starting with Optical circuit switching to Optical Burst Switching. Optical burst switching is regarded as viable solution for switching bursts over networks but has several security vulnerabilities. However, this work exploited the security issues associated with Optical Burst Switching with respect to integrity of burst. This proposed Quantum Key based Secure Hash Algorithm (QKBSHA-512) with enhanced compression function design provides better avalanche effect over the conventional integrity algorithms.

The Pharmacogenomics Research Network Translational Pharmacogenetics Program: Outcomes and Metrics of Pharmacogenetic Implementations Across Diverse Healthcare Systems.

PubMed

Luzum, J A; Pakyz, R E; Elsey, A R; Haidar, C E; Peterson, J F; Whirl-Carrillo, M; Handelman, S K; Palmer, K; Pulley, J M; Beller, M; Schildcrout, J S; Field, J R; Weitzel, K W; Cooper-DeHoff, R M; Cavallari, L H; O'Donnell, P H; Altman, R B; Pereira, N; Ratain, M J; Roden, D M; Embi, P J; Sadee, W; Klein, T E; Johnson, J A; Relling, M V; Wang, L; Weinshilboum, R M; Shuldiner, A R; Freimuth, R R

2017-09-01

Numerous pharmacogenetic clinical guidelines and recommendations have been published, but barriers have hindered the clinical implementation of pharmacogenetics. The Translational Pharmacogenetics Program (TPP) of the National Institutes of Health (NIH) Pharmacogenomics Research Network was established in 2011 to catalog and contribute to the development of pharmacogenetic implementations at eight US healthcare systems, with the goal to disseminate real-world solutions for the barriers to clinical pharmacogenetic implementation. The TPP collected and normalized pharmacogenetic implementation metrics through June 2015, including gene-drug pairs implemented, interpretations of alleles and diplotypes, numbers of tests performed and actionable results, and workflow diagrams. TPP participant institutions developed diverse solutions to overcome many barriers, but the use of Clinical Pharmacogenetics Implementation Consortium (CPIC) guidelines provided some consistency among the institutions. The TPP also collected some pharmacogenetic implementation outcomes (scientific, educational, financial, and informatics), which may inform healthcare systems seeking to implement their own pharmacogenetic testing programs. © 2017, The American Society for Clinical Pharmacology and Therapeutics.

Efficient Characterization of Parametric Uncertainty of Complex (Bio)chemical Networks.

PubMed

Schillings, Claudia; Sunnåker, Mikael; Stelling, Jörg; Schwab, Christoph

2015-08-01

Parametric uncertainty is a particularly challenging and relevant aspect of systems analysis in domains such as systems biology where, both for inference and for assessing prediction uncertainties, it is essential to characterize the system behavior globally in the parameter space. However, current methods based on local approximations or on Monte-Carlo sampling cope only insufficiently with high-dimensional parameter spaces associated with complex network models. Here, we propose an alternative deterministic methodology that relies on sparse polynomial approximations. We propose a deterministic computational interpolation scheme which identifies most significant expansion coefficients adaptively. We present its performance in kinetic model equations from computational systems biology with several hundred parameters and state variables, leading to numerical approximations of the parametric solution on the entire parameter space. The scheme is based on adaptive Smolyak interpolation of the parametric solution at judiciously and adaptively chosen points in parameter space. As Monte-Carlo sampling, it is "non-intrusive" and well-suited for massively parallel implementation, but affords higher convergence rates. This opens up new avenues for large-scale dynamic network analysis by enabling scaling for many applications, including parameter estimation, uncertainty quantification, and systems design.

Efficient Characterization of Parametric Uncertainty of Complex (Bio)chemical Networks

PubMed Central

Schillings, Claudia; Sunnåker, Mikael; Stelling, Jörg; Schwab, Christoph

2015-01-01

Parametric uncertainty is a particularly challenging and relevant aspect of systems analysis in domains such as systems biology where, both for inference and for assessing prediction uncertainties, it is essential to characterize the system behavior globally in the parameter space. However, current methods based on local approximations or on Monte-Carlo sampling cope only insufficiently with high-dimensional parameter spaces associated with complex network models. Here, we propose an alternative deterministic methodology that relies on sparse polynomial approximations. We propose a deterministic computational interpolation scheme which identifies most significant expansion coefficients adaptively. We present its performance in kinetic model equations from computational systems biology with several hundred parameters and state variables, leading to numerical approximations of the parametric solution on the entire parameter space. The scheme is based on adaptive Smolyak interpolation of the parametric solution at judiciously and adaptively chosen points in parameter space. As Monte-Carlo sampling, it is “non-intrusive” and well-suited for massively parallel implementation, but affords higher convergence rates. This opens up new avenues for large-scale dynamic network analysis by enabling scaling for many applications, including parameter estimation, uncertainty quantification, and systems design. PMID:26317784

Stream-groundwater exchange and hydrologic turnover at the network scale

NASA Astrophysics Data System (ADS)

Covino, Tim; McGlynn, Brian; Mallard, John

2011-12-01

The exchange of water between streams and groundwater can influence stream water quality, hydrologic mass balances, and attenuate solute export from watersheds. We used conservative tracer injections (chloride, Cl-) across 10 stream reaches to investigate stream water gains and losses from and to groundwater at larger spatial and temporal scales than typically associated with hyporheic exchanges. We found strong relationships between reach discharge, median tracer velocity, and gross hydrologic loss across a range of stream morphologies and sizes in the 11.4 km2 Bull Trout Watershed of central ID. We implemented these empirical relationships in a numerical network model and simulated stream water gains and losses and subsequent fractional hydrologic turnover across the stream network. We found that stream gains and losses from and to groundwater can influence source water contributions and stream water compositions across stream networks. Quantifying proportional influences of source water contributions from runoff generation locations across the network on stream water composition can provide insight into the internal mechanisms that partially control the hydrologic and biogeochemical signatures observed along networks and at watershed outlets.

Stochastic Simulation of Biomolecular Networks in Dynamic Environments

PubMed Central

Voliotis, Margaritis; Thomas, Philipp; Grima, Ramon; Bowsher, Clive G.

2016-01-01

Simulation of biomolecular networks is now indispensable for studying biological systems, from small reaction networks to large ensembles of cells. Here we present a novel approach for stochastic simulation of networks embedded in the dynamic environment of the cell and its surroundings. We thus sample trajectories of the stochastic process described by the chemical master equation with time-varying propensities. A comparative analysis shows that existing approaches can either fail dramatically, or else can impose impractical computational burdens due to numerical integration of reaction propensities, especially when cell ensembles are studied. Here we introduce the Extrande method which, given a simulated time course of dynamic network inputs, provides a conditionally exact and several orders-of-magnitude faster simulation solution. The new approach makes it feasible to demonstrate—using decision-making by a large population of quorum sensing bacteria—that robustness to fluctuations from upstream signaling places strong constraints on the design of networks determining cell fate. Our approach has the potential to significantly advance both understanding of molecular systems biology and design of synthetic circuits. PMID:27248512

Optimal stimulus scheduling for active estimation of evoked brain networks.

PubMed

Kafashan, MohammadMehdi; Ching, ShiNung

2015-12-01

We consider the problem of optimal probing to learn connections in an evoked dynamic network. Such a network, in which each edge measures an input-output relationship between sites in sensor/actuator-space, is relevant to emerging applications in neural mapping and neural connectivity estimation. We show that the problem of scheduling nodes to a probe (i.e., stimulate) amounts to a problem of optimal sensor scheduling. By formulating the evoked network in state-space, we show that the solution to the greedy probing strategy has a convenient form and, under certain conditions, is optimal over a finite horizon. We adopt an expectation maximization technique to update the state-space parameters in an online fashion and demonstrate the efficacy of the overall approach in a series of detailed numerical examples. The proposed method provides a principled means to actively probe time-varying connections in neuronal networks. The overall method can be implemented in real time and is particularly well-suited to applications in stimulation-based cortical mapping in which the underlying network dynamics are changing over time.

Optimal stimulus scheduling for active estimation of evoked brain networks

NASA Astrophysics Data System (ADS)

Kafashan, MohammadMehdi; Ching, ShiNung

2015-12-01

Objective. We consider the problem of optimal probing to learn connections in an evoked dynamic network. Such a network, in which each edge measures an input-output relationship between sites in sensor/actuator-space, is relevant to emerging applications in neural mapping and neural connectivity estimation. Approach. We show that the problem of scheduling nodes to a probe (i.e., stimulate) amounts to a problem of optimal sensor scheduling. Main results. By formulating the evoked network in state-space, we show that the solution to the greedy probing strategy has a convenient form and, under certain conditions, is optimal over a finite horizon. We adopt an expectation maximization technique to update the state-space parameters in an online fashion and demonstrate the efficacy of the overall approach in a series of detailed numerical examples. Significance. The proposed method provides a principled means to actively probe time-varying connections in neuronal networks. The overall method can be implemented in real time and is particularly well-suited to applications in stimulation-based cortical mapping in which the underlying network dynamics are changing over time.

Fast and accurate detection of spread source in large complex networks.

PubMed

Paluch, Robert; Lu, Xiaoyan; Suchecki, Krzysztof; Szymański, Bolesław K; Hołyst, Janusz A

2018-02-06

Spread over complex networks is a ubiquitous process with increasingly wide applications. Locating spread sources is often important, e.g. finding the patient one in epidemics, or source of rumor spreading in social network. Pinto, Thiran and Vetterli introduced an algorithm (PTVA) to solve the important case of this problem in which a limited set of nodes act as observers and report times at which the spread reached them. PTVA uses all observers to find a solution. Here we propose a new approach in which observers with low quality information (i.e. with large spread encounter times) are ignored and potential sources are selected based on the likelihood gradient from high quality observers. The original complexity of PTVA is O(N α ), where α ∈ (3,4) depends on the network topology and number of observers (N denotes the number of nodes in the network). Our Gradient Maximum Likelihood Algorithm (GMLA) reduces this complexity to O (N 2 log (N)). Extensive numerical tests performed on synthetic networks and real Gnutella network with limitation that id's of spreaders are unknown to observers demonstrate that for scale-free networks with such limitation GMLA yields higher quality localization results than PTVA does.

Analytical Solutions for Rumor Spreading Dynamical Model in a Social Network

NASA Astrophysics Data System (ADS)

Fallahpour, R.; Chakouvari, S.; Askari, H.

2015-03-01

In this paper, Laplace Adomian decomposition method is utilized for evaluating of spreading model of rumor. Firstly, a succinct review is constructed on the subject of using analytical methods such as Adomian decomposion method, Variational iteration method and Homotopy Analysis method for epidemic models and biomathematics. In continue a spreading model of rumor with consideration of forgetting mechanism is assumed and subsequently LADM is exerted for solving of it. By means of the aforementioned method, a general solution is achieved for this problem which can be readily employed for assessing of rumor model without exerting any computer program. In addition, obtained consequences for this problem are discussed for different cases and parameters. Furthermore, it is shown the method is so straightforward and fruitful for analyzing equations which have complicated terms same as rumor model. By employing numerical methods, it is revealed LADM is so powerful and accurate for eliciting solutions of this model. Eventually, it is concluded that this method is so appropriate for this problem and it can provide researchers a very powerful vehicle for scrutinizing rumor models in diverse kinds of social networks such as Facebook, YouTube, Flickr, LinkedIn and Tuitor.

Numerical Asymptotic Solutions Of Differential Equations

NASA Technical Reports Server (NTRS)

Thurston, Gaylen A.

1992-01-01

Numerical algorithms derived and compared with classical analytical methods. In method, expansions replaced with integrals evaluated numerically. Resulting numerical solutions retain linear independence, main advantage of asymptotic solutions.

Robust recognition of handwritten numerals based on dual cooperative network

NASA Technical Reports Server (NTRS)

Lee, Sukhan; Choi, Yeongwoo

1992-01-01

An approach to robust recognition of handwritten numerals using two operating parallel networks is presented. The first network uses inputs in Cartesian coordinates, and the second network uses the same inputs transformed into polar coordinates. How the proposed approach realizes the robustness to local and global variations of input numerals by handling inputs both in Cartesian coordinates and in its transformed Polar coordinates is described. The required network structures and its learning scheme are discussed. Experimental results show that by tracking only a small number of distinctive features for each teaching numeral in each coordinate, the proposed system can provide robust recognition of handwritten numerals.

Investigation of advanced counterrotation blade configuration concepts for high speed turboprop systems, task 1: Ducted propfan analysis

NASA Technical Reports Server (NTRS)

Hall, Edward J.; Delaney, Robert A.; Bettner, James L.

1990-01-01

The time-dependent three-dimensional Euler equations of gas dynamics were solved numerically to study the steady compressible transonic flow about ducted propfan propulsion systems. Aerodynamic calculations were based on a four-stage Runge-Kutta time-marching finite volume solution technique with added numerical dissipation. An implicit residual smoothing operator was used to aid convergence. Two calculation grids were employed in this study. The first grid utilized an H-type mesh network with a branch cut opening to represent the axisymmetric cowl. The second grid utilized a multiple-block mesh system with a C-type grid about the cowl. The individual blocks were numerically coupled in the Euler solver. Grid systems were generated by a combined algebraic/elliptic algortihm developed specifically for ducted propfans. Numerical calculations were initially performed for unducted propfans to verify the accuracy of the three-dimensional Euler formulation. The Euler analyses were then applied for the calculation of ducted propfan flows, and predicted results were compared with experimental data for two cases. The three-dimensional Euler analyses displayed exceptional accuracy, although certain parameters were observed to be very sensitive to geometric deflections. Both solution schemes were found to be very robust and demonstrated nearly equal efficiency and accuracy, although it was observed that the multi-block C-grid formulation provided somewhat better resolution of the cowl leading edge region.

How to Compress Sequential Memory Patterns into Periodic Oscillations: General Reduction Rules

PubMed Central

Zhang, Kechen

2017-01-01

A neural network with symmetric reciprocal connections always admits a Lyapunov function, whose minima correspond to the memory states stored in the network. Networks with suitable asymmetric connections can store and retrieve a sequence of memory patterns, but the dynamics of these networks cannot be characterized as readily as that of the symmetric networks due to the lack of established general methods. Here, a reduction method is developed for a class of asymmetric attractor networks that store sequences of activity patterns as associative memories, as in a Hopfield network. The method projects the original activity pattern of the network to a low-dimensional space such that sequential memory retrievals in the original network correspond to periodic oscillations in the reduced system. The reduced system is self-contained and provides quantitative information about the stability and speed of sequential memory retrievals in the original network. The time evolution of the overlaps between the network state and the stored memory patterns can also be determined from extended reduced systems. The reduction procedure can be summarized by a few reduction rules, which are applied to several network models, including coupled networks and networks with time-delayed connections, and the analytical solutions of the reduced systems are confirmed by numerical simulations of the original networks. Finally, a local learning rule that provides an approximation to the connection weights involving the pseudoinverse is also presented. PMID:24877729

Approximation algorithms for the min-power symmetric connectivity problem

NASA Astrophysics Data System (ADS)

Plotnikov, Roman; Erzin, Adil; Mladenovic, Nenad

2016-10-01

We consider the NP-hard problem of synthesis of optimal spanning communication subgraph in a given arbitrary simple edge-weighted graph. This problem occurs in the wireless networks while minimizing the total transmission power consumptions. We propose several new heuristics based on the variable neighborhood search metaheuristic for the approximation solution of the problem. We have performed a numerical experiment where all proposed algorithms have been executed on the randomly generated test samples. For these instances, on average, our algorithms outperform the previously known heuristics.

Correlations in electrically coupled chaotic lasers.

PubMed

Rosero, E J; Barbosa, W A S; Martinez Avila, J F; Khoury, A Z; Rios Leite, J R

2016-09-01

We show how two electrically coupled semiconductor lasers having optical feedback can present simultaneous antiphase correlated fast power fluctuations, and strong in-phase synchronized spikes of chaotic power drops. This quite counterintuitive phenomenon is demonstrated experimentally and confirmed by numerical solutions of a deterministic dynamical system of rate equations. The occurrence of negative and positive cross correlation between parts of a complex system according to time scales, as proved in our simple arrangement, is relevant for the understanding and characterization of collective properties in complex networks.

Multi-stage rescheduling of generation, load shedding and short-term transmission capacity for emergency state control

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

Krogh, B.; Chow, J.H.; Javid, H.S.

1983-05-01

A multi-stage formulation of the problem of scheduling generation, load shedding and short term transmission capacity for the alleviation of a viability emergency is presented. The formulation includes generation rate of change constraints, a linear network solution, and a model of the short term thermal overload capacity of transmission lines. The concept of rotating transmission line overloads for emergency state control is developed. The ideas are illustrated by a numerical example.

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.

Fixed-time stability of dynamical systems and fixed-time synchronization of coupled discontinuous neural networks.

PubMed

Hu, Cheng; Yu, Juan; Chen, Zhanheng; Jiang, Haijun; Huang, Tingwen

2017-05-01

In this paper, the fixed-time stability of dynamical systems and the fixed-time synchronization of coupled discontinuous neural networks are investigated under the framework of Filippov solution. Firstly, by means of reduction to absurdity, a theorem of fixed-time stability is established and a high-precision estimation of the settling-time is given. It is shown by theoretic proof that the estimation bound of the settling time given in this paper is less conservative and more accurate compared with the classical results. Besides, as an important application, the fixed-time synchronization of coupled neural networks with discontinuous activation functions is proposed. By designing a discontinuous control law and using the theory of differential inclusions, some new criteria are derived to ensure the fixed-time synchronization of the addressed coupled networks. Finally, two numerical examples are provided to show the effectiveness and validity of the theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Jamming Attack in Wireless Sensor Network: From Time to Space

NASA Astrophysics Data System (ADS)

Sun, Yanqiang; Wang, Xiaodong; Zhou, Xingming

Classical jamming attack models in the time domain have been proposed, such as constant jammer, random jammer, and reactive jammer. In this letter, we consider a new problem: given k jammers, how does the attacker minimize the pair-wise connectivity among the nodes in a Wireless Sensor Network (WSN)? We call this problem k-Jammer Deployment Problem (k-JDP). To the best of our knowledge, this is the first attempt at considering the position-critical jamming attack against wireless sensor network. We mainly make three contributions. First, we prove that the decision version of k-JDP is NP-complete even in the ideal situation where the attacker has full knowledge of the topology information of sensor network. Second, we propose a mathematical formulation based on Integer Programming (IP) model which yields an optimal solution. Third, we present a heuristic algorithm HAJDP, and compare it with the IP model. Numerical results show that our heuristic algorithm is computationally efficient.

Stress Transmission in Granular Packings: Localization and Cooperative Response

NASA Astrophysics Data System (ADS)

Ramola, Kabir

We develop a framework for stress transmission in two dimensional granular media that respects vector force balance at the microscopic level. For a packing of grains interacting via pairwise contact forces, we introduce local gauge degrees of freedom that determine the response of the system to external perturbations. This allows us to construct unique force-balanced solutions that determine the change in contact forces as a response to external stress. By mapping this response to diffusion in the underlying contact network, we show that this naturally leads to spatial localization of forces. We present numerical evidence for stress localization using exact diagonalization studies of network Laplacians associated with soft disk packings. We use this formalism to characterize the deviation from elastic behaviour as the amount of disorder in the underlying network is varied. We discuss generalizations to systems with large friction between grains and other networks that display topological disorder. This work has been supported by NSF-DMR 1409093 and the W. M. Keck Foundation.

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.

Optimal satisfaction degree in energy harvesting cognitive radio networks

NASA Astrophysics Data System (ADS)

Li, Zan; Liu, Bo-Yang; Si, Jiang-Bo; Zhou, Fu-Hui

2015-12-01

A cognitive radio (CR) network with energy harvesting (EH) is considered to improve both spectrum efficiency and energy efficiency. A hidden Markov model (HMM) is used to characterize the imperfect spectrum sensing process. In order to maximize the whole satisfaction degree (WSD) of the cognitive radio network, a tradeoff between the average throughput of the secondary user (SU) and the interference to the primary user (PU) is analyzed. We formulate the satisfaction degree optimization problem as a mixed integer nonlinear programming (MINLP) problem. The satisfaction degree optimization problem is solved by using differential evolution (DE) algorithm. The proposed optimization problem allows the network to adaptively achieve the optimal solution based on its required quality of service (Qos). Numerical results are given to verify our analysis. Project supported by the National Natural Science Foundation of China (Grant No. 61301179), the Doctorial Programs Foundation of the Ministry of Education of China (Grant No. 20110203110011), and the 111 Project (Grant No. B08038).

ANNarchy: a code generation approach to neural simulations on parallel hardware

PubMed Central

Vitay, Julien; Dinkelbach, Helge Ü.; Hamker, Fred H.

2015-01-01

Many modern neural simulators focus on the simulation of networks of spiking neurons on parallel hardware. Another important framework in computational neuroscience, rate-coded neural networks, is mostly difficult or impossible to implement using these simulators. We present here the ANNarchy (Artificial Neural Networks architect) neural simulator, which allows to easily define and simulate rate-coded and spiking networks, as well as combinations of both. The interface in Python has been designed to be close to the PyNN interface, while the definition of neuron and synapse models can be specified using an equation-oriented mathematical description similar to the Brian neural simulator. This information is used to generate C++ code that will efficiently perform the simulation on the chosen parallel hardware (multi-core system or graphical processing unit). Several numerical methods are available to transform ordinary differential equations into an efficient C++code. We compare the parallel performance of the simulator to existing solutions. PMID:26283957

Continuous-variable Measurement-device-independent Quantum Relay Network with Phase-sensitive Amplifiers

NASA Astrophysics Data System (ADS)

Li, Fei; Zhao, Wei; Guo, Ying

2018-01-01

Continuous-variable (CV) measurement-device-independent (MDI) quantum cryptography is now heading towards solving the practical problem of implementing scalable quantum networks. In this paper, we show that a solution can come from deploying an optical amplifier in the CV-MDI system, aiming to establish a high-rate quantum network. We suggest an improved CV-MDI protocol using the EPR states coupled with optical amplifiers. It can implement a practical quantum network scheme, where the legal participants create the secret correlations by using EPR states connecting to an untrusted relay via insecure links and applying the multi-entangled Greenberger-Horne-Zeilinger (GHZ) state analysis at relay station. Despite the possibility that the relay could be completely tampered with and imperfect links are subject to the powerful attacks, the legal participants are still able to extract a secret key from network communication. The numerical simulation indicates that the quantum network communication can be achieved in an asymmetric scenario, fulfilling the demands of a practical quantum network. Furthermore, we show that the use of optical amplifiers can compensate the inherent imperfections and improve the secret key rate of the CV-MDI system.

Parameter estimation in spiking neural networks: a reverse-engineering approach.

PubMed

Rostro-Gonzalez, H; Cessac, B; Vieville, T

2012-04-01

This paper presents a reverse engineering approach for parameter estimation in spiking neural networks (SNNs). We consider the deterministic evolution of a time-discretized network with spiking neurons, where synaptic transmission has delays, modeled as a neural network of the generalized integrate and fire type. Our approach aims at by-passing the fact that the parameter estimation in SNN results in a non-deterministic polynomial-time hard problem when delays are to be considered. Here, this assumption has been reformulated as a linear programming (LP) problem in order to perform the solution in a polynomial time. Besides, the LP problem formulation makes the fact that the reverse engineering of a neural network can be performed from the observation of the spike times explicit. Furthermore, we point out how the LP adjustment mechanism is local to each neuron and has the same structure as a 'Hebbian' rule. Finally, we present a generalization of this approach to the design of input-output (I/O) transformations as a practical method to 'program' a spiking network, i.e. find a set of parameters allowing us to exactly reproduce the network output, given an input. Numerical verifications and illustrations are provided.

Linear time-varying models can reveal non-linear interactions of biomolecular regulatory networks using multiple time-series data.

PubMed

Kim, Jongrae; Bates, Declan G; Postlethwaite, Ian; Heslop-Harrison, Pat; Cho, Kwang-Hyun

2008-05-15

Inherent non-linearities in biomolecular interactions make the identification of network interactions difficult. One of the principal problems is that all methods based on the use of linear time-invariant models will have fundamental limitations in their capability to infer certain non-linear network interactions. Another difficulty is the multiplicity of possible solutions, since, for a given dataset, there may be many different possible networks which generate the same time-series expression profiles. A novel algorithm for the inference of biomolecular interaction networks from temporal expression data is presented. Linear time-varying models, which can represent a much wider class of time-series data than linear time-invariant models, are employed in the algorithm. From time-series expression profiles, the model parameters are identified by solving a non-linear optimization problem. In order to systematically reduce the set of possible solutions for the optimization problem, a filtering process is performed using a phase-portrait analysis with random numerical perturbations. The proposed approach has the advantages of not requiring the system to be in a stable steady state, of using time-series profiles which have been generated by a single experiment, and of allowing non-linear network interactions to be identified. The ability of the proposed algorithm to correctly infer network interactions is illustrated by its application to three examples: a non-linear model for cAMP oscillations in Dictyostelium discoideum, the cell-cycle data for Saccharomyces cerevisiae and a large-scale non-linear model of a group of synchronized Dictyostelium cells. The software used in this article is available from http://sbie.kaist.ac.kr/software

Machine learning action parameters in lattice quantum chromodynamics

NASA Astrophysics Data System (ADS)

Shanahan, Phiala E.; Trewartha, Daniel; Detmold, William

2018-05-01

Numerical lattice quantum chromodynamics studies of the strong interaction are important in many aspects of particle and nuclear physics. Such studies require significant computing resources to undertake. A number of proposed methods promise improved efficiency of lattice calculations, and access to regions of parameter space that are currently computationally intractable, via multi-scale action-matching approaches that necessitate parametric regression of generated lattice datasets. The applicability of machine learning to this regression task is investigated, with deep neural networks found to provide an efficient solution even in cases where approaches such as principal component analysis fail. The high information content and complex symmetries inherent in lattice QCD datasets require custom neural network layers to be introduced and present opportunities for further development.

Star-type oscillatory networks with generic Kuramoto-type coupling: A model for "Japanese drums synchrony"

NASA Astrophysics Data System (ADS)

Vlasov, Vladimir; Pikovsky, Arkady; Macau, Elbert E. N.

2015-12-01

We analyze star-type networks of phase oscillators by virtue of two methods. For identical oscillators we adopt the Watanabe-Strogatz approach, which gives full analytical description of states, rotating with constant frequency. For nonidentical oscillators, such states can be obtained by virtue of the self-consistent approach in a parametric form. In this case stability analysis cannot be performed, however with the help of direct numerical simulations we show which solutions are stable and which not. We consider this system as a model for a drum orchestra, where we assume that the drummers follow the signal of the leader without listening to each other and the coupling parameters are determined by a geometrical organization of the orchestra.

Reliable Facility Location Problem with Facility Protection

PubMed Central

Tang, Luohao; Zhu, Cheng; Lin, Zaili; Shi, Jianmai; Zhang, Weiming

2016-01-01

This paper studies a reliable facility location problem with facility protection that aims to hedge against random facility disruptions by both strategically protecting some facilities and using backup facilities for the demands. An Integer Programming model is proposed for this problem, in which the failure probabilities of facilities are site-specific. A solution approach combining Lagrangian Relaxation and local search is proposed and is demonstrated to be both effective and efficient based on computational experiments on random numerical examples with 49, 88, 150 and 263 nodes in the network. A real case study for a 100-city network in Hunan province, China, is presented, based on which the properties of the model are discussed and some managerial insights are analyzed. PMID:27583542

Global exponential stability and lag synchronization for delayed memristive fuzzy Cohen-Grossberg BAM neural networks with impulses.

PubMed

Yang, Wengui; Yu, Wenwu; Cao, Jinde; Alsaadi, Fuad E; Hayat, Tasawar

2018-02-01

This paper investigates the stability and lag synchronization for memristor-based fuzzy Cohen-Grossberg bidirectional associative memory (BAM) neural networks with mixed delays (asynchronous time delays and continuously distributed delays) and impulses. By applying the inequality analysis technique, homeomorphism theory and some suitable Lyapunov-Krasovskii functionals, some new sufficient conditions for the uniqueness and global exponential stability of equilibrium point are established. Furthermore, we obtain several sufficient criteria concerning globally exponential lag synchronization for the proposed system based on the framework of Filippov solution, differential inclusion theory and control theory. In addition, some examples with numerical simulations are given to illustrate the feasibility and validity of obtained results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Epidemic spreading on random surfer networks with optimal interaction radius

NASA Astrophysics Data System (ADS)

Feng, Yun; Ding, Li; Hu, Ping

2018-03-01

In this paper, the optimal control problem of epidemic spreading on random surfer heterogeneous networks is considered. An epidemic spreading model is established according to the classification of individual's initial interaction radii. Then, a control strategy is proposed based on adjusting individual's interaction radii. The global stability of the disease free and endemic equilibrium of the model is investigated. We prove that an optimal solution exists for the optimal control problem and the explicit form of which is presented. Numerical simulations are conducted to verify the correctness of the theoretical results. It is proved that the optimal control strategy is effective to minimize the density of infected individuals and the cost associated with the adjustment of interaction radii.

A multimodal logistics service network design with time windows and environmental concerns

PubMed Central

Zhang, Dezhi; He, Runzhong; Wang, Zhongwei

2017-01-01

The design of a multimodal logistics service network with customer service time windows and environmental costs is an important and challenging issue. Accordingly, this work established a model to minimize the total cost of multimodal logistics service network design with time windows and environmental concerns. The proposed model incorporates CO2 emission costs to determine the optimal transportation mode combinations and investment selections for transfer nodes, which consider transport cost, transport time, carbon emission, and logistics service time window constraints. Furthermore, genetic and heuristic algorithms are proposed to set up the abovementioned optimal model. A numerical example is provided to validate the model and the abovementioned two algorithms. Then, comparisons of the performance of the two algorithms are provided. Finally, this work investigates the effects of the logistics service time windows and CO2 emission taxes on the optimal solution. Several important management insights are obtained. PMID:28934272

When Reputation Enforces Evolutionary Cooperation in Unreliable MANETs.

PubMed

Tang, Changbing; Li, Ang; Li, Xiang

2015-10-01

In self-organized mobile ad hoc networks (MANETs), network functions rely on cooperation of self-interested nodes, where a challenge is to enforce their mutual cooperation. In this paper, we study cooperative packet forwarding in a one-hop unreliable channel which results from loss of packets and noisy observation of transmissions. We propose an indirect reciprocity framework based on evolutionary game theory, and enforce cooperation of packet forwarding strategies in both structured and unstructured MANETs. Furthermore, we analyze the evolutionary dynamics of cooperative strategies and derive the threshold of benefit-to-cost ratio to guarantee the convergence of cooperation. The numerical simulations verify that the proposed evolutionary game theoretic solution enforces cooperation when the benefit-to-cost ratio of the altruistic exceeds the critical condition. In addition, the network throughput performance of our proposed strategy in structured MANETs is measured, which is in close agreement with that of the full cooperative strategy.

A multimodal logistics service network design with time windows and environmental concerns.

PubMed

Zhang, Dezhi; He, Runzhong; Li, Shuangyan; Wang, Zhongwei

2017-01-01

The design of a multimodal logistics service network with customer service time windows and environmental costs is an important and challenging issue. Accordingly, this work established a model to minimize the total cost of multimodal logistics service network design with time windows and environmental concerns. The proposed model incorporates CO2 emission costs to determine the optimal transportation mode combinations and investment selections for transfer nodes, which consider transport cost, transport time, carbon emission, and logistics service time window constraints. Furthermore, genetic and heuristic algorithms are proposed to set up the abovementioned optimal model. A numerical example is provided to validate the model and the abovementioned two algorithms. Then, comparisons of the performance of the two algorithms are provided. Finally, this work investigates the effects of the logistics service time windows and CO2 emission taxes on the optimal solution. Several important management insights are obtained.

Evaluation of the applicability of the dual‐domain mass transfer model in porous media containing connected high‐conductivity channels

USGS Publications Warehouse

Liu, Gaisheng; Zheng, Chunmiao; Gorelick, Steven M.

2007-01-01

This paper evaluates the dual‐domain mass transfer (DDMT) model to represent transport processes when small‐scale high‐conductivity (K) preferential flow paths (PFPs) are present in a homogenous porous media matrix. The effects of PFPs upon solute transport were examined through detailed numerical experiments involving different realizations of PFP networks, PFP/matrix conductivity contrasts varying from 10:1 to 200:1, different magnitudes of effective conductivities, and a range of molecular diffusion coefficients. Results suggest that the DDMT model can reproduce both the near‐source peak and the downstream low‐concentration spreading observed in the embedded dendritic network when there are large conductivity contrasts between high‐K PFPs and the low‐K matrix. The accuracy of the DDMT model is also affected by the geometry of PFP networks and by the relative significance of the diffusion process in the network‐matrix system.

Discretized kinetic theory on scale-free networks

NASA Astrophysics Data System (ADS)

Bertotti, Maria Letizia; Modanese, Giovanni

2016-10-01

The network of interpersonal connections is one of the possible heterogeneous factors which affect the income distribution emerging from micro-to-macro economic models. In this paper we equip our model discussed in [1, 2] with a network structure. The model is based on a system of n differential equations of the kinetic discretized-Boltzmann kind. The network structure is incorporated in a probabilistic way, through the introduction of a link density P(α) and of correlation coefficients P(β|α), which give the conditioned probability that an individual with α links is connected to one with β links. We study the properties of the equations and give analytical results concerning the existence, normalization and positivity of the solutions. For a fixed network with P(α) = c/α q , we investigate numerically the dependence of the detailed and marginal equilibrium distributions on the initial conditions and on the exponent q. Our results are compatible with those obtained from the Bouchaud-Mezard model and from agent-based simulations, and provide additional information about the dependence of the individual income on the level of connectivity.

Multimodal vibration damping of a plate by piezoelectric coupling to its analogous electrical network

NASA Astrophysics Data System (ADS)

Lossouarn, B.; Deü, J.-F.; Aucejo, M.; Cunefare, K. A.

2016-11-01

Multimodal damping can be achieved by coupling a mechanical structure to an electrical network exhibiting similar modal properties. Focusing on a plate, a new topology for such an electrical analogue is found from a finite difference approximation of the Kirchhoff-Love theory and the use of the direct electromechanical analogy. Discrete models based on element dynamic stiffness matrices are proposed to simulate square plate unit cells coupled to their electrical analogues through two-dimensional piezoelectric transducers. A setup made of a clamped plate covered with an array of piezoelectric patches is built in order to validate the control strategy and the numerical models. The analogous electrical network is implemented with passive components as inductors, transformers and the inherent capacitance of the piezoelectric patches. The effect of the piezoelectric coupling on the dynamics of the clamped plate is significant as it creates the equivalent of a multimodal tuned mass damping. An adequate tuning of the network then yields a broadband vibration reduction. In the end, the use of an analogous electrical network appears as an efficient solution for the multimodal control of a plate.

Value of peripheral nodes in controlling multilayer scale-free networks

NASA Astrophysics Data System (ADS)

Zhang, Yan; Garas, Antonios; Schweitzer, Frank

2016-01-01

We analyze the controllability of a two-layer network, where driver nodes can be chosen randomly only from one layer. Each layer contains a scale-free network with directed links and the node dynamics depends on the incoming links from other nodes. We combine the in-degree and out-degree values to assign an importance value w to each node, and distinguish between peripheral nodes with low w and central nodes with high w . Based on numerical simulations, we find that the controllable part of the network is larger when choosing low w nodes to connect the two layers. The control is as efficient when peripheral nodes are driver nodes as it is for the case of more central nodes. However, if we assume a cost to utilize nodes that is proportional to their overall degree, utilizing peripheral nodes to connect the two layers or to act as driver nodes is not only the most cost-efficient solution, it is also the one that performs best in controlling the two-layer network among the different interconnecting strategies we have tested.

Leaf hydraulics II: vascularized tissues.

PubMed

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

2014-01-07

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

A General 3-D Methodology for Quasi-Static Simulation of Drainage and Imbibition: Application to Highly Porous Fibrous Materials

NASA Astrophysics Data System (ADS)

Riasi, S.; Huang, G.; Montemagno, C.; Yeghiazarian, L.

2013-12-01

Micro-scale modeling of multiphase flow in porous media is critical to characterize porous materials. Several modeling techniques have been implemented to date, but none can be used as a general strategy for all porous media applications due to challenges presented by non-smooth high-curvature solid surfaces, and by a wide range of pore sizes and porosities. Finite approaches like the finite volume method require a high quality, problem-dependent mesh, while particle-based approaches like the lattice Boltzmann require too many particles to achieve a stable meaningful solution. Both come at a large computational cost. Other methods such as pore network modeling (PNM) have been developed to accelerate the solution process by simplifying the solution domain, but so far a unique and straightforward methodology to implement PNM is lacking. We have developed a general, stable and fast methodology to model multi-phase fluid flow in porous materials, irrespective of their porosity and solid phase topology. We have applied this methodology to highly porous fibrous materials in which void spaces are not distinctly separated, and where simplifying the geometry into a network of pore bodies and throats, as in PNM, does not result in a topology-consistent network. To this end, we have reduced the complexity of the 3-D void space geometry by working with its medial surface. We have used a non-iterative fast medial surface finder algorithm to determine a voxel-wide medial surface of the void space, and then solved the quasi-static drainage and imbibition on the resulting domain. The medial surface accurately represents the topology of the porous structure including corners, irregular cross sections, etc. This methodology is capable of capturing corner menisci and the snap-off mechanism numerically. It also allows for calculation of pore size distribution, permeability and capillary pressure-saturation-specific interfacial area surface of the porous structure. To show the capability of this method to numerically estimate the capillary pressure in irregular cross sections, we compared our results with analytical solutions available for capillary tubes with non-circular cross sections. We also validated this approach by implementing it on well-known benchmark problems such as a bundle of cylinders and packed spheres.

An equation-free probabilistic steady-state approximation: dynamic application to the stochastic simulation of biochemical reaction networks.

PubMed

Salis, Howard; Kaznessis, Yiannis N

2005-12-01

Stochastic chemical kinetics more accurately describes the dynamics of "small" chemical systems, such as biological cells. Many real systems contain dynamical stiffness, which causes the exact stochastic simulation algorithm or other kinetic Monte Carlo methods to spend the majority of their time executing frequently occurring reaction events. Previous methods have successfully applied a type of probabilistic steady-state approximation by deriving an evolution equation, such as the chemical master equation, for the relaxed fast dynamics and using the solution of that equation to determine the slow dynamics. However, because the solution of the chemical master equation is limited to small, carefully selected, or linear reaction networks, an alternate equation-free method would be highly useful. We present a probabilistic steady-state approximation that separates the time scales of an arbitrary reaction network, detects the convergence of a marginal distribution to a quasi-steady-state, directly samples the underlying distribution, and uses those samples to accurately predict the state of the system, including the effects of the slow dynamics, at future times. The numerical method produces an accurate solution of both the fast and slow reaction dynamics while, for stiff systems, reducing the computational time by orders of magnitude. The developed theory makes no approximations on the shape or form of the underlying steady-state distribution and only assumes that it is ergodic. We demonstrate the accuracy and efficiency of the method using multiple interesting examples, including a highly nonlinear protein-protein interaction network. The developed theory may be applied to any type of kinetic Monte Carlo simulation to more efficiently simulate dynamically stiff systems, including existing exact, approximate, or hybrid stochastic simulation techniques.

Planning protected areas network that are relevant today and under future climate change is possible: the case of Atlantic Forest endemic birds.

PubMed

Vale, Mariana M; Souza, Thiago V; Alves, Maria Alice S; Crouzeilles, Renato

2018-01-01

A key strategy in biodiversity conservation is the establishment of protected areas. In the future, however, the redistribution of species in response to ongoing climate change is likely to affect species' representativeness in those areas. Here we quantify the effectiveness of planning protected areas network to represent 151 birds endemic to the Brazilian Atlantic Forest hotspot, under current and future climate change conditions for 2050. We combined environmental niche modeling and systematic conservation planning using both a county and a regional level planning strategy. We recognized the conflict between biodiversity conservation and economic development, including socio-economic targets (as opposed to biological only) and using planning units that are meaningful for policy-makers. We estimated an average contraction of 29,500 km 2 in environmentally suitable areas for birds, representing 52% of currently suitable areas. Still, the most cost-effective solution represented almost all target species, requiring only ca. 10% of the Atlantic Forest counties to achieve that representativeness, independent of strategy. More than 50% of these counties were selected both in the current and future planned networks, representing >83% of the species. Our results indicate that: (i) planning protected areas network currently can be useful to represent species under climate change; (ii) the overlapped planning units in the best solution for both current and future conditions can be considered as "no regret" areas; (iii) priority counties are spread throughout the biome, providing specific guidance wherever the possibility of creating protected area arises; and (iv) decisions can occur at different administrative spheres (Federal, State or County) as we found quite similar numerical solutions using either county or regional level strategies.

Planning protected areas network that are relevant today and under future climate change is possible: the case of Atlantic Forest endemic birds

PubMed Central

Souza, Thiago V.; Alves, Maria Alice S.; Crouzeilles, Renato

2018-01-01

Background A key strategy in biodiversity conservation is the establishment of protected areas. In the future, however, the redistribution of species in response to ongoing climate change is likely to affect species’ representativeness in those areas. Here we quantify the effectiveness of planning protected areas network to represent 151 birds endemic to the Brazilian Atlantic Forest hotspot, under current and future climate change conditions for 2050. Methods We combined environmental niche modeling and systematic conservation planning using both a county and a regional level planning strategy. We recognized the conflict between biodiversity conservation and economic development, including socio-economic targets (as opposed to biological only) and using planning units that are meaningful for policy-makers. Results We estimated an average contraction of 29,500 km2 in environmentally suitable areas for birds, representing 52% of currently suitable areas. Still, the most cost-effective solution represented almost all target species, requiring only ca. 10% of the Atlantic Forest counties to achieve that representativeness, independent of strategy. More than 50% of these counties were selected both in the current and future planned networks, representing >83% of the species. Discussion Our results indicate that: (i) planning protected areas network currently can be useful to represent species under climate change; (ii) the overlapped planning units in the best solution for both current and future conditions can be considered as “no regret” areas; (iii) priority counties are spread throughout the biome, providing specific guidance wherever the possibility of creating protected area arises; and (iv) decisions can occur at different administrative spheres (Federal, State or County) as we found quite similar numerical solutions using either county or regional level strategies. PMID:29844952

Application of 1 D Finite Element Method in Combination with Laminar Solution Method for Pipe Network Analysis

NASA Astrophysics Data System (ADS)

Dudar, O. I.; Dudar, E. S.

2017-11-01

The features of application of the 1D dimensional finite element method (FEM) in combination with the laminar solutions method (LSM) for the calculation of underground ventilating networks are considered. In this case the processes of heat and mass transfer change the properties of a fluid (binary vapour-air mix). Under the action of gravitational forces it leads to such phenomena as natural draft, local circulation, etc. The FEM relations considering the action of gravity, the mass conservation law, the dependence of vapour-air mix properties on the thermodynamic parameters are derived so that it allows one to model the mentioned phenomena. The analogy of the elastic and plastic rod deformation processes to the processes of laminar and turbulent flow in a pipe is described. Owing to this analogy, the guaranteed convergence of the elastic solutions method for the materials of plastic type means the guaranteed convergence of the LSM for any regime of a turbulent flow in a rough pipe. By means of numerical experiments the convergence rate of the FEM - LSM is investigated. This convergence rate appeared much higher than the convergence rate of the Cross - Andriyashev method. Data of other authors on the convergence rate comparison for the finite element method, the Newton method and the method of gradient are provided. These data allow one to conclude that the FEM in combination with the LSM is one of the most effective methods of calculation of hydraulic and ventilating networks. The FEM - LSM has been used for creation of the research application programme package “MineClimate” allowing to calculate the microclimate parameters in the underground ventilating networks.

Investigating the Small-Scale Spatial Variabilty of Precipitable Water Vapor by Adding Single-Frequency Receivers into an Existing Dual-Frequency Receiver Network

NASA Astrophysics Data System (ADS)

Krietemeyer, Andreas; ten Veldhuis, Marie-claire; van de Giesen, Nick

2017-04-01

Exploiting GNSS signal delays is one possibility to obtain Precipitable Water Vapor (PWV) estimates in the atmosphere. The technique is well known since the early 1990s and by now an established method in the meteorological community. The data is crucial for weather forecasting and its assimilation into numerical weather forecasting models is a topic of ongoing research. However, the spatial resolution of ground based GNSS receivers is usually low, in the order of tens of kilometres. Since severe weather events such as convective storms can be concentrated in spatial extent, existing GNSS networks are often not sufficient to retrieve small scale PWV fluctuations and need to be densified. For economic reasons, the use of low-cost single-frequency receivers is a promising solution. In this study, we will deploy a network of single-frequency receivers to densify an existing dual-frequency network in order to investigate the spatial and temporal PWV variations. We demonstrate a test network consisting of four single-frequency receivers in the Rotterdam area (Netherlands). In order to eliminate the delay caused by the ionosphere, the Satellite-specific Epoch-differenced Ionospheric Delay model (SEID) is applied, using a surrounding dual-frequency network distributed over a radius of approximately 25 km. With the synthesized L2 frequency, the tropospheric delays are estimated using the Precise Point Positioning (PPP) strategy and International GNSS Service (IGS) final orbits. The PWV time series are validated by a comparison of a collocated single-frequency and a dual-frequency receiver. The time series themselves form the basis for potential further studies like data assimilation into numerical weather models and GNSS tomography to study the impact of the increased spatial resolution on local heavy rain forecast.

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

NASA Astrophysics Data System (ADS)

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

2017-04-01

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

Non-autonomous equations with unpredictable solutions

NASA Astrophysics Data System (ADS)

Akhmet, Marat; Fen, Mehmet Onur

2018-06-01

To make research of chaos more amenable to investigating differential and discrete equations, we introduce the concepts of an unpredictable function and sequence. The topology of uniform convergence on compact sets is applied to define unpredictable functions [1,2]. The unpredictable sequence is defined as a specific unpredictable function on the set of integers. The definitions are convenient to be verified as solutions of differential and discrete equations. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and uniqueness of the unpredictable solution for a delay differential equation are proved as well as for quasilinear discrete systems. As a corollary of the theorem, a similar assertion for a quasilinear ordinary differential equation is formulated. The results are demonstrated numerically, and an application to Hopfield neural networks is provided. In particular, Poincaré chaos near periodic orbits is observed. The completed research contributes to the theory of chaos as well as to the theory of differential and discrete equations, considering unpredictable solutions.

Stochastic DG Placement for Conservation Voltage Reduction Based on Multiple Replications Procedure

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

Wang, Zhaoyu; Chen, Bokan; Wang, Jianhui

2015-06-01

Conservation voltage reduction (CVR) and distributed-generation (DG) integration are popular strategies implemented by utilities to improve energy efficiency. This paper investigates the interactions between CVR and DG placement to minimize load consumption in distribution networks, while keeping the lowest voltage level within the predefined range. The optimal placement of DG units is formulated as a stochastic optimization problem considering the uncertainty of DG outputs and load consumptions. A sample average approximation algorithm-based technique is developed to solve the formulated problem effectively. A multiple replications procedure is developed to test the stability of the solution and calculate the confidence interval ofmore » the gap between the candidate solution and optimal solution. The proposed method has been applied to the IEEE 37-bus distribution test system with different scenarios. The numerical results indicate that the implementations of CVR and DG, if combined, can achieve significant energy savings.« less

Exact solution for the time evolution of network rewiring models

NASA Astrophysics Data System (ADS)

Evans, T. S.; Plato, A. D. K.

2007-05-01

We consider the rewiring of a bipartite graph using a mixture of random and preferential attachment. The full mean-field equations for the degree distribution and its generating function are given. The exact solution of these equations for all finite parameter values at any time is found in terms of standard functions. It is demonstrated that these solutions are an excellent fit to numerical simulations of the model. We discuss the relationship between our model and several others in the literature, including examples of urn, backgammon, and balls-in-boxes models, the Watts and Strogatz rewiring problem, and some models of zero range processes. Our model is also equivalent to those used in various applications including cultural transmission, family name and gene frequencies, glasses, and wealth distributions. Finally some Voter models and an example of a minority game also show features described by our model.

Pore network extraction from pore space images of various porous media systems

NASA Astrophysics Data System (ADS)

Yi, Zhixing; Lin, Mian; Jiang, Wenbin; Zhang, Zhaobin; Li, Haishan; Gao, Jian

2017-04-01

Pore network extraction, which is defined as the transformation from irregular pore space to a simplified network in the form of pores connected by throats, is significant to microstructure analysis and network modeling. A physically realistic pore network is not only a representation of the pore space in the sense of topology and morphology, but also a good tool for predicting transport properties accurately. We present a method to extract pore network by employing the centrally located medial axis to guide the construction of maximal-balls-like skeleton where the pores and throats are defined and parameterized. To validate our method, various rock samples including sand pack, sandstones, and carbonates were used to extract pore networks. The pore structures were compared quantitatively with the structures extracted by medial axis method or maximal ball method. The predicted absolute permeability and formation factor were verified against the theoretical solutions obtained by lattice Boltzmann method and finite volume method, respectively. The two-phase flow was simulated through the networks extracted from homogeneous sandstones, and the generated relative permeability curves were compared with the data obtained from experimental method and other numerical models. The results show that the accuracy of our network is higher than that of other networks for predicting transport properties, so the presented method is more reliable for extracting physically realistic pore network.

Power allocation for target detection in radar networks based on low probability of intercept: A cooperative game theoretical strategy

NASA Astrophysics Data System (ADS)

Shi, Chenguang; Salous, Sana; Wang, Fei; Zhou, Jianjiang

2017-08-01

Distributed radar network systems have been shown to have many unique features. Due to their advantage of signal and spatial diversities, radar networks are attractive for target detection. In practice, the netted radars in radar networks are supposed to maximize their transmit power to achieve better detection performance, which may be in contradiction with low probability of intercept (LPI). Therefore, this paper investigates the problem of adaptive power allocation for radar networks in a cooperative game-theoretic framework such that the LPI performance can be improved. Taking into consideration both the transmit power constraints and the minimum signal to interference plus noise ratio (SINR) requirement of each radar, a cooperative Nash bargaining power allocation game based on LPI is formulated, whose objective is to minimize the total transmit power by optimizing the power allocation in radar networks. First, a novel SINR-based network utility function is defined and utilized as a metric to evaluate power allocation. Then, with the well-designed network utility function, the existence and uniqueness of the Nash bargaining solution are proved analytically. Finally, an iterative Nash bargaining algorithm is developed that converges quickly to a Pareto optimal equilibrium for the cooperative game. Numerical simulations and theoretic analysis are provided to evaluate the effectiveness of the proposed algorithm.

Bicriteria Network Optimization Problem using Priority-based Genetic Algorithm

NASA Astrophysics Data System (ADS)

Gen, Mitsuo; Lin, Lin; Cheng, Runwei

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

Numerical simulation the pollutants transport in the Lake base on remote sensing image with Lattice Boltzmann Method

NASA Astrophysics Data System (ADS)

Qiao, Y.

2013-12-01

As China's economic development, water pollution incidents happened frequently. For example, the cyanobacterial bloom events repeatedly occur in Taihu Lake. In this research, we investigate the pollutants solute transport start at different points, such as the eutrophication substances Nitrogen and Phosphorus et al, with the Lattice Boltzmann Method (LBM) performed on real pore geometries. The LBM has emerged as a powerful tool for simulating the behaviour of multi-component fluid systems in complex pore networks. We will build a quick response simulation system, which is base on the high resolution GIS figure, using the LBM numerical method.When the start two deferent points at the Meiliang Bay nearby the Wuxi City, it is shown that the pollutants solute can't transport out of the bay to influence the Taihu Lake and the diffusion areas are similar. On the other hand, when the start point at central region of the Taihu Lake, it is found that the pollutants solute covered the almost whole area of the lake and the cyanobacterial bloom with good condition. In the same way, if the cyanobacterial bloom transport in the central area, then it will pollute the whole Taihu Lake. Therefore, when we monitor and deal with the eutrophication substances, we need to focus on the central area of lake.

An Object-Oriented Network-Centric Software Architecture for Physical Computing

NASA Astrophysics Data System (ADS)

Palmer, Richard

1997-08-01

Recent developments in object-oriented computer languages and infrastructure such as the Internet, Web browsers, and the like provide an opportunity to define a more productive computational environment for scientific programming that is based more closely on the underlying mathematics describing physics than traditional programming languages such as FORTRAN or C++. In this talk I describe an object-oriented software architecture for representing physical problems that includes classes for such common mathematical objects as geometry, boundary conditions, partial differential and integral equations, discretization and numerical solution methods, etc. In practice, a scientific program written using this architecture looks remarkably like the mathematics used to understand the problem, is typically an order of magnitude smaller than traditional FORTRAN or C++ codes, and hence easier to understand, debug, describe, etc. All objects in this architecture are ``network-enabled,'' which means that components of a software solution to a physical problem can be transparently loaded from anywhere on the Internet or other global network. The architecture is expressed as an ``API,'' or application programmers interface specification, with reference embeddings in Java, Python, and C++. A C++ class library for an early version of this API has been implemented for machines ranging from PC's to the IBM SP2, meaning that phidentical codes run on all architectures.

Numerical solution of the stochastic parabolic equation with the dependent operator coefficient

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

Ashyralyev, Allaberen; Department of Mathematics, ITTU, Ashgabat; Okur, Ulker

2015-09-18

In the present paper, a single step implicit difference scheme for the numerical solution of the stochastic parabolic equation with the dependent operator coefficient is presented. Theorem on convergence estimates for the solution of this difference scheme is established. In applications, this abstract result permits us to obtain the convergence estimates for the solution of difference schemes for the numerical solution of initial boundary value problems for parabolic equations. The theoretical statements for the solution of this difference scheme are supported by the results of numerical experiments.

Sedimentary Geothermal Feasibility Study: October 2016

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

Augustine, Chad; Zerpa, Luis

The objective of this project is to analyze the feasibility of commercial geothermal projects using numerical reservoir simulation, considering a sedimentary reservoir with low permeability that requires productivity enhancement. A commercial thermal reservoir simulator (STARS, from Computer Modeling Group, CMG) is used in this work for numerical modeling. In the first stage of this project (FY14), a hypothetical numerical reservoir model was developed, and validated against an analytical solution. The following model parameters were considered to obtain an acceptable match between the numerical and analytical solutions: grid block size, time step and reservoir areal dimensions; the latter related to boundarymore » effects on the numerical solution. Systematic model runs showed that insufficient grid sizing generates numerical dispersion that causes the numerical model to underestimate the thermal breakthrough time compared to the analytic model. As grid sizing is decreased, the model results converge on a solution. Likewise, insufficient reservoir model area introduces boundary effects in the numerical solution that cause the model results to differ from the analytical solution.« less

Thermoreversible Morphology and Conductivity of a Conjugated Polymer Network Embedded in Block Copolymer Self-Assemblies

DOE PAGES

Han, Youngkyu; Carrillo, Jan-Michael Y.; Zhang, Zhe; ...

2016-07-19

Self-assembly of block copolymers provides numerous opportunities to create functional materials, utilizing self-assembled microdomains with a variety of morphology and periodic architectures as templates for functional nanofillers. Here new progress is reported toward the fabrication of thermally responsive and electrically conductive polymeric self-assemblies made from a water-soluble poly(thiophene) derivative with short poly(ethylene oxide) side chains and Pluronic L62 block copolymer solution in water. The structural and electrical properties of conjugated polymer-embedded self-assembled architectures are investigated by combining small-angle neutron and X-ray scattering, coarse-grained molecular dynamics simulations, and impedance spectroscopy. The L62 solution template organizes the conjugated polymers by stably incorporatingmore » them into the hydrophilic domains thus inhibiting aggregation. The changing morphology of L62 during the micellarto- lamellar phase transition defines the embedded conjugated polymer network. As a result, the conductivity is strongly coupled to the structural change of the templating L62 phase and exhibits thermally reversible behavior with no signs of quenching of the conductivity at high temperature. In conclusion, this study shows promise for enabling more flexibility in processing and utilizing water-soluble conjugated polymers in aqueous solutions for self-assembly based fabrication of stimuli-responsive nanostructures and sensory materials.« less

Thermoreversible Morphology and Conductivity of a Conjugated Polymer Network Embedded in Block Copolymer Self-Assemblies

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

Han, Youngkyu; Carrillo, Jan-Michael Y.; Zhang, Zhe

Self-assembly of block copolymers provides numerous opportunities to create functional materials, utilizing self-assembled microdomains with a variety of morphology and periodic architectures as templates for functional nanofillers. Here new progress is reported toward the fabrication of thermally responsive and electrically conductive polymeric self-assemblies made from a water-soluble poly(thiophene) derivative with short poly(ethylene oxide) side chains and Pluronic L62 block copolymer solution in water. The structural and electrical properties of conjugated polymer-embedded self-assembled architectures are investigated by combining small-angle neutron and X-ray scattering, coarse-grained molecular dynamics simulations, and impedance spectroscopy. The L62 solution template organizes the conjugated polymers by stably incorporatingmore » them into the hydrophilic domains thus inhibiting aggregation. The changing morphology of L62 during the micellarto- lamellar phase transition defines the embedded conjugated polymer network. As a result, the conductivity is strongly coupled to the structural change of the templating L62 phase and exhibits thermally reversible behavior with no signs of quenching of the conductivity at high temperature. In conclusion, this study shows promise for enabling more flexibility in processing and utilizing water-soluble conjugated polymers in aqueous solutions for self-assembly based fabrication of stimuli-responsive nanostructures and sensory materials.« less

Discontinuous Galerkin finite element method for solving population density functions of cortical pyramidal and thalamic neuronal populations.

PubMed

Huang, Chih-Hsu; Lin, Chou-Ching K; Ju, Ming-Shaung

2015-02-01

Compared with the Monte Carlo method, the population density method is efficient for modeling collective dynamics of neuronal populations in human brain. In this method, a population density function describes the probabilistic distribution of states of all neurons in the population and it is governed by a hyperbolic partial differential equation. In the past, the problem was mainly solved by using the finite difference method. In a previous study, a continuous Galerkin finite element method was found better than the finite difference method for solving the hyperbolic partial differential equation; however, the population density function often has discontinuity and both methods suffer from a numerical stability problem. The goal of this study is to improve the numerical stability of the solution using discontinuous Galerkin finite element method. To test the performance of the new approach, interaction of a population of cortical pyramidal neurons and a population of thalamic neurons was simulated. The numerical results showed good agreement between results of discontinuous Galerkin finite element and Monte Carlo methods. The convergence and accuracy of the solutions are excellent. The numerical stability problem could be resolved using the discontinuous Galerkin finite element method which has total-variation-diminishing property. The efficient approach will be employed to simulate the electroencephalogram or dynamics of thalamocortical network which involves three populations, namely, thalamic reticular neurons, thalamocortical neurons and cortical pyramidal neurons. Copyright © 2014 Elsevier Ltd. All rights reserved.

Link importance incorporated failure probability measuring solution for multicast light-trees in elastic optical networks

NASA Astrophysics Data System (ADS)

Li, Xin; Zhang, Lu; Tang, Ying; Huang, Shanguo

2018-03-01

The light-tree-based optical multicasting (LT-OM) scheme provides a spectrum- and energy-efficient method to accommodate emerging multicast services. Some studies focus on the survivability technologies for LTs against a fixed number of link failures, such as single-link failure. However, a few studies involve failure probability constraints when building LTs. It is worth noting that each link of an LT plays different important roles under failure scenarios. When calculating the failure probability of an LT, the importance of its every link should be considered. We design a link importance incorporated failure probability measuring solution (LIFPMS) for multicast LTs under independent failure model and shared risk link group failure model. Based on the LIFPMS, we put forward the minimum failure probability (MFP) problem for the LT-OM scheme. Heuristic approaches are developed to address the MFP problem in elastic optical networks. Numerical results show that the LIFPMS provides an accurate metric for calculating the failure probability of multicast LTs and enhances the reliability of the LT-OM scheme while accommodating multicast services.

Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory

NASA Astrophysics Data System (ADS)

Scutari, Gesualdo; Facchinei, Francisco; Lampariello, Lorenzo

2017-04-01

In Part I of this paper, we proposed and analyzed a novel algorithmic framework for the minimization of a nonconvex (smooth) objective function, subject to nonconvex constraints, based on inner convex approximations. This Part II is devoted to the application of the framework to some resource allocation problems in communication networks. In particular, we consider two non-trivial case-study applications, namely: (generalizations of) i) the rate profile maximization in MIMO interference broadcast networks; and the ii) the max-min fair multicast multigroup beamforming problem in a multi-cell environment. We develop a new class of algorithms enjoying the following distinctive features: i) they are \\emph{distributed} across the base stations (with limited signaling) and lead to subproblems whose solutions are computable in closed form; and ii) differently from current relaxation-based schemes (e.g., semidefinite relaxation), they are proved to always converge to d-stationary solutions of the aforementioned class of nonconvex problems. Numerical results show that the proposed (distributed) schemes achieve larger worst-case rates (resp. signal-to-noise interference ratios) than state-of-the-art centralized ones while having comparable computational complexity.

Unifying Pore Network Modeling, Continuous Time Random Walk (CTRW) Theory and Experiment to Describe Impact of Spatial Heterogeneities on Solute Dispersion at Multiple Length-scales

NASA Astrophysics Data System (ADS)

Bijeljic, B.; Blunt, M. J.; Rhodes, M. E.

2009-04-01

This talk will describe and highlight the advantages offered by a novel methodology that unifies pore network modeling, CTRW theory and experiment in description of solute dispersion in porous media. Solute transport in a porous medium is characterized by the interplay of advection and diffusion (described by Peclet number, Pe) that cause dispersion of solute particles. Dispersion is traditionally described by dispersion coefficients, D, that are commonly calculated from the spatial moments of the plume. Using a pore-scale network model based on particle tracking, the rich Peclet-number dependence of dispersion coefficient is predicted from first principles and is shown to compare well with experimental data for restricted diffusion, transition, power-law and mechanical dispersion regimes in the asymptotic limit. In the asymptotic limit D is constant and can be used in an averaged advection-dispersion equation. However, it is highly important to recognize that, until the velocity field is fully sampled, the particle transport is non-Gaussian and D possesses temporal or spatial variation. Furthermore, temporal probability density functions (PDF) of tracer particles are studied in pore networks and an excellent agreement for the spectrum of transition times for particles from pore to pore is obtained between network model results and CTRW theory. Based on the truncated power-law interpretation of PDF-s, the physical origin of the power-law scaling of dispersion coefficient vs. Peclet number has been explained for unconsolidated porous media, sands and a number of sandstones, arriving at the same conclusion from numerical network modelling, analytic CTRW theory and experiment. The length traveled by solute plumes before Gaussian behaviour is reached increases with an increase in heterogeneity and/or Pe. This opens up the question on the nature of dispersion in natural systems where the heterogeneities at the larger scales will significantly increase the range of velocities in the reservoir, thus significantly delaying the asymptotic approach to Gaussian behaviour. As a consequence, the asymptotic behaviour might not be reached at the field scale. This is illustrated by the multi-scale approach in which transport at core, gridblock and field scale is viewed as a series of particle transitions between discrete nodes governed by probability distributions. At each scale of interest a distribution that represents transport physics (and the heterogeneity) is used as an input to model a subsequent reservoir scale. The extensions to reactive transport are discussed.

Numerical integration of asymptotic solutions of ordinary differential equations

NASA Technical Reports Server (NTRS)

Thurston, Gaylen A.

1989-01-01

Classical asymptotic analysis of ordinary differential equations derives approximate solutions that are numerically stable. However, the analysis also leads to tedious expansions in powers of the relevant parameter for a particular problem. The expansions are replaced with integrals that can be evaluated by numerical integration. The resulting numerical solutions retain the linear independence that is the main advantage of asymptotic solutions. Examples, including the Falkner-Skan equation from laminar boundary layer theory, illustrate the method of asymptotic analysis with numerical integration.

Designing Networks that are Capable of Self-Healing and Adapting

DTIC Science & Technology

2017-04-01

from statistical mechanics, combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we... principles for self-healing networks, and applications, and construct an all-possible-paths model for network adaptation. 2015-11-16 UNIT CONVERSION...combinatorics, boolean networks, and numerical simulations, and inspired by design principles from biological networks, we will undertake the fol

Present-Day Kinematics of the Central Mediterranean Plate Boundary Region from Large GPS Network Analysis Using the Ambizap Algorithm

NASA Astrophysics Data System (ADS)

D'Anastasio, E.; D'Agostino, N.; Avallone, A.; Blewitt, G.

2008-12-01

The large, recent increase of continuous GPS (CGPS) stations in the Central Mediterranean plate boundary zone offers the opportunity to study in detail the present-day kinematics of this actively deforming region. CGPS data from scientific and commercial networks in the Italian region is now available from more than 350 stations, including more than 130 from the RING network deployed by the Istituto Nazionale di Geofisica e Vulcanologia. The RING stations all have high quality GPS monuments and are co- located with broadband or very broadband seismometers and strong motion sensors. The analysis presented here also uses far-field data to provide reference frame control, bringing the total to over 580 CGPS stations. GPS ambiguity resolution of such a large amount of data presents a serious challenge in terms of processing time. Many scientific GPS data processing software packages address this problem by dividing the network into several clusters. In contrast, this analysis uses the new Ambizap GPS processing algorithm (Blewitt, 2008) to obtain unique, self-consistent daily ambiguity-fixed solutions for the entire network. Ambizap allows for a rapid and multiple reanalysis of large regional networks such the one presented in this work. Tests show that Ambizap reproduces solutions from time-prohibitive full-network ambiguity resolution to much less than 1 mm. Single station GPS data are first processed with the GIPSY-OASIS II software by the precise point positioning (PPP) strategy (Zumberge et al., 1997) using JPL products from ftp://sideshow.jpl.nasa.gov. Integer ambiguity resolution is then applied using Ambizap. The resulting daily solutions are aligned to the ITRF2005 reference frame. Then, using the CATS software (Williams, 2007), time series are cleaned to remove outliers and are analyzed for their noise properties, linear velocities, periodic signals and antenna jumps. Stable plate reference frames are realized by minimizing the horizontal velocities at more than 70 and 20 sites on the Eurasia and Nubia plates, respectively. The daily RMS scatter for the east coordinates (derived from PPP) in this frame is typically in the range 2-4 mm before applying Ambizap, and 1-2 mm after applying Ambizap. The solutions are then evaluated with regard to the numerous scientific motivations behind this project, ranging from the definition of strain distribution and microplate kinematics within the plate boundary, to the evaluation of tectonic strain accumulation on active faults. References: Blewitt, G. (2008), Fixed-point theorems of GPS carrier phase ambiguity resolution and their application to massive network processing: 'Ambizap', J. Geophys. Res., doi:10.1029/2008JB005736, in press. Williams, S.D.P. (2007), CATS: GPS coordinate time series analysis software, GPS solut., doi:10.1007/s10291-007-0086-4 Zumberge, J. F., M. B. Heflin, D. C. Jefferson, M. M. Watkins, and F. H. Webb (1997), Precise point positioning for the efficient and robust analysis of GPS data from large networks, J. Geophys. Res., 102, 5005-501

Noise reduction in urban LRT networks by combining track based solutions.

PubMed

Vogiatzis, Konstantinos; Vanhonacker, Patrick

2016-10-15

The overall objective of the Quiet-Track project is to provide step-changing track based noise mitigation and maintenance schemes for railway rolling noise in LRT (Light Rail Transit) networks. WP 4 in particular focuses on the combination of existing track based solutions to yield a global performance of at least 6dB(A). The validation was carried out using a track section in the network of Athens Metro Line 1 with an existing outside concrete slab track (RHEDA track) where high airborne rolling noise was observed. The procedure for the selection of mitigation measures is based on numerical simulations, combining WRNOISE and IMMI software tools for noise prediction with experimental determination of the required track and vehicle parameters (e.g., rail and wheel roughness). The availability of a detailed rolling noise calculation procedure allows for detailed designing of measures and of ranking individual measures. It achieves this by including the modelling of the wheel/rail source intensity and of the noise propagation with the ability to evaluate the effect of modifications at source level (e.g., grinding, rail dampers, wheel dampers, change in resiliency of wheels and/or rail fixation) and of modifications in the propagation path (absorption at the track base, noise barriers, screening). A relevant combination of existing solutions was selected in the function of the simulation results. Three distinct existing solutions were designed in detail aiming at a high rolling noise attenuation and not affecting the normal operation of the metro system: Action 1: implementation of sound absorbing precast elements (panel type) on the track bed, Action 2: implementation of an absorbing noise barrier with a height of 1.10-1.20m above rail level, and Action 3: installation of rail dampers. The selected solutions were implemented on site and the global performance was measured step by step for comparison with simulations. Copyright © 2015 Elsevier B.V. All rights reserved.

Extending Beowulf Clusters

USGS Publications Warehouse

Steinwand, Daniel R.; Maddox, Brian; Beckmann, Tim; Hamer, George

2003-01-01

Beowulf clusters can provide a cost-effective way to compute numerical models and process large amounts of remote sensing image data. Usually a Beowulf cluster is designed to accomplish a specific set of processing goals, and processing is very efficient when the problem remains inside the constraints of the original design. There are cases, however, when one might wish to compute a problem that is beyond the capacity of the local Beowulf system. In these cases, spreading the problem to multiple clusters or to other machines on the network may provide a cost-effective solution.

The effect of the neutral sheet structure of the interplanetary magnetic field on cosmic ray distribution in space

NASA Technical Reports Server (NTRS)

Alania, M. V.; Aslamazashvili, R. G.; Bochorishvili, T.; Djapiashvili, T. V.; Tkemaladze, V. S.

1985-01-01

Results of the numerical solution of the anistoropic diffusion equation are presented. The modulation depth of galactic cosmic rays is defined by the degree of curvature of the neutral current sheet in the heliosphere. The effect of the regular interplanetary magnetic field (IMF) on cosmic ray anisotropy in the period of solar activity minimum (in 1976) is analyzed by the data of the neutron super-monitors of the world network, and the heliolatitudinal gradient and cosmic ray diffusion coefficient are defined.

Machine learning action parameters in lattice quantum chromodynamics

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

Shanahan, Phiala; Trewartha, Daneil; Detmold, William

Numerical lattice quantum chromodynamics studies of the strong interaction underpin theoretical understanding of many aspects of particle and nuclear physics. Such studies require significant computing resources to undertake. A number of proposed methods promise improved efficiency of lattice calculations, and access to regions of parameter space that are currently computationally intractable, via multi-scale action-matching approaches that necessitate parametric regression of generated lattice datasets. The applicability of machine learning to this regression task is investigated, with deep neural networks found to provide an efficient solution even in cases where approaches such as principal component analysis fail. Finally, the high information contentmore » and complex symmetries inherent in lattice QCD datasets require custom neural network layers to be introduced and present opportunities for further development.« less

Epidemic spreading in a hierarchical social network.

PubMed

Grabowski, A; Kosiński, R A

2004-09-01

A model of epidemic spreading in a population with a hierarchical structure of interpersonal interactions is described and investigated numerically. The structure of interpersonal connections is based on a scale-free network. Spatial localization of individuals belonging to different social groups, and the mobility of a contemporary community, as well as the effectiveness of different interpersonal interactions, are taken into account. Typical relations characterizing the spreading process, like a range of epidemic and epidemic curves, are discussed. The influence of preventive vaccinations on the spreading process is investigated. The critical value of preventively vaccinated individuals that is sufficient for the suppression of an epidemic is calculated. Our results are compared with solutions of the master equation for the spreading process and good agreement of the character of this process is found.

Machine learning action parameters in lattice quantum chromodynamics

DOE PAGES

Shanahan, Phiala; Trewartha, Daneil; Detmold, William

2018-05-16

Numerical lattice quantum chromodynamics studies of the strong interaction underpin theoretical understanding of many aspects of particle and nuclear physics. Such studies require significant computing resources to undertake. A number of proposed methods promise improved efficiency of lattice calculations, and access to regions of parameter space that are currently computationally intractable, via multi-scale action-matching approaches that necessitate parametric regression of generated lattice datasets. The applicability of machine learning to this regression task is investigated, with deep neural networks found to provide an efficient solution even in cases where approaches such as principal component analysis fail. Finally, the high information contentmore » and complex symmetries inherent in lattice QCD datasets require custom neural network layers to be introduced and present opportunities for further development.« less

Convergence and attractivity of memristor-based cellular neural networks with time delays.

PubMed

Qin, Sitian; Wang, Jun; Xue, Xiaoping

2015-03-01

This paper presents theoretical results on the convergence and attractivity of memristor-based cellular neural networks (MCNNs) with time delays. Based on a realistic memristor model, an MCNN is modeled using a differential inclusion. The essential boundedness of its global solutions is proven. The state of MCNNs is further proven to be convergent to a critical-point set located in saturated region of the activation function, when the initial state locates in a saturated region. It is shown that the state convergence time period is finite and can be quantitatively estimated using given parameters. Furthermore, the positive invariance and attractivity of state in non-saturated regions are also proven. The simulation results of several numerical examples are provided to substantiate the results. Copyright © 2014 Elsevier Ltd. All rights reserved.

Adaptive Grid Generation for Numerical Solution of Partial Differential Equations.

DTIC Science & Technology

1983-12-01

numerical solution of fluid dynamics problems is presented. However, the method is applicable to the numer- ical evaluation of any partial differential...emphasis is being placed on numerical solution of the governing differential equations by finite difference methods . In the past two decades, considerable...original equations presented in that paper. The solution of the second problem is more difficult. 2 The method of Thompson et al. provides control for

Alternative formulations of the Laplace transform boundary element (LTBE) numerical method for the solution of diffusion-type equations

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

Moridis, G.

1992-03-01

The Laplace Transform Boundary Element (LTBE) method is a recently introduced numerical method, and has been used for the solution of diffusion-type PDEs. It completely eliminates the time dependency of the problem and the need for time discretization, yielding solutions numerical in space and semi-analytical in time. In LTBE solutions are obtained in the Laplace spare, and are then inverted numerically to yield the solution in time. The Stehfest and the DeHoog formulations of LTBE, based on two different inversion algorithms, are investigated. Both formulations produce comparable, extremely accurate solutions.

Numerical solution of potential flow about arbitrary 2-dimensional multiple bodies

NASA Technical Reports Server (NTRS)

Thompson, J. F.; Thames, F. C.

1982-01-01

A procedure for the finite-difference numerical solution of the lifting potential flow about any number of arbitrarily shaped bodies is given. The solution is based on a technique of automatic numerical generation of a curvilinear coordinate system having coordinate lines coincident with the contours of all bodies in the field, regardless of their shapes and number. The effects of all numerical parameters involved are analyzed and appropriate values are recommended. Comparisons with analytic solutions for single Karman-Trefftz airfoils and a circular cylinder pair show excellent agreement. The technique of application of the boundary-fitted coordinate systems to the numerical solution of partial differential equations is illustrated.

A Novel Nano/Micro-Fluidic Reactor for Evaluation of Pore-Scale Reactive Transport

NASA Astrophysics Data System (ADS)

Werth, C. J.; Alcalde, R.; Ghazvini, S.; Sanford, R. A.; Fouke, B. W.; Valocchi, A. J.

2017-12-01

The reactive transport of pollutants in groundwater can be affected by the presence of stressor chemicals, which inhibit microbial functions. The stressor can be a primary reactant (e.g., trichloroethene), a reaction product (e.g., nitrite from nitrate), or some other chemical present in groundwater (e.g., antibiotic). In this work, a novel nano/microfluidic cell was developed to examine the effect of the antibiotic ciprofloxacin on nitrate reduction coupled to lactate oxidation. The reactor contains parallel boundary channels that deliver flow and solutes on either side of a pore network. The boundary channels are separated from the pore network by one centimeter-long, one micrometer-thick walls perforated by hundreds of nanoslits. The nanoslits allow solute mass transfer from the boundary channels to the pore network, but not microbial passage. The pore network was inoculated with a pure culture of Shewanella oneidensis MR-1, and this was allowed to grow on lactate and nitrate in the presence of ciprofloxacin, all delivered through the boundary channels. Microbial growth patterns suggest inhibition from ciprofloxacin and the nitrate reduction product nitrite, and a dependence on nitrate and lactate mass transfer rates from the boundary channels. A numerical model was developed to interpret the controlling mechanisms, and results indicate cell chemotaxis also affects nitrate reduction and microbial growth. The results are broadly relevant to bioremediation efforts where one or more chemicals that inhibit microbial growth are present and inhibit pollutant degradation rates.

Meeting the challenge of funding and allocating resources to mental health across Europe: developing the Mental Health Economics European Network.

PubMed

McDaid, David; Knapp, Martin; Curran, Claire

2006-01-01

There is growing demand for economic analysis to support strategic decision-making for mental health but the availability of economic evidence, in particular on system performance remains limited. The Mental Health Economics European Network (MHEEN) was set up in 2002 with the broad objective of developing a base for mental health economics information and subsequent work in 17 countries. Data on financing, expenditure and costs, provision of services, workforce, employment and capacity for economic evaluation were collected through bespoke questionnaires developed iteratively by the Network. This was augmented by a literature review and analysis of international databases. Findings on financing alone suggest that in many European countries mental health appears to be neglected while mechanisms for resource allocation are rarely linked to objective measure of population mental health needs. Numerous economic barriers and potential solutions were identified. Economic incentives may be one way of promoting change, although there is no 'one size fits all solution. There are significant benefits and synergies to be gained from the continuing development of networks such as MHEEN. In particular the analysis can be used to inform developments in Central and Eastern Europe. For instance there is much that can be learnt on both how the balance of care between institutional and non-institutional care has changed and on the role played by economic incentives in ensuring that resources were used to develop alternative community-based systems.

Optimal and robust control of a class of nonlinear systems using dynamically re-optimised single network adaptive critic design

NASA Astrophysics Data System (ADS)

Tiwari, Shivendra N.; Padhi, Radhakant

2018-01-01

Following the philosophy of adaptive optimal control, a neural network-based state feedback optimal control synthesis approach is presented in this paper. First, accounting for a nominal system model, a single network adaptive critic (SNAC) based multi-layered neural network (called as NN1) is synthesised offline. However, another linear-in-weight neural network (called as NN2) is trained online and augmented to NN1 in such a manner that their combined output represent the desired optimal costate for the actual plant. To do this, the nominal model needs to be updated online to adapt to the actual plant, which is done by synthesising yet another linear-in-weight neural network (called as NN3) online. Training of NN3 is done by utilising the error information between the nominal and actual states and carrying out the necessary Lyapunov stability analysis using a Sobolev norm based Lyapunov function. This helps in training NN2 successfully to capture the required optimal relationship. The overall architecture is named as 'Dynamically Re-optimised single network adaptive critic (DR-SNAC)'. Numerical results for two motivating illustrative problems are presented, including comparison studies with closed form solution for one problem, which clearly demonstrate the effectiveness and benefit of the proposed approach.

Mean field approximation for biased diffusion on Japanese inter-firm trading network.

PubMed

Watanabe, Hayafumi

2014-01-01

By analysing the financial data of firms across Japan, a nonlinear power law with an exponent of 1.3 was observed between the number of business partners (i.e. the degree of the inter-firm trading network) and sales. In a previous study using numerical simulations, we found that this scaling can be explained by both the money-transport model, where a firm (i.e. customer) distributes money to its out-edges (suppliers) in proportion to the in-degree of destinations, and by the correlations among the Japanese inter-firm trading network. However, in this previous study, we could not specifically identify what types of structure properties (or correlations) of the network determine the 1.3 exponent. In the present study, we more clearly elucidate the relationship between this nonlinear scaling and the network structure by applying mean-field approximation of the diffusion in a complex network to this money-transport model. Using theoretical analysis, we obtained the mean-field solution of the model and found that, in the case of the Japanese firms, the scaling exponent of 1.3 can be determined from the power law of the average degree of the nearest neighbours of the network with an exponent of -0.7.

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.

Optimization of deformation monitoring networks using finite element strain analysis

NASA Astrophysics Data System (ADS)

Alizadeh-Khameneh, M. Amin; Eshagh, Mehdi; Jensen, Anna B. O.

2018-04-01

An optimal design of a geodetic network can fulfill the requested precision and reliability of the network, and decrease the expenses of its execution by removing unnecessary observations. The role of an optimal design is highlighted in deformation monitoring network due to the repeatability of these networks. The core design problem is how to define precision and reliability criteria. This paper proposes a solution, where the precision criterion is defined based on the precision of deformation parameters, i. e. precision of strain and differential rotations. A strain analysis can be performed to obtain some information about the possible deformation of a deformable object. In this study, we split an area into a number of three-dimensional finite elements with the help of the Delaunay triangulation and performed the strain analysis on each element. According to the obtained precision of deformation parameters in each element, the precision criterion of displacement detection at each network point is then determined. The developed criterion is implemented to optimize the observations from the Global Positioning System (GPS) in Skåne monitoring network in Sweden. The network was established in 1989 and straddled the Tornquist zone, which is one of the most active faults in southern Sweden. The numerical results show that 17 out of all 21 possible GPS baseline observations are sufficient to detect minimum 3 mm displacement at each network point.

Spurious Numerical Solutions Of Differential Equations

NASA Technical Reports Server (NTRS)

Lafon, A.; Yee, H. C.

1995-01-01

Paper presents detailed study of spurious steady-state numerical solutions of differential equations that contain nonlinear source terms. Main objectives of this study are (1) to investigate how well numerical steady-state solutions of model nonlinear reaction/convection boundary-value problem mimic true steady-state solutions and (2) to relate findings of this investigation to implications for interpretation of numerical results from computational-fluid-dynamics algorithms and computer codes used to simulate reacting flows.

Balancing energy consumption with hybrid clustering and routing strategy in wireless sensor networks.

PubMed

Xu, Zhezhuang; Chen, Liquan; Liu, Ting; Cao, Lianyang; Chen, Cailian

2015-10-20

Multi-hop data collection in wireless sensor networks (WSNs) is a challenge issue due to the limited energy resource and transmission range of wireless sensors. The hybrid clustering and routing (HCR) strategy has provided an effective solution, which can generate a connected and efficient cluster-based topology for multi-hop data collection in WSNs. However, it suffers from imbalanced energy consumption, which results in the poor performance of the network lifetime. In this paper, we evaluate the energy consumption of HCR and discover an important result: the imbalanced energy consumption generally appears in gradient k = 1, i.e., the nodes that can communicate with the sink directly. Based on this observation, we propose a new protocol called HCR-1, which includes the adaptive relay selection and tunable cost functions to balance the energy consumption. The guideline of setting the parameters in HCR-1 is provided based on simulations. The analytical and numerical results prove that, with minor modification of the topology in Sensors 2015, 15 26584 gradient k = 1, the HCR-1 protocol effectively balances the energy consumption and prolongs the network lifetime.

Deep learning and the electronic structure problem

NASA Astrophysics Data System (ADS)

Mills, Kyle; Spanner, Michael; Tamblyn, Isaac

In the past decade, the fields of artificial intelligence and computer vision have progressed remarkably. Supported by the enthusiasm of large tech companies, as well as significant hardware advances and the utilization of graphical processing units to accelerate computations, deep neural networks (DNN) are gaining momentum as a robust choice for many diverse machine learning applications. We have demonstrated the ability of a DNN to solve a quantum mechanical eigenvalue equation directly, without the need to compute a wavefunction, and without knowledge of the underlying physics. We have trained a convolutional neural network to predict the total energy of an electron in a confining, 2-dimensional electrostatic potential. We numerically solved the one-electron Schrödinger equation for millions of electrostatic potentials, and used this as training data for our neural network. Four classes of potentials were assessed: the canonical cases of the harmonic oscillator and infinite well, and two types of randomly generated potentials for which no analytic solution is known. We compare the performance of the neural network and consider how these results could lead to future advances in electronic structure theory.

Evaluation of Supply Chain Efficiency Based on a Novel Network of Data Envelopment Analysis Model

NASA Astrophysics Data System (ADS)

Fu, Li Fang; Meng, Jun; Liu, Ying

2015-12-01

Performance evaluation of supply chain (SC) is a vital topic in SC management and inherently complex problems with multilayered internal linkages and activities of multiple entities. Recently, various Network Data Envelopment Analysis (NDEA) models, which opened the “black box” of conventional DEA, were developed and applied to evaluate the complex SC with a multilayer network structure. However, most of them are input or output oriented models which cannot take into consideration the nonproportional changes of inputs and outputs simultaneously. This paper extends the Slack-based measure (SBM) model to a nonradial, nonoriented network model named as U-NSBM with the presence of undesirable outputs in the SC. A numerical example is presented to demonstrate the applicability of the model in quantifying the efficiency and ranking the supply chain performance. By comparing with the CCR and U-SBM models, it is shown that the proposed model has higher distinguishing ability and gives feasible solution in the presence of undesirable outputs. Meanwhile, it provides more insights for decision makers about the source of inefficiency as well as the guidance to improve the SC performance.

Data Gathering and Energy Transfer Dilemma in UAV-Assisted Flying Access Network for IoT.

PubMed

Arabi, Sara; Sabir, Essaid; Elbiaze, Halima; Sadik, Mohamed

2018-05-11

Recently, Unmanned Aerial Vehicles (UAVs) have emerged as an alternative solution to assist wireless networks, thanks to numerous advantages they offer in comparison to terrestrial fixed base stations. For instance, a UAV can be used to embed a flying base station providing an on-demand nomadic access to network services. A UAV can also be used to wirelessly recharge out-of-battery ground devices. In this paper, we aim to deal with both data collection and recharging depleted ground Internet-of-Things (IoT) devices through a UAV station used as a flying base station. To extend the network lifetime, we present a novel use of UAV with energy harvesting module and wireless recharging capabilities. However, the UAV is used as an energy source to empower depleted IoT devices. On one hand, the UAV charges depleted ground IoT devices under three policies: (1) low-battery first scheme; (2) high-battery first scheme; and (3) random scheme. On the other hand, the UAV station collects data from IoT devices that have sufficient energy to transmit their packets, and in the same phase, the UAV exploits the Radio Frequency (RF) signals transmitted by IoT devices to extract and harvest energy. Furthermore, and as the UAV station has a limited coverage time due to its energy constraints, we propose and investigate an efficient trade-off between ground users recharging time and data gathering time. Furthermore, we suggest to control and optimize the UAV trajectory in order to complete its travel within a minimum time, while minimizing the energy spent and/or enhancing the network lifetime. Extensive numerical results and simulations show how the system behaves under different scenarios and using various metrics in which we examine the added value of UAV with energy harvesting module.

Theory of rumour spreading in complex social networks

NASA Astrophysics Data System (ADS)

Nekovee, M.; Moreno, Y.; Bianconi, G.; Marsili, M.

2007-01-01

We introduce a general stochastic model for the spread of rumours, and derive mean-field equations that describe the dynamics of the model on complex social networks (in particular, those mediated by the Internet). We use analytical and numerical solutions of these equations to examine the threshold behaviour and dynamics of the model on several models of such networks: random graphs, uncorrelated scale-free networks and scale-free networks with assortative degree correlations. We show that in both homogeneous networks and random graphs the model exhibits a critical threshold in the rumour spreading rate below which a rumour cannot propagate in the system. In the case of scale-free networks, on the other hand, this threshold becomes vanishingly small in the limit of infinite system size. We find that the initial rate at which a rumour spreads is much higher in scale-free networks than in random graphs, and that the rate at which the spreading proceeds on scale-free networks is further increased when assortative degree correlations are introduced. The impact of degree correlations on the final fraction of nodes that ever hears a rumour, however, depends on the interplay between network topology and the rumour spreading rate. Our results show that scale-free social networks are prone to the spreading of rumours, just as they are to the spreading of infections. They are relevant to the spreading dynamics of chain emails, viral advertising and large-scale information dissemination algorithms on the Internet.

Maximal aggregation of polynomial dynamical systems

PubMed Central

Cardelli, Luca; Tschaikowski, Max

2017-01-01

Ordinary differential equations (ODEs) with polynomial derivatives are a fundamental tool for understanding the dynamics of systems across many branches of science, but our ability to gain mechanistic insight and effectively conduct numerical evaluations is critically hindered when dealing with large models. Here we propose an aggregation technique that rests on two notions of equivalence relating ODE variables whenever they have the same solution (backward criterion) or if a self-consistent system can be written for describing the evolution of sums of variables in the same equivalence class (forward criterion). A key feature of our proposal is to encode a polynomial ODE system into a finitary structure akin to a formal chemical reaction network. This enables the development of a discrete algorithm to efficiently compute the largest equivalence, building on approaches rooted in computer science to minimize basic models of computation through iterative partition refinements. The physical interpretability of the aggregation is shown on polynomial ODE systems for biochemical reaction networks, gene regulatory networks, and evolutionary game theory. PMID:28878023

Stochastic Dual Algorithm for Voltage Regulation in Distribution Networks with Discrete Loads: Preprint

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

Dall-Anese, Emiliano; Zhou, Xinyang; Liu, Zhiyuan

This paper considers distribution networks with distributed energy resources and discrete-rate loads, and designs an incentive-based algorithm that allows the network operator and the customers to pursue given operational and economic objectives, while concurrently ensuring that voltages are within prescribed limits. Four major challenges include: (1) the non-convexity from discrete decision variables, (2) the non-convexity due to a Stackelberg game structure, (3) unavailable private information from customers, and (4) different update frequency from two types of devices. In this paper, we first make convex relaxation for discrete variables, then reformulate the non-convex structure into a convex optimization problem together withmore » pricing/reward signal design, and propose a distributed stochastic dual algorithm for solving the reformulated problem while restoring feasible power rates for discrete devices. By doing so, we are able to statistically achieve the solution of the reformulated problem without exposure of any private information from customers. Stability of the proposed schemes is analytically established and numerically corroborated.« less

Epidemic spreading on activity-driven networks with attractiveness.

PubMed

Pozzana, Iacopo; Sun, Kaiyuan; Perra, Nicola

2017-10-01

We study SIS epidemic spreading processes unfolding on a recent generalization of the activity-driven modeling framework. In this model of time-varying networks, each node is described by two variables: activity and attractiveness. The first describes the propensity to form connections, while the second defines the propensity to attract them. We derive analytically the epidemic threshold considering the time scale driving the evolution of contacts and the contagion as comparable. The solutions are general and hold for any joint distribution of activity and attractiveness. The theoretical picture is confirmed via large-scale numerical simulations performed considering heterogeneous distributions and different correlations between the two variables. We find that heterogeneous distributions of attractiveness alter the contagion process. In particular, in the case of uncorrelated and positive correlations between the two variables, heterogeneous attractiveness facilitates the spreading. On the contrary, negative correlations between activity and attractiveness hamper the spreading. The results presented contribute to the understanding of the dynamical properties of time-varying networks and their effects on contagion phenomena unfolding on their fabric.

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.

A numerical study of the 3-periodic wave solutions to KdV-type equations

NASA Astrophysics Data System (ADS)

Zhang, Yingnan; Hu, Xingbiao; Sun, Jianqing

2018-02-01

In this paper, by using the direct method of calculating periodic wave solutions proposed by Akira Nakamura, we present a numerical process to calculate the 3-periodic wave solutions to several KdV-type equations: the Korteweg-de Vries equation, the Sawada-Koterra equation, the Boussinesq equation, the Ito equation, the Hietarinta equation and the (2 + 1)-dimensional Kadomtsev-Petviashvili equation. Some detailed numerical examples are given to show the existence of the three-periodic wave solutions numerically.

Numerical Algorithm for Delta of Asian Option

PubMed Central

Zhang, Boxiang; Yu, Yang; Wang, Weiguo

2015-01-01

We study the numerical solution of the Greeks of Asian options. In particular, we derive a close form solution of Δ of Asian geometric option and use this analytical form as a control to numerically calculate Δ of Asian arithmetic option, which is known to have no explicit close form solution. We implement our proposed numerical method and compare the standard error with other classical variance reduction methods. Our method provides an efficient solution to the hedging strategy with Asian options. PMID:26266271

Numerical simulation of KdV equation by finite difference method

NASA Astrophysics Data System (ADS)

Yokus, A.; Bulut, H.

2018-05-01

In this study, the numerical solutions to the KdV equation with dual power nonlinearity by using the finite difference method are obtained. Discretize equation is presented in the form of finite difference operators. The numerical solutions are secured via the analytical solution to the KdV equation with dual power nonlinearity which is present in the literature. Through the Fourier-Von Neumann technique and linear stable, we have seen that the FDM is stable. Accuracy of the method is analyzed via the L2 and L_{∞} norm errors. The numerical, exact approximations and absolute error are presented in tables. We compare the numerical solutions with the exact solutions and this comparison is supported with the graphic plots. Under the choice of suitable values of parameters, the 2D and 3D surfaces for the used analytical solution are plotted.

Finite-analytic numerical solution of heat transfer in two-dimensional cavity flow

NASA Technical Reports Server (NTRS)

Chen, C.-J.; Naseri-Neshat, H.; Ho, K.-S.

1981-01-01

Heat transfer in cavity flow is numerically analyzed by a new numerical method called the finite-analytic method. The basic idea of the finite-analytic method is the incorporation of local analytic solutions in the numerical solutions of linear or nonlinear partial differential equations. In the present investigation, the local analytic solutions for temperature, stream function, and vorticity distributions are derived. When the local analytic solution is evaluated at a given nodal point, it gives an algebraic relationship between a nodal value in a subregion and its neighboring nodal points. A system of algebraic equations is solved to provide the numerical solution of the problem. The finite-analytic method is used to solve heat transfer in the cavity flow at high Reynolds number (1000) for Prandtl numbers of 0.1, 1, and 10.

Application of the simplex method to the optimal adjustment of the parameters of a ventilation network

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

Kamba, G.M.; Jacques, E.; Patigny, J.

1995-12-31

Literature is rather abundant on the topic of steady-state network analysis programs. Many versions exist, some of them have real extended facilities such as full graphical manipulation, fire simulation in motion, etc. These programs are certainly of great help to any ventilation planning and often assist the ventilation engineer in his operational decision making. However, what ever the efficiency of the calculation algorithms might be, their weak point still is the overall validity of the model. This numerical model, apart from maybe the questionable application of some physical laws, depends directly on the quality of the data used to identifymore » its most influencing parameters such as the passive (resistance) or active (fan) characteristic of each of the branches in the network. Considering the non-linear character of the problem and the great number of variables involved, finding the closest numerical model of a real mine ventilation network is without any doubt a very difficult problem. This problem, often referred to as the parameter adjustment problem, is in almost every practical case solved on an experimental and {open_quotes}feeling{close_quotes} basis. Only a few papers put forward a mathematical solution based on a least square approach as the best fit criterion. The aim of this paper is to examine the possibility to apply the well-known simplex method to this problem. The performance of this method and its capability to reach the global optimum which corresponds to the best fit is discussed and compared to that of other methods.« less

Activity in the fronto-parietal network indicates numerical inductive reasoning beyond calculation: An fMRI study combined with a cognitive model

PubMed Central

Liang, Peipeng; Jia, Xiuqin; Taatgen, Niels A.; Borst, Jelmer P.; Li, Kuncheng

2016-01-01

Numerical inductive reasoning refers to the process of identifying and extrapolating the rule involved in numeric materials. It is associated with calculation, and shares the common activation of the fronto-parietal regions with calculation, which suggests that numerical inductive reasoning may correspond to a general calculation process. However, compared with calculation, rule identification is critical and unique to reasoning. Previous studies have established the central role of the fronto-parietal network for relational integration during rule identification in numerical inductive reasoning. The current question of interest is whether numerical inductive reasoning exclusively corresponds to calculation or operates beyond calculation, and whether it is possible to distinguish between them based on the activity pattern in the fronto-parietal network. To directly address this issue, three types of problems were created: numerical inductive reasoning, calculation, and perceptual judgment. Our results showed that the fronto-parietal network was more active in numerical inductive reasoning which requires more exchanges between intermediate representations and long-term declarative knowledge during rule identification. These results survived even after controlling for the covariates of response time and error rate. A computational cognitive model was developed using the cognitive architecture ACT-R to account for the behavioral results and brain activity in the fronto-parietal network. PMID:27193284

Activity in the fronto-parietal network indicates numerical inductive reasoning beyond calculation: An fMRI study combined with a cognitive model.

PubMed

Liang, Peipeng; Jia, Xiuqin; Taatgen, Niels A; Borst, Jelmer P; Li, Kuncheng

2016-05-19

Numerical inductive reasoning refers to the process of identifying and extrapolating the rule involved in numeric materials. It is associated with calculation, and shares the common activation of the fronto-parietal regions with calculation, which suggests that numerical inductive reasoning may correspond to a general calculation process. However, compared with calculation, rule identification is critical and unique to reasoning. Previous studies have established the central role of the fronto-parietal network for relational integration during rule identification in numerical inductive reasoning. The current question of interest is whether numerical inductive reasoning exclusively corresponds to calculation or operates beyond calculation, and whether it is possible to distinguish between them based on the activity pattern in the fronto-parietal network. To directly address this issue, three types of problems were created: numerical inductive reasoning, calculation, and perceptual judgment. Our results showed that the fronto-parietal network was more active in numerical inductive reasoning which requires more exchanges between intermediate representations and long-term declarative knowledge during rule identification. These results survived even after controlling for the covariates of response time and error rate. A computational cognitive model was developed using the cognitive architecture ACT-R to account for the behavioral results and brain activity in the fronto-parietal network.

A Methodology for Confirmatory Testing of Numerical Models of Groundwater Flow and Solute Transport in Fractured Crystalline Rock

NASA Astrophysics Data System (ADS)

Hartley, L.; Follin, S.; Rhen, I.; Selroos, J.

2008-12-01

Three-dimensional, regional, numerical models of groundwater flow and solute transport in fractured crystalline rock are used for two sites in Sweden that are considered for geological disposal of spent nuclear fuel. The models are used to underpin the conceptual modeling that is based on multi-disciplinary data and include descriptions of the geometry of geological features (deformation zones and fracture networks), transient hydrological and chemical boundary conditions, strong spatial heterogeneity in the hydraulic properties, density driven flow, solute transport including rock matrix diffusion, and mixing of different water types in a palaeo-hydrogeological perspective (last 10,000 years). From a credibility point of view, comparisons between measured and simulated data are important and provide a means to address our ability to understand complex hydrogeological systems, and hence what particular applications of a hydrogeological model of a physical system that are justified, e.g. in subsequent repository performance assessment studies. For instance, it has been suggested that an understanding of the hydrochemical evolution throughout geological time is a powerful tool to predict the future evolution of groundwater flow and its chemical composition. The general approach applied in the numerical modeling was to first parameterize the deformation zones and fracture networks hydraulically using fracture and inflow data from single-hole tests. Second, the confirmatory step relies on using essentially the same groundwater flow and solute transport model in terms of grid discretization and parameter settings for matching three types of independent field data: 1) large-scale cross-hole (interference) tests, 2) long-term monitoring of groundwater levels, and 3) hydrochemical composition of fracture water and matrix pore water in deep boreholes. We demonstrate here the modelling approach of the second step - confirmatory testing - using data from the site investigations undertaken at one of the sites in Sweden (Forsmark). Using the three types of data, a unified conceptual description of the groundwater system has been obtained. The integration of multi-disciplinary data and models in the confirmatory testing has provided a means to increase the level of confidence in the final site descriptive model. Specifically, discipline-specific data and models from hydrogeology (transmissivities, groundwater levels, hydraulic gradients), geology (genesis of structures, geometries), rock mechanics (principal stresses), hydrogeochemistry (fracture water and matrix pore water composition) and bedrock transport properties (flow wetted surface, advective residence time) have been utilized in the description of the groundwater system in the bedrock.

Measuring global monopole velocities, one by one

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

Lopez-Eiguren, Asier; Urrestilla, Jon; Achúcarro, Ana, E-mail: asier.lopez@ehu.eus, E-mail: jon.urrestilla@ehu.eus, E-mail: achucar@lorentz.leidenuniv.nl

We present an estimation of the average velocity of a network of global monopoles in a cosmological setting using large numerical simulations. In order to obtain the value of the velocity, we improve some already known methods, and present a new one. This new method estimates individual global monopole velocities in a network, by means of detecting each monopole position in the lattice and following the path described by each one of them. Using our new estimate we can settle an open question previously posed in the literature: velocity-dependent one-scale (VOS) models for global monopoles predict two branches of scalingmore » solutions, one with monopoles moving at subluminal speeds and one with monopoles moving at luminal speeds. Previous attempts to estimate monopole velocities had large uncertainties and were not able to settle that question. Our simulations find no evidence of a luminal branch. We also estimate the values of the parameters of the VOS model. With our new method we can also study the microphysics of the complicated dynamics of individual monopoles. Finally we use our large simulation volume to compare the results from the different estimator methods, as well as to asses the validity of the numerical approximations made.« less

Scale Invariance in Landscape Evolution Models Using Stream Power Laws

NASA Astrophysics Data System (ADS)

Kwang, J. S.; Parker, G.

2014-12-01

Landscape evolution models (LEM) commonly utilize stream power laws to simulate river incision with formulations such as E = KAmSn, where E is a vertical incision rate [L/T], K is an erodibility constant [L1-2m/T], A is an upstream drainage area [L2], S is a local channel gradient [-], and m and n are positive exponents that describe the basin hydrology. In our reduced complexity model, the landscape approached equilibrium by balancing an incision rate with a constant, uniform, vertical rock uplift rate at every location in the landscape. From our simulations, for a combination of m and n, the landscape exhibited scale invariance. That is, regardless of the size and scale of the basin, the relief and vertical structure of the landscape remained constant. Therefore, the relief and elevation profile of the landscape at equilibrium were only dependent on the coefficients for erodibility and uplift and an equation that described how upstream area, A, increased as the length of a stream increased. In our analytical 1D models, we utilized two equations that described upslope area, (a) A = Bl, where B is the profile width [L], and l is the stream length from the ridge [L] and (b) A = Clh, Hack's Law, where C is a constant [L2-h] and h is a positive exponent. With these equations, (a) m = n and (b) hm = n resulted in scale invariance. In our numerical 2D models, the relationship between A and l was inherent in the actual structure of the drainage network. From our numerical 2D results, scale invariance occurred when 2m = n. Additionally, using reasonable values from the literature for exponents, n, m and h, resulted in singularities at the ridges in the landscape, which caused truncation error. In consequence, the elevation of the ridge increased as the number of grid cells in the domain increased in the numerical model, and the model was unable to converge. These singularities at the ridges appeared when (a) m ≥ n and (b) hm ≥ n in the analytical model and 2m ≥ n in the numerical model. Here we present (1) 1D analytical solutions and (2) 2D numerical solutions that demonstrate scale invariance in LEMs and (3) the consequences of the singularity in 2D LEM numerical simulations. These results will help provide insight about the structure and dynamics of landscapes and drainage networks and shed light on geomorphological empirical relationships.

A stability analysis on forced convection boundary layer stagnation-point slip flow in Darcy-Forchheimer porous medium towards a shrinking sheet

NASA Astrophysics Data System (ADS)

Bakar, Shahirah Abu; Arifin, Norihan Md; Ali, Fadzilah Md; Bachok, Norfifah; Nazar, Roslinda

2017-08-01

The stagnation-point flow over a shrinking sheet in Darcy-Forchheimer porous medium is numerically studied. The governing partial differential equations are transformed into ordinary differential equations using a similarity transformation, and then solved numerically by using shooting technique method with Maple implementation. Dual solutions are observed in a certain range of the shrinking parameter. Regarding on numerical solutions, we prepared stability analysis to identify which solution is stable between non-unique solutions by bvp4c solver in Matlab. Further we obtain numerical results or each solution, which enable us to discuss the features of the respective solutions.

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

NASA Astrophysics Data System (ADS)

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

2013-12-01

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

A numerical solution for two-dimensional Fredholm integral equations of the second kind with kernels of the logarithmic potential form

NASA Technical Reports Server (NTRS)

Gabrielsen, R. E.; Uenal, A.

1981-01-01

Two dimensional Fredholm integral equations with logarithmic potential kernels are numerically solved. The explicit consequence of these solutions to their true solutions is demonstrated. The results are based on a previous work in which numerical solutions were obtained for Fredholm integral equations of the second kind with continuous kernels.

Theoretical Analysis of the Mechanism of Fracture Network Propagation with Stimulated Reservoir Volume (SRV) Fracturing in Tight Oil Reservoirs.

PubMed

Su, Yuliang; Ren, Long; Meng, Fankun; Xu, Chen; Wang, Wendong

2015-01-01

Stimulated reservoir volume (SRV) fracturing in tight oil reservoirs often induces complex fracture-network growth, which has a fundamentally different formation mechanism from traditional planar bi-winged fracturing. To reveal the mechanism of fracture network propagation, this paper employs a modified displacement discontinuity method (DDM), mechanical mechanism analysis and initiation and propagation criteria for the theoretical model of fracture network propagation and its derivation. A reasonable solution of the theoretical model for a tight oil reservoir is obtained and verified by a numerical discrete method. Through theoretical calculation and computer programming, the variation rules of formation stress fields, hydraulic fracture propagation patterns (FPP) and branch fracture propagation angles and pressures are analyzed. The results show that during the process of fracture propagation, the initial orientation of the principal stress deflects, and the stress fields at the fracture tips change dramatically in the region surrounding the fracture. Whether the ideal fracture network can be produced depends on the geological conditions and on the engineering treatments. This study has both theoretical significance and practical application value by contributing to a better understanding of fracture network propagation mechanisms in unconventional oil/gas reservoirs and to the improvement of the science and design efficiency of reservoir fracturing.

Mean-field approach to evolving spatial networks, with an application to osteocyte network formation

NASA Astrophysics Data System (ADS)

Taylor-King, Jake P.; Basanta, David; Chapman, S. Jonathan; Porter, Mason A.

2017-07-01

We consider evolving networks in which each node can have various associated properties (a state) in addition to those that arise from network structure. For example, each node can have a spatial location and a velocity, or it can have some more abstract internal property that describes something like a social trait. Edges between nodes are created and destroyed, and new nodes enter the system. We introduce a "local state degree distribution" (LSDD) as the degree distribution at a particular point in state space. We then make a mean-field assumption and thereby derive an integro-partial differential equation that is satisfied by the LSDD. We perform numerical experiments and find good agreement between solutions of the integro-differential equation and the LSDD from stochastic simulations of the full model. To illustrate our theory, we apply it to a simple model for osteocyte network formation within bones, with a view to understanding changes that may take place during cancer. Our results suggest that increased rates of differentiation lead to higher densities of osteocytes, but with a smaller number of dendrites. To help provide biological context, we also include an introduction to osteocytes, the formation of osteocyte networks, and the role of osteocytes in bone metastasis.

Theoretical Analysis of the Mechanism of Fracture Network Propagation with Stimulated Reservoir Volume (SRV) Fracturing in Tight Oil Reservoirs

PubMed Central

Su, Yuliang; Ren, Long; Meng, Fankun; Xu, Chen; Wang, Wendong

2015-01-01

Stimulated reservoir volume (SRV) fracturing in tight oil reservoirs often induces complex fracture-network growth, which has a fundamentally different formation mechanism from traditional planar bi-winged fracturing. To reveal the mechanism of fracture network propagation, this paper employs a modified displacement discontinuity method (DDM), mechanical mechanism analysis and initiation and propagation criteria for the theoretical model of fracture network propagation and its derivation. A reasonable solution of the theoretical model for a tight oil reservoir is obtained and verified by a numerical discrete method. Through theoretical calculation and computer programming, the variation rules of formation stress fields, hydraulic fracture propagation patterns (FPP) and branch fracture propagation angles and pressures are analyzed. The results show that during the process of fracture propagation, the initial orientation of the principal stress deflects, and the stress fields at the fracture tips change dramatically in the region surrounding the fracture. Whether the ideal fracture network can be produced depends on the geological conditions and on the engineering treatments. This study has both theoretical significance and practical application value by contributing to a better understanding of fracture network propagation mechanisms in unconventional oil/gas reservoirs and to the improvement of the science and design efficiency of reservoir fracturing. PMID:25966285

Hopf bifurcation of an (n + 1) -neuron bidirectional associative memory neural network model with delays.

PubMed

Xiao, Min; Zheng, Wei Xing; Cao, Jinde

2013-01-01

Recent studies on Hopf bifurcations of neural networks with delays are confined to simplified neural network models consisting of only two, three, four, five, or six neurons. It is well known that neural networks are complex and large-scale nonlinear dynamical systems, so the dynamics of the delayed neural networks are very rich and complicated. Although discussing the dynamics of networks with a few neurons may help us to understand large-scale networks, there are inevitably some complicated problems that may be overlooked if simplified networks are carried over to large-scale networks. In this paper, a general delayed bidirectional associative memory neural network model with n + 1 neurons is considered. By analyzing the associated characteristic equation, the local stability of the trivial steady state is examined, and then the existence of the Hopf bifurcation at the trivial steady state is established. By applying the normal form theory and the center manifold reduction, explicit formulae are derived to determine the direction and stability of the bifurcating periodic solution. Furthermore, the paper highlights situations where the Hopf bifurcations are particularly critical, in the sense that the amplitude and the period of oscillations are very sensitive to errors due to tolerances in the implementation of neuron interconnections. It is shown that the sensitivity is crucially dependent on the delay and also significantly influenced by the feature of the number of neurons. Numerical simulations are carried out to illustrate the main results.

An Analytical Framework for Studying Small-Number Effects in Catalytic Reaction Networks: A Probability Generating Function Approach to Chemical Master Equations

PubMed Central

Nakagawa, Masaki; Togashi, Yuichi

2016-01-01

Cell activities primarily depend on chemical reactions, especially those mediated by enzymes, and this has led to these activities being modeled as catalytic reaction networks. Although deterministic ordinary differential equations of concentrations (rate equations) have been widely used for modeling purposes in the field of systems biology, it has been pointed out that these catalytic reaction networks may behave in a way that is qualitatively different from such deterministic representation when the number of molecules for certain chemical species in the system is small. Apart from this, representing these phenomena by simple binary (on/off) systems that omit the quantities would also not be feasible. As recent experiments have revealed the existence of rare chemical species in cells, the importance of being able to model potential small-number phenomena is being recognized. However, most preceding studies were based on numerical simulations, and theoretical frameworks to analyze these phenomena have not been sufficiently developed. Motivated by the small-number issue, this work aimed to develop an analytical framework for the chemical master equation describing the distributional behavior of catalytic reaction networks. For simplicity, we considered networks consisting of two-body catalytic reactions. We used the probability generating function method to obtain the steady-state solutions of the chemical master equation without specifying the parameters. We obtained the time evolution equations of the first- and second-order moments of concentrations, and the steady-state analytical solution of the chemical master equation under certain conditions. These results led to the rank conservation law, the connecting state to the winner-takes-all state, and analysis of 2-molecules M-species systems. A possible interpretation of the theoretical conclusion for actual biochemical pathways is also discussed. PMID:27047384

Identifing Atmospheric Pollutant Sources Using Artificial Neural Networks

NASA Astrophysics Data System (ADS)

Paes, F. F.; Campos, H. F.; Luz, E. P.; Carvalho, A. R.

2008-05-01

The estimation of the area source pollutant strength is a relevant issue for atmospheric environment. This characterizes an inverse problem in the atmospheric pollution dispersion. In the inverse analysis, an area source domain is considered, where the strength of such area source term is assumed unknown. The inverse problem is solved by using a supervised artificial neural network: multi-layer perceptron. The conection weights of the neural network are computed from delta rule - learning process. The neural network inversion is compared with results from standard inverse analysis (regularized inverse solution). In the regularization method, the inverse problem is formulated as a non-linear optimization approach, whose the objective function is given by the square difference between the measured pollutant concentration and the mathematical models, associated with a regularization operator. In our numerical experiments, the forward problem is addressed by a source-receptor scheme, where a regressive Lagrangian model is applied to compute the transition matrix. The second order maximum entropy regularization is used, and the regularization parameter is calculated by the L-curve technique. The objective function is minimized employing a deterministic scheme (a quasi-Newton algorithm) [1] and a stochastic technique (PSO: particle swarm optimization) [2]. The inverse problem methodology is tested with synthetic observational data, from six measurement points in the physical domain. The best inverse solutions were obtained with neural networks. References: [1] D. R. Roberti, D. Anfossi, H. F. Campos Velho, G. A. Degrazia (2005): Estimating Emission Rate and Pollutant Source Location, Ciencia e Natura, p. 131-134. [2] E.F.P. da Luz, H.F. de Campos Velho, J.C. Becceneri, D.R. Roberti (2007): Estimating Atmospheric Area Source Strength Through Particle Swarm Optimization. Inverse Problems, Desing and Optimization Symposium IPDO-2007, April 16-18, Miami (FL), USA, vol 1, p. 354-359.

Behavior of ectopic surface: effects of β-adrenergic stimulation and uncoupling

PubMed Central

Arutunyan, Ara; Pumir, Alain; Krinsky, Valentin; Swift, Luther; Sarvazyan, Narine

2011-01-01

By using both experimental and theoretical means, we have addressed the progression of ectopic activity from individual cardiac cells to a multicellular two-dimensional network. Experimental conditions that favor ectopic activity have been created by local perfusion of a small area of cardiomyocyte network (I-zone) with an isoproterenol-heptanol containing solution. The application of this solution initially slowed down and then fully blocked wave propagation inside the I-zone. After a brief lag period, ectopically active cells appeared in the I-zone, followed by evolution of the ectopic clusters into slowly propagating waves. The changing pattern of colliding and expanding ectopic waves confined to the I-zone persisted for as long as the isoproterenol-heptanol environment was present. On restoration of the control environment, the ectopic waves from the I-zone broke out into the surrounding network causing arrhythmias. The observed sequence of events was also modeled by FitzHugh-Nagumo equations and included a cell’s arrangement of two adjacent square regions of 20 × 20 cells. The control zone consisted of well-connected, excitable cells, and the I-zone was made of weakly coupled cells (heptanol effect), which became spontaneously active as time evolved (isoproterenol effect). The dynamic events in the system have been studied numerically with the use of a finite difference method. Together, our experimental and computational data have revealed that the combination of low coupling, increased excitability, and spatial heterogeneity can lead to the development of ectopic waves confined to the injured network. This transient condition appears to serve as an essential step for the ectopic activity to “mature” before escaping into the surrounding control network. PMID:12893638

Behavior of ectopic surface: effects of beta-adrenergic stimulation and uncoupling.

PubMed

Arutunyan, Ara; Pumir, Alain; Krinsky, Valentin; Swift, Luther; Sarvazyan, Narine

2003-12-01

By using both experimental and theoretical means, we have addressed the progression of ectopic activity from individual cardiac cells to a multicellular two-dimensional network. Experimental conditions that favor ectopic activity have been created by local perfusion of a small area of cardiomyocyte network (I-zone) with an isoproterenol-heptanol containing solution. The application of this solution initially slowed down and then fully blocked wave propagation inside the I-zone. After a brief lag period, ectopically active cells appeared in the I-zone, followed by evolution of the ectopic clusters into slowly propagating waves. The changing pattern of colliding and expanding ectopic waves confined to the I-zone persisted for as long as the isoproterenol-heptanol environment was present. On restoration of the control environment, the ectopic waves from the I-zone broke out into the surrounding network causing arrhythmias. The observed sequence of events was also modeled by FitzHugh-Nagumo equations and included a cell's arrangement of two adjacent square regions of 20 x 20 cells. The control zone consisted of well-connected, excitable cells, and the I-zone was made of weakly coupled cells (heptanol effect), which became spontaneously active as time evolved (isoproterenol effect). The dynamic events in the system have been studied numerically with the use of a finite difference method. Together, our experimental and computational data have revealed that the combination of low coupling, increased excitability, and spatial heterogeneity can lead to the development of ectopic waves confined to the injured network. This transient condition appears to serve as an essential step for the ectopic activity to "mature" before escaping into the surrounding control network.

Reactive transport in fractured porous media

NASA Astrophysics Data System (ADS)

Adler, P.; Jasinski, L.; Thovert, J.-F.; Mourzenko, V. V.

2012-04-01

Reactive flow through geological formations occurs in many situations due to human intervention or during natural processes. For instance, chemical dissolution and precipitation play a major role in diagenesis or in the formation of karsts. The quantitative description of the injection of a reacting fluid from a well into a fractured porous medium is also a subject of high interest. It can be provoked, as in the acidization stimulation technique for increasing well productivity, or accidental, in CO2 sequestration. Ideally, one wishes to analyze the improvements or damages caused by the fluid to the well itself and to its immediate surroundings. To this end, a coupled system of equations has to be solved. It includes the description of the flow in the porous matrix and in the fracture network by Darcy-like equations, and the description of the reactive solute transport and of the reactions which occur in the two structures. In addition, constitutive equations are required for the evolution of these two structures, such as evolution laws for permeability and reactivity as functions of porosity. Our discrete fracture numerical model involves three major steps. First, an unstructured tetrahedral mesh of the fractures and of the porous matrix is built. Second, the Darcy equations are discretized and solved, in a finite volume formulation. Third, the evolution of the solute concentration has to be calculated. This is the most difficult point if one wants to avoid numerical diffusion and accurately describe the transfers between the fractures and the matrix. A non linear flux limiting scheme of the Superbee type coupled with a systematic use of triple control volumes proved to be the most efficient. Various simple model situations have been considered, for validation purposes or to illustrate some physical points. In particular, it is shown that even when the matrix permeability is small and the flow is predominantly carried by the fracture network, convective exchanges still exist between the fractures and the matrix which can widely exceed diffusive ones and strongly affect the solute transport and its residence time distribution. Finally, simulations of passive and reactive solute transport have been performed in large samples containing percolating or non percolating fracture networks. Various parameters have been systematically investigated, including the transmissivity of the fractures, the flow regime characterized by Péclet numbers in the fractures and in the matrix, and the Damköhler numbers of the reaction process in the matrix and fractures. The passive transport behavior and the effect of the gradual clogging of the fractures and/or matrix pore space in the case of a precipitation process are analyzed.

Reactive flow in fractured porous media

NASA Astrophysics Data System (ADS)

Jasinski, L.; Thovert, J.; Mourzenko, V.; Adler, P. M.

2011-12-01

Reactive flow through geological formations occurs in many situations due to human intervention or during natural processes. For instance, chemical dissolution and precipitation play a major role in diagenesis or in the formation of karsts. The quantitative description of the injection of a reacting fluid from a well into a fractured porous medium is also a subject of high interest. It can be provoked, as in the acidization stimulation technique for increasing well productivity, or accidental, in CO2 sequestration. Ideally, one wishes to analyze the improvements or damages caused by the fluid to the well itself and to its immediate surroundings. To this end, a coupled system of equations has to be solved. It includes the description of the flow in the porous matrix and in the fracture network by Darcy-like equations, and the description of the reactive solute transport and of the reactions which occur in the two structures. In addition, constitutive equations are required for the evolution of these two structures, such as evolution laws for permeability and reactivity as functions of porosity. Our discrete fracture numerical model involves three major steps. First, an unstructured tetrahedral mesh of the fractures and of the porous matrix is built. Second, the Darcy equations are discretized and solved, in a finite volume formulation. Third, the evolution of the solute concentration has to be calculated. This is the most difficult point if one wants to avoid numerical diffusion and accurately describe the transfers between the fractures and the matrix. A non linear flux limiting scheme of the Superbee type coupled with a systematic use of triple control volumes proved to be the most efficient. Various simple model situations have been considered, for validation purposes or to illustrate some physical points. In particular, it is shown that even when the matrix permeability is small and the flow is predominantly carried by the fracture network, convective exchanges still exist between the fractures and the matrix which can widely exceed diffusive ones and strongly affect the solute transport and its residence time distribution. Finally, simulations of passive and reactive solute transport have been performed in large samples containing percolating or non percolating fracture networks. Various parameters have been systematically investigated, including the transmissivity of the fractures, the flow regime characterized by Péclet numbers in the fractures and in the matrix, and the Damköhler numbers of the reaction process in the matrix and fractures. The passive transport behavior and the effect of the gradual clogging of the fractures and/or matrix pore space in the case of a precipitation process are analyzed.

Emergency response networks for disaster monitoring and detection from space

NASA Astrophysics Data System (ADS)

Vladimirova, Tanya; Sweeting, Martin N.; Vitanov, Ivan; Vitanov, Valentin I.

2009-05-01

Numerous man-made and natural disasters have stricken mankind since the beginning of the new millennium. The scale and impact of such disasters often prevent the collection of sufficient data for an objective assessment and coordination of timely rescue and relief missions on the ground. As a potential solution to this problem, in recent years constellations of Earth observation small satellites and in particular micro-satellites (<100 kg) in low Earth orbit have emerged as an efficient platform for reliable disaster monitoring. The main task of the Earth observation satellites is to capture images of the Earth surface using various techniques. For a large number of applications the resulting delay between image capture and delivery is not acceptable, in particular for rapid response remote sensing aiming at disaster monitoring and detection. In such cases almost instantaneous data availability is a strict requirement to enable an assessment of the situation and instigate an adequate response. Examples include earthquakes, volcanic eruptions, flooding, forest fires and oil spills. The proposed solution to this issue are low-cost networked distributed satellite systems in low Earth orbit capable of connecting to terrestrial networks and geostationary Earth orbit spacecraft in real time. This paper discusses enabling technologies for rapid response disaster monitoring and detection from space such as very small satellite design, intersatellite communication, intelligent on-board processing, distributed computing and bio-inspired routing techniques.

Direct Solution of the Chemical Master Equation Using Quantized Tensor Trains

PubMed Central

Kazeev, Vladimir; Khammash, Mustafa; Nip, Michael; Schwab, Christoph

2014-01-01

The Chemical Master Equation (CME) is a cornerstone of stochastic analysis and simulation of models of biochemical reaction networks. Yet direct solutions of the CME have remained elusive. Although several approaches overcome the infinite dimensional nature of the CME through projections or other means, a common feature of proposed approaches is their susceptibility to the curse of dimensionality, i.e. the exponential growth in memory and computational requirements in the number of problem dimensions. We present a novel approach that has the potential to “lift” this curse of dimensionality. The approach is based on the use of the recently proposed Quantized Tensor Train (QTT) formatted numerical linear algebra for the low parametric, numerical representation of tensors. The QTT decomposition admits both, algorithms for basic tensor arithmetics with complexity scaling linearly in the dimension (number of species) and sub-linearly in the mode size (maximum copy number), and a numerical tensor rounding procedure which is stable and quasi-optimal. We show how the CME can be represented in QTT format, then use the exponentially-converging -discontinuous Galerkin discretization in time to reduce the CME evolution problem to a set of QTT-structured linear equations to be solved at each time step using an algorithm based on Density Matrix Renormalization Group (DMRG) methods from quantum chemistry. Our method automatically adapts the “basis” of the solution at every time step guaranteeing that it is large enough to capture the dynamics of interest but no larger than necessary, as this would increase the computational complexity. Our approach is demonstrated by applying it to three different examples from systems biology: independent birth-death process, an example of enzymatic futile cycle, and a stochastic switch model. The numerical results on these examples demonstrate that the proposed QTT method achieves dramatic speedups and several orders of magnitude storage savings over direct approaches. PMID:24626049

Optimal Power Control in Wireless Powered Sensor Networks: A Dynamic Game-Based Approach

PubMed Central

Xu, Haitao; Guo, Chao; Zhang, Long

2017-01-01

In wireless powered sensor networks (WPSN), it is essential to research uplink transmit power control in order to achieve throughput performance balancing and energy scheduling. Each sensor should have an optimal transmit power level for revenue maximization. In this paper, we discuss a dynamic game-based algorithm for optimal power control in WPSN. The main idea is to use the non-cooperative differential game to control the uplink transmit power of wireless sensors in WPSN, to extend their working hours and to meet QoS (Quality of Services) requirements. Subsequently, the Nash equilibrium solutions are obtained through Bellman dynamic programming. At the same time, an uplink power control algorithm is proposed in a distributed manner. Through numerical simulations, we demonstrate that our algorithm can obtain optimal power control and reach convergence for an infinite horizon. PMID:28282945

Stochastic exponential synchronization of memristive neural networks with time-varying delays via quantized control.

PubMed

Zhang, Wanli; Yang, Shiju; Li, Chuandong; Zhang, Wei; Yang, Xinsong

2018-08-01

This paper focuses on stochastic exponential synchronization of delayed memristive neural networks (MNNs) by the aid of systems with interval parameters which are established by using the concept of Filippov solution. New intermittent controller and adaptive controller with logarithmic quantization are structured to deal with the difficulties induced by time-varying delays, interval parameters as well as stochastic perturbations, simultaneously. Moreover, not only control cost can be reduced but also communication channels and bandwidth are saved by using these controllers. Based on novel Lyapunov functions and new analytical methods, several synchronization criteria are established to realize the exponential synchronization of MNNs with stochastic perturbations via intermittent control and adaptive control with or without logarithmic quantization. Finally, numerical simulations are offered to substantiate our theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

H∞ state estimation for discrete-time memristive recurrent neural networks with stochastic time-delays

NASA Astrophysics Data System (ADS)

Liu, Hongjian; Wang, Zidong; Shen, Bo; Alsaadi, Fuad E.

2016-07-01

This paper deals with the robust H∞ state estimation problem for a class of memristive recurrent neural networks with stochastic time-delays. The stochastic time-delays under consideration are governed by a Bernoulli-distributed stochastic sequence. The purpose of the addressed problem is to design the robust state estimator such that the dynamics of the estimation error is exponentially stable in the mean square, and the prescribed ? performance constraint is met. By utilizing the difference inclusion theory and choosing a proper Lyapunov-Krasovskii functional, the existence condition of the desired estimator is derived. Based on it, the explicit expression of the estimator gain is given in terms of the solution to a linear matrix inequality. Finally, a numerical example is employed to demonstrate the effectiveness and applicability of the proposed estimation approach.

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.

Bluetooth Low Energy Mesh Networks: A Survey.

PubMed

Darroudi, Seyed Mahdi; Gomez, Carles

2017-06-22

Bluetooth Low Energy (BLE) has gained significant momentum. However, the original design of BLE focused on star topology networking, which limits network coverage range and precludes end-to-end path diversity. In contrast, other competing technologies overcome such constraints by supporting the mesh network topology. For these reasons, academia, industry, and standards development organizations have been designing solutions to enable BLE mesh networks. Nevertheless, the literature lacks a consolidated view on this emerging area. This paper comprehensively surveys state of the art BLE mesh networking. We first provide a taxonomy of BLE mesh network solutions. We then review the solutions, describing the variety of approaches that leverage existing BLE functionality to enable BLE mesh networks. We identify crucial aspects of BLE mesh network solutions and discuss their advantages and drawbacks. Finally, we highlight currently open issues.

Adaptive neuro-heuristic hybrid model for fruit peel defects detection.

PubMed

Woźniak, Marcin; Połap, Dawid

2018-02-01

Fusion of machine learning methods benefits in decision support systems. A composition of approaches gives a possibility to use the most efficient features composed into one solution. In this article we would like to present an approach to the development of adaptive method based on fusion of proposed novel neural architecture and heuristic search into one co-working solution. We propose a developed neural network architecture that adapts to processed input co-working with heuristic method used to precisely detect areas of interest. Input images are first decomposed into segments. This is to make processing easier, since in smaller images (decomposed segments) developed Adaptive Artificial Neural Network (AANN) processes less information what makes numerical calculations more precise. For each segment a descriptor vector is composed to be presented to the proposed AANN architecture. Evaluation is run adaptively, where the developed AANN adapts to inputs and their features by composed architecture. After evaluation, selected segments are forwarded to heuristic search, which detects areas of interest. As a result the system returns the image with pixels located over peel damages. Presented experimental research results on the developed solution are discussed and compared with other commonly used methods to validate the efficacy and the impact of the proposed fusion in the system structure and training process on classification results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Two dimensional modelling of flood flows and suspended sediment transport: the case of Brenta River

NASA Astrophysics Data System (ADS)

D'Alpaos, L.; Martini, P.; Carniello, L.

2003-04-01

The paper deals with numerical modelling of flood waves and suspended sediment in plain river basins. The two dimensional depth integrated momentum and continuity equations, modified to take into account of the bottom irregularities that strongly affect the hydrodynamic and the continuity in partially dry areas (for example, during the first stages of a plain flooding and in tidal flows), are solved with a standard Galerkin finite element method using a semi-implicit numerical scheme and considering the role both of the small channel network and the regulation dispositive on the flooding wave propagation. Transport of suspended sediment and bed evolution are coupled with the flood propagation through the convection-dispersion equation and the Exner's equation. Results of a real case study are presented in which the effects of extreme flood of Brenta River (Italy) are examinated. The flooded areas (urban and rural areas) are identified and a mitigation solution based on a diversion channel flowing into Venice Lagoon is proposed. We show that this solution strongly reduces the flood risk in the downstream areas and can provide an important sediment source to the Venice Lagoon. Finally, preliminary results of the sediment dispersion in the Venice Lagoon are presented.

The dynamics of a forced coupled network of active elements

NASA Astrophysics Data System (ADS)

Parks, Helen F.; Ermentrout, Bard; Rubin, Jonathan E.

2011-03-01

This paper presents the derivation and analysis of mathematical models motivated by the experimental induction of contour phosphenes in the retina. First, a spatially discrete chain of periodically forced coupled oscillators is considered via reduction to a chain of scalar phase equations. Each isolated oscillator locks in a 1:2 manner with the forcing so that there is intrinsic bistability, with activity peaking on either the odd or even cycles of the forcing. If half the chain is started on the odd cycle and half on the even cycle (“split state”), then with sufficiently strong coupling, a wave can be produced that can travel in either direction due to symmetry. Numerical and analytic methods are employed to determine the size of coupling necessary for the split state solution to destabilize such that waves appear. Taking a continuum limit, we reduce the chain to a partial differential equation. We use a Melnikov function to compute, to leading order, the speed of the traveling wave solution to the partial differential equation as a function of the form of coupling and the forcing parameters and compare our result to the numerically computed discrete and continuum wave speeds.

Numerical analysis of the asymptotic two-point boundary value solution for N-body trajectories.

NASA Technical Reports Server (NTRS)

Lancaster, J. E.; Allemann, R. A.

1972-01-01

Previously published asymptotic solutions for lunar and interplanetary trajectories have been modified and combined to formulate a general analytical boundary value solution applicable to a broad class of trajectory problems. In addition, the earlier first-order solutions have been extended to second-order to determine if improved accuracy is possible. Comparisons between the asymptotic solution and numerical integration for several lunar and interplanetary trajectories show that the asymptotic solution is generally quite accurate. Also, since no iterations are required, a solution to the boundary value problem is obtained in a fraction of the time required for numerically integrated solutions.

Development of closed-loop supply chain network in terms of corporate social responsibility.

PubMed

Pedram, Ali; Pedram, Payam; Yusoff, Nukman Bin; Sorooshian, Shahryar

2017-01-01

Due to the rise in awareness of environmental issues and the depletion of virgin resources, many firms have attempted to increase the sustainability of their activities. One efficient way to elevate sustainability is the consideration of corporate social responsibility (CSR) by designing a closed loop supply chain (CLSC). This paper has developed a mathematical model to increase corporate social responsibility in terms of job creation. Moreover the model, in addition to increasing total CLSC profit, provides a range of strategic decision solutions for decision makers to select a best action plan for a CLSC. A proposed multi-objective mixed-integer linear programming (MILP) model was solved with non-dominated sorting genetic algorithm II (NSGA-II). Fuzzy set theory was employed to select the best compromise solution from the Pareto-optimal solutions. A numerical example was used to validate the potential application of the proposed model. The results highlight the effect of CSR in the design of CLSC.

Development of closed–loop supply chain network in terms of corporate social responsibility

PubMed Central

Pedram, Payam; Yusoff, Nukman Bin; Sorooshian, Shahryar

2017-01-01

Due to the rise in awareness of environmental issues and the depletion of virgin resources, many firms have attempted to increase the sustainability of their activities. One efficient way to elevate sustainability is the consideration of corporate social responsibility (CSR) by designing a closed loop supply chain (CLSC). This paper has developed a mathematical model to increase corporate social responsibility in terms of job creation. Moreover the model, in addition to increasing total CLSC profit, provides a range of strategic decision solutions for decision makers to select a best action plan for a CLSC. A proposed multi-objective mixed-integer linear programming (MILP) model was solved with non-dominated sorting genetic algorithm II (NSGA-II). Fuzzy set theory was employed to select the best compromise solution from the Pareto-optimal solutions. A numerical example was used to validate the potential application of the proposed model. The results highlight the effect of CSR in the design of CLSC. PMID:28384250

A numerical method for solving systems of linear ordinary differential equations with rapidly oscillating solutions

NASA Technical Reports Server (NTRS)

Bernstein, Ira B.; Brookshaw, Leigh; Fox, Peter A.

1992-01-01

The present numerical method for accurate and efficient solution of systems of linear equations proceeds by numerically developing a set of basis solutions characterized by slowly varying dependent variables. The solutions thus obtained are shown to have a computational overhead largely independent of the small size of the scale length which characterizes the solutions; in many cases, the technique obviates series solutions near singular points, and its known sources of error can be easily controlled without a substantial increase in computational time.

Validation of the SINDA/FLUINT code using several analytical solutions

NASA Technical Reports Server (NTRS)

Keller, John R.

1995-01-01

The Systems Improved Numerical Differencing Analyzer and Fluid Integrator (SINDA/FLUINT) code has often been used to determine the transient and steady-state response of various thermal and fluid flow networks. While this code is an often used design and analysis tool, the validation of this program has been limited to a few simple studies. For the current study, the SINDA/FLUINT code was compared to four different analytical solutions. The thermal analyzer portion of the code (conduction and radiative heat transfer, SINDA portion) was first compared to two separate solutions. The first comparison examined a semi-infinite slab with a periodic surface temperature boundary condition. Next, a small, uniform temperature object (lumped capacitance) was allowed to radiate to a fixed temperature sink. The fluid portion of the code (FLUINT) was also compared to two different analytical solutions. The first study examined a tank filling process by an ideal gas in which there is both control volume work and heat transfer. The final comparison considered the flow in a pipe joining two infinite reservoirs of pressure. The results of all these studies showed that for the situations examined here, the SINDA/FLUINT code was able to match the results of the analytical solutions.

Information System Engineering Supporting Observation, Orientation, Decision, and Compliant Action

NASA Astrophysics Data System (ADS)

Georgakopoulos, Dimitrios

The majority of today's software systems and organizational/business structures have been built on the foundation of solving problems via long-term data collection, analysis, and solution design. This traditional approach of solving problems and building corresponding software systems and business processes, falls short in providing the necessary solutions needed to deal with many problems that require agility as the main ingredient of their solution. For example, such agility is needed in responding to an emergency, in military command control, physical security, price-based competition in business, investing in the stock market, video gaming, network monitoring and self-healing, diagnosis in emergency health care, and many other areas that are too numerous to list here. The concept of Observe, Orient, Decide, and Act (OODA) loops is a guiding principal that captures the fundamental issues and approach for engineering information systems that deal with many of these problem areas. However, there are currently few software systems that are capable of supporting OODA. In this talk, we provide a tour of the research issues and state of the art solutions for supporting OODA. In addition, we provide specific examples of OODA solutions we have developed for the video surveillance and emergency response domains.

Identification of the connections in biologically inspired neural networks

NASA Technical Reports Server (NTRS)

Demuth, H.; Leung, K.; Beale, M.; Hicklin, J.

1990-01-01

We developed an identification method to find the strength of the connections between neurons from their behavior in small biologically-inspired artificial neural networks. That is, given the network external inputs and the temporal firing pattern of the neurons, we can calculate a solution for the strengths of the connections between neurons and the initial neuron activations if a solution exists. The method determines directly if there is a solution to a particular neural network problem. No training of the network is required. It should be noted that this is a first pass at the solution of a difficult problem. The neuron and network models chosen are related to biology but do not contain all of its complexities, some of which we hope to add to the model in future work. A variety of new results have been obtained. First, the method has been tailored to produce connection weight matrix solutions for networks with important features of biological neural (bioneural) networks. Second, a computationally efficient method of finding a robust central solution has been developed. This later method also enables us to find the most consistent solution in the presence of noisy data. Prospects of applying our method to identify bioneural network connections are exciting because such connections are almost impossible to measure in the laboratory. Knowledge of such connections would facilitate an understanding of bioneural networks and would allow the construction of the electronic counterparts of bioneural networks on very large scale integrated (VLSI) circuits.

On the Hosoya index of a family of deterministic recursive trees

NASA Astrophysics Data System (ADS)

Chen, Xufeng; Zhang, Jingyuan; Sun, Weigang

2017-01-01

In this paper, we calculate the Hosoya index in a family of deterministic recursive trees with a special feature that includes new nodes which are connected to existing nodes with a certain rule. We then obtain a recursive solution of the Hosoya index based on the operations of a determinant. The computational complexity of our proposed algorithm is O(log2 n) with n being the network size, which is lower than that of the existing numerical methods. Finally, we give a weighted tree shrinking method as a graphical interpretation of the recurrence formula for the Hosoya index.

Bistatic passive radar simulator with spatial filtering subsystem

NASA Astrophysics Data System (ADS)

Hossa, Robert; Szlachetko, Boguslaw; Lewandowski, Andrzej; Górski, Maksymilian

2009-06-01

The purpose of this paper is to briefly introduce the structure and features of the developed virtual passive FM radar implemented in Matlab system of numerical computations and to present many alternative ways of its performance. An idea of the proposed solution is based on analytic representation of transmitted direct signals and reflected echo signals. As a spatial filtering subsystem a beamforming network of ULA and UCA dipole configuration dedicated to bistatic radar concept is considered and computationally efficient procedures are presented in details. Finally, exemplary results of the computer simulations of the elaborated virtual simulator are provided and discussed.

An Algebraic Approach to Guarantee Harmonic Balance Method Using Gröbner Base

NASA Astrophysics Data System (ADS)

Yagi, Masakazu; Hisakado, Takashi; Okumura, Kohshi

Harmonic balance (HB) method is well known principle for analyzing periodic oscillations on nonlinear networks and systems. Because the HB method has a truncation error, approximated solutions have been guaranteed by error bounds. However, its numerical computation is very time-consuming compared with solving the HB equation. This paper proposes an algebraic representation of the error bound using Gröbner base. The algebraic representation enables to decrease the computational cost of the error bound considerably. Moreover, using singular points of the algebraic representation, we can obtain accurate break points of the error bound by collisions.

Micro-structural evolution and biomineralization behavior of carbon nanofiber/bioactive glass composites induced by precursor aging time.

PubMed

Jia, Xiaolong; Tang, Tianhong; Cheng, Dan; Zhang, Cuihua; Zhang, Ran; Cai, Qing; Yang, Xiaoping

2015-12-01

Bioactive glass (BG)-containing carbon nanofibers (CNFs) are promising orthopaedic biomaterials. Herein, CNF composites were produced from electrospinning of polyacrylonitrile (PAN)/BG sol-gel precursor solution, followed by carbonization. Choosing 58S-type BG (mol%: 58.0% SiO2-26.3% CaO-15.7% P2O5) as the model, micro-structural evolution of CNF/BG composites was systematically evaluated in relating to aging times of BG precursor solution. With aging time prolonging, BG precursors underwent morphological changes from small sol clusters with loosely and randomly branched structure to highly crosslinked Si-network structure, showing continuous increase in solution viscosity. BG precursor solution with low viscosity could mix well with PAN solution, resulting in CNF composite with homogeneously distributed BG component. Whereas, BG precursor gel with densely crosslinked Si-network structure led to uneven distribution of BG component along final CNFs due to its significant phase separation from PAN component. Meanwhile, BG nanoparticles in CNFs demonstrated micro-structural evolution that they transited from weak to strong crystal state along with longer aging time. Biomineralization in simulated body fluid and in vitro osteoblasts proliferation were then applied to determine the bioactivity of CNF/BG composites. CNF/BG composites prepared from shorter aging time could induce both faster apatite deposition and cell proliferation rate. It was suggested weakly crystallized BG nanoparticles along CNFs dissolved fast and was able to provide numerous nucleation sites for apatite deposition, which also favored the proliferation of osteoblasts cells. Aging time could thus be a useful tool to regulate the biological features of CNF/BG composites. Copyright © 2015 Elsevier B.V. All rights reserved.

Numerical simulations to the nonlinear model of interpersonal relationships with time fractional derivative

NASA Astrophysics Data System (ADS)

Gencoglu, Muharrem Tuncay; Baskonus, Haci Mehmet; Bulut, Hasan

2017-01-01

The main aim of this manuscript is to obtain numerical solutions for the nonlinear model of interpersonal relationships with time fractional derivative. The variational iteration method is theoretically implemented and numerically conducted only to yield the desired solutions. Numerical simulations of desired solutions are plotted by using Wolfram Mathematica 9. The authors would like to thank the reviewers for their comments that help improve the manuscript.

Bluetooth Low Energy Mesh Networks: A Survey

PubMed Central

Darroudi, Seyed Mahdi; Gomez, Carles

2017-01-01

Bluetooth Low Energy (BLE) has gained significant momentum. However, the original design of BLE focused on star topology networking, which limits network coverage range and precludes end-to-end path diversity. In contrast, other competing technologies overcome such constraints by supporting the mesh network topology. For these reasons, academia, industry, and standards development organizations have been designing solutions to enable BLE mesh networks. Nevertheless, the literature lacks a consolidated view on this emerging area. This paper comprehensively surveys state of the art BLE mesh networking. We first provide a taxonomy of BLE mesh network solutions. We then review the solutions, describing the variety of approaches that leverage existing BLE functionality to enable BLE mesh networks. We identify crucial aspects of BLE mesh network solutions and discuss their advantages and drawbacks. Finally, we highlight currently open issues. PMID:28640183

The Soft Rock Socketed Monopile with Creep Effects - A Reliability Approach based on Wavelet Neural Networks

NASA Astrophysics Data System (ADS)

Kozubal, Janusz; Tomanovic, Zvonko; Zivaljevic, Slobodan

2016-09-01

In the present study the numerical model of the pile embedded in marl described by a time dependent model, based on laboratory tests, is proposed. The solutions complement the state of knowledge of the monopile loaded by horizontal force in its head with respect to its random variability values in time function. The investigated reliability problem is defined by the union of failure events defined by the excessive horizontal maximal displacement of the pile head in each periods of loads. Abaqus has been used for modeling of the presented task with a two layered viscoplastic model for marl. The mechanical parameters for both parts of model: plastic and rheological were calibrated based on the creep laboratory test results. The important aspect of the problem is reliability analysis of a monopile in complex environment under random sequences of loads which help understanding the role of viscosity in nature of rock basis constructions. Due to the lack of analytical solutions the computations were done by the method of response surface in conjunction with wavelet neural network as a method recommended for time sequences process and description of nonlinear phenomenon.

Variational Principles for Buckling of Microtubules Modeled as Nonlocal Orthotropic Shells

PubMed Central

2014-01-01

A variational principle for microtubules subject to a buckling load is derived by semi-inverse method. The microtubule is modeled as an orthotropic shell with the constitutive equations based on nonlocal elastic theory and the effect of filament network taken into account as an elastic surrounding. Microtubules can carry large compressive forces by virtue of the mechanical coupling between the microtubules and the surrounding elastic filament network. The equations governing the buckling of the microtubule are given by a system of three partial differential equations. The problem studied in the present work involves the derivation of the variational formulation for microtubule buckling. The Rayleigh quotient for the buckling load as well as the natural and geometric boundary conditions of the problem is obtained from this variational formulation. It is observed that the boundary conditions are coupled as a result of nonlocal formulation. It is noted that the analytic solution of the buckling problem for microtubules is usually a difficult task. The variational formulation of the problem provides the basis for a number of approximate and numerical methods of solutions and furthermore variational principles can provide physical insight into the problem. PMID:25214886

Constrained Bayesian Active Learning of Interference Channels in Cognitive Radio Networks

NASA Astrophysics Data System (ADS)

Tsakmalis, Anestis; Chatzinotas, Symeon; Ottersten, Bjorn

2018-02-01

In this paper, a sequential probing method for interference constraint learning is proposed to allow a centralized Cognitive Radio Network (CRN) accessing the frequency band of a Primary User (PU) in an underlay cognitive scenario with a designed PU protection specification. The main idea is that the CRN probes the PU and subsequently eavesdrops the reverse PU link to acquire the binary ACK/NACK packet. This feedback indicates whether the probing-induced interference is harmful or not and can be used to learn the PU interference constraint. The cognitive part of this sequential probing process is the selection of the power levels of the Secondary Users (SUs) which aims to learn the PU interference constraint with a minimum number of probing attempts while setting a limit on the number of harmful probing-induced interference events or equivalently of NACK packet observations over a time window. This constrained design problem is studied within the Active Learning (AL) framework and an optimal solution is derived and implemented with a sophisticated, accurate and fast Bayesian Learning method, the Expectation Propagation (EP). The performance of this solution is also demonstrated through numerical simulations and compared with modified versions of AL techniques we developed in earlier work.

An All-Optical Access Metro Interface for Hybrid WDM/TDM PON Based on OBS

NASA Astrophysics Data System (ADS)

Segarra, Josep; Sales, Vicent; Prat, Josep

2007-04-01

A new all-optical access metro network interface based on optical burst switching (OBS) is proposed. A hybrid wavelength-division multiplexing/time-division multiplexing (WDM/TDM) access architecture with reflective optical network units (ONUs), an arrayed-waveguide-grating outside plant, and a tunable laser stack at the optical line terminal (OLT) is presented as a solution for the passive optical network. By means of OBS and a dynamic bandwidth allocation (DBA) protocol, which polls the ONUs, the available access bandwidth is managed. All the network intelligence and costly equipment is located at the OLT, where the DBA module is centrally implemented, providing quality of service (QoS). To scale this access network, an optical cross connect (OXC) is then used to attain a large number of ONUs by the same OLT. The hybrid WDM/TDM structure is also extended toward the metropolitan area network (MAN) by introducing the concept of OBS multiplexer (OBS-M). The network element OBS-M bridges the MAN and access networks by offering all-optical cross connection, wavelength conversion, and data signaling. The proposed innovative OBS-M node yields a full optical data network, interfacing access and metro with a geographically distributed access control. The resulting novel access metro architectures are nonblocking and, with an improved signaling, provide QoS, scalability, and very low latency. Finally, numerical analysis and simulations demonstrate the traffic performance of the proposed access scheme and all-optical access metro interface and architectures.

The Complexity of Dynamics in Small Neural Circuits

PubMed Central

Panzeri, Stefano

2016-01-01

Mean-field approximations are a powerful tool for studying large neural networks. However, they do not describe well the behavior of networks composed of a small number of neurons. In this case, major differences between the mean-field approximation and the real behavior of the network can arise. Yet, many interesting problems in neuroscience involve the study of mesoscopic networks composed of a few tens of neurons. Nonetheless, mathematical methods that correctly describe networks of small size are still rare, and this prevents us to make progress in understanding neural dynamics at these intermediate scales. Here we develop a novel systematic analysis of the dynamics of arbitrarily small networks composed of homogeneous populations of excitatory and inhibitory firing-rate neurons. We study the local bifurcations of their neural activity with an approach that is largely analytically tractable, and we numerically determine the global bifurcations. We find that for strong inhibition these networks give rise to very complex dynamics, caused by the formation of multiple branching solutions of the neural dynamics equations that emerge through spontaneous symmetry-breaking. This qualitative change of the neural dynamics is a finite-size effect of the network, that reveals qualitative and previously unexplored differences between mesoscopic cortical circuits and their mean-field approximation. The most important consequence of spontaneous symmetry-breaking is the ability of mesoscopic networks to regulate their degree of functional heterogeneity, which is thought to help reducing the detrimental effect of noise correlations on cortical information processing. PMID:27494737

Ion aggregation in high salt solutions. III. Computational vibrational spectroscopy of HDO in aqueous salt solutions

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

Choi, Jun-Ho; Lim, Sohee; Chon, Bonghwan

The vibrational frequency, frequency fluctuation dynamics, and transition dipole moment of the O—D stretch mode of HDO molecule in aqueous solutions are strongly dependent on its local electrostatic environment and hydrogen-bond network structure. Therefore, the time-resolved vibrational spectroscopy the O—D stretch mode has been particularly used to investigate specific ion effects on water structure. Despite prolonged efforts to understand the interplay of O—D vibrational dynamics with local water hydrogen-bond network and ion aggregate structures in high salt solutions, still there exists a gap between theory and experiment due to a lack of quantitative model for accurately describing O—D stretch frequencymore » in high salt solutions. To fill this gap, we have performed numerical simulations of Raman scattering and IR absorption spectra of the O—D stretch mode of HDO in highly concentrated NaCl and KSCN solutions and compared them with experimental results. Carrying out extensive quantum chemistry calculations on not only water clusters but also ion-water clusters, we first developed a distributed vibrational solvatochromic charge model for the O—D stretch mode in aqueous salt solutions. Furthermore, the non-Condon effect on the vibrational transition dipole moment of the O—D stretch mode was fully taken into consideration with the charge response kernel that is non-local polarizability density. From the fluctuating O—D stretch mode frequencies and transition dipole vectors obtained from the molecular dynamics simulations, the O—D stretch Raman scattering and IR absorption spectra of HDO in salt solutions could be calculated. The polarization effect on the transition dipole vector of the O—D stretch mode is shown to be important and the asymmetric line shapes of the O—D stretch Raman scattering and IR absorption spectra of HDO especially in highly concentrated NaCl and KSCN solutions are in quantitative agreement with experimental results. We anticipate that this computational approach will be of critical use in interpreting linear and nonlinear vibrational spectroscopies of HDO molecule that is considered as an excellent local probe for monitoring local electrostatic and hydrogen-bonding environment in not just salt but also other confined and crowded solutions.« less

Theory of precipitation effects on dead cylindrical fuels

Treesearch

Michael A. Fosberg

1972-01-01

Numerical and analytical solutions of the Fickian diffusion equation were used to determine the effects of precipitation on dead cylindrical forest fuels. The analytical solution provided a physical framework. The numerical solutions were then used to refine the analytical solution through a similarity argument. The theoretical solutions predicted realistic rates of...

Determination of Dielectric Properties of Cryoprotective Agent Solutions with a Resonant Cavity for the Electromagnetic Rewarming in Cryopreservation.

PubMed

Pan, Jiaji; Shu, Zhiquan; Ren, Shen; Gao, Dayong

2017-10-01

In the rewarming process during cryopreservation, preventing ice recrystallization and thermal stress is important, especially for large tissues and organs. Uniform and rapid heating is essential in ameliorating the problem and maintaining the viability of cryopreserved biological samples. Currently, the most promising method is heating by application of electromagnetic (EM) waves, the effectiveness of which is dependent on the dielectric properties (DP) of the cryopreserved materials. In this work, the cavity perturbation method was adopted to measure the DP of cryoprotectant solutions. Based on the values of DP, the cryoprotectant solutions most amenable to EM heating can be identified. A system composed of a rectangular resonant cavity, a network analyzer, and a fiber optic temperature meter was implemented for the measurement. The DP of three cryoprotectant solutions during cooling to -80°C were measured and presented. The data can be used to optimize the rewarming process with the numerical method. The results show that a cryoprotectant solution consisting of 41% (w/v) dimethyl sulfoxide and 6% (w/v) polyvinylpyrrolidone has the highest dielectric loss for EM rewarming among the tested solutions. In addition, the developed DP measurement system could not only improve the EM heating in cryopreservation but also benefit hyperthermia or other therapies associated with EM waves.

Modeling reactive transport processes in fractured rock using the time domain random walk approach within a dual-porosity framework

NASA Astrophysics Data System (ADS)

Roubinet, D.; Russian, A.; Dentz, M.; Gouze, P.

2017-12-01

Characterizing and modeling hydrodynamic reactive transport in fractured rock are critical challenges for various research fields and applications including environmental remediation, geological storage, and energy production. To this end, we consider a recently developed time domain random walk (TDRW) approach, which is adapted to reproduce anomalous transport behaviors and capture heterogeneous structural and physical properties. This method is also very well suited to optimize numerical simulations by memory-shared massive parallelization and provide numerical results at various scales. So far, the TDRW approach has been applied for modeling advective-diffusive transport with mass transfer between mobile and immobile regions and simple (theoretical) reactions in heterogeneous porous media represented as single continuum domains. We extend this approach to dual-continuum representations considering a highly permeable fracture network embedded into a poorly permeable rock matrix with heterogeneous geochemical reactions occurring in both geological structures. The resulting numerical model enables us to extend the range of the modeled heterogeneity scales with an accurate representation of solute transport processes and no assumption on the Fickianity of these processes. The proposed model is compared to existing particle-based methods that are usually used to model reactive transport in fractured rocks assuming a homogeneous surrounding matrix, and is used to evaluate the impact of the matrix heterogeneity on the apparent reaction rates for different 2D and 3D simple-to-complex fracture network configurations.

Crank-Nicholson difference scheme for a stochastic parabolic equation with a dependent operator coefficient

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

Ashyralyev, Allaberen; Okur, Ulker

In the present paper, the Crank-Nicolson difference scheme for the numerical solution of the stochastic parabolic equation with the dependent operator coefficient is considered. Theorem on convergence estimates for the solution of this difference scheme is established. In applications, convergence estimates for the solution of difference schemes for the numerical solution of three mixed problems for parabolic equations are obtained. The numerical results are given.

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 Framework to Implement IoT Network Performance Modelling Techniques for Network Solution Selection †

PubMed Central

Delaney, Declan T.; O’Hare, Gregory M. P.

2016-01-01

No single network solution for Internet of Things (IoT) networks can provide the required level of Quality of Service (QoS) for all applications in all environments. This leads to an increasing number of solutions created to fit particular scenarios. Given the increasing number and complexity of solutions available, it becomes difficult for an application developer to choose the solution which is best suited for an application. This article introduces a framework which autonomously chooses the best solution for the application given the current deployed environment. The framework utilises a performance model to predict the expected performance of a particular solution in a given environment. The framework can then choose an apt solution for the application from a set of available solutions. This article presents the framework with a set of models built using data collected from simulation. The modelling technique can determine with up to 85% accuracy the solution which performs the best for a particular performance metric given a set of solutions. The article highlights the fractured and disjointed practice currently in place for examining and comparing communication solutions and aims to open a discussion on harmonising testing procedures so that different solutions can be directly compared and offers a framework to achieve this within IoT networks. PMID:27916929

A Framework to Implement IoT Network Performance Modelling Techniques for Network Solution Selection.

PubMed

Delaney, Declan T; O'Hare, Gregory M P

2016-12-01

No single network solution for Internet of Things (IoT) networks can provide the required level of Quality of Service (QoS) for all applications in all environments. This leads to an increasing number of solutions created to fit particular scenarios. Given the increasing number and complexity of solutions available, it becomes difficult for an application developer to choose the solution which is best suited for an application. This article introduces a framework which autonomously chooses the best solution for the application given the current deployed environment. The framework utilises a performance model to predict the expected performance of a particular solution in a given environment. The framework can then choose an apt solution for the application from a set of available solutions. This article presents the framework with a set of models built using data collected from simulation. The modelling technique can determine with up to 85% accuracy the solution which performs the best for a particular performance metric given a set of solutions. The article highlights the fractured and disjointed practice currently in place for examining and comparing communication solutions and aims to open a discussion on harmonising testing procedures so that different solutions can be directly compared and offers a framework to achieve this within IoT networks.

GPS IPW as a Meteorological Parameter and Climate Global Change Indicator

NASA Astrophysics Data System (ADS)

Kruczyk, M.; Liwosz, T.

2011-12-01

Paper focuses on comprehensive investigation of the GPS derived IPW (Integrated Precipitable Water, also IWV) as a geophysical tool. GPS meteorology is now widely acknowledged indirect method of atmosphere sensing. First we demonstrate GPS IPW quality. Most thorough inter-technique comparisons of directly measured IPW are attainable only for some observatories (note modest percentage of GPS stations equipped with meteorological devices). Nonetheless we have managed to compare IPW series derived from GPS tropospheric solutions (ZTD mostly from IGS and EPN solutions) and some independent techniques. IPW values from meteorological sources we used are: radiosoundings, sun photometer and input fields of numerical weather prediction model. We can treat operational NWP models as meteorological database within which we can calculate IWV for all GPS stations independently from network of direct measurements (COSMO-LM model maintained by Polish Institute of Meteorology and Water Management was tried). Sunphotometer (CIMEL-318, Central Geophysical Observatory IGF PAS, Belsk, Poland) data seems the most genuine source - so we decided for direct collocation of GPS measurements and sunphotometer placing permanent GPS receiver on the roof of Belsk Observatory. Next we analyse IPW as geophysical parameter: IPW demonstrates some physical effects evoked by station location (height and series correlation coefficient as a function of distance) and weather patterns like dominant wind directions (in case of neighbouring stations). Deficiency of surface humidity data to model IPW is presented for different climates. This inadequacy and poor humidity data representation in NWP model extremely encourages investigating information exchange potential between Numerical Model and GPS network. The second and most important aspect of this study concerns long series of IPW (daily averaged) which can serve as climatological information indicator (water vapour role in climate system is hard to exaggerate). Especially intriguing are relatively unique shape of such series in different climates. Long lasting changes in weather conditions: 'dry' and 'wet' years are also visible. The longer and more uniform our series are the better chance to estimate the magnitude of climatological IWV changes. Homogenous ZTD solution during long period is great concern in this approach (problems with GPS strategy and reference system changes). In case of continental network (EUREF Permanent Network) reliable data we get only after reprocessing. Simple sinusoidal model has been adjusted to the IPW series (LS method) for selected stations (mainly Europe but also other continents - IGS stations), every year separately. Not only amplitudes but also phases of annual signal differ from year to year. Longer IPW series (up to 14 years) searched for some climatological signal sometimes reveal weak steady trend. Large number of GPS permanent stations, relative easiness of IPW derivation (only and surface meteo data needed apart from GPS solution) and water vapour significance in water cycle and global climate make this GPS IPW promising element of global environmental change monitoring.

Synchronization of ;light-sensitive; Hindmarsh-Rose neurons

NASA Astrophysics Data System (ADS)

Castanedo-Guerra, Isaac; Steur, Erik; Nijmeijer, Henk

2018-04-01

The suprachiasmatic nucleus is a network of synchronized neurons whose electrical activity follows a 24 h cycle. The synchronization phenomenon (among these neurons) is not completely understood. In this work we study, via experiments and numerical simulations, the phenomenon in which the synchronization threshold changes under the influence of an external (bifurcation) parameter in coupled Hindmarsh-Rose neurons. This parameter ;shapes; the activity of the individual neurons the same way as some neurons in the brain react to light. We corroborate this experimental finding with numerical simulations by quantifying the amount of synchronization using Pearson's correlation coefficient. In order to address the local stability problem of the synchronous state, Floquet theory is applied in the case where the dynamic systems show continuous periodic solutions. These results show how the sufficient coupling strength for synchronization between these neurons is affected by an external cue (e.g. light).

Modeling and numerical simulations of growth and morphologies of three dimensional aggregated silver films

NASA Astrophysics Data System (ADS)

Davis, L. J.; Boggess, M.; Kodpuak, E.; Deutsch, M.

2012-11-01

We report on a model for the deposition of three dimensional, aggregated nanocrystalline silver films, and an efficient numerical simulation method developed for visualizing such structures. We compare our results to a model system comprising chemically deposited silver films with morphologies ranging from dilute, uniform distributions of nanoparticles to highly porous aggregated networks. Disordered silver films grown in solution on silica substrates are characterized using digital image analysis of high resolution scanning electron micrographs. While the latter technique provides little volume information, plane-projected (two dimensional) island structure and surface coverage may be reliably determined. Three parameters governing film growth are evaluated using these data and used as inputs for the deposition model, greatly reducing computing requirements while still providing direct access to the complete (bulk) structure of the films throughout the growth process. We also show how valuable three dimensional characteristics of the deposited materials can be extracted using the simulated structures.

Assessment of critical path analyses of the relationship between permeability and electrical conductivity of pore networks

NASA Astrophysics Data System (ADS)

Skaggs, Todd H.

2011-10-01

Critical path analysis (CPA) is a method for estimating macroscopic transport coefficients of heterogeneous materials that are highly disordered at the micro-scale. Developed originally to model conduction in semiconductors, numerous researchers have noted that CPA might also have relevance to flow and transport processes in porous media. However, the results of several numerical investigations of critical path analysis on pore network models raise questions about the applicability of CPA to porous media. Among other things, these studies found that (i) in well-connected 3D networks, CPA predictions were inaccurate and became worse when heterogeneity was increased; and (ii) CPA could not fully explain the transport properties of 2D networks. To better understand the applicability of CPA to porous media, we made numerical computations of permeability and electrical conductivity on 2D and 3D networks with differing pore-size distributions and geometries. A new CPA model for the relationship between the permeability and electrical conductivity was found to be in good agreement with numerical data, and to be a significant improvement over a classical CPA model. In sufficiently disordered 3D networks, the new CPA prediction was within ±20% of the true value, and was nearly optimal in terms of minimizing the squared prediction errors across differing network configurations. The agreement of CPA predictions with 2D network computations was similarly good, although 2D networks are in general not well-suited for evaluating CPA. Numerical transport coefficients derived for regular 3D networks of slit-shaped pores were found to be in better agreement with experimental data from rock samples than were coefficients derived for networks of cylindrical pores.

A numerical study of transient heat and mass transfer in crystal growth

NASA Technical Reports Server (NTRS)

Han, Samuel Bang-Moo

1987-01-01

A numerical analysis of transient heat and solute transport across a rectangular cavity is performed. Five nonlinear partial differential equations which govern the conservation of mass, momentum, energy and solute concentration related to crystal growth in solution, are simultaneously integrated by a numerical method based on the SIMPLE algorithm. Numerical results showed that the flow, temperature and solute fields are dependent on thermal and solutal Grashoff number, Prandtl number, Schmidt number and aspect ratio. The average Nusselt and Sherwood numbers evaluated at the center of the cavity decrease markedly when the solutal buoyancy force acts in the opposite direction to the thermal buoyancy force. When the solutal and thermal buoyancy forces act in the same direction, however, Sherwood number increases significantly and yet Nusselt number decreases. Overall effects of convection on the crystal growth are seen to be an enhancement of growth rate as expected but with highly nonuniform spatial growth variations.

Self-organization and solution of shortest-path optimization problems with memristive networks

NASA Astrophysics Data System (ADS)

Pershin, Yuriy V.; Di Ventra, Massimiliano

2013-07-01

We show that memristive networks, namely networks of resistors with memory, can efficiently solve shortest-path optimization problems. Indeed, the presence of memory (time nonlocality) promotes self organization of the network into the shortest possible path(s). We introduce a network entropy function to characterize the self-organized evolution, show the solution of the shortest-path problem and demonstrate the healing property of the solution path. Finally, we provide an algorithm to solve the traveling salesman problem. Similar considerations apply to networks of memcapacitors and meminductors, and networks with memory in various dimensions.

Stability analysis of Eulerian-Lagrangian methods for the one-dimensional shallow-water equations

USGS Publications Warehouse

Casulli, V.; Cheng, R.T.

1990-01-01

In this paper stability and error analyses are discussed for some finite difference methods when applied to the one-dimensional shallow-water equations. Two finite difference formulations, which are based on a combined Eulerian-Lagrangian approach, are discussed. In the first part of this paper the results of numerical analyses for an explicit Eulerian-Lagrangian method (ELM) have shown that the method is unconditionally stable. This method, which is a generalized fixed grid method of characteristics, covers the Courant-Isaacson-Rees method as a special case. Some artificial viscosity is introduced by this scheme. However, because the method is unconditionally stable, the artificial viscosity can be brought under control either by reducing the spatial increment or by increasing the size of time step. The second part of the paper discusses a class of semi-implicit finite difference methods for the one-dimensional shallow-water equations. This method, when the Eulerian-Lagrangian approach is used for the convective terms, is also unconditionally stable and highly accurate for small space increments or large time steps. The semi-implicit methods seem to be more computationally efficient than the explicit ELM; at each time step a single tridiagonal system of linear equations is solved. The combined explicit and implicit ELM is best used in formulating a solution strategy for solving a network of interconnected channels. The explicit ELM is used at channel junctions for each time step. The semi-implicit method is then applied to the interior points in each channel segment. Following this solution strategy, the channel network problem can be reduced to a set of independent one-dimensional open-channel flow problems. Numerical results support properties given by the stability and error analyses. ?? 1990.

Unconstrained handwritten numeral recognition based on radial basis competitive and cooperative networks with spatio-temporal feature representation.

PubMed

Lee, S; Pan, J J

1996-01-01

This paper presents a new approach to representation and recognition of handwritten numerals. The approach first transforms a two-dimensional (2-D) spatial representation of a numeral into a three-dimensional (3-D) spatio-temporal representation by identifying the tracing sequence based on a set of heuristic rules acting as transformation operators. A multiresolution critical-point segmentation method is then proposed to extract local feature points, at varying degrees of scale and coarseness. A new neural network architecture, referred to as radial-basis competitive and cooperative network (RCCN), is presented especially for handwritten numeral recognition. RCCN is a globally competitive and locally cooperative network with the capability of self-organizing hidden units to progressively achieve desired network performance, and functions as a universal approximator of arbitrary input-output mappings. Three types of RCCNs are explored: input-space RCCN (IRCCN), output-space RCCN (ORCCN), and bidirectional RCCN (BRCCN). Experiments against handwritten zip code numerals acquired by the U.S. Postal Service indicated that the proposed method is robust in terms of variations, deformations, transformations, and corruption, achieving about 97% recognition rate.

Clustered Numerical Data Analysis Using Markov Lie Monoid Based Networks

NASA Astrophysics Data System (ADS)

Johnson, Joseph

2016-03-01

We have designed and build an optimal numerical standardization algorithm that links numerical values with their associated units, error level, and defining metadata thus supporting automated data exchange and new levels of artificial intelligence (AI). The software manages all dimensional and error analysis and computational tracing. Tables of entities verses properties of these generalized numbers (called ``metanumbers'') support a transformation of each table into a network among the entities and another network among their properties where the network connection matrix is based upon a proximity metric between the two items. We previously proved that every network is isomorphic to the Lie algebra that generates continuous Markov transformations. We have also shown that the eigenvectors of these Markov matrices provide an agnostic clustering of the underlying patterns. We will present this methodology and show how our new work on conversion of scientific numerical data through this process can reveal underlying information clusters ordered by the eigenvalues. We will also show how the linking of clusters from different tables can be used to form a ``supernet'' of all numerical information supporting new initiatives in AI.

Synchrony-induced modes of oscillation of a neural field model

NASA Astrophysics Data System (ADS)

Esnaola-Acebes, Jose M.; Roxin, Alex; Avitabile, Daniele; Montbrió, Ernest

2017-11-01

We investigate the modes of oscillation of heterogeneous ring networks of quadratic integrate-and-fire (QIF) neurons with nonlocal, space-dependent coupling. Perturbations of the equilibrium state with a particular wave number produce transient standing waves with a specific temporal frequency, analogously to those in a tense string. In the neuronal network, the equilibrium corresponds to a spatially homogeneous, asynchronous state. Perturbations of this state excite the network's oscillatory modes, which reflect the interplay of episodes of synchronous spiking with the excitatory-inhibitory spatial interactions. In the thermodynamic limit, an exact low-dimensional neural field model describing the macroscopic dynamics of the network is derived. This allows us to obtain formulas for the Turing eigenvalues of the spatially homogeneous state and hence to obtain its stability boundary. We find that the frequency of each Turing mode depends on the corresponding Fourier coefficient of the synaptic pattern of connectivity. The decay rate instead is identical for all oscillation modes as a consequence of the heterogeneity-induced desynchronization of the neurons. Finally, we numerically compute the spectrum of spatially inhomogeneous solutions branching from the Turing bifurcation, showing that similar oscillatory modes operate in neural bump states and are maintained away from onset.

Synchrony-induced modes of oscillation of a neural field model.

PubMed

Esnaola-Acebes, Jose M; Roxin, Alex; Avitabile, Daniele; Montbrió, Ernest

2017-11-01

We investigate the modes of oscillation of heterogeneous ring networks of quadratic integrate-and-fire (QIF) neurons with nonlocal, space-dependent coupling. Perturbations of the equilibrium state with a particular wave number produce transient standing waves with a specific temporal frequency, analogously to those in a tense string. In the neuronal network, the equilibrium corresponds to a spatially homogeneous, asynchronous state. Perturbations of this state excite the network's oscillatory modes, which reflect the interplay of episodes of synchronous spiking with the excitatory-inhibitory spatial interactions. In the thermodynamic limit, an exact low-dimensional neural field model describing the macroscopic dynamics of the network is derived. This allows us to obtain formulas for the Turing eigenvalues of the spatially homogeneous state and hence to obtain its stability boundary. We find that the frequency of each Turing mode depends on the corresponding Fourier coefficient of the synaptic pattern of connectivity. The decay rate instead is identical for all oscillation modes as a consequence of the heterogeneity-induced desynchronization of the neurons. Finally, we numerically compute the spectrum of spatially inhomogeneous solutions branching from the Turing bifurcation, showing that similar oscillatory modes operate in neural bump states and are maintained away from onset.

The Influence of Synaptic Weight Distribution on Neuronal Population Dynamics

PubMed Central

Buice, Michael; Koch, Christof; Mihalas, Stefan

2013-01-01

The manner in which different distributions of synaptic weights onto cortical neurons shape their spiking activity remains open. To characterize a homogeneous neuronal population, we use the master equation for generalized leaky integrate-and-fire neurons with shot-noise synapses. We develop fast semi-analytic numerical methods to solve this equation for either current or conductance synapses, with and without synaptic depression. We show that its solutions match simulations of equivalent neuronal networks better than those of the Fokker-Planck equation and we compute bounds on the network response to non-instantaneous synapses. We apply these methods to study different synaptic weight distributions in feed-forward networks. We characterize the synaptic amplitude distributions using a set of measures, called tail weight numbers, designed to quantify the preponderance of very strong synapses. Even if synaptic amplitude distributions are equated for both the total current and average synaptic weight, distributions with sparse but strong synapses produce higher responses for small inputs, leading to a larger operating range. Furthermore, despite their small number, such synapses enable the network to respond faster and with more stability in the face of external fluctuations. PMID:24204219

Design of a universal two-layered neural network derived from the PLI theory

NASA Astrophysics Data System (ADS)

Hu, Chia-Lun J.

2004-05-01

The if-and-only-if (IFF) condition that a set of M analog-to-digital vector-mapping relations can be learned by a one-layered-feed-forward neural network (OLNN) is that all the input analog vectors dichotomized by the i-th output bit must be positively, linearly independent, or PLI. If they are not PLI, then the OLNN just cannot learn no matter what learning rules is employed because the solution of the connection matrix does not exist mathematically. However, in this case, one can still design a parallel-cascaded, two-layered, perceptron (PCTLP) to acheive this general mapping goal. The design principle of this "universal" neural network is derived from the major mathematical properties of the PLI theory - changing the output bits of the dependent relations existing among the dichotomized input vectors to make the PLD relations PLI. Then with a vector concatenation technique, the required mapping can still be learned by this PCTLP system with very high efficiency. This paper will report in detail the mathematical derivation of the general design principle and the design procedures of the PCTLP neural network system. It then will be verified in general by a practical numerical example.

Modelling the impact of liner shipping network perturbations on container cargo routing: Southeast Asia to Europe application.

PubMed

Achurra-Gonzalez, Pablo E; Novati, Matteo; Foulser-Piggott, Roxane; Graham, Daniel J; Bowman, Gary; Bell, Michael G H; Angeloudis, Panagiotis

2016-06-03

Understanding how container routing stands to be impacted by different scenarios of liner shipping network perturbations such as natural disasters or new major infrastructure developments is of key importance for decision-making in the liner shipping industry. The variety of actors and processes within modern supply chains and the complexity of their relationships have previously led to the development of simulation-based models, whose application has been largely compromised by their dependency on extensive and often confidential sets of data. This study proposes the application of optimisation techniques less dependent on complex data sets in order to develop a quantitative framework to assess the impacts of disruptive events on liner shipping networks. We provide a categorization of liner network perturbations, differentiating between systemic and external and formulate a container assignment model that minimises routing costs extending previous implementations to allow feasible solutions when routing capacity is reduced below transport demand. We develop a base case network for the Southeast Asia to Europe liner shipping trade and review of accidents related to port disruptions for two scenarios of seismic and political conflict hazards. Numerical results identify alternative routing paths and costs in the aftermath of port disruptions scenarios and suggest higher vulnerability of intra-regional connectivity. Copyright © 2016 Elsevier Ltd. All rights reserved.

A spiking neural network model of model-free reinforcement learning with high-dimensional sensory input and perceptual ambiguity.

PubMed

Nakano, Takashi; Otsuka, Makoto; Yoshimoto, Junichiro; Doya, Kenji

2015-01-01

A theoretical framework of reinforcement learning plays an important role in understanding action selection in animals. Spiking neural networks provide a theoretically grounded means to test computational hypotheses on neurally plausible algorithms of reinforcement learning through numerical simulation. However, most of these models cannot handle observations which are noisy, or occurred in the past, even though these are inevitable and constraining features of learning in real environments. This class of problem is formally known as partially observable reinforcement learning (PORL) problems. It provides a generalization of reinforcement learning to partially observable domains. In addition, observations in the real world tend to be rich and high-dimensional. In this work, we use a spiking neural network model to approximate the free energy of a restricted Boltzmann machine and apply it to the solution of PORL problems with high-dimensional observations. Our spiking network model solves maze tasks with perceptually ambiguous high-dimensional observations without knowledge of the true environment. An extended model with working memory also solves history-dependent tasks. The way spiking neural networks handle PORL problems may provide a glimpse into the underlying laws of neural information processing which can only be discovered through such a top-down approach.

A Spiking Neural Network Model of Model-Free Reinforcement Learning with High-Dimensional Sensory Input and Perceptual Ambiguity

PubMed Central

Nakano, Takashi; Otsuka, Makoto; Yoshimoto, Junichiro; Doya, Kenji

2015-01-01

A theoretical framework of reinforcement learning plays an important role in understanding action selection in animals. Spiking neural networks provide a theoretically grounded means to test computational hypotheses on neurally plausible algorithms of reinforcement learning through numerical simulation. However, most of these models cannot handle observations which are noisy, or occurred in the past, even though these are inevitable and constraining features of learning in real environments. This class of problem is formally known as partially observable reinforcement learning (PORL) problems. It provides a generalization of reinforcement learning to partially observable domains. In addition, observations in the real world tend to be rich and high-dimensional. In this work, we use a spiking neural network model to approximate the free energy of a restricted Boltzmann machine and apply it to the solution of PORL problems with high-dimensional observations. Our spiking network model solves maze tasks with perceptually ambiguous high-dimensional observations without knowledge of the true environment. An extended model with working memory also solves history-dependent tasks. The way spiking neural networks handle PORL problems may provide a glimpse into the underlying laws of neural information processing which can only be discovered through such a top-down approach. PMID:25734662

Minimum requirements for predictive pore-network modeling of solute transport in micromodels

NASA Astrophysics Data System (ADS)

Mehmani, Yashar; Tchelepi, Hamdi A.

2017-10-01

Pore-scale models are now an integral part of analyzing fluid dynamics in porous materials (e.g., rocks, soils, fuel cells). Pore network models (PNM) are particularly attractive due to their computational efficiency. However, quantitative predictions with PNM have not always been successful. We focus on single-phase transport of a passive tracer under advection-dominated regimes and compare PNM with high-fidelity direct numerical simulations (DNS) for a range of micromodel heterogeneities. We identify the minimum requirements for predictive PNM of transport. They are: (a) flow-based network extraction, i.e., discretizing the pore space based on the underlying velocity field, (b) a Lagrangian (particle tracking) simulation framework, and (c) accurate transfer of particles from one pore throat to the next. We develop novel network extraction and particle tracking PNM methods that meet these requirements. Moreover, we show that certain established PNM practices in the literature can result in first-order errors in modeling advection-dominated transport. They include: all Eulerian PNMs, networks extracted based on geometric metrics only, and flux-based nodal transfer probabilities. Preliminary results for a 3D sphere pack are also presented. The simulation inputs for this work are made public to serve as a benchmark for the research community.

A Networked Sensor System for the Analysis of Plot-Scale Hydrology.

PubMed

Villalba, German; Plaza, Fernando; Zhong, Xiaoyang; Davis, Tyler W; Navarro, Miguel; Li, Yimei; Slater, Thomas A; Liang, Yao; Liang, Xu

2017-03-20

This study presents the latest updates to the Audubon Society of Western Pennsylvania (ASWP) testbed, a $50,000 USD, 104-node outdoor multi-hop wireless sensor network (WSN). The network collects environmental data from over 240 sensors, including the EC-5, MPS-1 and MPS-2 soil moisture and soil water potential sensors and self-made sap flow sensors, across a heterogeneous deployment comprised of MICAz, IRIS and TelosB wireless motes. A low-cost sensor board and software driver was developed for communicating with the analog and digital sensors. Innovative techniques (e.g., balanced energy efficient routing and heterogeneous over-the-air mote reprogramming) maintained high success rates (>96%) and enabled effective software updating, throughout the large-scale heterogeneous WSN. The edaphic properties monitored by the network showed strong agreement with data logger measurements and were fitted to pedotransfer functions for estimating local soil hydraulic properties. Furthermore, sap flow measurements, scaled to tree stand transpiration, were found to be at or below potential evapotranspiration estimates. While outdoor WSNs still present numerous challenges, the ASWP testbed proves to be an effective and (relatively) low-cost environmental monitoring solution and represents a step towards developing a platform for monitoring and quantifying statistically relevant environmental parameters from large-scale network deployments.

A Networked Sensor System for the Analysis of Plot-Scale Hydrology

PubMed Central

Villalba, German; Plaza, Fernando; Zhong, Xiaoyang; Davis, Tyler W.; Navarro, Miguel; Li, Yimei; Slater, Thomas A.; Liang, Yao; Liang, Xu

2017-01-01

This study presents the latest updates to the Audubon Society of Western Pennsylvania (ASWP) testbed, a $50,000 USD, 104-node outdoor multi-hop wireless sensor network (WSN). The network collects environmental data from over 240 sensors, including the EC-5, MPS-1 and MPS-2 soil moisture and soil water potential sensors and self-made sap flow sensors, across a heterogeneous deployment comprised of MICAz, IRIS and TelosB wireless motes. A low-cost sensor board and software driver was developed for communicating with the analog and digital sensors. Innovative techniques (e.g., balanced energy efficient routing and heterogeneous over-the-air mote reprogramming) maintained high success rates (>96%) and enabled effective software updating, throughout the large-scale heterogeneous WSN. The edaphic properties monitored by the network showed strong agreement with data logger measurements and were fitted to pedotransfer functions for estimating local soil hydraulic properties. Furthermore, sap flow measurements, scaled to tree stand transpiration, were found to be at or below potential evapotranspiration estimates. While outdoor WSNs still present numerous challenges, the ASWP testbed proves to be an effective and (relatively) low-cost environmental monitoring solution and represents a step towards developing a platform for monitoring and quantifying statistically relevant environmental parameters from large-scale network deployments. PMID:28335534

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

NASA Astrophysics Data System (ADS)

Yelkhovsky, Alexander; Pinczewski, W. Val

2018-04-01

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

Hybrid discrete/continuum algorithms for stochastic reaction networks

DOE PAGES

Safta, Cosmin; Sargsyan, Khachik; Debusschere, Bert; ...

2014-10-22

Direct solutions of the Chemical Master Equation (CME) governing Stochastic Reaction Networks (SRNs) are generally prohibitively expensive due to excessive numbers of possible discrete states in such systems. To enhance computational efficiency we develop a hybrid approach where the evolution of states with low molecule counts is treated with the discrete CME model while that of states with large molecule counts is modeled by the continuum Fokker-Planck equation. The Fokker-Planck equation is discretized using a 2nd order finite volume approach with appropriate treatment of flux components to avoid negative probability values. The numerical construction at the interface between the discretemore » and continuum regions implements the transfer of probability reaction by reaction according to the stoichiometry of the system. As a result, the performance of this novel hybrid approach is explored for a two-species circadian model with computational efficiency gains of about one order of magnitude.« less

Rapid automated classification of anesthetic depth levels using GPU based parallelization of neural networks.

PubMed

Peker, Musa; Şen, Baha; Gürüler, Hüseyin

2015-02-01

The effect of anesthesia on the patient is referred to as depth of anesthesia. Rapid classification of appropriate depth level of anesthesia is a matter of great importance in surgical operations. Similarly, accelerating classification algorithms is important for the rapid solution of problems in the field of biomedical signal processing. However numerous, time-consuming mathematical operations are required when training and testing stages of the classification algorithms, especially in neural networks. In this study, to accelerate the process, parallel programming and computing platform (Nvidia CUDA) facilitates dramatic increases in computing performance by harnessing the power of the graphics processing unit (GPU) was utilized. The system was employed to detect anesthetic depth level on related electroencephalogram (EEG) data set. This dataset is rather complex and large. Moreover, the achieving more anesthetic levels with rapid response is critical in anesthesia. The proposed parallelization method yielded high accurate classification results in a faster time.

Detecting malicious chaotic signals in wireless sensor network

NASA Astrophysics Data System (ADS)

Upadhyay, Ranjit Kumar; Kumari, Sangeeta

2018-02-01

In this paper, an e-epidemic Susceptible-Infected-Vaccinated (SIV) model has been proposed to analyze the effect of node immunization and worms attacking dynamics in wireless sensor network. A modified nonlinear incidence rate with cyrtoid type functional response has been considered using sleep and active mode approach. Detailed stability analysis and the sufficient criteria for the persistence of the model system have been established. We also established different types of bifurcation analysis for different equilibria at different critical points of the control parameters. We performed a detailed Hopf bifurcation analysis and determine the direction and stability of the bifurcating periodic solutions using center manifold theorem. Numerical simulations are carried out to confirm the theoretical results. The impact of the control parameters on the dynamics of the model system has been investigated and malicious chaotic signals are detected. Finally, we have analyzed the effect of time delay on the dynamics of the model system.

Analytical and Numerical solutions of a nonlinear alcoholism model via variable-order fractional differential equations

NASA Astrophysics Data System (ADS)

Gómez-Aguilar, J. F.

2018-03-01

In this paper, we analyze an alcoholism model which involves the impact of Twitter via Liouville-Caputo and Atangana-Baleanu-Caputo fractional derivatives with constant- and variable-order. Two fractional mathematical models are considered, with and without delay. Special solutions using an iterative scheme via Laplace and Sumudu transform were obtained. We studied the uniqueness and existence of the solutions employing the fixed point postulate. The generalized model with variable-order was solved numerically via the Adams method and the Adams-Bashforth-Moulton scheme. Stability and convergence of the numerical solutions were presented in details. Numerical examples of the approximate solutions are provided to show that the numerical methods are computationally efficient. Therefore, by including both the fractional derivatives and finite time delays in the alcoholism model studied, we believe that we have established a more complete and more realistic indicator of alcoholism model and affect the spread of the drinking.

Long-time asymptotic solution structure of Camassa-Holm equation subject to an initial condition with non-zero reflection coefficient of the scattering data

NASA Astrophysics Data System (ADS)

Chang, Chueh-Hsin; Yu, Ching-Hao; Sheu, Tony Wen-Hann

2016-10-01

In this article, we numerically revisit the long-time solution behavior of the Camassa-Holm equation ut - uxxt + 2ux + 3uux = 2uxuxx + uuxxx. The finite difference solution of this integrable equation is sought subject to the newly derived initial condition with Delta-function potential. Our underlying strategy of deriving a numerical phase accurate finite difference scheme in time domain is to reduce the numerical dispersion error through minimization of the derived discrepancy between the numerical and exact modified wavenumbers. Additionally, to achieve the goal of conserving Hamiltonians in the completely integrable equation of current interest, a symplecticity-preserving time-stepping scheme is developed. Based on the solutions computed from the temporally symplecticity-preserving and the spatially wavenumber-preserving schemes, the long-time asymptotic CH solution characters can be accurately depicted in distinct regions of the space-time domain featuring with their own quantitatively very different solution behaviors. We also aim to numerically confirm that in the two transition zones their long-time asymptotics can indeed be described in terms of the theoretically derived Painlevé transcendents. Another attempt of this study is to numerically exhibit a close connection between the presently predicted finite-difference solution and the solution of the Painlevé ordinary differential equation of type II in two different transition zones.

Comparison of NACA 0012 Laminar Flow Solutions: Structured and Unstructured Grid Methods

NASA Technical Reports Server (NTRS)

Swanson, R. C.; Langer, S.

2016-01-01

In this paper we consider the solution of the compressible Navier-Stokes equations for a class of laminar airfoil flows. The principal objective of this paper is to demonstrate that members of this class of laminar flows have steady-state solutions. These laminar airfoil flow cases are often used to evaluate accuracy, stability and convergence of numerical solution algorithms for the Navier-Stokes equations. In recent years, such flows have also been used as test cases for high-order numerical schemes. While generally consistent steady-state solutions have been obtained for these flows using higher order schemes, a number of results have been published with various solutions, including unsteady ones. We demonstrate with two different numerical methods and a range of meshes with a maximum density that exceeds 8 × 106 grid points that steady-state solutions are obtained. Furthermore, numerical evidence is presented that even when solving the equations with an unsteady algorithm, one obtains steady-state solutions.

A meshless method using radial basis functions for numerical solution of the two-dimensional KdV-Burgers equation

NASA Astrophysics Data System (ADS)

Zabihi, F.; Saffarian, M.

2016-07-01

The aim of this article is to obtain the numerical solution of the two-dimensional KdV-Burgers equation. We construct the solution by using a different approach, that is based on using collocation points. The solution is based on using the thin plate splines radial basis function, which builds an approximated solution with discretizing the time and the space to small steps. We use a predictor-corrector scheme to avoid solving the nonlinear system. The results of numerical experiments are compared with analytical solutions to confirm the accuracy and efficiency of the presented scheme.

Intercomparison of 3D pore-scale flow and solute transport simulation methods

DOE PAGES

Mehmani, Yashar; Schoenherr, Martin; Pasquali, Andrea; ...

2015-09-28

Multiple numerical approaches have been developed to simulate porous media fluid flow and solute transport at the pore scale. These include 1) methods that explicitly model the three-dimensional geometry of pore spaces and 2) methods that conceptualize the pore space as a topologically consistent set of stylized pore bodies and pore throats. In previous work we validated a model of the first type, using computational fluid dynamics (CFD) codes employing a standard finite volume method (FVM), against magnetic resonance velocimetry (MRV) measurements of pore-scale velocities. Here we expand that validation to include additional models of the first type based onmore » the lattice Boltzmann method (LBM) and smoothed particle hydrodynamics (SPH), as well as a model of the second type, a pore-network model (PNM). The PNM approach used in the current study was recently improved and demonstrated to accurately simulate solute transport in a two-dimensional experiment. While the PNM approach is computationally much less demanding than direct numerical simulation methods, the effect of conceptualizing complex three-dimensional pore geometries on solute transport in the manner of PNMs has not been fully determined. We apply all four approaches (FVM-based CFD, LBM, SPH and PNM) to simulate pore-scale velocity distributions and (for capable codes) nonreactive solute transport, and intercompare the model results. Comparisons are drawn both in terms of macroscopic variables (e.g., permeability, solute breakthrough curves) and microscopic variables (e.g., local velocities and concentrations). Generally good agreement was achieved among the various approaches, but some differences were observed depending on the model context. The intercomparison work was challenging because of variable capabilities of the codes, and inspired some code enhancements to allow consistent comparison of flow and transport simulations across the full suite of methods. This paper provides support for confidence in a variety of pore-scale modeling methods and motivates further development and application of pore-scale simulation methods.« less

Intercomparison of 3D pore-scale flow and solute transport simulation methods

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

Yang, Xiaofan; Mehmani, Yashar; Perkins, William A.

2016-09-01

Multiple numerical approaches have been developed to simulate porous media fluid flow and solute transport at the pore scale. These include 1) methods that explicitly model the three-dimensional geometry of pore spaces and 2) methods that conceptualize the pore space as a topologically consistent set of stylized pore bodies and pore throats. In previous work we validated a model of the first type, using computational fluid dynamics (CFD) codes employing a standard finite volume method (FVM), against magnetic resonance velocimetry (MRV) measurements of pore-scale velocities. Here we expand that validation to include additional models of the first type based onmore » the lattice Boltzmann method (LBM) and smoothed particle hydrodynamics (SPH), as well as a model of the second type, a pore-network model (PNM). The PNM approach used in the current study was recently improved and demonstrated to accurately simulate solute transport in a two-dimensional experiment. While the PNM approach is computationally much less demanding than direct numerical simulation methods, the effect of conceptualizing complex three-dimensional pore geometries on solute transport in the manner of PNMs has not been fully determined. We apply all four approaches (FVM-based CFD, LBM, SPH and PNM) to simulate pore-scale velocity distributions and (for capable codes) nonreactive solute transport, and intercompare the model results. Comparisons are drawn both in terms of macroscopic variables (e.g., permeability, solute breakthrough curves) and microscopic variables (e.g., local velocities and concentrations). Generally good agreement was achieved among the various approaches, but some differences were observed depending on the model context. The intercomparison work was challenging because of variable capabilities of the codes, and inspired some code enhancements to allow consistent comparison of flow and transport simulations across the full suite of methods. This study provides support for confidence in a variety of pore-scale modeling methods and motivates further development and application of pore-scale simulation methods.« less

Modeling flow and solute transport in irrigation furrows

USDA-ARS?s Scientific Manuscript database

This paper presents an internally coupled flow and solute transport model for free-draining irrigation furrows. Furrow hydraulics is simulated with a numerical zero-inertia model and solute transport is computed with a model based on a numerical solution of the cross-section averaged advection-dispe...

Optical Access Networks

NASA Astrophysics Data System (ADS)

Zheng, Jun; Ansari, Nirwan

2005-01-01

Call for Papers: Optical Access Networks

Guest Editors Jun Zheng, University of Ottawa Nirwan Ansari, New Jersey Institute of Technology

Submission Deadline: 1 June 2005

Background

Scope of Contributions

• Optical access network architectures and protocols
• Passive optical networks (BPON, EPON, GPON, etc.)
• Active optical networks
• Multiple access control
• Multiservices and QoS provisioning
• Network survivability
• Field trials and standards
• Performance modeling and analysis

Manuscript Submission

Cooperative Game-Based Energy Efficiency Management over Ultra-Dense Wireless Cellular Networks

PubMed Central

Li, Ming; Chen, Pengpeng; Gao, Shouwan

2016-01-01

Ultra-dense wireless cellular networks have been envisioned as a promising technique for handling the explosive increase of wireless traffic volume. With the extensive deployment of small cells in wireless cellular networks, the network spectral efficiency (SE) is improved with the use of limited frequency. However, the mutual inter-tier and intra-tier interference between or among small cells and macro cells becomes serious. On the other hand, more chances for potential cooperation among different cells are introduced. Energy efficiency (EE) has become one of the most important problems for future wireless networks. This paper proposes a cooperative bargaining game-based method for comprehensive EE management in an ultra-dense wireless cellular network, which highlights the complicated interference influence on energy-saving challenges and the power-coordination process among small cells and macro cells. Especially, a unified EE utility with the consideration of the interference mitigation is proposed to jointly address the SE, the deployment efficiency (DE), and the EE. In particular, closed-form power-coordination solutions for the optimal EE are derived to show the convergence property of the algorithm. Moreover, a simplified algorithm is presented to reduce the complexity of the signaling overhead, which is significant for ultra-dense small cells. Finally, numerical simulations are provided to illustrate the efficiency of the proposed cooperative bargaining game-based and simplified schemes. PMID:27649170

Cooperative Game-Based Energy Efficiency Management over Ultra-Dense Wireless Cellular Networks.

PubMed

Li, Ming; Chen, Pengpeng; Gao, Shouwan

2016-09-13

Ultra-dense wireless cellular networks have been envisioned as a promising technique for handling the explosive increase of wireless traffic volume. With the extensive deployment of small cells in wireless cellular networks, the network spectral efficiency (SE) is improved with the use of limited frequency. However, the mutual inter-tier and intra-tier interference between or among small cells and macro cells becomes serious. On the other hand, more chances for potential cooperation among different cells are introduced. Energy efficiency (EE) has become one of the most important problems for future wireless networks. This paper proposes a cooperative bargaining game-based method for comprehensive EE management in an ultra-dense wireless cellular network, which highlights the complicated interference influence on energy-saving challenges and the power-coordination process among small cells and macro cells. Especially, a unified EE utility with the consideration of the interference mitigation is proposed to jointly address the SE, the deployment efficiency (DE), and the EE. In particular, closed-form power-coordination solutions for the optimal EE are derived to show the convergence property of the algorithm. Moreover, a simplified algorithm is presented to reduce the complexity of the signaling overhead, which is significant for ultra-dense small cells. Finally, numerical simulations are provided to illustrate the efficiency of the proposed cooperative bargaining game-based and simplified schemes.

Three-dimensional finite elements for the analysis of soil contamination using a multiple-porosity approach

NASA Astrophysics Data System (ADS)

El-Zein, Abbas; Carter, John P.; Airey, David W.

2006-06-01

A three-dimensional finite-element model of contaminant migration in fissured clays or contaminated sand which includes multiple sources of non-equilibrium processes is proposed. The conceptual framework can accommodate a regular network of fissures in 1D, 2D or 3D and immobile solutions in the macro-pores of aggregated topsoils, as well as non-equilibrium sorption. A Galerkin weighted-residual statement for the three-dimensional form of the equations in the Laplace domain is formulated. Equations are discretized using linear and quadratic prism elements. The system of algebraic equations is solved in the Laplace domain and solution is inverted to the time domain numerically. The model is validated and its scope is illustrated through the analysis of three problems: a waste repository deeply buried in fissured clay, a storage tank leaking into sand and a sanitary landfill leaching into fissured clay over a sand aquifer.

Benchmarks for single-phase flow in fractured porous media

NASA Astrophysics Data System (ADS)

Flemisch, Bernd; Berre, Inga; Boon, Wietse; Fumagalli, Alessio; Schwenck, Nicolas; Scotti, Anna; Stefansson, Ivar; Tatomir, Alexandru

2018-01-01

This paper presents several test cases intended to be benchmarks for numerical schemes for single-phase fluid flow in fractured porous media. A number of solution strategies are compared, including a vertex and two cell-centred finite volume methods, a non-conforming embedded discrete fracture model, a primal and a dual extended finite element formulation, and a mortar discrete fracture model. The proposed benchmarks test the schemes by increasing the difficulties in terms of network geometry, e.g. intersecting fractures, and physical parameters, e.g. low and high fracture-matrix permeability ratio as well as heterogeneous fracture permeabilities. For each problem, the results presented are the number of unknowns, the approximation errors in the porous matrix and in the fractures with respect to a reference solution, and the sparsity and condition number of the discretized linear system. All data and meshes used in this study are publicly available for further comparisons.

Fatigue design of a cellular phone folder using regression model-based multi-objective optimization

NASA Astrophysics Data System (ADS)

Kim, Young Gyun; Lee, Jongsoo

2016-08-01

In a folding cellular phone, the folding device is repeatedly opened and closed by the user, which eventually results in fatigue damage, particularly to the front of the folder. Hence, it is important to improve the safety and endurance of the folder while also reducing its weight. This article presents an optimal design for the folder front that maximizes its fatigue endurance while minimizing its thickness. Design data for analysis and optimization were obtained experimentally using a test jig. Multi-objective optimization was carried out using a nonlinear regression model. Three regression methods were employed: back-propagation neural networks, logistic regression and support vector machines. The AdaBoost ensemble technique was also used to improve the approximation. Two-objective Pareto-optimal solutions were identified using the non-dominated sorting genetic algorithm (NSGA-II). Finally, a numerically optimized solution was validated against experimental product data, in terms of both fatigue endurance and thickness index.

Is functional integration of resting state brain networks an unspecific biomarker for working memory performance?

PubMed

Alavash, Mohsen; Doebler, Philipp; Holling, Heinz; Thiel, Christiane M; Gießing, Carsten

2015-03-01

Is there one optimal topology of functional brain networks at rest from which our cognitive performance would profit? Previous studies suggest that functional integration of resting state brain networks is an important biomarker for cognitive performance. However, it is still unknown whether higher network integration is an unspecific predictor for good cognitive performance or, alternatively, whether specific network organization during rest predicts only specific cognitive abilities. Here, we investigated the relationship between network integration at rest and cognitive performance using two tasks that measured different aspects of working memory; one task assessed visual-spatial and the other numerical working memory. Network clustering, modularity and efficiency were computed to capture network integration on different levels of network organization, and to statistically compare their correlations with the performance in each working memory test. The results revealed that each working memory aspect profits from a different resting state topology, and the tests showed significantly different correlations with each of the measures of network integration. While higher global network integration and modularity predicted significantly better performance in visual-spatial working memory, both measures showed no significant correlation with numerical working memory performance. In contrast, numerical working memory was superior in subjects with highly clustered brain networks, predominantly in the intraparietal sulcus, a core brain region of the working memory network. Our findings suggest that a specific balance between local and global functional integration of resting state brain networks facilitates special aspects of cognitive performance. In the context of working memory, while visual-spatial performance is facilitated by globally integrated functional resting state brain networks, numerical working memory profits from increased capacities for local processing, especially in brain regions involved in working memory performance. Copyright © 2014 Elsevier Inc. All rights reserved.

Web servlet-assisted, dial-in flow cytometry data analysis.

PubMed

Battye, F

2001-02-01

The obvious benefits of centralized data storage notwithstanding, the size of modern flow cytometry data files discourages their transmission over commonly used telephone modem connections. The proposed solution is to install at the central location a web servlet that can extract compact data arrays, of a form dependent on the requested display type, from the stored files and transmit them to a remote client computer program for display. A client program and a web servlet, both written in the Java programming language, were designed to communicate over standard network connections. The client program creates familiar numerical and graphical display types and allows the creation of gates from combinations of user-defined regions. Data compression techniques further reduce transmission times for data arrays that are already much smaller than the data file itself. For typical data files, network transmission times were reduced more than 700-fold for extraction of one-dimensional (1-D) histograms, between 18 and 120-fold for 2-D histograms, and 6-fold for color-coded dot plots. Numerous display formats are possible without further access to the data file. This scheme enables telephone modem access to centrally stored data without restricting flexibility of display format or preventing comparisons with locally stored files. Copyright 2001 Wiley-Liss, Inc.

Stochastic resonance in the majority vote model on regular and small-world lattices

NASA Astrophysics Data System (ADS)

Krawiecki, A.

2017-11-01

The majority vote model with two states on regular and small-world networks is considered under the influence of periodic driving. Monte Carlo simulations show that the time-dependent magnetization, playing the role of the output signal, exhibits maximum periodicity at nonzero values of the internal noise parameter q, which is manifested as the occurrence of the maximum of the spectral power amplification; the location of the maximum depends in a nontrivial way on the amplitude and frequency of the periodic driving as well as on the network topology. This indicates the appearance of stochastic resonance in the system as a function of the intensity of the internal noise. Besides, for low frequencies and for certain narrow ranges of the amplitudes of the periodic driving double maxima of the spectral power amplification as a function of q occur, i.e., stochastic multiresonance appears. The above-mentioned results quantitatively agree with those obtained from numerical simulations of the mean-field equations for the time-dependent magnetization. In contrast, analytic solutions for the spectral power amplification obtained from the latter equations using the linear response approximation deviate significanlty from the numerical results since the effect of the periodic driving on the system is not small even for vanishing amplitude.

High-capacity mixed fiber-wireless backhaul networks using MMW radio-over-MCF and MIMO

NASA Astrophysics Data System (ADS)

Pham, Thu A.; Pham, Hien T. T.; Le, Hai-Chau; Dang, Ngoc T.

2017-10-01

In this paper, we have proposed a high-capacity backhaul network, which is based on mixed fiber-wireless systems using millimeter-wave radio-over-multi-core fiber (MMW RoMCF) and multiple-input multiple-output (MIMO) transmission, for next generation mobile access networks. In addition, we also investigate the use of avalanche photodiode (APD) to improve capacity of the proposed backhaul downlink. We then theoretically analyze the system capacity comprehensively while considering various physical impairments including noise, MCF crosstalk, and fading modeled by Rician MIMO channel. The feasibility of the proposed backhaul architecture is verified via the numerical simulation experiments. The research results demonstrate that our developed backhaul solution can significantly enhance the backhaul capacity; the system capacity of 24 bps/Hz can be achieved with 20-km 8-core MCF and 8 × 8 MIMO transmitted over 100-m Rician fading link. It is also shown that the system performance, in term of channel capacity, strongly depend on the MCF inter-core crosstalk, which is governed by the mode coupling coefficient, the core pitch, and the bending radius.

Robust Analysis of Network-Based Real-Time Kinematic for GNSS-Derived Heights.

PubMed

Bae, Tae-Suk; Grejner-Brzezinska, Dorota; Mader, Gerald; Dennis, Michael

2015-10-26

New guidelines and procedures for real-time (RT) network-based solutions are required in order to support Global Navigation Satellite System (GNSS) derived heights. Two kinds of experiments were carried out to analyze the performance of the network-based real-time kinematic (RTK) solutions. New test marks were installed in different surrounding environments, and the existing GPS benchmarks were used for analyzing the effect of different factors, such as baseline lengths, antenna types, on the final accuracy and reliability of the height estimation. The RT solutions are categorized into three groups: single-base RTK, multiple-epoch network RTK (mRTN), and single-epoch network RTK (sRTN). The RTK solution can be biased up to 9 mm depending on the surrounding environment, but there was no notable bias for a longer reference base station (about 30 km) In addition, the occupation time for the network RTK was investigated in various cases. There is no explicit bias in the solution for different durations, but smoother results were obtained for longer durations. Further investigation is needed into the effect of changing the occupation time between solutions and into the possibility of using single-epoch solutions in precise determination of heights by GNSS.

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.

Mean-field description and propagation of chaos in networks of Hodgkin-Huxley and FitzHugh-Nagumo neurons

PubMed Central

2012-01-01

We derive the mean-field equations arising as the limit of a network of interacting spiking neurons, as the number of neurons goes to infinity. The neurons belong to a fixed number of populations and are represented either by the Hodgkin-Huxley model or by one of its simplified version, the FitzHugh-Nagumo model. The synapses between neurons are either electrical or chemical. The network is assumed to be fully connected. The maximum conductances vary randomly. Under the condition that all neurons’ initial conditions are drawn independently from the same law that depends only on the population they belong to, we prove that a propagation of chaos phenomenon takes place, namely that in the mean-field limit, any finite number of neurons become independent and, within each population, have the same probability distribution. This probability distribution is a solution of a set of implicit equations, either nonlinear stochastic differential equations resembling the McKean-Vlasov equations or non-local partial differential equations resembling the McKean-Vlasov-Fokker-Planck equations. We prove the well-posedness of the McKean-Vlasov equations, i.e. the existence and uniqueness of a solution. We also show the results of some numerical experiments that indicate that the mean-field equations are a good representation of the mean activity of a finite size network, even for modest sizes. These experiments also indicate that the McKean-Vlasov-Fokker-Planck equations may be a good way to understand the mean-field dynamics through, e.g. a bifurcation analysis. Mathematics Subject Classification (2000): 60F99, 60B10, 92B20, 82C32, 82C80, 35Q80. PMID:22657695

Spectral methods in general relativity and large Randall-Sundrum II black holes

NASA Astrophysics Data System (ADS)

Abdolrahimi, Shohreh; Cattoën, Céline; Page, Don N.; \\\\; Yaghoobpour-Tari, Shima

2013-06-01

Using a novel numerical spectral method, we have found solutions for large static Randall-Sundrum II (RSII) black holes by perturbing a numerical AdS5-CFT4 solution to the Einstein equation with a negative cosmological constant Λ that is asymptotically conformal to the Schwarzschild metric. We used a numerical spectral method independent of the Ricci-DeTurck-flow method used by Figueras, Lucietti, and Wiseman for a similar numerical solution. We have compared our black-hole solution to the one Figueras and Wiseman have derived by perturbing their numerical AdS5-CFT4 solution, showing that our solution agrees closely with theirs. We have obtained a closed-form approximation to the metric of the black hole on the brane. We have also deduced the new results that to first order in 1/(-ΛM2), the Hawking temperature and entropy of an RSII static black hole have the same values as the Schwarzschild metric with the same mass, but the horizon area is increased by about 4.7/(-Λ).

Data Gathering and Energy Transfer Dilemma in UAV-Assisted Flying Access Network for IoT

PubMed Central

Arabi, Sara; Sadik, Mohamed

2018-01-01

Recently, Unmanned Aerial Vehicles (UAVs) have emerged as an alternative solution to assist wireless networks, thanks to numerous advantages they offer in comparison to terrestrial fixed base stations. For instance, a UAV can be used to embed a flying base station providing an on-demand nomadic access to network services. A UAV can also be used to wirelessly recharge out-of-battery ground devices. In this paper, we aim to deal with both data collection and recharging depleted ground Internet-of-Things (IoT) devices through a UAV station used as a flying base station. To extend the network lifetime, we present a novel use of UAV with energy harvesting module and wireless recharging capabilities. However, the UAV is used as an energy source to empower depleted IoT devices. On one hand, the UAV charges depleted ground IoT devices under three policies: (1) low-battery first scheme; (2) high-battery first scheme; and (3) random scheme. On the other hand, the UAV station collects data from IoT devices that have sufficient energy to transmit their packets, and in the same phase, the UAV exploits the Radio Frequency (RF) signals transmitted by IoT devices to extract and harvest energy. Furthermore, and as the UAV station has a limited coverage time due to its energy constraints, we propose and investigate an efficient trade-off between ground users recharging time and data gathering time. Furthermore, we suggest to control and optimize the UAV trajectory in order to complete its travel within a minimum time, while minimizing the energy spent and/or enhancing the network lifetime. Extensive numerical results and simulations show how the system behaves under different scenarios and using various metrics in which we examine the added value of UAV with energy harvesting module. PMID:29751662

Effect of correlations on controllability transition in network control

PubMed Central

Nie, Sen; Wang, Xu-Wen; Wang, Bing-Hong; Jiang, Luo-Luo

2016-01-01

The network control problem has recently attracted an increasing amount of attention, owing to concerns including the avoidance of cascading failures of power-grids and the management of ecological networks. It has been proven that numerical control can be achieved if the number of control inputs exceeds a certain transition point. In the present study, we investigate the effect of degree correlation on the numerical controllability in networks whose topological structures are reconstructed from both real and modeling systems, and we find that the transition point of the number of control inputs depends strongly on the degree correlation in both undirected and directed networks with moderately sparse links. More interestingly, the effect of the degree correlation on the transition point cannot be observed in dense networks for numerical controllability, which contrasts with the corresponding result for structural controllability. In particular, for directed random networks and scale-free networks, the influence of the degree correlation is determined by the types of correlations. Our approach provides an understanding of control problems in complex sparse networks. PMID:27063294

Optimizing a multi-product closed-loop supply chain using NSGA-II, MOSA, and MOPSO meta-heuristic algorithms

NASA Astrophysics Data System (ADS)

Babaveisi, Vahid; Paydar, Mohammad Mahdi; Safaei, Abdul Sattar

2018-07-01

This study aims to discuss the solution methodology for a closed-loop supply chain (CLSC) network that includes the collection of used products as well as distribution of the new products. This supply chain is presented on behalf of the problems that can be solved by the proposed meta-heuristic algorithms. A mathematical model is designed for a CLSC that involves three objective functions of maximizing the profit, minimizing the total risk and shortages of products. Since three objective functions are considered, a multi-objective solution methodology can be advantageous. Therefore, several approaches have been studied and an NSGA-II algorithm is first utilized, and then the results are validated using an MOSA and MOPSO algorithms. Priority-based encoding, which is used in all the algorithms, is the core of the solution computations. To compare the performance of the meta-heuristics, random numerical instances are evaluated by four criteria involving mean ideal distance, spread of non-dominance solution, the number of Pareto solutions, and CPU time. In order to enhance the performance of the algorithms, Taguchi method is used for parameter tuning. Finally, sensitivity analyses are performed and the computational results are presented based on the sensitivity analyses in parameter tuning.

Optimizing a multi-product closed-loop supply chain using NSGA-II, MOSA, and MOPSO meta-heuristic algorithms

NASA Astrophysics Data System (ADS)

Babaveisi, Vahid; Paydar, Mohammad Mahdi; Safaei, Abdul Sattar

2017-07-01

This study aims to discuss the solution methodology for a closed-loop supply chain (CLSC) network that includes the collection of used products as well as distribution of the new products. This supply chain is presented on behalf of the problems that can be solved by the proposed meta-heuristic algorithms. A mathematical model is designed for a CLSC that involves three objective functions of maximizing the profit, minimizing the total risk and shortages of products. Since three objective functions are considered, a multi-objective solution methodology can be advantageous. Therefore, several approaches have been studied and an NSGA-II algorithm is first utilized, and then the results are validated using an MOSA and MOPSO algorithms. Priority-based encoding, which is used in all the algorithms, is the core of the solution computations. To compare the performance of the meta-heuristics, random numerical instances are evaluated by four criteria involving mean ideal distance, spread of non-dominance solution, the number of Pareto solutions, and CPU time. In order to enhance the performance of the algorithms, Taguchi method is used for parameter tuning. Finally, sensitivity analyses are performed and the computational results are presented based on the sensitivity analyses in parameter tuning.

On recent advances and future research directions for computational fluid dynamics

NASA Technical Reports Server (NTRS)

Baker, A. J.; Soliman, M. O.; Manhardt, P. D.

1986-01-01

This paper highlights some recent accomplishments regarding CFD numerical algorithm constructions for generation of discrete approximate solutions to classes of Reynolds-averaged Navier-Stokes equations. Following an overview of turbulent closure modeling, and development of appropriate conservation law systems, a Taylor weak-statement semi-discrete approximate solution algorithm is developed. Various forms for completion to the final linear algebra statement are cited, as are a range of candidate numerical linear algebra solution procedures. This development sequence emphasizes the key building blocks of a CFD RNS algorithm, including solution trial and test spaces, integration procedure and added numerical stability mechanisms. A range of numerical results are discussed focusing on key topics guiding future research directions.

Secure vendor environment (SVE) for PACS

NASA Astrophysics Data System (ADS)

Honeyman-Buck, Janice; Frost, Meryll

2005-04-01

A Secure Vendor Environment (SVE) was created to protect radiology modalities from network intrusion, worms, viruses, and other forms of damaging attacks. Many vendors do not attempt any form of network security and if an institution demands a non-standard and secure installation, a future system upgrade could and frequently does eliminate any security measures installed during the initial installation. The SVE isolates the vendor equipment behind a virtual firewall on a private network that is invisible to the outside world. All interactions must go though a device containing two network interface cards called an Application Processor that acts as a store-and forward router, performs DICOM repair, proxies modality worklist, and isolates the vendor modalities. A small VPN appliance can open the device temporarily for remote access by vendor engineers. Prior to the routine installation of the SVE, vendor equipment was often attacked by hostile network intruders and viruses or worms, sometimes rendering the equipment unusable until the vendor could reload the system. The resulted in considerable clinical downtime and loss of revenue. Since the relatively low cost SVE solution has routinely been installed with all new equipment, no intrusions have occurred, although our network sniffers and intrusion detectors indicate that we are constantly being scanned for vulnerability. Purpose: To provide a secure network for vendor equipment in a PACS environment while allowing vendor access for upgrades and system repairs. Method: The network administrators at our university believe that network security should be implemented at the machine level rather than relying on a firewall. A firewall solution could conceivably block unwanted intrusion from outside the university network, but would still allow literally thousands of potential network users to get through to the PACS network. All the PACS archive, display and routing systems are individually protected from intrusion, but vendors of image producing modalities such as CT, MRI, and CR typically do not protect their equipment from network intrusion. Most vendors use the same user-ids and passwords for their service and administrative accounts which makes it easy for them to get to their systems for remote repairs and upgrades, but also makes it easy for hackers and other unwelcome intruders to gain access. We use a device with two network interface cards to isolate the vendor network from the main PACS / university / hospital network. This device is a store and forward PACS routing device, a DICOM repair device, a modality worklist proxy device, and a de-facto firewall. This device is named an Application Processor (AP). In addition, a small virtual private network (VPN) device is placed on the system that can be controlled only by the PACS administration. If a vendor engineer needs remote access to upgrade or service the equipment, a temporary connection is enabled for only the computer the engineer is using at the time, then is closed when he/she has completed their work. Results: The secure vendor environment (SVE) consists of a computer and a VPN appliance and costs approximately 2,000 USD to build. With software, the total system costs approximately 2800 - $3500. The SVE is typically deployed as part of every equipment installation. Since the SVE has been used, we have had no intrusion and no downtime due to hackers, viruses, worms, etc. This is now a part of every project plan for equipment that will become part of the PACS. New work: The SVE is a unique and new work by our group, developed as a solution totally within our group. Conclusions: Our results have convinced our administration that this small cost to protect vendor equipment is well worth the investment. Prior to developing this solution, there were numerous occasions where intruders invaded our equipment and rendered it unusable until the software could be reloaded, sometimes resulting in the loss of a day or more of clinical use.

Multiresolution representation and numerical algorithms: A brief review

NASA Technical Reports Server (NTRS)

Harten, Amiram

1994-01-01

In this paper we review recent developments in techniques to represent data in terms of its local scale components. These techniques enable us to obtain data compression by eliminating scale-coefficients which are sufficiently small. This capability for data compression can be used to reduce the cost of many numerical solution algorithms by either applying it to the numerical solution operator in order to get an approximate sparse representation, or by applying it to the numerical solution itself in order to reduce the number of quantities that need to be computed.

Optimal Control of Induction Machines to Minimize Transient Energy Losses

NASA Astrophysics Data System (ADS)

Plathottam, Siby Jose

Induction machines are electromechanical energy conversion devices comprised of a stator and a rotor. Torque is generated due to the interaction between the rotating magnetic field from the stator, and the current induced in the rotor conductors. Their speed and torque output can be precisely controlled by manipulating the magnitude, frequency, and phase of the three input sinusoidal voltage waveforms. Their ruggedness, low cost, and high efficiency have made them ubiquitous component of nearly every industrial application. Thus, even a small improvement in their energy efficient tend to give a large amount of electrical energy savings over the lifetime of the machine. Hence, increasing energy efficiency (reducing energy losses) in induction machines is a constrained optimization problem that has attracted attention from researchers. The energy conversion efficiency of induction machines depends on both the speed-torque operating point, as well as the input voltage waveform. It also depends on whether the machine is in the transient or steady state. Maximizing energy efficiency during steady state is a Static Optimization problem, that has been extensively studied, with commercial solutions available. On the other hand, improving energy efficiency during transients is a Dynamic Optimization problem that is sparsely studied. This dissertation exclusively focuses on improving energy efficiency during transients. This dissertation treats the transient energy loss minimization problem as an optimal control problem which consists of a dynamic model of the machine, and a cost functional. The rotor field oriented current fed model of the induction machine is selected as the dynamic model. The rotor speed and rotor d-axis flux are the state variables in the dynamic model. The stator currents referred to as d-and q-axis currents are the control inputs. A cost functional is proposed that assigns a cost to both the energy losses in the induction machine, as well as the deviations from desired speed-torque-magnetic flux setpoints. Using Pontryagin's minimum principle, a set of necessary conditions that must be satisfied by the optimal control trajectories are derived. The conditions are in the form a two-point boundary value problem, that can be solved numerically. The conjugate gradient method that was modified using the Hestenes-Stiefel formula was used to obtain the numerical solution of both the control and state trajectories. Using the distinctive shape of the numerical trajectories as inspiration, analytical expressions were derived for the state, and control trajectories. It was shown that the trajectory could be fully described by finding the solution of a one-dimensional optimization problem. The sensitivity of both the optimal trajectory and the optimal energy efficiency to different induction machine parameters were analyzed. A non-iterative solution that can use feedback for generating optimal control trajectories in real time was explored. It was found that an artificial neural network could be trained using the numerical solutions and made to emulate the optimal control trajectories with a high degree of accuracy. Hence a neural network along with a supervisory logic was implemented and used in a real-time simulation to control the Finite Element Method model of the induction machine. The results were compared with three other control regimes and the optimal control system was found to have the highest energy efficiency for the same drive cycle.

Constructing exact symmetric informationally complete measurements from numerical solutions

NASA Astrophysics Data System (ADS)

Appleby, Marcus; Chien, Tuan-Yow; Flammia, Steven; Waldron, Shayne

2018-04-01

Recently, several intriguing conjectures have been proposed connecting symmetric informationally complete quantum measurements (SIC POVMs, or SICs) and algebraic number theory. These conjectures relate the SICs to their minimal defining algebraic number field. Testing or sharpening these conjectures requires that the SICs are expressed exactly, rather than as numerical approximations. While many exact solutions of SICs have been constructed previously using Gröbner bases, this method has probably been taken as far as is possible with current computer technology (except in special cases where there are additional symmetries). Here, we describe a method for converting high-precision numerical solutions into exact ones using an integer relation algorithm in conjunction with the Galois symmetries of an SIC. Using this method, we have calculated 69 new exact solutions, including nine new dimensions, where previously only numerical solutions were known—which more than triples the number of known exact solutions. In some cases, the solutions require number fields with degrees as high as 12 288. We use these solutions to confirm that they obey the number-theoretic conjectures, and address two questions suggested by the previous work.

Tests of the Grobner Basis Solution for Lightning Ground Flash Fraction Retrieval

NASA Technical Reports Server (NTRS)

Koshak, William; Solakiewicz, Richard; Attele, Rohan

2011-01-01

Satellite lightning imagers such as the NASA Tropical Rainfall Measuring Mission Lightning Imaging Sensor (TRMM/LIS) and the future GOES-R Geostationary Lightning Mapper (GLM) are designed to detect total lightning (ground flashes + cloud flashes). However, there is a desire to discriminate ground flashes from cloud flashes from the vantage point of space since this would enhance the overall information content of the satellite lightning data and likely improve its operational and scientific applications (e.g., in severe weather warning, lightning nitrogen oxides studies, and global electric circuit analyses). A Bayesian inversion method was previously introduced for retrieving the fraction of ground flashes in a set of flashes observed from a satellite lightning imager. The method employed a constrained mixed exponential distribution model to describe the lightning optical measurements. To obtain the optimum model parameters (one of which is the ground flash fraction), a scalar function was minimized by a numerical method. In order to improve this optimization, a Grobner basis solution was introduced to obtain analytic representations of the model parameters that serve as a refined initialization scheme to the numerical optimization. In this study, we test the efficacy of the Grobner basis initialization using actual lightning imager measurements and ground flash truth derived from the national lightning network.

Percolation and Reinforcement on Complex Networks

NASA Astrophysics Data System (ADS)

Yuan, Xin

Complex networks appear in almost every aspect of our daily life and are widely studied in the fields of physics, mathematics, finance, biology and computer science. This work utilizes percolation theory in statistical physics to explore the percolation properties of complex networks and develops a reinforcement scheme on improving network resilience. This dissertation covers two major parts of my Ph.D. research on complex networks: i) probe--in the context of both traditional percolation and k-core percolation--the resilience of complex networks with tunable degree distributions or directed dependency links under random, localized or targeted attacks; ii) develop and propose a reinforcement scheme to eradicate catastrophic collapses that occur very often in interdependent networks. We first use generating function and probabilistic methods to obtain analytical solutions to percolation properties of interest, such as the giant component size and the critical occupation probability. We study uncorrelated random networks with Poisson, bi-Poisson, power-law, and Kronecker-delta degree distributions and construct those networks which are based on the configuration model. The computer simulation results show remarkable agreement with theoretical predictions. We discover an increase of network robustness as the degree distribution broadens and a decrease of network robustness as directed dependency links come into play under random attacks. We also find that targeted attacks exert the biggest damage to the structure of both single and interdependent networks in k-core percolation. To strengthen the resilience of interdependent networks, we develop and propose a reinforcement strategy and obtain the critical amount of reinforced nodes analytically for interdependent Erdḧs-Renyi networks and numerically for scale-free and for random regular networks. Our mechanism leads to improvement of network stability of the West U.S. power grid. This dissertation provides us with a deeper understanding of the effects of structural features on network stability and fresher insights into designing resilient interdependent infrastructure networks.

Analytical and numerical solution for wave reflection from a porous wave absorber

NASA Astrophysics Data System (ADS)

Magdalena, Ikha; Roque, Marian P.

2018-03-01

In this paper, wave reflection from a porous wave absorber is investigated theoretically and numerically. The equations that we used are based on shallow water type model. Modification of motion inside the absorber is by including linearized friction term in momentum equation and introducing a filtered velocity. Here, an analytical solution for wave reflection coefficient from a porous wave absorber over a flat bottom is derived. Numerically, we solve the equations using the finite volume method on a staggered grid. To validate our numerical model, comparison of the numerical reflection coefficient is made against the analytical solution. Further, we implement our numerical scheme to study the evolution of surface waves pass through a porous absorber over varied bottom topography.

The Unified Lunar Control Network 2005

USGS Publications Warehouse

Archinal, Brent A.; Rosiek, Mark R.; Kirk, Randolph L.; Redding, Bonnie L.

2006-01-01

This report documents a new general unified lunar control network and lunar topographic model based on a combination of Clementine images and a previous network derived from Earth-based & Apollo photographs, and Mariner 10, & Galileo images. This photogrammetric network solution is the largest planetary control network ever completed. It includes the determination of the 3-D positions of 272,931 points on the lunar surface and the correction of the camera angles for 43,866 Clementine images, using 546,126 tie point measurements. The solution RMS is 20 ?m (= 0.9 pixels) in the image plane, with the largest residual of 6.4 pixels. The explanation given here, along with the accompanying files, comprises the release of the network information and of global lunar digital elevation models (DEMs) derived from the network. A paper that will describe the solution and network in further detail will be submitted to a refereed journal, and will include additional background information, solution details, discussion of accuracy and precision, and explanatory figures.

A GENERAL MASS-CONSERVATIVE NUMERICAL SOLUTION FOR THE UNSATURATED FLOW EQUATION

EPA Science Inventory

Numerical approximations based on different forms of the governing partial differential equation can lead to significantly different results for unsaturated flow problems. Numerical solution based on the standard h-based form of Richards equation generally yields poor results, ch...

Flow and Heat Transfer Analysis of an Eyring-Powell Fluid in a Pipe

NASA Astrophysics Data System (ADS)

Ali, N.; Nazeer, F.; Nazeer, Mubbashar

2018-02-01

The steady non-isothermal flow of an Eyring-Powell fluid in a pipe is investigated using both perturbation and numerical methods. The results are presented for two viscosity models, namely the Reynolds model and the Vogel model. The shooting method is employed to compute the numerical solution. Criteria for validity of perturbation solution are developed. When these criteria are met, it is shown that the perturbation solution is in good agreement with the numerical solution. The influence of various emerging parameters on the velocity and temperature field is also shown.

Bonding by Hydroxide-Catalyzed Hydration and Dehydration

NASA Technical Reports Server (NTRS)

Gwo, Dz-Hung

2008-01-01

A simple, inexpensive method for bonding solid objects exploits hydroxide-catalyzed hydration and dehydration to form silicate-like networks in thin surface and interfacial layers between the objects. The method can be practiced at room temperature or over a wide range of temperatures. The method was developed especially to enable the formation of precise, reliable bonds between precise optical components. The bonds thus formed exhibit the precision and transparency of bonds formed by the conventional optical-contact method and the strength and reliability of high-temperature frit bonds. The method also lends itself to numerous non-optical applications in which there are requirements for precise bonds and/or requirements for bonds, whether precise or imprecise, that can reliably withstand severe environmental conditions. Categories of such non-optical applications include forming composite materials, coating substrates, forming laminate structures, and preparing objects of defined geometry and composition. The method is applicable to materials that either (1) can form silicate-like networks in the sense that they have silicate-like molecular structures that are extensible into silicate-like networks or (2) can be chemically linked to silicate-like networks by means of hydroxide-catalyzed hydration and dehydration. When hydrated, a material of either type features surface hydroxyl (-OH) groups. In this method, a silicate-like network that bonds two substrates can be formed either by a bonding material alone or by the bonding material together with material from either or both of the substrates. Typically, an aqueous hydroxide bonding solution is dispensed and allowed to flow between the mating surfaces by capillary action. If the surface figures of the substrates do not match precisely, bonding could be improved by including a filling material in the bonding solution. Preferably, the filling material should include at least one ingredient that can be hydrated to have exposed hydroxyl groups and that can be chemically linked, by hydroxide catalysis, to a silicate-like network. The silicate-like network could be generated in situ from the filling material and/or substrate material, or could be originally present in the bonding material.

Sensitivity analysis of dynamic biological systems with time-delays.

PubMed

Wu, Wu Hsiung; Wang, Feng Sheng; Chang, Maw Shang

2010-10-15

Mathematical modeling has been applied to the study and analysis of complex biological systems for a long time. Some processes in biological systems, such as the gene expression and feedback control in signal transduction networks, involve a time delay. These systems are represented as delay differential equation (DDE) models. Numerical sensitivity analysis of a DDE model by the direct method requires the solutions of model and sensitivity equations with time-delays. The major effort is the computation of Jacobian matrix when computing the solution of sensitivity equations. The computation of partial derivatives of complex equations either by the analytic method or by symbolic manipulation is time consuming, inconvenient, and prone to introduce human errors. To address this problem, an automatic approach to obtain the derivatives of complex functions efficiently and accurately is necessary. We have proposed an efficient algorithm with an adaptive step size control to compute the solution and dynamic sensitivities of biological systems described by ordinal differential equations (ODEs). The adaptive direct-decoupled algorithm is extended to solve the solution and dynamic sensitivities of time-delay systems describing by DDEs. To save the human effort and avoid the human errors in the computation of partial derivatives, an automatic differentiation technique is embedded in the extended algorithm to evaluate the Jacobian matrix. The extended algorithm is implemented and applied to two realistic models with time-delays: the cardiovascular control system and the TNF-α signal transduction network. The results show that the extended algorithm is a good tool for dynamic sensitivity analysis on DDE models with less user intervention. By comparing with direct-coupled methods in theory, the extended algorithm is efficient, accurate, and easy to use for end users without programming background to do dynamic sensitivity analysis on complex biological systems with time-delays.

A 1D radiative transfer benchmark with polarization via doubling and adding

NASA Astrophysics Data System (ADS)

Ganapol, B. D.

2017-11-01

Highly precise numerical solutions to the radiative transfer equation with polarization present a special challenge. Here, we establish a precise numerical solution to the radiative transfer equation with combined Rayleigh and isotropic scattering in a 1D-slab medium with simple polarization. The 2-Stokes vector solution for the fully discretized radiative transfer equation in space and direction derives from the method of doubling and adding enhanced through convergence acceleration. Updates to benchmark solutions found in the literature to seven places for reflectance and transmittance as well as for angular flux follow. Finally, we conclude with the numerical solution in a partially randomly absorbing heterogeneous medium.

Improving management performance of P2PSIP for mobile sensing in wireless overlays.

PubMed

Sendín-Raña, Pablo; González-Castaño, Francisco Javier; Gómez-Cuba, Felipe; Asorey-Cacheda, Rafael; Pousada-Carballo, José María

2013-11-08

Future wireless communications are heading towards an all-Internet Protocol (all-IP) design, and will rely on the Session Initiation Protocol (SIP) to manage services, such as voice over IP (VoIP). The centralized architecture of traditional SIP has numerous disadvantages for mobile ad hoc services that may be possibly overcome by advanced peer-to-peer (P2P) technologies initially developed for the Internet. In the context of mobile sensing, P2PSIP protocols facilitate decentralized and fast communications with sensor-enabled terminals. Nevertheless, in order to make P2PSIP protocols feasible in mobile sensing networks, it is necessary to minimize overhead transmissions for signaling purposes, which reduces the battery lifetime. In this paper, we present a solution to improve the management of wireless overlay networks by defining an adaptive algorithm for the calculation of refresh time. The main advantage of the proposed algorithm is that it takes into account new parameters, such as the delay between nodes, and provides satisfactory performance and reliability levels at a much lower management overhead than previous approaches. The proposed solution can be applied to many structured P2P overlays or P2PSIP protocols. We evaluate it with Kademlia-based distributed hash tables (DHT) and dSIP.

Improving Management Performance of P2PSIP for Mobile Sensing in Wireless Overlays

PubMed Central

Sendín-Raña, Pablo; González-Castaño, Francisco Javier; Gómez-Cuba, Felipe; Asorey-Cacheda, Rafael; Pousada-Carballo, José María

2013-01-01

Future wireless communications are heading towards an all-Internet Protocol (all-IP) design, and will rely on the Session Initiation Protocol (SIP) to manage services, such as voice over IP (VoIP). The centralized architecture of traditional SIP has numerous disadvantages for mobile ad hoc services that may be possibly overcome by advanced peer-to-peer (P2P) technologies initially developed for the Internet. In the context of mobile sensing, P2PSIP protocols facilitate decentralized and fast communications with sensor-enabled terminals. Nevertheless, in order to make P2PSIP protocols feasible in mobile sensing networks, it is necessary to minimize overhead transmissions for signaling purposes, which reduces the battery lifetime. In this paper, we present a solution to improve the management of wireless overlay networks by defining an adaptive algorithm for the calculation of refresh time. The main advantage of the proposed algorithm is that it takes into account new parameters, such as the delay between nodes, and provides satisfactory performance and reliability levels at a much lower management overhead than previous approaches. The proposed solution can be applied to many structured P2P overlays or P2PSIP protocols. We evaluate it with Kademlia-based distributed hash tables (DHT) and dSIP PMID:24217358

Evolutionary optimization with data collocation for reverse engineering of biological networks.

PubMed

Tsai, Kuan-Yao; Wang, Feng-Sheng

2005-04-01

Modern experimental biology is moving away from analyses of single elements to whole-organism measurements. Such measured time-course data contain a wealth of information about the structure and dynamic of the pathway or network. The dynamic modeling of the whole systems is formulated as a reverse problem that requires a well-suited mathematical model and a very efficient computational method to identify the model structure and parameters. Numerical integration for differential equations and finding global parameter values are still two major challenges in this field of the parameter estimation of nonlinear dynamic biological systems. We compare three techniques of parameter estimation for nonlinear dynamic biological systems. In the proposed scheme, the modified collocation method is applied to convert the differential equations to the system of algebraic equations. The observed time-course data are then substituted into the algebraic system equations to decouple system interactions in order to obtain the approximate model profiles. Hybrid differential evolution (HDE) with population size of five is able to find a global solution. The method is not only suited for parameter estimation but also can be applied for structure identification. The solution obtained by HDE is then used as the starting point for a local search method to yield the refined estimates.

Predicting body fat percentage based on gender, age and BMI by using artificial neural networks.

PubMed

Kupusinac, Aleksandar; Stokić, Edita; Doroslovački, Rade

2014-02-01

In the human body, the relation between fat and fat-free mass (muscles, bones etc.) is necessary for the diagnosis of obesity and prediction of its comorbidities. Numerous formulas, such as Deurenberg et al., Gallagher et al., Jackson and Pollock, Jackson et al. etc., are available to predict body fat percentage (BF%) from gender (GEN), age (AGE) and body mass index (BMI). These formulas are all fairly similar and widely applicable, since they provide an easy, low-cost and non-invasive prediction of BF%. This paper presents a program solution for predicting BF% based on artificial neural network (ANN). ANN training, validation and testing are done by randomly divided dataset that includes 2755 subjects: 1332 women (GEN = 0) and 1423 men (GEN = 1), with AGE from 18 to 88 y and BMI from 16.60 to 64.60 kg/m(2). BF% was estimated by using Tanita bioelectrical impedance measurements (Tanita Corporation, Tokyo, Japan). ANN inputs are: GEN, AGE and BMI, and output is BF%. The predictive accuracy of our solution is 80.43%. The main goal of this paper is to promote a new approach to predicting BF% that has same complexity and costs but higher predictive accuracy than above-mentioned formulas. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

Existence and numerical simulation of periodic traveling wave solutions to the Casimir equation for the Ito system

NASA Astrophysics Data System (ADS)

Abbasbandy, S.; Van Gorder, R. A.; Hajiketabi, M.; Mesrizadeh, M.

2015-10-01

We consider traveling wave solutions to the Casimir equation for the Ito system (a two-field extension of the KdV equation). These traveling waves are governed by a nonlinear initial value problem with an interesting nonlinearity (which actually amplifies in magnitude as the size of the solution becomes small). The nonlinear problem is parameterized by two initial constant values, and we demonstrate that the existence of solutions is strongly tied to these parameter values. For our interests, we are concerned with positive, bounded, periodic wave solutions. We are able to classify parameter regimes which admit such solutions in full generality, thereby obtaining a nice existence result. Using the existence result, we are then able to numerically simulate the positive, bounded, periodic solutions. We elect to employ a group preserving scheme in order to numerically study these solutions, and an outline of this approach is provided. The numerical simulations serve to illustrate the properties of these solutions predicted analytically through the existence result. Physically, these results demonstrate the existence of a type of space-periodic structure in the Casimir equation for the Ito model, which propagates as a traveling wave.

Theory of the formation of the electric double layer at the ion exchange membrane-solution interface.

PubMed

Moya, A A

2015-02-21

This work aims to extend the study of the formation of the electric double layer at the interface defined by a solution and an ion-exchange membrane on the basis of the Nernst-Planck and Poisson equations, including different values of the counter-ion diffusion coefficient and the dielectric constant in the solution and membrane phases. The network simulation method is used to obtain the time evolution of the electric potential, the displacement electric vector, the electric charge density and the ionic concentrations at the interface between a binary electrolyte solution and a cation-exchange membrane with total co-ion exclusion. The numerical results for the temporal evolution of the interfacial electric potential and the surface electric charge are compared with analytical solutions derived in the limit of the shortest times by considering the Poisson equation for a simple cationic diffusion process. The steady-state results are justified from the Gouy-Chapman theory for the diffuse double layer in the limits of similar and high bathing ionic concentrations with respect to the fixed-charge concentration inside the membrane. Interesting new physical insights arise from the interpretation of the process of the formation of the electric double layer at the ion exchange membrane-solution interface on the basis of a membrane model with total co-ion exclusion.

Numerical study of magnetohydrodynamic viscous plasma flow in rotating porous media with Hall currents and inclined magnetic field influence

NASA Astrophysics Data System (ADS)

Bég, O. Anwar; Sim, Lik; Zueco, J.; Bhargava, R.

2010-02-01

A numerical solution is developed for the viscous, incompressible, magnetohydrodynamic flow in a rotating channel comprising two infinite parallel plates and containing a Darcian porous medium, the plates lying in the x-z plane, under constant pressure gradient. The system is subjected to a strong, inclined magnetic field orientated to the positive direction of the y-axis (rotational axis, normal to the x-z plane). The Navier-Stokes flow equations for a general rotating hydromagnetic flow are reduced to a pair of linear, viscous partial differential equations neglecting convective acceleration terms, for primary velocity (u‧) and secondary velocity (v‧) where these velocities are directed along the x and y axes. Only viscous terms are retained in the momenta equations. The model is non-dimensionalized and shown to be controlled by a number of dimensionless parameters. The resulting dimensionless ordinary differential equations are solved using a robust numerical method, Network Simulation Methodology. Full details of the numerics are provided. The present solutions are also benchmarked against the analytical solutions presented recently by Ghosh and Pop [Ghosh SK, Pop I. An analytical approach to MHD plasma behaviour of a rotating environment in the presence of an inclined magnetic field as compared to excitation frequency. Int J Appl Mech Eng 2006;11(4):845-856] for the case of a purely fluid medium (infinite permeability). We study graphically the influence of Hartmann number (Ha, magnetic field parameter), Ekman number (Ek, rotation parameter), Hall current parameter (Nh), Darcy number (Da, permeability parameter), pressure gradient (Np) and also magnetic field inclination (θ) on primary and secondary velocity fields. Additionally we investigate the effects of these multiphysical parameters on the dimensionless shear stresses at the plates. Both primary and secondary velocity are seen to be increased with a rise in Darcy number, owing to a simultaneous reduction in Darcian drag force. Primary velocity is seen to decrease with an increase in Hall current parameter (Nh) but there is a decrease in secondary velocity. The study finds important applications in magnetic materials processing, hydromagnetic plasma energy generators, magneto-geophysics and planetary astrophysics.

Effect of risk perception on epidemic spreading in temporal networks

NASA Astrophysics Data System (ADS)

Moinet, Antoine; Pastor-Satorras, Romualdo; Barrat, Alain

2018-01-01

Many progresses in the understanding of epidemic spreading models have been obtained thanks to numerous modeling efforts and analytical and numerical studies, considering host populations with very different structures and properties, including complex and temporal interaction networks. Moreover, a number of recent studies have started to go beyond the assumption of an absence of coupling between the spread of a disease and the structure of the contacts on which it unfolds. Models including awareness of the spread have been proposed, to mimic possible precautionary measures taken by individuals that decrease their risk of infection, but have mostly considered static networks. Here, we adapt such a framework to the more realistic case of temporal networks of interactions between individuals. We study the resulting model by analytical and numerical means on both simple models of temporal networks and empirical time-resolved contact data. Analytical results show that the epidemic threshold is not affected by the awareness but that the prevalence can be significantly decreased. Numerical studies on synthetic temporal networks highlight, however, the presence of very strong finite-size effects, resulting in a significant shift of the effective epidemic threshold in the presence of risk awareness. For empirical contact networks, the awareness mechanism leads as well to a shift in the effective threshold and to a strong reduction of the epidemic prevalence.

Impact of eliminating fracture intersection nodes in multiphase compositional flow simulation

NASA Astrophysics Data System (ADS)

Walton, Kenneth M.; Unger, Andre J. A.; Ioannidis, Marios A.; Parker, Beth L.

2017-04-01

Algebraic elimination of nodes at discrete fracture intersections via the star-delta technique has proven to be a valuable tool for making multiphase numerical simulations more tractable and efficient. This study examines the assumptions of the star-delta technique and exposes its effects in a 3-D, multiphase context for advective and dispersive/diffusive fluxes. Key issues of relative permeability-saturation-capillary pressure (kr-S-Pc) and capillary barriers at fracture-fracture intersections are discussed. This study uses a multiphase compositional, finite difference numerical model in discrete fracture network (DFN) and discrete fracture-matrix (DFM) modes. It verifies that the numerical model replicates analytical solutions and performs adequately in convergence exercises (conservative and decaying tracer, one and two-phase flow, DFM and DFN domains). The study culminates in simulations of a two-phase laboratory experiment in which a fluid invades a simple fracture intersection. The experiment and simulations evoke different invading fluid flow paths by varying fracture apertures as oil invades water-filled fractures and as water invades air-filled fractures. Results indicate that the node elimination technique as implemented in numerical model correctly reproduces the long-term flow path of the invading fluid, but that short-term temporal effects of the capillary traps and barriers arising from the intersection node are lost.

Seismic waveform modeling over cloud

NASA Astrophysics Data System (ADS)

Luo, Cong; Friederich, Wolfgang

2016-04-01

With the fast growing computational technologies, numerical simulation of seismic wave propagation achieved huge successes. Obtaining the synthetic waveforms through numerical simulation receives an increasing amount of attention from seismologists. However, computational seismology is a data-intensive research field, and the numerical packages usually come with a steep learning curve. Users are expected to master considerable amount of computer knowledge and data processing skills. Training users to use the numerical packages, correctly access and utilize the computational resources is a troubled task. In addition to that, accessing to HPC is also a common difficulty for many users. To solve these problems, a cloud based solution dedicated on shallow seismic waveform modeling has been developed with the state-of-the-art web technologies. It is a web platform integrating both software and hardware with multilayer architecture: a well designed SQL database serves as the data layer, HPC and dedicated pipeline for it is the business layer. Through this platform, users will no longer need to compile and manipulate various packages on the local machine within local network to perform a simulation. By providing users professional access to the computational code through its interfaces and delivering our computational resources to the users over cloud, users can customize the simulation at expert-level, submit and run the job through it.

Characterizing hydrophobicity of amino acid side chains in a protein environment via measuring contact angle of a water nanodroplet on planar peptide network

PubMed Central

Zhu, Chongqin; Gao, Yurui; Li, Hui; Meng, Sheng; Li, Lei; Francisco, Joseph S.; Zeng, Xiao Cheng

2016-01-01

Hydrophobicity of macroscopic planar surface is conventionally characterized by the contact angle of water droplets. However, this engineering measurement cannot be directly extended to surfaces of proteins, due to the nanometer scale of amino acids and inherent nonplanar structures. To measure the hydrophobicity of side chains of proteins quantitatively, numerous parameters were developed to characterize behavior of hydrophobic solvation. However, consistency among these parameters is not always apparent. Herein, we demonstrate an alternative way of characterizing hydrophobicity of amino acid side chains in a protein environment by constructing a monolayer of amino acids (i.e., artificial planar peptide network) according to the primary and the β-sheet secondary structures of protein so that the conventional engineering measurement of the contact angle of a water droplet can be brought to bear. Using molecular dynamics simulations, contact angles θ of a water nanodroplet on the planar peptide network, together with excess chemical potentials of purely repulsive methane-sized Weeks−Chandler−Andersen solute, are computed. All of the 20 types of amino acids and the corresponding planar peptide networks are studied. Expectedly, all of the planar peptide networks with nonpolar amino acids are hydrophobic due to θ > 90°, whereas all of the planar peptide networks of the polar and charged amino acids are hydrophilic due to θ < 90°. Planar peptide networks of the charged amino acids exhibit complete-wetting behavior due to θ = 0°. This computational approach for characterization of hydrophobicity can be extended to artificial planar networks of other soft matter. PMID:27803319

Analyzing milestoning networks for molecular kinetics: definitions, algorithms, and examples.

PubMed

Viswanath, Shruthi; Kreuzer, Steven M; Cardenas, Alfredo E; Elber, Ron

2013-11-07

Network representations are becoming increasingly popular for analyzing kinetic data from techniques like Milestoning, Markov State Models, and Transition Path Theory. Mapping continuous phase space trajectories into a relatively small number of discrete states helps in visualization of the data and in dissecting complex dynamics to concrete mechanisms. However, not only are molecular networks derived from molecular dynamics simulations growing in number, they are also getting increasingly complex, owing partly to the growth in computer power that allows us to generate longer and better converged trajectories. The increased complexity of the networks makes simple interpretation and qualitative insight of the molecular systems more difficult to achieve. In this paper, we focus on various network representations of kinetic data and algorithms to identify important edges and pathways in these networks. The kinetic data can be local and partial (such as the value of rate coefficients between states) or an exact solution to kinetic equations for the entire system (such as the stationary flux between vertices). In particular, we focus on the Milestoning method that provides fluxes as the main output. We proposed Global Maximum Weight Pathways as a useful tool for analyzing molecular mechanism in Milestoning networks. A closely related definition was made in the context of Transition Path Theory. We consider three algorithms to find Global Maximum Weight Pathways: Recursive Dijkstra's, Edge-Elimination, and Edge-List Bisection. The asymptotic efficiency of the algorithms is analyzed and numerical tests on finite networks show that Edge-List Bisection and Recursive Dijkstra's algorithms are most efficient for sparse and dense networks, respectively. Pathways are illustrated for two examples: helix unfolding and membrane permeation. Finally, we illustrate that networks based on local kinetic information can lead to incorrect interpretation of molecular mechanisms.

Numerically solving the relativistic Grad-Shafranov equation in Kerr spacetimes: numerical techniques

NASA Astrophysics Data System (ADS)

Mahlmann, J. F.; Cerdá-Durán, P.; Aloy, M. A.

2018-07-01

The study of the electrodynamics of static, axisymmetric, and force-free Kerr magnetospheres relies vastly on solutions of the so-called relativistic Grad-Shafranov equation (GSE). Different numerical approaches to the solution of the GSE have been introduced in the literature, but none of them has been fully assessed from the numerical point of view in terms of efficiency and quality of the solutions found. We present a generalization of these algorithms and give a detailed background on the algorithmic implementation. We assess the numerical stability of the implemented algorithms and quantify the convergence of the presented methodology for the most established set-ups (split-monopole, paraboloidal, BH disc, uniform).

Numerically solving the relativistic Grad-Shafranov equation in Kerr spacetimes: Numerical techniques

NASA Astrophysics Data System (ADS)

Mahlmann, J. F.; Cerdá-Durán, P.; Aloy, M. A.

2018-04-01

The study of the electrodynamics of static, axisymmetric and force-free Kerr magnetospheres relies vastly on solutions of the so called relativistic Grad-Shafranov equation (GSE). Different numerical approaches to the solution of the GSE have been introduced in the literature, but none of them has been fully assessed from the numerical point of view in terms of efficiency and quality of the solutions found. We present a generalization of these algorithms and give detailed background on the algorithmic implementation. We assess the numerical stability of the implemented algorithms and quantify the convergence of the presented methodology for the most established setups (split-monopole, paraboloidal, BH-disk, uniform).

A numerical method for osmotic water flow and solute diffusion with deformable membrane boundaries in two spatial dimension

NASA Astrophysics Data System (ADS)

Yao, Lingxing; Mori, Yoichiro

2017-12-01

Osmotic forces and solute diffusion are increasingly seen as playing a fundamental role in cell movement. Here, we present a numerical method that allows for studying the interplay between diffusive, osmotic and mechanical effects. An osmotically active solute obeys a advection-diffusion equation in a region demarcated by a deformable membrane. The interfacial membrane allows transmembrane water flow which is determined by osmotic and mechanical pressure differences across the membrane. The numerical method is based on an immersed boundary method for fluid-structure interaction and a Cartesian grid embedded boundary method for the solute. We demonstrate our numerical algorithm with the test case of an osmotic engine, a recently proposed mechanism for cell propulsion.

Optimal Micropatterns in 2D Transport Networks and Their Relation to Image Inpainting

NASA Astrophysics Data System (ADS)

Brancolini, Alessio; Rossmanith, Carolin; Wirth, Benedikt

2018-04-01

We consider two different variational models of transport networks: the so-called branched transport problem and the urban planning problem. Based on a novel relation to Mumford-Shah image inpainting and techniques developed in that field, we show for a two-dimensional situation that both highly non-convex network optimization tasks can be transformed into a convex variational problem, which may be very useful from analytical and numerical perspectives. As applications of the convex formulation, we use it to perform numerical simulations (to our knowledge this is the first numerical treatment of urban planning), and we prove a lower bound for the network cost that matches a known upper bound (in terms of how the cost scales in the model parameters) which helps better understand optimal networks and their minimal costs.

Influence of the Numerical Scheme on the Solution Quality of the SWE for Tsunami Numerical Codes: The Tohoku-Oki, 2011Example.

NASA Astrophysics Data System (ADS)

Reis, C.; Clain, S.; Figueiredo, J.; Baptista, M. A.; Miranda, J. M. A.

2015-12-01

Numerical tools turn to be very important for scenario evaluations of hazardous phenomena such as tsunami. Nevertheless, the predictions highly depends on the numerical tool quality and the design of efficient numerical schemes still receives important attention to provide robust and accurate solutions. In this study we propose a comparative study between the efficiency of two volume finite numerical codes with second-order discretization implemented with different method to solve the non-conservative shallow water equations, the MUSCL (Monotonic Upstream-Centered Scheme for Conservation Laws) and the MOOD methods (Multi-dimensional Optimal Order Detection) which optimize the accuracy of the approximation in function of the solution local smoothness. The MUSCL is based on a priori criteria where the limiting procedure is performed before updated the solution to the next time-step leading to non-necessary accuracy reduction. On the contrary, the new MOOD technique uses a posteriori detectors to prevent the solution from oscillating in the vicinity of the discontinuities. Indeed, a candidate solution is computed and corrections are performed only for the cells where non-physical oscillations are detected. Using a simple one-dimensional analytical benchmark, 'Single wave on a sloping beach', we show that the classical 1D shallow-water system can be accurately solved with the finite volume method equipped with the MOOD technique and provide better approximation with sharper shock and less numerical diffusion. For the code validation, we also use the Tohoku-Oki 2011 tsunami and reproduce two DART records, demonstrating that the quality of the solution may deeply interfere with the scenario one can assess. This work is funded by the Portugal-France research agreement, through the research project GEONUM FCT-ANR/MAT-NAN/0122/2012.Numerical tools turn to be very important for scenario evaluations of hazardous phenomena such as tsunami. Nevertheless, the predictions highly depends on the numerical tool quality and the design of efficient numerical schemes still receives important attention to provide robust and accurate solutions. In this study we propose a comparative study between the efficiency of two volume finite numerical codes with second-order discretization implemented with different method to solve the non-conservative shallow water equations, the MUSCL (Monotonic Upstream-Centered Scheme for Conservation Laws) and the MOOD methods (Multi-dimensional Optimal Order Detection) which optimize the accuracy of the approximation in function of the solution local smoothness. The MUSCL is based on a priori criteria where the limiting procedure is performed before updated the solution to the next time-step leading to non-necessary accuracy reduction. On the contrary, the new MOOD technique uses a posteriori detectors to prevent the solution from oscillating in the vicinity of the discontinuities. Indeed, a candidate solution is computed and corrections are performed only for the cells where non-physical oscillations are detected. Using a simple one-dimensional analytical benchmark, 'Single wave on a sloping beach', we show that the classical 1D shallow-water system can be accurately solved with the finite volume method equipped with the MOOD technique and provide better approximation with sharper shock and less numerical diffusion. For the code validation, we also use the Tohoku-Oki 2011 tsunami and reproduce two DART records, demonstrating that the quality of the solution may deeply interfere with the scenario one can assess. This work is funded by the Portugal-France research agreement, through the research project GEONUM FCT-ANR/MAT-NAN/0122/2012.

Integrating legacy medical data sensors in a wireless network infrastucture.

PubMed

Dembeyiotis, S; Konnis, G; Koutsouris, D

2005-01-01

In the process of developing a wireless networking solution to provide effective field-deployable communications and telemetry support for rescuers during major natural disasters, we are faced with the task of interfacing the multitude of medical and other legacy data collection sensors to the network grid. In this paper, we detail a number of solutions, with particular attention given to the issue of data security. The chosen implementation allows for sensor control and management from remote network locations, while the sensors can wirelessly transmit their data to nearby network nodes securely, utilizing the latest commercially available cryptography solutions. Initial testing validates the design choices, while the network-enabled sensors are being integrated in the overall wireless network security framework.

76 FR 25310 - Notice of Intent To Grant a Partially Exclusive Patent License to videoNEXT Network Solutions, Inc.

Federal Register 2010, 2011, 2012, 2013, 2014

2011-05-04

... DEPARTMENT OF DEFENSE Department of the Army Notice of Intent To Grant a Partially Exclusive Patent License to videoNEXT Network Solutions, Inc. AGENCY: Department of the Army, DoD. ACTION: Notice... notice of its intent to grant to videoNEXT Network Solutions, Inc., a corporation having its principle...

Exponential Stability of Almost Periodic Solutions for Memristor-Based Neural Networks with Distributed Leakage Delays.

PubMed

Xu, Changjin; Li, Peiluan; Pang, Yicheng

2016-12-01

In this letter, we deal with a class of memristor-based neural networks with distributed leakage delays. By applying a new Lyapunov function method, we obtain some sufficient conditions that ensure the existence, uniqueness, and global exponential stability of almost periodic solutions of neural networks. We apply the results of this solution to prove the existence and stability of periodic solutions for this delayed neural network with periodic coefficients. We then provide an example to illustrate the effectiveness of the theoretical results. Our results are completely new and complement the previous studies Chen, Zeng, and Jiang ( 2014 ) and Jiang, Zeng, and Chen ( 2015 ).

Improving BeiDou real-time precise point positioning with numerical weather models

NASA Astrophysics Data System (ADS)

Lu, Cuixian; Li, Xingxing; Zus, Florian; Heinkelmann, Robert; Dick, Galina; Ge, Maorong; Wickert, Jens; Schuh, Harald

2017-09-01

Precise positioning with the current Chinese BeiDou Navigation Satellite System is proven to be of comparable accuracy to the Global Positioning System, which is at centimeter level for the horizontal components and sub-decimeter level for the vertical component. But the BeiDou precise point positioning (PPP) shows its limitation in requiring a relatively long convergence time. In this study, we develop a numerical weather model (NWM) augmented PPP processing algorithm to improve BeiDou precise positioning. Tropospheric delay parameters, i.e., zenith delays, mapping functions, and horizontal delay gradients, derived from short-range forecasts from the Global Forecast System of the National Centers for Environmental Prediction (NCEP) are applied into BeiDou real-time PPP. Observational data from stations that are capable of tracking the BeiDou constellation from the International GNSS Service (IGS) Multi-GNSS Experiments network are processed, with the introduced NWM-augmented PPP and the standard PPP processing. The accuracy of tropospheric delays derived from NCEP is assessed against with the IGS final tropospheric delay products. The positioning results show that an improvement in convergence time up to 60.0 and 66.7% for the east and vertical components, respectively, can be achieved with the NWM-augmented PPP solution compared to the standard PPP solutions, while only slight improvement in the solution convergence can be found for the north component. A positioning accuracy of 5.7 and 5.9 cm for the east component is achieved with the standard PPP that estimates gradients and the one that estimates no gradients, respectively, in comparison to 3.5 cm of the NWM-augmented PPP, showing an improvement of 38.6 and 40.1%. Compared to the accuracy of 3.7 and 4.1 cm for the north component derived from the two standard PPP solutions, the one of the NWM-augmented PPP solution is improved to 2.0 cm, by about 45.9 and 51.2%. The positioning accuracy for the up component improves from 11.4 and 13.2 cm with the two standard PPP solutions to 8.0 cm with the NWM-augmented PPP solution, an improvement of 29.8 and 39.4%, respectively.

Second-order numerical methods for multi-term fractional differential equations: Smooth and non-smooth solutions

NASA Astrophysics Data System (ADS)

Zeng, Fanhai; Zhang, Zhongqiang; Karniadakis, George Em

2017-12-01

Starting with the asymptotic expansion of the error equation of the shifted Gr\\"{u}nwald--Letnikov formula, we derive a new modified weighted shifted Gr\\"{u}nwald--Letnikov (WSGL) formula by introducing appropriate correction terms. We then apply one special case of the modified WSGL formula to solve multi-term fractional ordinary and partial differential equations, and we prove the linear stability and second-order convergence for both smooth and non-smooth solutions. We show theoretically and numerically that numerical solutions up to certain accuracy can be obtained with only a few correction terms. Moreover, the correction terms can be tuned according to the fractional derivative orders without explicitly knowing the analytical solutions. Numerical simulations verify the theoretical results and demonstrate that the new formula leads to better performance compared to other known numerical approximations with similar resolution.

The Inverse Contagion Problem (ICP) vs.. Predicting site contagion in real time, when network links are not observable

NASA Astrophysics Data System (ADS)

Mushkin, I.; Solomon, S.

2017-10-01

We study the inverse contagion problem (ICP). As opposed to the direct contagion problem, in which the network structure is known and the question is when each node will be contaminated, in the inverse problem the links of the network are unknown but a sequence of contagion histories (the times when each node was contaminated) is observed. We consider two versions of the ICP: The strong problem (SICP), which is the reconstruction of the network and has been studied before, and the weak problem (WICP), which requires "only" the prediction (at each time step) of the nodes that will be contaminated at the next time step (this is often the real life situation in which a contagion is observed and predictions are made in real time). Moreover, our focus is on analyzing the increasing accuracy of the solution, as a function of the number of contagion histories already observed. For simplicity, we discuss the simplest (deterministic and synchronous) contagion dynamics and the simplest solution algorithm, which we have applied to different network types. The main result of this paper is that the complex problem of the convergence of the ICP for a network can be reduced to an individual property of pairs of nodes: the "false link difficulty". By definition, given a pair of unlinked nodes i and j, the difficulty of the false link (i,j) is the probability that in a random contagion history, the nodes i and j are not contaminated at the same time step (or at consecutive time steps). In other words, the "false link difficulty" of a non-existing network link is the probability that the observations during a random contagion history would not rule out that link. This probability is relatively straightforward to calculate, and in most instances relies only on the relative positions of the two nodes (i,j) and not on the entire network structure. We have observed the distribution of false link difficulty for various network types, estimated it theoretically and confronted it (successfully) with the numerical simulations. Based on it, we estimated analytically the convergence of the ICP solution (as a function of the number of contagion histories observed), and found it to be in perfect agreement with simulation results. Finally, the most important insight we obtained is that SICP and WICP are have quite different properties: if one in interested only in the operational aspect of predicting how contagion will spread, the links which are most difficult to decide about are the least influential on contagion dynamics. In other words, the parts of the network which are harder to reconstruct are also least important for predicting the contagion dynamics, up to the point where a (large) constant number of false links in the network (i.e. non-convergence of the network reconstruction procedure) implies a zero rate of the node contagion prediction errors (perfect convergence of the WICP). Thus, the contagion prediction problem (WICP) difficulty is very different from the network reconstruction problem (SICP), in as far as links which are difficult to reconstruct are quite harmless in terms of contagion prediction capability (WICP).

A methodological approach to the analysis of egocentric social networks in public health research: a practical example.

PubMed

Djomba, Janet Klara; Zaletel-Kragelj, Lijana

2016-12-01

Research on social networks in public health focuses on how social structures and relationships influence health and health-related behaviour. While the sociocentric approach is used to study complete social networks, the egocentric approach is gaining popularity because of its focus on individuals, groups and communities. One of the participants of the healthy lifestyle health education workshop 'I'm moving', included in the study of social support for exercise was randomly selected. The participant was denoted as the ego and members of her/his social network as the alteri. Data were collected by personal interviews using a self-made questionnaire. Numerical methods and computer programmes for the analysis of social networks were used for the demonstration of analysis. The size, composition and structure of the egocentric social network were obtained by a numerical analysis. The analysis of composition included homophily and homogeneity. Moreover, the analysis of the structure included the degree of the egocentric network, the strength of the ego-alter ties and the average strength of ties. Visualisation of the network was performed by three freely available computer programmes, namely: Egonet.QF, E-net and Pajek. The computer programmes were described and compared by their usefulness. Both numerical analysis and visualisation have their benefits. The decision what approach to use is depending on the purpose of the social network analysis. While the numerical analysis can be used in large-scale population-based studies, visualisation of personal networks can help health professionals at creating, performing and evaluation of preventive programmes, especially if focused on behaviour change.

Numerical techniques for the solution of the compressible Navier-Stokes equations and implementation of turbulence models. [separated turbulent boundary layer flow problems

NASA Technical Reports Server (NTRS)

Baldwin, B. S.; Maccormack, R. W.; Deiwert, G. S.

1975-01-01

The time-splitting explicit numerical method of MacCormack is applied to separated turbulent boundary layer flow problems. Modifications of this basic method are developed to counter difficulties associated with complicated geometry and severe numerical resolution requirements of turbulence model equations. The accuracy of solutions is investigated by comparison with exact solutions for several simple cases. Procedures are developed for modifying the basic method to improve the accuracy. Numerical solutions of high-Reynolds-number separated flows over an airfoil and shock-separated flows over a flat plate are obtained. A simple mixing length model of turbulence is used for the transonic flow past an airfoil. A nonorthogonal mesh of arbitrary configuration facilitates the description of the flow field. For the simpler geometry associated with the flat plate, a rectangular mesh is used, and solutions are obtained based on a two-equation differential model of turbulence.

Bäcklund transformation, analytic soliton solutions and numerical simulation for a (2+1)-dimensional complex Ginzburg-Landau equation in a nonlinear fiber

NASA Astrophysics Data System (ADS)

Yu, Ming-Xiao; Tian, Bo; Chai, Jun; Yin, Hui-Min; Du, Zhong

2017-10-01

In this paper, we investigate a nonlinear fiber described by a (2+1)-dimensional complex Ginzburg-Landau equation with the chromatic dispersion, optical filtering, nonlinear and linear gain. Bäcklund transformation in the bilinear form is constructed. With the modified bilinear method, analytic soliton solutions are obtained. For the soliton, the amplitude can decrease or increase when the absolute value of the nonlinear or linear gain is enlarged, and the width can be compressed or amplified when the absolute value of the chromatic dispersion or optical filtering is enhanced. We study the stability of the numerical solutions numerically by applying the increasing amplitude, embedding the white noise and adding the Gaussian pulse to the initial values based on the analytic solutions, which shows that the numerical solutions are stable, not influenced by the finite initial perturbations.

Numerical modeling of the radiative transfer in a turbid medium using the synthetic iteration.

PubMed

Budak, Vladimir P; Kaloshin, Gennady A; Shagalov, Oleg V; Zheltov, Victor S

2015-07-27

In this paper we propose the fast, but the accurate algorithm for numerical modeling of light fields in the turbid media slab. For the numerical solution of the radiative transfer equation (RTE) it is required its discretization based on the elimination of the solution anisotropic part and the replacement of the scattering integral by a finite sum. The solution regular part is determined numerically. A good choice of the method of the solution anisotropic part elimination determines the high convergence of the algorithm in the mean square metric. The method of synthetic iterations can be used to improve the convergence in the uniform metric. A significant increase in the solution accuracy with the use of synthetic iterations allows applying the two-stream approximation for the regular part determination. This approach permits to generalize the proposed method in the case of an arbitrary 3D geometry of the medium.

Meta-path based heterogeneous combat network link prediction

NASA Astrophysics Data System (ADS)

Li, Jichao; Ge, Bingfeng; Yang, Kewei; Chen, Yingwu; Tan, Yuejin

2017-09-01

The combat system-of-systems in high-tech informative warfare, composed of many interconnected combat systems of different types, can be regarded as a type of complex heterogeneous network. Link prediction for heterogeneous combat networks (HCNs) is of significant military value, as it facilitates reconfiguring combat networks to represent the complex real-world network topology as appropriate with observed information. This paper proposes a novel integrated methodology framework called HCNMP (HCN link prediction based on meta-path) to predict multiple types of links simultaneously for an HCN. More specifically, the concept of HCN meta-paths is introduced, through which the HCNMP can accumulate information by extracting different features of HCN links for all the six defined types. Next, an HCN link prediction model, based on meta-path features, is built to predict all types of links of the HCN simultaneously. Then, the solution algorithm for the HCN link prediction model is proposed, in which the prediction results are obtained by iteratively updating with the newly predicted results until the results in the HCN converge or reach a certain maximum iteration number. Finally, numerical experiments on the dataset of a real HCN are conducted to demonstrate the feasibility and effectiveness of the proposed HCNMP, in comparison with 30 baseline methods. The results show that the performance of the HCNMP is superior to those of the baseline methods.

Trail-Based Search for Efficient Event Report to Mobile Actors in Wireless Sensor and Actor Networks.

PubMed

Xu, Zhezhuang; Liu, Guanglun; Yan, Haotian; Cheng, Bin; Lin, Feilong

2017-10-27

In wireless sensor and actor networks, when an event is detected, the sensor node needs to transmit an event report to inform the actor. Since the actor moves in the network to execute missions, its location is always unavailable to the sensor nodes. A popular solution is the search strategy that can forward the data to a node without its location information. However, most existing works have not considered the mobility of the node, and thus generate significant energy consumption or transmission delay. In this paper, we propose the trail-based search (TS) strategy that takes advantage of actor's mobility to improve the search efficiency. The main idea of TS is that, when the actor moves in the network, it can leave its trail composed of continuous footprints. The search packet with the event report is transmitted in the network to search the actor or its footprints. Once an effective footprint is discovered, the packet will be forwarded along the trail until it is received by the actor. Moreover, we derive the condition to guarantee the trail connectivity, and propose the redundancy reduction scheme based on TS (TS-R) to reduce nontrivial transmission redundancy that is generated by the trail. The theoretical and numerical analysis is provided to prove the efficiency of TS. Compared with the well-known expanding ring search (ERS), TS significantly reduces the energy consumption and search delay.

Wireless sensor placement for structural monitoring using information-fusing firefly algorithm

NASA Astrophysics Data System (ADS)

Zhou, Guang-Dong; Yi, Ting-Hua; Xie, Mei-Xi; Li, Hong-Nan

2017-10-01

Wireless sensor networks (WSNs) are promising technology in structural health monitoring (SHM) applications for their low cost and high efficiency. The limited wireless sensors and restricted power resources in WSNs highlight the significance of optimal wireless sensor placement (OWSP) during designing SHM systems to enable the most useful information to be captured and to achieve the longest network lifetime. This paper presents a holistic approach, including an optimization criterion and a solution algorithm, for optimally deploying self-organizing multi-hop WSNs on large-scale structures. The combination of information effectiveness represented by the modal independence and the network performance specified by the network connectivity and network lifetime is first formulated to evaluate the performance of wireless sensor configurations. Then, an information-fusing firefly algorithm (IFFA) is developed to solve the OWSP problem. The step sizes drawn from a Lévy distribution are adopted to drive fireflies toward brighter individuals. Following the movement with Lévy flights, information about the contributions of wireless sensors to the objective function as carried by the fireflies is fused and applied to move inferior wireless sensors to better locations. The reliability of the proposed approach is verified via a numerical example on a long-span suspension bridge. The results demonstrate that the evaluation criterion provides a good performance metric of wireless sensor configurations, and the IFFA outperforms the simple discrete firefly algorithm.

On the Optimization of a Probabilistic Data Aggregation Framework for Energy Efficiency in Wireless Sensor Networks.

PubMed

Kafetzoglou, Stella; Aristomenopoulos, Giorgos; Papavassiliou, Symeon

2015-08-11

Among the key aspects of the Internet of Things (IoT) is the integration of heterogeneous sensors in a distributed system that performs actions on the physical world based on environmental information gathered by sensors and application-related constraints and requirements. Numerous applications of Wireless Sensor Networks (WSNs) have appeared in various fields, from environmental monitoring, to tactical fields, and healthcare at home, promising to change our quality of life and facilitating the vision of sensor network enabled smart cities. Given the enormous requirements that emerge in such a setting-both in terms of data and energy-data aggregation appears as a key element in reducing the amount of traffic in wireless sensor networks and achieving energy conservation. Probabilistic frameworks have been introduced as operational efficient and performance effective solutions for data aggregation in distributed sensor networks. In this work, we introduce an overall optimization approach that improves and complements such frameworks towards identifying the optimal probability for a node to aggregate packets as well as the optimal aggregation period that a node should wait for performing aggregation, so as to minimize the overall energy consumption, while satisfying certain imposed delay constraints. Primal dual decomposition is employed to solve the corresponding optimization problem while simulation results demonstrate the operational efficiency of the proposed approach under different traffic and topology scenarios.

Suppressing epidemics on networks by exploiting observer nodes.

PubMed

Takaguchi, Taro; Hasegawa, Takehisa; Yoshida, Yuichi

2014-07-01

To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immune. We numerically show that random placement of observer nodes works better on networks with clustering than on locally treelike networks, implying that our model is promising for realistic social networks. The efficiency of several heuristic schemes for observer placement is also examined for synthetic and empirical networks. In parallel with numerical simulations of epidemic dynamics, we also show that the effect of observer placement can be assessed by the size of the largest connected component of networks remaining after removing observer nodes and links between their neighboring nodes.

Suppressing epidemics on networks by exploiting observer nodes

NASA Astrophysics Data System (ADS)

Takaguchi, Taro; Hasegawa, Takehisa; Yoshida, Yuichi

2014-07-01

To control infection spreading on networks, we investigate the effect of observer nodes that recognize infection in a neighboring node and make the rest of the neighbor nodes immune. We numerically show that random placement of observer nodes works better on networks with clustering than on locally treelike networks, implying that our model is promising for realistic social networks. The efficiency of several heuristic schemes for observer placement is also examined for synthetic and empirical networks. In parallel with numerical simulations of epidemic dynamics, we also show that the effect of observer placement can be assessed by the size of the largest connected component of networks remaining after removing observer nodes and links between their neighboring nodes.

An improved conjugate gradient scheme to the solution of least squares SVM.

PubMed

Chu, Wei; Ong, Chong Jin; Keerthi, S Sathiya

2005-03-01

The least square support vector machines (LS-SVM) formulation corresponds to the solution of a linear system of equations. Several approaches to its numerical solutions have been proposed in the literature. In this letter, we propose an improved method to the numerical solution of LS-SVM and show that the problem can be solved using one reduced system of linear equations. Compared with the existing algorithm for LS-SVM, the approach used in this letter is about twice as efficient. Numerical results using the proposed method are provided for comparisons with other existing algorithms.

Numerical Solution of the Electron Transport Equation in the Upper Atmosphere

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

Woods, Mark Christopher; Holmes, Mark; Sailor, William C

A new approach for solving the electron transport equation in the upper atmosphere is derived. The problem is a very stiff boundary value problem, and to obtain an accurate numerical solution, matrix factorizations are used to decouple the fast and slow modes. A stable finite difference method is applied to each mode. This solver is applied to a simplifieed problem for which an exact solution exists using various versions of the boundary conditions that might arise in a natural auroral display. The numerical and exact solutions are found to agree with each other to at least two significant digits.

Graphics Processing Unit–Enhanced Genetic Algorithms for Solving the Temporal Dynamics of Gene Regulatory Networks

PubMed Central

García-Calvo, Raúl; Guisado, JL; Diaz-del-Rio, Fernando; Córdoba, Antonio; Jiménez-Morales, Francisco

2018-01-01

Understanding the regulation of gene expression is one of the key problems in current biology. A promising method for that purpose is the determination of the temporal dynamics between known initial and ending network states, by using simple acting rules. The huge amount of rule combinations and the nonlinear inherent nature of the problem make genetic algorithms an excellent candidate for finding optimal solutions. As this is a computationally intensive problem that needs long runtimes in conventional architectures for realistic network sizes, it is fundamental to accelerate this task. In this article, we study how to develop efficient parallel implementations of this method for the fine-grained parallel architecture of graphics processing units (GPUs) using the compute unified device architecture (CUDA) platform. An exhaustive and methodical study of various parallel genetic algorithm schemes—master-slave, island, cellular, and hybrid models, and various individual selection methods (roulette, elitist)—is carried out for this problem. Several procedures that optimize the use of the GPU’s resources are presented. We conclude that the implementation that produces better results (both from the performance and the genetic algorithm fitness perspectives) is simulating a few thousands of individuals grouped in a few islands using elitist selection. This model comprises 2 mighty factors for discovering the best solutions: finding good individuals in a short number of generations, and introducing genetic diversity via a relatively frequent and numerous migration. As a result, we have even found the optimal solution for the analyzed gene regulatory network (GRN). In addition, a comparative study of the performance obtained by the different parallel implementations on GPU versus a sequential application on CPU is carried out. In our tests, a multifold speedup was obtained for our optimized parallel implementation of the method on medium class GPU over an equivalent sequential single-core implementation running on a recent Intel i7 CPU. This work can provide useful guidance to researchers in biology, medicine, or bioinformatics in how to take advantage of the parallelization on massively parallel devices and GPUs to apply novel metaheuristic algorithms powered by nature for real-world applications (like the method to solve the temporal dynamics of GRNs). PMID:29662297

Graphics Processing Unit-Enhanced Genetic Algorithms for Solving the Temporal Dynamics of Gene Regulatory Networks.

PubMed

García-Calvo, Raúl; Guisado, J L; Diaz-Del-Rio, Fernando; Córdoba, Antonio; Jiménez-Morales, Francisco

2018-01-01

Understanding the regulation of gene expression is one of the key problems in current biology. A promising method for that purpose is the determination of the temporal dynamics between known initial and ending network states, by using simple acting rules. The huge amount of rule combinations and the nonlinear inherent nature of the problem make genetic algorithms an excellent candidate for finding optimal solutions. As this is a computationally intensive problem that needs long runtimes in conventional architectures for realistic network sizes, it is fundamental to accelerate this task. In this article, we study how to develop efficient parallel implementations of this method for the fine-grained parallel architecture of graphics processing units (GPUs) using the compute unified device architecture (CUDA) platform. An exhaustive and methodical study of various parallel genetic algorithm schemes-master-slave, island, cellular, and hybrid models, and various individual selection methods (roulette, elitist)-is carried out for this problem. Several procedures that optimize the use of the GPU's resources are presented. We conclude that the implementation that produces better results (both from the performance and the genetic algorithm fitness perspectives) is simulating a few thousands of individuals grouped in a few islands using elitist selection. This model comprises 2 mighty factors for discovering the best solutions: finding good individuals in a short number of generations, and introducing genetic diversity via a relatively frequent and numerous migration. As a result, we have even found the optimal solution for the analyzed gene regulatory network (GRN). In addition, a comparative study of the performance obtained by the different parallel implementations on GPU versus a sequential application on CPU is carried out. In our tests, a multifold speedup was obtained for our optimized parallel implementation of the method on medium class GPU over an equivalent sequential single-core implementation running on a recent Intel i7 CPU. This work can provide useful guidance to researchers in biology, medicine, or bioinformatics in how to take advantage of the parallelization on massively parallel devices and GPUs to apply novel metaheuristic algorithms powered by nature for real-world applications (like the method to solve the temporal dynamics of GRNs).

Zephyr: Open-source Parallel Seismic Waveform Inversion in an Integrated Python-based Framework

NASA Astrophysics Data System (ADS)

Smithyman, B. R.; Pratt, R. G.; Hadden, S. M.

2015-12-01

Seismic Full-Waveform Inversion (FWI) is an advanced method to reconstruct wave properties of materials in the Earth from a series of seismic measurements. These methods have been developed by researchers since the late 1980s, and now see significant interest from the seismic exploration industry. As researchers move towards implementing advanced numerical modelling (e.g., 3D, multi-component, anisotropic and visco-elastic physics), it is desirable to make use of a modular approach, minimizing the effort developing a new set of tools for each new numerical problem. SimPEG (http://simpeg.xyz) is an open source project aimed at constructing a general framework to enable geophysical inversion in various domains. In this abstract we describe Zephyr (https://github.com/bsmithyman/zephyr), which is a coupled research project focused on parallel FWI in the seismic context. The software is built on top of Python, Numpy and IPython, which enables very flexible testing and implementation of new features. Zephyr is an open source project, and is released freely to enable reproducible research. We currently implement a parallel, distributed seismic forward modelling approach that solves the 2.5D (two-and-one-half dimensional) viscoacoustic Helmholtz equation at a range modelling frequencies, generating forward solutions for a given source behaviour, and gradient solutions for a given set of observed data. Solutions are computed in a distributed manner on a set of heterogeneous workers. The researcher's frontend computer may be separated from the worker cluster by a network link to enable full support for computation on remote clusters from individual workstations or laptops. The present codebase introduces a numerical discretization equivalent to that used by FULLWV, a well-known seismic FWI research codebase. This makes it straightforward to compare results from Zephyr directly with FULLWV. The flexibility introduced by the use of a Python programming environment makes extension of the codebase with new methods much more straightforward. This enables comparison and integration of new efforts with existing results.

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.

Complete Numerical Solution of the Diffusion Equation of Random Genetic Drift

PubMed Central

Zhao, Lei; Yue, Xingye; Waxman, David

2013-01-01

A numerical method is presented to solve the diffusion equation for the random genetic drift that occurs at a single unlinked locus with two alleles. The method was designed to conserve probability, and the resulting numerical solution represents a probability distribution whose total probability is unity. We describe solutions of the diffusion equation whose total probability is unity as complete. Thus the numerical method introduced in this work produces complete solutions, and such solutions have the property that whenever fixation and loss can occur, they are automatically included within the solution. This feature demonstrates that the diffusion approximation can describe not only internal allele frequencies, but also the boundary frequencies zero and one. The numerical approach presented here constitutes a single inclusive framework from which to perform calculations for random genetic drift. It has a straightforward implementation, allowing it to be applied to a wide variety of problems, including those with time-dependent parameters, such as changing population sizes. As tests and illustrations of the numerical method, it is used to determine: (i) the probability density and time-dependent probability of fixation for a neutral locus in a population of constant size; (ii) the probability of fixation in the presence of selection; and (iii) the probability of fixation in the presence of selection and demographic change, the latter in the form of a changing population size. PMID:23749318

GraphStore: A Distributed Graph Storage System for Big Data Networks

ERIC Educational Resources Information Center

Martha, VenkataSwamy

2013-01-01

Networks, such as social networks, are a universal solution for modeling complex problems in real time, especially in the Big Data community. While previous studies have attempted to enhance network processing algorithms, none have paved a path for the development of a persistent storage system. The proposed solution, GraphStore, provides an…

Intracortical stiffness of mid-diaphysis femur bovine bone: lacunar-canalicular based homogenization numerical solutions and microhardness measurements.

PubMed

Hage, Ilige S; Hamade, Ramsey F

2017-09-01

Microscale lacunar-canalicular (L-C) porosity is a major contributor to intracortical bone stiffness variability. In this work, such variability is investigated experimentally using micro hardness indentation tests and numerically using a homogenization scheme. Cross sectional rings of cortical bones are cut from the middle tubular part of bovine femur long bone at mid-diaphysis. A series of light microscopy images are taken along a line emanating from the cross-section center starting from the ring's interior (endosteum) ring surface toward the ring's exterior (periosteum) ring surface. For each image in the line, computer vision analysis of porosity is conducted employing an image segmentation methodology based on pulse coupled neural networks (PCNN) recently developed by the authors. Determined are size and shape of each of the lacunar-canalicular (L-C) cortical micro constituents: lacunae, canaliculi, and Haversian canals. Consequently, it was possible to segment and quantify the geometrical attributes of all individual segmented pores leading to accurate determination of derived geometrical measures such as L-C cortical pores' total porosity (pore volume fraction), (elliptical) aspect ratio, orientation, location, and number of pores in secondary and primary osteons. Porosity was found to be unevenly (but linearly) distributed along the interior and exterior regions of the intracortical bone. The segmented L-C porosity data is passed to a numerical microscale-based homogenization scheme, also recently developed by the authors, that analyses a composite made up of lamella matrix punctuated by multi-inclusions and returns corresponding values for longitudinal and transverse Young's modulus (matrix stiffness) for these micro-sized spatial locations. Hence, intracortical stiffness variability is numerically quantified using a combination of computer vision program and numerical homogenization code. These numerically found stiffness values of the homogenization solution are corroborated experimentally using microhardness indentation measurements taken at the same points that the digital images were taken along a radial distance emanating from the interior (endosteum) surface toward the bone's exterior (periosteum) surface. Good agreement was found between numerically calculated and indentation measured stiffness of Intracortical lamellae. Both indentation measurements and numerical solutions of matrix stiffness showed increasing linear trend of compressive longitudinal modulus (E11) values vs. radial position for both interior and exterior regions. In the interior (exterior) region of cortical bone, stiffness modulus values were found to range from 18.5 to 23.4 GPa (23 to 26.0 GPa) with the aggregate stiffness of the cortical lamella in the exterior region being 12% stiffer than that in the interior region. In order to further validate these findings, experimental and FEM simulation of a mid-diaphysis bone ring under compression is employed. The FEM numerical deflections employed nine concentric regions across the thickness with graded stiffness values based on the digital segmentation and homogenization scheme. Bone ring deflections are found to agree well with measured deformations of the compression bone ring.

Solving the chemical master equation using sliding windows

PubMed Central

2010-01-01

Background The chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in time. Solving the CME numerically is in many cases computationally expensive or even infeasible as the number of reachable states can be very large or infinite. We introduce the sliding window method, which computes an approximate solution of the CME by performing a sequence of local analysis steps. In each step, only a manageable subset of states is considered, representing a "window" into the state space. In subsequent steps, the window follows the direction in which the probability mass moves, until the time period of interest has elapsed. We construct the window based on a deterministic approximation of the future behavior of the system by estimating upper and lower bounds on the populations of the chemical species. Results In order to show the effectiveness of our approach, we apply it to several examples previously described in the literature. The experimental results show that the proposed method speeds up the analysis considerably, compared to a global analysis, while still providing high accuracy. Conclusions The sliding window method is a novel approach to address the performance problems of numerical algorithms for the solution of the chemical master equation. The method efficiently approximates the probability distributions at the time points of interest for a variety of chemically reacting systems, including systems for which no upper bound on the population sizes of the chemical species is known a priori. PMID:20377904

Documentation for the MODFLOW 6 framework

USGS Publications Warehouse

Hughes, Joseph D.; Langevin, Christian D.; Banta, Edward R.

2017-08-10

MODFLOW is a popular open-source groundwater flow model distributed by the U.S. Geological Survey. Growing interest in surface and groundwater interactions, local refinement with nested and unstructured grids, karst groundwater flow, solute transport, and saltwater intrusion, has led to the development of numerous MODFLOW versions. Often times, there are incompatibilities between these different MODFLOW versions. The report describes a new MODFLOW framework called MODFLOW 6 that is designed to support multiple models and multiple types of models. The framework is written in Fortran using a modular object-oriented design. The primary framework components include the simulation (or main program), Timing Module, Solutions, Models, Exchanges, and Utilities. The first version of the framework focuses on numerical solutions, numerical models, and numerical exchanges. This focus on numerical models allows multiple numerical models to be tightly coupled at the matrix level.

Numerical Study of Periodic Traveling Wave Solutions for the Predator-Prey Model with Landscape Features

NASA Astrophysics Data System (ADS)

Yun, Ana; Shin, Jaemin; Li, Yibao; Lee, Seunggyu; Kim, Junseok

We numerically investigate periodic traveling wave solutions for a diffusive predator-prey system with landscape features. The landscape features are modeled through the homogeneous Dirichlet boundary condition which is imposed at the edge of the obstacle domain. To effectively treat the Dirichlet boundary condition, we employ a robust and accurate numerical technique by using a boundary control function. We also propose a robust algorithm for calculating the numerical periodicity of the traveling wave solution. In numerical experiments, we show that periodic traveling waves which move out and away from the obstacle are effectively generated. We explain the formation of the traveling waves by comparing the wavelengths. The spatial asynchrony has been shown in quantitative detail for various obstacles. Furthermore, we apply our numerical technique to the complicated real landscape features.

Efficient Coding and Energy Efficiency Are Promoted by Balanced Excitatory and Inhibitory Synaptic Currents in Neuronal Network

PubMed Central

Yu, Lianchun; Shen, Zhou; Wang, Chen; Yu, Yuguo

2018-01-01

Selective pressure may drive neural systems to process as much information as possible with the lowest energy cost. Recent experiment evidence revealed that the ratio between synaptic excitation and inhibition (E/I) in local cortex is generally maintained at a certain value which may influence the efficiency of energy consumption and information transmission of neural networks. To understand this issue deeply, we constructed a typical recurrent Hodgkin-Huxley network model and studied the general principles that governs the relationship among the E/I synaptic current ratio, the energy cost and total amount of information transmission. We observed in such a network that there exists an optimal E/I synaptic current ratio in the network by which the information transmission achieves the maximum with relatively low energy cost. The coding energy efficiency which is defined as the mutual information divided by the energy cost, achieved the maximum with the balanced synaptic current. Although background noise degrades information transmission and imposes an additional energy cost, we find an optimal noise intensity that yields the largest information transmission and energy efficiency at this optimal E/I synaptic transmission ratio. The maximization of energy efficiency also requires a certain part of energy cost associated with spontaneous spiking and synaptic activities. We further proved this finding with analytical solution based on the response function of bistable neurons, and demonstrated that optimal net synaptic currents are capable of maximizing both the mutual information and energy efficiency. These results revealed that the development of E/I synaptic current balance could lead a cortical network to operate at a highly efficient information transmission rate at a relatively low energy cost. The generality of neuronal models and the recurrent network configuration used here suggest that the existence of an optimal E/I cell ratio for highly efficient energy costs and information maximization is a potential principle for cortical circuit networks. Summary We conducted numerical simulations and mathematical analysis to examine the energy efficiency of neural information transmission in a recurrent network as a function of the ratio of excitatory and inhibitory synaptic connections. We obtained a general solution showing that there exists an optimal E/I synaptic ratio in a recurrent network at which the information transmission as well as the energy efficiency of this network achieves a global maximum. These results reflect general mechanisms for sensory coding processes, which may give insight into the energy efficiency of neural communication and coding. PMID:29773979

Efficient Coding and Energy Efficiency Are Promoted by Balanced Excitatory and Inhibitory Synaptic Currents in Neuronal Network.

PubMed

Yu, Lianchun; Shen, Zhou; Wang, Chen; Yu, Yuguo

2018-01-01

Selective pressure may drive neural systems to process as much information as possible with the lowest energy cost. Recent experiment evidence revealed that the ratio between synaptic excitation and inhibition (E/I) in local cortex is generally maintained at a certain value which may influence the efficiency of energy consumption and information transmission of neural networks. To understand this issue deeply, we constructed a typical recurrent Hodgkin-Huxley network model and studied the general principles that governs the relationship among the E/I synaptic current ratio, the energy cost and total amount of information transmission. We observed in such a network that there exists an optimal E/I synaptic current ratio in the network by which the information transmission achieves the maximum with relatively low energy cost. The coding energy efficiency which is defined as the mutual information divided by the energy cost, achieved the maximum with the balanced synaptic current. Although background noise degrades information transmission and imposes an additional energy cost, we find an optimal noise intensity that yields the largest information transmission and energy efficiency at this optimal E/I synaptic transmission ratio. The maximization of energy efficiency also requires a certain part of energy cost associated with spontaneous spiking and synaptic activities. We further proved this finding with analytical solution based on the response function of bistable neurons, and demonstrated that optimal net synaptic currents are capable of maximizing both the mutual information and energy efficiency. These results revealed that the development of E/I synaptic current balance could lead a cortical network to operate at a highly efficient information transmission rate at a relatively low energy cost. The generality of neuronal models and the recurrent network configuration used here suggest that the existence of an optimal E/I cell ratio for highly efficient energy costs and information maximization is a potential principle for cortical circuit networks. We conducted numerical simulations and mathematical analysis to examine the energy efficiency of neural information transmission in a recurrent network as a function of the ratio of excitatory and inhibitory synaptic connections. We obtained a general solution showing that there exists an optimal E/I synaptic ratio in a recurrent network at which the information transmission as well as the energy efficiency of this network achieves a global maximum. These results reflect general mechanisms for sensory coding processes, which may give insight into the energy efficiency of neural communication and coding.

Three learning phases for radial-basis-function networks.

PubMed

Schwenker, F; Kestler, H A; Palm, G

2001-05-01

In this paper, learning algorithms for radial basis function (RBF) networks are discussed. Whereas multilayer perceptrons (MLP) are typically trained with backpropagation algorithms, starting the training procedure with a random initialization of the MLP's parameters, an RBF network may be trained in many different ways. We categorize these RBF training methods into one-, two-, and three-phase learning schemes. Two-phase RBF learning is a very common learning scheme. The two layers of an RBF network are learnt separately; first the RBF layer is trained, including the adaptation of centers and scaling parameters, and then the weights of the output layer are adapted. RBF centers may be trained by clustering, vector quantization and classification tree algorithms, and the output layer by supervised learning (through gradient descent or pseudo inverse solution). Results from numerical experiments of RBF classifiers trained by two-phase learning are presented in three completely different pattern recognition applications: (a) the classification of 3D visual objects; (b) the recognition hand-written digits (2D objects); and (c) the categorization of high-resolution electrocardiograms given as a time series (ID objects) and as a set of features extracted from these time series. In these applications, it can be observed that the performance of RBF classifiers trained with two-phase learning can be improved through a third backpropagation-like training phase of the RBF network, adapting the whole set of parameters (RBF centers, scaling parameters, and output layer weights) simultaneously. This, we call three-phase learning in RBF networks. A practical advantage of two- and three-phase learning in RBF networks is the possibility to use unlabeled training data for the first training phase. Support vector (SV) learning in RBF networks is a different learning approach. SV learning can be considered, in this context of learning, as a special type of one-phase learning, where only the output layer weights of the RBF network are calculated, and the RBF centers are restricted to be a subset of the training data. Numerical experiments with several classifier schemes including k-nearest-neighbor, learning vector quantization and RBF classifiers trained through two-phase, three-phase and support vector learning are given. The performance of the RBF classifiers trained through SV learning and three-phase learning are superior to the results of two-phase learning, but SV learning often leads to complex network structures, since the number of support vectors is not a small fraction of the total number of data points.

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

Security and Dependability Solutions for Networks and Devices

NASA Astrophysics Data System (ADS)

Gücrgens, Sigrid; Fuchs, Andreas

In this chapter we give an overview over the denotation of the SERENITY artefacts S&D Classes, Patterns and Implementations in the context of networks and devices. In order to demonstrate their necessity we sketch an example for confidential and authentic communication and storage that utilizes a trusted platform module, and model the relevant pattern. We then dissociate solutions for network and device related S&D requirements from those targeting the context of organizational or workflow and web services based solutions. Then we give a summary of the broad field of application for network and device solutions. Finally we clarify the meaning and interaction between classes, patterns and implementations by giving some concrete examples.

Solutal convection induced by dissolution. Influence on erosion dynamics and interface shaping.

NASA Astrophysics Data System (ADS)

Berhanu, Michael; Philippi, Julien; Cohen, Caroline; Derr, Julien; Courrech du Pont, Sylvain

2017-04-01

Rock fractures invaded by a water flow, are often subjected to dissolution, which let grow and evolve the initial fracture network, by evacuating the eroded minerals under a solute form. In the case of fast kinetic of dissolution, local erosion rate is set by the advection of the solute. The erosion velocity decreases indeed with the solute concentration at the interface and vanishes when this concentration reaches the saturation value. Even in absence of an imposed or external flow, advection can drive the dissolution, when buoyancy effects due to gravity induce a solutal convection flow, which controls the erosive dynamics and modifies the shape of the dissolving interface. Here, we investigate using model experiments with fast dissolving materials and numerical simulations in simplified situations, solutal convection induced by dissolution. Results are interpreted regarding a linear stability analysis of the corresponding solutal Rayleigh-Benard instability. A dissolving surface is suspended above a water height, initially at rest. In a first step, solute flux is transported through a growing diffusion layer. Then after an onset time, once the layer exceeds critical width, convection flow starts under the form of falling plumes. A dynamic equilibrium results in average from births and deaths of intermittent plumes, setting the size of the solute concentration boundary layer at the interface and thus the erosion velocity. Solutal convection can also induce a pattern on the dissolving interface. We show experimentally with suspended and inclined blocks of salt and sugar, that in a linear stage, the first wavelength of the dissolution pattern corresponds to the wavelength of the convection instability. Then pattern evolves to more complex shapes due to non-linear interactions between the flow and the eroded interface. More generally, we inquire what are the conditions to observe a such solutal convection instability in geological situations and if the properties of dissolution patterns can be related to the characteristic of the convective flow. C. Oltéan, F. Golfier and M.A. Buès, Numerical and experimental investigation of buoyancy-driven dissolution in vertical fracture, J. Geophys. Res. Solid Earth, 118(5), 2038-2048 (2013) C. Cohen, M. Berhanu, J. Derr and S. Courrech du Pont, Erosion patterns on dissolving and melting bodies (2015 Gallery of Fluid motion), Phys. Rev. Fluids, 1, 050508 (2016) T. S. Sullivan, Y. Liu, and R. E. Ecke, Turbulent solutal convection and surface patterning in solid dissolution, Phys. Rev. E 54, 486 (1996)

A Second Law Based Unstructured Finite Volume Procedure for Generalized Flow Simulation

NASA Technical Reports Server (NTRS)

Majumdar, Alok

1998-01-01

An unstructured finite volume procedure has been developed for steady and transient thermo-fluid dynamic analysis of fluid systems and components. The procedure is applicable for a flow network consisting of pipes and various fittings where flow is assumed to be one dimensional. It can also be used to simulate flow in a component by modeling a multi-dimensional flow using the same numerical scheme. The flow domain is discretized into a number of interconnected control volumes located arbitrarily in space. The conservation equations for each control volume account for the transport of mass, momentum and entropy from the neighboring control volumes. In addition, they also include the sources of each conserved variable and time dependent terms. The source term of entropy equation contains entropy generation due to heat transfer and fluid friction. Thermodynamic properties are computed from the equation of state of a real fluid. The system of equations is solved by a hybrid numerical method which is a combination of simultaneous Newton-Raphson and successive substitution schemes. The paper also describes the application and verification of the procedure by comparing its predictions with the analytical and numerical solution of several benchmark problems.

Application of symbolic/numeric matrix solution techniques to the NASTRAN program

NASA Technical Reports Server (NTRS)

Buturla, E. M.; Burroughs, S. H.

1977-01-01

The matrix solving algorithm of any finite element algorithm is extremely important since solution of the matrix equations requires a large amount of elapse time due to null calculations and excessive input/output operations. An alternate method of solving the matrix equations is presented. A symbolic processing step followed by numeric solution yields the solution very rapidly and is especially useful for nonlinear problems.

The scaling of oblique plasma double layers

NASA Technical Reports Server (NTRS)

Borovsky, J. E.

1983-01-01

Strong oblique plasma double layers are investigated using three methods, i.e., electrostatic particle-in-cell simulations, numerical solutions to the Poisson-Vlasov equations, and analytical approximations to the Poisson-Vlasov equations. The solutions to the Poisson-Vlasov equations and numerical simulations show that strong oblique double layers scale in terms of Debye lengths. For very large potential jumps, theory and numerical solutions indicate that all effects of the magnetic field vanish and the oblique double layers follow the same scaling relation as the field-aligned double layers.

Numerical solution of a coupled pair of elliptic equations from solid state electronics

NASA Technical Reports Server (NTRS)

Phillips, T. N.

1983-01-01

Iterative methods are considered for the solution of a coupled pair of second order elliptic partial differential equations which arise in the field of solid state electronics. A finite difference scheme is used which retains the conservative form of the differential equations. Numerical solutions are obtained in two ways, by multigrid and dynamic alternating direction implicit methods. Numerical results are presented which show the multigrid method to be an efficient way of solving this problem.

A modified dynamical model of drying process of polymer blend solution coated on a flat substrate

NASA Astrophysics Data System (ADS)

Kagami, Hiroyuki

2008-05-01

We have proposed and modified a model of drying process of polymer solution coated on a flat substrate for flat polymer film fabrication. And for example numerical simulation of the model reproduces a typical thickness profile of the polymer film formed after drying. Then we have clarified dependence of distribution of polymer molecules on a flat substrate on a various parameters based on analysis of numerical simulations. Then we drove nonlinear equations of drying process from the dynamical model and the fruits were reported. The subject of above studies was limited to solution having one kind of solute though the model could essentially deal with solution having some kinds of solutes. But nowadays discussion of drying process of a solution having some kinds of solutes is needed because drying process of solution having some kinds of solutes appears in many industrial scenes. Polymer blend solution is one instance. And typical resist consists of a few kinds of polymers. Then we introduced a dynamical model of drying process of polymer blend solution coated on a flat substrate and results of numerical simulations of the dynamical model. But above model was the simplest one. In this study, we modify above dynamical model of drying process of polymer blend solution adding effects that some parameters change with time as functions of some variables to it. Then we consider essence of drying process of polymer blend solution through comparison between results of numerical simulations of the modified model and those of the former model.

Comparison of Analytical and Numerical Performance Predictions for an International Space Station Node 3 Internal Active Thermal Control System Regenerative Heat Exchanger

NASA Technical Reports Server (NTRS)

Wise, Stephen A.; Holt, James M.

2002-01-01

The complexity of International Space Station (ISS) systems modeling often necessitates the concurrence of various dissimilar, parallel analysis techniques to validate modeling. This was the case with a feasibility and performance study of the ISS Node 3 Regenerative Heat Exchanger (RHX). A thermo-hydraulic network model was created and analyzed in SINDA/FLUINT. A less complex, closed form solution of the systems dynamics was created using an Excel Spreadsheet. The purpose of this paper is to provide a brief description of the modeling processes utilized, the results and benefits of each to the ISS Node 3 RHX study.

Comparison of Analytical and Numerical Performance Predictions for a Regenerative Heat Exchanger in the International Space Station Node 3 Internal Active Thermal Control System

NASA Technical Reports Server (NTRS)

Wise, Stephen A.; Holt, James M.; Turner, Larry D. (Technical Monitor)

2001-01-01

The complexity of International Space Station (ISS) systems modeling often necessitates the concurrence of various dissimilar, parallel analysis techniques to validate modeling. This was the case with a feasibility and performance study of the ISS Node 3 Regenerative Heat Exchanger (RHX). A thermo-hydraulic network model was created and analyzed in SINDA/FLUINT. A less complex, closed form solution of the system dynamics was created using Excel. The purpose of this paper is to provide a brief description of the modeling processes utilized, the results and benefits of each to the ISS Node 3 RHX study.

Fuzzy multi-objective chance-constrained programming model for hazardous materials transportation

NASA Astrophysics Data System (ADS)

Du, Jiaoman; Yu, Lean; Li, Xiang

2016-04-01

Hazardous materials transportation is an important and hot issue of public safety. Based on the shortest path model, this paper presents a fuzzy multi-objective programming model that minimizes the transportation risk to life, travel time and fuel consumption. First, we present the risk model, travel time model and fuel consumption model. Furthermore, we formulate a chance-constrained programming model within the framework of credibility theory, in which the lengths of arcs in the transportation network are assumed to be fuzzy variables. A hybrid intelligent algorithm integrating fuzzy simulation and genetic algorithm is designed for finding a satisfactory solution. Finally, some numerical examples are given to demonstrate the efficiency of the proposed model and algorithm.

Quasi-generalized variables

NASA Technical Reports Server (NTRS)

Baumgarten, J.; Ostermeyer, G. P.

1986-01-01

The numerical solution of a system of differential and algebraic equations is difficult, due to the appearance of numerical instabilities. A method is presented here which permits numerical solutions of such a system to be obtained which satisfy the algebraic constraint equations exactly without reducing the order of the differential equations. The method is demonstrated using examples from mechanics.

Numerical analysis of the transient response of an axisymmetric ablative char layer considering internal flow effects

NASA Technical Reports Server (NTRS)

Pittman, C. M.; Howser, L. M.

1972-01-01

The differential equations governing the transient response of the char layer of an ablating axisymmetric body, internal pyrolysis gas flow effects being considered, have been derived. These equations have been expanded into finite difference form and programed for numerical solution on a digital computer. Numerical results compare favorably with simplified exact solutions. The complete numerical analysis was used to obtain solutions for two representative body shapes subjected to a typical entry heating environment. Pronounced effects of the lateral flow of pyrolysis gases on the mass flow field within the char layer and the associated surface and pyrolysis interface recession rates are shown.

Final Report - Cloud-Based Management Platform for Distributed, Multi-Domain Networks

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

Chowdhury, Pulak; Mukherjee, Biswanath

2017-11-03

In this Department of Energy (DOE) Small Business Innovation Research (SBIR) Phase II project final report, Ennetix presents the development of a solution for end-to-end monitoring, analysis, and visualization of network performance for distributed networks. This solution benefits enterprises of all sizes, operators of distributed and federated networks, and service providers.

Enabling Controlling Complex Networks with Local Topological Information.

PubMed

Li, Guoqi; Deng, Lei; Xiao, Gaoxi; Tang, Pei; Wen, Changyun; Hu, Wuhua; Pei, Jing; Shi, Luping; Stanley, H Eugene

2018-03-15

Complex networks characterize the nature of internal/external interactions in real-world systems including social, economic, biological, ecological, and technological networks. Two issues keep as obstacles to fulfilling control of large-scale networks: structural controllability which describes the ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable choice of inputs; and optimal control, which is a typical control approach to minimize the cost for driving the network to a predefined state with a given number of control inputs. For large complex networks without global information of network topology, both problems remain essentially open. Here we combine graph theory and control theory for tackling the two problems in one go, using only local network topology information. For the structural controllability problem, a distributed local-game matching method is proposed, where every node plays a simple Bayesian game with local information and local interactions with adjacent nodes, ensuring a suboptimal solution at a linear complexity. Starring from any structural controllability solution, a minimizing longest control path method can efficiently reach a good solution for the optimal control in large networks. Our results provide solutions for distributed complex network control and demonstrate a way to link the structural controllability and optimal control together.

Social power and opinion formation in complex networks

NASA Astrophysics Data System (ADS)

Jalili, Mahdi

2013-02-01

In this paper we investigate the effects of social power on the evolution of opinions in model networks as well as in a number of real social networks. A continuous opinion formation model is considered and the analysis is performed through numerical simulation. Social power is given to a proportion of agents selected either randomly or based on their degrees. As artificial network structures, we consider scale-free networks constructed through preferential attachment and Watts-Strogatz networks. Numerical simulations show that scale-free networks with degree-based social power on the hub nodes have an optimal case where the largest number of the nodes reaches a consensus. However, given power to a random selection of nodes could not improve consensus properties. Introducing social power in Watts-Strogatz networks could not significantly change the consensus profile.

Anomalous Chained Turbulence in Actively Driven Flows on Spheres

NASA Astrophysics Data System (ADS)

Mickelin, Oscar; Słomka, Jonasz; Burns, Keaton J.; Lecoanet, Daniel; Vasil, Geoffrey M.; Faria, Luiz M.; Dunkel, Jörn

2018-04-01

Recent experiments demonstrate the importance of substrate curvature for actively forced fluid dynamics. Yet, the covariant formulation and analysis of continuum models for nonequilibrium flows on curved surfaces still poses theoretical challenges. Here, we introduce and study a generalized covariant Navier-Stokes model for fluid flows driven by active stresses in nonplanar geometries. The analytical tractability of the theory is demonstrated through exact stationary solutions for the case of a spherical bubble geometry. Direct numerical simulations reveal a curvature-induced transition from a burst phase to an anomalous turbulent phase that differs distinctly from externally forced classical 2D Kolmogorov turbulence. This new type of active turbulence is characterized by the self-assembly of finite-size vortices into linked chains of antiferromagnetic order, which percolate through the entire fluid domain, forming an active dynamic network. The coherent motion of the vortex chain network provides an efficient mechanism for upward energy transfer from smaller to larger scales, presenting an alternative to the conventional energy cascade in classical 2D turbulence.

A poroelastic model coupled to a fluid network with applications in lung modelling.

PubMed

Berger, Lorenz; Bordas, Rafel; Burrowes, Kelly; Grau, Vicente; Tavener, Simon; Kay, David

2016-01-01

We develop a lung ventilation model based on a continuum poroelastic representation of lung parenchyma that is strongly coupled to a pipe network representation of the airway tree. The continuous system of equations is discretized using a low-order stabilised finite element method. The framework is applied to a realistic lung anatomical model derived from computed tomography data and an artificially generated airway tree to model the conducting airway region. Numerical simulations produce physiologically realistic solutions and demonstrate the effect of airway constriction and reduced tissue elasticity on ventilation, tissue stress and alveolar pressure distribution. The key advantage of the model is the ability to provide insight into the mutual dependence between ventilation and deformation. This is essential when studying lung diseases, such as chronic obstructive pulmonary disease and pulmonary fibrosis. Thus the model can be used to form a better understanding of integrated lung mechanics in both the healthy and diseased states. Copyright © 2015 John Wiley & Sons, Ltd. Copyright © 2015 John Wiley & Sons, Ltd.

Multirate parallel distributed compensation of a cluster in wireless sensor and actor networks

NASA Astrophysics Data System (ADS)

Yang, Chun-xi; Huang, Ling-yun; Zhang, Hao; Hua, Wang

2016-01-01

The stabilisation problem for one of the clusters with bounded multiple random time delays and packet dropouts in wireless sensor and actor networks is investigated in this paper. A new multirate switching model is constructed to describe the feature of this single input multiple output linear system. According to the difficulty of controller design under multi-constraints in multirate switching model, this model can be converted to a Takagi-Sugeno fuzzy model. By designing a multirate parallel distributed compensation, a sufficient condition is established to ensure this closed-loop fuzzy control system to be globally exponentially stable. The solution of the multirate parallel distributed compensation gains can be obtained by solving an auxiliary convex optimisation problem. Finally, two numerical examples are given to show, compared with solving switching controller, multirate parallel distributed compensation can be obtained easily. Furthermore, it has stronger robust stability than arbitrary switching controller and single-rate parallel distributed compensation under the same conditions.

A Sparse Representation-Based Deployment Method for Optimizing the Observation Quality of Camera Networks

PubMed Central

Wang, Chang; Qi, Fei; Shi, Guangming; Wang, Xiaotian

2013-01-01

Deployment is a critical issue affecting the quality of service of camera networks. The deployment aims at adopting the least number of cameras to cover the whole scene, which may have obstacles to occlude the line of sight, with expected observation quality. This is generally formulated as a non-convex optimization problem, which is hard to solve in polynomial time. In this paper, we propose an efficient convex solution for deployment optimizing the observation quality based on a novel anisotropic sensing model of cameras, which provides a reliable measurement of the observation quality. The deployment is formulated as the selection of a subset of nodes from a redundant initial deployment with numerous cameras, which is an ℓ0 minimization problem. Then, we relax this non-convex optimization to a convex ℓ1 minimization employing the sparse representation. Therefore, the high quality deployment is efficiently obtained via convex optimization. Simulation results confirm the effectiveness of the proposed camera deployment algorithms. PMID:23989826

Design and Development of Layered Security: Future Enhancements and Directions in Transmission

PubMed Central

Shahzad, Aamir; Lee, Malrey; Kim, Suntae; Kim, Kangmin; Choi, Jae-Young; Cho, Younghwa; Lee, Keun-Kwang

2016-01-01

Today, security is a prominent issue when any type of communication is being undertaken. Like traditional networks, supervisory control and data acquisition (SCADA) systems suffer from a number of vulnerabilities. Numerous end-to-end security mechanisms have been proposed for the resolution of SCADA-system security issues, but due to insecure real-time protocol use and the reliance upon open protocols during Internet-based communication, these SCADA systems can still be compromised by security challenges. This study reviews the security challenges and issues that are commonly raised during SCADA/protocol transmissions and proposes a secure distributed-network protocol version 3 (DNP3) design, and the implementation of the security solution using a cryptography mechanism. Due to the insecurities found within SCADA protocols, the new development consists of a DNP3 protocol that has been designed as a part of the SCADA system, and the cryptographically derived security is deployed within the application layer as a part of the DNP3 stack. PMID:26751443

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.