A stream-gaging network analysis for the 7-day, 10-year annual low flow in New Hampshire streams

USGS Publications Warehouse

Flynn, Robert H.

2003-01-01

The 7-day, 10-year (7Q10) low-flow-frequency statistic is a widely used measure of surface-water availability in New Hampshire. Regression equations and basin-characteristic digital data sets were developed to help water-resource managers determine surface-water resources during periods of low flow in New Hampshire streams. These regression equations and data sets were developed to estimate streamflow statistics for the annual and seasonal low-flow-frequency, and period-of-record and seasonal period-of-record flow durations. generalized-least-squares (GLS) regression methods were used to develop the annual 7Q10 low-flow-frequency regression equation from 60 continuous-record stream-gaging stations in New Hampshire and in neighboring States. In the regression equation, the dependent variables were the annual 7Q10 flows at the 60 stream-gaging stations. The independent (or predictor) variables were objectively selected characteristics of the drainage basins that contribute flow to those stations. In contrast to ordinary-least-squares (OLS) regression analysis, GLS-developed estimating equations account for differences in length of record and spatial correlations among the flow-frequency statistics at the various stations.A total of 93 measurable drainage-basin characteristics were candidate independent variables. On the basis of several statistical parameters that were used to evaluate which combination of basin characteristics contribute the most to the predictive power of the equations, three drainage-basin characteristics were determined to be statistically significant predictors of the annual 7Q10: (1) total drainage area, (2) mean summer stream-gaging station precipitation from 1961 to 90, and (3) average mean annual basinwide temperature from 1961 to 1990.To evaluate the effectiveness of the stream-gaging network in providing regional streamflow data for the annual 7Q10, the computer program GLSNET (generalized-least-squares NETwork) was used to analyze the network by application of GLS regression between streamflow and the climatic and basin characteristics of the drainage basin upstream from each stream-gaging station. Improvement to the predictive ability of the regression equations developed for the network analyses is measured by the reduction in the average sampling-error variance, and can be achieved by collecting additional streamflow data at existing stations. The predictive ability of the regression equations is enhanced even further with the addition of new stations to the network. Continued data collection at unregulated stream-gaging stations with less than 14 years of record resulted in the greatest cost-weighted reduction to the average sampling-error variance of the annual 7Q10 regional regression equation. The addition of new stations in basins with underrepresented values for the independent variables of the total drainage area, average mean annual basinwide temperature, or mean summer stream-gaging station precipitation in the annual 7Q10 regression equation yielded a much greater cost-weighted reduction to the average sampling-error variance than when more data were collected at existing unregulated stations. To maximize the regional information obtained from the stream-gaging network for the annual 7Q10, ranking of the streamflow data can be used to determine whether an active station should be continued or if a new or discontinued station should be activated for streamflow data collection. Thus, this network analysis can help determine the costs and benefits of continuing the operation of a particular station or activating a new station at another location to predict the 7Q10 at ungaged stream reaches. The decision to discontinue an existing station or activate a new station, however, must also consider its contribution to other water-resource analyses such as flood management, water quality, or trends in land use or climatic change.

Beyond blow-up in excitatory integrate and fire neuronal networks: Refractory period and spontaneous activity.

PubMed

Cáceres, María J; Perthame, Benoît

2014-06-07

The Network Noisy Leaky Integrate and Fire equation is among the simplest model allowing for a self-consistent description of neural networks and gives a rule to determine the probability to find a neuron at the potential v. However, its mathematical structure is still poorly understood and, concerning its solutions, very few results are available. In the midst of them, a recent result shows blow-up in finite time for fully excitatory networks. The intuitive explanation is that each firing neuron induces a discharge of the others; thus increases the activity and consequently the discharge rate of the full network. In order to better understand the details of the phenomena and show that the equation is more complex and fruitful than expected, we analyze further the model. We extend the finite time blow-up result to the case when neurons, after firing, enter a refractory state for a given period of time. We also show that spontaneous activity may occur when, additionally, randomness is included on the firing potential VF in regimes where blow-up occurs for a fixed value of VF. Copyright © 2014 Elsevier Ltd. All rights reserved.

Simulation electromagnetic scattering on bodies through integral equation and neural networks methods

NASA Astrophysics Data System (ADS)

Lvovich, I. Ya; Preobrazhenskiy, A. P.; Choporov, O. N.

2018-05-01

The paper deals with the issue of electromagnetic scattering on a perfectly conducting diffractive body of a complex shape. Performance calculation of the body scattering is carried out through the integral equation method. Fredholm equation of the second time was used for calculating electric current density. While solving the integral equation through the moments method, the authors have properly described the core singularity. The authors determined piecewise constant functions as basic functions. The chosen equation was solved through the moments method. Within the Kirchhoff integral approach it is possible to define the scattered electromagnetic field, in some way related to obtained electrical currents. The observation angles sector belongs to the area of the front hemisphere of the diffractive body. To improve characteristics of the diffractive body, the authors used a neural network. All the neurons contained a logsigmoid activation function and weighted sums as discriminant functions. The paper presents the matrix of weighting factors of the connectionist model, as well as the results of the optimized dimensions of the diffractive body. The paper also presents some basic steps in calculation technique of the diffractive bodies, based on the combination of integral equation and neural networks methods.

Population equations for degree-heterogenous neural networks

NASA Astrophysics Data System (ADS)

Kähne, M.; Sokolov, I. M.; Rüdiger, S.

2017-11-01

We develop a statistical framework for studying recurrent networks with broad distributions of the number of synaptic links per neuron. We treat each group of neurons with equal input degree as one population and derive a system of equations determining the population-averaged firing rates. The derivation rests on an assumption of a large number of neurons and, additionally, an assumption of a large number of synapses per neuron. For the case of binary neurons, analytical solutions can be constructed, which correspond to steps in the activity versus degree space. We apply this theory to networks with degree-correlated topology and show that complex, multi-stable regimes can result for increasing correlations. Our work is motivated by the recent finding of subnetworks of highly active neurons and the fact that these neurons tend to be connected to each other with higher probability.

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

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

Closed-form expressions of some stochastic adapting equations for nonlinear adaptive activation function neurons.

PubMed

Fiori, Simone

2003-12-01

In recent work, we introduced nonlinear adaptive activation function (FAN) artificial neuron models, which learn their activation functions in an unsupervised way by information-theoretic adapting rules. We also applied networks of these neurons to some blind signal processing problems, such as independent component analysis and blind deconvolution. The aim of this letter is to study some fundamental aspects of FAN units' learning by investigating the properties of the associated learning differential equation systems.

HESS Opinions: Linking Darcy's equation to the linear reservoir

NASA Astrophysics Data System (ADS)

Savenije, Hubert H. G.

2018-03-01

In groundwater hydrology, two simple linear equations exist describing the relation between groundwater flow and the gradient driving it: Darcy's equation and the linear reservoir. Both equations are empirical and straightforward, but work at different scales: Darcy's equation at the laboratory scale and the linear reservoir at the watershed scale. Although at first sight they appear similar, it is not trivial to upscale Darcy's equation to the watershed scale without detailed knowledge of the structure or shape of the underlying aquifers. This paper shows that these two equations, combined by the water balance, are indeed identical provided there is equal resistance in space for water entering the subsurface network. This implies that groundwater systems make use of an efficient drainage network, a mostly invisible pattern that has evolved over geological timescales. This drainage network provides equally distributed resistance for water to access the system, connecting the active groundwater body to the stream, much like a leaf is organized to provide all stomata access to moisture at equal resistance. As a result, the timescale of the linear reservoir appears to be inversely proportional to Darcy's conductance, the proportionality being the product of the porosity and the resistance to entering the drainage network. The main question remaining is which physical law lies behind pattern formation in groundwater systems, evolving in a way that resistance to drainage is constant in space. But that is a fundamental question that is equally relevant for understanding the hydraulic properties of leaf veins in plants or of blood veins in animals.

Networks of Firms and the Ridge in the Production Space

NASA Astrophysics Data System (ADS)

Souma, Wataru

We develop complex networks that represent activities in the economy. The network in this study is constructed from firms and the relationships between firms, i.e., shareholding, interlocking directors, transactions, and joint applications for patents. Thus, the network is regarded as a multigraph, and it is also regarded as a weighted network. By calculating various network indices, we clarify the characteristics of the network. We also consider the dynamics of firms in the production space that are characterized by capital stock, employment, and profit. Each firm moves within this space to maximize their profit by using controlling of capital stock and employment. We show that the dynamics of rational firms can be described using a ridge equation. We analytically solve this equation by assuming the extensive Cobb-Douglas production function, and thereby obtain a solution. By comparing the distribution of firms and this solution, we find that almost all of the 1,100 firms listed on the first section of the Tokyo stock exchange and belonging to the manufacturing sector are managed efficiently.

Path-integral methods for analyzing the effects of fluctuations in stochastic hybrid neural networks.

PubMed

Bressloff, Paul C

2015-01-01

We consider applications of path-integral methods to the analysis of a stochastic hybrid model representing a network of synaptically coupled spiking neuronal populations. The state of each local population is described in terms of two stochastic variables, a continuous synaptic variable and a discrete activity variable. The synaptic variables evolve according to piecewise-deterministic dynamics describing, at the population level, synapses driven by spiking activity. The dynamical equations for the synaptic currents are only valid between jumps in spiking activity, and the latter are described by a jump Markov process whose transition rates depend on the synaptic variables. We assume a separation of time scales between fast spiking dynamics with time constant [Formula: see text] and slower synaptic dynamics with time constant τ. This naturally introduces a small positive parameter [Formula: see text], which can be used to develop various asymptotic expansions of the corresponding path-integral representation of the stochastic dynamics. First, we derive a variational principle for maximum-likelihood paths of escape from a metastable state (large deviations in the small noise limit [Formula: see text]). We then show how the path integral provides an efficient method for obtaining a diffusion approximation of the hybrid system for small ϵ. The resulting Langevin equation can be used to analyze the effects of fluctuations within the basin of attraction of a metastable state, that is, ignoring the effects of large deviations. We illustrate this by using the Langevin approximation to analyze the effects of intrinsic noise on pattern formation in a spatially structured hybrid network. In particular, we show how noise enlarges the parameter regime over which patterns occur, in an analogous fashion to PDEs. Finally, we carry out a [Formula: see text]-loop expansion of the path integral, and use this to derive corrections to voltage-based mean-field equations, analogous to the modified activity-based equations generated from a neural master equation.

Neural network method for lossless two-conductor transmission line equations based on the IELM algorithm

NASA Astrophysics Data System (ADS)

Yang, Yunlei; Hou, Muzhou; Luo, Jianshu; Liu, Taohua

2018-06-01

With the increasing demands for vast amounts of data and high-speed signal transmission, the use of multi-conductor transmission lines is becoming more common. The impact of transmission lines on signal transmission is thus a key issue affecting the performance of high-speed digital systems. To solve the problem of lossless two-conductor transmission line equations (LTTLEs), a neural network model and algorithm are explored in this paper. By selecting the product of two triangular basis functions as the activation function of hidden layer neurons, we can guarantee the separation of time, space, and phase orthogonality. By adding the initial condition to the neural network, an improved extreme learning machine (IELM) algorithm for solving the network weight is obtained. This is different to the traditional method for converting the initial condition into the iterative constraint condition. Calculation software for solving the LTTLEs based on the IELM algorithm is developed. Numerical experiments show that the results are consistent with those of the traditional method. The proposed neural network algorithm can find the terminal voltage of the transmission line and also the voltage of any observation point. It is possible to calculate the value at any given point by using the neural network model to solve the transmission line equation.

Numerical approximation of the electromechanical coupling in the left ventricle with inclusion of the Purkinje network.

PubMed

Landajuela, Mikel; Vergara, Christian; Gerbi, Antonello; Dedé, Luca; Formaggia, Luca; Quarteroni, Alfio

2018-03-25

In this work, we consider the numerical approximation of the electromechanical coupling in the left ventricle with inclusion of the Purkinje network. The mathematical model couples the 3D elastodynamics and bidomain equations for the electrophysiology in the myocardium with the 1D monodomain equation in the Purkinje network. For the numerical solution of the coupled problem, we consider a fixed-point iterative algorithm that enables a partitioned solution of the myocardium and Purkinje network problems. Different levels of myocardium-Purkinje network splitting are considered and analyzed. The results are compared with those obtained using standard strategies proposed in the literature to trigger the electrical activation. Finally, we present a numerical study that, although performed in an idealized computational domain, features all the physiological issues that characterize a heartbeat simulation, including the initiation of the signal in the Purkinje network and the systolic and diastolic phases. This article is protected by copyright. All rights reserved. This article is protected by copyright. All rights reserved.

Chaotic dynamics and diffusion in a piecewise linear equation

NASA Astrophysics Data System (ADS)

Shahrear, Pabel; Glass, Leon; Edwards, Rod

2015-03-01

Genetic interactions are often modeled by logical networks in which time is discrete and all gene activity states update simultaneously. However, there is no synchronizing clock in organisms. An alternative model assumes that the logical network is preserved and plays a key role in driving the dynamics in piecewise nonlinear differential equations. We examine dynamics in a particular 4-dimensional equation of this class. In the equation, two of the variables form a negative feedback loop that drives a second negative feedback loop. By modifying the original equations by eliminating exponential decay, we generate a modified system that is amenable to detailed analysis. In the modified system, we can determine in detail the Poincaré (return) map on a cross section to the flow. By analyzing the eigenvalues of the map for the different trajectories, we are able to show that except for a set of measure 0, the flow must necessarily have an eigenvalue greater than 1 and hence there is sensitive dependence on initial conditions. Further, there is an irregular oscillation whose amplitude is described by a diffusive process that is well-modeled by the Irwin-Hall distribution. There is a large class of other piecewise-linear networks that might be analyzed using similar methods. The analysis gives insight into possible origins of chaotic dynamics in periodically forced dynamical systems.

Controlling Contagion Processes in Activity Driven Networks

NASA Astrophysics Data System (ADS)

Liu, Suyu; Perra, Nicola; Karsai, Márton; Vespignani, Alessandro

2014-03-01

The vast majority of strategies aimed at controlling contagion processes on networks consider the connectivity pattern of the system either quenched or annealed. However, in the real world, many networks are highly dynamical and evolve, in time, concurrently with the contagion process. Here, we derive an analytical framework for the study of control strategies specifically devised for a class of time-varying networks, namely activity-driven networks. We develop a block variable mean-field approach that allows the derivation of the equations describing the coevolution of the contagion process and the network dynamic. We derive the critical immunization threshold and assess the effectiveness of three different control strategies. Finally, we validate the theoretical picture by simulating numerically the spreading process and control strategies in both synthetic networks and a large-scale, real-world, mobile telephone call data set.

Hopf bifurcation in a nonlocal nonlinear transport equation stemming from stochastic neural dynamics

NASA Astrophysics Data System (ADS)

Drogoul, Audric; Veltz, Romain

2017-02-01

In this work, we provide three different numerical evidences for the occurrence of a Hopf bifurcation in a recently derived [De Masi et al., J. Stat. Phys. 158, 866-902 (2015) and Fournier and löcherbach, Ann. Inst. H. Poincaré Probab. Stat. 52, 1844-1876 (2016)] mean field limit of a stochastic network of excitatory spiking neurons. The mean field limit is a challenging nonlocal nonlinear transport equation with boundary conditions. The first evidence relies on the computation of the spectrum of the linearized equation. The second stems from the simulation of the full mean field. Finally, the last evidence comes from the simulation of the network for a large number of neurons. We provide a "recipe" to find such bifurcation which nicely complements the works in De Masi et al. [J. Stat. Phys. 158, 866-902 (2015)] and Fournier and löcherbach [Ann. Inst. H. Poincaré Probab. Stat. 52, 1844-1876 (2016)]. This suggests in return to revisit theoretically these mean field equations from a dynamical point of view. Finally, this work shows how the noise level impacts the transition from asynchronous activity to partial synchronization in excitatory globally pulse-coupled networks.

Heteroclinic dynamics of coupled semiconductor lasers with optoelectronic feedback.

PubMed

Shahin, S; Vallini, F; Monifi, F; Rabinovich, M; Fainman, Y

2016-11-15

Generalized Lotka-Volterra (GLV) equations are important equations used in various areas of science to describe competitive dynamics among a population of N interacting nodes in a network topology. In this Letter, we introduce a photonic network consisting of three optoelectronically cross-coupled semiconductor lasers to realize a GLV model. In such a network, the interaction of intensity and carrier inversion rates, as well as phases of laser oscillator nodes, result in various dynamics. We study the influence of asymmetric coupling strength and frequency detuning between semiconductor lasers and show that inhibitory asymmetric coupling is required to achieve consecutive amplitude oscillations of the laser nodes. These studies were motivated primarily by the dynamical models used to model brain cognitive activities and their correspondence with dynamics obtained among coupled laser oscillators.

Numerical Modeling of Saturated Boiling in a Heated Tube

NASA Technical Reports Server (NTRS)

Majumdar, Alok; LeClair, Andre; Hartwig, Jason

2017-01-01

This paper describes a mathematical formulation and numerical solution of boiling in a heated tube. The mathematical formulation involves a discretization of the tube into a flow network consisting of fluid nodes and branches and a thermal network consisting of solid nodes and conductors. In the fluid network, the mass, momentum and energy conservation equations are solved and in the thermal network, the energy conservation equation of solids is solved. A pressure-based, finite-volume formulation has been used to solve the equations in the fluid network. The system of equations is solved by a hybrid numerical scheme which solves the mass and momentum conservation equations by a simultaneous Newton-Raphson method and the energy conservation equation by a successive substitution method. The fluid network and thermal network are coupled through heat transfer between the solid and fluid nodes which is computed by Chen's correlation of saturated boiling heat transfer. The computer model is developed using the Generalized Fluid System Simulation Program and the numerical predictions are compared with test data.

Exact analytical solution of irreversible binary dynamics on networks.

PubMed

Laurence, Edward; Young, Jean-Gabriel; Melnik, Sergey; Dubé, Louis J

2018-03-01

In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined condition. We introduce a set of recursive equations to compute the probability of reaching any final state, given an initial state, and a specification of the transition probability function of each node. Because the naive recursive approach for solving these equations takes factorial time in the number of nodes, we also introduce an accelerated algorithm, built around a breath-first search procedure. This algorithm solves the equations as efficiently as possible in exponential time.

Exact analytical solution of irreversible binary dynamics on networks

NASA Astrophysics Data System (ADS)

Laurence, Edward; Young, Jean-Gabriel; Melnik, Sergey; Dubé, Louis J.

2018-03-01

In binary cascade dynamics, the nodes of a graph are in one of two possible states (inactive, active), and nodes in the inactive state make an irreversible transition to the active state, as soon as their precursors satisfy a predetermined condition. We introduce a set of recursive equations to compute the probability of reaching any final state, given an initial state, and a specification of the transition probability function of each node. Because the naive recursive approach for solving these equations takes factorial time in the number of nodes, we also introduce an accelerated algorithm, built around a breath-first search procedure. This algorithm solves the equations as efficiently as possible in exponential time.

Field-theoretic approach to fluctuation effects in neural networks

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

Buice, Michael A.; Cowan, Jack D.; Mathematics Department, University of Chicago, Chicago, Illinois 60637

A well-defined stochastic theory for neural activity, which permits the calculation of arbitrary statistical moments and equations governing them, is a potentially valuable tool for theoretical neuroscience. We produce such a theory by analyzing the dynamics of neural activity using field theoretic methods for nonequilibrium statistical processes. Assuming that neural network activity is Markovian, we construct the effective spike model, which describes both neural fluctuations and response. This analysis leads to a systematic expansion of corrections to mean field theory, which for the effective spike model is a simple version of the Wilson-Cowan equation. We argue that neural activity governedmore » by this model exhibits a dynamical phase transition which is in the universality class of directed percolation. More general models (which may incorporate refractoriness) can exhibit other universality classes, such as dynamic isotropic percolation. Because of the extremely high connectivity in typical networks, it is expected that higher-order terms in the systematic expansion are small for experimentally accessible measurements, and thus, consistent with measurements in neocortical slice preparations, we expect mean field exponents for the transition. We provide a quantitative criterion for the relative magnitude of each term in the systematic expansion, analogous to the Ginsburg criterion. Experimental identification of dynamic universality classes in vivo is an outstanding and important question for neuroscience.« less

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.

Mittag-Leffler stability of fractional-order neural networks in the presence of generalized piecewise constant arguments.

PubMed

Wu, Ailong; Liu, Ling; Huang, Tingwen; Zeng, Zhigang

2017-01-01

Neurodynamic system is an emerging research field. To understand the essential motivational representations of neural activity, neurodynamics is an important question in cognitive system research. This paper is to investigate Mittag-Leffler stability of a class of fractional-order neural networks in the presence of generalized piecewise constant arguments. To identify neural types of computational principles in mathematical and computational analysis, the existence and uniqueness of the solution of neurodynamic system is the first prerequisite. We prove that the existence and uniqueness of the solution of the network holds when some conditions are satisfied. In addition, self-active neurodynamic system demands stable internal dynamical states (equilibria). The main emphasis will be then on several sufficient conditions to guarantee a unique equilibrium point. Furthermore, to provide deeper explanations of neurodynamic process, Mittag-Leffler stability is studied in detail. The established results are based on the theories of fractional differential equation and differential equation with generalized piecewise constant arguments. The derived criteria improve and extend the existing related results. Copyright © 2016 Elsevier Ltd. All rights reserved.

Learning a trajectory using adjoint functions and teacher forcing

NASA Technical Reports Server (NTRS)

Toomarian, Nikzad B.; Barhen, Jacob

1992-01-01

A new methodology for faster supervised temporal learning in nonlinear neural networks is presented which builds upon the concept of adjoint operators to allow fast computation of the gradients of an error functional with respect to all parameters of the neural architecture, and exploits the concept of teacher forcing to incorporate information on the desired output into the activation dynamics. The importance of the initial or final time conditions for the adjoint equations is discussed. A new algorithm is presented in which the adjoint equations are solved simultaneously (i.e., forward in time) with the activation dynamics of the neural network. We also indicate how teacher forcing can be modulated in time as learning proceeds. The results obtained show that the learning time is reduced by one to two orders of magnitude with respect to previously published results, while trajectory tracking is significantly improved. The proposed methodology makes hardware implementation of temporal learning attractive for real-time applications.

Neural network versus activity-specific prediction equations for energy expenditure estimation in children.

PubMed

Ruch, Nicole; Joss, Franziska; Jimmy, Gerda; Melzer, Katarina; Hänggi, Johanna; Mäder, Urs

2013-11-01

The aim of this study was to compare the energy expenditure (EE) estimations of activity-specific prediction equations (ASPE) and of an artificial neural network (ANNEE) based on accelerometry with measured EE. Forty-three children (age: 9.8 ± 2.4 yr) performed eight different activities. They were equipped with one tri-axial accelerometer that collected data in 1-s epochs and a portable gas analyzer. The ASPE and the ANNEE were trained to estimate the EE by including accelerometry, age, gender, and weight of the participants. To provide the activity-specific information, a decision tree was trained to recognize the type of activity through accelerometer data. The ASPE were applied to the activity-type-specific data recognized by the tree (Tree-ASPE). The Tree-ASPE precisely estimated the EE of all activities except cycling [bias: -1.13 ± 1.33 metabolic equivalent (MET)] and walking (bias: 0.29 ± 0.64 MET; P < 0.05). The ANNEE overestimated the EE of stationary activities (bias: 0.31 ± 0.47 MET) and walking (bias: 0.61 ± 0.72 MET) and underestimated the EE of cycling (bias: -0.90 ± 1.18 MET; P < 0.05). Biases of EE in stationary activities (ANNEE: 0.31 ± 0.47 MET, Tree-ASPE: 0.08 ± 0.21 MET) and walking (ANNEE 0.61 ± 0.72 MET, Tree-ASPE: 0.29 ± 0.64 MET) were significantly smaller in the Tree-ASPE than in the ANNEE (P < 0.05). The Tree-ASPE was more precise in estimating the EE than the ANNEE. The use of activity-type-specific information for subsequent EE prediction equations might be a promising approach for future studies.

Pole-equator difference and the variability of the brightness of the chromospheric CaII-K-network elements in quiet regions over the solar cycle

NASA Technical Reports Server (NTRS)

Kariyappa, R.

1995-01-01

The dependence of the brightness of chromospheric network elements on latitude was investigated for quiet solar regions. Calibrated photographic CaII K-spectroheliograms were used to compare the variation in brightness at the center of the disk with higher latitude of chromospheric network elements in a quiet region as a function of solar activity. It was found that there was no significant difference in brightness between the center of the solar disk and higher latitude. It is concluded that the brightness of the chromospheric network elements in a quiet region does not depend on the latitude, but that the variation in the intensity enhancement is related to the level of solar activity.

A Markov model for the temporal dynamics of balanced random networks of finite size

PubMed Central

Lagzi, Fereshteh; Rotter, Stefan

2014-01-01

The balanced state of recurrent networks of excitatory and inhibitory spiking neurons is characterized by fluctuations of population activity about an attractive fixed point. Numerical simulations show that these dynamics are essentially nonlinear, and the intrinsic noise (self-generated fluctuations) in networks of finite size is state-dependent. Therefore, stochastic differential equations with additive noise of fixed amplitude cannot provide an adequate description of the stochastic dynamics. The noise model should, rather, result from a self-consistent description of the network dynamics. Here, we consider a two-state Markovian neuron model, where spikes correspond to transitions from the active state to the refractory state. Excitatory and inhibitory input to this neuron affects the transition rates between the two states. The corresponding nonlinear dependencies can be identified directly from numerical simulations of networks of leaky integrate-and-fire neurons, discretized at a time resolution in the sub-millisecond range. Deterministic mean-field equations, and a noise component that depends on the dynamic state of the network, are obtained from this model. The resulting stochastic model reflects the behavior observed in numerical simulations quite well, irrespective of the size of the network. In particular, a strong temporal correlation between the two populations, a hallmark of the balanced state in random recurrent networks, are well represented by our model. Numerical simulations of such networks show that a log-normal distribution of short-term spike counts is a property of balanced random networks with fixed in-degree that has not been considered before, and our model shares this statistical property. Furthermore, the reconstruction of the flow from simulated time series suggests that the mean-field dynamics of finite-size networks are essentially of Wilson-Cowan type. We expect that this novel nonlinear stochastic model of the interaction between neuronal populations also opens new doors to analyze the joint dynamics of multiple interacting networks. PMID:25520644

Solution of weakly compressible isothermal flow in landfill gas collection networks

NASA Astrophysics Data System (ADS)

Nec, Y.; Huculak, G.

2017-12-01

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

Numerical solution of the nonlinear Schrodinger equation by feedforward neural networks

NASA Astrophysics Data System (ADS)

Shirvany, Yazdan; Hayati, Mohsen; Moradian, Rostam

2008-12-01

We present a method to solve boundary value problems using artificial neural networks (ANN). A trial solution of the differential equation is written as a feed-forward neural network containing adjustable parameters (the weights and biases). From the differential equation and its boundary conditions we prepare the energy function which is used in the back-propagation method with momentum term to update the network parameters. We improved energy function of ANN which is derived from Schrodinger equation and the boundary conditions. With this improvement of energy function we can use unsupervised training method in the ANN for solving the equation. Unsupervised training aims to minimize a non-negative energy function. We used the ANN method to solve Schrodinger equation for few quantum systems. Eigenfunctions and energy eigenvalues are calculated. Our numerical results are in agreement with their corresponding analytical solution and show the efficiency of ANN method for solving eigenvalue problems.

Reverse-engineering of gene networks for regulating early blood development from single-cell measurements.

PubMed

Wei, Jiangyong; Hu, Xiaohua; Zou, Xiufen; Tian, Tianhai

2017-12-28

Recent advances in omics technologies have raised great opportunities to study large-scale regulatory networks inside the cell. In addition, single-cell experiments have measured the gene and protein activities in a large number of cells under the same experimental conditions. However, a significant challenge in computational biology and bioinformatics is how to derive quantitative information from the single-cell observations and how to develop sophisticated mathematical models to describe the dynamic properties of regulatory networks using the derived quantitative information. This work designs an integrated approach to reverse-engineer gene networks for regulating early blood development based on singel-cell experimental observations. The wanderlust algorithm is initially used to develop the pseudo-trajectory for the activities of a number of genes. Since the gene expression data in the developed pseudo-trajectory show large fluctuations, we then use Gaussian process regression methods to smooth the gene express data in order to obtain pseudo-trajectories with much less fluctuations. The proposed integrated framework consists of both bioinformatics algorithms to reconstruct the regulatory network and mathematical models using differential equations to describe the dynamics of gene expression. The developed approach is applied to study the network regulating early blood cell development. A graphic model is constructed for a regulatory network with forty genes and a dynamic model using differential equations is developed for a network of nine genes. Numerical results suggests that the proposed model is able to match experimental data very well. We also examine the networks with more regulatory relations and numerical results show that more regulations may exist. We test the possibility of auto-regulation but numerical simulations do not support the positive auto-regulation. In addition, robustness is used as an importantly additional criterion to select candidate networks. The research results in this work shows that the developed approach is an efficient and effective method to reverse-engineer gene networks using single-cell experimental observations.

Combinatorial explosion in model gene networks

NASA Astrophysics Data System (ADS)

Edwards, R.; Glass, L.

2000-09-01

The explosive growth in knowledge of the genome of humans and other organisms leaves open the question of how the functioning of genes in interacting networks is coordinated for orderly activity. One approach to this problem is to study mathematical properties of abstract network models that capture the logical structures of gene networks. The principal issue is to understand how particular patterns of activity can result from particular network structures, and what types of behavior are possible. We study idealized models in which the logical structure of the network is explicitly represented by Boolean functions that can be represented by directed graphs on n-cubes, but which are continuous in time and described by differential equations, rather than being updated synchronously via a discrete clock. The equations are piecewise linear, which allows significant analysis and facilitates rapid integration along trajectories. We first give a combinatorial solution to the question of how many distinct logical structures exist for n-dimensional networks, showing that the number increases very rapidly with n. We then outline analytic methods that can be used to establish the existence, stability and periods of periodic orbits corresponding to particular cycles on the n-cube. We use these methods to confirm the existence of limit cycles discovered in a sample of a million randomly generated structures of networks of 4 genes. Even with only 4 genes, at least several hundred different patterns of stable periodic behavior are possible, many of them surprisingly complex. We discuss ways of further classifying these periodic behaviors, showing that small mutations (reversal of one or a few edges on the n-cube) need not destroy the stability of a limit cycle. Although these networks are very simple as models of gene networks, their mathematical transparency reveals relationships between structure and behavior, they suggest that the possibilities for orderly dynamics in such networks are extremely rich and they offer novel ways to think about how mutations can alter dynamics.

Combinatorial explosion in model gene networks.

PubMed

Edwards, R.; Glass, L.

2000-09-01

The explosive growth in knowledge of the genome of humans and other organisms leaves open the question of how the functioning of genes in interacting networks is coordinated for orderly activity. One approach to this problem is to study mathematical properties of abstract network models that capture the logical structures of gene networks. The principal issue is to understand how particular patterns of activity can result from particular network structures, and what types of behavior are possible. We study idealized models in which the logical structure of the network is explicitly represented by Boolean functions that can be represented by directed graphs on n-cubes, but which are continuous in time and described by differential equations, rather than being updated synchronously via a discrete clock. The equations are piecewise linear, which allows significant analysis and facilitates rapid integration along trajectories. We first give a combinatorial solution to the question of how many distinct logical structures exist for n-dimensional networks, showing that the number increases very rapidly with n. We then outline analytic methods that can be used to establish the existence, stability and periods of periodic orbits corresponding to particular cycles on the n-cube. We use these methods to confirm the existence of limit cycles discovered in a sample of a million randomly generated structures of networks of 4 genes. Even with only 4 genes, at least several hundred different patterns of stable periodic behavior are possible, many of them surprisingly complex. We discuss ways of further classifying these periodic behaviors, showing that small mutations (reversal of one or a few edges on the n-cube) need not destroy the stability of a limit cycle. Although these networks are very simple as models of gene networks, their mathematical transparency reveals relationships between structure and behavior, they suggest that the possibilities for orderly dynamics in such networks are extremely rich and they offer novel ways to think about how mutations can alter dynamics. (c) 2000 American Institute of Physics.

Multiscale modeling of brain dynamics: from single neurons and networks to mathematical tools.

PubMed

Siettos, Constantinos; Starke, Jens

2016-09-01

The extreme complexity of the brain naturally requires mathematical modeling approaches on a large variety of scales; the spectrum ranges from single neuron dynamics over the behavior of groups of neurons to neuronal network activity. Thus, the connection between the microscopic scale (single neuron activity) to macroscopic behavior (emergent behavior of the collective dynamics) and vice versa is a key to understand the brain in its complexity. In this work, we attempt a review of a wide range of approaches, ranging from the modeling of single neuron dynamics to machine learning. The models include biophysical as well as data-driven phenomenological models. The discussed models include Hodgkin-Huxley, FitzHugh-Nagumo, coupled oscillators (Kuramoto oscillators, Rössler oscillators, and the Hindmarsh-Rose neuron), Integrate and Fire, networks of neurons, and neural field equations. In addition to the mathematical models, important mathematical methods in multiscale modeling and reconstruction of the causal connectivity are sketched. The methods include linear and nonlinear tools from statistics, data analysis, and time series analysis up to differential equations, dynamical systems, and bifurcation theory, including Granger causal connectivity analysis, phase synchronization connectivity analysis, principal component analysis (PCA), independent component analysis (ICA), and manifold learning algorithms such as ISOMAP, and diffusion maps and equation-free techniques. WIREs Syst Biol Med 2016, 8:438-458. doi: 10.1002/wsbm.1348 For further resources related to this article, please visit the WIREs website. © 2016 Wiley Periodicals, Inc.

Application of artificial neural network for heat transfer in porous cone

NASA Astrophysics Data System (ADS)

Athani, Abdulgaphur; Ahamad, N. Ameer; Badruddin, Irfan Anjum

2018-05-01

Heat transfer in porous medium is one of the classical areas of research that has been active for many decades. The heat transfer in porous medium is generally studied by using numerical methods such as finite element method; finite difference method etc. that solves coupled partial differential equations by converting them into simpler forms. The current work utilizes an alternate method known as artificial neural network that mimics the learning characteristics of neurons. The heat transfer in porous medium fixed in a cone is predicted using backpropagation neural network. The artificial neural network is able to predict this behavior quite accurately.

Asymptotic theory of time-varying social networks with heterogeneous activity and tie allocation.

PubMed

Ubaldi, Enrico; Perra, Nicola; Karsai, Márton; Vezzani, Alessandro; Burioni, Raffaella; Vespignani, Alessandro

2016-10-24

The dynamic of social networks is driven by the interplay between diverse mechanisms that still challenge our theoretical and modelling efforts. Amongst them, two are known to play a central role in shaping the networks evolution, namely the heterogeneous propensity of individuals to i) be socially active and ii) establish a new social relationships with their alters. Here, we empirically characterise these two mechanisms in seven real networks describing temporal human interactions in three different settings: scientific collaborations, Twitter mentions, and mobile phone calls. We find that the individuals' social activity and their strategy in choosing ties where to allocate their social interactions can be quantitatively described and encoded in a simple stochastic network modelling framework. The Master Equation of the model can be solved in the asymptotic limit. The analytical solutions provide an explicit description of both the system dynamic and the dynamical scaling laws characterising crucial aspects about the evolution of the networks. The analytical predictions match with accuracy the empirical observations, thus validating the theoretical approach. Our results provide a rigorous dynamical system framework that can be extended to include other processes shaping social dynamics and to generate data driven predictions for the asymptotic behaviour of social networks.

Asymptotic theory of time-varying social networks with heterogeneous activity and tie allocation

NASA Astrophysics Data System (ADS)

Ubaldi, Enrico; Perra, Nicola; Karsai, Márton; Vezzani, Alessandro; Burioni, Raffaella; Vespignani, Alessandro

2016-10-01

The dynamic of social networks is driven by the interplay between diverse mechanisms that still challenge our theoretical and modelling efforts. Amongst them, two are known to play a central role in shaping the networks evolution, namely the heterogeneous propensity of individuals to i) be socially active and ii) establish a new social relationships with their alters. Here, we empirically characterise these two mechanisms in seven real networks describing temporal human interactions in three different settings: scientific collaborations, Twitter mentions, and mobile phone calls. We find that the individuals’ social activity and their strategy in choosing ties where to allocate their social interactions can be quantitatively described and encoded in a simple stochastic network modelling framework. The Master Equation of the model can be solved in the asymptotic limit. The analytical solutions provide an explicit description of both the system dynamic and the dynamical scaling laws characterising crucial aspects about the evolution of the networks. The analytical predictions match with accuracy the empirical observations, thus validating the theoretical approach. Our results provide a rigorous dynamical system framework that can be extended to include other processes shaping social dynamics and to generate data driven predictions for the asymptotic behaviour of social networks.

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.

Methods for parameter identification in oscillatory networks and application to cortical and thalamic 600 Hz activity.

PubMed

Leistritz, L; Suesse, T; Haueisen, J; Hilgenfeld, B; Witte, H

2006-01-01

Directed information transfer in the human brain occurs presumably by oscillations. As of yet, most approaches for the analysis of these oscillations are based on time-frequency or coherence analysis. The present work concerns the modeling of cortical 600 Hz oscillations, localized within the Brodmann Areas 3b and 1 after stimulation of the nervus medianus, by means of coupled differential equations. This approach leads to the so-called parameter identification problem, where based on a given data set, a set of unknown parameters of a system of ordinary differential equations is determined by special optimization procedures. Some suitable algorithms for this task are presented in this paper. Finally an oscillatory network model is optimally fitted to the data taken from ten volunteers.

Sparse Additive Ordinary Differential Equations for Dynamic Gene Regulatory Network Modeling.

PubMed

Wu, Hulin; Lu, Tao; Xue, Hongqi; Liang, Hua

2014-04-02

The gene regulation network (GRN) is a high-dimensional complex system, which can be represented by various mathematical or statistical models. The ordinary differential equation (ODE) model is one of the popular dynamic GRN models. High-dimensional linear ODE models have been proposed to identify GRNs, but with a limitation of the linear regulation effect assumption. In this article, we propose a sparse additive ODE (SA-ODE) model, coupled with ODE estimation methods and adaptive group LASSO techniques, to model dynamic GRNs that could flexibly deal with nonlinear regulation effects. The asymptotic properties of the proposed method are established and simulation studies are performed to validate the proposed approach. An application example for identifying the nonlinear dynamic GRN of T-cell activation is used to illustrate the usefulness of the proposed method.

TIde: a software for the systematic scanning of drug targets in kinetic network models

PubMed Central

Schulz, Marvin; Bakker, Barbara M; Klipp, Edda

2009-01-01

Background During the stages of the development of a potent drug candidate compounds can fail for several reasons. One of them, the efficacy of a candidate, can be estimated in silico if an appropriate ordinary differential equation model of the affected pathway is available. With such a model at hand it is also possible to detect reactions having a large effect on a certain variable such as a substance concentration. Results We show an algorithm that systematically tests the influence of activators and inhibitors of different type and strength acting at different positions in the network. The effect on a quantity to be selected (e.g. a steady state flux or concentration) is calculated. Moreover, combinations of two inhibitors or one inhibitor and one activator targeting different network positions are analysed. Furthermore, we present TIde (Target Identification), an open source, platform independent tool to investigate ordinary differential equation models in the common systems biology markup language format. It automatically assigns the respectively altered kinetics to the inhibited or activated reactions, performs the necessary calculations, and provides a graphical output of the analysis results. For illustration, TIde is used to detect optimal inhibitor positions in simple branched networks, a signalling pathway, and a well studied model of glycolysis in Trypanosoma brucei. Conclusion Using TIde, we show in the branched models under which conditions inhibitions in a certain pathway can affect a molecule concentrations in a different. In the signalling pathway we illuminate which inhibitions have an effect on the signalling characteristics of the last active kinase. Finally, we compare our set of best targets in the glycolysis model with a similar analysis showing the applicability of our tool. PMID:19840374

Generalized activity equations for spiking neural network dynamics.

PubMed

Buice, Michael A; Chow, Carson C

2013-01-01

Much progress has been made in uncovering the computational capabilities of spiking neural networks. However, spiking neurons will always be more expensive to simulate compared to rate neurons because of the inherent disparity in time scales-the spike duration time is much shorter than the inter-spike time, which is much shorter than any learning time scale. In numerical analysis, this is a classic stiff problem. Spiking neurons are also much more difficult to study analytically. One possible approach to making spiking networks more tractable is to augment mean field activity models with some information about spiking correlations. For example, such a generalized activity model could carry information about spiking rates and correlations between spikes self-consistently. Here, we will show how this can be accomplished by constructing a complete formal probabilistic description of the network and then expanding around a small parameter such as the inverse of the number of neurons in the network. The mean field theory of the system gives a rate-like description. The first order terms in the perturbation expansion keep track of covariances.

Physics, stability, and dynamics of supply networks

NASA Astrophysics Data System (ADS)

Helbing, Dirk; Lämmer, Stefan; Seidel, Thomas; Šeba, Pétr; Płatkowski, Tadeusz

2004-12-01

We show how to treat supply networks as physical transport problems governed by balance equations and equations for the adaptation of production speeds. Although the nonlinear behavior is different, the linearized set of coupled differential equations is formally related to those of mechanical or electrical oscillator networks. Supply networks possess interesting features due to their complex topology and directed links. We derive analytical conditions for absolute and convective instabilities. The empirically observed “bullwhip effect” in supply chains is explained as a form of convective instability based on resonance effects. Moreover, it is generalized to arbitrary supply networks. Their related eigenvalues are usually complex, depending on the network structure (even without loops). Therefore, their generic behavior is characterized by damped or growing oscillations. We also show that regular distribution networks possess two negative eigenvalues only, but perturbations generate a spectrum of complex eigenvalues.

Computerized power supply analysis: State equation generation and terminal models

NASA Technical Reports Server (NTRS)

Garrett, S. J.

1978-01-01

To aid engineers that design power supply systems two analysis tools that can be used with the state equation analysis package were developed. These tools include integration routines that start with the description of a power supply in state equation form and yield analytical results. The first tool uses a computer program that works with the SUPER SCEPTRE circuit analysis program and prints the state equation for an electrical network. The state equations developed automatically by the computer program are used to develop an algorithm for reducing the number of state variables required to describe an electrical network. In this way a second tool is obtained in which the order of the network is reduced and a simpler terminal model is obtained.

Modelling of piezoelectric actuator dynamics for active structural control

NASA Technical Reports Server (NTRS)

Hagood, Nesbitt W.; Chung, Walter H.; Von Flotow, Andreas

1990-01-01

The paper models the effects of dynamic coupling between a structure and an electrical network through the piezoelectric effect. The coupled equations of motion of an arbitrary elastic structure with piezoelectric elements and passive electronics are derived. State space models are developed for three important cases: direct voltage driven electrodes, direct charge driven electrodes, and an indirect drive case where the piezoelectric electrodes are connected to an arbitrary electrical circuit with embedded voltage and current sources. The equations are applied to the case of a cantilevered beam with surface mounted piezoceramics and indirect voltage and current drive. The theoretical derivations are validated experimentally on an actively controlled cantilevered beam test article with indirect voltage drive.

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses.

PubMed

Ocker, Gabriel Koch; Litwin-Kumar, Ashok; Doiron, Brent

2015-08-01

The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure.

Self-Organization of Microcircuits in Networks of Spiking Neurons with Plastic Synapses

PubMed Central

Ocker, Gabriel Koch; Litwin-Kumar, Ashok; Doiron, Brent

2015-01-01

The synaptic connectivity of cortical networks features an overrepresentation of certain wiring motifs compared to simple random-network models. This structure is shaped, in part, by synaptic plasticity that promotes or suppresses connections between neurons depending on their joint spiking activity. Frequently, theoretical studies focus on how feedforward inputs drive plasticity to create this network structure. We study the complementary scenario of self-organized structure in a recurrent network, with spike timing-dependent plasticity driven by spontaneous dynamics. We develop a self-consistent theory for the evolution of network structure by combining fast spiking covariance with a slow evolution of synaptic weights. Through a finite-size expansion of network dynamics we obtain a low-dimensional set of nonlinear differential equations for the evolution of two-synapse connectivity motifs. With this theory in hand, we explore how the form of the plasticity rule drives the evolution of microcircuits in cortical networks. When potentiation and depression are in approximate balance, synaptic dynamics depend on weighted divergent, convergent, and chain motifs. For additive, Hebbian STDP these motif interactions create instabilities in synaptic dynamics that either promote or suppress the initial network structure. Our work provides a consistent theoretical framework for studying how spiking activity in recurrent networks interacts with synaptic plasticity to determine network structure. PMID:26291697

Genetic network inference as a series of discrimination tasks.

PubMed

Kimura, Shuhei; Nakayama, Satoshi; Hatakeyama, Mariko

2009-04-01

Genetic network inference methods based on sets of differential equations generally require a great deal of time, as the equations must be solved many times. To reduce the computational cost, researchers have proposed other methods for inferring genetic networks by solving sets of differential equations only a few times, or even without solving them at all. When we try to obtain reasonable network models using these methods, however, we must estimate the time derivatives of the gene expression levels with great precision. In this study, we propose a new method to overcome the drawbacks of inference methods based on sets of differential equations. Our method infers genetic networks by obtaining classifiers capable of predicting the signs of the derivatives of the gene expression levels. For this purpose, we defined a genetic network inference problem as a series of discrimination tasks, then solved the defined series of discrimination tasks with a linear programming machine. Our experimental results demonstrated that the proposed method is capable of correctly inferring genetic networks, and doing so more than 500 times faster than the other inference methods based on sets of differential equations. Next, we applied our method to actual expression data of the bacterial SOS DNA repair system. And finally, we demonstrated that our approach relates to the inference method based on the S-system model. Though our method provides no estimation of the kinetic parameters, it should be useful for researchers interested only in the network structure of a target system. Supplementary data are available at Bioinformatics online.

Compression of Flow Can Reveal Overlapping-Module Organization in Networks

NASA Astrophysics Data System (ADS)

Viamontes Esquivel, Alcides; Rosvall, Martin

2011-10-01

To better understand the organization of overlapping modules in large networks with respect to flow, we introduce the map equation for overlapping modules. In this information-theoretic framework, we use the correspondence between compression and regularity detection. The generalized map equation measures how well we can compress a description of flow in the network when we partition it into modules with possible overlaps. When we minimize the generalized map equation over overlapping network partitions, we detect modules that capture flow and determine which nodes at the boundaries between modules should be classified in multiple modules and to what degree. With a novel greedy-search algorithm, we find that some networks, for example, the neural network of the nematode Caenorhabditis elegans, are best described by modules dominated by hard boundaries, but that others, for example, the sparse European-roads network, have an organization of highly overlapping modules.

Irregular behavior in an excitatory-inhibitory neuronal network

NASA Astrophysics Data System (ADS)

Park, Choongseok; Terman, David

2010-06-01

Excitatory-inhibitory networks arise in many regions throughout the central nervous system and display complex spatiotemporal firing patterns. These neuronal activity patterns (of individual neurons and/or the whole network) are closely related to the functional status of the system and differ between normal and pathological states. For example, neurons within the basal ganglia, a group of subcortical nuclei that are responsible for the generation of movement, display a variety of dynamic behaviors such as correlated oscillatory activity and irregular, uncorrelated spiking. Neither the origins of these firing patterns nor the mechanisms that underlie the patterns are well understood. We consider a biophysical model of an excitatory-inhibitory network in the basal ganglia and explore how specific biophysical properties of the network contribute to the generation of irregular spiking. We use geometric dynamical systems and singular perturbation methods to systematically reduce the model to a simpler set of equations, which is suitable for analysis. The results specify the dependence on the strengths of synaptic connections and the intrinsic firing properties of the cells in the irregular regime when applied to the subthalamopallidal network of the basal ganglia.

Stochastic Prediction and Feedback Control of Router Queue Size in a Virtual Network Environment

DTIC Science & Technology

2014-09-18

predictor equations, while the update equations for measurement can be thought of as corrector equations. 11 2.3.1.1 Predict Equations In the... Adaptive Filters and Self -Learning Systems. Springer London, 2005. [11] Zarchan, P., and Musoff, H. Fundamentals of Kalman filtering: A Practical...iv AFIT-ENG-T-14-S-10 Abstract Modern congestion and routing management algorithms work well for networks with static topologies and moderate

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.

Lumping of degree-based mean-field and pair-approximation equations for multistate contact processes

NASA Astrophysics Data System (ADS)

Kyriakopoulos, Charalampos; Grossmann, Gerrit; Wolf, Verena; Bortolussi, Luca

2018-01-01

Contact processes form a large and highly interesting class of dynamic processes on networks, including epidemic and information-spreading networks. While devising stochastic models of such processes is relatively easy, analyzing them is very challenging from a computational point of view, particularly for large networks appearing in real applications. One strategy to reduce the complexity of their analysis is to rely on approximations, often in terms of a set of differential equations capturing the evolution of a random node, distinguishing nodes with different topological contexts (i.e., different degrees of different neighborhoods), such as degree-based mean-field (DBMF), approximate-master-equation (AME), or pair-approximation (PA) approaches. The number of differential equations so obtained is typically proportional to the maximum degree kmax of the network, which is much smaller than the size of the master equation of the underlying stochastic model, yet numerically solving these equations can still be problematic for large kmax. In this paper, we consider AME and PA, extended to cope with multiple local states, and we provide an aggregation procedure that clusters together nodes having similar degrees, treating those in the same cluster as indistinguishable, thus reducing the number of equations while preserving an accurate description of global observables of interest. We also provide an automatic way to build such equations and to identify a small number of degree clusters that give accurate results. The method is tested on several case studies, where it shows a high level of compression and a reduction of computational time of several orders of magnitude for large networks, with minimal loss in accuracy.

Absence of visual experience modifies the neural basis of numerical thinking.

PubMed

Kanjlia, Shipra; Lane, Connor; Feigenson, Lisa; Bedny, Marina

2016-10-04

In humans, the ability to reason about mathematical quantities depends on a frontoparietal network that includes the intraparietal sulcus (IPS). How do nature and nurture give rise to the neurobiology of numerical cognition? We asked how visual experience shapes the neural basis of numerical thinking by studying numerical cognition in congenitally blind individuals. Blind (n = 17) and blindfolded sighted (n = 19) participants solved math equations that varied in difficulty (e.g., 27 - 12 = x vs. 7 - 2 = x), and performed a control sentence comprehension task while undergoing fMRI. Whole-cortex analyses revealed that in both blind and sighted participants, the IPS and dorsolateral prefrontal cortices were more active during the math task than the language task, and activity in the IPS increased parametrically with equation difficulty. Thus, the classic frontoparietal number network is preserved in the total absence of visual experience. However, surprisingly, blind but not sighted individuals additionally recruited a subset of early visual areas during symbolic math calculation. The functional profile of these "visual" regions was identical to that of the IPS in blind but not sighted individuals. Furthermore, in blindness, number-responsive visual cortices exhibited increased functional connectivity with prefrontal and IPS regions that process numbers. We conclude that the frontoparietal number network develops independently of visual experience. In blindness, this number network colonizes parts of deafferented visual cortex. These results suggest that human cortex is highly functionally flexible early in life, and point to frontoparietal input as a mechanism of cross-modal plasticity in blindness.

Solving differential equations with unknown constitutive relations as recurrent neural networks

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

Hagge, Tobias J.; Stinis, Panagiotis; Yeung, Enoch H.

We solve a system of ordinary differential equations with an unknown functional form of a sink (reaction rate) term. We assume that the measurements (time series) of state variables are partially available, and use a recurrent neural network to “learn” the reaction rate from this data. This is achieved by including discretized ordinary differential equations as part of a recurrent neural network training problem. We extend TensorFlow’s recurrent neural network architecture to create a simple but scalable and effective solver for the unknown functions, and apply it to a fedbatch bioreactor simulation problem. Use of techniques from recent deep learningmore » literature enables training of functions with behavior manifesting over thousands of time steps. Our networks are structurally similar to recurrent neural networks, but differ in purpose, and require modified training strategies.« less

Control of collective network chaos.

PubMed

Wagemakers, Alexandre; Barreto, Ernest; Sanjuán, Miguel A F; So, Paul

2014-06-01

Under certain conditions, the collective behavior of a large globally-coupled heterogeneous network of coupled oscillators, as quantified by the macroscopic mean field or order parameter, can exhibit low-dimensional chaotic behavior. Recent advances describe how a small set of "reduced" ordinary differential equations can be derived that captures this mean field behavior. Here, we show that chaos control algorithms designed using the reduced equations can be successfully applied to imperfect realizations of the full network. To systematically study the effectiveness of this technique, we measure the quality of control as we relax conditions that are required for the strict accuracy of the reduced equations, and hence, the controller. Although the effects are network-dependent, we show that the method is effective for surprisingly small networks, for modest departures from global coupling, and even with mild inaccuracy in the estimate of network heterogeneity.

An electric-analog simulation of elliptic partial differential equations using finite element theory

USGS Publications Warehouse

Franke, O.L.; Pinder, G.F.; Patten, E.P.

1982-01-01

Elliptic partial differential equations can be solved using the Galerkin-finite element method to generate the approximating algebraic equations, and an electrical network to solve the resulting matrices. Some element configurations require the use of networks containing negative resistances which, while physically realizable, are more expensive and time-consuming to construct. ?? 1982.

Mean-field equations for neuronal networks with arbitrary degree distributions.

PubMed

Nykamp, Duane Q; Friedman, Daniel; Shaker, Sammy; Shinn, Maxwell; Vella, Michael; Compte, Albert; Roxin, Alex

2017-04-01

The emergent dynamics in networks of recurrently coupled spiking neurons depends on the interplay between single-cell dynamics and network topology. Most theoretical studies on network dynamics have assumed simple topologies, such as connections that are made randomly and independently with a fixed probability (Erdös-Rényi network) (ER) or all-to-all connected networks. However, recent findings from slice experiments suggest that the actual patterns of connectivity between cortical neurons are more structured than in the ER random network. Here we explore how introducing additional higher-order statistical structure into the connectivity can affect the dynamics in neuronal networks. Specifically, we consider networks in which the number of presynaptic and postsynaptic contacts for each neuron, the degrees, are drawn from a joint degree distribution. We derive mean-field equations for a single population of homogeneous neurons and for a network of excitatory and inhibitory neurons, where the neurons can have arbitrary degree distributions. Through analysis of the mean-field equations and simulation of networks of integrate-and-fire neurons, we show that such networks have potentially much richer dynamics than an equivalent ER network. Finally, we relate the degree distributions to so-called cortical motifs.

Mean-field equations for neuronal networks with arbitrary degree distributions

NASA Astrophysics Data System (ADS)

Nykamp, Duane Q.; Friedman, Daniel; Shaker, Sammy; Shinn, Maxwell; Vella, Michael; Compte, Albert; Roxin, Alex

2017-04-01

The emergent dynamics in networks of recurrently coupled spiking neurons depends on the interplay between single-cell dynamics and network topology. Most theoretical studies on network dynamics have assumed simple topologies, such as connections that are made randomly and independently with a fixed probability (Erdös-Rényi network) (ER) or all-to-all connected networks. However, recent findings from slice experiments suggest that the actual patterns of connectivity between cortical neurons are more structured than in the ER random network. Here we explore how introducing additional higher-order statistical structure into the connectivity can affect the dynamics in neuronal networks. Specifically, we consider networks in which the number of presynaptic and postsynaptic contacts for each neuron, the degrees, are drawn from a joint degree distribution. We derive mean-field equations for a single population of homogeneous neurons and for a network of excitatory and inhibitory neurons, where the neurons can have arbitrary degree distributions. Through analysis of the mean-field equations and simulation of networks of integrate-and-fire neurons, we show that such networks have potentially much richer dynamics than an equivalent ER network. Finally, we relate the degree distributions to so-called cortical motifs.

Mean Field Analysis of Stochastic Neural Network Models with Synaptic Depression

NASA Astrophysics Data System (ADS)

Yasuhiko Igarashi,; Masafumi Oizumi,; Masato Okada,

2010-08-01

We investigated the effects of synaptic depression on the macroscopic behavior of stochastic neural networks. Dynamical mean field equations were derived for such networks by taking the average of two stochastic variables: a firing-state variable and a synaptic variable. In these equations, the average product of thesevariables is decoupled as the product of their averages because the two stochastic variables are independent. We proved the independence of these two stochastic variables assuming that the synaptic weight Jij is of the order of 1/N with respect to the number of neurons N. Using these equations, we derived macroscopic steady-state equations for a network with uniform connections and for a ring attractor network with Mexican hat type connectivity and investigated the stability of the steady-state solutions. An oscillatory uniform state was observed in the network with uniform connections owing to a Hopf instability. For the ring network, high-frequency perturbations were shown not to affect system stability. Two mechanisms destabilize the inhomogeneous steady state, leading to two oscillatory states. A Turing instability leads to a rotating bump state, while a Hopf instability leads to an oscillatory bump state, which was previously unreported. Various oscillatory states take place in a network with synaptic depression depending on the strength of the interneuron connections.

Modeling Dynamic Functional Neuroimaging Data Using Structural Equation Modeling

ERIC Educational Resources Information Center

Price, Larry R.; Laird, Angela R.; Fox, Peter T.; Ingham, Roger J.

2009-01-01

The aims of this study were to present a method for developing a path analytic network model using data acquired from positron emission tomography. Regions of interest within the human brain were identified through quantitative activation likelihood estimation meta-analysis. Using this information, a "true" or population path model was then…

Social network and census tract-level influences on substance use among emerging adult males: An activity spaces approach

PubMed Central

Gibson, Crystal; Perley, Lauren; Bailey, Jonathan; Barbour, Russell; Kershaw, Trace

2015-01-01

Social network and area level characteristics have been linked to substance use. We used snowball sampling to recruit 90 predominantly African American emerging adult men who provided typical locations visited (n=510). We used generalized estimating equations to examine social network and area level predictors of substance use. Lower social network quality was associated with days of marijuana use (B=-0.0037, p<0.0001) and problem alcohol use (B=-0.0050, p=0.0181). The influence of area characteristics on substance use differed between risky and non-risky spaces. Peer and area influences are important for substance use among men, and may differ for high and low risk places. PMID:26176810

Maximum and minimum return losses from a passive two-port network terminated with a mismatched load

NASA Technical Reports Server (NTRS)

Otoshi, T. Y.

1993-01-01

This article presents an analytical method for determining the exact distance a load is required to be offset from a passive two-port network to obtain maximum or minimum return losses from the terminated two-port network. Equations are derived in terms of two-port network S-parameters and load reflection coefficient. The equations are useful for predicting worst-case performances of some types of networks that are terminated with offset short-circuit loads.

A stochastic-field description of finite-size spiking neural networks

PubMed Central

Longtin, André

2017-01-01

Neural network dynamics are governed by the interaction of spiking neurons. Stochastic aspects of single-neuron dynamics propagate up to the network level and shape the dynamical and informational properties of the population. Mean-field models of population activity disregard the finite-size stochastic fluctuations of network dynamics and thus offer a deterministic description of the system. Here, we derive a stochastic partial differential equation (SPDE) describing the temporal evolution of the finite-size refractory density, which represents the proportion of neurons in a given refractory state at any given time. The population activity—the density of active neurons per unit time—is easily extracted from this refractory density. The SPDE includes finite-size effects through a two-dimensional Gaussian white noise that acts both in time and along the refractory dimension. For an infinite number of neurons the standard mean-field theory is recovered. A discretization of the SPDE along its characteristic curves allows direct simulations of the activity of large but finite spiking networks; this constitutes the main advantage of our approach. Linearizing the SPDE with respect to the deterministic asynchronous state allows the theoretical investigation of finite-size activity fluctuations. In particular, analytical expressions for the power spectrum and autocorrelation of activity fluctuations are obtained. Moreover, our approach can be adapted to incorporate multiple interacting populations and quasi-renewal single-neuron dynamics. PMID:28787447

Lumping of degree-based mean-field and pair-approximation equations for multistate contact processes.

PubMed

Kyriakopoulos, Charalampos; Grossmann, Gerrit; Wolf, Verena; Bortolussi, Luca

2018-01-01

Contact processes form a large and highly interesting class of dynamic processes on networks, including epidemic and information-spreading networks. While devising stochastic models of such processes is relatively easy, analyzing them is very challenging from a computational point of view, particularly for large networks appearing in real applications. One strategy to reduce the complexity of their analysis is to rely on approximations, often in terms of a set of differential equations capturing the evolution of a random node, distinguishing nodes with different topological contexts (i.e., different degrees of different neighborhoods), such as degree-based mean-field (DBMF), approximate-master-equation (AME), or pair-approximation (PA) approaches. The number of differential equations so obtained is typically proportional to the maximum degree k_{max} of the network, which is much smaller than the size of the master equation of the underlying stochastic model, yet numerically solving these equations can still be problematic for large k_{max}. In this paper, we consider AME and PA, extended to cope with multiple local states, and we provide an aggregation procedure that clusters together nodes having similar degrees, treating those in the same cluster as indistinguishable, thus reducing the number of equations while preserving an accurate description of global observables of interest. We also provide an automatic way to build such equations and to identify a small number of degree clusters that give accurate results. The method is tested on several case studies, where it shows a high level of compression and a reduction of computational time of several orders of magnitude for large networks, with minimal loss in accuracy.

A reverse engineering algorithm for neural networks, applied to the subthalamopallidal network of basal ganglia.

PubMed

Floares, Alexandru George

2008-01-01

Modeling neural networks with ordinary differential equations systems is a sensible approach, but also very difficult. This paper describes a new algorithm based on linear genetic programming which can be used to reverse engineer neural networks. The RODES algorithm automatically discovers the structure of the network, including neural connections, their signs and strengths, estimates its parameters, and can even be used to identify the biophysical mechanisms involved. The algorithm is tested on simulated time series data, generated using a realistic model of the subthalamopallidal network of basal ganglia. The resulting ODE system is highly accurate, and results are obtained in a matter of minutes. This is because the problem of reverse engineering a system of coupled differential equations is reduced to one of reverse engineering individual algebraic equations. The algorithm allows the incorporation of common domain knowledge to restrict the solution space. To our knowledge, this is the first time a realistic reverse engineering algorithm based on linear genetic programming has been applied to neural networks.

Neural network error correction for solving coupled ordinary differential equations

NASA Technical Reports Server (NTRS)

Shelton, R. O.; Darsey, J. A.; Sumpter, B. G.; Noid, D. W.

1992-01-01

A neural network is presented to learn errors generated by a numerical algorithm for solving coupled nonlinear differential equations. The method is based on using a neural network to correctly learn the error generated by, for example, Runge-Kutta on a model molecular dynamics (MD) problem. The neural network programs used in this study were developed by NASA. Comparisons are made for training the neural network using backpropagation and a new method which was found to converge with fewer iterations. The neural net programs, the MD model and the calculations are discussed.

Resource Sharing via Planed Relay for [InlineEquation not available: see fulltext.

NASA Astrophysics Data System (ADS)

Shen, Chong; Rea, Susan; Pesch, Dirk

2008-12-01

We present an improved version of adaptive distributed cross-layer routing algorithm (ADCR) for hybrid wireless network with dedicated relay stations ([InlineEquation not available: see fulltext.]) in this paper. A mobile terminal (MT) may borrow radio resources that are available thousands mile away via secure multihop RNs, where RNs are placed at pre-engineered locations in the network. In rural places such as mountain areas, an MT may also communicate with the core network, when intermediate MTs act as relay node with mobility. To address cross-layer network layers routing issues, the cascaded ADCR establishes routing paths across MTs, RNs, and cellular base stations (BSs) and provides appropriate quality of service (QoS). We verify the routing performance benefits of [InlineEquation not available: see fulltext.] over other networks by intensive simulation.

Injection Drug Users’ Involvement In Drug Economy: Dynamics of Sociometric and Egocentric Social Networks

PubMed Central

Yang, Cui; Latkin, Carl; Muth, Stephen Q.; Rudolph, Abby

2014-01-01

The purpose of this analysis was to examine the effect of social network cohesiveness on drug economy involvement, and to test whether this relationship is mediated by drug support network size in a sample of active injection drug users. Involvement in the drug economy was defined by self-report of participation in at least one of the following activities: selling drugs, holding drugs or money for drugs, providing street security for drug sellers, cutting/packaging/cooking drugs, selling or renting drug paraphernalia (e.g., pipes, tools, rigs), and injecting drugs in others’ veins. The sample consists of 273 active injection drug users in Baltimore, Maryland who reported having injected drugs in the last 6 months and were recruited through either street outreach or by their network members. Egocentric drug support networks were assessed through a social network inventory at baseline. Sociometric networks were built upon the linkages by selected matching characteristics, and k-plex rank was used to characterize the level of cohesiveness of the individual to others in the social network. Although no direct effect was observed, structural equation modeling indicated k-plex rank was indirectly associated with drug economy involvement through drug support network size. These findings suggest the effects of large-scale sociometric networks on injectors’ drug economy involvement may occur through their immediate egocentric networks. Future harm reduction programs for injection drug users (IDUs) should consider providing programs coupled with economic opportunities to those drug users within a cohesive network subgroup. Moreover, individuals with a high connectivity to others in their network may be optimal individuals to train for diffusing HIV prevention messages. PMID:25309015

Optimization with artificial neural network systems - A mapping principle and a comparison to gradient based methods

NASA Technical Reports Server (NTRS)

Leong, Harrison Monfook

1988-01-01

General formulae for mapping optimization problems into systems of ordinary differential equations associated with artificial neural networks are presented. A comparison is made to optimization using gradient-search methods. The performance measure is the settling time from an initial state to a target state. A simple analytical example illustrates a situation where dynamical systems representing artificial neural network methods would settle faster than those representing gradient-search. Settling time was investigated for a more complicated optimization problem using computer simulations. The problem was a simplified version of a problem in medical imaging: determining loci of cerebral activity from electromagnetic measurements at the scalp. The simulations showed that gradient based systems typically settled 50 to 100 times faster than systems based on current neural network optimization methods.

Effects of active links on epidemic transmission over social networks

NASA Astrophysics Data System (ADS)

Zhu, Guanghu; Chen, Guanrong; Fu, Xinchu

2017-02-01

A new epidemic model with two infection periods is developed to account for the human behavior in social network, where newly infected individuals gradually restrict most of future contacts or are quarantined, causing infectivity change from a degree-dependent form to a constant. The corresponding dynamics are formulated by a set of ordinary differential equations (ODEs) via mean-field approximation. The effects of diverse infectivity on the epidemic dynamics ​are examined, with a behavioral interpretation of the basic reproduction number. Results show that such simple adaptive reactions largely determine the impact of network structure on epidemics. Particularly, a theorem proposed by Lajmanovich and Yorke in 1976 is generalized, so that it can be applied for the analysis of the epidemic models with multi-compartments especially network-coupled ODE systems.

Neural Networks for Signal Processing and Control

NASA Astrophysics Data System (ADS)

Hesselroth, Ted Daniel

Neural networks are developed for controlling a robot-arm and camera system and for processing images. The networks are based upon computational schemes that may be found in the brain. In the first network, a neural map algorithm is employed to control a five-joint pneumatic robot arm and gripper through feedback from two video cameras. The pneumatically driven robot arm employed shares essential mechanical characteristics with skeletal muscle systems. To control the position of the arm, 200 neurons formed a network representing the three-dimensional workspace embedded in a four-dimensional system of coordinates from the two cameras, and learned a set of pressures corresponding to the end effector positions, as well as a set of Jacobian matrices for interpolating between these positions. Because of the properties of the rubber-tube actuators of the arm, the position as a function of supplied pressure is nonlinear, nonseparable, and exhibits hysteresis. Nevertheless, through the neural network learning algorithm the position could be controlled to an accuracy of about one pixel (~3 mm) after two hundred learning steps. Applications of repeated corrections in each step via the Jacobian matrices leads to a very robust control algorithm since the Jacobians learned by the network have to satisfy the weak requirement that they yield a reduction of the distance between gripper and target. The second network is proposed as a model for the mammalian vision system in which backward connections from the primary visual cortex (V1) to the lateral geniculate nucleus play a key role. The application of hebbian learning to the forward and backward connections causes the formation of receptive fields which are sensitive to edges, bars, and spatial frequencies of preferred orientations. The receptive fields are learned in such a way as to maximize the rate of transfer of information from the LGN to V1. Orientational preferences are organized into a feature map in the primary visual cortex by the application of lateral interactions during the learning phase. The organization of the mature network is compared to that found in the macaque monkey by several analytical tests. The capacity of the network to process images is investigated. By a method of reconstructing the input images in terms of V1 activities, the simulations show that images can be faithfully represented in V1 by the proposed network. The signal-to-noise ratio of the image is improved by the representation, and compression ratios of well over two-hundred are possible. Lateral interactions between V1 neurons sharpen their orientational tuning. We further study the dynamics of the processing, showing that the rate of decrease of the error of the reconstruction is maximized for the receptive fields used. Lastly, we employ a Fokker-Planck equation for a more detailed prediction of the error value vs. time. The Fokker-Planck equation for an underdamped system with a driving force is derived, yielding an energy-dependent diffusion coefficient which is the integral of the spectral densities of the force and the velocity of the system. The theory is applied to correlated noise activation and resonant activation. Simulation results for the error of the network vs time are compared to the solution of the Fokker-Planck equation.

Construction of a pulse-coupled dipole network capable of fear-like and relief-like responses

NASA Astrophysics Data System (ADS)

Lungsi Sharma, B.

2016-07-01

The challenge for neuroscience as an interdisciplinary programme is the integration of ideas among the disciplines to achieve a common goal. This paper deals with the problem of deriving a pulse-coupled neural network that is capable of demonstrating behavioural responses (fear-like and relief-like). Current pulse-coupled neural networks are designed mostly for engineering applications, particularly image processing. The discovered neural network was constructed using the method of minimal anatomies approach. The behavioural response of a level-coded activity-based model was used as a reference. Although the spiking-based model and the activity-based model are of different scales, the use of model-reference principle means that the characteristics that is referenced is its functional properties. It is demonstrated that this strategy of dissection and systematic construction is effective in the functional design of pulse-coupled neural network system with nonlinear signalling. The differential equations for the elastic weights in the reference model are replicated in the pulse-coupled network geometrically. The network reflects a possible solution to the problem of punishment and avoidance. The network developed in this work is a new network topology for pulse-coupled neural networks. Therefore, the model-reference principle is a powerful tool in connecting neuroscience disciplines. The continuity of concepts and phenomena is further maintained by systematic construction using methods like the method of minimal anatomies.

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.

Stochastic theory of large-scale enzyme-reaction networks: Finite copy number corrections to rate equation models

NASA Astrophysics Data System (ADS)

Thomas, Philipp; Straube, Arthur V.; Grima, Ramon

2010-11-01

Chemical reactions inside cells occur in compartment volumes in the range of atto- to femtoliters. Physiological concentrations realized in such small volumes imply low copy numbers of interacting molecules with the consequence of considerable fluctuations in the concentrations. In contrast, rate equation models are based on the implicit assumption of infinitely large numbers of interacting molecules, or equivalently, that reactions occur in infinite volumes at constant macroscopic concentrations. In this article we compute the finite-volume corrections (or equivalently the finite copy number corrections) to the solutions of the rate equations for chemical reaction networks composed of arbitrarily large numbers of enzyme-catalyzed reactions which are confined inside a small subcellular compartment. This is achieved by applying a mesoscopic version of the quasisteady-state assumption to the exact Fokker-Planck equation associated with the Poisson representation of the chemical master equation. The procedure yields impressively simple and compact expressions for the finite-volume corrections. We prove that the predictions of the rate equations will always underestimate the actual steady-state substrate concentrations for an enzyme-reaction network confined in a small volume. In particular we show that the finite-volume corrections increase with decreasing subcellular volume, decreasing Michaelis-Menten constants, and increasing enzyme saturation. The magnitude of the corrections depends sensitively on the topology of the network. The predictions of the theory are shown to be in excellent agreement with stochastic simulations for two types of networks typically associated with protein methylation and metabolism.

Absence of visual experience modifies the neural basis of numerical thinking

PubMed Central

Kanjlia, Shipra; Lane, Connor; Feigenson, Lisa; Bedny, Marina

2016-01-01

In humans, the ability to reason about mathematical quantities depends on a frontoparietal network that includes the intraparietal sulcus (IPS). How do nature and nurture give rise to the neurobiology of numerical cognition? We asked how visual experience shapes the neural basis of numerical thinking by studying numerical cognition in congenitally blind individuals. Blind (n = 17) and blindfolded sighted (n = 19) participants solved math equations that varied in difficulty (e.g., 27 − 12 = x vs. 7 − 2 = x), and performed a control sentence comprehension task while undergoing fMRI. Whole-cortex analyses revealed that in both blind and sighted participants, the IPS and dorsolateral prefrontal cortices were more active during the math task than the language task, and activity in the IPS increased parametrically with equation difficulty. Thus, the classic frontoparietal number network is preserved in the total absence of visual experience. However, surprisingly, blind but not sighted individuals additionally recruited a subset of early visual areas during symbolic math calculation. The functional profile of these “visual” regions was identical to that of the IPS in blind but not sighted individuals. Furthermore, in blindness, number-responsive visual cortices exhibited increased functional connectivity with prefrontal and IPS regions that process numbers. We conclude that the frontoparietal number network develops independently of visual experience. In blindness, this number network colonizes parts of deafferented visual cortex. These results suggest that human cortex is highly functionally flexible early in life, and point to frontoparietal input as a mechanism of cross-modal plasticity in blindness. PMID:27638209

Susceptible-infected-susceptible epidemics on networks with general infection and cure times.

PubMed

Cator, E; van de Bovenkamp, R; Van Mieghem, P

2013-06-01

The classical, continuous-time susceptible-infected-susceptible (SIS) Markov epidemic model on an arbitrary network is extended to incorporate infection and curing or recovery times each characterized by a general distribution (rather than an exponential distribution as in Markov processes). This extension, called the generalized SIS (GSIS) model, is believed to have a much larger applicability to real-world epidemics (such as information spread in online social networks, real diseases, malware spread in computer networks, etc.) that likely do not feature exponential times. While the exact governing equations for the GSIS model are difficult to deduce due to their non-Markovian nature, accurate mean-field equations are derived that resemble our previous N-intertwined mean-field approximation (NIMFA) and so allow us to transfer the whole analytic machinery of the NIMFA to the GSIS model. In particular, we establish the criterion to compute the epidemic threshold in the GSIS model. Moreover, we show that the average number of infection attempts during a recovery time is the more natural key parameter, instead of the effective infection rate in the classical, continuous-time SIS Markov model. The relative simplicity of our mean-field results enables us to treat more general types of SIS epidemics, while offering an easier key parameter to measure the average activity of those general viral agents.

Recursively constructing analytic expressions for equilibrium distributions of stochastic biochemical reaction networks.

PubMed

Meng, X Flora; Baetica, Ania-Ariadna; Singhal, Vipul; Murray, Richard M

2017-05-01

Noise is often indispensable to key cellular activities, such as gene expression, necessitating the use of stochastic models to capture its dynamics. The chemical master equation (CME) is a commonly used stochastic model of Kolmogorov forward equations that describe how the probability distribution of a chemically reacting system varies with time. Finding analytic solutions to the CME can have benefits, such as expediting simulations of multiscale biochemical reaction networks and aiding the design of distributional responses. However, analytic solutions are rarely known. A recent method of computing analytic stationary solutions relies on gluing simple state spaces together recursively at one or two states. We explore the capabilities of this method and introduce algorithms to derive analytic stationary solutions to the CME. We first formally characterize state spaces that can be constructed by performing single-state gluing of paths, cycles or both sequentially. We then study stochastic biochemical reaction networks that consist of reversible, elementary reactions with two-dimensional state spaces. We also discuss extending the method to infinite state spaces and designing the stationary behaviour of stochastic biochemical reaction networks. Finally, we illustrate the aforementioned ideas using examples that include two interconnected transcriptional components and biochemical reactions with two-dimensional state spaces. © 2017 The Author(s).

Susceptible-infected-susceptible epidemics on networks with general infection and cure times

NASA Astrophysics Data System (ADS)

Cator, E.; van de Bovenkamp, R.; Van Mieghem, P.

2013-06-01

The classical, continuous-time susceptible-infected-susceptible (SIS) Markov epidemic model on an arbitrary network is extended to incorporate infection and curing or recovery times each characterized by a general distribution (rather than an exponential distribution as in Markov processes). This extension, called the generalized SIS (GSIS) model, is believed to have a much larger applicability to real-world epidemics (such as information spread in online social networks, real diseases, malware spread in computer networks, etc.) that likely do not feature exponential times. While the exact governing equations for the GSIS model are difficult to deduce due to their non-Markovian nature, accurate mean-field equations are derived that resemble our previous N-intertwined mean-field approximation (NIMFA) and so allow us to transfer the whole analytic machinery of the NIMFA to the GSIS model. In particular, we establish the criterion to compute the epidemic threshold in the GSIS model. Moreover, we show that the average number of infection attempts during a recovery time is the more natural key parameter, instead of the effective infection rate in the classical, continuous-time SIS Markov model. The relative simplicity of our mean-field results enables us to treat more general types of SIS epidemics, while offering an easier key parameter to measure the average activity of those general viral agents.

Recursively constructing analytic expressions for equilibrium distributions of stochastic biochemical reaction networks

PubMed Central

Baetica, Ania-Ariadna; Singhal, Vipul; Murray, Richard M.

2017-01-01

Noise is often indispensable to key cellular activities, such as gene expression, necessitating the use of stochastic models to capture its dynamics. The chemical master equation (CME) is a commonly used stochastic model of Kolmogorov forward equations that describe how the probability distribution of a chemically reacting system varies with time. Finding analytic solutions to the CME can have benefits, such as expediting simulations of multiscale biochemical reaction networks and aiding the design of distributional responses. However, analytic solutions are rarely known. A recent method of computing analytic stationary solutions relies on gluing simple state spaces together recursively at one or two states. We explore the capabilities of this method and introduce algorithms to derive analytic stationary solutions to the CME. We first formally characterize state spaces that can be constructed by performing single-state gluing of paths, cycles or both sequentially. We then study stochastic biochemical reaction networks that consist of reversible, elementary reactions with two-dimensional state spaces. We also discuss extending the method to infinite state spaces and designing the stationary behaviour of stochastic biochemical reaction networks. Finally, we illustrate the aforementioned ideas using examples that include two interconnected transcriptional components and biochemical reactions with two-dimensional state spaces. PMID:28566513

Non-linear quantitative structure-activity relationship for adenine derivatives as competitive inhibitors of adenosine deaminase

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

Sadat Hayatshahi, Sayyed Hamed; Abdolmaleki, Parviz; Safarian, Shahrokh

2005-12-16

Logistic regression and artificial neural networks have been developed as two non-linear models to establish quantitative structure-activity relationships between structural descriptors and biochemical activity of adenosine based competitive inhibitors, toward adenosine deaminase. The training set included 24 compounds with known k {sub i} values. The models were trained to solve two-class problems. Unlike the previous work in which multiple linear regression was used, the highest of positive charge on the molecules was recognized to be in close relation with their inhibition activity, while the electric charge on atom N1 of adenosine was found to be a poor descriptor. Consequently, themore » previously developed equation was improved and the newly formed one could predict the class of 91.66% of compounds correctly. Also optimized 2-3-1 and 3-4-1 neural networks could increase this rate to 95.83%.« less

Numerical methods for solving moment equations in kinetic theory of neuronal network dynamics

NASA Astrophysics Data System (ADS)

Rangan, Aaditya V.; Cai, David; Tao, Louis

2007-02-01

Recently developed kinetic theory and related closures for neuronal network dynamics have been demonstrated to be a powerful theoretical framework for investigating coarse-grained dynamical properties of neuronal networks. The moment equations arising from the kinetic theory are a system of (1 + 1)-dimensional nonlinear partial differential equations (PDE) on a bounded domain with nonlinear boundary conditions. The PDEs themselves are self-consistently specified by parameters which are functions of the boundary values of the solution. The moment equations can be stiff in space and time. Numerical methods are presented here for efficiently and accurately solving these moment equations. The essential ingredients in our numerical methods include: (i) the system is discretized in time with an implicit Euler method within a spectral deferred correction framework, therefore, the PDEs of the kinetic theory are reduced to a sequence, in time, of boundary value problems (BVPs) with nonlinear boundary conditions; (ii) a set of auxiliary parameters is introduced to recast the original BVP with nonlinear boundary conditions as BVPs with linear boundary conditions - with additional algebraic constraints on the auxiliary parameters; (iii) a careful combination of two Newton's iterates for the nonlinear BVP with linear boundary condition, interlaced with a Newton's iterate for solving the associated algebraic constraints is constructed to achieve quadratic convergence for obtaining the solutions with self-consistent parameters. It is shown that a simple fixed-point iteration can only achieve a linear convergence for the self-consistent parameters. The practicability and efficiency of our numerical methods for solving the moment equations of the kinetic theory are illustrated with numerical examples. It is further demonstrated that the moment equations derived from the kinetic theory of neuronal network dynamics can very well capture the coarse-grained dynamical properties of integrate-and-fire neuronal networks.

Linear network representation of multistate models of transport.

PubMed Central

Sandblom, J; Ring, A; Eisenman, G

1982-01-01

By introducing external driving forces in rate-theory models of transport we show how the Eyring rate equations can be transformed into Ohm's law with potentials that obey Kirchhoff's second law. From such a formalism the state diagram of a multioccupancy multicomponent system can be directly converted into linear network with resistors connecting nodal (branch) points and with capacitances connecting each nodal point with a reference point. The external forces appear as emf or current generators in the network. This theory allows the algebraic methods of linear network theory to be used in solving the flux equations for multistate models and is particularly useful for making proper simplifying approximation in models of complex membrane structure. Some general properties of linear network representation are also deduced. It is shown, for instance, that Maxwell's reciprocity relationships of linear networks lead directly to Onsager's relationships in the near equilibrium region. Finally, as an example of the procedure, the equivalent circuit method is used to solve the equations for a few transport models. PMID:7093425

Asymptotically inspired moment-closure approximation for adaptive networks

NASA Astrophysics Data System (ADS)

Shkarayev, Maxim; Shaw, Leah

2012-02-01

Adaptive social networks, in which nodes and network structure co-evolve, are often described using a mean-field system of equations for the density of node and link types. These equations constitute an open system due to dependence on higher order topological structures. We propose a moment-closure approximation based on the analytical description of the system in an asymptotic regime. We apply the proposed approach to two examples of adaptive networks: recruitment to a cause model and epidemic spread model. We show a good agreement between the improved mean-field prediction and simulations of the full network system.

Asymptotically inspired moment-closure approximation for adaptive networks

NASA Astrophysics Data System (ADS)

Shkarayev, Maxim

2013-03-01

Dynamics of adaptive social networks, in which nodes and network structure co-evolve, are often described using a mean-field system of equations for the density of node and link types. These equations constitute an open system due to dependence on higher order topological structures. We propose a systematic approach to moment closure approximation based on the analytical description of the system in an asymptotic regime. We apply the proposed approach to two examples of adaptive networks: recruitment to a cause model and adaptive epidemic model. We show a good agreement between the mean-field prediction and simulations of the full network system.

Asymptotically inspired moment-closure approximation for adaptive networks

NASA Astrophysics Data System (ADS)

Shkarayev, Maxim S.; Shaw, Leah B.

2013-11-01

Adaptive social networks, in which nodes and network structure coevolve, are often described using a mean-field system of equations for the density of node and link types. These equations constitute an open system due to dependence on higher-order topological structures. We propose a new approach to moment closure based on the analytical description of the system in an asymptotic regime. We apply the proposed approach to two examples of adaptive networks: recruitment to a cause model and adaptive epidemic model. We show a good agreement between the improved mean-field prediction and simulations of the full network system.

A robust fractional-order PID controller design based on active queue management for TCP network

NASA Astrophysics Data System (ADS)

Hamidian, Hamideh; Beheshti, Mohammad T. H.

2018-01-01

In this paper, a robust fractional-order controller is designed to control the congestion in transmission control protocol (TCP) networks with time-varying parameters. Fractional controllers can increase the stability and robustness. Regardless of advantages of fractional controllers, they are still not common in congestion control in TCP networks. The network parameters are time-varying, so the robust stability is important in congestion controller design. Therefore, we focused on the robust controller design. The fractional PID controller is developed based on active queue management (AQM). D-partition technique is used. The most important property of designed controller is the robustness to the time-varying parameters of the TCP network. The vertex quasi-polynomials of the closed-loop characteristic equation are obtained, and the stability boundaries are calculated for each vertex quasi-polynomial. The intersection of all stability regions is insensitive to network parameter variations, and results in robust stability of TCP/AQM system. NS-2 simulations show that the proposed algorithm provides a stable queue length. Moreover, simulations show smaller oscillations of the queue length and less packet drop probability for FPID compared to PI and PID controllers. We can conclude from NS-2 simulations that the average packet loss probability variations are negligible when the network parameters change.

Method and Apparatus for Predicting Unsteady Pressure and Flow Rate Distribution in a Fluid Network

NASA Technical Reports Server (NTRS)

Majumdar, Alok K. (Inventor)

2009-01-01

A method and apparatus for analyzing steady state and transient flow in a complex fluid network, modeling phase changes, compressibility, mixture thermodynamics, external body forces such as gravity and centrifugal force and conjugate heat transfer. In some embodiments, a graphical user interface provides for the interactive development of a fluid network simulation having nodes and branches. In some embodiments, mass, energy, and specific conservation equations are solved at the nodes, and momentum conservation equations are solved in the branches. In some embodiments, contained herein are data objects for computing thermodynamic and thermophysical properties for fluids. In some embodiments, the systems of equations describing the fluid network are solved by a hybrid numerical method that is a combination of the Newton-Raphson and successive substitution methods.

Emergent properties of interacting populations of spiking neurons.

PubMed

Cardanobile, Stefano; Rotter, Stefan

2011-01-01

Dynamic neuronal networks are a key paradigm of increasing importance in brain research, concerned with the functional analysis of biological neuronal networks and, at the same time, with the synthesis of artificial brain-like systems. In this context, neuronal network models serve as mathematical tools to understand the function of brains, but they might as well develop into future tools for enhancing certain functions of our nervous system. Here, we present and discuss our recent achievements in developing multiplicative point processes into a viable mathematical framework for spiking network modeling. The perspective is that the dynamic behavior of these neuronal networks is faithfully reflected by a set of non-linear rate equations, describing all interactions on the population level. These equations are similar in structure to Lotka-Volterra equations, well known by their use in modeling predator-prey relations in population biology, but abundant applications to economic theory have also been described. We present a number of biologically relevant examples for spiking network function, which can be studied with the help of the aforementioned correspondence between spike trains and specific systems of non-linear coupled ordinary differential equations. We claim that, enabled by the use of multiplicative point processes, we can make essential contributions to a more thorough understanding of the dynamical properties of interacting neuronal populations.

Emergent Properties of Interacting Populations of Spiking Neurons

PubMed Central

Cardanobile, Stefano; Rotter, Stefan

2011-01-01

Dynamic neuronal networks are a key paradigm of increasing importance in brain research, concerned with the functional analysis of biological neuronal networks and, at the same time, with the synthesis of artificial brain-like systems. In this context, neuronal network models serve as mathematical tools to understand the function of brains, but they might as well develop into future tools for enhancing certain functions of our nervous system. Here, we present and discuss our recent achievements in developing multiplicative point processes into a viable mathematical framework for spiking network modeling. The perspective is that the dynamic behavior of these neuronal networks is faithfully reflected by a set of non-linear rate equations, describing all interactions on the population level. These equations are similar in structure to Lotka-Volterra equations, well known by their use in modeling predator-prey relations in population biology, but abundant applications to economic theory have also been described. We present a number of biologically relevant examples for spiking network function, which can be studied with the help of the aforementioned correspondence between spike trains and specific systems of non-linear coupled ordinary differential equations. We claim that, enabled by the use of multiplicative point processes, we can make essential contributions to a more thorough understanding of the dynamical properties of interacting neuronal populations. PMID:22207844

Unified Framework for Deriving Simultaneous Equation Algorithms for Water Distribution Networks

EPA Science Inventory

The known formulations for steady state hydraulics within looped water distribution networks are re-derived in terms of linear and non-linear transformations of the original set of partly linear and partly non-linear equations that express conservation of mass and energy. All of ...

Gene regulatory networks: a coarse-grained, equation-free approach to multiscale computation.

PubMed

Erban, Radek; Kevrekidis, Ioannis G; Adalsteinsson, David; Elston, Timothy C

2006-02-28

We present computer-assisted methods for analyzing stochastic models of gene regulatory networks. The main idea that underlies this equation-free analysis is the design and execution of appropriately initialized short bursts of stochastic simulations; the results of these are processed to estimate coarse-grained quantities of interest, such as mesoscopic transport coefficients. In particular, using a simple model of a genetic toggle switch, we illustrate the computation of an effective free energy Phi and of a state-dependent effective diffusion coefficient D that characterize an unavailable effective Fokker-Planck equation. Additionally we illustrate the linking of equation-free techniques with continuation methods for performing a form of stochastic "bifurcation analysis"; estimation of mean switching times in the case of a bistable switch is also implemented in this equation-free context. The accuracy of our methods is tested by direct comparison with long-time stochastic simulations. This type of equation-free analysis appears to be a promising approach to computing features of the long-time, coarse-grained behavior of certain classes of complex stochastic models of gene regulatory networks, circumventing the need for long Monte Carlo simulations.

In Search of Police Investigative Thinking Styles: An Exploratory Study of Detectives in Norway and Singapore

ERIC Educational Resources Information Center

Dean, Geoff; Fahsing, Ivar Andre; Gottschalk, Petter

2007-01-01

In this paper, we argue that more research attention needs to be devoted to profile how investigators think when attempting to solve crimes and dismantle terrorist networks. Since 9/11, there is much activity focused on profiling criminals and terrorists but little on the other side of the investigative equation the detectives/investigators…

Experimental implementation of acoustic impedance control by a 2D network of distributed smart cells

NASA Astrophysics Data System (ADS)

David, P.; Collet, M.; Cote, J.-M.

2010-03-01

New miniaturization and integration capabilities available from emerging microelectromechanical system (MEMS) technology will allow silicon-based artificial skins involving thousands of elementary actuators to be developed in the near future. Smart structures combining large arrays of elementary motion pixels are thus being studied so that fundamental properties could be dynamically adjusted. This paper investigates the acoustical capabilities of a network of distributed transducers connected with a suitable controlling strategy. The research aims at designing an integrated active interface for sound attenuation by using suitable changes of acoustical impedance. The control strategy is based on partial differential equations (PDE) and the multiscaled physics of electromechanical elements. Specific techniques based on PDE control theory have provided a simple boundary control equation able to annihilate the reflections of acoustic waves. To experimentally implement the method, the control strategy is discretized as a first order time-space operator. The obtained quasi-collocated architecture, composed of a large number of sensors and actuators, provides high robustness and stability. The experimental results demonstrate how a well controlled active skin can substantially modify sound reflectivity of the acoustical interface and reduce the propagation of acoustic waves.

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.

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

PubMed Central

Soltani, M.; Chen, P.

2013-01-01

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

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.

Introduction to focus issue: quantitative approaches to genetic networks.

PubMed

Albert, Réka; Collins, James J; Glass, Leon

2013-06-01

All cells of living organisms contain similar genetic instructions encoded in the organism's DNA. In any particular cell, the control of the expression of each different gene is regulated, in part, by binding of molecular complexes to specific regions of the DNA. The molecular complexes are composed of protein molecules, called transcription factors, combined with various other molecules such as hormones and drugs. Since transcription factors are coded by genes, cellular function is partially determined by genetic networks. Recent research is making large strides to understand both the structure and the function of these networks. Further, the emerging discipline of synthetic biology is engineering novel gene circuits with specific dynamic properties to advance both basic science and potential practical applications. Although there is not yet a universally accepted mathematical framework for studying the properties of genetic networks, the strong analogies between the activation and inhibition of gene expression and electric circuits suggest frameworks based on logical switching circuits. This focus issue provides a selection of papers reflecting current research directions in the quantitative analysis of genetic networks. The work extends from molecular models for the binding of proteins, to realistic detailed models of cellular metabolism. Between these extremes are simplified models in which genetic dynamics are modeled using classical methods of systems engineering, Boolean switching networks, differential equations that are continuous analogues of Boolean switching networks, and differential equations in which control is based on power law functions. The mathematical techniques are applied to study: (i) naturally occurring gene networks in living organisms including: cyanobacteria, Mycoplasma genitalium, fruit flies, immune cells in mammals; (ii) synthetic gene circuits in Escherichia coli and yeast; and (iii) electronic circuits modeling genetic networks using field-programmable gate arrays. Mathematical analyses will be essential for understanding naturally occurring genetic networks in diverse organisms and for providing a foundation for the improved development of synthetic genetic networks.

Introduction to Focus Issue: Quantitative Approaches to Genetic Networks

NASA Astrophysics Data System (ADS)

Albert, Réka; Collins, James J.; Glass, Leon

2013-06-01

All cells of living organisms contain similar genetic instructions encoded in the organism's DNA. In any particular cell, the control of the expression of each different gene is regulated, in part, by binding of molecular complexes to specific regions of the DNA. The molecular complexes are composed of protein molecules, called transcription factors, combined with various other molecules such as hormones and drugs. Since transcription factors are coded by genes, cellular function is partially determined by genetic networks. Recent research is making large strides to understand both the structure and the function of these networks. Further, the emerging discipline of synthetic biology is engineering novel gene circuits with specific dynamic properties to advance both basic science and potential practical applications. Although there is not yet a universally accepted mathematical framework for studying the properties of genetic networks, the strong analogies between the activation and inhibition of gene expression and electric circuits suggest frameworks based on logical switching circuits. This focus issue provides a selection of papers reflecting current research directions in the quantitative analysis of genetic networks. The work extends from molecular models for the binding of proteins, to realistic detailed models of cellular metabolism. Between these extremes are simplified models in which genetic dynamics are modeled using classical methods of systems engineering, Boolean switching networks, differential equations that are continuous analogues of Boolean switching networks, and differential equations in which control is based on power law functions. The mathematical techniques are applied to study: (i) naturally occurring gene networks in living organisms including: cyanobacteria, Mycoplasma genitalium, fruit flies, immune cells in mammals; (ii) synthetic gene circuits in Escherichia coli and yeast; and (iii) electronic circuits modeling genetic networks using field-programmable gate arrays. Mathematical analyses will be essential for understanding naturally occurring genetic networks in diverse organisms and for providing a foundation for the improved development of synthetic genetic networks.

Measure-valued solutions to nonlocal transport equations on networks

NASA Astrophysics Data System (ADS)

Camilli, Fabio; De Maio, Raul; Tosin, Andrea

2018-06-01

Aiming to describe traffic flow on road networks with long-range driver interactions, we study a nonlinear transport equation defined on an oriented network where the velocity field depends not only on the state variable but also on the distribution of the population. We prove existence, uniqueness and continuous dependence results of the solution intended in a suitable measure-theoretic sense. We also provide a representation formula in terms of the push-forward of the initial and boundary data along the network and discuss an explicit example of nonlocal velocity field fitting our framework.

Cellerator: extending a computer algebra system to include biochemical arrows for signal transduction simulations

NASA Technical Reports Server (NTRS)

Shapiro, Bruce E.; Levchenko, Andre; Meyerowitz, Elliot M.; Wold, Barbara J.; Mjolsness, Eric D.

2003-01-01

Cellerator describes single and multi-cellular signal transduction networks (STN) with a compact, optionally palette-driven, arrow-based notation to represent biochemical reactions and transcriptional activation. Multi-compartment systems are represented as graphs with STNs embedded in each node. Interactions include mass-action, enzymatic, allosteric and connectionist models. Reactions are translated into differential equations and can be solved numerically to generate predictive time courses or output as systems of equations that can be read by other programs. Cellerator simulations are fully extensible and portable to any operating system that supports Mathematica, and can be indefinitely nested within larger data structures to produce highly scaleable models.

A method for the automated construction of the joint system of equations to solve the problem of the flow distribution in hydraulic networks

NASA Astrophysics Data System (ADS)

Novikov, A. E.

1993-10-01

There are several methods of solving the problem of the flow distribution in hydraulic networks. But all these methods have no mathematical tools for forming joint systems of equations to solve this problem. This paper suggests a method of constructing joint systems of equations to calculate hydraulic circuits of the arbitrary form. The graph concept, according to Kirchhoff, has been introduced.

Stochastic lumping analysis for linear kinetics and its application to the fluctuation relations between hierarchical kinetic networks.

PubMed

Deng, De-Ming; Chang, Cheng-Hung

2015-05-14

Conventional studies of biomolecular behaviors rely largely on the construction of kinetic schemes. Since the selection of these networks is not unique, a concern is raised whether and under which conditions hierarchical schemes can reveal the same experimentally measured fluctuating behaviors and unique fluctuation related physical properties. To clarify these questions, we introduce stochasticity into the traditional lumping analysis, generalize it from rate equations to chemical master equations and stochastic differential equations, and extract the fluctuation relations between kinetically and thermodynamically equivalent networks under intrinsic and extrinsic noises. The results provide a theoretical basis for the legitimate use of low-dimensional models in the studies of macromolecular fluctuations and, more generally, for exploring stochastic features in different levels of contracted networks in chemical and biological kinetic systems.

Periodic synchronization control of discontinuous delayed networks by using extended Filippov-framework.

PubMed

Cai, Zuowei; Huang, Lihong; Guo, Zhenyuan; Zhang, Lingling; Wan, Xuting

2015-08-01

This paper is concerned with the periodic synchronization problem for a general class of delayed neural networks (DNNs) with discontinuous neuron activation. One of the purposes is to analyze the problem of periodic orbits. To do so, we introduce new tools including inequality techniques and Kakutani's fixed point theorem of set-valued maps to derive the existence of periodic solution. Another purpose is to design a switching state-feedback control for realizing global exponential synchronization of the drive-response network system with periodic coefficients. Unlike the previous works on periodic synchronization of neural network, both the neuron activations and controllers in this paper are allowed to be discontinuous. Moreover, owing to the occurrence of delays in neuron signal, the neural network model is described by the functional differential equation. So we introduce extended Filippov-framework to deal with the basic issues of solutions for discontinuous DNNs. Finally, two examples and simulation experiments are given to illustrate the proposed method and main results which have an important instructional significance in the design of periodic synchronized DNNs circuits involving discontinuous or switching factors. Copyright © 2015 Elsevier Ltd. All rights reserved.

Network Reconstruction From High-Dimensional Ordinary Differential Equations.

PubMed

Chen, Shizhe; Shojaie, Ali; Witten, Daniela M

2017-01-01

We consider the task of learning a dynamical system from high-dimensional time-course data. For instance, we might wish to estimate a gene regulatory network from gene expression data measured at discrete time points. We model the dynamical system nonparametrically as a system of additive ordinary differential equations. Most existing methods for parameter estimation in ordinary differential equations estimate the derivatives from noisy observations. This is known to be challenging and inefficient. We propose a novel approach that does not involve derivative estimation. We show that the proposed method can consistently recover the true network structure even in high dimensions, and we demonstrate empirical improvement over competing approaches. Supplementary materials for this article are available online.

A master equation approach to actin polymerization applied to endocytosis in yeast.

PubMed

Wang, Xinxin; Carlsson, Anders E

2017-12-01

We present a Master Equation approach to calculating polymerization dynamics and force generation by branched actin networks at membranes. The method treats the time evolution of the F-actin distribution in three dimensions, with branching included as a directional spreading term. It is validated by comparison with stochastic simulations of force generation by actin polymerization at obstacles coated with actin "nucleation promoting factors" (NPFs). The method is then used to treat the dynamics of actin polymerization and force generation during endocytosis in yeast, using a model in which NPFs form a ring around the endocytic site, centered by a spot of molecules attaching the actin network strongly to the membrane. We find that a spontaneous actin filament nucleation mechanism is required for adequate forces to drive the process, that partial inhibition of branching and polymerization lead to different characteristic responses, and that a limited range of polymerization-rate values provide effective invagination and obtain correct predictions for the effects of mutations in the active regions of the NPFs.

A master equation approach to actin polymerization applied to endocytosis in yeast

PubMed Central

Wang, Xinxin

2017-01-01

We present a Master Equation approach to calculating polymerization dynamics and force generation by branched actin networks at membranes. The method treats the time evolution of the F-actin distribution in three dimensions, with branching included as a directional spreading term. It is validated by comparison with stochastic simulations of force generation by actin polymerization at obstacles coated with actin “nucleation promoting factors” (NPFs). The method is then used to treat the dynamics of actin polymerization and force generation during endocytosis in yeast, using a model in which NPFs form a ring around the endocytic site, centered by a spot of molecules attaching the actin network strongly to the membrane. We find that a spontaneous actin filament nucleation mechanism is required for adequate forces to drive the process, that partial inhibition of branching and polymerization lead to different characteristic responses, and that a limited range of polymerization-rate values provide effective invagination and obtain correct predictions for the effects of mutations in the active regions of the NPFs. PMID:29240771

Einstein Equations from Varying Complexity

NASA Astrophysics Data System (ADS)

Czech, Bartłomiej

2018-01-01

A recent proposal equates the circuit complexity of a quantum gravity state with the gravitational action of a certain patch of spacetime. Since Einstein's equations follow from varying the action, it should be possible to derive them by varying complexity. I present such a derivation for vacuum solutions of pure Einstein gravity in three-dimensional asymptotically anti-de Sitter space. The argument relies on known facts about holography and on properties of tensor network renormalization, an algorithm for coarse-graining (and optimizing) tensor networks.

Macroscopic self-oscillations and aging transition in a network of synaptically coupled quadratic integrate-and-fire neurons.

PubMed

Ratas, Irmantas; Pyragas, Kestutis

2016-09-01

We analyze the dynamics of a large network of coupled quadratic integrate-and-fire neurons, which represent the canonical model for class I neurons near the spiking threshold. The network is heterogeneous in that it includes both inherently spiking and excitable neurons. The coupling is global via synapses that take into account the finite width of synaptic pulses. Using a recently developed reduction method based on the Lorentzian ansatz, we derive a closed system of equations for the neuron's firing rate and the mean membrane potential, which are exact in the infinite-size limit. The bifurcation analysis of the reduced equations reveals a rich scenario of asymptotic behavior, the most interesting of which is the macroscopic limit-cycle oscillations. It is shown that the finite width of synaptic pulses is a necessary condition for the existence of such oscillations. The robustness of the oscillations against aging damage, which transforms spiking neurons into nonspiking neurons, is analyzed. The validity of the reduced equations is confirmed by comparing their solutions with the solutions of microscopic equations for the finite-size networks.

Hybrid discrete-time neural networks.

PubMed

Cao, Hongjun; Ibarz, Borja

2010-11-13

Hybrid dynamical systems combine evolution equations with state transitions. When the evolution equations are discrete-time (also called map-based), the result is a hybrid discrete-time system. A class of biological neural network models that has recently received some attention falls within this category: map-based neuron models connected by means of fast threshold modulation (FTM). FTM is a connection scheme that aims to mimic the switching dynamics of a neuron subject to synaptic inputs. The dynamic equations of the neuron adopt different forms according to the state (either firing or not firing) and type (excitatory or inhibitory) of their presynaptic neighbours. Therefore, the mathematical model of one such network is a combination of discrete-time evolution equations with transitions between states, constituting a hybrid discrete-time (map-based) neural network. In this paper, we review previous work within the context of these models, exemplifying useful techniques to analyse them. Typical map-based neuron models are low-dimensional and amenable to phase-plane analysis. In bursting models, fast-slow decomposition can be used to reduce dimensionality further, so that the dynamics of a pair of connected neurons can be easily understood. We also discuss a model that includes electrical synapses in addition to chemical synapses with FTM. Furthermore, we describe how master stability functions can predict the stability of synchronized states in these networks. The main results are extended to larger map-based neural networks.

Application of ANNs approach for wave-like and heat-like equations

NASA Astrophysics Data System (ADS)

Jafarian, Ahmad; Baleanu, Dumitru

2017-12-01

Artificial neural networks are data processing systems which originate from human brain tissue studies. The remarkable abilities of these networks help us to derive desired results from complicated raw data. In this study, we intend to duplicate an efficient iterative method to the numerical solution of two famous partial differential equations, namely the wave-like and heat-like problems. It should be noted that many physical phenomena such as coupling currents in a flat multi-strand two-layer super conducting cable, non-homogeneous elastic waves in soils and earthquake stresses, are described by initial-boundary value wave and heat partial differential equations with variable coefficients. To the numerical solution of these equations, a combination of the power series method and artificial neural networks approach, is used to seek an appropriate bivariate polynomial solution of the mentioned initial-boundary value problem. Finally, several computer simulations confirmed the theoretical results and demonstrating applicability of the method.

[Adherence to research reporting guidelines in biomedical journals in Latin America and the Caribbean].

PubMed

Glujovsky, Demián; Villanueva, Eleana; Reveiz, Ludovic; Murasaki, Renato

2014-10-01

To evaluate the familiarity of the editors of journals indexed in the LILACS database with the guidelines for reporting on and publishing research- promoted by the EQUATOR Network (Enhancing QUAlity and Transparency Of Health Research)-, the journals' requirements for use of the guidelines, and the editors' opinions regarding the reasons for the low rate of use. LILACS editors were surveyed by e-mail about the guidelines and their availability at the EQUATOR website, and about the requirements and difficulties in using them. Of 802 editors, 16.4% answered the survey. More than half said they were not aware of the guidelines (especially STROBE and PRISMA) and 30% were familiar with the EQUATOR Network. The first Latin American and Caribbean study on LILACS editors' familiarity with the guidelines revealed that more than half of them were not familiar either with the guidelines or the EQUATOR Network.

Numerical Modeling of Flow Distribution in Micro-Fluidics Systems

NASA Technical Reports Server (NTRS)

Majumdar, Alok; Cole, Helen; Chen, C. P.

2005-01-01

This paper describes an application of a general purpose computer program, GFSSP (Generalized Fluid System Simulation Program) for calculating flow distribution in a network of micro-channels. GFSSP employs a finite volume formulation of mass and momentum conservation equations in a network consisting of nodes and branches. Mass conservation equation is solved for pressures at the nodes while the momentum conservation equation is solved at the branches to calculate flowrate. The system of equations describing the fluid network is solved by a numerical method that is a combination of the Newton-Raphson and successive substitution methods. The numerical results have been compared with test data and detailed CFD (computational Fluid Dynamics) calculations. The agreement between test data and predictions is satisfactory. The discrepancies between the predictions and test data can be attributed to the frictional correlation which does not include the effect of surface tension or electro-kinetic effect.

Transition to synchrony in degree-frequency correlated Sakaguchi-Kuramoto model

NASA Astrophysics Data System (ADS)

Kundu, Prosenjit; Khanra, Pitambar; Hens, Chittaranjan; Pal, Pinaki

2017-11-01

We investigate transition to synchrony in degree-frequency correlated Sakaguchi-Kuramoto (SK) model on complex networks both analytically and numerically. We analytically derive self-consistent equations for group angular velocity and order parameter for the model in the thermodynamic limit. Using the self-consistent equations we investigate transition to synchronization in SK model on uncorrelated scale-free (SF) and Erdős-Rényi (ER) networks in detail. Depending on the degree distribution exponent (γ ) of SF networks and phase-frustration parameter, the population undergoes from first-order transition [explosive synchronization (ES)] to second-order transition and vice versa. In ER networks transition is always second order irrespective of the values of the phase-lag parameter. We observe that the critical coupling strength for the onset of synchronization is decreased by phase-frustration parameter in case of SF network where as in ER network, the phase-frustration delays the onset of synchronization. Extensive numerical simulations using SF and ER networks are performed to validate the analytical results. An analytical expression of critical coupling strength for the onset of synchronization is also derived from the self-consistent equations considering the vanishing order parameter limit.

Re-Evaluation of the AASHTO-Flexible Pavement Design Equation with Neural Network Modeling

PubMed Central

Tiğdemir, Mesut

2014-01-01

Here we establish that equivalent single-axle loads values can be estimated using artificial neural networks without the complex design equality of American Association of State Highway and Transportation Officials (AASHTO). More importantly, we find that the neural network model gives the coefficients to be able to obtain the actual load values using the AASHTO design values. Thus, those design traffic values that might result in deterioration can be better calculated using the neural networks model than with the AASHTO design equation. The artificial neural network method is used for this purpose. The existing AASHTO flexible pavement design equation does not currently predict the pavement performance of the strategic highway research program (Long Term Pavement Performance studies) test sections very accurately, and typically over-estimates the number of equivalent single axle loads needed to cause a measured loss of the present serviceability index. Here we aimed to demonstrate that the proposed neural network model can more accurately represent the loads values data, compared against the performance of the AASHTO formula. It is concluded that the neural network may be an appropriate tool for the development of databased-nonparametric models of pavement performance. PMID:25397962

Re-evaluation of the AASHTO-flexible pavement design equation with neural network modeling.

PubMed

Tiğdemir, Mesut

2014-01-01

Here we establish that equivalent single-axle loads values can be estimated using artificial neural networks without the complex design equality of American Association of State Highway and Transportation Officials (AASHTO). More importantly, we find that the neural network model gives the coefficients to be able to obtain the actual load values using the AASHTO design values. Thus, those design traffic values that might result in deterioration can be better calculated using the neural networks model than with the AASHTO design equation. The artificial neural network method is used for this purpose. The existing AASHTO flexible pavement design equation does not currently predict the pavement performance of the strategic highway research program (Long Term Pavement Performance studies) test sections very accurately, and typically over-estimates the number of equivalent single axle loads needed to cause a measured loss of the present serviceability index. Here we aimed to demonstrate that the proposed neural network model can more accurately represent the loads values data, compared against the performance of the AASHTO formula. It is concluded that the neural network may be an appropriate tool for the development of databased-nonparametric models of pavement performance.

Estimation of missing water-level data for the Everglades Depth Estimation Network (EDEN), 2013 update

USGS Publications Warehouse

Petkewich, Matthew D.; Conrads, Paul

2013-01-01

The Everglades Depth Estimation Network is an integrated network of real-time water-level gaging stations, a ground-elevation model, and a water-surface elevation model designed to provide scientists, engineers, and water-resource managers with water-level and water-depth information (1991-2013) for the entire freshwater portion of the Greater Everglades. The U.S. Geological Survey Greater Everglades Priority Ecosystems Science provides support for the Everglades Depth Estimation Network in order for the Network to provide quality-assured monitoring data for the U.S. Army Corps of Engineers Comprehensive Everglades Restoration Plan. In a previous study, water-level estimation equations were developed to fill in missing data to increase the accuracy of the daily water-surface elevation model. During this study, those equations were updated because of the addition and removal of water-level gaging stations, the consistent use of water-level data relative to the North American Vertical Datum of 1988, and availability of recent data (March 1, 2006, to September 30, 2011). Up to three linear regression equations were developed for each station by using three different input stations to minimize the occurrences of missing data for an input station. Of the 667 water-level estimation equations developed to fill missing data at 223 stations, more than 72 percent of the equations have coefficients of determination greater than 0.90, and 97 percent have coefficients of determination greater than 0.70.

Qualitative-Modeling-Based Silicon Neurons and Their Networks

PubMed Central

Kohno, Takashi; Sekikawa, Munehisa; Li, Jing; Nanami, Takuya; Aihara, Kazuyuki

2016-01-01

The ionic conductance models of neuronal cells can finely reproduce a wide variety of complex neuronal activities. However, the complexity of these models has prompted the development of qualitative neuron models. They are described by differential equations with a reduced number of variables and their low-dimensional polynomials, which retain the core mathematical structures. Such simple models form the foundation of a bottom-up approach in computational and theoretical neuroscience. We proposed a qualitative-modeling-based approach for designing silicon neuron circuits, in which the mathematical structures in the polynomial-based qualitative models are reproduced by differential equations with silicon-native expressions. This approach can realize low-power-consuming circuits that can be configured to realize various classes of neuronal cells. In this article, our qualitative-modeling-based silicon neuron circuits for analog and digital implementations are quickly reviewed. One of our CMOS analog silicon neuron circuits can realize a variety of neuronal activities with a power consumption less than 72 nW. The square-wave bursting mode of this circuit is explained. Another circuit can realize Class I and II neuronal activities with about 3 nW. Our digital silicon neuron circuit can also realize these classes. An auto-associative memory realized on an all-to-all connected network of these silicon neurons is also reviewed, in which the neuron class plays important roles in its performance. PMID:27378842

The stationary flow in a heterogeneous compliant vessel network

NASA Astrophysics Data System (ADS)

Filoche, Marcel; Florens, Magali

2011-09-01

We introduce a mathematical model of the hydrodynamic transport into systems consisting in a network of connected flexible pipes. In each pipe of the network, the flow is assumed to be steady and one-dimensional. The fluid-structure interaction is described through tube laws which relate the pipe diameter to the pressure difference across the pipe wall. We show that the resulting one-dimensional differential equation describing the flow in the pipe can be exactly integrated if one is able to estimate averages of the Reynolds number along the pipe. The differential equation is then transformed into a non linear scalar equation relating pressures at both ends of the pipe and the flow rate in the pipe. These equations are coupled throughout the network with mass conservation equations for the flow and zero pressure losses at the branching points of the network. This allows us to derive a general model for the computation of the flow into very large inhomogeneous networks consisting of several thousands of flexible pipes. This model is then applied to perform numerical simulations of the human lung airway system at exhalation. The topology of the system and the tube laws are taken from morphometric and physiological data in the literature. We find good qualitative and quantitative agreement between the simulation results and flow-volume loops measured in real patients. In particular, expiratory flow limitation which is an essential characteristic of forced expiration is found to be well reproduced by our simulations. Finally, a mathematical model of a pathology (Chronic Obstructive Pulmonary Disease) is introduced which allows us to quantitatively assess the influence of a moderate or severe alteration of the airway compliances.

Living on the edge of chaos: minimally nonlinear models of genetic regulatory dynamics.

PubMed

Hanel, Rudolf; Pöchacker, Manfred; Thurner, Stefan

2010-12-28

Linearized catalytic reaction equations (modelling, for example, the dynamics of genetic regulatory networks), under the constraint that expression levels, i.e. molecular concentrations of nucleic material, are positive, exhibit non-trivial dynamical properties, which depend on the average connectivity of the reaction network. In these systems, an inflation of the edge of chaos and multi-stability have been demonstrated to exist. The positivity constraint introduces a nonlinearity, which makes chaotic dynamics possible. Despite the simplicity of such minimally nonlinear systems, their basic properties allow us to understand the fundamental dynamical properties of complex biological reaction networks. We analyse the Lyapunov spectrum, determine the probability of finding stationary oscillating solutions, demonstrate the effect of the nonlinearity on the effective in- and out-degree of the active interaction network, and study how the frequency distributions of oscillatory modes of such a system depend on the average connectivity.

Solving moment hierarchies for chemical reaction networks

NASA Astrophysics Data System (ADS)

Krishnamurthy, Supriya; Smith, Eric

2017-10-01

The study of chemical reaction networks (CRN’s) is a very active field. Earlier well-known results (Feinberg 1987 Chem. Enc. Sci. 42 2229, Anderson et al 2010 Bull. Math. Biol. 72 1947) identify a topological quantity called deficiency, for any CRN, which, when exactly equal to zero, leads to a unique factorized steady-state for these networks. No results exist however for the steady states of non-zero-deficiency networks. In this paper, we show how to write the full moment-hierarchy for any non-zero-deficiency CRN obeying mass-action kinetics, in terms of equations for the factorial moments. Using these, we can recursively predict values for lower moments from higher moments, reversing the procedure usually used to solve moment hierarchies. We show, for non-trivial examples, that in this manner we can predict any moment of interest, for CRN’s with non-zero deficiency and non-factorizable steady states.

Three-phase Power Flow Calculation of Low Voltage Distribution Network Considering Characteristics of Residents Load

NASA Astrophysics Data System (ADS)

Wang, Yaping; Lin, Shunjiang; Yang, Zhibin

2017-05-01

In the traditional three-phase power flow calculation of the low voltage distribution network, the load model is described as constant power. Since this model cannot reflect the characteristics of actual loads, the result of the traditional calculation is always different from the actual situation. In this paper, the load model in which dynamic load represented by air conditioners parallel with static load represented by lighting loads is used to describe characteristics of residents load, and the three-phase power flow calculation model is proposed. The power flow calculation model includes the power balance equations of three-phase (A,B,C), the current balance equations of phase 0, and the torque balancing equations of induction motors in air conditioners. And then an alternating iterative algorithm of induction motor torque balance equations with each node balance equations is proposed to solve the three-phase power flow model. This method is applied to an actual low voltage distribution network of residents load, and by the calculation of three different operating states of air conditioners, the result demonstrates the effectiveness of the proposed model and the algorithm.

Free geometric adjustment of the SECOR Equatorial Network (Solution SECOR-27)

NASA Technical Reports Server (NTRS)

Mueller, I. I.; Kumar, M.; Soler, T.

1973-01-01

The basic purpose of this experiment is to compute reduced normal equations from the observational data of the SECOR Equatorial Network obtained from DMA/Topographic Center, D/Geodesy, Geosciences Div. Washington, D.C. These reduced normal equations are to be combined with reduced normal equations of other satellite networks of the National Geodetic Satellite Program to provide station coordinates from a single least square adjustment. An individual SECOR solution was also obtained and is presented in this report, using direction constraints computed from BC-4 optical data from stations collocated with SECOR stations. Due to the critical configuration present in the range observations, weighted height constraints were also applied in order to break the near coplanarity of the observing stations.

Energetics of glucose metabolism: a phenomenological approach to metabolic network modeling.

PubMed

Diederichs, Frank

2010-08-12

A new formalism to describe metabolic fluxes as well as membrane transport processes was developed. The new flux equations are comparable to other phenomenological laws. Michaelis-Menten like expressions, as well as flux equations of nonequilibrium thermodynamics, can be regarded as special cases of these new equations. For metabolic network modeling, variable conductances and driving forces are required to enable pathway control and to allow a rapid response to perturbations. When applied to oxidative phosphorylation, results of simulations show that whole oxidative phosphorylation cannot be described as a two-flux-system according to nonequilibrium thermodynamics, although all coupled reactions per se fulfill the equations of this theory. Simulations show that activation of ATP-coupled load reactions plus glucose oxidation is brought about by an increase of only two different conductances: a [Ca(2+)] dependent increase of cytosolic load conductances, and an increase of phosphofructokinase conductance by [AMP], which in turn becomes increased through [ADP] generation by those load reactions. In ventricular myocytes, this feedback mechanism is sufficient to increase cellular power output and O(2) consumption several fold, without any appreciable impairment of energetic parameters. Glucose oxidation proceeds near maximal power output, since transformed input and output conductances are nearly equal, yielding an efficiency of about 0.5. This conductance matching is fulfilled also by glucose oxidation of β-cells. But, as a price for the metabolic mechanism of glucose recognition, β-cells have only a limited capability to increase their power output.

Continuum Modeling and Control of Large Nonuniform Wireless Networks via Nonlinear Partial Differential Equations

DOE PAGES

Zhang, Yang; Chong, Edwin K. P.; Hannig, Jan; ...

2013-01-01

We inmore » troduce a continuum modeling method to approximate a class of large wireless networks by nonlinear partial differential equations (PDEs). This method is based on the convergence of a sequence of underlying Markov chains of the network indexed by N , the number of nodes in the network. As N goes to infinity, the sequence converges to a continuum limit, which is the solution of a certain nonlinear PDE. We first describe PDE models for networks with uniformly located nodes and then generalize to networks with nonuniformly located, and possibly mobile, nodes. Based on the PDE models, we develop a method to control the transmissions in nonuniform networks so that the continuum limit is invariant under perturbations in node locations. This enables the networks to maintain stable global characteristics in the presence of varying node locations.« less

Solitonlike pulses along a modified Noguchi nonlinear electrical network with second-neighbor interactions: Analytical studies

NASA Astrophysics Data System (ADS)

Kengne, E.; Liu, W. M.

2018-05-01

A modified lossless nonlinear Noguchi transmission network with second-neighbor interactions is considered. In the semidiscrete limit, we apply the reductive perturbation method and show that the dynamics of modulated waves propagating through the network are governed by an NLS equation with linear external potential. Classes of exact solitonic solutions of this network equation are derived, proving possible transmission of both bright and dark solitonlike pulses through the network. The effects of both the coupling second-neighbor parameter L3 and the strength λ of the linear potential on the dynamics of modulated waves through the network are investigated. One of the main results of our work is that with the introduction of the second neighbors in the network, two solitary signals, either two bright solitary signals or one bright and one dark solitary signal, may simultaneously propagate at the same frequency through the network.

Fractal ladder models and power law wave equations

PubMed Central

Kelly, James F.; McGough, Robert J.

2009-01-01

The ultrasonic attenuation coefficient in mammalian tissue is approximated by a frequency-dependent power law for frequencies less than 100 MHz. To describe this power law behavior in soft tissue, a hierarchical fractal network model is proposed. The viscoelastic and self-similar properties of tissue are captured by a constitutive equation based on a lumped parameter infinite-ladder topology involving alternating springs and dashpots. In the low-frequency limit, this ladder network yields a stress-strain constitutive equation with a time-fractional derivative. By combining this constitutive equation with linearized conservation principles and an adiabatic equation of state, a fractional partial differential equation that describes power law attenuation is derived. The resulting attenuation coefficient is a power law with exponent ranging between 1 and 2, while the phase velocity is in agreement with the Kramers–Kronig relations. The fractal ladder model is compared to published attenuation coefficient data, thus providing equivalent lumped parameters. PMID:19813816

Mapping temporal dynamics in social interactions with unified structural equation modeling: A description and demonstration revealing time-dependent sex differences in play behavior

PubMed Central

Beltz, Adriene M.; Beekman, Charles; Molenaar, Peter C. M.; Buss, Kristin A.

2013-01-01

Developmental science is rich with observations of social interactions, but few available methodological and statistical approaches take full advantage of the information provided by these data. The authors propose implementation of the unified structural equation model (uSEM), a network analysis technique, for observational data coded repeatedly across time; uSEM captures the temporal dynamics underlying changes in behavior at the individual level by revealing the ways in which a single person influences – concurrently and in the future – other people. To demonstrate the utility of uSEM, the authors applied it to ratings of positive affect and vigor of activity during children’s unstructured laboratory play with unfamiliar, same-sex peers. Results revealed the time-dependent nature of sex differences in play behavior. For girls more than boys, positive affect was dependent upon peers’ prior positive affect. For boys more than girls, vigor of activity was dependent upon peers’ current vigor of activity. PMID:24039386

Cryogenic adsorption of nitrogen on activated carbon: Experiment and modeling

NASA Astrophysics Data System (ADS)

Zou, Long-Hui; Liu, Hui-Ming; Gong, Ling-Hui

2018-03-01

A cryo-sorption device was built based on a commercial gas sorption analyzer with its sample chamber connected to the 2nd stage of the Gifford-McMahon (GM) cryocooler (by SUMITOMO Corporation), which could provide the operation temperature ranging from 4.5 K to 300 K; The nitrogen adsorption isotherms ranging from 95 to 160 K were obtained by volumetric method on the PICATIF activated carbon. Isosteric heat of adsorption was calculated using the Clausius-Clapeyron equation and was around 8 kJ/mol. Conventional isotherm models and the artificial neural network (ANN) were applied to analyze the adsorption data, the Dual-site Langmuir and the Toth equation turned out to be the most suitable empirical isotherm model; Adsorption equilibrium data at some temperature was used to train the neural network and the rest was used to validate and predict, it turned out that the accuracy of the prediction by the ANN increased with increasing hidden-layer, and it was within ±5% for the three-hidden-layer ANN, and it showed better performance than the conventional isotherm model; Considering large time consumption and complexity of the adsorption experiment, the ANN method can be applied to get more adsorption data based on the already known experimental data.

Magnetoresistance in organic semiconductors: Including pair correlations in the kinetic equations for hopping transport

NASA Astrophysics Data System (ADS)

Shumilin, A. V.; Kabanov, V. V.; Dediu, V. I.

2018-03-01

We derive kinetic equations for polaron hopping in organic materials that explicitly take into account the double occupation possibility and pair intersite correlations. The equations include simplified phenomenological spin dynamics and provide a self-consistent framework for the description of the bipolaron mechanism of the organic magnetoresistance. At low applied voltages, the equations can be reduced to those for an effective resistor network that generalizes the Miller-Abrahams network and includes the effect of spin relaxation on the system resistivity. Our theory discloses the close relationship between the organic magnetoresistance and the intersite correlations. Moreover, in the absence of correlations, as in an ordered system with zero Hubbard energy, the magnetoresistance vanishes.

Modelling real disease dynamics with behaviourally adaptive complex networks. Comment on "Coupled disease-behavior dynamics on complex networks: A review" by Z. Wang et al.

NASA Astrophysics Data System (ADS)

Small, Michael

2015-12-01

Mean field compartmental models of disease transmission have been successfully applied to a host of different scenarios, and the Kermack-McKendrick equations are now a staple of mathematical biology text books. In Susceptible-Infected-Removed format these equations provide three coupled first order ordinary differential equations with a very mild nonlinearity and they are very well understood. However, underpinning these equations are two important assumptions: that the population is (a) homogeneous, and (b) well-mixed. These assumptions become closest to being true for diseases infecting a large portion of the population for which inevitable individual effects can be averaged away. Emerging infectious disease (such as, in recent times, SARS, avian influenza, swine flu and ebola) typically does not conform to this scenario. Individual contacts and peculiarities of the transmission network play a vital role in understanding the dynamics of such relatively rare infections - particularly during the early stages of an outbreak.

Evolutionary prisoner's dilemma games coevolving on adaptive networks.

PubMed

Lee, Hsuan-Wei; Malik, Nishant; Mucha, Peter J

2018-02-01

We study a model for switching strategies in the Prisoner's Dilemma game on adaptive networks of player pairings that coevolve as players attempt to maximize their return. We use a node-based strategy model wherein each player follows one strategy at a time (cooperate or defect) across all of its neighbors, changing that strategy and possibly changing partners in response to local changes in the network of player pairing and in the strategies used by connected partners. We compare and contrast numerical simulations with existing pair approximation differential equations for describing this system, as well as more accurate equations developed here using the framework of approximate master equations. We explore the parameter space of the model, demonstrating the relatively high accuracy of the approximate master equations for describing the system observations made from simulations. We study two variations of this partner-switching model to investigate the system evolution, predict stationary states, and compare the total utilities and other qualitative differences between these two model variants.

Comparison of Mathematical Equation and Neural Network Modeling for Drying Kinetic of Mendong in Microwave Oven

NASA Astrophysics Data System (ADS)

Maulidah, Rifa'atul; Purqon, Acep

2016-08-01

Mendong (Fimbristylis globulosa) has a potentially industrial application. We investigate a predictive model for heat and mass transfer in drying kinetics during drying a Mendong. We experimentally dry the Mendong by using a microwave oven. In this study, we analyze three mathematical equations and feed forward neural network (FNN) with back propagation to describe the drying behavior of Mendong. Our results show that the experimental data and the artificial neural network model has a good agreement and better than a mathematical equation approach. The best FNN for the prediction is 3-20-1-1 structure with Levenberg- Marquardt training function. This drying kinetics modeling is potentially applied to determine the optimal parameters during mendong drying and to estimate and control of drying process.

Ground Motion Prediction Equations for Western Saudi Arabia from a Reference Model

NASA Astrophysics Data System (ADS)

Kiuchi, R.; Mooney, W. D.; Mori, J. J.; Zahran, H. M.; Al-Raddadi, W.; Youssef, S.

2017-12-01

Western Saudi Arabia is surrounded by several active seismic zones such as the Red Sea and the Gulf of Aqaba where a destructive magnitude 7.3 event occurred in 1995. Over the last decade, the Saudi Geological Survey (SGS) has deployed a dense seismic network that has made it possible to monitor seismic activity more accurately. For example, the network has detected multiple seismic swarms beneath the volcanic fields in western Saudi Arabia. The most recent damaging event was a M5.7 earthquake that occurred in 2009 at Harrat Lunayyir. In terms of seismic hazard assessment, Zahran et al. (2015; 2016) presented a Probabilistic Seismic Hazard Assessment (PSHA) for western Saudi Arabia that was developed using published Ground Motion Prediction Equations (GMPEs) from areas outside of Saudi Arabia. In this study, we consider 41 earthquakes of M 3.0 - 5.4, recorded on 124 stations of the SGS network, to create a set of 442 peak ground acceleration (PGA) and peak ground velocity (PGV) records with a range of epicentral distances from 3 km to 400 km. We use the GMPE model BSSA14 (Boore et al., 2014) as a reference model to estimate our own best-fitting coefficients from a regression analysis using the events occurred in western Saudi Arabia. For epicentral distances less than 100 km, our best fitting model has different source scaling in comparison with the GMPE of BSSA14 adjusted for the California region. In addition, our model indicates that the peak amplitudes have less attenuation in western Saudi Arabia than in California.

Solvated dissipative electro-elastic network model of hydrated proteins

NASA Astrophysics Data System (ADS)

Martin, Daniel

2013-03-01

Elastic network models coarse grain proteins into a network of residue beads connected by springs. We add dissipative dynamics to this mechanical system by applying overdamped Langevin equations of motion to normal-mode vibrations of the network. In addition, the network is made heterogeneous and softened at the protein surface by accounting for hydration of the ionized residues. Solvation changes the network Hessian in two ways. Diagonal solvation terms soften the spring constants and off-diagonal dipole-dipole terms correlate displacements of the ionized residues. The model is used to formulate the response functions of the electrostatic potential and electric field appearing in theories of redox reactions and spectroscopy. We also formulate the dielectric response of the protein and find that solvation of the surface ionized residues leads to a slow relaxation peak in the dielectric loss spectrum, about two orders of magnitude slower than the main peak of protein relaxation. Finally, the solvated network is used to formulate the allosteric response of the protein to ion binding. The global thermodynamics of ion binding is not strongly affected by the network solvation, but it dramatically enhances conformational changes in response to placing a charge at the a the active site.

Solvated dissipative electro-elastic network model of hydrated proteins

NASA Astrophysics Data System (ADS)

Martin, Daniel R.; Matyushov, Dmitry V.

2012-10-01

Elastic network models coarse grain proteins into a network of residue beads connected by springs. We add dissipative dynamics to this mechanical system by applying overdamped Langevin equations of motion to normal-mode vibrations of the network. In addition, the network is made heterogeneous and softened at the protein surface by accounting for hydration of the ionized residues. Solvation changes the network Hessian in two ways. Diagonal solvation terms soften the spring constants and off-diagonal dipole-dipole terms correlate displacements of the ionized residues. The model is used to formulate the response functions of the electrostatic potential and electric field appearing in theories of redox reactions and spectroscopy. We also formulate the dielectric response of the protein and find that solvation of the surface ionized residues leads to a slow relaxation peak in the dielectric loss spectrum, about two orders of magnitude slower than the main peak of protein relaxation. Finally, the solvated network is used to formulate the allosteric response of the protein to ion binding. The global thermodynamics of ion binding is not strongly affected by the network solvation, but it dramatically enhances conformational changes in response to placing a charge at the active site of the protein.

Multistationarity in mass action networks with applications to ERK activation.

PubMed

Conradi, Carsten; Flockerzi, Dietrich

2012-07-01

Ordinary Differential Equations (ODEs) are an important tool in many areas of Quantitative Biology. For many ODE systems multistationarity (i.e. the existence of at least two positive steady states) is a desired feature. In general establishing multistationarity is a difficult task as realistic biological models are large in terms of states and (unknown) parameters and in most cases poorly parameterized (because of noisy measurement data of few components, a very small number of data points and only a limited number of repetitions). For mass action networks establishing multistationarity hence is equivalent to establishing the existence of at least two positive solutions of a large polynomial system with unknown coefficients. For mass action networks with certain structural properties, expressed in terms of the stoichiometric matrix and the reaction rate-exponent matrix, we present necessary and sufficient conditions for multistationarity that take the form of linear inequality systems. Solutions of these inequality systems define pairs of steady states and parameter values. We also present a sufficient condition to identify networks where the aforementioned conditions hold. To show the applicability of our results we analyse an ODE system that is defined by the mass action network describing the extracellular signal-regulated kinase (ERK) cascade (i.e. ERK-activation).

Diffusion in random networks: Asymptotic properties, and numerical and engineering approximations

NASA Astrophysics Data System (ADS)

Padrino, Juan C.; Zhang, Duan Z.

2016-11-01

The ensemble phase averaging technique is applied to model mass transport by diffusion in random networks. The system consists of an ensemble of random networks, where each network is made of a set of pockets connected by tortuous channels. Inside a channel, we assume that fluid transport is governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pores mass density. The so-called dual porosity model is found to be equivalent to the leading order approximation of the integration kernel when the diffusion time scale inside the channels is small compared to the macroscopic time scale. As a test problem, we consider the one-dimensional mass diffusion in a semi-infinite domain, whose solution is sought numerically. Because of the required time to establish the linear concentration profile inside a channel, for early times the similarity variable is xt- 1 / 4 rather than xt- 1 / 2 as in the traditional theory. This early time sub-diffusive similarity can be explained by random walk theory through the network. In addition, by applying concepts of fractional calculus, we show that, for small time, the governing equation reduces to a fractional diffusion equation with known solution. We recast this solution in terms of special functions easier to compute. Comparison of the numerical and exact solutions shows excellent agreement.

Ordinary differential equations and Boolean networks in application to modelling of 6-mercaptopurine metabolism.

PubMed

Lavrova, Anastasia I; Postnikov, Eugene B; Zyubin, Andrey Yu; Babak, Svetlana V

2017-04-01

We consider two approaches to modelling the cell metabolism of 6-mercaptopurine, one of the important chemotherapy drugs used for treating acute lymphocytic leukaemia: kinetic ordinary differential equations, and Boolean networks supplied with one controlling node, which takes continual values. We analyse their interplay with respect to taking into account ATP concentration as a key parameter of switching between different pathways. It is shown that the Boolean networks, which allow avoiding the complexity of general kinetic modelling, preserve the possibility of reproducing the principal switching mechanism.

An Asynchronous Recurrent Network of Cellular Automaton-Based Neurons and Its Reproduction of Spiking Neural Network Activities.

PubMed

Matsubara, Takashi; Torikai, Hiroyuki

2016-04-01

Modeling and implementation approaches for the reproduction of input-output relationships in biological nervous tissues contribute to the development of engineering and clinical applications. However, because of high nonlinearity, the traditional modeling and implementation approaches encounter difficulties in terms of generalization ability (i.e., performance when reproducing an unknown data set) and computational resources (i.e., computation time and circuit elements). To overcome these difficulties, asynchronous cellular automaton-based neuron (ACAN) models, which are described as special kinds of cellular automata that can be implemented as small asynchronous sequential logic circuits have been proposed. This paper presents a novel type of such ACAN and a theoretical analysis of its excitability. This paper also presents a novel network of such neurons, which can mimic input-output relationships of biological and nonlinear ordinary differential equation model neural networks. Numerical analyses confirm that the presented network has a higher generalization ability than other major modeling and implementation approaches. In addition, Field-Programmable Gate Array-implementations confirm that the presented network requires lower computational resources.

Social networks and patterns of health risk behaviours over two decades: A multi-cohort study.

PubMed

Kauppi, Maarit; Elovainio, Marko; Stenholm, Sari; Virtanen, Marianna; Aalto, Ville; Koskenvuo, Markku; Kivimäki, Mika; Vahtera, Jussi

2017-08-01

To determine the associations between social network size and subsequent long-term health behaviour patterns, as indicated by alcohol use, smoking, and physical activity. Repeat data from up to six surveys over a 15- or 20-year follow-up were drawn from the Finnish Public Sector study (Raisio-Turku cohort, n=986; Hospital cohort, n=7307), and the Health and Social Support study (n=20,115). Social network size was determined at baseline, and health risk behaviours were assessed using repeated data from baseline and follow-up. We pooled cohort-specific results from repeated-measures log-binomial regression with the generalized estimating equations (GEE) method using fixed-effects meta-analysis. Participants with up to 10 members in their social network at baseline had an unhealthy risk factor profile throughout the follow-up. The pooled relative risks adjusted for age, gender, survey year, chronic conditions and education were 1.15 for heavy alcohol use (95% CI: 1.06-1.24), 1.19 for smoking (95% CI: 1.12-1.27), and 1.25 for low physical activity (95% CI: 1.21-1.29), as compared with those with >20 members in their social network. These associations appeared to be similar in subgroups stratified according to gender, age and education. Social network size predicted persistent behaviour-related health risk patterns up to at least two decades. Copyright © 2017 Elsevier Inc. All rights reserved.

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.

Discontinuous solutions of Hamilton-Jacobi equations on networks

NASA Astrophysics Data System (ADS)

Graber, P. J.; Hermosilla, C.; Zidani, H.

2017-12-01

This paper studies optimal control problems on networks without controllability assumptions at the junctions. The Value Function associated with the control problem is characterized as the solution to a system of Hamilton-Jacobi equations with appropriate junction conditions. The novel feature of the result lies in that the controllability conditions are not needed and the characterization remains valid even when the Value Function is not continuous.

Advanced Fault Diagnosis Methods in Molecular Networks

PubMed Central

Habibi, Iman; Emamian, Effat S.; Abdi, Ali

2014-01-01

Analysis of the failure of cell signaling networks is an important topic in systems biology and has applications in target discovery and drug development. In this paper, some advanced methods for fault diagnosis in signaling networks are developed and then applied to a caspase network and an SHP2 network. The goal is to understand how, and to what extent, the dysfunction of molecules in a network contributes to the failure of the entire network. Network dysfunction (failure) is defined as failure to produce the expected outputs in response to the input signals. Vulnerability level of a molecule is defined as the probability of the network failure, when the molecule is dysfunctional. In this study, a method to calculate the vulnerability level of single molecules for different combinations of input signals is developed. Furthermore, a more complex yet biologically meaningful method for calculating the multi-fault vulnerability levels is suggested, in which two or more molecules are simultaneously dysfunctional. Finally, a method is developed for fault diagnosis of networks based on a ternary logic model, which considers three activity levels for a molecule instead of the previously published binary logic model, and provides equations for the vulnerabilities of molecules in a ternary framework. Multi-fault analysis shows that the pairs of molecules with high vulnerability typically include a highly vulnerable molecule identified by the single fault analysis. The ternary fault analysis for the caspase network shows that predictions obtained using the more complex ternary model are about the same as the predictions of the simpler binary approach. This study suggests that by increasing the number of activity levels the complexity of the model grows; however, the predictive power of the ternary model does not appear to be increased proportionally. PMID:25290670

Using Equation-Free Computation to Accelerate Network-Free Stochastic Simulation of Chemical Kinetics.

PubMed

Lin, Yen Ting; Chylek, Lily A; Lemons, Nathan W; Hlavacek, William S

2018-06-21

The chemical kinetics of many complex systems can be concisely represented by reaction rules, which can be used to generate reaction events via a kinetic Monte Carlo method that has been termed network-free simulation. Here, we demonstrate accelerated network-free simulation through a novel approach to equation-free computation. In this process, variables are introduced that approximately capture system state. Derivatives of these variables are estimated using short bursts of exact stochastic simulation and finite differencing. The variables are then projected forward in time via a numerical integration scheme, after which a new exact stochastic simulation is initialized and the whole process repeats. The projection step increases efficiency by bypassing the firing of numerous individual reaction events. As we show, the projected variables may be defined as populations of building blocks of chemical species. The maximal number of connected molecules included in these building blocks determines the degree of approximation. Equation-free acceleration of network-free simulation is found to be both accurate and efficient.

Validation of WBMOD in the Southeast Asian region

NASA Astrophysics Data System (ADS)

Cervera, M. A.; Thomas, R. M.; Groves, K. M.; Ramli, A. G.; Effendy

2001-01-01

The scintillation modeling code WBMOD, developed at North West Research, provides a global description of scintillation occurrence. However, the model has had limited calibration globally. Thus its performance in localized regions such as Australia-Southeast Asia is required to be evaluated. The Defence Science and Technology Organisation, Australia, in conjunction with Indonesian National Institute of Aeronautics and Space (LAPAN), Defence Science and Technology Centre, Malaysia, Air Force Research laboratory, United States, and IPS Radio and Space Services of Australia, has commissioned a network of GPS receivers to measure scintillation from sites in the region. One of the objectives of this deployment is to carry out a validation of WBMOD in the region. This paper describes the network of GPS receivers used to record the scintillation data. The details of the procedure used to validate WBMOD are given and results of the validation are presented for data collected during 1998 and 1999 from two sites, one situated in the southern anomaly region and the other situated near the geomagnetic equator. We found good overall agreement between WBMOD and the observations for low sunspot numbers at both sites, although some differences were noted, the major one being that the scintillation activity predicted by WBMOD tended to cut off too early in the night. At higher levels of sunspot activity, while WBMOD agreed with the observations in the southern anomaly region, we found that it significantly underestimated the level of scintillation activity at the geomagnetic equator.

Application of the Artificial Neural Network model for prediction of monthly Standardized Precipitation and Evapotranspiration Index using hydrometeorological parameters and climate indices in eastern Australia

NASA Astrophysics Data System (ADS)

Deo, Ravinesh C.; Şahin, Mehmet

2015-07-01

The forecasting of drought based on cumulative influence of rainfall, temperature and evaporation is greatly beneficial for mitigating adverse consequences on water-sensitive sectors such as agriculture, ecosystems, wildlife, tourism, recreation, crop health and hydrologic engineering. Predictive models of drought indices help in assessing water scarcity situations, drought identification and severity characterization. In this paper, we tested the feasibility of the Artificial Neural Network (ANN) as a data-driven model for predicting the monthly Standardized Precipitation and Evapotranspiration Index (SPEI) for eight candidate stations in eastern Australia using predictive variable data from 1915 to 2005 (training) and simulated data for the period 2006-2012. The predictive variables were: monthly rainfall totals, mean temperature, minimum temperature, maximum temperature and evapotranspiration, which were supplemented by large-scale climate indices (Southern Oscillation Index, Pacific Decadal Oscillation, Southern Annular Mode and Indian Ocean Dipole) and the Sea Surface Temperatures (Nino 3.0, 3.4 and 4.0). A total of 30 ANN models were developed with 3-layer ANN networks. To determine the best combination of learning algorithms, hidden transfer and output functions of the optimum model, the Levenberg-Marquardt and Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton backpropagation algorithms were utilized to train the network, tangent and logarithmic sigmoid equations used as the activation functions and the linear, logarithmic and tangent sigmoid equations used as the output function. The best ANN architecture had 18 input neurons, 43 hidden neurons and 1 output neuron, trained using the Levenberg-Marquardt learning algorithm using tangent sigmoid equation as the activation and output functions. An evaluation of the model performance based on statistical rules yielded time-averaged Coefficient of Determination, Root Mean Squared Error and the Mean Absolute Error ranging from 0.9945-0.9990, 0.0466-0.1117, and 0.0013-0.0130, respectively for individual stations. Also, the Willmott's Index of Agreement and the Nash-Sutcliffe Coefficient of Efficiency were between 0.932-0.959 and 0.977-0.998, respectively. When checked for the severity (S), duration (D) and peak intensity (I) of drought events determined from the simulated and observed SPEI, differences in drought parameters ranged from - 1.41-0.64%, - 2.17-1.92% and - 3.21-1.21%, respectively. Based on performance evaluation measures, we aver that the Artificial Neural Network model is a useful data-driven tool for forecasting monthly SPEI and its drought-related properties in the region of study.

Design of optimal nonlinear network controllers for Alzheimer's disease.

PubMed

Sanchez-Rodriguez, Lazaro M; Iturria-Medina, Yasser; Baines, Erica A; Mallo, Sabela C; Dousty, Mehdy; Sotero, Roberto C

2018-05-01

Brain stimulation can modulate the activity of neural circuits impaired by Alzheimer's disease (AD), having promising clinical benefit. However, all individuals with the same condition currently receive identical brain stimulation, with limited theoretical basis for this generic approach. In this study, we introduce a control theory framework for obtaining exogenous signals that revert pathological electroencephalographic activity in AD at a minimal energetic cost, while reflecting patients' biological variability. We used anatomical networks obtained from diffusion magnetic resonance images acquired by the Alzheimer's Disease Neuroimaging Initiative (ADNI) as mediators for the interaction between Duffing oscillators. The nonlinear nature of the brain dynamics is preserved, given that we extend the so-called state-dependent Riccati equation control to reflect the stimulation objective in the high-dimensional neural system. By considering nonlinearities in our model, we identified regions for which control inputs fail to correct abnormal activity. There are changes to the way stimulated regions are ranked in terms of the energetic cost of controlling the entire network, from a linear to a nonlinear approach. We also found that limbic system and basal ganglia structures constitute the top target locations for stimulation in AD. Patients with highly integrated anatomical networks-namely, networks having low average shortest path length, high global efficiency-are the most suitable candidates for the propagation of stimuli and consequent success on the control task. Other diseases associated with alterations in brain dynamics and the self-control mechanisms of the brain can be addressed through our framework.

Global exponential synchronization of inertial memristive neural networks with time-varying delay via nonlinear controller.

PubMed

Gong, Shuqing; Yang, Shaofu; Guo, Zhenyuan; Huang, Tingwen

2018-06-01

The paper is concerned with the synchronization problem of inertial memristive neural networks with time-varying delay. First, by choosing a proper variable substitution, inertial memristive neural networks described by second-order differential equations can be transformed into first-order differential equations. Then, a novel controller with a linear diffusive term and discontinuous sign term is designed. By using the controller, the sufficient conditions for assuring the global exponential synchronization of the derive and response neural networks are derived based on Lyapunov stability theory and some inequality techniques. Finally, several numerical simulations are provided to substantiate the effectiveness of the theoretical results. Copyright © 2018 Elsevier Ltd. All rights reserved.

Discovering network behind infectious disease outbreak

NASA Astrophysics Data System (ADS)

Maeno, Yoshiharu

2010-11-01

Stochasticity and spatial heterogeneity are of great interest recently in studying the spread of an infectious disease. The presented method solves an inverse problem to discover the effectively decisive topology of a heterogeneous network and reveal the transmission parameters which govern the stochastic spreads over the network from a dataset on an infectious disease outbreak in the early growth phase. Populations in a combination of epidemiological compartment models and a meta-population network model are described by stochastic differential equations. Probability density functions are derived from the equations and used for the maximal likelihood estimation of the topology and parameters. The method is tested with computationally synthesized datasets and the WHO dataset on the SARS outbreak.

Epidemics in networks: a master equation approach

NASA Astrophysics Data System (ADS)

Cotacallapa, M.; Hase, M. O.

2016-02-01

A problem closely related to epidemiology, where a subgraph of ‘infected’ links is defined inside a larger network, is investigated. This subgraph is generated from the underlying network by a random variable, which decides whether a link is able to propagate a disease/information. The relaxation timescale of this random variable is examined in both annealed and quenched limits, and the effectiveness of propagation of disease/information is analyzed. The dynamics of the model is governed by a master equation and two types of underlying network are considered: one is scale-free and the other has exponential degree distribution. We have shown that the relaxation timescale of the contagion variable has a major influence on the topology of the subgraph of infected links, which determines the efficiency of spreading of disease/information over the network.

Bio-inspired computational heuristics to study Lane-Emden systems arising in astrophysics model.

PubMed

Ahmad, Iftikhar; Raja, Muhammad Asif Zahoor; Bilal, Muhammad; Ashraf, Farooq

2016-01-01

This study reports novel hybrid computational methods for the solutions of nonlinear singular Lane-Emden type differential equation arising in astrophysics models by exploiting the strength of unsupervised neural network models and stochastic optimization techniques. In the scheme the neural network, sub-part of large field called soft computing, is exploited for modelling of the equation in an unsupervised manner. The proposed approximated solutions of higher order ordinary differential equation are calculated with the weights of neural networks trained with genetic algorithm, and pattern search hybrid with sequential quadratic programming for rapid local convergence. The results of proposed solvers for solving the nonlinear singular systems are in good agreements with the standard solutions. Accuracy and convergence the design schemes are demonstrated by the results of statistical performance measures based on the sufficient large number of independent runs.

New Markov-Shannon Entropy models to assess connectivity quality in complex networks: from molecular to cellular pathway, Parasite-Host, Neural, Industry, and Legal-Social networks.

PubMed

Riera-Fernández, Pablo; Munteanu, Cristian R; Escobar, Manuel; Prado-Prado, Francisco; Martín-Romalde, Raquel; Pereira, David; Villalba, Karen; Duardo-Sánchez, Aliuska; González-Díaz, Humberto

2012-01-21

Graph and Complex Network theory is expanding its application to different levels of matter organization such as molecular, biological, technological, and social networks. A network is a set of items, usually called nodes, with connections between them, which are called links or edges. There are many different experimental and/or theoretical methods to assign node-node links depending on the type of network we want to construct. Unfortunately, the use of a method for experimental reevaluation of the entire network is very expensive in terms of time and resources; thus the development of cheaper theoretical methods is of major importance. In addition, different methods to link nodes in the same type of network are not totally accurate in such a way that they do not always coincide. In this sense, the development of computational methods useful to evaluate connectivity quality in complex networks (a posteriori of network assemble) is a goal of major interest. In this work, we report for the first time a new method to calculate numerical quality scores S(L(ij)) for network links L(ij) (connectivity) based on the Markov-Shannon Entropy indices of order k-th (θ(k)) for network nodes. The algorithm may be summarized as follows: (i) first, the θ(k)(j) values are calculated for all j-th nodes in a complex network already constructed; (ii) A Linear Discriminant Analysis (LDA) is used to seek a linear equation that discriminates connected or linked (L(ij)=1) pairs of nodes experimentally confirmed from non-linked ones (L(ij)=0); (iii) the new model is validated with external series of pairs of nodes; (iv) the equation obtained is used to re-evaluate the connectivity quality of the network, connecting/disconnecting nodes based on the quality scores calculated with the new connectivity function. This method was used to study different types of large networks. The linear models obtained produced the following results in terms of overall accuracy for network reconstruction: Metabolic networks (72.3%), Parasite-Host networks (93.3%), CoCoMac brain cortex co-activation network (89.6%), NW Spain fasciolosis spreading network (97.2%), Spanish financial law network (89.9%) and World trade network for Intelligent & Active Food Packaging (92.8%). In order to seek these models, we studied an average of 55,388 pairs of nodes in each model and a total of 332,326 pairs of nodes in all models. Finally, this method was used to solve a more complicated problem. A model was developed to score the connectivity quality in the Drug-Target network of US FDA approved drugs. In this last model the θ(k) values were calculated for three types of molecular networks representing different levels of organization: drug molecular graphs (atom-atom bonds), protein residue networks (amino acid interactions), and drug-target network (compound-protein binding). The overall accuracy of this model was 76.3%. This work opens a new door to the computational reevaluation of network connectivity quality (collation) for complex systems in molecular, biomedical, technological, and legal-social sciences as well as in world trade and industry. Copyright © 2011 Elsevier Ltd. All rights reserved.

Stoichiometric network analysis and associated dimensionless kinetic equations. Application to a model of the Bray-Liebhafsky reaction.

PubMed

Schmitz, Guy; Kolar-Anić, Ljiljana Z; Anić, Slobodan R; Cupić, Zeljko D

2008-12-25

The stoichiometric network analysis (SNA) introduced by B. L. Clarke is applied to a simplified model of the complex oscillating Bray-Liebhafsky reaction under batch conditions, which was not examined by this method earlier. This powerful method for the analysis of steady-states stability is also used to transform the classical differential equations into dimensionless equations. This transformation is easy and leads to a form of the equations combining the advantages of classical dimensionless equations with the advantages of the SNA. The used dimensionless parameters have orders of magnitude given by the experimental information about concentrations and currents. This simplifies greatly the study of the slow manifold and shows which parameters are essential for controlling its shape and consequently have an important influence on the trajectories. The effectiveness of these equations is illustrated on two examples: the study of the bifurcations points and a simple sensitivity analysis, different from the classical one, more based on the chemistry of the studied system.

Evaluation of the streamflow-gaging network of Alaska in providing regional streamflow information

USGS Publications Warehouse

Brabets, Timothy P.

1996-01-01

In 1906, the U.S. Geological Survey (USGS) began operating a network of streamflow-gaging stations in Alaska. The primary purpose of the streamflow- gaging network has been to provide peak flow, average flow, and low-flow characteristics to a variety of users. In 1993, the USGS began a study to evaluate the current network of 78 stations. The objectives of this study were to determine the adequacy of the existing network in predicting selected regional flow characteristics and to determine if providing additional streamflow-gaging stations could improve the network's ability to predict these characteristics. Alaska was divided into six distinct hydrologic regions: Arctic, Northwest, Southcentral, Southeast, Southwest, and Yukon. For each region, historical and current streamflow data were compiled. In Arctic, Northwest, and Southwest Alaska, insufficient data were available to develop regional regression equations. In these areas, proposed locations of streamflow-gaging stations were selected by using clustering techniques to define similar areas within a region and by spatial visual analysis using the precipitation, physiographic, and hydrologic unit maps of Alaska. Sufficient data existed in Southcentral and Southeast Alaska to use generalized least squares (GLS) procedures to develop regional regression equations to estimate the 50-year peak flow, annual average flow, and a low-flow statistic. GLS procedures were also used for Yukon Alaska but the results should be used with caution because the data do not have an adequate spatial distribution. Network analysis procedures were used for the Southcentral, Southeast, and Yukon regions. Network analysis indicates the reduction in the sampling error of the regional regression equation that can be obtained given different scenarios. For Alaska, a 10-year planning period was used. One scenario showed the results of continuing the current network with no additional gaging stations and another scenario showed the results of adding gaging stations to the network. With the exception of the annual average discharge equation for Southeast Alaska, by adding gaging stations in all three regions, the sampling error was reduced to a greater extent than by not adding gaging stations. The proposed streamflow-gaging network for Alaska consists of 308 gaging stations, of which 32 are designated as index stations. If the proposed network can not be implemented in its entirety, then a lesser cost alternative would be to establish the index stations and to implement the network for a particular region.

Inferring Gene Regulatory Networks by Singular Value Decomposition and Gravitation Field Algorithm

PubMed Central

Zheng, Ming; Wu, Jia-nan; Huang, Yan-xin; Liu, Gui-xia; Zhou, You; Zhou, Chun-guang

2012-01-01

Reconstruction of gene regulatory networks (GRNs) is of utmost interest and has become a challenge computational problem in system biology. However, every existing inference algorithm from gene expression profiles has its own advantages and disadvantages. In particular, the effectiveness and efficiency of every previous algorithm is not high enough. In this work, we proposed a novel inference algorithm from gene expression data based on differential equation model. In this algorithm, two methods were included for inferring GRNs. Before reconstructing GRNs, singular value decomposition method was used to decompose gene expression data, determine the algorithm solution space, and get all candidate solutions of GRNs. In these generated family of candidate solutions, gravitation field algorithm was modified to infer GRNs, used to optimize the criteria of differential equation model, and search the best network structure result. The proposed algorithm is validated on both the simulated scale-free network and real benchmark gene regulatory network in networks database. Both the Bayesian method and the traditional differential equation model were also used to infer GRNs, and the results were used to compare with the proposed algorithm in our work. And genetic algorithm and simulated annealing were also used to evaluate gravitation field algorithm. The cross-validation results confirmed the effectiveness of our algorithm, which outperforms significantly other previous algorithms. PMID:23226565

An innovation diffusion model of a local electricity network that is influenced by internal and external factors

NASA Astrophysics Data System (ADS)

Hattam, Laura; Greetham, Danica Vukadinović

2018-01-01

Haynes et al. (1977) derived a nonlinear differential equation to determine the spread of innovations within a social network across space and time. This model depends upon the imitators and the innovators within the social system, where the imitators respond to internal influences, whilst the innovators react to external factors. Here, this differential equation is applied to simulate the uptake of a low-carbon technology (LCT) within a real local electricity network that is situated in the UK. This network comprises of many households that are assigned to certain feeders. Firstly, travelling wave solutions of Haynes' model are used to predict adoption times as a function of the imitation and innovation influences. Then, the grid that represents the electricity network is created so that the finite element method (FEM) can be implemented. Next, innovation diffusion is modelled with Haynes' equation and the FEM, where varying magnitudes of the internal and external pressures are imposed. Consequently, the impact of these model parameters is investigated. Moreover, LCT adoption trajectories at fixed feeder locations are calculated, which give a macroscopic understanding of the uptake behaviour at specific network sites. Lastly, the adoption of LCTs at a household level is examined, where microscopic and macroscopic approaches are combined.

Active dynamics of tissue shear flow

NASA Astrophysics Data System (ADS)

Popović, Marko; Nandi, Amitabha; Merkel, Matthias; Etournay, Raphaël; Eaton, Suzanne; Jülicher, Frank; Salbreux, Guillaume

2017-03-01

We present a hydrodynamic theory to describe shear flows in developing epithelial tissues. We introduce hydrodynamic fields corresponding to state properties of constituent cells as well as a contribution to overall tissue shear flow due to rearrangements in cell network topology. We then construct a generic linear constitutive equation for the shear rate due to topological rearrangements and we investigate a novel rheological behaviour resulting from memory effects in the tissue. We identify two distinct active cellular processes: generation of active stress in the tissue, and actively driven topological rearrangements. We find that these two active processes can produce distinct cellular and tissue shape changes, depending on boundary conditions applied on the tissue. Our findings have consequences for the understanding of tissue morphogenesis during development.

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.

Comparison of Control Approaches in Genetic Regulatory Networks by Using Stochastic Master Equation Models, Probabilistic Boolean Network Models and Differential Equation Models and Estimated Error Analyzes

NASA Astrophysics Data System (ADS)

Caglar, Mehmet Umut; Pal, Ranadip

2011-03-01

Central dogma of molecular biology states that ``information cannot be transferred back from protein to either protein or nucleic acid''. However, this assumption is not exactly correct in most of the cases. There are a lot of feedback loops and interactions between different levels of systems. These types of interactions are hard to analyze due to the lack of cell level data and probabilistic - nonlinear nature of interactions. Several models widely used to analyze and simulate these types of nonlinear interactions. Stochastic Master Equation (SME) models give probabilistic nature of the interactions in a detailed manner, with a high calculation cost. On the other hand Probabilistic Boolean Network (PBN) models give a coarse scale picture of the stochastic processes, with a less calculation cost. Differential Equation (DE) models give the time evolution of mean values of processes in a highly cost effective way. The understanding of the relations between the predictions of these models is important to understand the reliability of the simulations of genetic regulatory networks. In this work the success of the mapping between SME, PBN and DE models is analyzed and the accuracy and affectivity of the control policies generated by using PBN and DE models is compared.

Study on hydraulic characteristics of mine dust-proof water supply network

NASA Astrophysics Data System (ADS)

Deng, Quanlong; Jiang, Zhongan; Han, Shuo; Fu, Enqi

2018-01-01

In order to study the hydraulic characteristics of mine dust-proof water supply network and obtain the change rule of water consumption and water pressure, according to the similarity principle and the fluid continuity equation and energy equation, the similarity criterion of mine dust-proof water supply network is deduced, and a similar model of dust-proof water supply network is established based on the prototype of Kailuan Group, the characteristics of hydraulic parameters in water supply network are studied experimentally. The results show that water pressure at each point is a dynamic process, and there is a negative correlation between water pressure and water consumption. With the increase of water consumption, the pressure of water points show a decreasing trend. According to the structure of the pipe network and the location of the water point, the influence degree on the pressure of each point is different.

Network-Cognizant Voltage Droop Control for Distribution Grids

DOE PAGES

Baker, Kyri; Bernstein, Andrey; Dall'Anese, Emiliano; ...

2017-08-07

Our paper examines distribution systems with a high integration of distributed energy resources (DERs) and addresses the design of local control methods for real-time voltage regulation. Particularly, the paper focuses on proportional control strategies where the active and reactive output-powers of DERs are adjusted in response to (and proportionally to) local changes in voltage levels. The design of the voltage-active power and voltage-reactive power characteristics leverages suitable linear approximation of the AC power-flow equations and is network-cognizant; that is, the coefficients of the controllers embed information on the location of the DERs and forecasted non-controllable loads/injections and, consequently, on themore » effect of DER power adjustments on the overall voltage profile. We pursued a robust approach to cope with uncertainty in the forecasted non-controllable loads/power injections. Stability of the proposed local controllers is analytically assessed and numerically corroborated.« less

Network-Cognizant Voltage Droop Control for Distribution Grids

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

Baker, Kyri; Bernstein, Andrey; Dall'Anese, Emiliano

Our paper examines distribution systems with a high integration of distributed energy resources (DERs) and addresses the design of local control methods for real-time voltage regulation. Particularly, the paper focuses on proportional control strategies where the active and reactive output-powers of DERs are adjusted in response to (and proportionally to) local changes in voltage levels. The design of the voltage-active power and voltage-reactive power characteristics leverages suitable linear approximation of the AC power-flow equations and is network-cognizant; that is, the coefficients of the controllers embed information on the location of the DERs and forecasted non-controllable loads/injections and, consequently, on themore » effect of DER power adjustments on the overall voltage profile. We pursued a robust approach to cope with uncertainty in the forecasted non-controllable loads/power injections. Stability of the proposed local controllers is analytically assessed and numerically corroborated.« less

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.

The effects of noise on binocular rivalry waves: a stochastic neural field model

NASA Astrophysics Data System (ADS)

Webber, Matthew A.; Bressloff, Paul C.

2013-03-01

We analyze the effects of extrinsic noise on traveling waves of visual perception in a competitive neural field model of binocular rivalry. The model consists of two one-dimensional excitatory neural fields, whose activity variables represent the responses to left-eye and right-eye stimuli, respectively. The two networks mutually inhibit each other, and slow adaptation is incorporated into the model by taking the network connections to exhibit synaptic depression. We first show how, in the absence of any noise, the system supports a propagating composite wave consisting of an invading activity front in one network co-moving with a retreating front in the other network. Using a separation of time scales and perturbation methods previously developed for stochastic reaction-diffusion equations, we then show how extrinsic noise in the activity variables leads to a diffusive-like displacement (wandering) of the composite wave from its uniformly translating position at long time scales, and fluctuations in the wave profile around its instantaneous position at short time scales. We use our analysis to calculate the first-passage-time distribution for a stochastic rivalry wave to travel a fixed distance, which we find to be given by an inverse Gaussian. Finally, we investigate the effects of noise in the depression variables, which under an adiabatic approximation lead to quenched disorder in the neural fields during propagation of a wave.

A network thermodynamic method for numerical solution of the Nernst-Planck and Poisson equation system with application to ionic transport through membranes.

PubMed

Horno, J; González-Caballero, F; González-Fernández, C F

1990-01-01

Simple techniques of network thermodynamics are used to obtain the numerical solution of the Nernst-Planck and Poisson equation system. A network model for a particular physical situation, namely ionic transport through a thin membrane with simultaneous diffusion, convection and electric current, is proposed. Concentration and electric field profiles across the membrane, as well as diffusion potential, have been simulated using the electric circuit simulation program, SPICE. The method is quite general and extremely efficient, permitting treatments of multi-ion systems whatever the boundary and experimental conditions may be.

Local and global responses in complex gene regulation networks

NASA Astrophysics Data System (ADS)

Tsuchiya, Masa; Selvarajoo, Kumar; Piras, Vincent; Tomita, Masaru; Giuliani, Alessandro

2009-04-01

An exacerbated sensitivity to apparently minor stimuli and a general resilience of the entire system stay together side-by-side in biological systems. This apparent paradox can be explained by the consideration of biological systems as very strongly interconnected network systems. Some nodes of these networks, thanks to their peculiar location in the network architecture, are responsible for the sensitivity aspects, while the large degree of interconnection is at the basis of the resilience properties of the system. One relevant feature of the high degree of connectivity of gene regulation networks is the emergence of collective ordered phenomena influencing the entire genome and not only a specific portion of transcripts. The great majority of existing gene regulation models give the impression of purely local ‘hard-wired’ mechanisms disregarding the emergence of global ordered behavior encompassing thousands of genes while the general, genome wide, aspects are less known. Here we address, on a data analysis perspective, the discrimination between local and global scale regulations, this goal was achieved by means of the examination of two biological systems: innate immune response in macrophages and oscillating growth dynamics in yeast. Our aim was to reconcile the ‘hard-wired’ local view of gene regulation with a global continuous and scalable one borrowed from statistical physics. This reconciliation is based on the network paradigm in which the local ‘hard-wired’ activities correspond to the activation of specific crucial nodes in the regulation network, while the scalable continuous responses can be equated to the collective oscillations of the network after a perturbation.

Sequential associative memory with nonuniformity of the layer sizes.

PubMed

Teramae, Jun-Nosuke; Fukai, Tomoki

2007-01-01

Sequence retrieval has a fundamental importance in information processing by the brain, and has extensively been studied in neural network models. Most of the previous sequential associative memory embedded sequences of memory patterns have nearly equal sizes. It was recently shown that local cortical networks display many diverse yet repeatable precise temporal sequences of neuronal activities, termed "neuronal avalanches." Interestingly, these avalanches displayed size and lifetime distributions that obey power laws. Inspired by these experimental findings, here we consider an associative memory model of binary neurons that stores sequences of memory patterns with highly variable sizes. Our analysis includes the case where the statistics of these size variations obey the above-mentioned power laws. We study the retrieval dynamics of such memory systems by analytically deriving the equations that govern the time evolution of macroscopic order parameters. We calculate the critical sequence length beyond which the network cannot retrieve memory sequences correctly. As an application of the analysis, we show how the present variability in sequential memory patterns degrades the power-law lifetime distribution of retrieved neural activities.

Flood quantile estimation at ungauged sites by Bayesian networks

NASA Astrophysics Data System (ADS)

Mediero, L.; Santillán, D.; Garrote, L.

2012-04-01

Estimating flood quantiles at a site for which no observed measurements are available is essential for water resources planning and management. Ungauged sites have no observations about the magnitude of floods, but some site and basin characteristics are known. The most common technique used is the multiple regression analysis, which relates physical and climatic basin characteristic to flood quantiles. Regression equations are fitted from flood frequency data and basin characteristics at gauged sites. Regression equations are a rigid technique that assumes linear relationships between variables and cannot take the measurement errors into account. In addition, the prediction intervals are estimated in a very simplistic way from the variance of the residuals in the estimated model. Bayesian networks are a probabilistic computational structure taken from the field of Artificial Intelligence, which have been widely and successfully applied to many scientific fields like medicine and informatics, but application to the field of hydrology is recent. Bayesian networks infer the joint probability distribution of several related variables from observations through nodes, which represent random variables, and links, which represent causal dependencies between them. A Bayesian network is more flexible than regression equations, as they capture non-linear relationships between variables. In addition, the probabilistic nature of Bayesian networks allows taking the different sources of estimation uncertainty into account, as they give a probability distribution as result. A homogeneous region in the Tagus Basin was selected as case study. A regression equation was fitted taking the basin area, the annual maximum 24-hour rainfall for a given recurrence interval and the mean height as explanatory variables. Flood quantiles at ungauged sites were estimated by Bayesian networks. Bayesian networks need to be learnt from a huge enough data set. As observational data are reduced, a stochastic generator of synthetic data was developed. Synthetic basin characteristics were randomised, keeping the statistical properties of observed physical and climatic variables in the homogeneous region. The synthetic flood quantiles were stochastically generated taking the regression equation as basis. The learnt Bayesian network was validated by the reliability diagram, the Brier Score and the ROC diagram, which are common measures used in the validation of probabilistic forecasts. Summarising, the flood quantile estimations through Bayesian networks supply information about the prediction uncertainty as a probability distribution function of discharges is given as result. Therefore, the Bayesian network model has application as a decision support for water resources and planning management.

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.

Expectation propagation for large scale Bayesian inference of non-linear molecular networks from perturbation data.

PubMed

Narimani, Zahra; Beigy, Hamid; Ahmad, Ashar; Masoudi-Nejad, Ali; Fröhlich, Holger

2017-01-01

Inferring the structure of molecular networks from time series protein or gene expression data provides valuable information about the complex biological processes of the cell. Causal network structure inference has been approached using different methods in the past. Most causal network inference techniques, such as Dynamic Bayesian Networks and ordinary differential equations, are limited by their computational complexity and thus make large scale inference infeasible. This is specifically true if a Bayesian framework is applied in order to deal with the unavoidable uncertainty about the correct model. We devise a novel Bayesian network reverse engineering approach using ordinary differential equations with the ability to include non-linearity. Besides modeling arbitrary, possibly combinatorial and time dependent perturbations with unknown targets, one of our main contributions is the use of Expectation Propagation, an algorithm for approximate Bayesian inference over large scale network structures in short computation time. We further explore the possibility of integrating prior knowledge into network inference. We evaluate the proposed model on DREAM4 and DREAM8 data and find it competitive against several state-of-the-art existing network inference methods.

Estimation of Missing Water-Level Data for the Everglades Depth Estimation Network (EDEN)

USGS Publications Warehouse

Conrads, Paul; Petkewich, Matthew D.

2009-01-01

The Everglades Depth Estimation Network (EDEN) is an integrated network of real-time water-level gaging stations, ground-elevation models, and water-surface elevation models designed to provide scientists, engineers, and water-resource managers with current (2000-2009) water-depth information for the entire freshwater portion of the greater Everglades. The U.S. Geological Survey Greater Everglades Priority Ecosystems Science provides support for EDEN and their goal of providing quality-assured monitoring data for the U.S. Army Corps of Engineers Comprehensive Everglades Restoration Plan. To increase the accuracy of the daily water-surface elevation model, water-level estimation equations were developed to fill missing data. To minimize the occurrences of no estimation of data due to missing data for an input station, a minimum of three linear regression equations were developed for each station using different input stations. Of the 726 water-level estimation equations developed to fill missing data at 239 stations, more than 60 percent of the equations have coefficients of determination greater than 0.90, and 92 percent have an coefficient of determination greater than 0.70.

Manual of Documentation Practices Applicable to Defence-Aerospace Scientific and Technical Information. Volume 1. Section 1 - Acquisition and Sources. Section 2 - Descriptive Cataloguing. Section 3 - Abstracting and Subject Analysis

DTIC Science & Technology

1978-08-01

weeding I I ORGANISATION & MANAGEMENT Aims and objectives, staffing, promotional activities, identifying u;ers 12 NETWORKS & EXTERNAL SOURCES OF...Acquisition Clerks with typing capability are required for meticulous recordkeeping. Typing capability of 50 words per minute and a working knowledge ...81 Adminhistration and Management Includes management planning and research. 64 Numerical Analysis Includes iteration, difference equations, and 82

Dynamics and thermodynamics of open chemical networks

NASA Astrophysics Data System (ADS)

Esposito, Massimiliano

Open chemical networks (OCN) are large sets of coupled chemical reactions where some of the species are chemostated (i.e. continuously restored from the environment). Cell metabolism is a notable example of OCN. Two results will be presented. First, dissipation in OCN operating in nonequilibrium steady-states strongly depends on the network topology (algebraic properties of the stoichiometric matrix). An application to oligosaccharides exchange dynamics performed by so-called D-enzymes will be provided. Second, at low concentration the dissipation of OCN is in general inaccurately predicted by deterministic dynamics (i.e. nonlinear rate equations for the species concentrations). In this case a description in terms of the chemical master equation is necessary. A notable exception is provided by so-called deficiency zero networks, i.e. chemical networks with no hidden cycles present in the graph of reactant complexes.

A control network of Triton

NASA Astrophysics Data System (ADS)

Davies, Merton E.; Rogers, Patricia G.; Colvin, Tim R.

1991-08-01

A control network for Triton has been computed using a bundle-type analytical triangulation program. The network contains 105 points that were measured on 57 Voyager-2 pictures. The adjustment contained 1010 observation equations and 382 normal equations and resulted in a standard measurement error of 13.36 microns. The coordinates of the control points, the camera orientation angles at the times when the pictures were taken, and Triton's mean radius were determined. A separate statistical analysis confirmed Triton's radius to be 1352.6 + or - 2.4 km. Attempts to tie the control network around the satellite were unsuccessful because discontinuities exist in high-resolution coverage between 66 deg and 289 deg longitude, north of 38 deg latitude, and south of 78 deg latitude.

Chimera-like states in a neuronal network model of the cat brain

NASA Astrophysics Data System (ADS)

Santos, M. S.; Szezech, J. D.; Borges, F. S.; Iarosz, K. C.; Caldas, I. L.; Batista, A. M.; Viana, R. L.; Kurths, J.

2017-08-01

Neuronal systems have been modeled by complex networks in different description levels. Recently, it has been verified that networks can simultaneously exhibit one coherent and other incoherent domain, known as chimera states. In this work, we study the existence of chimera states in a network considering the connectivity matrix based on the cat cerebral cortex. The cerebral cortex of the cat can be separated in 65 cortical areas organised into the four cognitive regions: visual, auditory, somatosensory-motor and frontolimbic. We consider a network where the local dynamics is given by the Hindmarsh-Rose model. The Hindmarsh-Rose equations are a well known model of neuronal activity that has been considered to simulate membrane potential in neuron. Here, we analyse under which conditions chimera states are present, as well as the affects induced by intensity of coupling on them. We observe the existence of chimera states in that incoherent structure can be composed of desynchronised spikes or desynchronised bursts. Moreover, we find that chimera states with desynchronised bursts are more robust to neuronal noise than with desynchronised spikes.

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.

Denoising by coupled partial differential equations and extracting phase by backpropagation neural networks for electronic speckle pattern interferometry.

PubMed

Tang, Chen; Lu, Wenjing; Chen, Song; Zhang, Zhen; Li, Botao; Wang, Wenping; Han, Lin

2007-10-20

We extend and refine previous work [Appl. Opt. 46, 2907 (2007)]. Combining the coupled nonlinear partial differential equations (PDEs) denoising model with the ordinary differential equations enhancement method, we propose the new denoising and enhancing model for electronic speckle pattern interferometry (ESPI) fringe patterns. Meanwhile, we propose the backpropagation neural networks (BPNN) method to obtain unwrapped phase values based on a skeleton map instead of traditional interpolations. We test the introduced methods on the computer-simulated speckle ESPI fringe patterns and experimentally obtained fringe pattern, respectively. The experimental results show that the coupled nonlinear PDEs denoising model is capable of effectively removing noise, and the unwrapped phase values obtained by the BPNN method are much more accurate than those obtained by the well-known traditional interpolation. In addition, the accuracy of the BPNN method is adjustable by changing the parameters of networks such as the number of neurons.

Simplifications for hydronic system models in modelica

DOE PAGES

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

2018-01-12

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

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.

Artificial Intelligence Procedures for Tree Taper Estimation within a Complex Vegetation Mosaic in Brazil

PubMed Central

Nunes, Matheus Henrique

2016-01-01

Tree stem form in native tropical forests is very irregular, posing a challenge to establishing taper equations that can accurately predict the diameter at any height along the stem and subsequently merchantable volume. Artificial intelligence approaches can be useful techniques in minimizing estimation errors within complex variations of vegetation. We evaluated the performance of Random Forest® regression tree and Artificial Neural Network procedures in modelling stem taper. Diameters and volume outside bark were compared to a traditional taper-based equation across a tropical Brazilian savanna, a seasonal semi-deciduous forest and a rainforest. Neural network models were found to be more accurate than the traditional taper equation. Random forest showed trends in the residuals from the diameter prediction and provided the least precise and accurate estimations for all forest types. This study provides insights into the superiority of a neural network, which provided advantages regarding the handling of local effects. PMID:27187074

Artificial Intelligence Procedures for Tree Taper Estimation within a Complex Vegetation Mosaic in Brazil.

PubMed

Nunes, Matheus Henrique; Görgens, Eric Bastos

2016-01-01

Tree stem form in native tropical forests is very irregular, posing a challenge to establishing taper equations that can accurately predict the diameter at any height along the stem and subsequently merchantable volume. Artificial intelligence approaches can be useful techniques in minimizing estimation errors within complex variations of vegetation. We evaluated the performance of Random Forest® regression tree and Artificial Neural Network procedures in modelling stem taper. Diameters and volume outside bark were compared to a traditional taper-based equation across a tropical Brazilian savanna, a seasonal semi-deciduous forest and a rainforest. Neural network models were found to be more accurate than the traditional taper equation. Random forest showed trends in the residuals from the diameter prediction and provided the least precise and accurate estimations for all forest types. This study provides insights into the superiority of a neural network, which provided advantages regarding the handling of local effects.

Estimating the resolution limit of the map equation in community detection

NASA Astrophysics Data System (ADS)

Kawamoto, Tatsuro; Rosvall, Martin

2015-01-01

A community detection algorithm is considered to have a resolution limit if the scale of the smallest modules that can be resolved depends on the size of the analyzed subnetwork. The resolution limit is known to prevent some community detection algorithms from accurately identifying the modular structure of a network. In fact, any global objective function for measuring the quality of a two-level assignment of nodes into modules must have some sort of resolution limit or an external resolution parameter. However, it is yet unknown how the resolution limit affects the so-called map equation, which is known to be an efficient objective function for community detection. We derive an analytical estimate and conclude that the resolution limit of the map equation is set by the total number of links between modules instead of the total number of links in the full network as for modularity. This mechanism makes the resolution limit much less restrictive for the map equation than for modularity; in practice, it is orders of magnitudes smaller. Furthermore, we argue that the effect of the resolution limit often results from shoehorning multilevel modular structures into two-level descriptions. As we show, the hierarchical map equation effectively eliminates the resolution limit for networks with nested multilevel modular structures.

A Hybrid Method of Moment Equations and Rate Equations to Modeling Gas-Grain Chemistry

NASA Astrophysics Data System (ADS)

Pei, Y.; Herbst, E.

2011-05-01

Grain surfaces play a crucial role in catalyzing many important chemical reactions in the interstellar medium (ISM). The deterministic rate equation (RE) method has often been used to simulate the surface chemistry. But this method becomes inaccurate when the number of reacting particles per grain is typically less than one, which can occur in the ISM. In this condition, stochastic approaches such as the master equations are adopted. However, these methods have mostly been constrained to small chemical networks due to the large amounts of processor time and computer power required. In this study, we present a hybrid method consisting of the moment equation approximation to the stochastic master equation approach and deterministic rate equations to treat a gas-grain model of homogeneous cold cloud cores with time-independent physical conditions. In this model, we use the standard OSU gas phase network (version OSU2006V3) which involves 458 gas phase species and more than 4000 reactions, and treat it by deterministic rate equations. A medium-sized surface reaction network which consists of 21 species and 19 reactions accounts for the productions of stable molecules such as H_2O, CO, CO_2, H_2CO, CH_3OH, NH_3 and CH_4. These surface reactions are treated by a hybrid method of moment equations (Barzel & Biham 2007) and rate equations: when the abundance of a surface species is lower than a specific threshold, say one per grain, we use the ``stochastic" moment equations to simulate the evolution; when its abundance goes above this threshold, we use the rate equations. A continuity technique is utilized to secure a smooth transition between these two methods. We have run chemical simulations for a time up to 10^8 yr at three temperatures: 10 K, 15 K, and 20 K. The results will be compared with those generated from (1) a completely deterministic model that uses rate equations for both gas phase and grain surface chemistry, (2) the method of modified rate equations (Garrod 2008), which partially takes into account the stochastic effect for surface reactions, and (3) the master equation approach solved using a Monte Carlo technique. At 10 K and standard grain sizes, our model results agree well with the above three methods, while discrepancies appear at higher temperatures and smaller grain sizes.

Ultimate compression after impact load prediction in graphite/epoxy coupons using neural network and multivariate statistical analyses

NASA Astrophysics Data System (ADS)

Gregoire, Alexandre David

2011-07-01

The goal of this research was to accurately predict the ultimate compressive load of impact damaged graphite/epoxy coupons using a Kohonen self-organizing map (SOM) neural network and multivariate statistical regression analysis (MSRA). An optimized use of these data treatment tools allowed the generation of a simple, physically understandable equation that predicts the ultimate failure load of an impacted damaged coupon based uniquely on the acoustic emissions it emits at low proof loads. Acoustic emission (AE) data were collected using two 150 kHz resonant transducers which detected and recorded the AE activity given off during compression to failure of thirty-four impacted 24-ply bidirectional woven cloth laminate graphite/epoxy coupons. The AE quantification parameters duration, energy and amplitude for each AE hit were input to the Kohonen self-organizing map (SOM) neural network to accurately classify the material failure mechanisms present in the low proof load data. The number of failure mechanisms from the first 30% of the loading for twenty-four coupons were used to generate a linear prediction equation which yielded a worst case ultimate load prediction error of 16.17%, just outside of the +/-15% B-basis allowables, which was the goal for this research. Particular emphasis was placed upon the noise removal process which was largely responsible for the accuracy of the results.

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.

Modeling delay in genetic networks: From delay birth-death processes to delay stochastic differential equations

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

Gupta, Chinmaya; López, José Manuel; Azencott, Robert

Delay is an important and ubiquitous aspect of many biochemical processes. For example, delay plays a central role in the dynamics of genetic regulatory networks as it stems from the sequential assembly of first mRNA and then protein. Genetic regulatory networks are therefore frequently modeled as stochastic birth-death processes with delay. Here, we examine the relationship between delay birth-death processes and their appropriate approximating delay chemical Langevin equations. We prove a quantitative bound on the error between the pathwise realizations of these two processes. Our results hold for both fixed delay and distributed delay. Simulations demonstrate that the delay chemicalmore » Langevin approximation is accurate even at moderate system sizes. It captures dynamical features such as the oscillatory behavior in negative feedback circuits, cross-correlations between nodes in a network, and spatial and temporal information in two commonly studied motifs of metastability in biochemical systems. Overall, these results provide a foundation for using delay stochastic differential equations to approximate the dynamics of birth-death processes with delay.« less

Stochastic model simulation using Kronecker product analysis and Zassenhaus formula approximation.

PubMed

Caglar, Mehmet Umut; Pal, Ranadip

2013-01-01

Probabilistic Models are regularly applied in Genetic Regulatory Network modeling to capture the stochastic behavior observed in the generation of biological entities such as mRNA or proteins. Several approaches including Stochastic Master Equations and Probabilistic Boolean Networks have been proposed to model the stochastic behavior in genetic regulatory networks. It is generally accepted that Stochastic Master Equation is a fundamental model that can describe the system being investigated in fine detail, but the application of this model is computationally enormously expensive. On the other hand, Probabilistic Boolean Network captures only the coarse-scale stochastic properties of the system without modeling the detailed interactions. We propose a new approximation of the stochastic master equation model that is able to capture the finer details of the modeled system including bistabilities and oscillatory behavior, and yet has a significantly lower computational complexity. In this new method, we represent the system using tensors and derive an identity to exploit the sparse connectivity of regulatory targets for complexity reduction. The algorithm involves an approximation based on Zassenhaus formula to represent the exponential of a sum of matrices as product of matrices. We derive upper bounds on the expected error of the proposed model distribution as compared to the stochastic master equation model distribution. Simulation results of the application of the model to four different biological benchmark systems illustrate performance comparable to detailed stochastic master equation models but with considerably lower computational complexity. The results also demonstrate the reduced complexity of the new approach as compared to commonly used Stochastic Simulation Algorithm for equivalent accuracy.

Upscaling of nanoparticle transport in porous media under unfavorable conditions: Pore scale to Darcy scale

NASA Astrophysics Data System (ADS)

Seetha, N.; Raoof, Amir; Mohan Kumar, M. S.; Majid Hassanizadeh, S.

2017-05-01

Transport and deposition of nanoparticles in porous media is a multi-scale problem governed by several pore-scale processes, and hence, it is critical to link the processes at pore scale to the Darcy-scale behavior. In this study, using pore network modeling, we develop correlation equations for deposition rate coefficients for nanoparticle transport under unfavorable conditions at the Darcy scale based on pore-scale mechanisms. The upscaling tool is a multi-directional pore-network model consisting of an interconnected network of pores with variable connectivities. Correlation equations describing the pore-averaged deposition rate coefficients under unfavorable conditions in a cylindrical pore, developed in our earlier studies, are employed for each pore element. Pore-network simulations are performed for a wide range of parameter values to obtain the breakthrough curves of nanoparticle concentration. The latter is fitted with macroscopic 1-D advection-dispersion equation with a two-site linear reversible deposition accounting for both equilibrium and kinetic sorption. This leads to the estimation of three Darcy-scale deposition coefficients: distribution coefficient, kinetic rate constant, and the fraction of equilibrium sites. The correlation equations for the Darcy-scale deposition coefficients, under unfavorable conditions, are provided as a function of measurable Darcy-scale parameters, including: porosity, mean pore throat radius, mean pore water velocity, nanoparticle radius, ionic strength, dielectric constant, viscosity, temperature, and surface potentials of the particle and grain surfaces. The correlation equations are found to be consistent with the available experimental results, and in qualitative agreement with Colloid Filtration Theory for all parameters, except for the mean pore water velocity and nanoparticle radius.

Kinematic assumptions and their consequences on the structure of field equations in continuum dislocation theory

NASA Astrophysics Data System (ADS)

Silbermann, C. B.; Ihlemann, J.

2016-03-01

Continuum Dislocation Theory (CDT) relates gradients of plastic deformation in crystals with the presence of geometrically necessary dislocations. Therefore, the dislocation tensor is introduced as an additional thermodynamic state variable which reflects tensorial properties of dislocation ensembles. Moreover, the CDT captures both the strain energy from the macroscopic deformation of the crystal and the elastic energy of the dislocation network, as well as the dissipation of energy due to dislocation motion. The present contribution deals with the geometrically linear CDT. More precise, the focus is on the role of dislocation kinematics for single and multi-slip and its consequences on the field equations. Thereby, the number of active slip systems plays a crucial role since it restricts the degrees of freedom of plastic deformation. Special attention is put on the definition of proper, well-defined invariants of the dislocation tensor in order to avoid any spurious dependence of the resulting field equations on the coordinate system. It is shown how a slip system based approach can be in accordance with the tensor nature of the involved quantities. At first, only dislocation glide in one active slip system of the crystal is allowed. Then, the special case of two orthogonal (interacting) slip systems is considered and the governing field equations are presented. In addition, the structure and symmetry of the backstress tensor is investigated from the viewpoint of thermodynamical consistency. The results will again be used in order to facilitate the set of field equations and to prepare for a robust numerical implementation.

Structure and Dynamics of Replication-Mutation Systems

NASA Astrophysics Data System (ADS)

Schuster, Peter

1987-03-01

The kinetic equations of polynucleotide replication can be brought into fairly simple form provided certain environmental conditions are fulfilled. Two flow reactors, the continuously stirred tank reactor (CSTR) and a special dialysis reactor are particularly suitable for the analysis of replication kinetics. An experimental setup to study the chemical reaction network of RNA synthesis was derived from the bacteriophage Qβ. It consists of a virus specific RNA polymerase, Qβ replicase, the activated ribonucleosides GTP, ATP, CTP and UTP as well as a template suitable for replication. The ordinary differential equations for replication and mutation under the conditions of the flow reactors were analysed by the qualitative methods of bifurcation theory as well as by numerical integration. The various kinetic equations are classified according to their dynamical properties: we distinguish "quasilinear systems" which have uniquely stable point attractors and "nonlinear systems" with inherent nonlinearities which lead to multiple steady states, Hopf bifuractions, Feigenbaum-like sequences and chaotic dynamics for certain parameter ranges. Some examples which are relevant in molecular evolution and population genetics are discussed in detail.

Splitting nodes and linking channels: A method for assembling biocircuits from stochastic elementary units

NASA Astrophysics Data System (ADS)

Ferwerda, Cameron; Lipan, Ovidiu

2016-11-01

Akin to electric circuits, we construct biocircuits that are manipulated by cutting and assembling channels through which stochastic information flows. This diagrammatic manipulation allows us to create a method which constructs networks by joining building blocks selected so that (a) they cover only basic processes; (b) it is scalable to large networks; (c) the mean and variance-covariance from the Pauli master equation form a closed system; and (d) given the initial probability distribution, no special boundary conditions are necessary to solve the master equation. The method aims to help with both designing new synthetic signaling pathways and quantifying naturally existing regulatory networks.

Transport through a network of capillaries from ultrametric diffusion equation with quadratic nonlinearity

NASA Astrophysics Data System (ADS)

Oleschko, K.; Khrennikov, A.

2017-10-01

This paper is about a novel mathematical framework to model transport (of, e.g., fluid or gas) through networks of capillaries. This framework takes into account the tree structure of the networks of capillaries. (Roughly speaking, we use the tree-like system of coordinates.) As is well known, tree-geometry can be topologically described as the geometry of an ultrametric space, i.e., a metric space in which the metric satisfies the strong triangle inequality: in each triangle, the third side is less than or equal to the maximum of two other sides. Thus transport (e.g., of oil or emulsion of oil and water in porous media, or blood and air in biological organisms) through networks of capillaries can be mathematically modelled as ultrametric diffusion. Such modelling was performed in a series of recently published papers of the authors. However, the process of transport through capillaries can be only approximately described by the linear diffusion, because the concentration of, e.g., oil droplets, in a capillary can essentially modify the dynamics. Therefore nonlinear dynamical equations provide a more adequate model of transport in a network of capillaries. We consider a nonlinear ultrametric diffusion equation with quadratic nonlinearity - to model transport in such a network. Here, as in the linear case, we apply the theory of ultrametric wavelets. The paper also contains a simple introduction to theory of ultrametric spaces and analysis on them.

Physiologically motivated multiplex Kuramoto model describes phase diagram of cortical activity

NASA Astrophysics Data System (ADS)

Sadilek, Maximilian; Thurner, Stefan

2015-05-01

We derive a two-layer multiplex Kuramoto model from Wilson-Cowan type physiological equations that describe neural activity on a network of interconnected cortical regions. This is mathematically possible due to the existence of a unique, stable limit cycle, weak coupling, and inhibitory synaptic time delays. We study the phase diagram of this model numerically as a function of the inter-regional connection strength that is related to cerebral blood flow, and a phase shift parameter that is associated with synaptic GABA concentrations. We find three macroscopic phases of cortical activity: background activity (unsynchronized oscillations), epileptiform activity (highly synchronized oscillations) and resting-state activity (synchronized clusters/chaotic behaviour). Previous network models could hitherto not explain the existence of all three phases. We further observe a shift of the average oscillation frequency towards lower values together with the appearance of coherent slow oscillations at the transition from resting-state to epileptiform activity. This observation is fully in line with experimental data and could explain the influence of GABAergic drugs both on gamma oscillations and epileptic states. Compared to previous models for gamma oscillations and resting-state activity, the multiplex Kuramoto model not only provides a unifying framework, but also has a direct connection to measurable physiological parameters.

Physiologically motivated multiplex Kuramoto model describes phase diagram of cortical activity.

PubMed

Sadilek, Maximilian; Thurner, Stefan

2015-05-21

We derive a two-layer multiplex Kuramoto model from Wilson-Cowan type physiological equations that describe neural activity on a network of interconnected cortical regions. This is mathematically possible due to the existence of a unique, stable limit cycle, weak coupling, and inhibitory synaptic time delays. We study the phase diagram of this model numerically as a function of the inter-regional connection strength that is related to cerebral blood flow, and a phase shift parameter that is associated with synaptic GABA concentrations. We find three macroscopic phases of cortical activity: background activity (unsynchronized oscillations), epileptiform activity (highly synchronized oscillations) and resting-state activity (synchronized clusters/chaotic behaviour). Previous network models could hitherto not explain the existence of all three phases. We further observe a shift of the average oscillation frequency towards lower values together with the appearance of coherent slow oscillations at the transition from resting-state to epileptiform activity. This observation is fully in line with experimental data and could explain the influence of GABAergic drugs both on gamma oscillations and epileptic states. Compared to previous models for gamma oscillations and resting-state activity, the multiplex Kuramoto model not only provides a unifying framework, but also has a direct connection to measurable physiological parameters.

Smooth function approximation using neural networks.

PubMed

Ferrari, Silvia; Stengel, Robert F

2005-01-01

An algebraic approach for representing multidimensional nonlinear functions by feedforward neural networks is presented. In this paper, the approach is implemented for the approximation of smooth batch data containing the function's input, output, and possibly, gradient information. The training set is associated to the network adjustable parameters by nonlinear weight equations. The cascade structure of these equations reveals that they can be treated as sets of linear systems. Hence, the training process and the network approximation properties can be investigated via linear algebra. Four algorithms are developed to achieve exact or approximate matching of input-output and/or gradient-based training sets. Their application to the design of forward and feedback neurocontrollers shows that algebraic training is characterized by faster execution speeds and better generalization properties than contemporary optimization techniques.

Prediction of Flow Stress in Cadmium Using Constitutive Equation and Artificial Neural Network Approach

NASA Astrophysics Data System (ADS)

Sarkar, A.; Chakravartty, J. K.

2013-10-01

A model is developed to predict the constitutive flow behavior of cadmium during compression test using artificial neural network (ANN). The inputs of the neural network are strain, strain rate, and temperature, whereas flow stress is the output. Experimental data obtained from compression tests in the temperature range -30 to 70 °C, strain range 0.1 to 0.6, and strain rate range 10-3 to 1 s-1 are employed to develop the model. A three-layer feed-forward ANN is trained with Levenberg-Marquardt training algorithm. It has been shown that the developed ANN model can efficiently and accurately predict the deformation behavior of cadmium. This trained network could predict the flow stress better than a constitutive equation of the type.

Deep Learning Fluid Mechanics

NASA Astrophysics Data System (ADS)

Barati Farimani, Amir; Gomes, Joseph; Pande, Vijay

2017-11-01

We have developed a new data-driven model paradigm for the rapid inference and solution of the constitutive equations of fluid mechanic by deep learning models. Using generative adversarial networks (GAN), we train models for the direct generation of solutions to steady state heat conduction and incompressible fluid flow without knowledge of the underlying governing equations. Rather than using artificial neural networks to approximate the solution of the constitutive equations, GANs can directly generate the solutions to these equations conditional upon an arbitrary set of boundary conditions. Both models predict temperature, velocity and pressure fields with great test accuracy (>99.5%). The application of our framework for inferring and generating the solutions of partial differential equations can be applied to any physical phenomena and can be used to learn directly from experiments where the underlying physical model is complex or unknown. We also have shown that our framework can be used to couple multiple physics simultaneously, making it amenable to tackle multi-physics problems.

A Symbolic and Graphical Computer Representation of Dynamical Systems

NASA Astrophysics Data System (ADS)

Gould, Laurence I.

2005-04-01

AUTONO is a Macsyma/Maxima program, designed at the University of Hartford, for solving autonomous systems of differential equations as well as for relating Lagrangians and Hamiltonians to their associated dynamical equations. AUTONO can be used in a number of fields to decipher a variety of complex dynamical systems with ease, producing their Lagrangian and Hamiltonian equations in seconds. These equations can then be incorporated into VisSim, a modeling and simulation program, which yields graphical representations of motion in a given system through easily chosen input parameters. The program, along with the VisSim differential-equations graphical package, allows for resolution and easy understanding of complex problems in a relatively short time; thus enabling quicker and more advanced computing of dynamical systems on any number of platforms---from a network of sensors on a space probe, to the behavior of neural networks, to the effects of an electromagnetic field on components in a dynamical system. A flowchart of AUTONO, along with some simple applications and VisSim output, will be shown.

Floral Morphogenesis: Stochastic Explorations of a Gene Network Epigenetic Landscape

PubMed Central

Aldana, Maximino; Benítez, Mariana; Cortes-Poza, Yuriria; Espinosa-Soto, Carlos; Hartasánchez, Diego A.; Lotto, R. Beau; Malkin, David; Escalera Santos, Gerardo J.; Padilla-Longoria, Pablo

2008-01-01

In contrast to the classical view of development as a preprogrammed and deterministic process, recent studies have demonstrated that stochastic perturbations of highly non-linear systems may underlie the emergence and stability of biological patterns. Herein, we address the question of whether noise contributes to the generation of the stereotypical temporal pattern in gene expression during flower development. We modeled the regulatory network of organ identity genes in the Arabidopsis thaliana flower as a stochastic system. This network has previously been shown to converge to ten fixed-point attractors, each with gene expression arrays that characterize inflorescence cells and primordial cells of sepals, petals, stamens, and carpels. The network used is binary, and the logical rules that govern its dynamics are grounded in experimental evidence. We introduced different levels of uncertainty in the updating rules of the network. Interestingly, for a level of noise of around 0.5–10%, the system exhibited a sequence of transitions among attractors that mimics the sequence of gene activation configurations observed in real flowers. We also implemented the gene regulatory network as a continuous system using the Glass model of differential equations, that can be considered as a first approximation of kinetic-reaction equations, but which are not necessarily equivalent to the Boolean model. Interestingly, the Glass dynamics recover a temporal sequence of attractors, that is qualitatively similar, although not identical, to that obtained using the Boolean model. Thus, time ordering in the emergence of cell-fate patterns is not an artifact of synchronous updating in the Boolean model. Therefore, our model provides a novel explanation for the emergence and robustness of the ubiquitous temporal pattern of floral organ specification. It also constitutes a new approach to understanding morphogenesis, providing predictions on the population dynamics of cells with different genetic configurations during development. PMID:18978941

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.

A model for simulation of flow in singular and interconnected channels

USGS Publications Warehouse

Schaffranek, Raymond W.; Baltzer, R.A.; Goldberg, D.E.

1981-01-01

A one-dimensional numerical model is presented for simulating the unsteady flow in singular riverine or estuarine reaches and in networks of reaches composed of interconnected channels. The model is both general and flexible in that it can be used to simulate a wide range of flow conditions for various channel configurations. The channel geometry of the network to be modeled should be sufficiently simple so as to lend itself to characterization in one spatial dimension. The flow must be substantially homogenous in density, and hydrostatic pressure must prevail everywhere in the network channels. The slope of each channel bottom ought to be mild and reasonably constant over its length so that the flow remains subcritical. The model accommodates tributary inflows and diversions and includes the effects of wind shear on the water surface as a forcing function in the flow equations. Water-surface elevations and flow discharges are computed at channel junctions, as well as at specified intermediate locations within the network channels. The one-dimensional branch-network flow model uses a four-point, implicit, finite-difference approximation of the unsteady-flow equations. The flow equations are linearized over a time step, and branch transformations are formulated that describe the relationship between the unknowns at the end points of the channels. The resultant matrix of branch-transformation equations and required boundary-condition equations is solved by Gaussian elimination using maximum pivot strategy. Five example applications of the flow model are illustrated. The applications cover such diverse conditions as a singular upland river reach in which unsteady flow results from hydropower regulations, coastal rivers composed of sequentially connected reaches subject to unsteady tide-driven flow, and a multiply connected network of channels whose flow is principally governed by wind tides and seiches in adjoining lakes. The report includes a listing of the FORTRAN IV computer program and a description of the input data requirements. Model supporting programs for the processing and input of initial and boundary-value data are identified, various model output formats are illustrated, and instructions are given to permit the production of graphical output using the line printer, electromechanical pen plotters, cathode-ray-tube display units, or microfilm recorders.

A gene network simulator to assess reverse engineering algorithms.

PubMed

Di Camillo, Barbara; Toffolo, Gianna; Cobelli, Claudio

2009-03-01

In the context of reverse engineering of biological networks, simulators are helpful to test and compare the accuracy of different reverse-engineering approaches in a variety of experimental conditions. A novel gene-network simulator is presented that resembles some of the main features of transcriptional regulatory networks related to topology, interaction among regulators of transcription, and expression dynamics. The simulator generates network topology according to the current knowledge of biological network organization, including scale-free distribution of the connectivity and clustering coefficient independent of the number of nodes in the network. It uses fuzzy logic to represent interactions among the regulators of each gene, integrated with differential equations to generate continuous data, comparable to real data for variety and dynamic complexity. Finally, the simulator accounts for saturation in the response to regulation and transcription activation thresholds and shows robustness to perturbations. It therefore provides a reliable and versatile test bed for reverse engineering algorithms applied to microarray data. Since the simulator describes regulatory interactions and expression dynamics as two distinct, although interconnected aspects of regulation, it can also be used to test reverse engineering approaches that use both microarray and protein-protein interaction data in the process of learning. A first software release is available at http://www.dei.unipd.it/~dicamill/software/netsim as an R programming language package.

Availability, use, and cultivation of support networks as predictors of the well-being of middle-aged and older Chinese: a panel study.

PubMed

Chong, Alice Ming Lin; Cheung, Chau-kiu; Woo, Jean; Kwan, Alex Yui-Huen

2012-01-01

To examine the impact of the availability, use, and cultivation of a support network on the well-being of community-dwelling, middle-aged, and older Chinese. A total of 2,970 Hong Kong Chinese aged 40-74 years were interviewed using a structured questionnaire in 2004. Out of the original group of interviewees, 2,120 (71.4%) were interviewed again in 2005. Structural equation modeling revealed a good fit of the model employing Wave 1 support network data and demographic characteristics to predict Wave 2 well-being. As hypothesized, the availability of important social ties and the cultivation of one's support networks were found to predict well-being one year later, but not the use of support networks to meet emotional, financial, or companion needs after controlling for demographic variables and baseline well-being. Cultivating support networks can be interpreted as positive and active coping. Such cultivation is in line with what socioemotional selectivity theory predicts; specifically, when people age, they become more selective and concentrate on strengthening their relationship with those they are emotionally close to. We argue that network cultivation deserves more attention in theory, practice, and research to strengthen the resilience and adaptability of individuals approaching and experiencing old age.

Low-dimensional spike rate models derived from networks of adaptive integrate-and-fire neurons: Comparison and implementation.

PubMed

Augustin, Moritz; Ladenbauer, Josef; Baumann, Fabian; Obermayer, Klaus

2017-06-01

The spiking activity of single neurons can be well described by a nonlinear integrate-and-fire model that includes somatic adaptation. When exposed to fluctuating inputs sparsely coupled populations of these model neurons exhibit stochastic collective dynamics that can be effectively characterized using the Fokker-Planck equation. This approach, however, leads to a model with an infinite-dimensional state space and non-standard boundary conditions. Here we derive from that description four simple models for the spike rate dynamics in terms of low-dimensional ordinary differential equations using two different reduction techniques: one uses the spectral decomposition of the Fokker-Planck operator, the other is based on a cascade of two linear filters and a nonlinearity, which are determined from the Fokker-Planck equation and semi-analytically approximated. We evaluate the reduced models for a wide range of biologically plausible input statistics and find that both approximation approaches lead to spike rate models that accurately reproduce the spiking behavior of the underlying adaptive integrate-and-fire population. Particularly the cascade-based models are overall most accurate and robust, especially in the sensitive region of rapidly changing input. For the mean-driven regime, when input fluctuations are not too strong and fast, however, the best performing model is based on the spectral decomposition. The low-dimensional models also well reproduce stable oscillatory spike rate dynamics that are generated either by recurrent synaptic excitation and neuronal adaptation or through delayed inhibitory synaptic feedback. The computational demands of the reduced models are very low but the implementation complexity differs between the different model variants. Therefore we have made available implementations that allow to numerically integrate the low-dimensional spike rate models as well as the Fokker-Planck partial differential equation in efficient ways for arbitrary model parametrizations as open source software. The derived spike rate descriptions retain a direct link to the properties of single neurons, allow for convenient mathematical analyses of network states, and are well suited for application in neural mass/mean-field based brain network models.

Low-dimensional spike rate models derived from networks of adaptive integrate-and-fire neurons: Comparison and implementation

PubMed Central

Baumann, Fabian; Obermayer, Klaus

2017-01-01

The spiking activity of single neurons can be well described by a nonlinear integrate-and-fire model that includes somatic adaptation. When exposed to fluctuating inputs sparsely coupled populations of these model neurons exhibit stochastic collective dynamics that can be effectively characterized using the Fokker-Planck equation. This approach, however, leads to a model with an infinite-dimensional state space and non-standard boundary conditions. Here we derive from that description four simple models for the spike rate dynamics in terms of low-dimensional ordinary differential equations using two different reduction techniques: one uses the spectral decomposition of the Fokker-Planck operator, the other is based on a cascade of two linear filters and a nonlinearity, which are determined from the Fokker-Planck equation and semi-analytically approximated. We evaluate the reduced models for a wide range of biologically plausible input statistics and find that both approximation approaches lead to spike rate models that accurately reproduce the spiking behavior of the underlying adaptive integrate-and-fire population. Particularly the cascade-based models are overall most accurate and robust, especially in the sensitive region of rapidly changing input. For the mean-driven regime, when input fluctuations are not too strong and fast, however, the best performing model is based on the spectral decomposition. The low-dimensional models also well reproduce stable oscillatory spike rate dynamics that are generated either by recurrent synaptic excitation and neuronal adaptation or through delayed inhibitory synaptic feedback. The computational demands of the reduced models are very low but the implementation complexity differs between the different model variants. Therefore we have made available implementations that allow to numerically integrate the low-dimensional spike rate models as well as the Fokker-Planck partial differential equation in efficient ways for arbitrary model parametrizations as open source software. The derived spike rate descriptions retain a direct link to the properties of single neurons, allow for convenient mathematical analyses of network states, and are well suited for application in neural mass/mean-field based brain network models. PMID:28644841

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

USGS Publications Warehouse

Ahearn, Elizabeth A.

2004-01-01

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

Optimizing finite element predictions of local subchondral bone structural stiffness using neural network-derived density-modulus relationships for proximal tibial subchondral cortical and trabecular bone.

PubMed

Nazemi, S Majid; Amini, Morteza; Kontulainen, Saija A; Milner, Jaques S; Holdsworth, David W; Masri, Bassam A; Wilson, David R; Johnston, James D

2017-01-01

Quantitative computed tomography based subject-specific finite element modeling has potential to clarify the role of subchondral bone alterations in knee osteoarthritis initiation, progression, and pain. However, it is unclear what density-modulus equation(s) should be applied with subchondral cortical and subchondral trabecular bone when constructing finite element models of the tibia. Using a novel approach applying neural networks, optimization, and back-calculation against in situ experimental testing results, the objective of this study was to identify subchondral-specific equations that optimized finite element predictions of local structural stiffness at the proximal tibial subchondral surface. Thirteen proximal tibial compartments were imaged via quantitative computed tomography. Imaged bone mineral density was converted to elastic moduli using multiple density-modulus equations (93 total variations) then mapped to corresponding finite element models. For each variation, root mean squared error was calculated between finite element prediction and in situ measured stiffness at 47 indentation sites. Resulting errors were used to train an artificial neural network, which provided an unlimited number of model variations, with corresponding error, for predicting stiffness at the subchondral bone surface. Nelder-Mead optimization was used to identify optimum density-modulus equations for predicting stiffness. Finite element modeling predicted 81% of experimental stiffness variance (with 10.5% error) using optimized equations for subchondral cortical and trabecular bone differentiated with a 0.5g/cm 3 density. In comparison with published density-modulus relationships, optimized equations offered improved predictions of local subchondral structural stiffness. Further research is needed with anisotropy inclusion, a smaller voxel size and de-blurring algorithms to improve predictions. Copyright © 2016 Elsevier Ltd. All rights reserved.

Bifurcations of large networks of two-dimensional integrate and fire neurons.

PubMed

Nicola, Wilten; Campbell, Sue Ann

2013-08-01

Recently, a class of two-dimensional integrate and fire models has been used to faithfully model spiking neurons. This class includes the Izhikevich model, the adaptive exponential integrate and fire model, and the quartic integrate and fire model. The bifurcation types for the individual neurons have been thoroughly analyzed by Touboul (SIAM J Appl Math 68(4):1045-1079, 2008). However, when the models are coupled together to form networks, the networks can display bifurcations that an uncoupled oscillator cannot. For example, the networks can transition from firing with a constant rate to burst firing. This paper introduces a technique to reduce a full network of this class of neurons to a mean field model, in the form of a system of switching ordinary differential equations. The reduction uses population density methods and a quasi-steady state approximation to arrive at the mean field system. Reduced models are derived for networks with different topologies and different model neurons with biologically derived parameters. The mean field equations are able to qualitatively and quantitatively describe the bifurcations that the full networks display. Extensions and higher order approximations are discussed.

Global cluster synchronization in nonlinearly coupled community networks with heterogeneous coupling delays.

PubMed

Tseng, Jui-Pin

2017-02-01

This investigation establishes the global cluster synchronization of complex networks with a community structure based on an iterative approach. The units comprising the network are described by differential equations, and can be non-autonomous and involve time delays. In addition, units in the different communities can be governed by different equations. The coupling configuration of the network is rather general. The coupling terms can be non-diffusive, nonlinear, asymmetric, and with heterogeneous coupling delays. Based on this approach, both delay-dependent and delay-independent criteria for global cluster synchronization are derived. We implement the present approach for a nonlinearly coupled neural network with heterogeneous coupling delays. Two numerical examples are given to show that neural networks can behave in a variety of new collective ways under the synchronization criteria. These examples also demonstrate that neural networks remain synchronized in spite of coupling delays between neurons across different communities; however, they may lose synchrony if the coupling delays between the neurons within the same community are too large, such that the synchronization criteria are violated. Copyright © 2016 Elsevier Ltd. All rights reserved.

MORE: mixed optimization for reverse engineering--an application to modeling biological networks response via sparse systems of nonlinear differential equations.

PubMed

Sambo, Francesco; de Oca, Marco A Montes; Di Camillo, Barbara; Toffolo, Gianna; Stützle, Thomas

2012-01-01

Reverse engineering is the problem of inferring the structure of a network of interactions between biological variables from a set of observations. In this paper, we propose an optimization algorithm, called MORE, for the reverse engineering of biological networks from time series data. The model inferred by MORE is a sparse system of nonlinear differential equations, complex enough to realistically describe the dynamics of a biological system. MORE tackles separately the discrete component of the problem, the determination of the biological network topology, and the continuous component of the problem, the strength of the interactions. This approach allows us both to enforce system sparsity, by globally constraining the number of edges, and to integrate a priori information about the structure of the underlying interaction network. Experimental results on simulated and real-world networks show that the mixed discrete/continuous optimization approach of MORE significantly outperforms standard continuous optimization and that MORE is competitive with the state of the art in terms of accuracy of the inferred networks.

Effect of Morphologic Features of Neurons on the Extracellular Electric Potential: A Simulation Study Using Cable Theory and Electro-Quasi-Static Equations.

PubMed

Bestel, R; Appali, R; van Rienen, U; Thielemann, C

2017-11-01

Microelectrode arrays serve as an indispensable tool in electro-physiological research to study the electrical activity of neural cells, enabling measurements of single cell as well as network communication analysis. Recent experimental studies have reported that the neuronal geometry has an influence on electrical signaling and extracellular recordings. However, the corresponding mechanisms are not yet fully understood and require further investigation. Allowing systematic parameter studies, computational modeling provides the opportunity to examine the underlying effects that influence extracellular potentials. In this letter, we present an in silico single cell model to analyze the effect of geometrical variability on the extracellular electric potentials. We describe finite element models of a single neuron with varying geometric complexity in three-dimensional space. The electric potential generation of the neuron is modeled using Hodgkin-Huxley equations. The signal propagation is described with electro-quasi-static equations, and results are compared with corresponding cable equation descriptions. Our results show that both the geometric dimensions and the distribution of ion channels of a neuron are critical factors that significantly influence both the amplitude and shape of extracellular potentials.

Numerical study of Free Convective Viscous Dissipative flow along Vertical Cone with Influence of Radiation using Network Simulation method

NASA Astrophysics Data System (ADS)

Kannan, R. M.; Pullepu, Bapuji; Immanuel, Y.

2018-04-01

A two dimensional mathematical model is formulated for the transient laminar free convective flow with heat transfer over an incompressible viscous fluid past a vertical cone with uniform surface heat flux with combined effects of viscous dissipation and radiation. The dimensionless boundary layer equations of the flow which are transient, coupled and nonlinear Partial differential equations are solved using the Network Simulation Method (NSM), a powerful numerical technique which demonstrates high efficiency and accuracy by employing the network simulator computer code Pspice. The velocity and temperature profiles have been investigated for various factors, namely viscous dissipation parameter ε, Prandtl number Pr and radiation Rd are analyzed graphically.

Fractional Dynamics of Network Growth Constrained by Aging Node Interactions

PubMed Central

Safdari, Hadiseh; Zare Kamali, Milad; Shirazi, Amirhossein; Khalighi, Moein; Jafari, Gholamreza; Ausloos, Marcel

2016-01-01

In many social complex systems, in which agents are linked by non-linear interactions, the history of events strongly influences the whole network dynamics. However, a class of “commonly accepted beliefs” seems rarely studied. In this paper, we examine how the growth process of a (social) network is influenced by past circumstances. In order to tackle this cause, we simply modify the well known preferential attachment mechanism by imposing a time dependent kernel function in the network evolution equation. This approach leads to a fractional order Barabási-Albert (BA) differential equation, generalizing the BA model. Our results show that, with passing time, an aging process is observed for the network dynamics. The aging process leads to a decay for the node degree values, thereby creating an opposing process to the preferential attachment mechanism. On one hand, based on the preferential attachment mechanism, nodes with a high degree are more likely to absorb links; but, on the other hand, a node’s age has a reduced chance for new connections. This competitive scenario allows an increased chance for younger members to become a hub. Simulations of such a network growth with aging constraint confirm the results found from solving the fractional BA equation. We also report, as an exemplary application, an investigation of the collaboration network between Hollywood movie actors. It is undubiously shown that a decay in the dynamics of their collaboration rate is found, even including a sex difference. Such findings suggest a widely universal application of the so generalized BA model. PMID:27171424

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

PubMed

Davis, Jeffrey M

2014-12-01

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

Inductors and Inductance-Resistance Networks.

ERIC Educational Resources Information Center

Kirwin, Gerald J.

This programed booklet presents ideas related to inductors and inductance--resistance networks. It is designed for the engineering student who is familiar with differential equations and electrical networks. A variety of cases are considered with the idea of developing in the student a broad acquaintance with the inductor response. The booklet is…

A variational approach to parameter estimation in ordinary differential equations.

PubMed

Kaschek, Daniel; Timmer, Jens

2012-08-14

Ordinary differential equations are widely-used in the field of systems biology and chemical engineering to model chemical reaction networks. Numerous techniques have been developed to estimate parameters like rate constants, initial conditions or steady state concentrations from time-resolved data. In contrast to this countable set of parameters, the estimation of entire courses of network components corresponds to an innumerable set of parameters. The approach presented in this work is able to deal with course estimation for extrinsic system inputs or intrinsic reactants, both not being constrained by the reaction network itself. Our method is based on variational calculus which is carried out analytically to derive an augmented system of differential equations including the unconstrained components as ordinary state variables. Finally, conventional parameter estimation is applied to the augmented system resulting in a combined estimation of courses and parameters. The combined estimation approach takes the uncertainty in input courses correctly into account. This leads to precise parameter estimates and correct confidence intervals. In particular this implies that small motifs of large reaction networks can be analysed independently of the rest. By the use of variational methods, elements from control theory and statistics are combined allowing for future transfer of methods between the two fields.

The SIMRAND methodology: Theory and application for the simulation of research and development projects

NASA Technical Reports Server (NTRS)

Miles, R. F., Jr.

1986-01-01

A research and development (R&D) project often involves a number of decisions that must be made concerning which subset of systems or tasks are to be undertaken to achieve the goal of the R&D project. To help in this decision making, SIMRAND (SIMulation of Research ANd Development Projects) is a methodology for the selection of the optimal subset of systems or tasks to be undertaken on an R&D project. Using alternative networks, the SIMRAND methodology models the alternative subsets of systems or tasks under consideration. Each path through an alternative network represents one way of satisfying the project goals. Equations are developed that relate the system or task variables to the measure of reference. Uncertainty is incorporated by treating the variables of the equations probabilistically as random variables, with cumulative distribution functions assessed by technical experts. Analytical techniques of probability theory are used to reduce the complexity of the alternative networks. Cardinal utility functions over the measure of preference are assessed for the decision makers. A run of the SIMRAND Computer I Program combines, in a Monte Carlo simulation model, the network structure, the equations, the cumulative distribution functions, and the utility functions.

A theoretical and computational framework for mechanics of the cortex

NASA Astrophysics Data System (ADS)

Torres-SáNchez, Alejandro; Arroyo, Marino

The cell cortex is a thin network of actin filaments lying beneath the cell surface of animal cells. Myosin motors exert contractile forces in this network leading to active stresses, which play a key role in processes such as cytokinesis or cell migration. Thus, understanding the mechanics of the cortex is fundamental to understand the mechanics of animal cells. Due to the dynamic remodeling of the actin network, the cortex behaves as a viscoelastic fluid. Furthermore, due to the difference between its thickness (tens of nanometers) and its dimensions (tens of microns), the cortex can be regarded a surface. Thus, we can model the cortex as a viscoelastic fluid, confined to a surface, that generates active stresses. Interestingly, geometric confinement results in the coupling between shape generation and material flows. In this work we present a theoretical framework to model the mechanics of the cortex that couples elasticity, hydrodynamics and force generation. We complement our theoretical description with a computational setting to simulate the resulting non-linear equations. We use this methodology to understand different processes such as asymmetric cell division or experimental probing of the rheology of the cortex We acknowledge the support of the Europen Research Council through Grant ERC CoG-681434.

Network-centric decision architecture for financial or 1/f data models

NASA Astrophysics Data System (ADS)

Jaenisch, Holger M.; Handley, James W.; Massey, Stoney; Case, Carl T.; Songy, Claude G.

2002-12-01

This paper presents a decision architecture algorithm for training neural equation based networks to make autonomous multi-goal oriented, multi-class decisions. These architectures make decisions based on their individual goals and draw from the same network centric feature set. Traditionally, these architectures are comprised of neural networks that offer marginal performance due to lack of convergence of the training set. We present an approach for autonomously extracting sample points as I/O exemplars for generation of multi-branch, multi-node decision architectures populated by adaptively derived neural equations. To test the robustness of this architecture, open source data sets in the form of financial time series were used, requiring a three-class decision space analogous to the lethal, non-lethal, and clutter discrimination problem. This algorithm and the results of its application are presented here.

Mechanisms of stochastic focusing and defocusing in biological reaction networks: insight from accurate chemical master equation (ACME) solutions.

PubMed

Gursoy, Gamze; Terebus, Anna; Youfang Cao; Jie Liang

2016-08-01

Stochasticity plays important roles in regulation of biochemical reaction networks when the copy numbers of molecular species are small. Studies based on Stochastic Simulation Algorithm (SSA) has shown that a basic reaction system can display stochastic focusing (SF) by increasing the sensitivity of the network as a result of the signal noise. Although SSA has been widely used to study stochastic networks, it is ineffective in examining rare events and this becomes a significant issue when the tails of probability distributions are relevant as is the case of SF. Here we use the ACME method to solve the exact solution of the discrete Chemical Master Equations and to study a network where SF was reported. We showed that the level of SF depends on the degree of the fluctuations of signal molecule. We discovered that signaling noise under certain conditions in the same reaction network can lead to a decrease in the system sensitivities, thus the network can experience stochastic defocusing. These results highlight the fundamental role of stochasticity in biological reaction networks and the need for exact computation of probability landscape of the molecules in the system.

Can longitudinal generalized estimating equation models distinguish network influence and homophily? An agent-based modeling approach to measurement characteristics.

PubMed

Sauser Zachrison, Kori; Iwashyna, Theodore J; Gebremariam, Achamyeleh; Hutchins, Meghan; Lee, Joyce M

2016-12-28

Connected individuals (or nodes) in a network are more likely to be similar than two randomly selected nodes due to homophily and/or network influence. Distinguishing between these two influences is an important goal in network analysis, and generalized estimating equation (GEE) analyses of longitudinal dyadic network data are an attractive approach. It is not known to what extent such regressions can accurately extract underlying data generating processes. Therefore our primary objective is to determine to what extent, and under what conditions, does the GEE-approach recreate the actual dynamics in an agent-based model. We generated simulated cohorts with pre-specified network characteristics and attachments in both static and dynamic networks, and we varied the presence of homophily and network influence. We then used statistical regression and examined the GEE model performance in each cohort to determine whether the model was able to detect the presence of homophily and network influence. In cohorts with both static and dynamic networks, we find that the GEE models have excellent sensitivity and reasonable specificity for determining the presence or absence of network influence, but little ability to distinguish whether or not homophily is present. The GEE models are a valuable tool to examine for the presence of network influence in longitudinal data, but are quite limited with respect to homophily.

Design and Test of Pseudorandom Number Generator Using a Star Network of Lorenz Oscillators

NASA Astrophysics Data System (ADS)

Cho, Kenichiro; Miyano, Takaya

We have recently developed a chaos-based stream cipher based on augmented Lorenz equations as a star network of Lorenz subsystems. In our method, the augmented Lorenz equations are used as a pseudorandom number generator. In this study, we propose a new method based on the augmented Lorenz equations for generating binary pseudorandom numbers and evaluate its security using the statistical tests of SP800-22 published by the National Institute for Standards and Technology in comparison with the performances of other chaotic dynamical models used as binary pseudorandom number generators. We further propose a faster version of the proposed method and evaluate its security using the statistical tests of TestU01 published by L’Ecuyer and Simard.

Cell shape and negative links in regulatory motifs together control spatial information flow in signaling networks.

PubMed

Neves, Susana R; Tsokas, Panayiotis; Sarkar, Anamika; Grace, Elizabeth A; Rangamani, Padmini; Taubenfeld, Stephen M; Alberini, Cristina M; Schaff, James C; Blitzer, Robert D; Moraru, Ion I; Iyengar, Ravi

2008-05-16

The role of cell size and shape in controlling local intracellular signaling reactions, and how this spatial information originates and is propagated, is not well understood. We have used partial differential equations to model the flow of spatial information from the beta-adrenergic receptor to MAPK1,2 through the cAMP/PKA/B-Raf/MAPK1,2 network in neurons using real geometries. The numerical simulations indicated that cell shape controls the dynamics of local biochemical activity of signal-modulated negative regulators, such as phosphodiesterases and protein phosphatases within regulatory loops to determine the size of microdomains of activated signaling components. The model prediction that negative regulators control the flow of spatial information to downstream components was verified experimentally in rat hippocampal slices. These results suggest a mechanism by which cellular geometry, the presence of regulatory loops with negative regulators, and key reaction rates all together control spatial information transfer and microdomain characteristics within cells.

Wavefront cellular learning automata.

PubMed

Moradabadi, Behnaz; Meybodi, Mohammad Reza

2018-02-01

This paper proposes a new cellular learning automaton, called a wavefront cellular learning automaton (WCLA). The proposed WCLA has a set of learning automata mapped to a connected structure and uses this structure to propagate the state changes of the learning automata over the structure using waves. In the WCLA, after one learning automaton chooses its action, if this chosen action is different from the previous action, it can send a wave to its neighbors and activate them. Each neighbor receiving the wave is activated and must choose a new action. This structure for the WCLA is necessary in many dynamic areas such as social networks, computer networks, grid computing, and web mining. In this paper, we introduce the WCLA framework as an optimization tool with diffusion capability, study its behavior over time using ordinary differential equation solutions, and present its accuracy using expediency analysis. To show the superiority of the proposed WCLA, we compare the proposed method with some other types of cellular learning automata using two benchmark problems.

Negative autoregulation matches production and demand in synthetic transcriptional networks.

PubMed

Franco, Elisa; Giordano, Giulia; Forsberg, Per-Ola; Murray, Richard M

2014-08-15

We propose a negative feedback architecture that regulates activity of artificial genes, or "genelets", to meet their output downstream demand, achieving robustness with respect to uncertain open-loop output production rates. In particular, we consider the case where the outputs of two genelets interact to form a single assembled product. We show with analysis and experiments that negative autoregulation matches the production and demand of the outputs: the magnitude of the regulatory signal is proportional to the "error" between the circuit output concentration and its actual demand. This two-device system is experimentally implemented using in vitro transcriptional networks, where reactions are systematically designed by optimizing nucleic acid sequences with publicly available software packages. We build a predictive ordinary differential equation (ODE) model that captures the dynamics of the system and can be used to numerically assess the scalability of this architecture to larger sets of interconnected genes. Finally, with numerical simulations we contrast our negative autoregulation scheme with a cross-activation architecture, which is less scalable and results in slower response times.

Wavefront cellular learning automata

NASA Astrophysics Data System (ADS)

Moradabadi, Behnaz; Meybodi, Mohammad Reza

2018-02-01

This paper proposes a new cellular learning automaton, called a wavefront cellular learning automaton (WCLA). The proposed WCLA has a set of learning automata mapped to a connected structure and uses this structure to propagate the state changes of the learning automata over the structure using waves. In the WCLA, after one learning automaton chooses its action, if this chosen action is different from the previous action, it can send a wave to its neighbors and activate them. Each neighbor receiving the wave is activated and must choose a new action. This structure for the WCLA is necessary in many dynamic areas such as social networks, computer networks, grid computing, and web mining. In this paper, we introduce the WCLA framework as an optimization tool with diffusion capability, study its behavior over time using ordinary differential equation solutions, and present its accuracy using expediency analysis. To show the superiority of the proposed WCLA, we compare the proposed method with some other types of cellular learning automata using two benchmark problems.

Mean-field message-passing equations in the Hopfield model and its generalizations

NASA Astrophysics Data System (ADS)

Mézard, Marc

2017-02-01

Motivated by recent progress in using restricted Boltzmann machines as preprocessing algorithms for deep neural network, we revisit the mean-field equations [belief-propagation and Thouless-Anderson Palmer (TAP) equations] in the best understood of such machines, namely the Hopfield model of neural networks, and we explicit how they can be used as iterative message-passing algorithms, providing a fast method to compute the local polarizations of neurons. In the "retrieval phase", where neurons polarize in the direction of one memorized pattern, we point out a major difference between the belief propagation and TAP equations: The set of belief propagation equations depends on the pattern which is retrieved, while one can use a unique set of TAP equations. This makes the latter method much better suited for applications in the learning process of restricted Boltzmann machines. In the case where the patterns memorized in the Hopfield model are not independent, but are correlated through a combinatorial structure, we show that the TAP equations have to be modified. This modification can be seen either as an alteration of the reaction term in TAP equations or, more interestingly, as the consequence of message passing on a graphical model with several hidden layers, where the number of hidden layers depends on the depth of the correlations in the memorized patterns. This layered structure is actually necessary when one deals with more general restricted Boltzmann machines.

Relations between mental health team characteristics and work role performance.

PubMed

Fleury, Marie-Josée; Grenier, Guy; Bamvita, Jean-Marie; Farand, Lambert

2017-01-01

Effective mental health care requires a high performing, interprofessional team. Among 79 mental health teams in Quebec (Canada), this exploratory study aims to 1) determine the association between work role performance and a wide range of variables related to team effectiveness according to the literature, and to 2) using structural equation modelling, assess the covariance between each of these variables as well as the correlation with other exogenous variables. Work role performance was measured with an adapted version of a work role questionnaire. Various independent variables including team manager characteristics, user characteristics, team profiles, clinical activities, organizational culture, network integration strategies and frequency/satisfaction of interactions with other teams or services were analyzed under the structural equation model. The later provided a good fit with the data. Frequent use of standardized procedures and evaluation tools (e.g. screening and assessment tools for mental health disorders) and team manager seniority exerted the most direct effect on work role performance. While network integration strategies had little effect on work role performance, there was a high covariance between this variable and those directly affecting work role performance among mental health teams. The results suggest that the mental healthcare system should apply standardized procedures and evaluation tools and, to a lesser extent, clinical approaches to improve work role performance in mental health teams. Overall, a more systematic implementation of network integration strategies may contribute to improved work role performance in mental health care.

Relations between mental health team characteristics and work role performance

PubMed Central

Grenier, Guy; Bamvita, Jean-Marie; Farand, Lambert

2017-01-01

Effective mental health care requires a high performing, interprofessional team. Among 79 mental health teams in Quebec (Canada), this exploratory study aims to 1) determine the association between work role performance and a wide range of variables related to team effectiveness according to the literature, and to 2) using structural equation modelling, assess the covariance between each of these variables as well as the correlation with other exogenous variables. Work role performance was measured with an adapted version of a work role questionnaire. Various independent variables including team manager characteristics, user characteristics, team profiles, clinical activities, organizational culture, network integration strategies and frequency/satisfaction of interactions with other teams or services were analyzed under the structural equation model. The later provided a good fit with the data. Frequent use of standardized procedures and evaluation tools (e.g. screening and assessment tools for mental health disorders) and team manager seniority exerted the most direct effect on work role performance. While network integration strategies had little effect on work role performance, there was a high covariance between this variable and those directly affecting work role performance among mental health teams. The results suggest that the mental healthcare system should apply standardized procedures and evaluation tools and, to a lesser extent, clinical approaches to improve work role performance in mental health teams. Overall, a more systematic implementation of network integration strategies may contribute to improved work role performance in mental health care. PMID:28991923

A Lagrangian Formulation of Neural Networks I: Theory and Analog Dynamics

NASA Technical Reports Server (NTRS)

Mjolsness, Eric; Miranker, Willard L.

1997-01-01

We expand the mathematicla apparatus for relaxation networks, which conventionally consists of an objective function E and a dynamics given by a system of differenctial equations along whose trajectories E is diminished.

Mechanisms of complex network growth: Synthesis of the preferential attachment and fitness models

NASA Astrophysics Data System (ADS)

Golosovsky, Michael

2018-06-01

We analyze growth mechanisms of complex networks and focus on their validation by measurements. To this end we consider the equation Δ K =A (t ) (K +K0) Δ t , where K is the node's degree, Δ K is its increment, A (t ) is the aging constant, and K0 is the initial attractivity. This equation has been commonly used to validate the preferential attachment mechanism. We show that this equation is undiscriminating and holds for the fitness model [Caldarelli et al., Phys. Rev. Lett. 89, 258702 (2002), 10.1103/PhysRevLett.89.258702] as well. In other words, accepted method of the validation of the microscopic mechanism of network growth does not discriminate between "rich-gets-richer" and "good-gets-richer" scenarios. This means that the growth mechanism of many natural complex networks can be based on the fitness model rather than on the preferential attachment, as it was believed so far. The fitness model yields the long-sought explanation for the initial attractivity K0, an elusive parameter which was left unexplained within the framework of the preferential attachment model. We show that the initial attractivity is determined by the width of the fitness distribution. We also present the network growth model based on recursive search with memory and show that this model contains both the preferential attachment and the fitness models as extreme cases.

Organic carbon and fine sediment production potential from decaying permafrost in a small watershed, Sheldrake River, Eastern coastal region of Hudson Bay

NASA Astrophysics Data System (ADS)

Jolivel, M.; Allard, M.

2010-12-01

Recent evaluations indicate that large amounts of organic carbon and fine sediment can be released in fluvial and coastal systems because of permafrost degradation, with impacts on ecosystems. In order to estimate the organic carbon and fine sediment potential production from a river basin, we have made a spatiotemporal comparison between 1957 aerial photographs and a 2009 GeoEye satellite image. A gauging station was installed near the river mouth and measurements of the extent and volume of permafrost degradation were made in the watershed where permafrost degradation is very active. The Sheldrake river watershed is located on the eastern coast of Hudson Bay near the Inuit community of Umiujaq, in the discontinuous permafrost zone. The tree line passes across the watershed. Permafrost mounds (palsas, lithalsas) and plateaus are the most abundant permafrost landforms in this area. They developed principally in east-west oriented valleys, in postglacial marine silts of the Tyrrell Sea. Signs of degradation are numerous. Lithalsas and palsas (with peat cover) weather out and collapse. Thermokarst ponds are replacing permafrost mounds and sometimes, eroded clay and peat are remobilized in the drainage network. Moreover, several retrogressive landslides, mudflows and gully erosion are active along the Sheldrake river banks. The first step consisted in mapping the 80 km2 watershed area and representing surface deposits, drainage network and permafrost distribution (1957 and 2009). First results show that 40 to 70% of the 1957 permafrost has disappeared in 2009 in various sector of the watershed. The percentage of permafrost degradation is positively correlated with distance from the sea and the presence of a well-developed drainage network. The second step is to calculate an equation which will allow changing the missing permafrost surface between 1957 and 2009 into a volume. The equation will take into account the average depth of permafrost and active layer, the mean height of permafrost mounds, the size of landslides, the average thickness of peat cover and its density, the mean water (ice) content. First calculations show that 125 000 tonnes of peat (organic carbon) have been eroded on the watershed since 1957. Then, study of the drainage network and continuous measure of turbidity and water level will allow to estimate the volume of sediment and organic carbon transfer to the sea through the river system.

Estimating dynamic permeability in fractal pore network saturated by Maxwellian fluid

NASA Astrophysics Data System (ADS)

Sun, W.

2017-12-01

The frequency dependent flow of fluid in porous media is an important issue in geophysical prospecting. Oscillating flow in pipe leads to frequency dependent dynamic permeability and has been studied in pore network containing Newtonian fluid. But there is little work on oscillating complex fluid in pipe network, especially in irregular network. Here we formulated frequency dependent permeability for Maxwellian fluid and estimated the permeability in three-dimensional fractal network model. We consider an infinitely long cylindrical pipe with rigid solid wall. The pipe is filled with Maxwellian fluids. Based on the mass conservation equation, the equilibrium equation of force and Maxwell constitutive relationship, we formulated the flux by integration of axial velocity component over the pipe's cross section. Then we extend single pipe formulation to a 3D irregular network. Flux balance condition yields a set of linear equations whose unknowns are the fluid pressure at each node. By evaluating the total flow flux through the network, the dynamic permeability can be calculated.We investigated the dynamic permeability of brine and CPyCl/NaSal in a 3D porous sample with a cubic side length 1 cm. The pore network is created by a Voronoi cell filling method. The porosity, i.e., volume ratio between pore/pipe network and the overall cubic, is set as 0.1. The irregular pore network has a fractal structure. The dimension d of the pore network is defined by the relation between node number M within a sphere and the radius r of the sphere,M=rd.The results show that both brine and Maxwellian fluid's permeability maintain a stable value at low frequency, then decreases with fluctuating peaks. The dynamic permeability in pore networks saturated by Maxwellian fluid (CPyCl/NaSal (60 mM)) show larger peaks during the decline process at high frequency, which represents the typical resonance behavior. Dynamic permeability shows clear dependence on the dimension of the fractal network. Small-scale network has higher dimension than large-scale networks. The reason is that in larger networks pore and inter-pore connections are so dense that the probability P(r) to have a neighboring pore at distance r decays faster. The proposed model may be used to explain velocity dispersion in unconventional reservoir rocks observed in laboratory.

Macroscopic phase-resetting curves for spiking neural networks

NASA Astrophysics Data System (ADS)

Dumont, Grégory; Ermentrout, G. Bard; Gutkin, Boris

2017-10-01

The study of brain rhythms is an open-ended, and challenging, subject of interest in neuroscience. One of the best tools for the understanding of oscillations at the single neuron level is the phase-resetting curve (PRC). Synchronization in networks of neurons, effects of noise on the rhythms, effects of transient stimuli on the ongoing rhythmic activity, and many other features can be understood by the PRC. However, most macroscopic brain rhythms are generated by large populations of neurons, and so far it has been unclear how the PRC formulation can be extended to these more common rhythms. In this paper, we describe a framework to determine a macroscopic PRC (mPRC) for a network of spiking excitatory and inhibitory neurons that generate a macroscopic rhythm. We take advantage of a thermodynamic approach combined with a reduction method to simplify the network description to a small number of ordinary differential equations. From this simplified but exact reduction, we can compute the mPRC via the standard adjoint method. Our theoretical findings are illustrated with and supported by numerical simulations of the full spiking network. Notably our mPRC framework allows us to predict the difference between effects of transient inputs to the excitatory versus the inhibitory neurons in the network.

General solution of the chemical master equation and modality of marginal distributions for hierarchic first-order reaction networks.

PubMed

Reis, Matthias; Kromer, Justus A; Klipp, Edda

2018-01-20

Multimodality is a phenomenon which complicates the analysis of statistical data based exclusively on mean and variance. Here, we present criteria for multimodality in hierarchic first-order reaction networks, consisting of catalytic and splitting reactions. Those networks are characterized by independent and dependent subnetworks. First, we prove the general solvability of the Chemical Master Equation (CME) for this type of reaction network and thereby extend the class of solvable CME's. Our general solution is analytical in the sense that it allows for a detailed analysis of its statistical properties. Given Poisson/deterministic initial conditions, we then prove the independent species to be Poisson/binomially distributed, while the dependent species exhibit generalized Poisson/Khatri Type B distributions. Generalized Poisson/Khatri Type B distributions are multimodal for an appropriate choice of parameters. We illustrate our criteria for multimodality by several basic models, as well as the well-known two-stage transcription-translation network and Bateman's model from nuclear physics. For both examples, multimodality was previously not reported.

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.

Collective behavior of large-scale neural networks with GPU acceleration.

PubMed

Qu, Jingyi; Wang, Rubin

2017-12-01

In this paper, the collective behaviors of a small-world neuronal network motivated by the anatomy of a mammalian cortex based on both Izhikevich model and Rulkov model are studied. The Izhikevich model can not only reproduce the rich behaviors of biological neurons but also has only two equations and one nonlinear term. Rulkov model is in the form of difference equations that generate a sequence of membrane potential samples in discrete moments of time to improve computational efficiency. These two models are suitable for the construction of large scale neural networks. By varying some key parameters, such as the connection probability and the number of nearest neighbor of each node, the coupled neurons will exhibit types of temporal and spatial characteristics. It is demonstrated that the implementation of GPU can achieve more and more acceleration than CPU with the increasing of neuron number and iterations. These two small-world network models and GPU acceleration give us a new opportunity to reproduce the real biological network containing a large number of neurons.

Diffusion in random networks

DOE PAGES

Zhang, Duan Z.; Padrino, Juan C.

2017-06-01

The ensemble averaging technique is applied to model mass transport by diffusion in random networks. The system consists of an ensemble of random networks, where each network is made of pockets connected by tortuous channels. Inside a channel, fluid transport is assumed to be governed by the one-dimensional diffusion equation. Mass balance leads to an integro-differential equation for the pocket mass density. The so-called dual-porosity model is found to be equivalent to the leading order approximation of the integration kernel when the diffusion time scale inside the channels is small compared to the macroscopic time scale. As a test problem,more » we consider the one-dimensional mass diffusion in a semi-infinite domain. Because of the required time to establish the linear concentration profile inside a channel, for early times the similarity variable is xt $-$1/4 rather than xt $-$1/2 as in the traditional theory. We found this early time similarity can be explained by random walk theory through the network.« less

Synchronization between uncertain nonidentical networks with quantum chaotic behavior

NASA Astrophysics Data System (ADS)

Li, Wenlin; Li, Chong; Song, Heshan

2016-11-01

Synchronization between uncertain nonidentical networks with quantum chaotic behavior is researched. The identification laws of unknown parameters in state equations of network nodes, the adaptive laws of configuration matrix elements and outer coupling strengths are determined based on Lyapunov theorem. The conditions of realizing synchronization between uncertain nonidentical networks are discussed and obtained. Further, Jaynes-Cummings model in physics are taken as the nodes of two networks and simulation results show that the synchronization performance between networks is very stable.

Estimation of Thalamocortical and Intracortical Network Models from Joint Thalamic Single-Electrode and Cortical Laminar-Electrode Recordings in the Rat Barrel System

PubMed Central

Blomquist, Patrick; Devor, Anna; Indahl, Ulf G.; Ulbert, Istvan; Einevoll, Gaute T.; Dale, Anders M.

2009-01-01

A new method is presented for extraction of population firing-rate models for both thalamocortical and intracortical signal transfer based on stimulus-evoked data from simultaneous thalamic single-electrode and cortical recordings using linear (laminar) multielectrodes in the rat barrel system. Time-dependent population firing rates for granular (layer 4), supragranular (layer 2/3), and infragranular (layer 5) populations in a barrel column and the thalamic population in the homologous barreloid are extracted from the high-frequency portion (multi-unit activity; MUA) of the recorded extracellular signals. These extracted firing rates are in turn used to identify population firing-rate models formulated as integral equations with exponentially decaying coupling kernels, allowing for straightforward transformation to the more common firing-rate formulation in terms of differential equations. Optimal model structures and model parameters are identified by minimizing the deviation between model firing rates and the experimentally extracted population firing rates. For the thalamocortical transfer, the experimental data favor a model with fast feedforward excitation from thalamus to the layer-4 laminar population combined with a slower inhibitory process due to feedforward and/or recurrent connections and mixed linear-parabolic activation functions. The extracted firing rates of the various cortical laminar populations are found to exhibit strong temporal correlations for the present experimental paradigm, and simple feedforward population firing-rate models combined with linear or mixed linear-parabolic activation function are found to provide excellent fits to the data. The identified thalamocortical and intracortical network models are thus found to be qualitatively very different. While the thalamocortical circuit is optimally stimulated by rapid changes in the thalamic firing rate, the intracortical circuits are low-pass and respond most strongly to slowly varying inputs from the cortical layer-4 population. PMID:19325875

Endemic infections are always possible on regular networks

NASA Astrophysics Data System (ADS)

Del Genio, Charo I.; House, Thomas

2013-10-01

We study the dependence of the largest component in regular networks on the clustering coefficient, showing that its size changes smoothly without undergoing a phase transition. We explain this behavior via an analytical approach based on the network structure, and provide an exact equation describing the numerical results. Our work indicates that intrinsic structural properties always allow the spread of epidemics on regular networks.

Time-ordered product expansions for computational stochastic system biology.

PubMed

Mjolsness, Eric

2013-06-01

The time-ordered product framework of quantum field theory can also be used to understand salient phenomena in stochastic biochemical networks. It is used here to derive Gillespie's stochastic simulation algorithm (SSA) for chemical reaction networks; consequently, the SSA can be interpreted in terms of Feynman diagrams. It is also used here to derive other, more general simulation and parameter-learning algorithms including simulation algorithms for networks of stochastic reaction-like processes operating on parameterized objects, and also hybrid stochastic reaction/differential equation models in which systems of ordinary differential equations evolve the parameters of objects that can also undergo stochastic reactions. Thus, the time-ordered product expansion can be used systematically to derive simulation and parameter-fitting algorithms for stochastic systems.

Weak bedrock allows north-south elongation of channels in semi-arid landscapes

NASA Astrophysics Data System (ADS)

Johnstone, Samuel A.; Finnegan, Noah J.; Hilley, George E.

2017-11-01

Differences in the lengths of pole- and equator-facing slopes are observed in a variety of landscapes. These differences are generally attributed to relative variations in the intensity of mass-transport processes on slopes receiving different magnitudes of solar radiation. By measuring anomalies in the planform characteristics of drainage networks, we demonstrate that in the most asymmetric landscapes this asymmetry primarily arises from the equator-ward alignment of low-order valley networks. Valley network asymmetry is more severe in rocks expected to offer little resistance to erosion than in more resistant rocks when controlling for climate. This suggests that aspect-driven differences in surface processes that drive differences in landscape evolution are also sensitive to underlying rock type.

Modeling languages for biochemical network simulation: reaction vs equation based approaches.

PubMed

Wiechert, Wolfgang; Noack, Stephan; Elsheikh, Atya

2010-01-01

Biochemical network modeling and simulation is an essential task in any systems biology project. The systems biology markup language (SBML) was established as a standardized model exchange language for mechanistic models. A specific strength of SBML is that numerous tools for formulating, processing, simulation and analysis of models are freely available. Interestingly, in the field of multidisciplinary simulation, the problem of model exchange between different simulation tools occurred much earlier. Several general modeling languages like Modelica have been developed in the 1990s. Modelica enables an equation based modular specification of arbitrary hierarchical differential algebraic equation models. Moreover, libraries for special application domains can be rapidly developed. This contribution compares the reaction based approach of SBML with the equation based approach of Modelica and explains the specific strengths of both tools. Several biological examples illustrating essential SBML and Modelica concepts are given. The chosen criteria for tool comparison are flexibility for constraint specification, different modeling flavors, hierarchical, modular and multidisciplinary modeling. Additionally, support for spatially distributed systems, event handling and network analysis features is discussed. As a major result it is shown that the choice of the modeling tool has a strong impact on the expressivity of the specified models but also strongly depends on the requirements of the application context.

Topology and static response of interaction networks in molecular biology

PubMed Central

Radulescu, Ovidiu; Lagarrigue, Sandrine; Siegel, Anne; Veber, Philippe; Le Borgne, Michel

2005-01-01

We introduce a mathematical framework describing static response of networks occurring in molecular biology. This formalism has many similarities with the Laplace–Kirchhoff equations for electrical networks. We introduce the concept of graph boundary and we show how the response of the biological networks to external perturbations can be related to the Dirichlet or Neumann problems for the corresponding equations on the interaction graph. Solutions to these two problems are given in terms of path moduli (measuring path rigidity with respect to the propagation of interaction along the graph). Path moduli are related to loop products in the interaction graph via generalized Mason–Coates formulae. We apply our results to two specific biological examples: the lactose operon and the genetic regulation of lipogenesis. Our applications show consistency with experimental results and in the case of lipogenesis check some hypothesis on the behaviour of hepatic fatty acids on fasting. PMID:16849230

Back-propagation learning of infinite-dimensional dynamical systems.

PubMed

Tokuda, Isao; Tokunaga, Ryuji; Aihara, Kazuyuki

2003-10-01

This paper presents numerical studies of applying back-propagation learning to a delayed recurrent neural network (DRNN). The DRNN is a continuous-time recurrent neural network having time delayed feedbacks and the back-propagation learning is to teach spatio-temporal dynamics to the DRNN. Since the time-delays make the dynamics of the DRNN infinite-dimensional, the learning algorithm and the learning capability of the DRNN are different from those of the ordinary recurrent neural network (ORNN) having no time-delays. First, two types of learning algorithms are developed for a class of DRNNs. Then, using chaotic signals generated from the Mackey-Glass equation and the Rössler equations, learning capability of the DRNN is examined. Comparing the learning algorithms, learning capability, and robustness against noise of the DRNN with those of the ORNN and time delay neural network, advantages as well as disadvantages of the DRNN are investigated.

A Constructive Mean-Field Analysis of Multi-Population Neural Networks with Random Synaptic Weights and Stochastic Inputs

PubMed Central

Faugeras, Olivier; Touboul, Jonathan; Cessac, Bruno

2008-01-01

We deal with the problem of bridging the gap between two scales in neuronal modeling. At the first (microscopic) scale, neurons are considered individually and their behavior described by stochastic differential equations that govern the time variations of their membrane potentials. They are coupled by synaptic connections acting on their resulting activity, a nonlinear function of their membrane potential. At the second (mesoscopic) scale, interacting populations of neurons are described individually by similar equations. The equations describing the dynamical and the stationary mean-field behaviors are considered as functional equations on a set of stochastic processes. Using this new point of view allows us to prove that these equations are well-posed on any finite time interval and to provide a constructive method for effectively computing their unique solution. This method is proved to converge to the unique solution and we characterize its complexity and convergence rate. We also provide partial results for the stationary problem on infinite time intervals. These results shed some new light on such neural mass models as the one of Jansen and Rit (1995): their dynamics appears as a coarse approximation of the much richer dynamics that emerges from our analysis. Our numerical experiments confirm that the framework we propose and the numerical methods we derive from it provide a new and powerful tool for the exploration of neural behaviors at different scales. PMID:19255631

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

Error estimation in the neural network solution of ordinary differential equations.

PubMed

Filici, Cristian

2010-06-01

In this article a method of error estimation for the neural approximation of the solution of an Ordinary Differential Equation is presented. Some examples of the application of the method support the theory presented. Copyright 2010. Published by Elsevier Ltd.

SIMULTANEOUS DIFFERENTIAL EQUATION COMPUTER

DOEpatents

Collier, D.M.; Meeks, L.A.; Palmer, J.P.

1960-05-10

A description is given for an electronic simulator for a system of simultaneous differential equations, including nonlinear equations. As a specific example, a homogeneous nuclear reactor system including a reactor fluid, heat exchanger, and a steam boiler may be simulated, with the nonlinearity resulting from a consideration of temperature effects taken into account. The simulator includes three operational amplifiers, a multiplier, appropriate potential sources, and interconnecting R-C networks.

Discrete Ricci Flow in Higher Dimensions

DTIC Science & Technology

2015-02-01

simplicial version of the RF equations. The definition of these SRF equations required a subtile definition of the Ricci tensor as we needed to... definition of congestion in networks. This definition mirrors the Wang and Yau definition for quasi-local energy and momentum in general relativity. In... definition and associated corollary: Definition 1. We define the dual-edge Regge-Ricci flow equation for any compact, piecewise–flat simplicial geometry

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

Mean-field theory of a plastic network of integrate-and-fire neurons.

PubMed

Chen, Chun-Chung; Jasnow, David

2010-01-01

We consider a noise-driven network of integrate-and-fire neurons. The network evolves as result of the activities of the neurons following spike-timing-dependent plasticity rules. We apply a self-consistent mean-field theory to the system to obtain the mean activity level for the system as a function of the mean synaptic weight, which predicts a first-order transition and hysteresis between a noise-dominated regime and a regime of persistent neural activity. Assuming Poisson firing statistics for the neurons, the plasticity dynamics of a synapse under the influence of the mean-field environment can be mapped to the dynamics of an asymmetric random walk in synaptic-weight space. Using a master equation for small steps, we predict a narrow distribution of synaptic weights that scales with the square root of the plasticity rate for the stationary state of the system given plausible physiological parameter values describing neural transmission and plasticity. The dependence of the distribution on the synaptic weight of the mean-field environment allows us to determine the mean synaptic weight self-consistently. The effect of fluctuations in the total synaptic conductance and plasticity step sizes are also considered. Such fluctuations result in a smoothing of the first-order transition for low number of afferent synapses per neuron and a broadening of the synaptic-weight distribution, respectively.

Changes in Resting State Effective Connectivity in the Motor Network Following Rehabilitation of Upper Extremity Poststroke Paresis

PubMed Central

James, G. Andrew; Lu, Zhong-Lin; VanMeter, John W.; Sathian, K.; Hu, Xiaoping P.; Butler, Andrew J.

2013-01-01

Background A promising paradigm in human neuroimaging is the study of slow (<0.1 Hz) spontaneous fluctuations in the hemodynamic response measured by functional magnetic resonance imaging (fMRI). Spontaneous activity (i.e., resting state) refers to activity that cannot be attributed to specific inputs or outputs, that is, activity intrinsically generated by the brain. Method This article presents pilot data examining neural connectivity in patients with poststroke hemiparesis before and after 3 weeks of upper extremity rehabilitation in the Accelerated Skill Acquisition Program (ASAP). Resting-state fMRI data acquired pre and post therapy were analyzed using an exploratory adaptation of structural equation modeling (SEM) to evaluate therapy-related changes in motor network effective connectivity. Results Each ASAP patient showed behavioral improvement. ASAP patients also showed increased influence of the affected hemisphere premotor cortex (a-PM) upon the unaffected hemisphere premotor cortex (u-PM) following therapy. The influence of a-PM on affected hemisphere primary motor cortex (a-M1) also increased with therapy for 3 of 5 patients, including those with greatest behavioral improvement. Conclusions Our findings suggest that network analyses of resting-state fMRI constitute promising tools for functional characterization of functional brain disorders, for intergroup comparisons, and potentially for assessing effective connectivity within single subjects; all of which have important implications for stroke rehabilitation. PMID:19740732

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.

Accurate analytic solution of chemical master equations for gene regulation networks in a single cell

NASA Astrophysics Data System (ADS)

Huang, Guan-Rong; Saakian, David B.; Hu, Chin-Kun

2018-01-01

Studying gene regulation networks in a single cell is an important, interesting, and hot research topic of molecular biology. Such process can be described by chemical master equations (CMEs). We propose a Hamilton-Jacobi equation method with finite-size corrections to solve such CMEs accurately at the intermediate region of switching, where switching rate is comparable to fast protein production rate. We applied this approach to a model of self-regulating proteins [H. Ge et al., Phys. Rev. Lett. 114, 078101 (2015), 10.1103/PhysRevLett.114.078101] and found that as a parameter related to inducer concentration increases the probability of protein production changes from unimodal to bimodal, then to unimodal, consistent with phenotype switching observed in a single cell.

Inferring phase equations from multivariate time series.

PubMed

Tokuda, Isao T; Jain, Swati; Kiss, István Z; Hudson, John L

2007-08-10

An approach is presented for extracting phase equations from multivariate time series data recorded from a network of weakly coupled limit cycle oscillators. Our aim is to estimate important properties of the phase equations including natural frequencies and interaction functions between the oscillators. Our approach requires the measurement of an experimental observable of the oscillators; in contrast with previous methods it does not require measurements in isolated single or two-oscillator setups. This noninvasive technique can be advantageous in biological systems, where extraction of few oscillators may be a difficult task. The method is most efficient when data are taken from the nonsynchronized regime. Applicability to experimental systems is demonstrated by using a network of electrochemical oscillators; the obtained phase model is utilized to predict the synchronization diagram of the system.

Availability, Use, and Cultivation of Support Networks as Predictors of the Well-Being of Middle-Aged and Older Chinese: A Panel Study

PubMed Central

Chong, Alice Ming Lin; Cheung, Chau-kiu; Woo, Jean; Kwan, Alex Yui-Huen

2012-01-01

Objectives. To examine the impact of the availability, use, and cultivation of a support network on the well-being of community-dwelling, middle-aged, and older Chinese. Methods. A total of 2,970 Hong Kong Chinese aged 40–74 years were interviewed using a structured questionnaire in 2004. Out of the original group of interviewees, 2,120 (71.4%) were interviewed again in 2005. Results. Structural equation modeling revealed a good fit of the model employing Wave 1 support network data and demographic characteristics to predict Wave 2 well-being. As hypothesized, the availability of important social ties and the cultivation of one's support networks were found to predict well-being one year later, but not the use of support networks to meet emotional, financial, or companion needs after controlling for demographic variables and baseline well-being. Discussion. Cultivating support networks can be interpreted as positive and active coping. Such cultivation is in line with what socioemotional selectivity theory predicts; specifically, when people age, they become more selective and concentrate on strengthening their relationship with those they are emotionally close to. We argue that network cultivation deserves more attention in theory, practice, and research to strengthen the resilience and adaptability of individuals approaching and experiencing old age. PMID:22645494

Interaction of multiple networks modulated by the working memory training based on real-time fMRI

NASA Astrophysics Data System (ADS)

Shen, Jiahui; Zhang, Gaoyan; Zhu, Chaozhe; Yao, Li; Zhao, Xiaojie

2015-03-01

Neuroimaging studies of working memory training have identified the alteration of brain activity as well as the regional interactions within the functional networks such as central executive network (CEN) and default mode network (DMN). However, how the interaction within and between these multiple networks is modulated by the training remains unclear. In this paper, we examined the interaction of three training-induced brain networks during working memory training based on real-time functional magnetic resonance imaging (rtfMRI). Thirty subjects assigned to the experimental and control group respectively participated in two times training separated by seven days. Three networks including silence network (SN), CEN and DMN were identified by the training data with the calculated function connections within each network. Structural equation modeling (SEM) approach was used to construct the directional connectivity patterns. The results showed that the causal influences from the percent signal changes of target ROI to the SN were positively changed in both two groups, as well as the causal influence from the SN to CEN was positively changed in experimental group but negatively changed in control group from the SN to DMN. Further correlation analysis of the changes in each network with the behavioral improvements showed that the changes in SN were stronger positively correlated with the behavioral improvement of letter memory task. These findings indicated that the SN was not only a switch between the target ROI and the other networks in the feedback training but also an essential factor to the behavioral improvement.

Distribution of shortest path lengths in a class of node duplication network models

NASA Astrophysics Data System (ADS)

Steinbock, Chanania; Biham, Ofer; Katzav, Eytan

2017-09-01

We present analytical results for the distribution of shortest path lengths (DSPL) in a network growth model which evolves by node duplication (ND). The model captures essential properties of the structure and growth dynamics of social networks, acquaintance networks, and scientific citation networks, where duplication mechanisms play a major role. Starting from an initial seed network, at each time step a random node, referred to as a mother node, is selected for duplication. Its daughter node is added to the network, forming a link to the mother node, and with probability p to each one of its neighbors. The degree distribution of the resulting network turns out to follow a power-law distribution, thus the ND network is a scale-free network. To calculate the DSPL we derive a master equation for the time evolution of the probability Pt(L =ℓ ) , ℓ =1 ,2 ,⋯ , where L is the distance between a pair of nodes and t is the time. Finding an exact analytical solution of the master equation, we obtain a closed form expression for Pt(L =ℓ ) . The mean distance 〈L〉 t and the diameter Δt are found to scale like lnt , namely, the ND network is a small-world network. The variance of the DSPL is also found to scale like lnt . Interestingly, the mean distance and the diameter exhibit properties of a small-world network, rather than the ultrasmall-world network behavior observed in other scale-free networks, in which 〈L〉 t˜lnlnt .

Compartmental and Spatial Rule-Based Modeling with Virtual Cell.

PubMed

Blinov, Michael L; Schaff, James C; Vasilescu, Dan; Moraru, Ion I; Bloom, Judy E; Loew, Leslie M

2017-10-03

In rule-based modeling, molecular interactions are systematically specified in the form of reaction rules that serve as generators of reactions. This provides a way to account for all the potential molecular complexes and interactions among multivalent or multistate molecules. Recently, we introduced rule-based modeling into the Virtual Cell (VCell) modeling framework, permitting graphical specification of rules and merger of networks generated automatically (using the BioNetGen modeling engine) with hand-specified reaction networks. VCell provides a number of ordinary differential equation and stochastic numerical solvers for single-compartment simulations of the kinetic systems derived from these networks, and agent-based network-free simulation of the rules. In this work, compartmental and spatial modeling of rule-based models has been implemented within VCell. To enable rule-based deterministic and stochastic spatial simulations and network-free agent-based compartmental simulations, the BioNetGen and NFSim engines were each modified to support compartments. In the new rule-based formalism, every reactant and product pattern and every reaction rule are assigned locations. We also introduce the rule-based concept of molecular anchors. This assures that any species that has a molecule anchored to a predefined compartment will remain in this compartment. Importantly, in addition to formulation of compartmental models, this now permits VCell users to seamlessly connect reaction networks derived from rules to explicit geometries to automatically generate a system of reaction-diffusion equations. These may then be simulated using either the VCell partial differential equations deterministic solvers or the Smoldyn stochastic simulator. Copyright © 2017 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Microwave dielectric measurements of erythrocyte suspensions.

PubMed Central

Bao, J Z; Davis, C C; Swicord, M L

1994-01-01

Complex dielectric constants of human erythrocyte suspensions over a frequency range from 45 MHz to 26.5 GHz and a temperature range from 5 to 40 degrees C have been determined with the open-ended coaxial probe technique using an automated vector network analyzer (HP 8510). The spectra show two separate major dispersions (beta and gamma) and a much smaller dispersion between them. The two major dispersions are analyzed with a dispersion equation containing two Cole-Cole functions by means of a complex nonlinear least squares technique. The parameters of the equation at different temperatures have been determined. The low frequency behavior of the spectra suggests that the dielectric constant of the cell membrane increases when the temperature is above 35 degrees C. The real part of the dielectric constant at approximately 3.4 GHz remains almost constant when the temperature changes. The dispersion shifts with temperature in the manner of a thermally activated process, and the thermal activation enthalpies for the beta- and gamma-dispersions are 9.87 +/- 0.42 kcal/mol and 4.80 +/- 0.06 kcal/mol, respectively. PMID:8075351

Dynamical networks with topological self-organization

NASA Technical Reports Server (NTRS)

Zak, M.

2001-01-01

Coupled evolution of state and topology of dynamical networks is introduced. Due to the well organized tensor structure, the governing equations are presented in a canonical form, and required attractors as well as their basins can be easily implanted and controlled.

Identifying interactions in the time and frequency domains in local and global networks - A Granger Causality Approach.

PubMed

Zou, Cunlu; Ladroue, Christophe; Guo, Shuixia; Feng, Jianfeng

2010-06-21

Reverse-engineering approaches such as Bayesian network inference, ordinary differential equations (ODEs) and information theory are widely applied to deriving causal relationships among different elements such as genes, proteins, metabolites, neurons, brain areas and so on, based upon multi-dimensional spatial and temporal data. There are several well-established reverse-engineering approaches to explore causal relationships in a dynamic network, such as ordinary differential equations (ODE), Bayesian networks, information theory and Granger Causality. Here we focused on Granger causality both in the time and frequency domain and in local and global networks, and applied our approach to experimental data (genes and proteins). For a small gene network, Granger causality outperformed all the other three approaches mentioned above. A global protein network of 812 proteins was reconstructed, using a novel approach. The obtained results fitted well with known experimental findings and predicted many experimentally testable results. In addition to interactions in the time domain, interactions in the frequency domain were also recovered. The results on the proteomic data and gene data confirm that Granger causality is a simple and accurate approach to recover the network structure. Our approach is general and can be easily applied to other types of temporal data.

Flow model for open-channel reach or network

USGS Publications Warehouse

Schaffranek, R.W.

1987-01-01

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

Artificial neural network methods in quantum mechanics

NASA Astrophysics Data System (ADS)

Lagaris, I. E.; Likas, A.; Fotiadis, D. I.

1997-08-01

In a previous article we have shown how one can employ Artificial Neural Networks (ANNs) in order to solve non-homogeneous ordinary and partial differential equations. In the present work we consider the solution of eigenvalue problems for differential and integrodifferential operators, using ANNs. We start by considering the Schrödinger equation for the Morse potential that has an analytically known solution, to test the accuracy of the method. We then proceed with the Schrödinger and the Dirac equations for a muonic atom, as well as with a nonlocal Schrödinger integrodifferential equation that models the n + α system in the framework of the resonating group method. In two dimensions we consider the well-studied Henon-Heiles Hamiltonian and in three dimensions the model problem of three coupled anharmonic oscillators. The method in all of the treated cases proved to be highly accurate, robust and efficient. Hence it is a promising tool for tackling problems of higher complexity and dimensionality.

Why Do You Adopt Social Networking Sites? Investigating the Driving Factors through Structural Equation Modelling

ERIC Educational Resources Information Center

Jan, Muhammad Tahir

2017-01-01

Purpose: The purpose of this paper is to investigate those factors that are associated with the adoption of social networking sites from the perspective of Muslim users residing in Malaysia. Design/methodology/approach: A complete self-administered questionnaire was collected from 223 Muslim users of social networking sites in Malaysia. Both…

Network Characteristics, Perceived Social Support, and Psychological Adjustment in Mothers of Children with Autism Spectrum Disorder

ERIC Educational Resources Information Center

Benson, Paul R.

2012-01-01

This study examined the characteristics of the support networks of 106 mothers of children with ASD and their relationship to perceived social support, depressed mood, and subjective well-being. Using structural equation modeling, two competing sets of hypotheses were assessed: (1) that network characteristics would impact psychological adjustment…

Remarks on the chemical Fokker-Planck and Langevin equations: Nonphysical currents at equilibrium.

PubMed

Ceccato, Alessandro; Frezzato, Diego

2018-02-14

The chemical Langevin equation and the associated chemical Fokker-Planck equation are well-known continuous approximations of the discrete stochastic evolution of reaction networks. In this work, we show that these approximations suffer from a physical inconsistency, namely, the presence of nonphysical probability currents at the thermal equilibrium even for closed and fully detailed-balanced kinetic schemes. An illustration is given for a model case.

Theoretical Studies in Plasmas: Crossed-Field Devices and Ionospheric Plasmas

DTIC Science & Technology

2006-06-19

results with the Camassa-Holm equation, we now know how to solve the full DTPP equations. This work is being carried out in collaboration with Dr. Heinz ...consultant) "+ Dr. Heinz Steudel (Humboldt University, Berlin, Germany; consultant) PUBLICATIONS * SUBMITTED * Books/Book Chapters * Journals S1. The Time...France, June 21, 2005. "± Lattice solitons and optical networks, "Conference on Differential & Difference Equations and Applica- tions", Melbourne

Recent Advances in Atmospheric, Solar-Terrestrial Physics and Space Weather From a North-South network of scientists [2006-2016] PART A: TUTORIAL

NASA Astrophysics Data System (ADS)

Amory-Mazaudier, C.; Menvielle, M.; Curto, J-J.; Le Huy, M.

2017-12-01

This paper reviews scientific advances achieved by a North-South network between 2006 and 2016. These scientific advances concern Solar Terrestrial Physics, Atmospheric Physics and Space Weather. In this part A, we introduce knowledge on the Sun-Earth system. We consider the physical process of the dynamo which is present in the Sun, in the core of the Earth and also in the regions between the Sun and the Earth, the solar wind-magnetosphere and the ionosphere. Equations of plasma physics and Maxwell's equations will be recalled. In the Sun-Earth system there are permanent dynamos (Sun, Earth's core, solar wind - magnetosphere, neutral wind - ionosphere) and non-permanent dynamos that are activated during magnetic storms in the magnetosphere and in the ionosphere. All these dynamos have associated electric currents that affect the variations of the Earth's magnetic field which are easily measurable. That is why a part of the tutorial is also devoted to the magnetic indices which are indicators of the electric currents in the Sun-Earth system. In order to understand some results of the part B, we present some characteristics of the Equatorial region and of the electrodynamics coupling the Auroral and Equatorial regions.

Structural equation modeling: building and evaluating causal models: Chapter 8

USGS Publications Warehouse

Grace, James B.; Scheiner, Samuel M.; Schoolmaster, Donald R.

2015-01-01

Scientists frequently wish to study hypotheses about causal relationships, rather than just statistical associations. This chapter addresses the question of how scientists might approach this ambitious task. Here we describe structural equation modeling (SEM), a general modeling framework for the study of causal hypotheses. Our goals are to (a) concisely describe the methodology, (b) illustrate its utility for investigating ecological systems, and (c) provide guidance for its application. Throughout our presentation, we rely on a study of the effects of human activities on wetland ecosystems to make our description of methodology more tangible. We begin by presenting the fundamental principles of SEM, including both its distinguishing characteristics and the requirements for modeling hypotheses about causal networks. We then illustrate SEM procedures and offer guidelines for conducting SEM analyses. Our focus in this presentation is on basic modeling objectives and core techniques. Pointers to additional modeling options are also given.

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

NASA Astrophysics Data System (ADS)

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

2017-09-01

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

Stochastic win-stay-lose-shift strategy with dynamic aspirations in evolutionary social dilemmas

NASA Astrophysics Data System (ADS)

Amaral, Marco A.; Wardil, Lucas; Perc, Matjaž; da Silva, Jafferson K. L.

2016-09-01

In times of plenty expectations rise, just as in times of crisis they fall. This can be mathematically described as a win-stay-lose-shift strategy with dynamic aspiration levels, where individuals aspire to be as wealthy as their average neighbor. Here we investigate this model in the realm of evolutionary social dilemmas on the square lattice and scale-free networks. By using the master equation and Monte Carlo simulations, we find that cooperators coexist with defectors in the whole phase diagram, even at high temptations to defect. We study the microscopic mechanism that is responsible for the striking persistence of cooperative behavior and find that cooperation spreads through second-order neighbors, rather than by means of network reciprocity that dominates in imitation-based models. For the square lattice the master equation can be solved analytically in the large temperature limit of the Fermi function, while for other cases the resulting differential equations must be solved numerically. Either way, we find good qualitative agreement with the Monte Carlo simulation results. Our analysis also reveals that the evolutionary outcomes are to a large degree independent of the network topology, including the number of neighbors that are considered for payoff determination on lattices, which further corroborates the local character of the microscopic dynamics. Unlike large-scale spatial patterns that typically emerge due to network reciprocity, here local checkerboard-like patterns remain virtually unaffected by differences in the macroscopic properties of the interaction network.

Temporal and Latitudinal Variations of the Length-Scales and Relative Intensities of the Chromospheric Network

NASA Astrophysics Data System (ADS)

Raju, K. P.

2018-05-01

The Calcium K spectroheliograms of the Sun from Kodaikanal have a data span of about 100 years and covers over 9 solar cycles. The Ca line is a strong chromospheric line dominated by chromospheric network and plages which are good indicators of solar activity. Length-scales and relative intensities of the chromospheric network have been obtained in the solar latitudes from 50 degree N to 50 degree S from the spectroheliograms. The length-scale was obtained from the half-width of the two-dimensional autocorrelation of the latitude strip which gives a measure of the width of the network boundary. As reported earlier for the transition region extreme ultraviolet (EUV) network, relative intensity and width of the chromospheric network boundary are found to be dependent on the solar cycle. A varying phase difference has been noticed in the quantities in different solar latitudes. A cross-correlation analysis of the quantities from other latitudes with ±30 degree latitude revealed an interesting phase difference pattern indicating flux transfer. Evidence of equatorward flux transfer has been observed. The average equatorward flux transfer was estimated to be 5.8 ms-1. The possible reasons of the drift could be meridional circulation, torsional oscillations, or the bright point migration. Cross-correlation of intensity and length-scale from the same latitude showed increasing phase difference with increasing latitude. We have also obtained the cross correlation of the quantities across the equator to see the possible phase lags in the two hemispheres. Signatures of lags are seen in the length scales of southern hemisphere near the equatorial latitudes, but no such lags in the intensity are observed. The results have important implications on the flux transfer over the solar surface and hence on the solar activity and dynamo.

Neurocomputing

NASA Technical Reports Server (NTRS)

Hecht-Nielsen, Robert

1990-01-01

The present work is intended to give technologists, research scientists, and mathematicians a graduate-level overview of the field of neurocomputing. After exploring the relationship of this field to general neuroscience, attention is given to neural network building blocks, the self-adaptation equations of learning laws, the data-transformation structures of associative networks, and the multilayer data-transformation structures of mapping networks. Also treated are the neurocomputing frontiers of spatiotemporal, stochastic, and hierarchical networks, 'neurosoftware', the creation of neural network-based computers, and neurocomputing applications in sensor processing, control, and data analysis.

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.

Boundary conditions estimation on a road network using compressed sensing.

DOT National Transportation Integrated Search

2016-02-01

This report presents a new boundary condition estimation framework for transportation networks in which : the state is modeled by a first order scalar conservation law. Using an equivalent formulation based on a : Hamilton-Jacobi equation, we pose th...

A design automation framework for computational bioenergetics in biological networks.

PubMed

Angione, Claudio; Costanza, Jole; Carapezza, Giovanni; Lió, Pietro; Nicosia, Giuseppe

2013-10-01

The bioenergetic activity of mitochondria can be thoroughly investigated by using computational methods. In particular, in our work we focus on ATP and NADH, namely the metabolites representing the production of energy in the cell. We develop a computational framework to perform an exhaustive investigation at the level of species, reactions, genes and metabolic pathways. The framework integrates several methods implementing the state-of-the-art algorithms for many-objective optimization, sensitivity, and identifiability analysis applied to biological systems. We use this computational framework to analyze three case studies related to the human mitochondria and the algal metabolism of Chlamydomonas reinhardtii, formally described with algebraic differential equations or flux balance analysis. Integrating the results of our framework applied to interacting organelles would provide a general-purpose method for assessing the production of energy in a biological network.

Dynamic decomposition of spatiotemporal neural signals

PubMed Central

2017-01-01

Neural signals are characterized by rich temporal and spatiotemporal dynamics that reflect the organization of cortical networks. Theoretical research has shown how neural networks can operate at different dynamic ranges that correspond to specific types of information processing. Here we present a data analysis framework that uses a linearized model of these dynamic states in order to decompose the measured neural signal into a series of components that capture both rhythmic and non-rhythmic neural activity. The method is based on stochastic differential equations and Gaussian process regression. Through computer simulations and analysis of magnetoencephalographic data, we demonstrate the efficacy of the method in identifying meaningful modulations of oscillatory signals corrupted by structured temporal and spatiotemporal noise. These results suggest that the method is particularly suitable for the analysis and interpretation of complex temporal and spatiotemporal neural signals. PMID:28558039

Understanding Nomophobia: Structural Equation Modeling and Semantic Network Analysis of Smartphone Separation Anxiety.

PubMed

Han, Seunghee; Kim, Ki Joon; Kim, Jang Hyun

2017-07-01

This study explicates nomophobia by developing a research model that identifies several determinants of smartphone separation anxiety and by conducting semantic network analyses on smartphone users' verbal descriptions of the meaning of their smartphones. Structural equation modeling of the proposed model indicates that personal memories evoked by smartphones encourage users to extend their identity onto their devices. When users perceive smartphones as their extended selves, they are more likely to get attached to the devices, which, in turn, leads to nomophobia by heightening the phone proximity-seeking tendency. This finding is also supplemented by the results of the semantic network analyses revealing that the words related to memory, self, and proximity-seeking are indeed more frequently used in the high, compared with low, nomophobia group.

Structural identifiability of cyclic graphical models of biological networks with latent variables.

PubMed

Wang, Yulin; Lu, Na; Miao, Hongyu

2016-06-13

Graphical models have long been used to describe biological networks for a variety of important tasks such as the determination of key biological parameters, and the structure of graphical model ultimately determines whether such unknown parameters can be unambiguously obtained from experimental observations (i.e., the identifiability problem). Limited by resources or technical capacities, complex biological networks are usually partially observed in experiment, which thus introduces latent variables into the corresponding graphical models. A number of previous studies have tackled the parameter identifiability problem for graphical models such as linear structural equation models (SEMs) with or without latent variables. However, the limited resolution and efficiency of existing approaches necessarily calls for further development of novel structural identifiability analysis algorithms. An efficient structural identifiability analysis algorithm is developed in this study for a broad range of network structures. The proposed method adopts the Wright's path coefficient method to generate identifiability equations in forms of symbolic polynomials, and then converts these symbolic equations to binary matrices (called identifiability matrix). Several matrix operations are introduced for identifiability matrix reduction with system equivalency maintained. Based on the reduced identifiability matrices, the structural identifiability of each parameter is determined. A number of benchmark models are used to verify the validity of the proposed approach. Finally, the network module for influenza A virus replication is employed as a real example to illustrate the application of the proposed approach in practice. The proposed approach can deal with cyclic networks with latent variables. The key advantage is that it intentionally avoids symbolic computation and is thus highly efficient. Also, this method is capable of determining the identifiability of each single parameter and is thus of higher resolution in comparison with many existing approaches. Overall, this study provides a basis for systematic examination and refinement of graphical models of biological networks from the identifiability point of view, and it has a significant potential to be extended to more complex network structures or high-dimensional systems.

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

NASA Technical Reports Server (NTRS)

Press, J.

1972-01-01

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

Machine Learning and Quantum Mechanics

NASA Astrophysics Data System (ADS)

Chapline, George

The author has previously pointed out some similarities between selforganizing neural networks and quantum mechanics. These types of neural networks were originally conceived of as away of emulating the cognitive capabilities of the human brain. Recently extensions of these networks, collectively referred to as deep learning networks, have strengthened the connection between self-organizing neural networks and human cognitive capabilities. In this note we consider whether hardware quantum devices might be useful for emulating neural networks with human-like cognitive capabilities, or alternatively whether implementations of deep learning neural networks using conventional computers might lead to better algorithms for solving the many body Schrodinger equation.

Optimizing Nutrient Uptake in Biological Transport Networks

NASA Astrophysics Data System (ADS)

Ronellenfitsch, Henrik; Katifori, Eleni

2013-03-01

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

Towards a Hybrid Agent-based Model for Mosquito Borne Disease.

PubMed

Mniszewski, S M; Manore, C A; Bryan, C; Del Valle, S Y; Roberts, D

2014-07-01

Agent-based models (ABM) are used to simulate the spread of infectious disease through a population. Detailed human movement, demography, realistic business location networks, and in-host disease progression are available in existing ABMs, such as the Epidemic Simulation System (EpiSimS). These capabilities make possible the exploration of pharmaceutical and non-pharmaceutical mitigation strategies used to inform the public health community. There is a similar need for the spread of mosquito borne pathogens due to the re-emergence of diseases such as chikungunya and dengue fever. A network-patch model for mosquito dynamics has been coupled with EpiSimS. Mosquitoes are represented as a "patch" or "cloud" associated with a location. Each patch has an ordinary differential equation (ODE) mosquito dynamics model and mosquito related parameters relevant to the location characteristics. Activities at each location can have different levels of potential exposure to mosquitoes based on whether they are inside, outside, or somewhere in-between. As a proof of concept, the hybrid network-patch model is used to simulate the spread of chikungunya through Washington, DC. Results are shown for a base case, followed by varying the probability of transmission, mosquito count, and activity exposure. We use visualization to understand the pattern of disease spread.

Multimedia Network Design Study

DTIC Science & Technology

1989-09-30

manipulation and analysis of the equations involved, thereby providing the application of the great range of powerful mathematical optimization...be treated by this analysis. First, all arrivals to the network have the Poisson distribution, and separate traffic classes may have separate qrrival...different for open and closed networks, so these two situations will be treated separately in the following subsections. 2.3.1 The Computational Process in

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.

Performance Parameters Analysis of an XD3P Peugeot Engine Using Artificial Neural Networks (ANN) Concept in MATLAB

NASA Astrophysics Data System (ADS)

Rangaswamy, T.; Vidhyashankar, S.; Madhusudan, M.; Bharath Shekar, H. R.

2015-04-01

The current trends of engineering follow the basic rule of innovation in mechanical engineering aspects. For the engineers to be efficient, problem solving aspects need to be viewed in a multidimensional perspective. One such methodology implemented is the fusion of technologies from other disciplines in order to solve the problems. This paper mainly deals with the application of Neural Networks in order to analyze the performance parameters of an XD3P Peugeot engine (used in Ministry of Defence). The basic propaganda of the work is divided into two main working stages. In the former stage, experimentation of an IC engine is carried out in order to obtain the primary data. In the latter stage the primary database formed is used to design and implement a predictive neural network in order to analyze the output parameters variation with respect to each other. A mathematical governing equation for the neural network is obtained. The obtained polynomial equation describes the characteristic behavior of the built neural network system. Finally, a comparative study of the results is carried out.

Analysis of network motifs in cellular regulation: Structural similarities, input-output relations and signal integration.

PubMed

Straube, Ronny

2017-12-01

Much of the complexity of regulatory networks derives from the necessity to integrate multiple signals and to avoid malfunction due to cross-talk or harmful perturbations. Hence, one may expect that the input-output behavior of larger networks is not necessarily more complex than that of smaller network motifs which suggests that both can, under certain conditions, be described by similar equations. In this review, we illustrate this approach by discussing the similarities that exist in the steady state descriptions of a simple bimolecular reaction, covalent modification cycles and bacterial two-component systems. Interestingly, in all three systems fundamental input-output characteristics such as thresholds, ultrasensitivity or concentration robustness are described by structurally similar equations. Depending on the system the meaning of the parameters can differ ranging from protein concentrations and affinity constants to complex parameter combinations which allows for a quantitative understanding of signal integration in these systems. We argue that this approach may also be extended to larger regulatory networks. Copyright © 2017 Elsevier B.V. All rights reserved.

Fuzzy logic and neural networks in artificial intelligence and pattern recognition

NASA Astrophysics Data System (ADS)

Sanchez, Elie

1991-10-01

With the use of fuzzy logic techniques, neural computing can be integrated in symbolic reasoning to solve complex real world problems. In fact, artificial neural networks, expert systems, and fuzzy logic systems, in the context of approximate reasoning, share common features and techniques. A model of Fuzzy Connectionist Expert System is introduced, in which an artificial neural network is designed to construct the knowledge base of an expert system from, training examples (this model can also be used for specifications of rules in fuzzy logic control). Two types of weights are associated with the synaptic connections in an AND-OR structure: primary linguistic weights, interpreted as labels of fuzzy sets, and secondary numerical weights. Cell activation is computed through min-max fuzzy equations of the weights. Learning consists in finding the (numerical) weights and the network topology. This feedforward network is described and first illustrated in a biomedical application (medical diagnosis assistance from inflammatory-syndromes/proteins profiles). Then, it is shown how this methodology can be utilized for handwritten pattern recognition (characters play the role of diagnoses): in a fuzzy neuron describing a number for example, the linguistic weights represent fuzzy sets on cross-detecting lines and the numerical weights reflect the importance (or weakness) of connections between cross-detecting lines and characters.

Correcting wave predictions with artificial neural networks

NASA Astrophysics Data System (ADS)

Makarynskyy, O.; Makarynska, D.

2003-04-01

The predictions of wind waves with different lead times are necessary in a large scope of coastal and open ocean activities. Numerical wave models, which usually provide this information, are based on deterministic equations that do not entirely account for the complexity and uncertainty of the wave generation and dissipation processes. An attempt to improve wave parameters short-term forecasts based on artificial neural networks is reported. In recent years, artificial neural networks have been used in a number of coastal engineering applications due to their ability to approximate the nonlinear mathematical behavior without a priori knowledge of interrelations among the elements within a system. The common multilayer feed-forward networks, with a nonlinear transfer functions in the hidden layers, were developed and employed to forecast the wave characteristics over one hour intervals starting from one up to 24 hours, and to correct these predictions. Three non-overlapping data sets of wave characteristics, both from a buoy, moored roughly 60 miles west of the Aran Islands, west coast of Ireland, were used to train and validate the neural nets involved. The networks were trained with error back propagation algorithm. Time series plots and scatterplots of the wave characteristics as well as tables with statistics show an improvement of the results achieved due to the correction procedure employed.

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.

Coding and decoding with adapting neurons: a population approach to the peri-stimulus time histogram.

PubMed

Naud, Richard; Gerstner, Wulfram

2012-01-01

The response of a neuron to a time-dependent stimulus, as measured in a Peri-Stimulus-Time-Histogram (PSTH), exhibits an intricate temporal structure that reflects potential temporal coding principles. Here we analyze the encoding and decoding of PSTHs for spiking neurons with arbitrary refractoriness and adaptation. As a modeling framework, we use the spike response model, also known as the generalized linear neuron model. Because of refractoriness, the effect of the most recent spike on the spiking probability a few milliseconds later is very strong. The influence of the last spike needs therefore to be described with high precision, while the rest of the neuronal spiking history merely introduces an average self-inhibition or adaptation that depends on the expected number of past spikes but not on the exact spike timings. Based on these insights, we derive a 'quasi-renewal equation' which is shown to yield an excellent description of the firing rate of adapting neurons. We explore the domain of validity of the quasi-renewal equation and compare it with other rate equations for populations of spiking neurons. The problem of decoding the stimulus from the population response (or PSTH) is addressed analogously. We find that for small levels of activity and weak adaptation, a simple accumulator of the past activity is sufficient to decode the original input, but when refractory effects become large decoding becomes a non-linear function of the past activity. The results presented here can be applied to the mean-field analysis of coupled neuron networks, but also to arbitrary point processes with negative self-interaction.

Mesoscopic model for filament orientation in growing actin networks: the role of obstacle geometry

NASA Astrophysics Data System (ADS)

Weichsel, Julian; Schwarz, Ulrich S.

2013-03-01

Propulsion by growing actin networks is a universal mechanism used in many different biological systems, ranging from the sheet-like lamellipodium of crawling animal cells to the actin comet tails induced by certain bacteria and viruses in order to move within their host cells. Although the core molecular machinery for actin network growth is well preserved in all of these cases, the geometry of the propelled obstacle varies considerably. During recent years, filament orientation distribution has emerged as an important observable characterizing the structure and dynamical state of the growing network. Here we derive several continuum equations for the orientation distribution of filaments growing behind stiff obstacles of various shapes and validate the predicted steady state orientation patterns by stochastic computer simulations based on discrete filaments. We use an ordinary differential equation approach to demonstrate that for flat obstacles of finite size, two fundamentally different orientation patterns peaked at either ±35° or +70°/0°/ - 70° exhibit mutually exclusive stability, in agreement with earlier results for flat obstacles of very large lateral extension. We calculate and validate phase diagrams as a function of model parameters and show how this approach can be extended to obstacles with piecewise straight contours. For curved obstacles, we arrive at a partial differential equation in the continuum limit, which again is in good agreement with the computer simulations. In all cases, we can identify the same two fundamentally different orientation patterns, but only within an appropriate reference frame, which is adjusted to the local orientation of the obstacle contour. Our results suggest that two fundamentally different network architectures compete with each other in growing actin networks, irrespective of obstacle geometry, and clarify how simulated and electron tomography data have to be analyzed for non-flat obstacle geometries.

A meta-cognitive learning algorithm for a Fully Complex-valued Relaxation Network.

PubMed

Savitha, R; Suresh, S; Sundararajan, N

2012-08-01

This paper presents a meta-cognitive learning algorithm for a single hidden layer complex-valued neural network called "Meta-cognitive Fully Complex-valued Relaxation Network (McFCRN)". McFCRN has two components: a cognitive component and a meta-cognitive component. A Fully Complex-valued Relaxation Network (FCRN) with a fully complex-valued Gaussian like activation function (sech) in the hidden layer and an exponential activation function in the output layer forms the cognitive component. The meta-cognitive component contains a self-regulatory learning mechanism which controls the learning ability of FCRN by deciding what-to-learn, when-to-learn and how-to-learn from a sequence of training data. The input parameters of cognitive components are chosen randomly and the output parameters are estimated by minimizing a logarithmic error function. The problem of explicit minimization of magnitude and phase errors in the logarithmic error function is converted to system of linear equations and output parameters of FCRN are computed analytically. McFCRN starts with zero hidden neuron and builds the number of neurons required to approximate the target function. The meta-cognitive component selects the best learning strategy for FCRN to acquire the knowledge from training data and also adapts the learning strategies to implement best human learning components. Performance studies on a function approximation and real-valued classification problems show that proposed McFCRN performs better than the existing results reported in the literature. Copyright © 2012 Elsevier Ltd. All rights reserved.

Title: Chimeras in small, globally coupled networks: Experiments and stability analysis

NASA Astrophysics Data System (ADS)

Hart, Joseph D.; Bansal, Kanika; Murphy, Thomas E.; Roy, Rajarshi

Since the initial observation of chimera states, there has been much discussion of the conditions under which these states emerge. The emphasis thus far has mainly been to analyze large networks of coupled oscillators; however, recent studies have begun to focus on the opposite limit: what is the smallest system of coupled oscillators in which chimeras can exist? We experimentally observe chimeras and other partially synchronous patterns in a network of four globally-coupled chaotic opto-electronic oscillators. By examining the equations of motion, we demonstrate that symmetries in the network topology allow a variety of synchronous states to exist, including cluster synchronous states and a chimera state. Using the group theoretical approach recently developed for analyzing cluster synchronization, we show how to derive the variational equations for these synchronous patterns and calculate their linear stability. The stability analysis gives good agreement with our experimental results. Both experiments and simulations suggest that these chimera states often appear in regions of multistability between global, cluster, and desynchronized states.

Synchronization of an Inertial Neural Network With Time-Varying Delays and Its Application to Secure Communication.

PubMed

Lakshmanan, Shanmugam; Prakash, Mani; Lim, Chee Peng; Rakkiyappan, Rajan; Balasubramaniam, Pagavathigounder; Nahavandi, Saeid

2018-01-01

In this paper, synchronization of an inertial neural network with time-varying delays is investigated. Based on the variable transformation method, we transform the second-order differential equations into the first-order differential equations. Then, using suitable Lyapunov-Krasovskii functionals and Jensen's inequality, the synchronization criteria are established in terms of linear matrix inequalities. Moreover, a feedback controller is designed to attain synchronization between the master and slave models, and to ensure that the error model is globally asymptotically stable. Numerical examples and simulations are presented to indicate the effectiveness of the proposed method. Besides that, an image encryption algorithm is proposed based on the piecewise linear chaotic map and the chaotic inertial neural network. The chaotic signals obtained from the inertial neural network are utilized for the encryption process. Statistical analyses are provided to evaluate the effectiveness of the proposed encryption algorithm. The results ascertain that the proposed encryption algorithm is efficient and reliable for secure communication applications.

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

Random catalytic reaction networks

NASA Astrophysics Data System (ADS)

Stadler, Peter F.; Fontana, Walter; Miller, John H.

1993-03-01

We study networks that are a generalization of replicator (or Lotka-Volterra) equations. They model the dynamics of a population of object types whose binary interactions determine the specific type of interaction product. Such a system always reduces its dimension to a subset that contains production pathways for all of its members. The network equation can be rewritten at a level of collectives in terms of two basic interaction patterns: replicator sets and cyclic transformation pathways among sets. Although the system contains well-known cases that exhibit very complicated dynamics, the generic behavior of randomly generated systems is found (numerically) to be extremely robust: convergence to a globally stable rest point. It is easy to tailor networks that display replicator interactions where the replicators are entire self-sustaining subsystems, rather than structureless units. A numerical scan of random systems highlights the special properties of elementary replicators: they reduce the effective interconnectedness of the system, resulting in enhanced competition, and strong correlations between the concentrations.

Dynamic stiffness of chemically and physically ageing rubber vibration isolators in the audible frequency range. Part 1: constitutive equations

NASA Astrophysics Data System (ADS)

Kari, Leif

2017-09-01

The constitutive equations of chemically and physically ageing rubber in the audible frequency range are modelled as a function of ageing temperature, ageing time, actual temperature, time and frequency. The constitutive equations are derived by assuming nearly incompressible material with elastic spherical response and viscoelastic deviatoric response, using Mittag-Leffler relaxation function of fractional derivative type, the main advantage being the minimum material parameters needed to successfully fit experimental data over a broad frequency range. The material is furthermore assumed essentially entropic and thermo-mechanically simple while using a modified William-Landel-Ferry shift function to take into account temperature dependence and physical ageing, with fractional free volume evolution modelled by a nonlinear, fractional differential equation with relaxation time identical to that of the stress response and related to the fractional free volume by Doolittle equation. Physical ageing is a reversible ageing process, including trapping and freeing of polymer chain ends, polymer chain reorganizations and free volume changes. In contrast, chemical ageing is an irreversible process, mainly attributed to oxygen reaction with polymer network either damaging the network by scission or reformation of new polymer links. The chemical ageing is modelled by inner variables that are determined by inner fractional evolution equations. Finally, the model parameters are fitted to measurements results of natural rubber over a broad audible frequency range, and various parameter studies are performed including comparison with results obtained by ordinary, non-fractional ageing evolution differential equations.

Estimation of land photosynthetically active radiation in clear sky using MODIS atmosphere and land products

NASA Astrophysics Data System (ADS)

Xie, Xiaoping; Gao, Wei; Gao, Zhiqiang

2008-08-01

Photosynthetically active radiation (PAR) is an essential parameter in vegetation growth model and soil carbon sequestration models. A method is presented with which instantaneous PAR can be calculated with high accuracy from Moderate Resolution Imaging Spectroradiometer (MODIS) atmosphere and land products. The method is based on a simplification of the general radiative transfer equation, which considers five major processes of attenuation of solar radiation: Rayleigh scattering, absorption by ozone and water vapor, aerosol scattering, multiply reflectance between surface and atmosphere. Comparing 108 retrieveled results to filed measured PAR in Yucheng station of Chinese Ecosystem Research Network (CERN) in 2006, and the r-square of 0.855 indicates that the computed results can interpret actual PAR well.

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.

Competition for popularity in bipartite networks.

PubMed

Díaz, Mariano Beguerisse; Porter, Mason A; Onnela, Jukka-Pekka

2010-12-01

We present a dynamical model for rewiring and attachment in bipartite networks. Edges are placed between nodes that belong to catalogs that can either be fixed in size or growing in size. The model is motivated by an empirical study of data from the video rental service Netflix, which invites its users to give ratings to the videos available in its catalog. We find that the distribution of the number of ratings given by users and that of the number of ratings received by videos both follow a power law with an exponential cutoff. We also examine the activity patterns of Netflix users and find bursts of intense video-rating activity followed by long periods of inactivity. We derive ordinary differential equations to model the acquisition of edges by the nodes over time and obtain the corresponding time-dependent degree distributions. We then compare our results with the Netflix data and find good agreement. We conclude with a discussion of how catalog models can be used to study systems in which agents are forced to choose, rate, or prioritize their interactions from a large set of options. © 2010 American Institute of Physics.

Competition for popularity in bipartite networks

NASA Astrophysics Data System (ADS)

Beguerisse Díaz, Mariano; Porter, Mason A.; Onnela, Jukka-Pekka

2010-12-01

We present a dynamical model for rewiring and attachment in bipartite networks. Edges are placed between nodes that belong to catalogs that can either be fixed in size or growing in size. The model is motivated by an empirical study of data from the video rental service Netflix, which invites its users to give ratings to the videos available in its catalog. We find that the distribution of the number of ratings given by users and that of the number of ratings received by videos both follow a power law with an exponential cutoff. We also examine the activity patterns of Netflix users and find bursts of intense video-rating activity followed by long periods of inactivity. We derive ordinary differential equations to model the acquisition of edges by the nodes over time and obtain the corresponding time-dependent degree distributions. We then compare our results with the Netflix data and find good agreement. We conclude with a discussion of how catalog models can be used to study systems in which agents are forced to choose, rate, or prioritize their interactions from a large set of options.

Differential equations as a tool for community identification.

PubMed

Krawczyk, Małgorzata J

2008-06-01

We consider the task of identification of a cluster structure in random networks. The results of two methods are presented: (i) the Newman algorithm [M. E. J. Newman and M. Girvan, Phys. Rev. E 69, 026113 (2004)]; and (ii) our method based on differential equations. A series of computer experiments is performed to check if in applying these methods we are able to determine the structure of the network. The trial networks consist initially of well-defined clusters and are disturbed by introducing noise into their connectivity matrices. Further, we show that an improvement of the previous version of our method is possible by an appropriate choice of the threshold parameter beta . With this change, the results obtained by the two methods above are similar, and our method works better, for all the computer experiments we have done.

Competing edge networks

NASA Astrophysics Data System (ADS)

Parsons, Mark; Grindrod, Peter

2012-06-01

We introduce a model for a pair of nonlinear evolving networks, defined over a common set of vertices, subject to edgewise competition. Each network may grow new edges spontaneously or through triad closure. Both networks inhibit the other's growth and encourage the other's demise. These nonlinear stochastic competition equations yield to a mean field analysis resulting in a nonlinear deterministic system. There may be multiple equilibria; and bifurcations of different types are shown to occur within a reduced parameter space. This situation models competitive communication networks such as BlackBerry Messenger displacing SMS; or instant messaging displacing emails.

A neural-network approach to robotic control

NASA Technical Reports Server (NTRS)

Graham, D. P. W.; Deleuterio, G. M. T.

1993-01-01

An artificial neural-network paradigm for the control of robotic systems is presented. The approach is based on the Cerebellar Model Articulation Controller created by James Albus and incorporates several extensions. First, recognizing the essential structure of multibody equations of motion, two parallel modules are used that directly reflect the dynamical characteristics of multibody systems. Second, the architecture of the proposed network is imbued with a self-organizational capability which improves efficiency and accuracy. Also, the networks can be arranged in hierarchical fashion with each subsequent network providing finer and finer resolution.

Biobank governance: heterogeneous modes of ordering and democratization.

PubMed

Gottweis, Herbert; Lauss, Georg

2012-04-01

The great interest in biobanks, the related, substantial investments, and the expectations connected with them raises the question of how to explain the relative successes and failures of contemporary biobank projects. In this article we will present and discuss areas that need ongoing attention by many stakeholders in order stabilize and utilize biobanks and biobank networks in the future. Our aim is to present and utilize an analytical model for comparing structures of biobank governance. The governance model we deduce from empirical case studies is not a well-ordered, almost bureaucratic type of government. The patchwork character and the interrelatedness of heterogeneous activities that constitute biobank governance in its multiple dimensions will be highlighted. Biobank governance should therefore be understood as strategy for patterning a network of interaction that unfolds within and across a number of different fields including a variety of activities that go beyond regulatory activities: the scientific/technological field, the medical/health field, the industrial-economic field, the legal-ethical, and the sociopolitical field. Our account emphasizes that biobanks are not technical visions that operate vis-à-vis an external society. The article discusses attempts to develop participatory governance structures. It concludes that facilitating and managing the integration of a network of more or less interrelated actors, in many nonhierarchic ways, should not be equated with democratization per se, but can nevertheless be regarded as an important step towards a more pluralistic and inclusive style of policy making.

An effective rate equation approach to reaction kinetics in small volumes: theory and application to biochemical reactions in nonequilibrium steady-state conditions.

PubMed

Grima, R

2010-07-21

Chemical master equations provide a mathematical description of stochastic reaction kinetics in well-mixed conditions. They are a valid description over length scales that are larger than the reactive mean free path and thus describe kinetics in compartments of mesoscopic and macroscopic dimensions. The trajectories of the stochastic chemical processes described by the master equation can be ensemble-averaged to obtain the average number density of chemical species, i.e., the true concentration, at any spatial scale of interest. For macroscopic volumes, the true concentration is very well approximated by the solution of the corresponding deterministic and macroscopic rate equations, i.e., the macroscopic concentration. However, this equivalence breaks down for mesoscopic volumes. These deviations are particularly significant for open systems and cannot be calculated via the Fokker-Planck or linear-noise approximations of the master equation. We utilize the system-size expansion including terms of the order of Omega(-1/2) to derive a set of differential equations whose solution approximates the true concentration as given by the master equation. These equations are valid in any open or closed chemical reaction network and at both the mesoscopic and macroscopic scales. In the limit of large volumes, the effective mesoscopic rate equations become precisely equal to the conventional macroscopic rate equations. We compare the three formalisms of effective mesoscopic rate equations, conventional rate equations, and chemical master equations by applying them to several biochemical reaction systems (homodimeric and heterodimeric protein-protein interactions, series of sequential enzyme reactions, and positive feedback loops) in nonequilibrium steady-state conditions. In all cases, we find that the effective mesoscopic rate equations can predict very well the true concentration of a chemical species. This provides a useful method by which one can quickly determine the regions of parameter space in which there are maximum differences between the solutions of the master equation and the corresponding rate equations. We show that these differences depend sensitively on the Fano factors and on the inherent structure and topology of the chemical network. The theory of effective mesoscopic rate equations generalizes the conventional rate equations of physical chemistry to describe kinetics in systems of mesoscopic size such as biological cells.

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

Analysis of residual chlorine in simple drinking water distribution system with intermittent water supply

NASA Astrophysics Data System (ADS)

Goyal, Roopali V.; Patel, H. M.

2015-09-01

Knowledge of residual chlorine concentration at various locations in drinking water distribution system is essential final check to the quality of water supplied to the consumers. This paper presents a methodology to find out the residual chlorine concentration at various locations in simple branch network by integrating the hydraulic and water quality model using first-order chlorine decay equation with booster chlorination nodes for intermittent water supply. The explicit equations are developed to compute the residual chlorine in network with a long distribution pipe line at critical nodes. These equations are applicable to Indian conditions where intermittent water supply is the most common system of water supply. It is observed that in intermittent water supply, the residual chlorine at farthest node is sensitive to water supply hours and travelling time of chlorine. Thus, the travelling time of chlorine can be considered to justify the requirement of booster chlorination for intermittent water supply.

Simulation of the Flow Through Porous Layers Composed of Converging-Diverging Capillary Fissures or Tubes

NASA Astrophysics Data System (ADS)

Walicka, A.

2018-02-01

In this paper, a porous medium is modelled by a network of converging-diverging capillaries which may be considered as fissures or tubes. This model makes it necessary to consider flows through capillary fissures or tubes. Therefore an analytical method for deriving the relationships between pressure drops, volumetric flow rates and velocities for the following fluids: Newtonian, polar, power-law, pseudoplastic (DeHaven and Sisko types) and Shulmanian, was developed. Next, considerations on the models of pore network for Newtonian and non-Newtonian fluids were presented. The models, similar to the schemes of central finite differences may provide a good basis for transforming the governing equations of a flow through the porous medium into a set of linear or quasi-linear algebraic equations. It was shown that the some coefficients in these algebraic equations depend on the kind of the capillary convergence.

Designing Composite Resins in the 21st Century: Ending the End Group Fallacy

DTIC Science & Technology

2015-09-30

unlimited. Network Automata • In correspondence with cellular automata , a system of differential equations describes the evolution of structures...LLNL). 11Distribution A: Approved for public release; distribution is unlimited. “State of the Art” Network Automata Example • Cure kinetics

Application of a soft computing technique in predicting the percentage of shear force carried by walls in a rectangular channel with non-homogeneous roughness.

PubMed

Khozani, Zohreh Sheikh; Bonakdari, Hossein; Zaji, Amir Hossein

2016-01-01

Two new soft computing models, namely genetic programming (GP) and genetic artificial algorithm (GAA) neural network (a combination of modified genetic algorithm and artificial neural network methods) were developed in order to predict the percentage of shear force in a rectangular channel with non-homogeneous roughness. The ability of these methods to estimate the percentage of shear force was investigated. Moreover, the independent parameters' effectiveness in predicting the percentage of shear force was determined using sensitivity analysis. According to the results, the GP model demonstrated superior performance to the GAA model. A comparison was also made between the GP program determined as the best model and five equations obtained in prior research. The GP model with the lowest error values (root mean square error ((RMSE) of 0.0515) had the best function compared with the other equations presented for rough and smooth channels as well as smooth ducts. The equation proposed for rectangular channels with rough boundaries (RMSE of 0.0642) outperformed the prior equations for smooth boundaries.

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.

Organization of the cytokeratin network in an epithelial cell.

PubMed

Portet, Stéphanie; Arino, Ovide; Vassy, Jany; Schoëvaërt, Damien

2003-08-07

The cytoskeleton is a dynamic three-dimensional structure mainly located in the cytoplasm. It is involved in many cell functions such as mechanical signal transduction and maintenance of cell integrity. Among the three cytoskeletal components, intermediate filaments (the cytokeratin in epithelial cells) are the best candidates for this mechanical role. A model of the establishment of the cytokeratin network of an epithelial cell is proposed to study the dependence of its structural organization on extracellular mechanical environment. To implicitly describe the latter and its effects on the intracellular domain, we use mechanically regulated protein synthesis. Our model is a hybrid of a partial differential equation of parabolic type, governing the evolution of the concentration of cytokeratin, and a set of stochastic differential equations describing the dynamics of filaments. Each filament is described by a stochastic differential equation that reflects both the local interactions with the environment and the non-local interactions via the past history of the filament. A three-dimensional simulation model is derived from this mathematical model. This simulation model is then used to obtain examples of cytokeratin network architectures under given mechanical conditions, and to study the influence of several parameters.

Site characterization methodology for aquifers in support of bioreclamation activities. Volume 2: Borehole flowmeter technique, tracer tests, geostatistics and geology. Final report, August 1987-September 1989

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

Young, S.C.

1993-08-01

This report discusses a field demonstration of a methodology for characterizing an aquifer's geohydrology in the detail required to design an optimum network of wells and/or infiltration galleries for bioreclamation systems. The project work was conducted on a 1-hectare test site at Columbus AFB, Mississippi. The technical report is divided into two volumes. Volume I describes the test site and the well network, the assumptions, and the application of equations that define groundwater flow to a well, the results of three large-scale aquifer tests, and the results of 160 single-pump tests. Volume II describes the bore hole flowmeter tests, themore » tracer tests, the geological investigations, the geostatistical analysis and the guidelines for using groundwater models to design bioreclamation systems. Site characterization, Hydraulic conductivity, Groundwater flow, Geostatistics, Geohydrology, Monitoring wells.« less

Dynamics of Competition between Subnetworks of Spiking Neuronal Networks in the Balanced State.

PubMed

Lagzi, Fereshteh; Rotter, Stefan

2015-01-01

We explore and analyze the nonlinear switching dynamics of neuronal networks with non-homogeneous connectivity. The general significance of such transient dynamics for brain function is unclear; however, for instance decision-making processes in perception and cognition have been implicated with it. The network under study here is comprised of three subnetworks of either excitatory or inhibitory leaky integrate-and-fire neurons, of which two are of the same type. The synaptic weights are arranged to establish and maintain a balance between excitation and inhibition in case of a constant external drive. Each subnetwork is randomly connected, where all neurons belonging to a particular population have the same in-degree and the same out-degree. Neurons in different subnetworks are also randomly connected with the same probability; however, depending on the type of the pre-synaptic neuron, the synaptic weight is scaled by a factor. We observed that for a certain range of the "within" versus "between" connection weights (bifurcation parameter), the network activation spontaneously switches between the two sub-networks of the same type. This kind of dynamics has been termed "winnerless competition", which also has a random component here. In our model, this phenomenon is well described by a set of coupled stochastic differential equations of Lotka-Volterra type that imply a competition between the subnetworks. The associated mean-field model shows the same dynamical behavior as observed in simulations of large networks comprising thousands of spiking neurons. The deterministic phase portrait is characterized by two attractors and a saddle node, its stochastic component is essentially given by the multiplicative inherent noise of the system. We find that the dwell time distribution of the active states is exponential, indicating that the noise drives the system randomly from one attractor to the other. A similar model for a larger number of populations might suggest a general approach to study the dynamics of interacting populations of spiking networks.

Dynamics of Competition between Subnetworks of Spiking Neuronal Networks in the Balanced State

PubMed Central

Lagzi, Fereshteh; Rotter, Stefan

2015-01-01

We explore and analyze the nonlinear switching dynamics of neuronal networks with non-homogeneous connectivity. The general significance of such transient dynamics for brain function is unclear; however, for instance decision-making processes in perception and cognition have been implicated with it. The network under study here is comprised of three subnetworks of either excitatory or inhibitory leaky integrate-and-fire neurons, of which two are of the same type. The synaptic weights are arranged to establish and maintain a balance between excitation and inhibition in case of a constant external drive. Each subnetwork is randomly connected, where all neurons belonging to a particular population have the same in-degree and the same out-degree. Neurons in different subnetworks are also randomly connected with the same probability; however, depending on the type of the pre-synaptic neuron, the synaptic weight is scaled by a factor. We observed that for a certain range of the “within” versus “between” connection weights (bifurcation parameter), the network activation spontaneously switches between the two sub-networks of the same type. This kind of dynamics has been termed “winnerless competition”, which also has a random component here. In our model, this phenomenon is well described by a set of coupled stochastic differential equations of Lotka-Volterra type that imply a competition between the subnetworks. The associated mean-field model shows the same dynamical behavior as observed in simulations of large networks comprising thousands of spiking neurons. The deterministic phase portrait is characterized by two attractors and a saddle node, its stochastic component is essentially given by the multiplicative inherent noise of the system. We find that the dwell time distribution of the active states is exponential, indicating that the noise drives the system randomly from one attractor to the other. A similar model for a larger number of populations might suggest a general approach to study the dynamics of interacting populations of spiking networks. PMID:26407178

Out-of-equilibrium dynamical mean-field equations for the perceptron model

NASA Astrophysics Data System (ADS)

Agoritsas, Elisabeth; Biroli, Giulio; Urbani, Pierfrancesco; Zamponi, Francesco

2018-02-01

Perceptrons are the building blocks of many theoretical approaches to a wide range of complex systems, ranging from neural networks and deep learning machines, to constraint satisfaction problems, glasses and ecosystems. Despite their applicability and importance, a detailed study of their Langevin dynamics has never been performed yet. Here we derive the mean-field dynamical equations that describe the continuous random perceptron in the thermodynamic limit, in a very general setting with arbitrary noise and friction kernels, not necessarily related by equilibrium relations. We derive the equations in two ways: via a dynamical cavity method, and via a path-integral approach in its supersymmetric formulation. The end point of both approaches is the reduction of the dynamics of the system to an effective stochastic process for a representative dynamical variable. Because the perceptron is formally very close to a system of interacting particles in a high dimensional space, the methods we develop here can be transferred to the study of liquid and glasses in high dimensions. Potentially interesting applications are thus the study of the glass transition in active matter, the study of the dynamics around the jamming transition, and the calculation of rheological properties in driven systems.

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

USGS Publications Warehouse

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

1999-01-01

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

Applications of the ETEM for obtaining optical soliton solutions for the Lakshmanan-Porsezian-Daniel model

NASA Astrophysics Data System (ADS)

Manafian, Jalil; Foroutan, Mohammadreza; Guzali, Aref

2017-11-01

This paper examines the effectiveness of an integration scheme which is called the extended trial equation method (ETEM) for solving a well-known nonlinear equation of partial differential equations (PDEs). In this respect, the Lakshmanan-Porsezian-Daniel (LPD) equation with Kerr and power laws of nonlinearity which describes higher-order dispersion, full nonlinearity and spatiotemporal dispersion is considered, and as an achievement, a series of exact travelling-wave solutions for the aforementioned equation is formally extracted. Explicit new exact solutions are derived in different form such as dark solitons, bright solitons, solitary wave, periodic solitary wave, rational function, and elliptic function solutions of LPD equation. The movement of obtained solutions is shown graphically, which helps to understand the physical phenomena of this optical soliton equation. Many other such types of nonlinear equations arising in basic fabric of communications network technology and nonlinear optics can also be solved by this method.

Impact of the intermixed phase and the channel network on the carrier mobility of nanostructured solar cells

NASA Astrophysics Data System (ADS)

Woellner, Cristiano F.; Freire, José A.

2016-02-01

We analyzed the impact of the complex channel network of donor and acceptor domains in nanostructured solar cells on the mobility of the charge carriers moving by thermally activated hopping. Particular attention was given to the so called intermixed phase, or interface roughness, that has recently been shown to promote an increase in the cell efficiency. The domains were obtained from a Monte Carlo simulation of a two-species lattice gas. We generated domain morphologies with controllable channel size and interface roughness. The field and density dependence of the carrier hopping mobility in different morphologies was obtained by solving a master equation. Our results show that the mobility decreases with roughness and increases with typical channel sizes. The deleterious effect of the roughness on the mobility is quite dramatic at low carrier densities and high fields. The complex channel network is shown to be directly responsible for two potentially harmful effects to the cell performance: a remarkable decrease of the mobility with increasing field and the accumulation of charge at the domains interface, which leads to recombination losses.

Reporting guidelines for oncology research: helping to maximise the impact of your research

PubMed Central

MacCarthy, Angela; Kirtley, Shona; de Beyer, Jennifer A; Altman, Douglas G; Simera, Iveta

2018-01-01

Many reports of health research omit important information needed to assess their methodological robustness and clinical relevance. Without clear and complete reporting, it is not possible to identify flaws or biases, reproduce successful interventions, or use the findings in systematic reviews or meta-analyses. The EQUATOR Network (http://www.equator-network.org/) promotes responsible reporting and the use of reporting guidelines to improve the accuracy, completeness, and transparency of health research. EQUATOR supports researchers by providing online resources and training. EQUATOR Oncology, a project funded by Cancer Research UK, aims to support cancer researchers reporting their research through the provision of online resources. In this article, our objective is to highlight reporting issues related to oncology research publications and to introduce reporting guidelines that are designed to aid high-quality reporting. We describe generic reporting guidelines for the main study types, and explain how these guidelines should and should not be used. We also describe 37 oncology-specific reporting guidelines, covering different clinical areas (e.g., haematology or urology) and sections of the report (e.g., methods or study characteristics); most of these are little-used. We also provide some background information on EQUATOR Oncology, which focuses on addressing the reporting needs of the oncology research community. PMID:29471308

Phase Radio Engineering Systems (Selected Pages),

DTIC Science & Technology

1983-04-28

that if on the linear network functions the delta-function, which has the uniform spectrum, then the spectrum of response repeats frequency DOC...integrator can be used, for example, chain/ network RC with the slow response. Page 222. As the being congruent/equating cascade/stage can be used, for example...the elements of the networks which are ensured with the great technical difficulties or not at all can be achieved/reached. !.( .... . 2

Modeling level of urban taxi services using neural network

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

Xu, J.; Wong, S.C.; Tong, C.O.

1999-05-01

This paper is concerned with the modeling of the complex demand-supply relationship in urban taxi services. A neural network model is developed, based on a taxi service situation observed in the urban area of Hong Kong. The input consists of several exogenous variables including number of licensed taxis, incremental charge of taxi fare, average occupied taxi journey time, average disposable income, and population and customer price index; the output consists of a set of endogenous variables including daily taxi passenger demand, passenger waiting time, vacant taxi headway, average percentage of occupied taxis, taxi utilization, and average taxi waiting time. Comparisonsmore » of the estimation accuracy are made between the neural network model and the simultaneous equations model. The results show that the neural network-based macro taxi model can obtain much more accurate information of the taxi services than the simultaneous equations model does. Although the data set used for training the neural network is small, the results obtained thus far are very encouraging. The neural network model can be used as a policy tool by regulator to assist with the decisions concerning the restriction over the number of taxi licenses and the fixing of the taxi fare structure as well as a range of service quality control.« less

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.

The Lyapunov-Krasovskii theorem and a sufficient criterion for local stability of isochronal synchronization in networks of delay-coupled oscillators

NASA Astrophysics Data System (ADS)

Grzybowski, J. M. V.; Macau, E. E. N.; Yoneyama, T.

2017-05-01

This paper presents a self-contained framework for the stability assessment of isochronal synchronization in networks of chaotic and limit-cycle oscillators. The results were based on the Lyapunov-Krasovskii theorem and they establish a sufficient condition for local synchronization stability of as a function of the system and network parameters. With this in mind, a network of mutually delay-coupled oscillators subject to direct self-coupling is considered and then the resulting error equations are block-diagonalized for the purpose of studying their stability. These error equations are evaluated by means of analytical stability results derived from the Lyapunov-Krasovskii theorem. The proposed approach is shown to be a feasible option for the investigation of local stability of isochronal synchronization for a variety of oscillators coupled through linear functions of the state variables under a given undirected graph structure. This ultimately permits the systematic identification of stability regions within the high-dimensionality of the network parameter space. Examples of applications of the results to a number of networks of delay-coupled chaotic and limit-cycle oscillators are provided, such as Lorenz, Rössler, Cubic Chua's circuit, Van der Pol oscillator and the Hindmarsh-Rose neuron.

Correction to verdonck and tuerlinckx (2014).

PubMed

2015-01-01

Reports an error in "The Ising Decision Maker: A binary stochastic network for choice response time" by Stijn Verdonck and Francis Tuerlinckx (Psychological Review, 2014[Jul], Vol 121[3], 422-462). An inaccurate assumption in Appendix B (provided in the erratum) led to an oversimplified result in Equation 18 (the diffusion equations associated with the microscopically defined dynamics). The authors sincerely thank Rani Moran for making them aware of the problem. Only the expression of the diffusion coefficient D is incorrect, and should be changed, as indicated in the erratum. Both the cause of the problem and the solution are also explained in the erratum. (The following abstract of the original article appeared in record 2014-31650-006.) The Ising Decision Maker (IDM) is a new formal model for speeded two-choice decision making derived from the stochastic Hopfield network or dynamic Ising model. On a microscopic level, it consists of 2 pools of binary stochastic neurons with pairwise interactions. Inside each pool, neurons excite each other, whereas between pools, neurons inhibit each other. The perceptual input is represented by an external excitatory field. Using methods from statistical mechanics, the high-dimensional network of neurons (microscopic level) is reduced to a two-dimensional stochastic process, describing the evolution of the mean neural activity per pool (macroscopic level). The IDM can be seen as an abstract, analytically tractable multiple attractor network model of information accumulation. In this article, the properties of the IDM are studied, the relations to existing models are discussed, and it is shown that the most important basic aspects of two-choice response time data can be reproduced. In addition, the IDM is shown to predict a variety of observed psychophysical relations such as Piéron's law, the van der Molen-Keuss effect, and Weber's law. Using Bayesian methods, the model is fitted to both simulated and real data, and its performance is compared to the Ratcliff diffusion model. (PsycINFO Database Record (c) 2015 APA, all rights reserved).

Moran-evolution of cooperation: From well-mixed to heterogeneous complex networks

NASA Astrophysics Data System (ADS)

Sarkar, Bijan

2018-05-01

Configurational arrangement of network architecture and interaction character of individuals are two most influential factors on the mechanisms underlying the evolutionary outcome of cooperation, which is explained by the well-established framework of evolutionary game theory. In the current study, not only qualitatively but also quantitatively, we measure Moran-evolution of cooperation to support an analytical agreement based on the consequences of the replicator equation in a finite population. The validity of the measurement has been double-checked in the well-mixed network by the Langevin stochastic differential equation and the Gillespie-algorithmic version of Moran-evolution, while in a structured network, the measurement of accuracy is verified by the standard numerical simulation. Considering the Birth-Death and Death-Birth updating rules through diffusion of individuals, the investigation is carried out in the wide range of game environments those relate to the various social dilemmas where we are able to draw a new rigorous mathematical track to tackle the heterogeneity of complex networks. The set of modified criteria reveals the exact fact about the emergence and maintenance of cooperation in the structured population. We find that in general, nature promotes the environment of coexistent traits.

A spread willingness computing-based information dissemination model.

PubMed

Huang, Haojing; Cui, Zhiming; Zhang, Shukui

2014-01-01

This paper constructs a kind of spread willingness computing based on information dissemination model for social network. The model takes into account the impact of node degree and dissemination mechanism, combined with the complex network theory and dynamics of infectious diseases, and further establishes the dynamical evolution equations. Equations characterize the evolutionary relationship between different types of nodes with time. The spread willingness computing contains three factors which have impact on user's spread behavior: strength of the relationship between the nodes, views identity, and frequency of contact. Simulation results show that different degrees of nodes show the same trend in the network, and even if the degree of node is very small, there is likelihood of a large area of information dissemination. The weaker the relationship between nodes, the higher probability of views selection and the higher the frequency of contact with information so that information spreads rapidly and leads to a wide range of dissemination. As the dissemination probability and immune probability change, the speed of information dissemination is also changing accordingly. The studies meet social networking features and can help to master the behavior of users and understand and analyze characteristics of information dissemination in social network.

A Spread Willingness Computing-Based Information Dissemination Model

PubMed Central

Cui, Zhiming; Zhang, Shukui

2014-01-01

This paper constructs a kind of spread willingness computing based on information dissemination model for social network. The model takes into account the impact of node degree and dissemination mechanism, combined with the complex network theory and dynamics of infectious diseases, and further establishes the dynamical evolution equations. Equations characterize the evolutionary relationship between different types of nodes with time. The spread willingness computing contains three factors which have impact on user's spread behavior: strength of the relationship between the nodes, views identity, and frequency of contact. Simulation results show that different degrees of nodes show the same trend in the network, and even if the degree of node is very small, there is likelihood of a large area of information dissemination. The weaker the relationship between nodes, the higher probability of views selection and the higher the frequency of contact with information so that information spreads rapidly and leads to a wide range of dissemination. As the dissemination probability and immune probability change, the speed of information dissemination is also changing accordingly. The studies meet social networking features and can help to master the behavior of users and understand and analyze characteristics of information dissemination in social network. PMID:25110738

Efficient Power Network Analysis with Modeling of Inductive Effects

NASA Astrophysics Data System (ADS)

Zeng, Shan; Yu, Wenjian; Hong, Xianlong; Cheng, Chung-Kuan

In this paper, an efficient method is proposed to accurately analyze large-scale power/ground (P/G) networks, where inductive parasitics are modeled with the partial reluctance. The method is based on frequency-domain circuit analysis and the technique of vector fitting [14], and obtains the time-domain voltage response at given P/G nodes. The frequency-domain circuit equation including partial reluctances is derived, and then solved with the GMRES algorithm with rescaling, preconditioning and recycling techniques. With the merit of sparsified reluctance matrix and iterative solving techniques for the frequency-domain circuit equations, the proposed method is able to handle large-scale P/G networks with complete inductive modeling. Numerical results show that the proposed method is orders of magnitude faster than HSPICE, several times faster than INDUCTWISE [4], and capable of handling the inductive P/G structures with more than 100, 000 wire segments.

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

Event-Triggered Adaptive Dynamic Programming for Continuous-Time Systems With Control Constraints.

PubMed

Dong, Lu; Zhong, Xiangnan; Sun, Changyin; He, Haibo

2016-08-31

In this paper, an event-triggered near optimal control structure is developed for nonlinear continuous-time systems with control constraints. Due to the saturating actuators, a nonquadratic cost function is introduced and the Hamilton-Jacobi-Bellman (HJB) equation for constrained nonlinear continuous-time systems is formulated. In order to solve the HJB equation, an actor-critic framework is presented. The critic network is used to approximate the cost function and the action network is used to estimate the optimal control law. In addition, in the proposed method, the control signal is transmitted in an aperiodic manner to reduce the computational and the transmission cost. Both the networks are only updated at the trigger instants decided by the event-triggered condition. Detailed Lyapunov analysis is provided to guarantee that the closed-loop event-triggered system is ultimately bounded. Three case studies are used to demonstrate the effectiveness of the proposed method.

Partial regularity of weak solutions to a PDE system with cubic nonlinearity

NASA Astrophysics Data System (ADS)

Liu, Jian-Guo; Xu, Xiangsheng

2018-04-01

In this paper we investigate regularity properties of weak solutions to a PDE system that arises in the study of biological transport networks. The system consists of a possibly singular elliptic equation for the scalar pressure of the underlying biological network coupled to a diffusion equation for the conductance vector of the network. There are several different types of nonlinearities in the system. Of particular mathematical interest is a term that is a polynomial function of solutions and their partial derivatives and this polynomial function has degree three. That is, the system contains a cubic nonlinearity. Only weak solutions to the system have been shown to exist. The regularity theory for the system remains fundamentally incomplete. In particular, it is not known whether or not weak solutions develop singularities. In this paper we obtain a partial regularity theorem, which gives an estimate for the parabolic Hausdorff dimension of the set of possible singular points.

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

Wealth distribution on complex networks

NASA Astrophysics Data System (ADS)

Ichinomiya, Takashi

2012-12-01

We study the wealth distribution of the Bouchaud-Mézard model on complex networks. It is known from numerical simulations that this distribution depends on the topology of the network; however, no one has succeeded in explaining it. Using “adiabatic” and “independent” assumptions along with the central-limit theorem, we derive equations that determine the probability distribution function. The results are compared to those of simulations for various networks. We find good agreement between our theory and the simulations, except for the case of Watts-Strogatz networks with a low rewiring rate due to the breakdown of independent assumption.

A process of rumour scotching on finite populations.

PubMed

de Arruda, Guilherme Ferraz; Lebensztayn, Elcio; Rodrigues, Francisco A; Rodríguez, Pablo Martín

2015-09-01

Rumour spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumour is propagated by pairwise interactions between spreaders and ignorants. Only spreaders are active and may become stiflers after contacting spreaders or stiflers. Here we propose a competition-like model in which spreaders try to transmit an information, while stiflers are also active and try to scotch it. We study the influence of transmission/scotching rates and initial conditions on the qualitative behaviour of the process. An analytical treatment based on the theory of convergence of density-dependent Markov chains is developed to analyse how the final proportion of ignorants behaves asymptotically in a finite homogeneously mixing population. We perform Monte Carlo simulations in random graphs and scale-free networks and verify that the results obtained for homogeneously mixing populations can be approximated for random graphs, but are not suitable for scale-free networks. Furthermore, regarding the process on a heterogeneous mixing population, we obtain a set of differential equations that describes the time evolution of the probability that an individual is in each state. Our model can also be applied for studying systems in which informed agents try to stop the rumour propagation, or for describing related susceptible-infected-recovered systems. In addition, our results can be considered to develop optimal information dissemination strategies and approaches to control rumour propagation.

A process of rumour scotching on finite populations

PubMed Central

de Arruda, Guilherme Ferraz; Lebensztayn, Elcio; Rodrigues, Francisco A.; Rodríguez, Pablo Martín

2015-01-01

Rumour spreading is a ubiquitous phenomenon in social and technological networks. Traditional models consider that the rumour is propagated by pairwise interactions between spreaders and ignorants. Only spreaders are active and may become stiflers after contacting spreaders or stiflers. Here we propose a competition-like model in which spreaders try to transmit an information, while stiflers are also active and try to scotch it. We study the influence of transmission/scotching rates and initial conditions on the qualitative behaviour of the process. An analytical treatment based on the theory of convergence of density-dependent Markov chains is developed to analyse how the final proportion of ignorants behaves asymptotically in a finite homogeneously mixing population. We perform Monte Carlo simulations in random graphs and scale-free networks and verify that the results obtained for homogeneously mixing populations can be approximated for random graphs, but are not suitable for scale-free networks. Furthermore, regarding the process on a heterogeneous mixing population, we obtain a set of differential equations that describes the time evolution of the probability that an individual is in each state. Our model can also be applied for studying systems in which informed agents try to stop the rumour propagation, or for describing related susceptible–infected–recovered systems. In addition, our results can be considered to develop optimal information dissemination strategies and approaches to control rumour propagation. PMID:26473048

Modeling mesoscopic cortical dynamics using a mean-field model of conductance-based networks of adaptive exponential integrate-and-fire neurons.

PubMed

Zerlaut, Yann; Chemla, Sandrine; Chavane, Frederic; Destexhe, Alain

2018-02-01

Voltage-sensitive dye imaging (VSDi) has revealed fundamental properties of neocortical processing at macroscopic scales. Since for each pixel VSDi signals report the average membrane potential over hundreds of neurons, it seems natural to use a mean-field formalism to model such signals. Here, we present a mean-field model of networks of Adaptive Exponential (AdEx) integrate-and-fire neurons, with conductance-based synaptic interactions. We study a network of regular-spiking (RS) excitatory neurons and fast-spiking (FS) inhibitory neurons. We use a Master Equation formalism, together with a semi-analytic approach to the transfer function of AdEx neurons to describe the average dynamics of the coupled populations. We compare the predictions of this mean-field model to simulated networks of RS-FS cells, first at the level of the spontaneous activity of the network, which is well predicted by the analytical description. Second, we investigate the response of the network to time-varying external input, and show that the mean-field model predicts the response time course of the population. Finally, to model VSDi signals, we consider a one-dimensional ring model made of interconnected RS-FS mean-field units. We found that this model can reproduce the spatio-temporal patterns seen in VSDi of awake monkey visual cortex as a response to local and transient visual stimuli. Conversely, we show that the model allows one to infer physiological parameters from the experimentally-recorded spatio-temporal patterns.

A Network Model of Observation and Imitation of Speech

PubMed Central

Mashal, Nira; Solodkin, Ana; Dick, Anthony Steven; Chen, E. Elinor; Small, Steven L.

2012-01-01

Much evidence has now accumulated demonstrating and quantifying the extent of shared regional brain activation for observation and execution of speech. However, the nature of the actual networks that implement these functions, i.e., both the brain regions and the connections among them, and the similarities and differences across these networks has not been elucidated. The current study aims to characterize formally a network for observation and imitation of syllables in the healthy adult brain and to compare their structure and effective connectivity. Eleven healthy participants observed or imitated audiovisual syllables spoken by a human actor. We constructed four structural equation models to characterize the networks for observation and imitation in each of the two hemispheres. Our results show that the network models for observation and imitation comprise the same essential structure but differ in important ways from each other (in both hemispheres) based on connectivity. In particular, our results show that the connections from posterior superior temporal gyrus and sulcus to ventral premotor, ventral premotor to dorsal premotor, and dorsal premotor to primary motor cortex in the left hemisphere are stronger during imitation than during observation. The first two connections are implicated in a putative dorsal stream of speech perception, thought to involve translating auditory speech signals into motor representations. Thus, the current results suggest that flow of information during imitation, starting at the posterior superior temporal cortex and ending in the motor cortex, enhances input to the motor cortex in the service of speech execution. PMID:22470360

Modeling extracellular fields for a three-dimensional network of cells using NEURON.

PubMed

Appukuttan, Shailesh; Brain, Keith L; Manchanda, Rohit

2017-10-01

Computational modeling of biological cells usually ignores their extracellular fields, assuming them to be inconsequential. Though such an assumption might be justified in certain cases, it is debatable for networks of tightly packed cells, such as in the central nervous system and the syncytial tissues of cardiac and smooth muscle. In the present work, we demonstrate a technique to couple the extracellular fields of individual cells within the NEURON simulation environment. The existing features of the simulator are extended by explicitly defining current balance equations, resulting in the coupling of the extracellular fields of adjacent cells. With this technique, we achieved continuity of extracellular space for a network model, thereby allowing the exploration of extracellular interactions computationally. Using a three-dimensional network model, passive and active electrical properties were evaluated under varying levels of extracellular volumes. Simultaneous intracellular and extracellular recordings for synaptic and action potentials were analyzed, and the potential of ephaptic transmission towards functional coupling of cells was explored. We have implemented a true bi-domain representation of a network of cells, with the extracellular domain being continuous throughout the entire model. This has hitherto not been achieved using NEURON, or other compartmental modeling platforms. We have demonstrated the coupling of the extracellular field of every cell in a three-dimensional model to obtain a continuous uniform extracellular space. This technique provides a framework for the investigation of interactions in tightly packed networks of cells via their extracellular fields. Copyright © 2017 Elsevier B.V. All rights reserved.

A unified framework for unraveling the functional interaction structure of a biomolecular network based on stimulus-response experimental data.

PubMed

Cho, Kwang-Hyun; Choo, Sang-Mok; Wellstead, Peter; Wolkenhauer, Olaf

2005-08-15

We propose a unified framework for the identification of functional interaction structures of biomolecular networks in a way that leads to a new experimental design procedure. In developing our approach, we have built upon previous work. Thus we begin by pointing out some of the restrictions associated with existing structure identification methods and point out how these restrictions may be eased. In particular, existing methods use specific forms of experimental algebraic equations with which to identify the functional interaction structure of a biomolecular network. In our work, we employ an extended form of these experimental algebraic equations which, while retaining their merits, also overcome some of their disadvantages. Experimental data are required in order to estimate the coefficients of the experimental algebraic equation set associated with the structure identification task. However, experimentalists are rarely provided with guidance on which parameters to perturb, and to what extent, to perturb them. When a model of network dynamics is required then there is also the vexed question of sample rate and sample time selection to be resolved. Supplying some answers to these questions is the main motivation of this paper. The approach is based on stationary and/or temporal data obtained from parameter perturbations, and unifies the previous approaches of Kholodenko et al. (PNAS 99 (2002) 12841-12846) and Sontag et al. (Bioinformatics 20 (2004) 1877-1886). By way of demonstration, we apply our unified approach to a network model which cannot be properly identified by existing methods. Finally, we propose an experiment design methodology, which is not limited by the amount of parameter perturbations, and illustrate its use with an in numero example.

A new methodology for determination of macroscopic transport parameters in drying porous media

NASA Astrophysics Data System (ADS)

Attari Moghaddam, A.; Kharaghani, A.; Tsotsas, E.; Prat, M.

2015-12-01

Two main approaches have been used to model the drying process: The first approach considers the partially saturated porous medium as a continuum and partial differential equations are used to describe the mass, momentum and energy balances of the fluid phases. The continuum-scale models (CM) obtained by this approach involve constitutive laws which require effective material properties, such as the diffusivity, permeability, and thermal conductivity which are often determined by experiments. The second approach considers the material at the pore scale, where the void space is represented by a network of pores (PN). Micro- or nanofluidics models used in each pore give rise to a large system of ordinary differential equations with degrees of freedom at each node of the pore network. In this work, the moisture transport coefficient (D), the pseudo desorption isotherm inside the network and at the evaporative surface are estimated from the post-processing of the three-dimensional pore network drying simulations for fifteen realizations of the pore space geometry from a given probability distribution. A slice sampling method is used in order to extract these parameters from PN simulations. The moisture transport coefficient obtained in this way is shown in Fig. 1a. The minimum of average D values demonstrates the transition between liquid dominated moisture transport region and vapor dominated moisture transport region; a similar behavior has been observed in previous experimental findings. A function is fitted to the average D values and then is fed into the non-linear moisture diffusion equation. The saturation profiles obtained from PN and CM simulations are shown in Fig. 1b. Figure 1: (a) extracted moisture transport coefficient during drying for fifteen realizations of the pore network, (b) average moisture profiles during drying obtained from PN and CM simulations.

A universal concept based on cellular neural networks for ultrafast and flexible solving of differential equations.

PubMed

Chedjou, Jean Chamberlain; Kyamakya, Kyandoghere

2015-04-01

This paper develops and validates a comprehensive and universally applicable computational concept for solving nonlinear differential equations (NDEs) through a neurocomputing concept based on cellular neural networks (CNNs). High-precision, stability, convergence, and lowest-possible memory requirements are ensured by the CNN processor architecture. A significant challenge solved in this paper is that all these cited computing features are ensured in all system-states (regular or chaotic ones) and in all bifurcation conditions that may be experienced by NDEs.One particular quintessence of this paper is to develop and demonstrate a solver concept that shows and ensures that CNN processors (realized either in hardware or in software) are universal solvers of NDE models. The solving logic or algorithm of given NDEs (possible examples are: Duffing, Mathieu, Van der Pol, Jerk, Chua, Rössler, Lorenz, Burgers, and the transport equations) through a CNN processor system is provided by a set of templates that are computed by our comprehensive templates calculation technique that we call nonlinear adaptive optimization. This paper is therefore a significant contribution and represents a cutting-edge real-time computational engineering approach, especially while considering the various scientific and engineering applications of this ultrafast, energy-and-memory-efficient, and high-precise NDE solver concept. For illustration purposes, three NDE models are demonstratively solved, and related CNN templates are derived and used: the periodically excited Duffing equation, the Mathieu equation, and the transport equation.

Deep learning beyond Lefschetz thimbles

NASA Astrophysics Data System (ADS)

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

2017-11-01

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

A new approach for designing self-organizing systems and application to adaptive control

NASA Technical Reports Server (NTRS)

Ramamoorthy, P. A.; Zhang, Shi; Lin, Yueqing; Huang, Song

1993-01-01

There is tremendous interest in the design of intelligent machines capable of autonomous learning and skillful performance under complex environments. A major task in designing such systems is to make the system plastic and adaptive when presented with new and useful information and stable in response to irrelevant events. A great body of knowledge, based on neuro-physiological concepts, has evolved as a possible solution to this problem. Adaptive resonance theory (ART) is a classical example under this category. The system dynamics of an ART network is described by a set of differential equations with nonlinear functions. An approach for designing self-organizing networks characterized by nonlinear differential equations is proposed.

A neuro approach to solve fuzzy Riccati differential equations

NASA Astrophysics Data System (ADS)

Shahrir, Mohammad Shazri; Kumaresan, N.; Kamali, M. Z. M.; Ratnavelu, Kurunathan

2015-10-01

There are many applications of optimal control theory especially in the area of control systems in engineering. In this paper, fuzzy quadratic Riccati differential equation is estimated using neural networks (NN). Previous works have shown reliable results using Runge-Kutta 4th order (RK4). The solution can be achieved by solving the 1st Order Non-linear Differential Equation (ODE) that is found commonly in Riccati differential equation. Research has shown improved results relatively to the RK4 method. It can be said that NN approach shows promising results with the advantage of continuous estimation and improved accuracy that can be produced over RK4.

A neuro approach to solve fuzzy Riccati differential equations

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

Shahrir, Mohammad Shazri, E-mail: mshazri@gmail.com; Telekom Malaysia, R&D TM Innovation Centre, LingkaranTeknokrat Timur, 63000 Cyberjaya, Selangor; Kumaresan, N., E-mail: drnk2008@gmail.com

There are many applications of optimal control theory especially in the area of control systems in engineering. In this paper, fuzzy quadratic Riccati differential equation is estimated using neural networks (NN). Previous works have shown reliable results using Runge-Kutta 4th order (RK4). The solution can be achieved by solving the 1st Order Non-linear Differential Equation (ODE) that is found commonly in Riccati differential equation. Research has shown improved results relatively to the RK4 method. It can be said that NN approach shows promising results with the advantage of continuous estimation and improved accuracy that can be produced over RK4.

Optimizing Power–Frequency Droop Characteristics of Distributed Energy Resources

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

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

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

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.

A Model of Yeast Cell-Cycle Regulation Based on a Standard Component Modeling Strategy for Protein Regulatory Networks.

PubMed

Laomettachit, Teeraphan; Chen, Katherine C; Baumann, William T; Tyson, John J

2016-01-01

To understand the molecular mechanisms that regulate cell cycle progression in eukaryotes, a variety of mathematical modeling approaches have been employed, ranging from Boolean networks and differential equations to stochastic simulations. Each approach has its own characteristic strengths and weaknesses. In this paper, we propose a "standard component" modeling strategy that combines advantageous features of Boolean networks, differential equations and stochastic simulations in a framework that acknowledges the typical sorts of reactions found in protein regulatory networks. Applying this strategy to a comprehensive mechanism of the budding yeast cell cycle, we illustrate the potential value of standard component modeling. The deterministic version of our model reproduces the phenotypic properties of wild-type cells and of 125 mutant strains. The stochastic version of our model reproduces the cell-to-cell variability of wild-type cells and the partial viability of the CLB2-dbΔ clb5Δ mutant strain. Our simulations show that mathematical modeling with "standard components" can capture in quantitative detail many essential properties of cell cycle control in budding yeast.

A Model of Yeast Cell-Cycle Regulation Based on a Standard Component Modeling Strategy for Protein Regulatory Networks

PubMed Central

Laomettachit, Teeraphan; Chen, Katherine C.; Baumann, William T.

2016-01-01

To understand the molecular mechanisms that regulate cell cycle progression in eukaryotes, a variety of mathematical modeling approaches have been employed, ranging from Boolean networks and differential equations to stochastic simulations. Each approach has its own characteristic strengths and weaknesses. In this paper, we propose a “standard component” modeling strategy that combines advantageous features of Boolean networks, differential equations and stochastic simulations in a framework that acknowledges the typical sorts of reactions found in protein regulatory networks. Applying this strategy to a comprehensive mechanism of the budding yeast cell cycle, we illustrate the potential value of standard component modeling. The deterministic version of our model reproduces the phenotypic properties of wild-type cells and of 125 mutant strains. The stochastic version of our model reproduces the cell-to-cell variability of wild-type cells and the partial viability of the CLB2-dbΔ clb5Δ mutant strain. Our simulations show that mathematical modeling with “standard components” can capture in quantitative detail many essential properties of cell cycle control in budding yeast. PMID:27187804

Mapping the African thunderstorm center in absolute units using Schumann resonance spectral decomposition method

NASA Astrophysics Data System (ADS)

Dyrda, Michal; Kulak, Andrzej; Mlynarczyk, Janusz

2015-04-01

Monitoring of the global lightning activity provides a very useful tool to study the global warming phenomenon and the other longer-scale climate changes induced by humans. The lightning activity is measured using various observational methods form space (optical satellite observations) as well as from the ground mostly by VLF /LF lightning detection networks, i.e. World Wide Lightning Location Network (WWLLN) or lightning detection network (LINET) in Europe. However, the global lightning activity measurements are possible only in the ELF range. Here we examine the African thunderstorm activity center, which is the most violent and active one. In a spherical damped resonator, such as the Earth-ionosphere cavity, the electromagnetic field is described by the solution of an inhomogeneous wave equation. For such equation the general solution can be expressed by the superposition of the solutions of the homogeneous equation, describing the resonance field, and the component, which is quite strong close to the source and weakens with source-observer separation. Thus, the superposition of the standing wave field with the field of traveling waves, which supply the energy from the lighting discharges to the global resonator, is a main reason for an asymmetric shape of the observational Schumann resonance (SR) power spectra, which highly deviate from the Lorentz curves. It is possible to separate this component from the signal using the spectrum decomposition method proposed by Kułak et al. [2006]. In our approach, we apply the inverse problem solution for determining the distance of the dominant lightning source. The distances to the thunderstorm centers are calculated using the analytical models for the electromagnetic waves propagation in the Earth-ionosphere cavity. Such forms of analytic solutions of the resonant field in the spherical cavity is the zonal harmonic series representation, described by Mushtak and Williams [2002] and we calculated the sets of such curves for different source-observer separations, starting at 1 Mm up to 20 Mm with a step of 0.1 Mm. We selected two observational data sets, collected during different seasons of the year, from our Hylaty station, located in Poland. The data were binned in 10-minute files for which the SR power spectra were derived. In the next step a decomposition curve describing 7 asymmetric SR modes was fitted to the observational data. To compare the resulted decomposed power spectra with analytic model we use chi-squared test and hence we obtained the distances to the dominant thunderstorm center, located in Africa. We computed the monthly lighting activity maps and possible locations on the African continent with the spatial resolution of 1 degree and temporal resolution of 10 minute. Moreover we calculated the thunderstorm intensities in physical units, which are of the order of 2 × 1011 [C2 m2 s-1]. We also notice the seasonal variations of the African thunderstorm centers distributions and as well as intensities. Finally, we compared our results with satellite data recorded by the Lighting Imaging Sensor (LIS) and we obtained very high correlation. Acknowledgements. This work has been supported by the National Science Centre grant 2012/04/M/ST10/00565. The numerical computations were done using the PL-Grid infrastructure.

Smoluchowski Equation for Networks: Merger Induced Intermittent Giant Node Formation and Degree Gap

NASA Astrophysics Data System (ADS)

Goto, Hayato; Viegas, Eduardo; Jensen, Henrik Jeldtoft; Takayasu, Hideki; Takayasu, Misako

2018-06-01

The dynamical phase diagram of a network undergoing annihilation, creation, and coagulation of nodes is found to exhibit two regimes controlled by the combined effect of preferential attachment for initiator and target nodes during coagulation and for link assignment to new nodes. The first regime exhibits smooth dynamics and power law degree distributions. In the second regime, giant degree nodes and gaps in the degree distribution are formed intermittently. Data for the Japanese firm network in 1994 and 2014 suggests that this network is moving towards the intermittent switching region.

Personality and complex brain networks: The role of openness to experience in default network efficiency

PubMed Central

Kaufman, Scott Barry; Benedek, Mathias; Jung, Rex E.; Kenett, Yoed N.; Jauk, Emanuel; Neubauer, Aljoscha C.; Silvia, Paul J.

2015-01-01

Abstract The brain's default network (DN) has been a topic of considerable empirical interest. In fMRI research, DN activity is associated with spontaneous and self‐generated cognition, such as mind‐wandering, episodic memory retrieval, future thinking, mental simulation, theory of mind reasoning, and creative cognition. Despite large literatures on developmental and disease‐related influences on the DN, surprisingly little is known about the factors that impact normal variation in DN functioning. Using structural equation modeling and graph theoretical analysis of resting‐state fMRI data, we provide evidence that Openness to Experience—a normally distributed personality trait reflecting a tendency to engage in imaginative, creative, and abstract cognitive processes—underlies efficiency of information processing within the DN. Across two studies, Openness predicted the global efficiency of a functional network comprised of DN nodes and corresponding edges. In Study 2, Openness remained a robust predictor—even after controlling for intelligence, age, gender, and other personality variables—explaining 18% of the variance in DN functioning. These findings point to a biological basis of Openness to Experience, and suggest that normally distributed personality traits affect the intrinsic architecture of large‐scale brain systems. Hum Brain Mapp 37:773–779, 2016. © 2015 Wiley Periodicals, Inc. PMID:26610181

Applications of flow-networks to opinion-dynamics

NASA Astrophysics Data System (ADS)

Tupikina, Liubov; Kurths, Jürgen

2015-04-01

Networks were successfully applied to describe complex systems, such as brain, climate, processes in society. Recently a socio-physical problem of opinion-dynamics was studied using network techniques. We present the toy-model of opinion-formation based on the physical model of advection-diffusion. We consider spreading of the opinion on the fixed subject, assuming that opinion on society is binary: if person has opinion then the state of the node in the society-network equals 1, if the person doesn't have opinion state of the node equals 0. Opinion can be spread from one person to another if they know each other, or in the network-terminology, if the nodes are connected. We include into the system governed by advection-diffusion equation the external field to model such effects as for instance influence from media. The assumptions for our model can be formulated as the following: 1.the node-states are influenced by the network structure in such a way, that opinion can be spread only between adjacent nodes (the advective term of the opinion-dynamics), 2.the network evolution can have two scenarios: -network topology is not changing with time; -additional links can appear or disappear each time-step with fixed probability which requires adaptive networks properties. Considering these assumptions for our system we obtain the system of equations describing our model-dynamics which corresponds well to other socio-physics models, for instance, the model of the social cohesion and the famous voter-model. We investigate the behavior of the suggested model studying "waiting time" of the system, time to get to the stable state, stability of the model regimes for different values of model parameters and network topology.

A model of gene expression based on random dynamical systems reveals modularity properties of gene regulatory networks.

PubMed

Antoneli, Fernando; Ferreira, Renata C; Briones, Marcelo R S

2016-06-01

Here we propose a new approach to modeling gene expression based on the theory of random dynamical systems (RDS) that provides a general coupling prescription between the nodes of any given regulatory network given the dynamics of each node is modeled by a RDS. The main virtues of this approach are the following: (i) it provides a natural way to obtain arbitrarily large networks by coupling together simple basic pieces, thus revealing the modularity of regulatory networks; (ii) the assumptions about the stochastic processes used in the modeling are fairly general, in the sense that the only requirement is stationarity; (iii) there is a well developed mathematical theory, which is a blend of smooth dynamical systems theory, ergodic theory and stochastic analysis that allows one to extract relevant dynamical and statistical information without solving the system; (iv) one may obtain the classical rate equations form the corresponding stochastic version by averaging the dynamic random variables (small noise limit). It is important to emphasize that unlike the deterministic case, where coupling two equations is a trivial matter, coupling two RDS is non-trivial, specially in our case, where the coupling is performed between a state variable of one gene and the switching stochastic process of another gene and, hence, it is not a priori true that the resulting coupled system will satisfy the definition of a random dynamical system. We shall provide the necessary arguments that ensure that our coupling prescription does indeed furnish a coupled regulatory network of random dynamical systems. Finally, the fact that classical rate equations are the small noise limit of our stochastic model ensures that any validation or prediction made on the basis of the classical theory is also a validation or prediction of our model. We illustrate our framework with some simple examples of single-gene system and network motifs. Copyright © 2016 Elsevier Inc. All rights reserved.

Taking a systems approach to ecological systems

USGS Publications Warehouse

Grace, James B.

2015-01-01

Increasingly, there is interest in a systems-level understanding of ecological problems, which requires the evaluation of more complex, causal hypotheses. In this issue of the Journal of Vegetation Science, Soliveres et al. use structural equation modeling to test a causal network hypothesis about how tree canopies affect understorey communities. Historical analysis suggests structural equation modeling has been under-utilized in ecology.

W-algebra for solving problems with fuzzy parameters

NASA Astrophysics Data System (ADS)

Shevlyakov, A. O.; Matveev, M. G.

2018-03-01

A method of solving the problems with fuzzy parameters by means of a special algebraic structure is proposed. The structure defines its operations through operations on real numbers, which simplifies its use. It avoids deficiencies limiting applicability of the other known structures. Examples for solution of a quadratic equation, a system of linear equations and a network planning problem are given.

A deterministic method for estimating free energy genetic network landscapes with applications to cell commitment and reprogramming paths.

PubMed

Olariu, Victor; Manesso, Erica; Peterson, Carsten

2017-06-01

Depicting developmental processes as movements in free energy genetic landscapes is an illustrative tool. However, exploring such landscapes to obtain quantitative or even qualitative predictions is hampered by the lack of free energy functions corresponding to the biochemical Michaelis-Menten or Hill rate equations for the dynamics. Being armed with energy landscapes defined by a network and its interactions would open up the possibility of swiftly identifying cell states and computing optimal paths, including those of cell reprogramming, thereby avoiding exhaustive trial-and-error simulations with rate equations for different parameter sets. It turns out that sigmoidal rate equations do have approximate free energy associations. With this replacement of rate equations, we develop a deterministic method for estimating the free energy surfaces of systems of interacting genes at different noise levels or temperatures. Once such free energy landscape estimates have been established, we adapt a shortest path algorithm to determine optimal routes in the landscapes. We explore the method on three circuits for haematopoiesis and embryonic stem cell development for commitment and reprogramming scenarios and illustrate how the method can be used to determine sequential steps for onsets of external factors, essential for efficient reprogramming.

Deterministic modelling and stochastic simulation of biochemical pathways using MATLAB.

PubMed

Ullah, M; Schmidt, H; Cho, K H; Wolkenhauer, O

2006-03-01

The analysis of complex biochemical networks is conducted in two popular conceptual frameworks for modelling. The deterministic approach requires the solution of ordinary differential equations (ODEs, reaction rate equations) with concentrations as continuous state variables. The stochastic approach involves the simulation of differential-difference equations (chemical master equations, CMEs) with probabilities as variables. This is to generate counts of molecules for chemical species as realisations of random variables drawn from the probability distribution described by the CMEs. Although there are numerous tools available, many of them free, the modelling and simulation environment MATLAB is widely used in the physical and engineering sciences. We describe a collection of MATLAB functions to construct and solve ODEs for deterministic simulation and to implement realisations of CMEs for stochastic simulation using advanced MATLAB coding (Release 14). The program was successfully applied to pathway models from the literature for both cases. The results were compared to implementations using alternative tools for dynamic modelling and simulation of biochemical networks. The aim is to provide a concise set of MATLAB functions that encourage the experimentation with systems biology models. All the script files are available from www.sbi.uni-rostock.de/ publications_matlab-paper.html.

Stochastic oscillations in models of epidemics on a network of cities

NASA Astrophysics Data System (ADS)

Rozhnova, G.; Nunes, A.; McKane, A. J.

2011-11-01

We carry out an analytic investigation of stochastic oscillations in a susceptible-infected-recovered model of disease spread on a network of n cities. In the model a fraction fjk of individuals from city k commute to city j, where they may infect, or be infected by, others. Starting from a continuous-time Markov description of the model the deterministic equations, which are valid in the limit when the population of each city is infinite, are recovered. The stochastic fluctuations about the fixed point of these equations are derived by use of the van Kampen system-size expansion. The fixed point structure of the deterministic equations is remarkably simple: A unique nontrivial fixed point always exists and has the feature that the fraction of susceptible, infected, and recovered individuals is the same for each city irrespective of its size. We find that the stochastic fluctuations have an analogously simple dynamics: All oscillations have a single frequency, equal to that found in the one-city case. We interpret this phenomenon in terms of the properties of the spectrum of the matrix of the linear approximation of the deterministic equations at the fixed point.

Neural network based online simultaneous policy update algorithm for solving the HJI equation in nonlinear H∞ control.

PubMed

Wu, Huai-Ning; Luo, Biao

2012-12-01

It is well known that the nonlinear H∞ state feedback control problem relies on the solution of the Hamilton-Jacobi-Isaacs (HJI) equation, which is a nonlinear partial differential equation that has proven to be impossible to solve analytically. In this paper, a neural network (NN)-based online simultaneous policy update algorithm (SPUA) is developed to solve the HJI equation, in which knowledge of internal system dynamics is not required. First, we propose an online SPUA which can be viewed as a reinforcement learning technique for two players to learn their optimal actions in an unknown environment. The proposed online SPUA updates control and disturbance policies simultaneously; thus, only one iterative loop is needed. Second, the convergence of the online SPUA is established by proving that it is mathematically equivalent to Newton's method for finding a fixed point in a Banach space. Third, we develop an actor-critic structure for the implementation of the online SPUA, in which only one critic NN is needed for approximating the cost function, and a least-square method is given for estimating the NN weight parameters. Finally, simulation studies are provided to demonstrate the effectiveness of the proposed algorithm.

A deterministic method for estimating free energy genetic network landscapes with applications to cell commitment and reprogramming paths

PubMed Central

Olariu, Victor; Manesso, Erica

2017-01-01

Depicting developmental processes as movements in free energy genetic landscapes is an illustrative tool. However, exploring such landscapes to obtain quantitative or even qualitative predictions is hampered by the lack of free energy functions corresponding to the biochemical Michaelis–Menten or Hill rate equations for the dynamics. Being armed with energy landscapes defined by a network and its interactions would open up the possibility of swiftly identifying cell states and computing optimal paths, including those of cell reprogramming, thereby avoiding exhaustive trial-and-error simulations with rate equations for different parameter sets. It turns out that sigmoidal rate equations do have approximate free energy associations. With this replacement of rate equations, we develop a deterministic method for estimating the free energy surfaces of systems of interacting genes at different noise levels or temperatures. Once such free energy landscape estimates have been established, we adapt a shortest path algorithm to determine optimal routes in the landscapes. We explore the method on three circuits for haematopoiesis and embryonic stem cell development for commitment and reprogramming scenarios and illustrate how the method can be used to determine sequential steps for onsets of external factors, essential for efficient reprogramming. PMID:28680655

Formation Timescales of the Martian Valley Networks

NASA Astrophysics Data System (ADS)

Hoke, M. T.; Hynek, B. M.

2010-12-01

The presence of valley networks across much of the ancient surface of Mars [e.g. 1] together with the locations and morphologies of the Martian deltas [e.g. 2] and ancient paleolakes [e.g. 3, 4], provides strong evidence that the Martian surface environment was once capable of sustaining long-lived flowing water. Many of the larger Martian valley networks exhibit characteristics consistent with their formation primarily from surface runoff of precipitated water [5-7]. Their formation likely followed similar processes as those that formed terrestrial river valleys, including the gradual erosion and transport of sediment downstream by bed load, suspended load, and wash load processes. When quantifying flow rates on Mars, some researchers have modified the Manning equation for depth- and width-averaged flow velocity in an attempt to better-fit Martian conditions [e.g. 3, 8-10]. These attempts, however, often result in flow velocities on Mars that are overestimated by up to a factor of two [10]. An alternative to the Manning equation that is often overlooked in the planetary science community is the Darcy-Weisbach (D-W) equation [11], which, unlike the Manning equation, maintains a dependence on the acceleration due to gravity. Although the D-W equation relies on a dimensionless friction function that has been fitted to terrestrial data, it is not a constant like the Manning coefficient. Rather, the D-W friction factor is a function of bed slope, flow depth, and median grain size [e.g. 8, 10, 12-14], and therefore it is better suited to model flow velocity on Mars. In this work, we investigate the formation timescales of the Martian valley networks through the use of four different sediment transport models [14], the D-W equation for average flow velocity, and a variety of parameters to encompass a range of possible formation conditions. This is done specific to each of eight large valley networks, all of which have crater densities that place their formation in the Late Noachian and Early Hesperian [15, 16], approximately 3.6 to 3.8 billion years ago. The preferred model scenario includes bankfull flows of 4-5 m depths corresponding to precipitation rates of 5 to 36 mm/day, depending on the valley network, and occurring intermittently 5% of the time. Results of the preferred model include formation timescales of 104 years (3°S, 5°E) to 108 years (east branch of Naktong Valles and 6°S, 45°E). References: [1] Hynek et al. (2010) JGR, doi:10.1029/2009JE003548; [2] Di Achille and Hynek (2010) Nature Geoscience, 3, 459-463; [3] Irwin et al. (2005) JGR, 110, E12S15; [4] Fassett and Head (2008) Icarus, 198, 37-56; [5] Craddock and Howard (2002) JGR, 107, 5111; [6] Howard et al. (2005) JGR, 110, E12S14; [7] Barnhart et al. (2009) JGR, 114, E01003; [8] Komar (1979) Icarus, 37, 156-181; [9] Goldspiel and Squyres (1991) Icarus, 89, 392-410; [10] Wilson et al. (2004) JGR, 109, E09003; [11] Leopold et al. (1964) Fluvial Processes in Geomorphology, 522pp; [12] Bathurst (1993) in Channel Network Hydrology, eds. Beven and Kirkby, p69-98; [13] Komar (1980) Icarus, 42, 317-329; [14] Kleinhans (2005) JGR, 110, E12003; [15] Fassett and Head (2008) Icarus, 195, 61-89; [16] Hoke and Hynek (2009) JGR, 114, E08002.

Social network-related risk factors for bloodborne virus infections among injection drug users receiving syringes through secondary exchange.

PubMed

De, Prithwish; Cox, Joseph; Boivin, Jean-François; Platt, Robert W; Jolly, Ann M

2008-01-01

Secondary syringe exchange (SSE) refers to the exchange of sterile syringes between injection drug users (IDUs). To date there has been limited examination of SSE in relation to the social networks of IDUs. This study aimed to identify characteristics of drug injecting networks associated with the receipt of syringes through SSE. Active IDUs were recruited from syringe exchange and methadone treatment programs in Montreal, Canada, between April 2004 and January 2005. Information on each participant and on their drug-injecting networks was elicited using a structured, interviewer-administered questionnaire. Subjects' network characteristics were examined in relation to SSE using regression models with generalized estimating equations. Of 218 participants, 126 were SSE recipients with 186 IDUs in their injecting networks. The 92 non-recipients reported 188 network IDUs. Networks of SSE recipients and non-recipients were similar with regard to network size and demographics of network members. In multivariate analyses adjusted for age and gender, SSE recipients were more likely than non-recipients to self-report being HIV-positive (OR=3.56 [1.54-8.23]); require or provide help with injecting (OR=3.74 [2.01-6.95]); have a social network member who is a sexual partner (OR=1.90 [1.11-3.24]), who currently attends a syringe exchange or methadone program (OR=2.33 [1.16-4.70]), injects daily (OR=1.77 [1.11-2.84]), and shares syringes with the subject (OR=2.24 [1.13-4.46]). SSE is associated with several injection-related risk factors that could be used to help focus public health interventions for risk reduction. Since SSE offers an opportunity for the dissemination of important prevention messages, SSE-based networks should be used to improve public health interventions. This approach can optimize the benefits of SSE while minimizing the potential risks associated with the practice of secondary exchange.

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.

Multiscale model reduction for shale gas transport in poroelastic fractured media

NASA Astrophysics Data System (ADS)

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

2018-01-01

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

A Bayesian approach to estimating hidden variables as well as missing and wrong molecular interactions in ordinary differential equation-based mathematical models.

PubMed

Engelhardt, Benjamin; Kschischo, Maik; Fröhlich, Holger

2017-06-01

Ordinary differential equations (ODEs) are a popular approach to quantitatively model molecular networks based on biological knowledge. However, such knowledge is typically restricted. Wrongly modelled biological mechanisms as well as relevant external influence factors that are not included into the model are likely to manifest in major discrepancies between model predictions and experimental data. Finding the exact reasons for such observed discrepancies can be quite challenging in practice. In order to address this issue, we suggest a Bayesian approach to estimate hidden influences in ODE-based models. The method can distinguish between exogenous and endogenous hidden influences. Thus, we can detect wrongly specified as well as missed molecular interactions in the model. We demonstrate the performance of our Bayesian dynamic elastic-net with several ordinary differential equation models from the literature, such as human JAK-STAT signalling, information processing at the erythropoietin receptor, isomerization of liquid α -Pinene, G protein cycling in yeast and UV-B triggered signalling in plants. Moreover, we investigate a set of commonly known network motifs and a gene-regulatory network. Altogether our method supports the modeller in an algorithmic manner to identify possible sources of errors in ODE-based models on the basis of experimental data. © 2017 The Author(s).

Multidimensional Predictors of Fatigue among Octogenarians and Centenarians

PubMed Central

Cho, Jinmyoung; Martin, Peter; Margrett, Jennifer; MacDonald, Maurice; Johnson, Mary Ann; Poon, Leonard W.

2012-01-01

Background Fatigue is a common and frequently observed complaint among older adults. However, knowledge about the nature and correlates of fatigue in old age is very limited. Objective: This study examined the relationship of functional indicators, psychological and situational factors and fatigue for 210 octogenarians and centenarians from the Georgia Centenarian Study. Methods Three indicators of functional capacity (self-rated health, instrumental activities of daily living, physical activities of daily living), two indicators of psychological well-being (positive and negative affect), two indicators of situational factors (social network and social support), and a multidimensional fatigue scale were used. Blocked multiple regression analyses were computed to examine significant factors related to fatigue. In addition, multi-group analysis in structural equation modeling was used to investigate residential differences (i.e., long-term care facilities vs. private homes) in the relationship between significant factors and fatigue. Results Blocked multiple regression analyses indicated that two indicators of functional capacity, self-rated health and instrumental activities of daily living, both positive and negative affect, and social support were significant predictors of fatigue among oldest-old adults. The multiple group analysis in structural equation modeling revealed a significant difference among oldest-old adults based on residential status. Conclusion The results suggest that we should not consider fatigue as merely an unpleasant physical symptom, but rather adopt a perspective that different factors such as psychosocial aspects can influence fatigue in advanced later life. PMID:22094445

Multidimensional predictors of fatigue among octogenarians and centenarians.

PubMed

Cho, Jinmyoung; Martin, Peter; Margrett, Jennifer; MacDonald, Maurice; Johnson, Mary Ann; Poon, Leonard W; Jazwinski, S M; Green, R C; Gearing, M; Woodard, J L; Tenover, J S; Siegler, I C; Rott, C; Rodgers, W L; Hausman, D; Arnold, J; Davey, A

2012-01-01

Fatigue is a common and frequently observed complaint among older adults. However, knowledge about the nature and correlates of fatigue in old age is very limited. This study examined the relationship of functional indicators, psychological and situational factors and fatigue for 210 octogenarians and centenarians from the Georgia Centenarian Study. Three indicators of functional capacity (self-rated health, instrumental activities of daily living, physical activities of daily living), two indicators of psychological well-being (positive and negative affect), two indicators of situational factors (social network and social support), and a multidimensional fatigue scale were used. Blocked multiple regression analyses were computed to examine significant factors related to fatigue. In addition, multi-group analysis in structural equation modeling was used to investigate residential differences (i.e., long-term care facilities vs. private homes) in the relationship between significant factors and fatigue. Blocked multiple regression analyses indicated that two indicators of functional capacity, self-rated health and instrumental activities of daily living, both positive and negative affect, and social support were significant predictors of fatigue among oldest-old adults. The multiple group analysis in structural equation modeling revealed a significant difference among oldest-old adults based on residential status. The results suggest that we should not consider fatigue as merely an unpleasant physical symptom, but rather adopt a perspective that different factors such as psychosocial aspects can influence fatigue in advanced later life. Copyright © 2011 S. Karger AG, Basel.

Modelling fuel cell performance using artificial intelligence

NASA Astrophysics Data System (ADS)

Ogaji, S. O. T.; Singh, R.; Pilidis, P.; Diacakis, M.

Over the last few years, fuel cell technology has been increasing promisingly its share in the generation of stationary power. Numerous pilot projects are operating worldwide, continuously increasing the amount of operating hours either as stand-alone devices or as part of gas turbine combined cycles. An essential tool for the adequate and dynamic analysis of such systems is a software model that enables the user to assess a large number of alternative options in the least possible time. On the other hand, the sphere of application of artificial neural networks has widened covering such endeavours of life such as medicine, finance and unsurprisingly engineering (diagnostics of faults in machines). Artificial neural networks have been described as diagrammatic representation of a mathematical equation that receives values (inputs) and gives out results (outputs). Artificial neural networks systems have the capacity to recognise and associate patterns and because of their inherent design features, they can be applied to linear and non-linear problem domains. In this paper, the performance of the fuel cell is modelled using artificial neural networks. The inputs to the network are variables that are critical to the performance of the fuel cell while the outputs are the result of changes in any one or all of the fuel cell design variables, on its performance. Critical parameters for the cell include the geometrical configuration as well as the operating conditions. For the neural network, various network design parameters such as the network size, training algorithm, activation functions and their causes on the effectiveness of the performance modelling are discussed. Results from the analysis as well as the limitations of the approach are presented and discussed.

Energetic Constraints Produce Self-sustained Oscillatory Dynamics in Neuronal Networks

PubMed Central

Burroni, Javier; Taylor, P.; Corey, Cassian; Vachnadze, Tengiz; Siegelmann, Hava T.

2017-01-01

Overview: We model energy constraints in a network of spiking neurons, while exploring general questions of resource limitation on network function abstractly. Background: Metabolic states like dietary ketosis or hypoglycemia have a large impact on brain function and disease outcomes. Glia provide metabolic support for neurons, among other functions. Yet, in computational models of glia-neuron cooperation, there have been no previous attempts to explore the effects of direct realistic energy costs on network activity in spiking neurons. Currently, biologically realistic spiking neural networks assume that membrane potential is the main driving factor for neural spiking, and do not take into consideration energetic costs. Methods: We define local energy pools to constrain a neuron model, termed Spiking Neuron Energy Pool (SNEP), which explicitly incorporates energy limitations. Each neuron requires energy to spike, and resources in the pool regenerate over time. Our simulation displays an easy-to-use GUI, which can be run locally in a web browser, and is freely available. Results: Energy dependence drastically changes behavior of these neural networks, causing emergent oscillations similar to those in networks of biological neurons. We analyze the system via Lotka-Volterra equations, producing several observations: (1) energy can drive self-sustained oscillations, (2) the energetic cost of spiking modulates the degree and type of oscillations, (3) harmonics emerge with frequencies determined by energy parameters, and (4) varying energetic costs have non-linear effects on energy consumption and firing rates. Conclusions: Models of neuron function which attempt biological realism may benefit from including energy constraints. Further, we assert that observed oscillatory effects of energy limitations exist in networks of many kinds, and that these findings generalize to abstract graphs and technological applications. PMID:28289370

GFSSP Training Course Lectures

NASA Technical Reports Server (NTRS)

Majumdar, Alok K.

2008-01-01

GFSSP has been extended to model conjugate heat transfer Fluid Solid Network Elements include: a) Fluid nodes and Flow Branches; b) Solid Nodes and Ambient Nodes; c) Conductors connecting Fluid-Solid, Solid-Solid and Solid-Ambient Nodes. Heat Conduction Equations are solved simultaneously with Fluid Conservation Equations for Mass, Momentum, Energy and Equation of State. The extended code was verified by comparing with analytical solution for simple conduction-convection problem The code was applied to model: a) Pressurization of Cryogenic Tank; b) Freezing and Thawing of Metal; c) Chilldown of Cryogenic Transfer Line; d) Boil-off from Cryogenic Tank.

Numerical Modeling of Conjugate Heat Transfer in Fluid Network

NASA Technical Reports Server (NTRS)

Majumdar, Alok

2004-01-01

Fluid network modeling with conjugate heat transfer has many applications in Aerospace engineering. In modeling unsteady flow with heat transfer, it is important to know the variation of wall temperature in time and space to calculate heat transfer between solid to fluid. Since wall temperature is a function of flow, a coupled analysis of temperature of solid and fluid is necessary. In cryogenic applications, modeling of conjugate heat transfer is of great importance to correctly predict boil-off rate in propellant tanks and chill down of transfer lines. In TFAWS 2003, the present author delivered a paper to describe a general-purpose computer program, GFSSP (Generalized Fluid System Simulation Program). GFSSP calculates flow distribution in complex flow circuit for compressible/incompressible, with or without heat transfer or phase change in all real fluids or mixtures. The flow circuit constitutes of fluid nodes and branches. The mass, energy and specie conservation equations are solved at the nodes where as momentum conservation equations are solved at the branches. The proposed paper describes the extension of GFSSP to model conjugate heat transfer. The network also includes solid nodes and conductors in addition to fluid nodes and branches. The energy conservation equations for solid nodes solves to determine the temperatures of the solid nodes simultaneously with all conservation equations governing fluid flow. The numerical scheme accounts for conduction, convection and radiation heat transfer. The paper will also describe the applications of the code to predict chill down of cryogenic transfer line and boil-off rate of cryogenic propellant storage tank.

A Hybrid of the Chemical Master Equation and the Gillespie Algorithm for Efficient Stochastic Simulations of Sub-Networks.

PubMed

Albert, Jaroslav

2016-01-01

Modeling stochastic behavior of chemical reaction networks is an important endeavor in many aspects of chemistry and systems biology. The chemical master equation (CME) and the Gillespie algorithm (GA) are the two most fundamental approaches to such modeling; however, each of them has its own limitations: the GA may require long computing times, while the CME may demand unrealistic memory storage capacity. We propose a method that combines the CME and the GA that allows one to simulate stochastically a part of a reaction network. First, a reaction network is divided into two parts. The first part is simulated via the GA, while the solution of the CME for the second part is fed into the GA in order to update its propensities. The advantage of this method is that it avoids the need to solve the CME or stochastically simulate the entire network, which makes it highly efficient. One of its drawbacks, however, is that most of the information about the second part of the network is lost in the process. Therefore, this method is most useful when only partial information about a reaction network is needed. We tested this method against the GA on two systems of interest in biology--the gene switch and the Griffith model of a genetic oscillator--and have shown it to be highly accurate. Comparing this method to four different stochastic algorithms revealed it to be at least an order of magnitude faster than the fastest among them.

Prediction of Welded Joint Strength in Plasma Arc Welding: A Comparative Study Using Back-Propagation and Radial Basis Neural Networks

NASA Astrophysics Data System (ADS)

Srinivas, Kadivendi; Vundavilli, Pandu R.; Manzoor Hussain, M.; Saiteja, M.

2016-09-01

Welding input parameters such as current, gas flow rate and torch angle play a significant role in determination of qualitative mechanical properties of weld joint. Traditionally, it is necessary to determine the weld input parameters for every new welded product to obtain a quality weld joint which is time consuming. In the present work, the effect of plasma arc welding parameters on mild steel was studied using a neural network approach. To obtain a response equation that governs the input-output relationships, conventional regression analysis was also performed. The experimental data was constructed based on Taguchi design and the training data required for neural networks were randomly generated, by varying the input variables within their respective ranges. The responses were calculated for each combination of input variables by using the response equations obtained through the conventional regression analysis. The performances in Levenberg-Marquardt back propagation neural network and radial basis neural network (RBNN) were compared on various randomly generated test cases, which are different from the training cases. From the results, it is interesting to note that for the above said test cases RBNN analysis gave improved training results compared to that of feed forward back propagation neural network analysis. Also, RBNN analysis proved a pattern of increasing performance as the data points moved away from the initial input values.

Novel application of multi-stimuli network inference to synovial fibroblasts of rheumatoid arthritis patients

PubMed Central

2014-01-01

Background Network inference of gene expression data is an important challenge in systems biology. Novel algorithms may provide more detailed gene regulatory networks (GRN) for complex, chronic inflammatory diseases such as rheumatoid arthritis (RA), in which activated synovial fibroblasts (SFBs) play a major role. Since the detailed mechanisms underlying this activation are still unclear, simultaneous investigation of multi-stimuli activation of SFBs offers the possibility to elucidate the regulatory effects of multiple mediators and to gain new insights into disease pathogenesis. Methods A GRN was therefore inferred from RA-SFBs treated with 4 different stimuli (IL-1 β, TNF- α, TGF- β, and PDGF-D). Data from time series microarray experiments (0, 1, 2, 4, 12 h; Affymetrix HG-U133 Plus 2.0) were batch-corrected applying ‘ComBat’, analyzed for differentially expressed genes over time with ‘Limma’, and used for the inference of a robust GRN with NetGenerator V2.0, a heuristic ordinary differential equation-based method with soft integration of prior knowledge. Results Using all genes differentially expressed over time in RA-SFBs for any stimulus, and selecting the genes belonging to the most significant gene ontology (GO) term, i.e., ‘cartilage development’, a dynamic, robust, moderately complex multi-stimuli GRN was generated with 24 genes and 57 edges in total, 31 of which were gene-to-gene edges. Prior literature-based knowledge derived from Pathway Studio or manual searches was reflected in the final network by 25/57 confirmed edges (44%). The model contained known network motifs crucial for dynamic cellular behavior, e.g., cross-talk among pathways, positive feed-back loops, and positive feed-forward motifs (including suppression of the transcriptional repressor OSR2 by all 4 stimuli. Conclusion A multi-stimuli GRN highly concordant with literature data was successfully generated by network inference from the gene expression of stimulated RA-SFBs. The GRN showed high reliability, since 10 predicted edges were independently validated by literature findings post network inference. The selected GO term ‘cartilage development’ contained a number of differentiation markers, growth factors, and transcription factors with potential relevance for RA. Finally, the model provided new insight into the response of RA-SFBs to multiple stimuli implicated in the pathogenesis of RA, in particular to the ‘novel’ potent growth factor PDGF-D. PMID:24989895

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.

Dynamics analysis of SIR epidemic model with correlation coefficients and clustering coefficient in networks.

PubMed

Zhang, Juping; Yang, Chan; Jin, Zhen; Li, Jia

2018-07-14

In this paper, the correlation coefficients between nodes in states are used as dynamic variables, and we construct SIR epidemic dynamic models with correlation coefficients by using the pair approximation method in static networks and dynamic networks, respectively. Considering the clustering coefficient of the network, we analytically investigate the existence and the local asymptotic stability of each equilibrium of these models and derive threshold values for the prevalence of diseases. Additionally, we obtain two equivalent epidemic thresholds in dynamic networks, which are compared with the results of the mean field equations. Copyright © 2018 Elsevier Ltd. All rights reserved.

The Social Context of Adolescent Friendships: Parents, Peers, and Romantic Partners

ERIC Educational Resources Information Center

Flynn, Heather Kohler; Felmlee, Diane H.; Conger, Rand D.

2017-01-01

We argue that adolescent friendships flourish, or wither, within the "linked lives" of other salient social network ties. Based on structural equation modeling with data from two time points, we find that young people tend to be in high-quality friendships when they are tightly embedded in their social network and receive social support…

Correlated Fluctuations in Strongly Coupled Binary Networks Beyond Equilibrium

NASA Astrophysics Data System (ADS)

Dahmen, David; Bos, Hannah; Helias, Moritz

2016-07-01

Randomly coupled Ising spins constitute the classical model of collective phenomena in disordered systems, with applications covering glassy magnetism and frustration, combinatorial optimization, protein folding, stock market dynamics, and social dynamics. The phase diagram of these systems is obtained in the thermodynamic limit by averaging over the quenched randomness of the couplings. However, many applications require the statistics of activity for a single realization of the possibly asymmetric couplings in finite-sized networks. Examples include reconstruction of couplings from the observed dynamics, representation of probability distributions for sampling-based inference, and learning in the central nervous system based on the dynamic and correlation-dependent modification of synaptic connections. The systematic cumulant expansion for kinetic binary (Ising) threshold units with strong, random, and asymmetric couplings presented here goes beyond mean-field theory and is applicable outside thermodynamic equilibrium; a system of approximate nonlinear equations predicts average activities and pairwise covariances in quantitative agreement with full simulations down to hundreds of units. The linearized theory yields an expansion of the correlation and response functions in collective eigenmodes, leads to an efficient algorithm solving the inverse problem, and shows that correlations are invariant under scaling of the interaction strengths.

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.

Efficiently and easily integrating differential equations with JiTCODE, JiTCDDE, and JiTCSDE

NASA Astrophysics Data System (ADS)

Ansmann, Gerrit

2018-04-01

We present a family of Python modules for the numerical integration of ordinary, delay, or stochastic differential equations. The key features are that the user enters the derivative symbolically and it is just-in-time-compiled, allowing the user to efficiently integrate differential equations from a higher-level interpreted language. The presented modules are particularly suited for large systems of differential equations such as those used to describe dynamics on complex networks. Through the selected method of input, the presented modules also allow almost complete automatization of the process of estimating regular as well as transversal Lyapunov exponents for ordinary and delay differential equations. We conceptually discuss the modules' design, analyze their performance, and demonstrate their capabilities by application to timely problems.

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.

Modelling and prediction for chaotic fir laser attractor using rational function neural network.

PubMed

Cho, S

2001-02-01

Many real-world systems such as irregular ECG signal, volatility of currency exchange rate and heated fluid reaction exhibit highly complex nonlinear characteristic known as chaos. These chaotic systems cannot be retreated satisfactorily using linear system theory due to its high dimensionality and irregularity. This research focuses on prediction and modelling of chaotic FIR (Far InfraRed) laser system for which the underlying equations are not given. This paper proposed a method for prediction and modelling a chaotic FIR laser time series using rational function neural network. Three network architectures, TDNN (Time Delayed Neural Network), RBF (radial basis function) network and the RF (rational function) network, are also presented. Comparisons between these networks performance show the improvements introduced by the RF network in terms of a decrement in network complexity and better ability of predictability.

Order parameter analysis of synchronization transitions on star networks

NASA Astrophysics Data System (ADS)

Chen, Hong-Bin; Sun, Yu-Ting; Gao, Jian; Xu, Can; Zheng, Zhi-Gang

2017-12-01

The collective behaviors of populations of coupled oscillators have attracted significant attention in recent years. In this paper, an order parameter approach is proposed to study the low-dimensional dynamical mechanism of collective synchronizations, by adopting the star-topology of coupled oscillators as a prototype system. The order parameter equation of star-linked phase oscillators can be obtained in terms of the Watanabe-Strogatz transformation, Ott-Antonsen ansatz, and the ensemble order parameter approach. Different solutions of the order parameter equation correspond to the diverse collective states, and different bifurcations reveal various transitions among these collective states. The properties of various transitions in the star-network model are revealed by using tools of nonlinear dynamics such as time reversibility analysis and linear stability analysis.

System Analysis by Mapping a Fault-tree into a Bayesian-network

NASA Astrophysics Data System (ADS)

Sheng, B.; Deng, C.; Wang, Y. H.; Tang, L. H.

2018-05-01

In view of the limitations of fault tree analysis in reliability assessment, Bayesian Network (BN) has been studied as an alternative technology. After a brief introduction to the method for mapping a Fault Tree (FT) into an equivalent BN, equations used to calculate the structure importance degree, the probability importance degree and the critical importance degree are presented. Furthermore, the correctness of these equations is proved mathematically. Combining with an aircraft landing gear’s FT, an equivalent BN is developed and analysed. The results show that richer and more accurate information have been achieved through the BN method than the FT, which demonstrates that the BN is a superior technique in both reliability assessment and fault diagnosis.

Creating Weather System Ensembles Through Synergistic Process Modeling and Machine Learning

NASA Astrophysics Data System (ADS)

Chen, B.; Posselt, D. J.; Nguyen, H.; Wu, L.; Su, H.; Braverman, A. J.

2017-12-01

Earth's weather and climate are sensitive to a variety of control factors (e.g., initial state, forcing functions, etc). Characterizing the response of the atmosphere to a change in initial conditions or model forcing is critical for weather forecasting (ensemble prediction) and climate change assessment. Input - response relationships can be quantified by generating an ensemble of multiple (100s to 1000s) realistic realizations of weather and climate states. Atmospheric numerical models generate simulated data through discretized numerical approximation of the partial differential equations (PDEs) governing the underlying physics. However, the computational expense of running high resolution atmospheric state models makes generation of more than a few simulations infeasible. Here, we discuss an experiment wherein we approximate the numerical PDE solver within the Weather Research and Forecasting (WRF) Model using neural networks trained on a subset of model run outputs. Once trained, these neural nets can produce large number of realization of weather states from a small number of deterministic simulations with speeds that are orders of magnitude faster than the underlying PDE solver. Our neural network architecture is inspired by the governing partial differential equations. These equations are location-invariant, and consist of first and second derivations. As such, we use a 3x3 lon-lat grid of atmospheric profiles as the predictor in the neural net to provide the network the information necessary to compute the first and second moments. Results indicate that the neural network algorithm can approximate the PDE outputs with high degree of accuracy (less than 1% error), and that this error increases as a function of the prediction time lag.

Relativistic analogue of the Newtonian fluid energy equation with nucleosynthesis

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

Cardall, Christian Y.

In Newtonian fluid dynamics simulations in which composition has been tracked by a nuclear reaction network, energy generation due to composition changes has generally been handled as a separate source term in the energy equation. Here, a relativistic equation in conservative form for total fluid energy, obtained from the spacetime divergence of the stress-energy tensor, in principle encompasses such energy generation; but it is not explicitly manifest. An alternative relativistic energy equation in conservative form—in which the nuclear energy generation appears explicitly, and that reduces directly to the Newtonian internal+kinetic energy in the appropriate limit—emerges naturally and self-consistently from themore » difference of the equation for total fluid energy and the equation for baryon number conservation multiplied by the average baryon mass m, when m is expressed in terms of contributions from the nuclear species in the fluid, and allowed to be mutable.« less

Relativistic analogue of the Newtonian fluid energy equation with nucleosynthesis

DOE PAGES

Cardall, Christian Y.

2017-12-15

In Newtonian fluid dynamics simulations in which composition has been tracked by a nuclear reaction network, energy generation due to composition changes has generally been handled as a separate source term in the energy equation. Here, a relativistic equation in conservative form for total fluid energy, obtained from the spacetime divergence of the stress-energy tensor, in principle encompasses such energy generation; but it is not explicitly manifest. An alternative relativistic energy equation in conservative form—in which the nuclear energy generation appears explicitly, and that reduces directly to the Newtonian internal+kinetic energy in the appropriate limit—emerges naturally and self-consistently from themore » difference of the equation for total fluid energy and the equation for baryon number conservation multiplied by the average baryon mass m, when m is expressed in terms of contributions from the nuclear species in the fluid, and allowed to be mutable.« less

An artificial neural network to predict resting energy expenditure in obesity.

PubMed

Disse, Emmanuel; Ledoux, Séverine; Bétry, Cécile; Caussy, Cyrielle; Maitrepierre, Christine; Coupaye, Muriel; Laville, Martine; Simon, Chantal

2017-09-01

The resting energy expenditure (REE) determination is important in nutrition for adequate dietary prescription. The gold standard i.e. indirect calorimetry is not available in clinical settings. Thus, several predictive equations have been developed, but they lack of accuracy in subjects with extreme weight including obese populations. Artificial neural networks (ANN) are useful predictive tools in the area of artificial intelligence, used in numerous clinical fields. The aim of this study was to determine the relevance of ANN in predicting REE in obesity. A Multi-Layer Perceptron (MLP) feed-forward neural network with a back propagation algorithm was created and cross-validated in a cohort of 565 obese subjects (BMI within 30-50 kg m -2 ) with weight, height, sex and age as clinical inputs and REE measured by indirect calorimetry as output. The predictive performances of ANN were compared to those of 23 predictive REE equations in the training set and in two independent sets of 100 and 237 obese subjects for external validation. Among the 23 established prediction equations for REE evaluated, the Harris & Benedict equations recalculated by Roza were the most accurate for the obese population, followed by the USA DRI, Müller and the original Harris & Benedict equations. The final 5-fold cross-validated three-layer 4-3-1 feed-forward back propagation ANN model developed in that study improved precision and accuracy of REE prediction over linear equations (precision = 68.1%, MAPE = 8.6% and RMSPE = 210 kcal/d), independently from BMI subgroups within 30-50 kg m -2 . External validation confirmed the better predictive performances of ANN model (precision = 73% and 65%, MAPE = 7.7% and 8.6%, RMSPE = 187 kcal/d and 200 kcal/d in the 2 independent datasets) for the prediction of REE in obese subjects. We developed and validated an ANN model for the prediction of REE in obese subjects that is more precise and accurate than established REE predictive equations independent from BMI subgroups. For convenient use in clinical settings, we provide a simple ANN-REE calculator available at: https://www.crnh-rhone-alpes.fr/fr/ANN-REE-Calculator. Copyright © 2017 Elsevier Ltd and European Society for Clinical Nutrition and Metabolism. All rights reserved.

Modelling formulations using gene expression programming--a comparative analysis with artificial neural networks.

PubMed

Colbourn, E A; Roskilly, S J; Rowe, R C; York, P

2011-10-09

This study has investigated the utility and potential advantages of gene expression programming (GEP)--a new development in evolutionary computing for modelling data and automatically generating equations that describe the cause-and-effect relationships in a system--to four types of pharmaceutical formulation and compared the models with those generated by neural networks, a technique now widely used in the formulation development. Both methods were capable of discovering subtle and non-linear relationships within the data, with no requirement from the user to specify the functional forms that should be used. Although the neural networks rapidly developed models with higher values for the ANOVA R(2) these were black box and provided little insight into the key relationships. However, GEP, although significantly slower at developing models, generated relatively simple equations describing the relationships that could be interpreted directly. The results indicate that GEP can be considered an effective and efficient modelling technique for formulation data. Copyright © 2011 Elsevier B.V. All rights reserved.

Eliminating fast reactions in stochastic simulations of biochemical networks: A bistable genetic switch

NASA Astrophysics Data System (ADS)

Morelli, Marco J.; Allen, Rosalind J.; Tǎnase-Nicola, Sorin; ten Wolde, Pieter Rein

2008-01-01

In many stochastic simulations of biochemical reaction networks, it is desirable to "coarse grain" the reaction set, removing fast reactions while retaining the correct system dynamics. Various coarse-graining methods have been proposed, but it remains unclear which methods are reliable and which reactions can safely be eliminated. We address these issues for a model gene regulatory network that is particularly sensitive to dynamical fluctuations: a bistable genetic switch. We remove protein-DNA and/or protein-protein association-dissociation reactions from the reaction set using various coarse-graining strategies. We determine the effects on the steady-state probability distribution function and on the rate of fluctuation-driven switch flipping transitions. We find that protein-protein interactions may be safely eliminated from the reaction set, but protein-DNA interactions may not. We also find that it is important to use the chemical master equation rather than macroscopic rate equations to compute effective propensity functions for the coarse-grained reactions.

A 1D thermomechanical network transition constitutive model coupled with multiple structural relaxation for shape memory polymers

NASA Astrophysics Data System (ADS)

Zeng, Hao; Xie, Zhimin; Gu, Jianping; Sun, Huiyu

2018-03-01

A new thermomechanical network transition constitutive model is proposed in the study to describe the viscoelastic behavior of shape memory polymers (SMPs). Based on the microstructure of semi-crystalline SMPs, a new simplified transformation equation is proposed to describe the transform of transient networks. And the generalized fractional Maxwell model is introduced in the paper to estimate the temperature-dependent storage modulus. In addition, a neo-KAHR theory with multiple discrete relaxation processes is put forward to study the structural relaxation of the nonlinear thermal strain in cooling/heating processes. The evolution equations of the time- and temperature-dependent stress and strain response are developed. In the model, the thermodynamical and mechanical characteristics of SMPs in the typical thermomechanical cycle are described clearly and the irreversible deformation is studied in detail. Finally, the typical thermomechanical cycles are simulated using the present constitutive model, and the simulation results agree well with the experimental results.

Toward a generalized theory of epidemic awareness in social networks

NASA Astrophysics Data System (ADS)

Wu, Qingchu; Zhu, Wenfang

We discuss the dynamics of a susceptible-infected-susceptible (SIS) model with local awareness in networks. Individual awareness to the infectious disease is characterized by a general function of epidemic information in its neighborhood. We build a high-accuracy approximate equation governing the spreading dynamics and derive an approximate epidemic threshold above which the epidemic spreads over the whole network. Our results extend the previous work and show that the epidemic threshold is dependent on the awareness function in terms of one infectious neighbor. Interestingly, when a pow-law awareness function is chosen, the epidemic threshold can emerge in infinite networks.

The analysis of HIV/AIDS drug-resistant on networks

NASA Astrophysics Data System (ADS)

Liu, Maoxing

2014-01-01

In this paper, we present an Human Immunodeficiency Virus (HIV)/Acquired Immune Deficiency Syndrome (AIDS) drug-resistant model using an ordinary differential equation (ODE) model on scale-free networks. We derive the threshold for the epidemic to be zero in infinite scale-free network. We also prove the stability of disease-free equilibrium (DFE) and persistence of HIV/AIDS infection. The effects of two immunization schemes, including proportional scheme and targeted vaccination, are studied and compared. We find that targeted strategy compare favorably to a proportional condom using has prominent effect to control HIV/AIDS spread on scale-free networks.

Successful emotion regulation is predicted by amygdala activity and aspects of personality: A latent variable approach.

PubMed

Morawetz, Carmen; Alexandrowicz, Rainer W; Heekeren, Hauke R

2017-04-01

The experience of emotions and their cognitive control are based upon neural responses in prefrontal and subcortical regions and could be affected by personality and temperamental traits. Previous studies established an association between activity in reappraisal-related brain regions (e.g., inferior frontal gyrus and amygdala) and emotion regulation success. Given these relationships, we aimed to further elucidate how individual differences in emotion regulation skills relate to brain activity within the emotion regulation network on the one hand, and personality/temperamental traits on the other. We directly examined the relationship between personality and temperamental traits, emotion regulation success and its underlying neuronal network in a large sample (N = 82) using an explicit emotion regulation task and functional MRI (fMRI). We applied a multimethodological analysis approach, combing standard activation-based analyses with structural equation modeling. First, we found that successful downregulation is predicted by activity in key regions related to emotion processing. Second, the individual ability to successfully upregulate emotions is strongly associated with the ability to identify feelings, conscientiousness, and neuroticism. Third, the successful downregulation of emotion is modulated by openness to experience and habitual use of reappraisal. Fourth, the ability to regulate emotions is best predicted by a combination of brain activity and personality as well temperamental traits. Using a multimethodological analysis approach, we provide a first step toward a causal model of individual differences in emotion regulation ability by linking biological systems underlying emotion regulation with descriptive constructs. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

A mathematical model of the mevalonate cholesterol biosynthesis pathway.

PubMed

Pool, Frances; Currie, Richard; Sweby, Peter K; Salazar, José Domingo; Tindall, Marcus J

2018-04-14

We formulate, parameterise and analyse a mathematical model of the mevalonate pathway, a key pathway in the synthesis of cholesterol. Of high clinical importance, the pathway incorporates rate limiting enzymatic reactions with multiple negative feedbacks. In this work we investigate the pathway dynamics and demonstrate that rate limiting steps and negative feedbacks within it act in concert to tightly regulate intracellular cholesterol levels. Formulated using the theory of nonlinear ordinary differential equations and parameterised in the context of a hepatocyte, the governing equations are analysed numerically and analytically. Sensitivity and mathematical analysis demonstrate the importance of the two rate limiting enzymes 3-hydroxy-3-methylglutaryl-CoA reductase and squalene synthase in controlling the concentration of substrates within the pathway as well as that of cholesterol. The role of individual feedbacks, both global (between that of cholesterol and sterol regulatory element-binding protein 2; SREBP-2) and local internal (between substrates in the pathway) are investigated. We find that whilst the cholesterol SREBP-2 feedback regulates the overall system dynamics, local feedbacks activate within the pathway to tightly regulate the overall cellular cholesterol concentration. The network stability is analysed by constructing a reduced model of the full pathway and is shown to exhibit one real, stable steady-state. We close by addressing the biological question as to how farnesyl-PP levels are affected by CYP51 inhibition, and demonstrate that the regulatory mechanisms within the network work in unison to ensure they remain bounded. Copyright © 2018 Elsevier Ltd. All rights reserved.

Spatial evolutionary public goods game on complete graph and dense complex networks

NASA Astrophysics Data System (ADS)

Kim, Jinho; Chae, Huiseung; Yook, Soon-Hyung; Kim, Yup

2015-03-01

We study the spatial evolutionary public goods game (SEPGG) with voluntary or optional participation on a complete graph (CG) and on dense networks. Based on analyses of the SEPGG rate equation on finite CG, we find that SEPGG has two stable states depending on the value of multiplication factor r, illustrating how the ``tragedy of the commons'' and ``an anomalous state without any active participants'' occurs in real-life situations. When r is low (), the state with only loners is stable, and the state with only defectors is stable when r is high (). We also derive the exact scaling relation for r*. All of the results are confirmed by numerical simulation. Furthermore, we find that a cooperator-dominant state emerges when the number of participants or the mean degree, , decreases. We also investigate the scaling dependence of the emergence of cooperation on r and . These results show how ``tragedy of the commons'' disappears when cooperation between egoistic individuals without any additional socioeconomic punishment increases.

Global Hopf bifurcation analysis on a BAM neural network with delays

NASA Astrophysics Data System (ADS)

Sun, Chengjun; Han, Maoan; Pang, Xiaoming

2007-01-01

A delayed differential equation that models a bidirectional associative memory (BAM) neural network with four neurons is considered. By using a global Hopf bifurcation theorem for FDE and a Bendixon's criterion for high-dimensional ODE, a group of sufficient conditions for the system to have multiple periodic solutions are obtained when the sum of delays is sufficiently large.

Using steady-state equations for transient flow calculation in natural gas pipelines

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

Maddox, R.N.; Zhou, P.

1984-04-02

Maddox and Zhou have extended their technique for calculating the unsteady-state behavior of straight gas pipelines to complex pipeline systems and networks. After developing the steady-state flow rate and pressure profile for each pipe in the network, analysts can perform the transient-state analysis in the real-time step-wise manner described for this technique.

Extended Kalman Filter for Estimation of Parameters in Nonlinear State-Space Models of Biochemical Networks

PubMed Central

Sun, Xiaodian; Jin, Li; Xiong, Momiao

2008-01-01

It is system dynamics that determines the function of cells, tissues and organisms. To develop mathematical models and estimate their parameters are an essential issue for studying dynamic behaviors of biological systems which include metabolic networks, genetic regulatory networks and signal transduction pathways, under perturbation of external stimuli. In general, biological dynamic systems are partially observed. Therefore, a natural way to model dynamic biological systems is to employ nonlinear state-space equations. Although statistical methods for parameter estimation of linear models in biological dynamic systems have been developed intensively in the recent years, the estimation of both states and parameters of nonlinear dynamic systems remains a challenging task. In this report, we apply extended Kalman Filter (EKF) to the estimation of both states and parameters of nonlinear state-space models. To evaluate the performance of the EKF for parameter estimation, we apply the EKF to a simulation dataset and two real datasets: JAK-STAT signal transduction pathway and Ras/Raf/MEK/ERK signaling transduction pathways datasets. The preliminary results show that EKF can accurately estimate the parameters and predict states in nonlinear state-space equations for modeling dynamic biochemical networks. PMID:19018286

Nonlinear dynamic evolution and control in CCFN with mixed attachment mechanisms

NASA Astrophysics Data System (ADS)

Wang, Jianrong; Wang, Jianping; Han, Dun

2017-01-01

In recent years, wireless communication plays an important role in our lives. Cooperative communication, is used by a mobile station with single antenna to share with each other forming a virtual MIMO antenna system, will become a development with a diversity gain for wireless communication in tendency future. In this paper, a fitness model of evolution network based on complex networks with mixed attachment mechanisms is devised in order to study an actual network-CCFN (cooperative communication fitness network). Firstly, the evolution of CCFN is given by four cases with different probabilities, and the rate equations of nodes degree are presented to analyze the evolution of CCFN. Secondly, the degree distribution is analyzed by calculating the rate equation and numerical simulation with the examples of four fitness distributions such as power law, uniform fitness distribution, exponential fitness distribution and Rayleigh fitness distribution. Finally, the robustness of CCFN is studied by numerical simulation with four fitness distributions under random attack and intentional attack to analyze the effects of degree distribution, average path length and average degree. The results of this paper offers insights for building CCFN systems in order to program communication resources.

Electric Current Flow Through Two-Dimensional Networks

NASA Astrophysics Data System (ADS)

Gaspard, Mallory

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

Application guide for AFINCH (Analysis of Flows in Networks of Channels) described by NHDPlus

USGS Publications Warehouse

Holtschlag, David J.

2009-01-01

AFINCH (Analysis of Flows in Networks of CHannels) is a computer application that can be used to generate a time series of monthly flows at stream segments (flowlines) and water yields for catchments defined in the National Hydrography Dataset Plus (NHDPlus) value-added attribute system. AFINCH provides a basis for integrating monthly flow data from streamgages, water-use data, monthly climatic data, and land-cover characteristics to estimate natural monthly water yields from catchments by user-defined regression equations. Images of monthly water yields for active streamgages are generated in AFINCH and provide a basis for detecting anomalies in water yields, which may be associated with undocumented flow diversions or augmentations. Water yields are multiplied by the drainage areas of the corresponding catchments to estimate monthly flows. Flows from catchments are accumulated downstream through the streamflow network described by the stream segments. For stream segments where streamgages are active, ratios of measured to accumulated flows are computed. These ratios are applied to upstream water yields to proportionally adjust estimated flows to match measured flows. Flow is conserved through the NHDPlus network. A time series of monthly flows can be generated for stream segments that average about 1-mile long, or monthly water yields from catchments that average about 1 square mile. Estimated monthly flows can be displayed within AFINCH, examined for nonstationarity, and tested for monotonic trends. Monthly flows also can be used to estimate flow-duration characteristics at stream segments. AFINCH generates output files of monthly flows and water yields that are compatible with ArcMap, a geographical information system analysis and display environment. Chloropleth maps of monthly water yield and flow can be generated and analyzed within ArcMap by joining NHDPlus data structures with AFINCH output. Matlab code for the AFINCH application is presented.

Brain without mind: Computer simulation of neural networks with modifiable neuronal interactions

NASA Astrophysics Data System (ADS)

Clark, John W.; Rafelski, Johann; Winston, Jeffrey V.

1985-07-01

Aspects of brain function are examined in terms of a nonlinear dynamical system of highly interconnected neuron-like binary decision elements. The model neurons operate synchronously in discrete time, according to deterministic or probabilistic equations of motion. Plasticity of the nervous system, which underlies such cognitive collective phenomena as adaptive development, learning, and memory, is represented by temporal modification of interneuronal connection strengths depending on momentary or recent neural activity. A formal basis is presented for the construction of local plasticity algorithms, or connection-modification routines, spanning a large class. To build an intuitive understanding of the behavior of discrete-time network models, extensive computer simulations have been carried out (a) for nets with fixed, quasirandom connectivity and (b) for nets with connections that evolve under one or another choice of plasticity algorithm. From the former experiments, insights are gained concerning the spontaneous emergence of order in the form of cyclic modes of neuronal activity. In the course of the latter experiments, a simple plasticity routine (“brainwashing,” or “anti-learning”) was identified which, applied to nets with initially quasirandom connectivity, creates model networks which provide more felicitous starting points for computer experiments on the engramming of content-addressable memories and on learning more generally. The potential relevance of this algorithm to developmental neurobiology and to sleep states is discussed. The model considered is at the same time a synthesis of earlier synchronous neural-network models and an elaboration upon them; accordingly, the present article offers both a focused review of the dynamical properties of such systems and a selection of new findings derived from computer simulation.

Scale-invariance underlying the logistic equation and its social applications

NASA Astrophysics Data System (ADS)

Hernando, A.; Plastino, A.

2013-01-01

On the basis of dynamical principles we i) advance a derivation of the Logistic Equation (LE), widely employed (among multiple applications) in the simulation of population growth, and ii) demonstrate that scale-invariance and a mean-value constraint are sufficient and necessary conditions for obtaining it. We also generalize the LE to multi-component systems and show that the above dynamical mechanisms underlie a large number of scale-free processes. Examples are presented regarding city-populations, diffusion in complex networks, and popularity of technological products, all of them obeying the multi-component logistic equation in an either stochastic or deterministic way.

Characteristics of cosmic ray pole-equator anisotropy derived from spherical harmonic analysis of neutron monitor data

NASA Technical Reports Server (NTRS)

Takahashi, H.; Yahagi, N.

1985-01-01

The spherical harmonic analysis of cosmic ray neutron data from the worldwide network neutron monitor stations during the years, 1966 to 1969 was carried out. The second zonal harmonic component obtained from the analysis corresponds to the Pole-Equator anisotropy of the cosmic ray neutron intensity. Such an anisotropy makes a semiannual variation. In addition to this, it is shown that the Pole-Equator anisotropy makes a variation depending on the interplanetary magnetic field (IMF) sector polarities around the passages of the IMF sector boundary. A mechanism to interpret these results is also discussed.

From Heuristic to Mathematical Modeling of Drugs Dissolution Profiles: Application of Artificial Neural Networks and Genetic Programming

PubMed Central

Mendyk, Aleksander; Güres, Sinan; Szlęk, Jakub; Wiśniowska, Barbara; Kleinebudde, Peter

2015-01-01

The purpose of this work was to develop a mathematical model of the drug dissolution (Q) from the solid lipid extrudates based on the empirical approach. Artificial neural networks (ANNs) and genetic programming (GP) tools were used. Sensitivity analysis of ANNs provided reduction of the original input vector. GP allowed creation of the mathematical equation in two major approaches: (1) direct modeling of Q versus extrudate diameter (d) and the time variable (t) and (2) indirect modeling through Weibull equation. ANNs provided also information about minimum achievable generalization error and the way to enhance the original dataset used for adjustment of the equations' parameters. Two inputs were found important for the drug dissolution: d and t. The extrudates length (L) was found not important. Both GP modeling approaches allowed creation of relatively simple equations with their predictive performance comparable to the ANNs (root mean squared error (RMSE) from 2.19 to 2.33). The direct mode of GP modeling of Q versus d and t resulted in the most robust model. The idea of how to combine ANNs and GP in order to escape ANNs' black-box drawback without losing their superior predictive performance was demonstrated. Open Source software was used to deliver the state-of-the-art models and modeling strategies. PMID:26101544

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.

Statistical mechanics of unsupervised feature learning in a restricted Boltzmann machine with binary synapses

NASA Astrophysics Data System (ADS)

Huang, Haiping

2017-05-01

Revealing hidden features in unlabeled data is called unsupervised feature learning, which plays an important role in pretraining a deep neural network. Here we provide a statistical mechanics analysis of the unsupervised learning in a restricted Boltzmann machine with binary synapses. A message passing equation to infer the hidden feature is derived, and furthermore, variants of this equation are analyzed. A statistical analysis by replica theory describes the thermodynamic properties of the model. Our analysis confirms an entropy crisis preceding the non-convergence of the message passing equation, suggesting a discontinuous phase transition as a key characteristic of the restricted Boltzmann machine. Continuous phase transition is also confirmed depending on the embedded feature strength in the data. The mean-field result under the replica symmetric assumption agrees with that obtained by running message passing algorithms on single instances of finite sizes. Interestingly, in an approximate Hopfield model, the entropy crisis is absent, and a continuous phase transition is observed instead. We also develop an iterative equation to infer the hyper-parameter (temperature) hidden in the data, which in physics corresponds to iteratively imposing Nishimori condition. Our study provides insights towards understanding the thermodynamic properties of the restricted Boltzmann machine learning, and moreover important theoretical basis to build simplified deep networks.

From Heuristic to Mathematical Modeling of Drugs Dissolution Profiles: Application of Artificial Neural Networks and Genetic Programming.

PubMed

Mendyk, Aleksander; Güres, Sinan; Jachowicz, Renata; Szlęk, Jakub; Polak, Sebastian; Wiśniowska, Barbara; Kleinebudde, Peter

2015-01-01

The purpose of this work was to develop a mathematical model of the drug dissolution (Q) from the solid lipid extrudates based on the empirical approach. Artificial neural networks (ANNs) and genetic programming (GP) tools were used. Sensitivity analysis of ANNs provided reduction of the original input vector. GP allowed creation of the mathematical equation in two major approaches: (1) direct modeling of Q versus extrudate diameter (d) and the time variable (t) and (2) indirect modeling through Weibull equation. ANNs provided also information about minimum achievable generalization error and the way to enhance the original dataset used for adjustment of the equations' parameters. Two inputs were found important for the drug dissolution: d and t. The extrudates length (L) was found not important. Both GP modeling approaches allowed creation of relatively simple equations with their predictive performance comparable to the ANNs (root mean squared error (RMSE) from 2.19 to 2.33). The direct mode of GP modeling of Q versus d and t resulted in the most robust model. The idea of how to combine ANNs and GP in order to escape ANNs' black-box drawback without losing their superior predictive performance was demonstrated. Open Source software was used to deliver the state-of-the-art models and modeling strategies.

Electrical network method for the thermal or structural characterization of a conducting material sample or structure

DOEpatents

Ortiz, Marco G.

1993-01-01

A method for modeling a conducting material sample or structure system, as an electrical network of resistances in which each resistance of the network is representative of a specific physical region of the system. The method encompasses measuring a resistance between two external leads and using this measurement in a series of equations describing the network to solve for the network resistances for a specified region and temperature. A calibration system is then developed using the calculated resistances at specified temperatures. This allows for the translation of the calculated resistances to a region temperature. The method can also be used to detect and quantify structural defects in the system.

Electrical network method for the thermal or structural characterization of a conducting material sample or structure

DOEpatents

Ortiz, M.G.

1993-06-08

A method for modeling a conducting material sample or structure system, as an electrical network of resistances in which each resistance of the network is representative of a specific physical region of the system. The method encompasses measuring a resistance between two external leads and using this measurement in a series of equations describing the network to solve for the network resistances for a specified region and temperature. A calibration system is then developed using the calculated resistances at specified temperatures. This allows for the translation of the calculated resistances to a region temperature. The method can also be used to detect and quantify structural defects in the system.

Subjective well-being associated with size of social network and social support of elderly.

PubMed

Wang, Xingmin

2016-06-01

The current study examined the impact of size of social network on subjective well-being of elderly, mainly focused on confirmation of the mediator role of perceived social support. The results revealed that both size of social network and perceived social support were significantly correlated with subjective well-being. Structural equation modeling indicated that perceived social support partially mediated size of social network to subjective well-being. The final model also revealed significant both paths from size of social network to subjective well-being through perceived social support. The findings extended prior researches and provided valuable evidence on how to promote mental health of the elderly. © The Author(s) 2014.

ACCURATE CHEMICAL MASTER EQUATION SOLUTION USING MULTI-FINITE BUFFERS

PubMed Central

Cao, Youfang; Terebus, Anna; Liang, Jie

2016-01-01

The discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multi-scale nature of many networks where reaction rates have large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the Accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multi-finite buffers for reducing the state space by O(n!), exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes, and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be pre-computed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multi-scale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks. PMID:27761104

Comparison of ultrasonic with stirrer performance for removal of sunset yellow (SY) by activated carbon prepared from wood of orange tree: artificial neural network modeling.

PubMed

Ghaedi, A M; Ghaedi, M; Karami, P

2015-03-05

The present work focused on the removal of sunset yellow (SY) dye from aqueous solution by ultrasound-assisted adsorption and stirrer by activated carbon prepared from wood of an orange tree. Also, the artificial neural network (ANN) model was used for predicting removal (%) of SY dye based on experimental data. In this study a green approach was described for the synthesis of activated carbon prepared from wood of an orange tree and usability of it for the removal of sunset yellow. This material was characterized using scanning electron microscopy (SEM) and transmission electron microscopy (TEM). The impact of variables, including initial dye concentration (mg/L), pH, adsorbent dosage (g), sonication time (min) and temperature (°C) on SY removal were studied. Fitting the experimental equilibrium data of different isotherm models such as Langmuir, Freundlich, Temkin and Dubinin-Radushkevich models display the suitability and applicability of the Langmuir model. Analysis of experimental adsorption data by different kinetic models including pseudo-first and second order, Elovich and intraparticle diffusion models indicate the applicability of the second-order equation model. The adsorbent (0.5g) is applicable for successful removal of SY (>98%) in short time (10min) under ultrasound condition. Copyright © 2014 Elsevier B.V. All rights reserved.

A Phenomenological Synapse Model for Asynchronous Neurotransmitter Release

PubMed Central

Wang, Tao; Yin, Luping; Zou, Xiaolong; Shu, Yousheng; Rasch, Malte J.; Wu, Si

2016-01-01

Neurons communicate with each other via synapses. Action potentials cause release of neurotransmitters at the axon terminal. Typically, this neurotransmitter release is tightly time-locked to the arrival of an action potential and is thus called synchronous release. However, neurotransmitter release is stochastic and the rate of release of small quanta of neurotransmitters can be considerably elevated even long after the ceasing of spiking activity, leading to asynchronous release of neurotransmitters. Such asynchronous release varies for tissue and neuron types and has been shown recently to be pronounced in fast-spiking neurons. Notably, it was found that asynchronous release is enhanced in human epileptic tissue implicating a possibly important role in generating abnormal neural activity. Current neural network models for simulating and studying neural activity virtually only consider synchronous release and ignore asynchronous transmitter release. Here, we develop a phenomenological model for asynchronous neurotransmitter release, which, on one hand, captures the fundamental features of the asynchronous release process, and, on the other hand, is simple enough to be incorporated in large-size network simulations. Our proposed model is based on the well-known equations for short-term dynamical synaptic interactions and includes an additional stochastic term for modeling asynchronous release. We use experimental data obtained from inhibitory fast-spiking synapses of human epileptic tissue to fit the model parameters, and demonstrate that our model reproduces the characteristics of realistic asynchronous transmitter release. PMID:26834617

Establishing the resting state default mode network derived from functional magnetic resonance imaging tasks as an endophenotype: A twins study.

PubMed

Korgaonkar, Mayuresh S; Ram, Kaushik; Williams, Leanne M; Gatt, Justine M; Grieve, Stuart M

2014-08-01

The resting state default mode network (DMN) has been shown to characterize a number of neurological and psychiatric disorders. Evidence suggests an underlying genetic basis for this network and hence could serve as potential endophenotype for these disorders. Heritability is a defining criterion for endophenotypes. The DMN is measured either using a resting-state functional magnetic resonance imaging (fMRI) scan or by extracting resting state activity from task-based fMRI. The current study is the first to evaluate heritability of this task-derived resting activity. 250 healthy adult twins (79 monozygotic and 46 dizygotic same sex twin pairs) completed five cognitive and emotion processing fMRI tasks. Resting state DMN functional connectivity was derived from these five fMRI tasks. We validated this approach by comparing connectivity estimates from task-derived resting activity for all five fMRI tasks, with those obtained using a dedicated task-free resting state scan in an independent cohort of 27 healthy individuals. Structural equation modeling using the classic twin design was used to estimate the genetic and environmental contributions to variance for the resting-state DMN functional connectivity. About 9-41% of the variance in functional connectivity between the DMN nodes was attributed to genetic contribution with the greatest heritability found for functional connectivity between the posterior cingulate and right inferior parietal nodes (P<0.001). Our data provide new evidence that functional connectivity measures from the intrinsic DMN derived from task-based fMRI datasets are under genetic control and have the potential to serve as endophenotypes for genetically predisposed psychiatric and neurological disorders. Copyright © 2014 Wiley Periodicals, Inc.

Investigation of an artificial intelligence technology--Model trees. Novel applications for an immediate release tablet formulation database.

PubMed

Shao, Q; Rowe, R C; York, P

2007-06-01

This study has investigated an artificial intelligence technology - model trees - as a modelling tool applied to an immediate release tablet formulation database. The modelling performance was compared with artificial neural networks that have been well established and widely applied in the pharmaceutical product formulation fields. The predictability of generated models was validated on unseen data and judged by correlation coefficient R(2). Output from the model tree analyses produced multivariate linear equations which predicted tablet tensile strength, disintegration time, and drug dissolution profiles of similar quality to neural network models. However, additional and valuable knowledge hidden in the formulation database was extracted from these equations. It is concluded that, as a transparent technology, model trees are useful tools to formulators.

Robust criticality of an Ising model on rewired directed networks

NASA Astrophysics Data System (ADS)

Lipowski, Adam; Gontarek, Krzysztof; Lipowska, Dorota

2015-06-01

We show that preferential rewiring, which is supposed to mimic the behavior of financial agents, changes a directed-network Ising ferromagnet with a single critical point into a model with robust critical behavior. For the nonrewired random graph version, due to a constant number of out-links for each site, we write a simple mean-field-like equation describing the behavior of magnetization; we argue that it is exact and support the claim with extensive Monte Carlo simulations. For the rewired version, this equation is obeyed only at low temperatures. At higher temperatures, rewiring leads to strong heterogeneities, which apparently invalidates mean-field arguments and induces large fluctuations and divergent susceptibility. Such behavior is traced back to the formation of a relatively small core of agents that influence the entire system.

Dynamic Photorefractive Memory and its Application for Opto-Electronic Neural Networks.

NASA Astrophysics Data System (ADS)

Sasaki, Hironori

This dissertation describes the analysis of the photorefractive crystal dynamics and its application for opto-electronic neural network systems. The realization of the dynamic photorefractive memory is investigated in terms of the following aspects: fast memory update, uniform grating multiplexing schedules and the prevention of the partial erasure of existing gratings. The fast memory update is realized by the selective erasure process that superimposes a new grating on the original one with an appropriate phase shift. The dynamics of the selective erasure process is analyzed using the first-order photorefractive material equations and experimentally confirmed. The effects of beam coupling and fringe bending on the selective erasure dynamics are also analyzed by numerically solving a combination of coupled wave equations and the photorefractive material equation. Incremental recording technique is proposed as a uniform grating multiplexing schedule and compared with the conventional scheduled recording technique in terms of phase distribution in the presence of an external dc electric field, as well as the image gray scale dependence. The theoretical analysis and experimental results proved the superiority of the incremental recording technique over the scheduled recording. Novel recirculating information memory architecture is proposed and experimentally demonstrated to prevent partial degradation of the existing gratings by accessing the memory. Gratings are circulated through a memory feed back loop based on the incremental recording dynamics and demonstrate robust read/write/erase capabilities. The dynamic photorefractive memory is applied to opto-electronic neural network systems. Module architecture based on the page-oriented dynamic photorefractive memory is proposed. This module architecture can implement two complementary interconnection organizations, fan-in and fan-out. The module system scalability and the learning capabilities are theoretically investigated using the photorefractive dynamics described in previous chapters of the dissertation. The implementation of the feed-forward image compression network with 900 input and 9 output neurons with 6-bit interconnection accuracy is experimentally demonstrated. Learning of the Perceptron network that determines sex based on input face images of 900 pixels is also successfully demonstrated.

Adaptive robust control of a class of non-affine variable-speed variable-pitch wind turbines with unmodeled dynamics.

PubMed

Bagheri, Pedram; Sun, Qiao

2016-07-01

In this paper, a novel synthesis of Nussbaum-type functions, and an adaptive radial-basis function neural network is proposed to design controllers for variable-speed, variable-pitch wind turbines. Dynamic equations of the wind turbine are highly nonlinear, uncertain, and affected by unknown disturbance sources. Furthermore, the dynamic equations are non-affine with respect to the pitch angle, which is a control input. To address these problems, a Nussbaum-type function, along with a dynamic control law are adopted to resolve the non-affine nature of the equations. Moreover, an adaptive radial-basis function neural network is designed to approximate non-parametric uncertainties. Further, the closed-loop system is made robust to unknown disturbance sources, where no prior knowledge of disturbance bound is assumed in advance. Finally, the Lyapunov stability analysis is conducted to show the stability of the entire closed-loop system. In order to verify analytical results, a simulation is presented and the results are compared to both a PI and an existing adaptive controllers. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

A variational approach to moment-closure approximations for the kinetics of biomolecular reaction networks

NASA Astrophysics Data System (ADS)

Bronstein, Leo; Koeppl, Heinz

2018-01-01

Approximate solutions of the chemical master equation and the chemical Fokker-Planck equation are an important tool in the analysis of biomolecular reaction networks. Previous studies have highlighted a number of problems with the moment-closure approach used to obtain such approximations, calling it an ad hoc method. In this article, we give a new variational derivation of moment-closure equations which provides us with an intuitive understanding of their properties and failure modes and allows us to correct some of these problems. We use mixtures of product-Poisson distributions to obtain a flexible parametric family which solves the commonly observed problem of divergences at low system sizes. We also extend the recently introduced entropic matching approach to arbitrary ansatz distributions and Markov processes, demonstrating that it is a special case of variational moment closure. This provides us with a particularly principled approximation method. Finally, we extend the above approaches to cover the approximation of multi-time joint distributions, resulting in a viable alternative to process-level approximations which are often intractable.

Boundary Control of Linear Uncertain 1-D Parabolic PDE Using Approximate Dynamic Programming.

PubMed

Talaei, Behzad; Jagannathan, Sarangapani; Singler, John

2018-04-01

This paper develops a near optimal boundary control method for distributed parameter systems governed by uncertain linear 1-D parabolic partial differential equations (PDE) by using approximate dynamic programming. A quadratic surface integral is proposed to express the optimal cost functional for the infinite-dimensional state space. Accordingly, the Hamilton-Jacobi-Bellman (HJB) equation is formulated in the infinite-dimensional domain without using any model reduction. Subsequently, a neural network identifier is developed to estimate the unknown spatially varying coefficient in PDE dynamics. Novel tuning law is proposed to guarantee the boundedness of identifier approximation error in the PDE domain. A radial basis network (RBN) is subsequently proposed to generate an approximate solution for the optimal surface kernel function online. The tuning law for near optimal RBN weights is created, such that the HJB equation error is minimized while the dynamics are identified and closed-loop system remains stable. Ultimate boundedness (UB) of the closed-loop system is verified by using the Lyapunov theory. The performance of the proposed controller is successfully confirmed by simulation on an unstable diffusion-reaction process.

HiDi: an efficient reverse engineering schema for large-scale dynamic regulatory network reconstruction using adaptive differentiation.

PubMed

Deng, Yue; Zenil, Hector; Tegnér, Jesper; Kiani, Narsis A

2017-12-15

The use of differential equations (ODE) is one of the most promising approaches to network inference. The success of ODE-based approaches has, however, been limited, due to the difficulty in estimating parameters and by their lack of scalability. Here, we introduce a novel method and pipeline to reverse engineer gene regulatory networks from gene expression of time series and perturbation data based upon an improvement on the calculation scheme of the derivatives and a pre-filtration step to reduce the number of possible links. The method introduces a linear differential equation model with adaptive numerical differentiation that is scalable to extremely large regulatory networks. We demonstrate the ability of this method to outperform current state-of-the-art methods applied to experimental and synthetic data using test data from the DREAM4 and DREAM5 challenges. Our method displays greater accuracy and scalability. We benchmark the performance of the pipeline with respect to dataset size and levels of noise. We show that the computation time is linear over various network sizes. The Matlab code of the HiDi implementation is available at: www.complexitycalculator.com/HiDiScript.zip. hzenilc@gmail.com or narsis.kiani@ki.se. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com

Predictive fault-tolerant control of an all-thruster satellite in 6-DOF motion via neural network model updating

NASA Astrophysics Data System (ADS)

Tavakoli, M. M.; Assadian, N.

2018-03-01

The problem of controlling an all-thruster spacecraft in the coupled translational-rotational motion in presence of actuators fault and/or failure is investigated in this paper. The nonlinear model predictive control approach is used because of its ability to predict the future behavior of the system. The fault/failure of the thrusters changes the mapping between the commanded forces to the thrusters and actual force/torque generated by the thruster system. Thus, the basic six degree-of-freedom kinetic equations are separated from this mapping and a set of neural networks are trained off-line to learn the kinetic equations. Then, two neural networks are attached to these trained networks in order to learn the thruster commands to force/torque mappings on-line. Different off-nominal conditions are modeled so that neural networks can detect any failure and fault, including scale factor and misalignment of thrusters. A simple model of the spacecraft relative motion is used in MPC to decrease the computational burden. However, a precise model by the means of orbit propagation including different types of perturbation is utilized to evaluate the usefulness of the proposed approach in actual conditions. The numerical simulation shows that this method can successfully control the all-thruster spacecraft with ON-OFF thrusters in different combinations of thruster fault and/or failure.

Continuum Model for River Networks

NASA Astrophysics Data System (ADS)

Giacometti, Achille; Maritan, Amos; Banavar, Jayanth R.

1995-07-01

The effects of erosion, avalanching, and random precipitation are captured in a simple stochastic partial differential equation for modeling the evolution of river networks. Our model leads to a self-organized structured landscape and to abstraction and piracy of the smaller tributaries as the evolution proceeds. An algebraic distribution of the average basin areas and a power law relationship between the drainage basin area and the river length are found.

Fokker-Planck description of conductance-based integrate-and-fire neuronal networks

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

Kovacic, Gregor; Tao, Louis; Rangan, Aaditya V.

2009-08-15

Steady dynamics of coupled conductance-based integrate-and-fire neuronal networks in the limit of small fluctuations is studied via the equilibrium states of a Fokker-Planck equation. An asymptotic approximation for the membrane-potential probability density function is derived and the corresponding gain curves are found. Validity conditions are discussed for the Fokker-Planck description and verified via direct numerical simulations.

Information Product Quality in Network Centric Operations

DTIC Science & Technology

2005-05-01

Signori et al.’ s NCOCF .......................................................................................................1 Figure 2...NCW Conceptual Framework Figure 1. Signori et al.’ s NCOCF 1 perspective, having led to what is currently known as the Network Centric Operations...following equation: T QS δ≥∆ , where is the change in entropy, is the change in heat energy and T is some constant S ∆ Qδ 7 temperature. Whenever heat

Self-Concealment, Social Network Sites Usage, Social Appearance Anxiety, Loneliness of High School Students: A Model Testing

ERIC Educational Resources Information Center

Dogan, Ugur; Çolak, Tugba Seda

2016-01-01

This study was tested a model for explain to social networks sites (SNS) usage with structural equation modeling (SEM). Using SEM on a sample of 475 high school students (35% male, 65% female) students, model was investigated the relationship between self-concealment, social appearance anxiety, loneliness on SNS such as Twitter and Facebook usage.…

Complete synchronization of the global coupled dynamical network induced by Poisson noises.

PubMed

Guo, Qing; Wan, Fangyi

2017-01-01

The different Poisson noise-induced complete synchronization of the global coupled dynamical network is investigated. Based on the stability theory of stochastic differential equations driven by Poisson process, we can prove that Poisson noises can induce synchronization and sufficient conditions are established to achieve complete synchronization with probability 1. Furthermore, numerical examples are provided to show the agreement between theoretical and numerical analysis.

A Generalized Fluid System Simulation Program to Model Flow Distribution in Fluid Networks

NASA Technical Reports Server (NTRS)

Majumdar, Alok; Bailey, John W.; Schallhorn, Paul; Steadman, Todd

1998-01-01

This paper describes a general purpose computer program for analyzing steady state and transient flow in a complex network. The program is capable of modeling phase changes, compressibility, mixture thermodynamics and external body forces such as gravity and centrifugal. The program's preprocessor allows the user to interactively develop a fluid network simulation consisting of nodes and branches. Mass, energy and specie conservation equations are solved at the nodes; the momentum conservation equations are solved in the branches. The program contains subroutines for computing "real fluid" thermodynamic and thermophysical properties for 33 fluids. The fluids are: helium, methane, neon, nitrogen, carbon monoxide, oxygen, argon, carbon dioxide, fluorine, hydrogen, parahydrogen, water, kerosene (RP-1), isobutane, butane, deuterium, ethane, ethylene, hydrogen sulfide, krypton, propane, xenon, R-11, R-12, R-22, R-32, R-123, R-124, R-125, R-134A, R-152A, nitrogen trifluoride and ammonia. The program also provides the options of using any incompressible fluid with constant density and viscosity or ideal gas. Seventeen different resistance/source options are provided for modeling momentum sources or sinks in the branches. These options include: pipe flow, flow through a restriction, non-circular duct, pipe flow with entrance and/or exit losses, thin sharp orifice, thick orifice, square edge reduction, square edge expansion, rotating annular duct, rotating radial duct, labyrinth seal, parallel plates, common fittings and valves, pump characteristics, pump power, valve with a given loss coefficient, and a Joule-Thompson device. The system of equations describing the fluid network is solved by a hybrid numerical method that is a combination of the Newton-Raphson and successive substitution methods. This paper also illustrates the application and verification of the code by comparison with Hardy Cross method for steady state flow and analytical solution for unsteady flow.

Predicting the particle size distribution of eroded sediment using artificial neural networks.

PubMed

Lagos-Avid, María Paz; Bonilla, Carlos A

2017-03-01

Water erosion causes soil degradation and nonpoint pollution. Pollutants are primarily transported on the surfaces of fine soil and sediment particles. Several soil loss models and empirical equations have been developed for the size distribution estimation of the sediment leaving the field, including the physically-based models and empirical equations. Usually, physically-based models require a large amount of data, sometimes exceeding the amount of available data in the modeled area. Conversely, empirical equations do not always predict the sediment composition associated with individual events and may require data that are not always available. Therefore, the objective of this study was to develop a model to predict the particle size distribution (PSD) of eroded soil. A total of 41 erosion events from 21 soils were used. These data were compiled from previous studies. Correlation and multiple regression analyses were used to identify the main variables controlling sediment PSD. These variables were the particle size distribution in the soil matrix, the antecedent soil moisture condition, soil erodibility, and hillslope geometry. With these variables, an artificial neural network was calibrated using data from 29 events (r 2 =0.98, 0.97, and 0.86; for sand, silt, and clay in the sediment, respectively) and then validated and tested on 12 events (r 2 =0.74, 0.85, and 0.75; for sand, silt, and clay in the sediment, respectively). The artificial neural network was compared with three empirical models. The network presented better performance in predicting sediment PSD and differentiating rain-runoff events in the same soil. In addition to the quality of the particle distribution estimates, this model requires a small number of easily obtained variables, providing a convenient routine for predicting PSD in eroded sediment in other pollutant transport models. Copyright © 2017 Elsevier B.V. All rights reserved.

Social network composition of vascular patients and its associations with health behavior and clinical risk factors.

PubMed

Heijmans, Naomi; van Lieshout, Jan; Wensing, Michel

2017-01-01

This study aimed to explore linkages of patients' social network composition with health behaviors and clinical risk factors. This observational study was embedded in a project aimed at improving cardiovascular risk management (CRVM) in primary care. 657 vascular patients (227 with cardiovascular disease, 380 at high vascular risk), mean age 72.4 (SD 9.4) years, were recruited as were individuals patients considered important for dealing with their disease, so called alters (n = 487). Network composition was measured with structured patient questionnaires. Both patients and alters completed questionnaires to measure health behavior (habits for physical activity, diet, and smoking). Clinical risk factors (systolic blood pressure, LDL cholesterol level, and body mass index) were extracted from patients' medical records. Six logistic regression analyses, using generalized estimating equations, were used to test three hypothesized effects of network composition (having alters with healthful behaviors, without depression, and with specialized knowledge) on six outcomes, adjusted for demographic, personal and psychological characteristics. Having alters with overall healthful behavior was related to healthful patient diet (OR 2.14, 95%CI: 1.52-3.02). Having non-smoking alters in networks was related to reduced odds for patient smoking (OR 0.17, 95%CI: 0.05-0.60). No effects of presence of non-depressed alters were found. Presence of alters with specialized knowledge on CVRM was inversely related to healthful diet habits of patients (OR 0.47, 95%CI 0.24-0.89). No significant associations between social network composition and clinical risk factors were found. Diet and smoking, but not physical exercise and clinical risk factors, were associated with social network composition of patients with vascular conditions. In this study of vascular patients, controlling for both personal and psychological factors, fewer network influences were found compared to previous research. Further research is needed to examine network structure characteristics as well as the role of psychological factors to enhance understanding health behavior of patients involved in CVRM.

Overlap in the functional neural systems involved in semantic and episodic memory retrieval.

PubMed

Rajah, M N; McIntosh, A R

2005-03-01

Neuroimaging and neuropsychological data suggest that episodic and semantic memory may be mediated by distinct neural systems. However, an alternative perspective is that episodic and semantic memory represent different modes of processing within a single declarative memory system. To examine whether the multiple or the unitary system view better represents the data we conducted a network analysis using multivariate partial least squares (PLS ) activation analysis followed by covariance structural equation modeling (SEM) of positron emission tomography data obtained while healthy adults performed episodic and semantic verbal retrieval tasks. It is argued that if performance of episodic and semantic retrieval tasks are mediated by different memory systems, then there should differences in both regional activations and interregional correlations related to each type of retrieval task, respectively. The PLS results identified brain regions that were differentially active during episodic retrieval versus semantic retrieval. Regions that showed maximal differences in regional activity between episodic retrieval tasks were used to construct separate functional models for episodic and semantic retrieval. Omnibus tests of these functional models failed to find a significant difference across tasks for both functional models. The pattern of path coefficients for the episodic retrieval model were not different across tasks, nor were the path coefficients for the semantic retrieval model. The SEM results suggest that the same memory network/system was engaged across tasks, given the similarities in path coefficients. Therefore, activation differences between episodic and semantic retrieval may ref lect variation along a continuum of processing during task performance within the context of a single memory system.

MONET: a MOnitoring NEtwork of Telescopes

NASA Astrophysics Data System (ADS)

Hessman, F. V.; Beuermann, K.

2002-01-01

MONET is a planned network of two 1m-class robotic telescopes which will be used for various photometric monitoring projects -- variable stars, planet searches, AGN's, GRB's -- as well as by school children in Germany and over the world. The two host partners, the Univ. of Texas' McDonald Observatory and the South African Astronomical Observatory, will operate the telescopes in exchange for observing time on the network. MONET will be one of the first robotic telescope networks offering 1-m class telescopes, complete coverage of the sky, good longitude coverage for long observing sequences on objects near the celestial equator, and a heavy educational emphasis.

Synchronization of Reaction-Diffusion Neural Networks With Dirichlet Boundary Conditions and Infinite Delays.

PubMed

Sheng, Yin; Zhang, Hao; Zeng, Zhigang

2017-10-01

This paper is concerned with synchronization for a class of reaction-diffusion neural networks with Dirichlet boundary conditions and infinite discrete time-varying delays. By utilizing theories of partial differential equations, Green's formula, inequality techniques, and the concept of comparison, algebraic criteria are presented to guarantee master-slave synchronization of the underlying reaction-diffusion neural networks via a designed controller. Additionally, sufficient conditions on exponential synchronization of reaction-diffusion neural networks with finite time-varying delays are established. The proposed criteria herein enhance and generalize some published ones. Three numerical examples are presented to substantiate the validity and merits of the obtained theoretical results.

Network characteristics, perceived social support, and psychological adjustment in mothers of children with autism spectrum disorder.

PubMed

Benson, Paul R

2012-12-01

This study examined the characteristics of the support networks of 106 mothers of children with ASD and their relationship to perceived social support, depressed mood, and subjective well-being. Using structural equation modeling, two competing sets of hypotheses were assessed: (1) that network characteristics would impact psychological adjustment directly, and (2) that network effects on adjustment would be indirect, mediated by perceived social support. Results primarily lent support to the latter hypotheses, with measures of network structure (network size) and function (proportion of network members providing emotional support) predicting increased levels of perceived social support which, in turn, predicted decreased depressed mood and increased well-being. Results also indicated that increased interpersonal strain in the maternal network was directly and indirectly associated with increased maternal depression, while being indirectly linked to reduced well-being. Study limitations and implications are discussed.

Synchronization in networks with heterogeneous coupling delays

NASA Astrophysics Data System (ADS)

Otto, Andreas; Radons, Günter; Bachrathy, Dániel; Orosz, Gábor

2018-01-01

Synchronization in networks of identical oscillators with heterogeneous coupling delays is studied. A decomposition of the network dynamics is obtained by block diagonalizing a newly introduced adjacency lag operator which contains the topology of the network as well as the corresponding coupling delays. This generalizes the master stability function approach, which was developed for homogenous delays. As a result the network dynamics can be analyzed by delay differential equations with distributed delay, where different delay distributions emerge for different network modes. Frequency domain methods are used for the stability analysis of synchronized equilibria and synchronized periodic orbits. As an example, the synchronization behavior in a system of delay-coupled Hodgkin-Huxley neurons is investigated. It is shown that the parameter regions where synchronized periodic spiking is unstable expand when increasing the delay heterogeneity.

Effects of the oceans on polar motion: Extended investigations

NASA Technical Reports Server (NTRS)

Dickman, Steven R.

1987-01-01

Matrix formulation of the tide equations (pole tide in nonglobal oceans); matrix formulation of the associated boundary conditions (constraints on the tide velocity at coastlines); and FORTRAN encoding of the tide equations excluding boundary conditions were completed. The need for supercomputer facilities was evident. Large versions of the programs were successfully run on the CYBER, submitting the jobs from SUNY through the BITNET network. The code was also restructured to include boundary constraints.

Active motion on curved surfaces

NASA Astrophysics Data System (ADS)

Castro-Villarreal, Pavel; Sevilla, Francisco J.

2018-05-01

A theoretical analysis of active motion on curved surfaces is presented in terms of a generalization of the telegrapher equation. Such a generalized equation is explicitly derived as the polar approximation of the hierarchy of equations obtained from the corresponding Fokker-Planck equation of active particles diffusing on curved surfaces. The general solution to the generalized telegrapher equation is given for a pulse with vanishing current as initial data. Expressions for the probability density and the mean squared geodesic displacement are given in the limit of weak curvature. As an explicit example of the formulated theory, the case of active motion on the sphere is presented, where oscillations observed in the mean squared geodesic displacement are explained.

Neural Networks For Demodulation Of Phase-Modulated Signals

NASA Technical Reports Server (NTRS)

Altes, Richard A.

1995-01-01

Hopfield neural networks proposed for demodulating quadrature phase-shift-keyed (QPSK) signals carrying digital information. Networks solve nonlinear integral equations prior demodulation circuits cannot solve. Consists of set of N operational amplifiers connected in parallel, with weighted feedback from output terminal of each amplifier to input terminals of other amplifiers. Used to solve signal processing problems. Implemented as analog very-large-scale integrated circuit that achieves rapid convergence. Alternatively, implemented as digital simulation of such circuit. Also used to improve phase estimation performance over that of phase-locked loop.

Stability Switches, Hopf Bifurcations, and Spatio-temporal Patterns in a Delayed Neural Model with Bidirectional Coupling

NASA Astrophysics Data System (ADS)

Song, Yongli; Zhang, Tonghua; Tadé, Moses O.

2009-12-01

The dynamical behavior of a delayed neural network with bi-directional coupling is investigated by taking the delay as the bifurcating parameter. Some parameter regions are given for conditional/absolute stability and Hopf bifurcations by using the theory of functional differential equations. As the propagation time delay in the coupling varies, stability switches for the trivial solution are found. Conditions ensuring the stability and direction of the Hopf bifurcation are determined by applying the normal form theory and the center manifold theorem. We also discuss the spatio-temporal patterns of bifurcating periodic oscillations by using the symmetric bifurcation theory of delay differential equations combined with representation theory of Lie groups. In particular, we obtain that the spatio-temporal patterns of bifurcating periodic oscillations will alternate according to the change of the propagation time delay in the coupling, i.e., different ranges of delays correspond to different patterns of neural activities. Numerical simulations are given to illustrate the obtained results and show the existence of bursts in some interval of the time for large enough delay.

An examination on the influence of small and medium enterprise (SME) stakeholder on green supply chain management practices

NASA Astrophysics Data System (ADS)

Shahlan, M. Z.; Sidek, A. A.; Suffian, S. A.; Hazza, M. H. F. A.; Daud, M. R. C.

2018-01-01

In this paper, climate change and global warming are the biggest current issues in the industrial sectors. The green supply chain managements (GSCM) is one of the crucial input to these issues. Effective GSCM can potentially secure the organization’s competitive advantage and improve the environmental performance of the network activities. In this study, the aim is to investigate and examine how a small and medium enterprises (SMEs) stakeholder pressure and top management influence green supply chain management practices. The study is further advance green supply chain management research in Malaysia focusing on SMEs manufacturing sector using structural equation modelling. Structural equation modelling is a multivariate statistical analysis technique used to examine structural relationship. It is the combination of factor analysis and multi regression analysis and used to analyse structural relationship between measure variable and latent factor. This research found that top management support and stakeholder pressure is the major influence for SMEs to adopt green supply chain management. The research also found that top management is fully mediate with the relationship between stakeholder pressure and monitoring supplier environmental performance.

Analysis of large power systems

NASA Technical Reports Server (NTRS)

Dommel, H. W.

1975-01-01

Computer-oriented power systems analysis procedures in the electric utilities are surveyed. The growth of electric power systems is discussed along with the solution of sparse network equations, power flow, and stability studies.

A new lumped-parameter approach to simulating flow processes in unsaturated dual-porosity media

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

Zimmerman, R.W.; Hadgu, T.; Bodvarsson, G.S.

We have developed a new lumped-parameter dual-porosity approach to simulating unsaturated flow processes in fractured rocks. Fluid flow between the fracture network and the matrix blocks is described by a nonlinear equation that relates the imbibition rate to the local difference in liquid-phase pressure between the fractures and the matrix blocks. This equation is a generalization of the Warren-Root equation, but unlike the Warren-Root equation, is accurate in both the early and late time regimes. The fracture/matrix interflow equation has been incorporated into a computational module, compatible with the TOUGH simulator, to serve as a source/sink term for fracture elements.more » The new approach achieves accuracy comparable to simulations in which the matrix blocks are discretized, but typically requires an order of magnitude less computational time.« less

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.

Dynamic Divisive Normalization Predicts Time-Varying Value Coding in Decision-Related Circuits

PubMed Central

LoFaro, Thomas; Webb, Ryan; Glimcher, Paul W.

2014-01-01

Normalization is a widespread neural computation, mediating divisive gain control in sensory processing and implementing a context-dependent value code in decision-related frontal and parietal cortices. Although decision-making is a dynamic process with complex temporal characteristics, most models of normalization are time-independent and little is known about the dynamic interaction of normalization and choice. Here, we show that a simple differential equation model of normalization explains the characteristic phasic-sustained pattern of cortical decision activity and predicts specific normalization dynamics: value coding during initial transients, time-varying value modulation, and delayed onset of contextual information. Empirically, we observe these predicted dynamics in saccade-related neurons in monkey lateral intraparietal cortex. Furthermore, such models naturally incorporate a time-weighted average of past activity, implementing an intrinsic reference-dependence in value coding. These results suggest that a single network mechanism can explain both transient and sustained decision activity, emphasizing the importance of a dynamic view of normalization in neural coding. PMID:25429145

A model for simulating adaptive, dynamic flows on networks: Application to petroleum infrastructure

DOE PAGES

Corbet, Thomas F.; Beyeler, Walt; Wilson, Michael L.; ...

2017-10-03

Simulation models can greatly improve decisions meant to control the consequences of disruptions to critical infrastructures. We describe a dynamic flow model on networks purposed to inform analyses by those concerned about consequences of disruptions to infrastructures and to help policy makers design robust mitigations. We conceptualize the adaptive responses of infrastructure networks to perturbations as market transactions and business decisions of operators. We approximate commodity flows in these networks by a diffusion equation, with nonlinearities introduced to model capacity limits. To illustrate the behavior and scalability of the model, we show its application first on two simple networks, thenmore » on petroleum infrastructure in the United States, where we analyze the effects of a hypothesized earthquake.« less

A model for simulating adaptive, dynamic flows on networks: Application to petroleum infrastructure

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

Corbet, Thomas F.; Beyeler, Walt; Wilson, Michael L.

Simulation models can greatly improve decisions meant to control the consequences of disruptions to critical infrastructures. We describe a dynamic flow model on networks purposed to inform analyses by those concerned about consequences of disruptions to infrastructures and to help policy makers design robust mitigations. We conceptualize the adaptive responses of infrastructure networks to perturbations as market transactions and business decisions of operators. We approximate commodity flows in these networks by a diffusion equation, with nonlinearities introduced to model capacity limits. To illustrate the behavior and scalability of the model, we show its application first on two simple networks, thenmore » on petroleum infrastructure in the United States, where we analyze the effects of a hypothesized earthquake.« less

Synchronization transmission of laser pattern signal within uncertain switched network

NASA Astrophysics Data System (ADS)

Lü, Ling; Li, Chengren; Li, Gang; Sun, Ao; Yan, Zhe; Rong, Tingting; Gao, Yan

2017-06-01

We propose a new technology for synchronization transmission of laser pattern signal within uncertain network with controllable topology. In synchronization process, the connection of dynamic network can vary at all time according to different demands. Especially, we construct the Lyapunov function of network through designing a special semi-positive definite function, and the synchronization transmission of laser pattern signal within uncertain network with controllable topology can be realized perfectly, which effectively avoids the complicated calculation for solving the second largest eignvalue of the coupling matrix of the dynamic network in order to obtain the network synchronization condition. At the same time, the uncertain parameters in dynamic equations belonging to network nodes can also be identified accurately via designing the identification laws of uncertain parameters. In addition, there are not any limitations for the synchronization target of network in the new technology, in other words, the target can either be a state variable signal of an arbitrary node within the network or an exterior signal.

The Developmental Pathway From Pubertal Timing to Delinquency and Sexual Activity From Early to Late Adolescence

PubMed Central

Negriff, Sonya; Elizabeth, J. Susman; Trickett, Penelope K.

2013-01-01

There is strong evidence that early pubertal timing is associated with adolescent problem behaviors. However, there has been limited investigation of the mechanisms or developmental relationships. The present study examined longitudinal models incorporating pubertal timing, delinquency, and sexual activity in a sample of 454 adolescents (9–13 years old at enrollment; 47% females). Participants were seen for three assessments approximately 1 year apart. Characteristics of friendship networks (older friends, male friends, older male friends) were examined as mediators. Structural equation modeling was used to test these associations as well as temporal relationships between sexual activity and delinquency. Results showed that early pubertal timing at Time 1 was related to more sexual activity at Time 2, which was related to higher delinquency at Time 3, a trend mediation effect. None of the friendship variables mediated these associations. Gender or maltreatment status did not moderate the meditational pathways. The results also supported the temporal sequence of sexual activity preceding increases in delinquency. These findings reveal that early maturing adolescents may actively seek out opportunities to engage in sexual activity which appears to be risk for subsequent delinquency. PMID:21191640

The developmental pathway from pubertal timing to delinquency and sexual activity from early to late adolescence.

PubMed

Negriff, Sonya; Susman, Elizabeth J; Trickett, Penelope K

2011-10-01

There is strong evidence that early pubertal timing is associated with adolescent problem behaviors. However, there has been limited investigation of the mechanisms or developmental relationships. The present study examined longitudinal models incorporating pubertal timing, delinquency, and sexual activity in a sample of 454 adolescents (9-13 years old at enrollment; 47% females). Participants were seen for three assessments approximately 1 year apart. Characteristics of friendship networks (older friends, male friends, older male friends) were examined as mediators. Structural equation modeling was used to test these associations as well as temporal relationships between sexual activity and delinquency. Results showed that early pubertal timing at Time 1 was related to more sexual activity at Time 2, which was related to higher delinquency at Time 3, a trend mediation effect. None of the friendship variables mediated these associations. Gender or maltreatment status did not moderate the meditational pathways. The results also supported the temporal sequence of sexual activity preceding increases in delinquency. These findings reveal that early maturing adolescents may actively seek out opportunities to engage in sexual activity which appears to be risk for subsequent delinquency.

Flows in a tube structure: Equation on the graph

NASA Astrophysics Data System (ADS)

Panasenko, Grigory; Pileckas, Konstantin

2014-08-01

The steady-state Navier-Stokes equations in thin structures lead to some elliptic second order equation for the macroscopic pressure on a graph. At the nodes of the graph the pressure satisfies Kirchoff-type junction conditions. In the non-steady case the problem for the macroscopic pressure on the graph becomes nonlocal in time. In the paper we study the existence and uniqueness of a solution to such one-dimensional model on the graph for a pipe-wise network. We also prove the exponential decay of the solution with respect to the time variable in the case when the data decay exponentially with respect to time.

A high performance linear equation solver on the VPP500 parallel supercomputer

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

Nakanishi, Makoto; Ina, Hiroshi; Miura, Kenichi

1994-12-31

This paper describes the implementation of two high performance linear equation solvers developed for the Fujitsu VPP500, a distributed memory parallel supercomputer system. The solvers take advantage of the key architectural features of VPP500--(1) scalability for an arbitrary number of processors up to 222 processors, (2) flexible data transfer among processors provided by a crossbar interconnection network, (3) vector processing capability on each processor, and (4) overlapped computation and transfer. The general linear equation solver based on the blocked LU decomposition method achieves 120.0 GFLOPS performance with 100 processors in the LIN-PACK Highly Parallel Computing benchmark.

Statistical Neurodynamics.

NASA Astrophysics Data System (ADS)

Paine, Gregory Harold

1982-03-01

The primary objective of the thesis is to explore the dynamical properties of small nerve networks by means of the methods of statistical mechanics. To this end, a general formalism is developed and applied to elementary groupings of model neurons which are driven by either constant (steady state) or nonconstant (nonsteady state) forces. Neuronal models described by a system of coupled, nonlinear, first-order, ordinary differential equations are considered. A linearized form of the neuronal equations is studied in detail. A Lagrange function corresponding to the linear neural network is constructed which, through a Legendre transformation, provides a constant of motion. By invoking the Maximum-Entropy Principle with the single integral of motion as a constraint, a probability distribution function for the network in a steady state can be obtained. The formalism is implemented for some simple networks driven by a constant force; accordingly, the analysis focuses on a study of fluctuations about the steady state. In particular, a network composed of N noninteracting neurons, termed Free Thinkers, is considered in detail, with a view to interpretation and numerical estimation of the Lagrange multiplier corresponding to the constant of motion. As an archetypical example of a net of interacting neurons, the classical neural oscillator, consisting of two mutually inhibitory neurons, is investigated. It is further shown that in the case of a network driven by a nonconstant force, the Maximum-Entropy Principle can be applied to determine a probability distribution functional describing the network in a nonsteady state. The above examples are reconsidered with nonconstant driving forces which produce small deviations from the steady state. Numerical studies are performed on simplified models of two physical systems: the starfish central nervous system and the mammalian olfactory bulb. Discussions are given as to how statistical neurodynamics can be used to gain a better understanding of the behavior of these systems.

Accurate chemical master equation solution using multi-finite buffers

DOE PAGES

Cao, Youfang; Terebus, Anna; Liang, Jie

2016-06-29

Here, the discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multiscale nature of many networks where reaction rates have a large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multifinite buffers for reducing the state spacemore » by $O(n!)$, exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be precomputed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multiscale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks.« less

SIMRAND I- SIMULATION OF RESEARCH AND DEVELOPMENT PROJECTS

NASA Technical Reports Server (NTRS)

Miles, R. F.

1994-01-01

The Simulation of Research and Development Projects program (SIMRAND) aids in the optimal allocation of R&D resources needed to achieve project goals. SIMRAND models the system subsets or project tasks as various network paths to a final goal. Each path is described in terms of task variables such as cost per hour, cost per unit, availability of resources, etc. Uncertainty is incorporated by treating task variables as probabilistic random variables. SIMRAND calculates the measure of preference for each alternative network. The networks yielding the highest utility function (or certainty equivalence) are then ranked as the optimal network paths. SIMRAND has been used in several economic potential studies at NASA's Jet Propulsion Laboratory involving solar dish power systems and photovoltaic array construction. However, any project having tasks which can be reduced to equations and related by measures of preference can be modeled. SIMRAND analysis consists of three phases: reduction, simulation, and evaluation. In the reduction phase, analytical techniques from probability theory and simulation techniques are used to reduce the complexity of the alternative networks. In the simulation phase, a Monte Carlo simulation is used to derive statistics on the variables of interest for each alternative network path. In the evaluation phase, the simulation statistics are compared and the networks are ranked in preference by a selected decision rule. The user must supply project subsystems in terms of equations based on variables (for example, parallel and series assembly line tasks in terms of number of items, cost factors, time limits, etc). The associated cumulative distribution functions and utility functions for each variable must also be provided (allowable upper and lower limits, group decision factors, etc). SIMRAND is written in Microsoft FORTRAN 77 for batch execution and has been implemented on an IBM PC series computer operating under DOS.

Accurate chemical master equation solution using multi-finite buffers

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

Cao, Youfang; Terebus, Anna; Liang, Jie

Here, the discrete chemical master equation (dCME) provides a fundamental framework for studying stochasticity in mesoscopic networks. Because of the multiscale nature of many networks where reaction rates have a large disparity, directly solving dCMEs is intractable due to the exploding size of the state space. It is important to truncate the state space effectively with quantified errors, so accurate solutions can be computed. It is also important to know if all major probabilistic peaks have been computed. Here we introduce the accurate CME (ACME) algorithm for obtaining direct solutions to dCMEs. With multifinite buffers for reducing the state spacemore » by $O(n!)$, exact steady-state and time-evolving network probability landscapes can be computed. We further describe a theoretical framework of aggregating microstates into a smaller number of macrostates by decomposing a network into independent aggregated birth and death processes and give an a priori method for rapidly determining steady-state truncation errors. The maximal sizes of the finite buffers for a given error tolerance can also be precomputed without costly trial solutions of dCMEs. We show exactly computed probability landscapes of three multiscale networks, namely, a 6-node toggle switch, 11-node phage-lambda epigenetic circuit, and 16-node MAPK cascade network, the latter two with no known solutions. We also show how probabilities of rare events can be computed from first-passage times, another class of unsolved problems challenging for simulation-based techniques due to large separations in time scales. Overall, the ACME method enables accurate and efficient solutions of the dCME for a large class of networks.« less

Statistical physics of crime: a review.

PubMed

D'Orsogna, Maria R; Perc, Matjaž

2015-03-01

Containing the spread of crime in urban societies remains a major challenge. Empirical evidence suggests that, if left unchecked, crimes may be recurrent and proliferate. On the other hand, eradicating a culture of crime may be difficult, especially under extreme social circumstances that impair the creation of a shared sense of social responsibility. Although our understanding of the mechanisms that drive the emergence and diffusion of crime is still incomplete, recent research highlights applied mathematics and methods of statistical physics as valuable theoretical resources that may help us better understand criminal activity. We review different approaches aimed at modeling and improving our understanding of crime, focusing on the nucleation of crime hotspots using partial differential equations, self-exciting point process and agent-based modeling, adversarial evolutionary games, and the network science behind the formation of gangs and large-scale organized crime. We emphasize that statistical physics of crime can relevantly inform the design of successful crime prevention strategies, as well as improve the accuracy of expectations about how different policing interventions should impact malicious human activity that deviates from social norms. We also outline possible directions for future research, related to the effects of social and coevolving networks and to the hierarchical growth of criminal structures due to self-organization. Copyright © 2014 Elsevier B.V. All rights reserved.

Polynomial mixture method of solving ordinary differential equations

NASA Astrophysics Data System (ADS)

Shahrir, Mohammad Shazri; Nallasamy, Kumaresan; Ratnavelu, Kuru; Kamali, M. Z. M.

2017-11-01

In this paper, a numerical solution of fuzzy quadratic Riccati differential equation is estimated using a proposed new approach that provides mixture of polynomials where iteratively the right mixture will be generated. This mixture provide a generalized formalism of traditional Neural Networks (NN). Previous works have shown reliable results using Runge-Kutta 4th order (RK4). This can be achieved by solving the 1st Order Non-linear Differential Equation (ODE) that is found commonly in Riccati differential equation. Research has shown improved results relatively to the RK4 method. It can be said that Polynomial Mixture Method (PMM) shows promising results with the advantage of continuous estimation and improved accuracy that can be produced over Mabood et al, RK-4, Multi-Agent NN and Neuro Method (NM).

Large-Scale Simulations of Plastic Neural Networks on Neuromorphic Hardware

PubMed Central

Knight, James C.; Tully, Philip J.; Kaplan, Bernhard A.; Lansner, Anders; Furber, Steve B.

2016-01-01

SpiNNaker is a digital, neuromorphic architecture designed for simulating large-scale spiking neural networks at speeds close to biological real-time. Rather than using bespoke analog or digital hardware, the basic computational unit of a SpiNNaker system is a general-purpose ARM processor, allowing it to be programmed to simulate a wide variety of neuron and synapse models. This flexibility is particularly valuable in the study of biological plasticity phenomena. A recently proposed learning rule based on the Bayesian Confidence Propagation Neural Network (BCPNN) paradigm offers a generic framework for modeling the interaction of different plasticity mechanisms using spiking neurons. However, it can be computationally expensive to simulate large networks with BCPNN learning since it requires multiple state variables for each synapse, each of which needs to be updated every simulation time-step. We discuss the trade-offs in efficiency and accuracy involved in developing an event-based BCPNN implementation for SpiNNaker based on an analytical solution to the BCPNN equations, and detail the steps taken to fit this within the limited computational and memory resources of the SpiNNaker architecture. We demonstrate this learning rule by learning temporal sequences of neural activity within a recurrent attractor network which we simulate at scales of up to 2.0 × 104 neurons and 5.1 × 107 plastic synapses: the largest plastic neural network ever to be simulated on neuromorphic hardware. We also run a comparable simulation on a Cray XC-30 supercomputer system and find that, if it is to match the run-time of our SpiNNaker simulation, the super computer system uses approximately 45× more power. This suggests that cheaper, more power efficient neuromorphic systems are becoming useful discovery tools in the study of plasticity in large-scale brain models. PMID:27092061

Childhood maltreatment is associated with a sex-dependent functional reorganization of a brain inhibitory control network.

PubMed

Elton, Amanda; Tripathi, Shanti P; Mletzko, Tanja; Young, Jonathan; Cisler, Josh M; James, G Andrew; Kilts, Clinton D

2014-04-01

Childhood adversity represents a major risk factor for drug addiction and other mental disorders. However, the specific mechanisms by which childhood adversity impacts human brain organization to confer greater vulnerability for negative outcomes in adulthood is largely unknown. As an impaired process in drug addiction, inhibitory control of behavior was investigated as a target of childhood maltreatment (abuse and neglect). Forty adults without Axis-I psychiatric disorders (21 females) completed a Childhood Trauma Questionnaire (CTQ) and underwent functional MRI (fMRI) while performing a stop-signal task. A group independent component analysis identified a putative brain inhibitory control network. Graph theoretical analyses and structural equation modeling investigated the impact of childhood maltreatment on the functional organization of this neural processing network. Graph theory outcomes revealed sex differences in the relationship between network functional connectivity and inhibitory control which were dependent on the severity of childhood maltreatment exposure. A network effective connectivity analysis indicated that a maltreatment dose-related negative modulation of dorsal anterior cingulate (dACC) activity by the left inferior frontal cortex (IFC) predicted better response inhibition and lesser attention deficit hyperactivity disorder (ADHD) symptoms in females, but poorer response inhibition and greater ADHD symptoms in males. Less inhibition of the right IFC by dACC in males with higher CTQ scores improved inhibitory control ability. The childhood maltreatment-related reorganization of a brain inhibitory control network provides sex-dependent mechanisms by which childhood adversity may confer greater risk for drug use and related disorders and by which adaptive brain responses protect individuals from this risk factor. Copyright © 2013 Wiley Periodicals, Inc.

A neural network based implementation of an MPC algorithm applied in the control systems of electromechanical plants

NASA Astrophysics Data System (ADS)

Marusak, Piotr M.; Kuntanapreeda, Suwat

2018-01-01

The paper considers application of a neural network based implementation of a model predictive control (MPC) control algorithm to electromechanical plants. Properties of such control plants implicate that a relatively short sampling time should be used. However, in such a case, finding the control value numerically may be too time-consuming. Therefore, the current paper tests the solution based on transforming the MPC optimization problem into a set of differential equations whose solution is the same as that of the original optimization problem. This set of differential equations can be interpreted as a dynamic neural network. In such an approach, the constraints can be introduced into the optimization problem with relative ease. Moreover, the solution of the optimization problem can be obtained faster than when the standard numerical quadratic programming routine is used. However, a very careful tuning of the algorithm is needed to achieve this. A DC motor and an electrohydraulic actuator are taken as illustrative examples. The feasibility and effectiveness of the proposed approach are demonstrated through numerical simulations.

Neural-network-based online HJB solution for optimal robust guaranteed cost control of continuous-time uncertain nonlinear systems.

PubMed

Liu, Derong; Wang, Ding; Wang, Fei-Yue; Li, Hongliang; Yang, Xiong

2014-12-01

In this paper, the infinite horizon optimal robust guaranteed cost control of continuous-time uncertain nonlinear systems is investigated using neural-network-based online solution of Hamilton-Jacobi-Bellman (HJB) equation. By establishing an appropriate bounded function and defining a modified cost function, the optimal robust guaranteed cost control problem is transformed into an optimal control problem. It can be observed that the optimal cost function of the nominal system is nothing but the optimal guaranteed cost of the original uncertain system. A critic neural network is constructed to facilitate the solution of the modified HJB equation corresponding to the nominal system. More importantly, an additional stabilizing term is introduced for helping to verify the stability, which reinforces the updating process of the weight vector and reduces the requirement of an initial stabilizing control. The uniform ultimate boundedness of the closed-loop system is analyzed by using the Lyapunov approach as well. Two simulation examples are provided to verify the effectiveness of the present control approach.

Path integrals and large deviations in stochastic hybrid systems.

PubMed

Bressloff, Paul C; Newby, Jay M

2014-04-01

We construct a path-integral representation of solutions to a stochastic hybrid system, consisting of one or more continuous variables evolving according to a piecewise-deterministic dynamics. The differential equations for the continuous variables are coupled to a set of discrete variables that satisfy a continuous-time Markov process, which means that the differential equations are only valid between jumps in the discrete variables. Examples of stochastic hybrid systems arise in biophysical models of stochastic ion channels, motor-driven intracellular transport, gene networks, and stochastic neural networks. We use the path-integral representation to derive a large deviation action principle for a stochastic hybrid system. Minimizing the associated action functional with respect to the set of all trajectories emanating from a metastable state (assuming that such a minimization scheme exists) then determines the most probable paths of escape. Moreover, evaluating the action functional along a most probable path generates the so-called quasipotential used in the calculation of mean first passage times. We illustrate the theory by considering the optimal paths of escape from a metastable state in a bistable neural network.

Logic-based models in systems biology: a predictive and parameter-free network analysis method†

PubMed Central

Wynn, Michelle L.; Consul, Nikita; Merajver, Sofia D.

2012-01-01

Highly complex molecular networks, which play fundamental roles in almost all cellular processes, are known to be dysregulated in a number of diseases, most notably in cancer. As a consequence, there is a critical need to develop practical methodologies for constructing and analysing molecular networks at a systems level. Mathematical models built with continuous differential equations are an ideal methodology because they can provide a detailed picture of a network’s dynamics. To be predictive, however, differential equation models require that numerous parameters be known a priori and this information is almost never available. An alternative dynamical approach is the use of discrete logic-based models that can provide a good approximation of the qualitative behaviour of a biochemical system without the burden of a large parameter space. Despite their advantages, there remains significant resistance to the use of logic-based models in biology. Here, we address some common concerns and provide a brief tutorial on the use of logic-based models, which we motivate with biological examples. PMID:23072820

Higher-order kinetic expansion of quantum dissipative dynamics: mapping quantum networks to kinetic networks.

PubMed

Wu, Jianlan; Cao, Jianshu

2013-07-28

We apply a new formalism to derive the higher-order quantum kinetic expansion (QKE) for studying dissipative dynamics in a general quantum network coupled with an arbitrary thermal bath. The dynamics of system population is described by a time-convoluted kinetic equation, where the time-nonlocal rate kernel is systematically expanded of the order of off-diagonal elements of the system Hamiltonian. In the second order, the rate kernel recovers the expression of the noninteracting-blip approximation method. The higher-order corrections in the rate kernel account for the effects of the multi-site quantum coherence and the bath relaxation. In a quantum harmonic bath, the rate kernels of different orders are analytically derived. As demonstrated by four examples, the higher-order QKE can reliably predict quantum dissipative dynamics, comparing well with the hierarchic equation approach. More importantly, the higher-order rate kernels can distinguish and quantify distinct nontrivial quantum coherent effects, such as long-range energy transfer from quantum tunneling and quantum interference arising from the phase accumulation of interactions.

A network model of successive partitioning-limited solute diffusion through the stratum corneum.

PubMed

Schumm, Phillip; Scoglio, Caterina M; van der Merwe, Deon

2010-02-07

As the most exposed point of contact with the external environment, the skin is an important barrier to many chemical exposures, including medications, potentially toxic chemicals and cosmetics. Traditional dermal absorption models treat the stratum corneum lipids as a homogenous medium through which solutes diffuse according to Fick's first law of diffusion. This approach does not explain non-linear absorption and irregular distribution patterns within the stratum corneum lipids as observed in experimental data. A network model, based on successive partitioning-limited solute diffusion through the stratum corneum, where the lipid structure is represented by a large, sparse, and regular network where nodes have variable characteristics, offers an alternative, efficient, and flexible approach to dermal absorption modeling that simulates non-linear absorption data patterns. Four model versions are presented: two linear models, which have unlimited node capacities, and two non-linear models, which have limited node capacities. The non-linear model outputs produce absorption to dose relationships that can be best characterized quantitatively by using power equations, similar to the equations used to describe non-linear experimental data.

Comment on "Asymmetric coevolutionary networks facilitate biodiversity maintenance"

USGS Publications Warehouse

Holland, J. Nathaniel; Okuyama, Toshinori; DeAngelis, Donald L.

2006-01-01

Bascompte et al. (Reports, 21 April 2006, p. 431) used network asymmetries to explain mathematical conditions necessary for stability in historic models of mutualism. The Lotka-Volterra equations they used artificially created conditions in which some factor, such as asymmetric interaction strengths, is necessary for community coexistence. We show that a more realistic model incorporating nonlinear functional responses requires no such condition and is consistent with their data.

Harmonic stochastic resonance-enhanced signal detecting in NW small-world neural network

NASA Astrophysics Data System (ADS)

Wang, Dao-Guang; Liang, Xiao-Ming; Wang, Jing; Yang, Cheng-Fang; Liu, Kai; Lü, Hua-Ping

2010-11-01

The harmonic stochastic resonance-enhanced signal detecting in Newman-Watts small-world neural network is studied using the Hodgkin-Huxley dynamical equation with noise. If the connection probability p, coupling strength gsyn and noise intensity D matches well, higher order resonance will be found and an optimal signal-to-noise ratio will be obtained. Then, the reasons are given to explain the mechanism of this appearance.

Queues on a Dynamically Evolving Graph

NASA Astrophysics Data System (ADS)

Mandjes, Michel; Starreveld, Nicos J.; Bekker, René

2018-04-01

This paper considers a population process on a dynamically evolving graph, which can be alternatively interpreted as a queueing network. The queues are of infinite-server type, entailing that at each node all customers present are served in parallel. The links that connect the queues have the special feature that they are unreliable, in the sense that their status alternates between `up' and `down'. If a link between two nodes is down, with a fixed probability each of the clients attempting to use that link is lost; otherwise the client remains at the origin node and reattempts using the link (and jumps to the destination node when it finds the link restored). For these networks we present the following results: (a) a system of coupled partial differential equations that describes the joint probability generating function corresponding to the queues' time-dependent behavior (and a system of ordinary differential equations for its stationary counterpart), (b) an algorithm to evaluate the (time-dependent and stationary) moments, and procedures to compute user-perceived performance measures which facilitate the quantification of the impact of the links' outages, (c) a diffusion limit for the joint queue length process. We include explicit results for a series relevant special cases, such as tandem networks and symmetric fully connected networks.

Non-additive dissipation in open quantum networks out of equilibrium

NASA Astrophysics Data System (ADS)

Mitchison, Mark T.; Plenio, Martin B.

2018-03-01

We theoretically study a simple non-equilibrium quantum network whose dynamics can be expressed and exactly solved in terms of a time-local master equation. Specifically, we consider a pair of coupled fermionic modes, each one locally exchanging energy and particles with an independent, macroscopic thermal reservoir. We show that the generator of the asymptotic master equation is not additive, i.e. it cannot be expressed as a sum of contributions describing the action of each reservoir alone. Instead, we identify an additional interference term that generates coherences in the energy eigenbasis, associated with the current of conserved particles flowing in the steady state. Notably, non-additivity arises even for wide-band reservoirs coupled arbitrarily weakly to the system. Our results shed light on the non-trivial interplay between multiple thermal noise sources in modular open quantum systems.

An equation-of-state-meter of quantum chromodynamics transition from deep learning.

PubMed

Pang, Long-Gang; Zhou, Kai; Su, Nan; Petersen, Hannah; Stöcker, Horst; Wang, Xin-Nian

2018-01-15

A primordial state of matter consisting of free quarks and gluons that existed in the early universe a few microseconds after the Big Bang is also expected to form in high-energy heavy-ion collisions. Determining the equation of state (EoS) of such a primordial matter is the ultimate goal of high-energy heavy-ion experiments. Here we use supervised learning with a deep convolutional neural network to identify the EoS employed in the relativistic hydrodynamic simulations of heavy ion collisions. High-level correlations of particle spectra in transverse momentum and azimuthal angle learned by the network act as an effective EoS-meter in deciphering the nature of the phase transition in quantum chromodynamics. Such EoS-meter is model-independent and insensitive to other simulation inputs including the initial conditions for hydrodynamic simulations.