Dynamic recruitment of resting state sub-networks

PubMed Central

O'Neill, George C.; Bauer, Markus; Woolrich, Mark W.; Morris, Peter G.; Barnes, Gareth R.; Brookes, Matthew J.

2015-01-01

Resting state networks (RSNs) are of fundamental importance in human systems neuroscience with evidence suggesting that they are integral to healthy brain function and perturbed in pathology. Despite rapid progress in this area, the temporal dynamics governing the functional connectivities that underlie RSN structure remain poorly understood. Here, we present a framework to help further our understanding of RSN dynamics. We describe a methodology which exploits the direct nature and high temporal resolution of magnetoencephalography (MEG). This technique, which builds on previous work, extends from solving fundamental confounds in MEG (source leakage) to multivariate modelling of transient connectivity. The resulting processing pipeline facilitates direct (electrophysiological) measurement of dynamic functional networks. Our results show that, when functional connectivity is assessed in small time windows, the canonical sensorimotor network can be decomposed into a number of transiently synchronising sub-networks, recruitment of which depends on current mental state. These rapidly changing sub-networks are spatially focal with, for example, bilateral primary sensory and motor areas resolved into two separate sub-networks. The likely interpretation is that the larger canonical sensorimotor network most often seen in neuroimaging studies reflects only a temporal aggregate of these transient sub-networks. Our approach opens new frontiers to study RSN dynamics, showing that MEG is capable of revealing the spatial, temporal and spectral signature of the human connectome in health and disease. PMID:25899137

Direct lifts of coupled cell networks

NASA Astrophysics Data System (ADS)

Dias, A. P. S.; Moreira, C. S.

2018-04-01

In networks of dynamical systems, there are spaces defined in terms of equalities of cell coordinates which are flow-invariant under any dynamical system that has a form consistent with the given underlying network structure—the network synchrony subspaces. Given a network and one of its synchrony subspaces, any system with a form consistent with the network, restricted to the synchrony subspace, defines a new system which is consistent with a smaller network, called the quotient network of the original network by the synchrony subspace. Moreover, any system associated with the quotient can be interpreted as the restriction to the synchrony subspace of a system associated with the original network. We call the larger network a lift of the smaller network, and a lift can be interpreted as a result of the cellular splitting of the smaller network. In this paper, we address the question of the uniqueness in this lifting process in terms of the networks’ topologies. A lift G of a given network Q is said to be direct when there are no intermediate lifts of Q between them. We provide necessary and sufficient conditions for a lift of a general network to be direct. Our results characterize direct lifts using the subnetworks of all splitting cells of Q and of all split cells of G. We show that G is a direct lift of Q if and only if either the split subnetwork is a direct lift or consists of two copies of the splitting subnetwork. These results are then applied to the class of regular uniform networks and to the special classes of ring networks and acyclic networks. We also illustrate that one of the applications of our results is to the lifting bifurcation problem.

An opinion-driven behavioral dynamics model for addictive behaviors

NASA Astrophysics Data System (ADS)

Moore, Thomas W.; Finley, Patrick D.; Apelberg, Benjamin J.; Ambrose, Bridget K.; Brodsky, Nancy S.; Brown, Theresa J.; Husten, Corinne; Glass, Robert J.

2015-04-01

We present a model of behavioral dynamics that combines a social network-based opinion dynamics model with behavioral mapping. The behavioral component is discrete and history-dependent to represent situations in which an individual's behavior is initially driven by opinion and later constrained by physiological or psychological conditions that serve to maintain the behavior. Individuals are modeled as nodes in a social network connected by directed edges. Parameter sweeps illustrate model behavior and the effects of individual parameters and parameter interactions on model results. Mapping a continuous opinion variable into a discrete behavioral space induces clustering on directed networks. Clusters provide targets of opportunity for influencing the network state; however, the smaller the network the greater the stochasticity and potential variability in outcomes. This has implications both for behaviors that are influenced by close relationships verses those influenced by societal norms and for the effectiveness of strategies for influencing those behaviors.

The experimental identification of magnetorheological dampers and evaluation of their controllers

NASA Astrophysics Data System (ADS)

Metered, H.; Bonello, P.; Oyadiji, S. O.

2010-05-01

Magnetorheological (MR) fluid dampers are semi-active control devices that have been applied over a wide range of practical vibration control applications. This paper concerns the experimental identification of the dynamic behaviour of an MR damper and the use of the identified parameters in the control of such a damper. Feed-forward and recurrent neural networks are used to model both the direct and inverse dynamics of the damper. Training and validation of the proposed neural networks are achieved by using the data generated through dynamic tests with the damper mounted on a tensile testing machine. The validation test results clearly show that the proposed neural networks can reliably represent both the direct and inverse dynamic behaviours of an MR damper. The effect of the cylinder's surface temperature on both the direct and inverse dynamics of the damper is studied, and the neural network model is shown to be reasonably robust against significant temperature variation. The inverse recurrent neural network model is introduced as a damper controller and experimentally evaluated against alternative controllers proposed in the literature. The results reveal that the neural-based damper controller offers superior damper control. This observation and the added advantages of low-power requirement, extended service life of the damper and the minimal use of sensors, indicate that a neural-based damper controller potentially offers the most cost-effective vibration control solution among the controllers investigated.

Temporal correlation coefficient for directed networks.

PubMed

Büttner, Kathrin; Salau, Jennifer; Krieter, Joachim

2016-01-01

Previous studies dealing with network theory focused mainly on the static aggregation of edges over specific time window lengths. Thus, most of the dynamic information gets lost. To assess the quality of such a static aggregation the temporal correlation coefficient can be calculated. It measures the overall possibility for an edge to persist between two consecutive snapshots. Up to now, this measure is only defined for undirected networks. Therefore, we introduce the adaption of the temporal correlation coefficient to directed networks. This new methodology enables the distinction between ingoing and outgoing edges. Besides a small example network presenting the single calculation steps, we also calculated the proposed measurements for a real pig trade network to emphasize the importance of considering the edge direction. The farm types at the beginning of the pork supply chain showed clearly higher values for the outgoing temporal correlation coefficient compared to the farm types at the end of the pork supply chain. These farm types showed higher values for the ingoing temporal correlation coefficient. The temporal correlation coefficient is a valuable tool to understand the structural dynamics of these systems, as it assesses the consistency of the edge configuration. The adaption of this measure for directed networks may help to preserve meaningful additional information about the investigated network that might get lost if the edge directions are ignored.

Multi-agent coordination in directed moving neighbourhood random networks

NASA Astrophysics Data System (ADS)

Shang, Yi-Lun

2010-07-01

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

Role of Graph Architecture in Controlling Dynamical Networks with Applications to Neural Systems.

PubMed

Kim, Jason Z; Soffer, Jonathan M; Kahn, Ari E; Vettel, Jean M; Pasqualetti, Fabio; Bassett, Danielle S

2018-01-01

Networked systems display complex patterns of interactions between components. In physical networks, these interactions often occur along structural connections that link components in a hard-wired connection topology, supporting a variety of system-wide dynamical behaviors such as synchronization. While descriptions of these behaviors are important, they are only a first step towards understanding and harnessing the relationship between network topology and system behavior. Here, we use linear network control theory to derive accurate closed-form expressions that relate the connectivity of a subset of structural connections (those linking driver nodes to non-driver nodes) to the minimum energy required to control networked systems. To illustrate the utility of the mathematics, we apply this approach to high-resolution connectomes recently reconstructed from Drosophila, mouse, and human brains. We use these principles to suggest an advantage of the human brain in supporting diverse network dynamics with small energetic costs while remaining robust to perturbations, and to perform clinically accessible targeted manipulation of the brain's control performance by removing single edges in the network. Generally, our results ground the expectation of a control system's behavior in its network architecture, and directly inspire new directions in network analysis and design via distributed control.

Role of graph architecture in controlling dynamical networks with applications to neural systems

NASA Astrophysics Data System (ADS)

Kim, Jason Z.; Soffer, Jonathan M.; Kahn, Ari E.; Vettel, Jean M.; Pasqualetti, Fabio; Bassett, Danielle S.

2018-01-01

Networked systems display complex patterns of interactions between components. In physical networks, these interactions often occur along structural connections that link components in a hard-wired connection topology, supporting a variety of system-wide dynamical behaviours such as synchronization. Although descriptions of these behaviours are important, they are only a first step towards understanding and harnessing the relationship between network topology and system behaviour. Here, we use linear network control theory to derive accurate closed-form expressions that relate the connectivity of a subset of structural connections (those linking driver nodes to non-driver nodes) to the minimum energy required to control networked systems. To illustrate the utility of the mathematics, we apply this approach to high-resolution connectomes recently reconstructed from Drosophila, mouse, and human brains. We use these principles to suggest an advantage of the human brain in supporting diverse network dynamics with small energetic costs while remaining robust to perturbations, and to perform clinically accessible targeted manipulation of the brain's control performance by removing single edges in the network. Generally, our results ground the expectation of a control system's behaviour in its network architecture, and directly inspire new directions in network analysis and design via distributed control.

Application of dynamic recurrent neural networks in nonlinear system identification

NASA Astrophysics Data System (ADS)

Du, Yun; Wu, Xueli; Sun, Huiqin; Zhang, Suying; Tian, Qiang

2006-11-01

An adaptive identification method of simple dynamic recurrent neural network (SRNN) for nonlinear dynamic systems is presented in this paper. This method based on the theory that by using the inner-states feed-back of dynamic network to describe the nonlinear kinetic characteristics of system can reflect the dynamic characteristics more directly, deduces the recursive prediction error (RPE) learning algorithm of SRNN, and improves the algorithm by studying topological structure on recursion layer without the weight values. The simulation results indicate that this kind of neural network can be used in real-time control, due to its less weight values, simpler learning algorithm, higher identification speed, and higher precision of model. It solves the problems of intricate in training algorithm and slow rate in convergence caused by the complicate topological structure in usual dynamic recurrent neural network.

Direct Adaptive Aircraft Control Using Dynamic Cell Structure Neural Networks

NASA Technical Reports Server (NTRS)

Jorgensen, Charles C.

1997-01-01

A Dynamic Cell Structure (DCS) Neural Network was developed which learns topology representing networks (TRNS) of F-15 aircraft aerodynamic stability and control derivatives. The network is integrated into a direct adaptive tracking controller. The combination produces a robust adaptive architecture capable of handling multiple accident and off- nominal flight scenarios. This paper describes the DCS network and modifications to the parameter estimation procedure. The work represents one step towards an integrated real-time reconfiguration control architecture for rapid prototyping of new aircraft designs. Performance was evaluated using three off-line benchmarks and on-line nonlinear Virtual Reality simulation. Flight control was evaluated under scenarios including differential stabilator lock, soft sensor failure, control and stability derivative variations, and air turbulence.

Design of multi-phase dynamic chemical networks

NASA Astrophysics Data System (ADS)

Chen, Chenrui; Tan, Junjun; Hsieh, Ming-Chien; Pan, Ting; Goodwin, Jay T.; Mehta, Anil K.; Grover, Martha A.; Lynn, David G.

2017-08-01

Template-directed polymerization reactions enable the accurate storage and processing of nature's biopolymer information. This mutualistic relationship of nucleic acids and proteins, a network known as life's central dogma, is now marvellously complex, and the progressive steps necessary for creating the initial sequence and chain-length-specific polymer templates are lost to time. Here we design and construct dynamic polymerization networks that exploit metastable prion cross-β phases. Mixed-phase environments have been used for constructing synthetic polymers, but these dynamic phases emerge naturally from the growing peptide oligomers and create environments suitable both to nucleate assembly and select for ordered templates. The resulting templates direct the amplification of a phase containing only chain-length-specific peptide-like oligomers. Such multi-phase biopolymer dynamics reveal pathways for the emergence, self-selection and amplification of chain-length- and possibly sequence-specific biopolymers.

Generalised Sandpile Dynamics on Artificial and Real-World Directed Networks

PubMed Central

Zachariou, Nicky; Expert, Paul; Takayasu, Misako; Christensen, Kim

2015-01-01

The main finding of this paper is a novel avalanche-size exponent τ ≈ 1.87 when the generalised sandpile dynamics evolves on the real-world Japanese inter-firm network. The topology of this network is non-layered and directed, displaying the typical bow tie structure found in real-world directed networks, with cycles and triangles. We show that one can move from a strictly layered regular lattice to a more fluid structure of the inter-firm network in a few simple steps. Relaxing the regular lattice structure by introducing an interlayer distribution for the interactions, forces the scaling exponent of the avalanche-size probability density function τ out of the two-dimensional directed sandpile universality class τ = 4/3, into the mean field universality class τ = 3/2. Numerical investigation shows that these two classes are the only that exist on the directed sandpile, regardless of the underlying topology, as long as it is strictly layered. Randomly adding a small proportion of links connecting non adjacent layers in an otherwise layered network takes the system out of the mean field regime to produce non-trivial avalanche-size probability density function. Although these do not display proper scaling, they closely reproduce the behaviour observed on the Japanese inter-firm network. PMID:26606143

Generalised Sandpile Dynamics on Artificial and Real-World Directed Networks.

PubMed

Zachariou, Nicky; Expert, Paul; Takayasu, Misako; Christensen, Kim

2015-01-01

The main finding of this paper is a novel avalanche-size exponent τ ≈ 1.87 when the generalised sandpile dynamics evolves on the real-world Japanese inter-firm network. The topology of this network is non-layered and directed, displaying the typical bow tie structure found in real-world directed networks, with cycles and triangles. We show that one can move from a strictly layered regular lattice to a more fluid structure of the inter-firm network in a few simple steps. Relaxing the regular lattice structure by introducing an interlayer distribution for the interactions, forces the scaling exponent of the avalanche-size probability density function τ out of the two-dimensional directed sandpile universality class τ = 4/3, into the mean field universality class τ = 3/2. Numerical investigation shows that these two classes are the only that exist on the directed sandpile, regardless of the underlying topology, as long as it is strictly layered. Randomly adding a small proportion of links connecting non adjacent layers in an otherwise layered network takes the system out of the mean field regime to produce non-trivial avalanche-size probability density function. Although these do not display proper scaling, they closely reproduce the behaviour observed on the Japanese inter-firm network.

Using Network Dynamical Influence to Drive Consensus

NASA Astrophysics Data System (ADS)

Punzo, Giuliano; Young, George F.; MacDonald, Malcolm; Leonard, Naomi E.

2016-05-01

Consensus and decision-making are often analysed in the context of networks, with many studies focusing attention on ranking the nodes of a network depending on their relative importance to information routing. Dynamical influence ranks the nodes with respect to their ability to influence the evolution of the associated network dynamical system. In this study it is shown that dynamical influence not only ranks the nodes, but also provides a naturally optimised distribution of effort to steer a network from one state to another. An example is provided where the “steering” refers to the physical change in velocity of self-propelled agents interacting through a network. Distinct from other works on this subject, this study looks at directed and hence more general graphs. The findings are presented with a theoretical angle, without targeting particular applications or networked systems; however, the framework and results offer parallels with biological flocks and swarms and opportunities for design of technological networks.

Passivity of Directed and Undirected Complex Dynamical Networks With Adaptive Coupling Weights.

PubMed

Wang, Jin-Liang; Wu, Huai-Ning; Huang, Tingwen; Ren, Shun-Yan; Wu, Jigang

2017-08-01

A complex dynamical network consisting of N identical neural networks with reaction-diffusion terms is considered in this paper. First, several passivity definitions for the systems with different dimensions of input and output are given. By utilizing some inequality techniques, several criteria are presented, ensuring the passivity of the complex dynamical network under the designed adaptive law. Then, we discuss the relationship between the synchronization and output strict passivity of the proposed network model. Furthermore, these results are extended to the case when the topological structure of the network is undirected. Finally, two examples with numerical simulations are provided to illustrate the correctness and effectiveness of the proposed results.

Resilience and Controllability of Dynamic Collective Behaviors

PubMed Central

Komareji, Mohammad; Bouffanais, Roland

2013-01-01

The network paradigm is used to gain insight into the structural root causes of the resilience of consensus in dynamic collective behaviors, and to analyze the controllability of the swarm dynamics. Here we devise the dynamic signaling network which is the information transfer channel underpinning the swarm dynamics of the directed interagent connectivity based on a topological neighborhood of interactions. The study of the connectedness of the swarm signaling network reveals the profound relationship between group size and number of interacting neighbors, which is found to be in good agreement with field observations on flock of starlings [Ballerini et al. (2008) Proc. Natl. Acad. Sci. USA, 105: 1232]. Using a dynamical model, we generate dynamic collective behaviors enabling us to uncover that the swarm signaling network is a homogeneous clustered small-world network, thus facilitating emergent outcomes if connectedness is maintained. Resilience of the emergent consensus is tested by introducing exogenous environmental noise, which ultimately stresses how deeply intertwined are the swarm dynamics in the physical and network spaces. The availability of the signaling network allows us to analytically establish for the first time the number of driver agents necessary to fully control the swarm dynamics. PMID:24358209

Reversible large–scale modification of cortical networks during neuroprosthetic control

PubMed Central

Ganguly, Karunesh; Wallis, Jonathan D.

2012-01-01

Brain-Machine Interfaces (BMI) provide a framework to study cortical dynamics and the neural correlates of learning. Neuroprosthetic control has been associated with tuning changes in specific neurons directly projecting to the BMI (hereafter ‘direct neurons’). However, little is known about the larger network dynamics. By monitoring ensembles of neurons that were either causally linked to BMI control or indirectly involved, here we show that proficient neuroprosthetic control is associated with large-scale modifications to the cortical network in macaque monkeys. Specifically, there were changes in the preferred direction of both direct and indirect neurons. Interestingly, with learning, there was a relative decrease in the net modulation of indirect neural activity in comparison to the direct activity. These widespread differential changes in the direct and indirect population activity were remarkably stable from one day to the next and readily coexisted with the long-standing cortical network for upper limb control. Thus, the process of learning BMI control is associated with differential modification of neural populations based on their specific relation to movement control. PMID:21499255

Reversible large-scale modification of cortical networks during neuroprosthetic control.

PubMed

Ganguly, Karunesh; Dimitrov, Dragan F; Wallis, Jonathan D; Carmena, Jose M

2011-05-01

Brain-machine interfaces (BMIs) provide a framework for studying cortical dynamics and the neural correlates of learning. Neuroprosthetic control has been associated with tuning changes in specific neurons directly projecting to the BMI (hereafter referred to as direct neurons). However, little is known about the larger network dynamics. By monitoring ensembles of neurons that were either causally linked to BMI control or indirectly involved, we found that proficient neuroprosthetic control is associated with large-scale modifications to the cortical network in macaque monkeys. Specifically, there were changes in the preferred direction of both direct and indirect neurons. Notably, with learning, there was a relative decrease in the net modulation of indirect neural activity in comparison with direct activity. These widespread differential changes in the direct and indirect population activity were markedly stable from one day to the next and readily coexisted with the long-standing cortical network for upper limb control. Thus, the process of learning BMI control is associated with differential modification of neural populations based on their specific relation to movement control.

An opinion-driven behavioral dynamics model for addictive behaviors

DOE PAGES

Moore, Thomas W.; Finley, Patrick D.; Apelberg, Benjamin J.; ...

2015-04-08

We present a model of behavioral dynamics that combines a social network-based opinion dynamics model with behavioral mapping. The behavioral component is discrete and history-dependent to represent situations in which an individual’s behavior is initially driven by opinion and later constrained by physiological or psychological conditions that serve to maintain the behavior. Additionally, individuals are modeled as nodes in a social network connected by directed edges. Parameter sweeps illustrate model behavior and the effects of individual parameters and parameter interactions on model results. Mapping a continuous opinion variable into a discrete behavioral space induces clustering on directed networks. Clusters providemore » targets of opportunity for influencing the network state; however, the smaller the network the greater the stochasticity and potential variability in outcomes. Furthermore, this has implications both for behaviors that are influenced by close relationships verses those influenced by societal norms and for the effectiveness of strategies for influencing those behaviors.« less

Location-Based Services in Vehicular Networks

ERIC Educational Resources Information Center

Wu, Di

2013-01-01

Location-based services have been identified as a promising communication paradigm in highly mobile and dynamic vehicular networks. However, existing mobile ad hoc networking cannot be directly applied to vehicular networking due to differences in traffic conditions, mobility models and network topologies. On the other hand, hybrid architectures…

Reconstructing networks from dynamics with correlated noise

NASA Astrophysics Data System (ADS)

Tam, H. C.; Ching, Emily S. C.; Lai, Pik-Yin

2018-07-01

Reconstructing the structure of complex networks from measurements of the nodes is a challenge in many branches of science. External influences are always present and act as a noise to the networks of interest. In this paper, we present a method for reconstructing networks from measured dynamics of the nodes subjected to correlated noise that cannot be approximated by a white noise. This method can reconstruct the links of both bidirectional and directed networks, the correlation time and strength of the noise, and also the relative coupling strength of the links when the coupling functions have certain properties. Our method is built upon theoretical relations between network structure and measurable quantities from the dynamics that we have derived for systems that have fixed point dynamics in the noise-free limit. Using these theoretical results, we can further explain the shortcomings of two common practices of inferring links for bidirectional networks using the Pearson correlation coefficient and the partial correlation coefficient.

From structure to function, via dynamics

NASA Astrophysics Data System (ADS)

Stetter, O.; Soriano, J.; Geisel, T.; Battaglia, D.

2013-01-01

Neurons in the brain are wired into a synaptic network that spans multiple scales, from local circuits within cortical columns to fiber tracts interconnecting distant areas. However, brain function require the dynamic control of inter-circuit interactions on time-scales faster than synaptic changes. In particular, strength and direction of causal influences between neural populations (described by the so-called directed functional connectivity) must be reconfigurable even when the underlying structural connectivity is fixed. Such directed functional influences can be quantified resorting to causal analysis of time-series based on tools like Granger Causality or Transfer Entropy. The ability to quickly reorganize inter-areal interactions is a chief requirement for performance in a changing natural environment. But how can manifold functional networks stem "on demand" from an essentially fixed structure? We explore the hypothesis that the self-organization of neuronal synchronous activity underlies the control of brain functional connectivity. Based on simulated and real recordings of critical neuronal cultures in vitro, as well as on mean-field and spiking network models of interacting brain areas, we have found that "function follows dynamics", rather than structure. Different dynamic states of a same structural network, characterized by different synchronization properties, are indeed associated to different functional digraphs (functional multiplicity). We also highlight the crucial role of dynamics in establishing a structure-to-function link, by showing that whenever different structural topologies lead to similar dynamical states, than the associated functional connectivities are also very similar (structural degeneracy).

Three-Dimensional Multiscale Modeling of Dendritic Spacing Selection During Al-Si Directional Solidification

NASA Astrophysics Data System (ADS)

Tourret, Damien; Clarke, Amy J.; Imhoff, Seth D.; Gibbs, Paul J.; Gibbs, John W.; Karma, Alain

2015-08-01

We present a three-dimensional extension of the multiscale dendritic needle network (DNN) model. This approach enables quantitative simulations of the unsteady dynamics of complex hierarchical networks in spatially extended dendritic arrays. We apply the model to directional solidification of Al-9.8 wt.%Si alloy and directly compare the model predictions with measurements from experiments with in situ x-ray imaging. We focus on the dynamical selection of primary spacings over a range of growth velocities, and the influence of sample geometry on the selection of spacings. Simulation results show good agreement with experiments. The computationally efficient DNN model opens new avenues for investigating the dynamics of large dendritic arrays at scales relevant to solidification experiments and processes.

Scaling of Directed Dynamical Small-World Networks with Random Responses

NASA Astrophysics Data System (ADS)

Zhu, Chen-Ping; Xiong, Shi-Jie; Tian, Ying-Jie; Li, Nan; Jiang, Ke-Sheng

2004-05-01

A dynamical model of small-world networks, with directed links which describe various correlations in social and natural phenomena, is presented. Random responses of sites to the input message are introduced to simulate real systems. The interplay of these ingredients results in the collective dynamical evolution of a spinlike variable S(t) of the whole network. The global average spreading length s and average spreading time s are found to scale as p-αln(N with different exponents. Meanwhile, S(t) behaves in a duple scaling form for N≫N*: S˜f(p-βqγt˜), where p and q are rewiring and external parameters, α, β, and γ are scaling exponents, and f(t˜) is a universal function. Possible applications of the model are discussed.

Dynamics of subway networks based on vehicles operation timetable

NASA Astrophysics Data System (ADS)

Xiao, Xue-mei; Jia, Li-min; Wang, Yan-hui

2017-05-01

In this paper, a subway network is represented as a dynamic, directed and weighted graph, in which vertices represent subway stations and weights of edges represent the number of vehicles passing through the edges by considering vehicles operation timetable. Meanwhile the definitions of static and dynamic metrics which can represent vertices' and edges' local and global attributes are proposed. Based on the model and metrics, standard deviation is further introduced to study the dynamic properties (heterogeneity and vulnerability) of subway networks. Through a detailed analysis of the Beijing subway network, we conclude that with the existing network structure, the heterogeneity and vulnerability of the Beijing subway network varies over time when the vehicle operation timetable is taken into consideration, and the distribution of edge weights affects the performance of the network. In other words, although the vehicles operation timetable is restrained by the physical structure of the network, it determines the performances and properties of the Beijing subway network.

Exploring activity-driven network with biased walks

NASA Astrophysics Data System (ADS)

Wang, Yan; Wu, Ding Juan; Lv, Fang; Su, Meng Long

We investigate the concurrent dynamics of biased random walks and the activity-driven network, where the preferential transition probability is in terms of the edge-weighting parameter. We also obtain the analytical expressions for stationary distribution and the coverage function in directed and undirected networks, all of which depend on the weight parameter. Appropriately adjusting this parameter, more effective search strategy can be obtained when compared with the unbiased random walk, whether in directed or undirected networks. Since network weights play a significant role in the diffusion process.

Molecular inspired models for prediction and control of directional FSO/RF wireless networks

NASA Astrophysics Data System (ADS)

Llorca, Jaime; Milner, Stuart D.; Davis, Christopher C.

2010-08-01

Directional wireless networks using FSO and RF transmissions provide wireless backbone support for mobile communications in dynamic environments. The heterogeneous and dynamic nature of such networks challenges their robustness and requires self-organization mechanisms to assure end-to-end broadband connectivity. We developed a framework based on the definition of a potential energy function to characterize robustness in communication networks and the study of first and second order variations of the potential energy to provide prediction and control strategies for network performance optimization. In this paper, we present non-convex molecular potentials such as the Morse Potential, used to describe the potential energy of bonds within molecules, for the characterization of communication links in the presence of physical constraints such as the power available at the network nodes. The inclusion of the Morse Potential translates into adaptive control strategies where forces on network nodes drive the release, retention or reconfiguration of communication links for network performance optimization. Simulation results show the effectiveness of our self-organized control mechanism, where the physical topology reorganizes to maximize the number of source to destination communicating pairs. Molecular Normal Mode Analysis (NMA) techniques for assessing network performance degradation in dynamic networks are also presented. Preliminary results show correlation between peaks in the eigenvalues of the Hessian of the network potential and network degradation.

Temporal node centrality in complex networks

NASA Astrophysics Data System (ADS)

Kim, Hyoungshick; Anderson, Ross

2012-02-01

Many networks are dynamic in that their topology changes rapidly—on the same time scale as the communications of interest between network nodes. Examples are the human contact networks involved in the transmission of disease, ad hoc radio networks between moving vehicles, and the transactions between principals in a market. While we have good models of static networks, so far these have been lacking for the dynamic case. In this paper we present a simple but powerful model, the time-ordered graph, which reduces a dynamic network to a static network with directed flows. This enables us to extend network properties such as vertex degree, closeness, and betweenness centrality metrics in a very natural way to the dynamic case. We then demonstrate how our model applies to a number of interesting edge cases, such as where the network connectivity depends on a small number of highly mobile vertices or edges, and show that our centrality definition allows us to track the evolution of connectivity. Finally we apply our model and techniques to two real-world dynamic graphs of human contact networks and then discuss the implication of temporal centrality metrics in the real world.

A biologically inspired neural network for dynamic programming.

PubMed

Francelin Romero, R A; Kacpryzk, J; Gomide, F

2001-12-01

An artificial neural network with a two-layer feedback topology and generalized recurrent neurons, for solving nonlinear discrete dynamic optimization problems, is developed. A direct method to assign the weights of neural networks is presented. The method is based on Bellmann's Optimality Principle and on the interchange of information which occurs during the synaptic chemical processing among neurons. The neural network based algorithm is an advantageous approach for dynamic programming due to the inherent parallelism of the neural networks; further it reduces the severity of computational problems that can occur in methods like conventional methods. Some illustrative application examples are presented to show how this approach works out including the shortest path and fuzzy decision making problems.

Modeling Endoplasmic Reticulum Network Maintenance in a Plant Cell.

PubMed

Lin, Congping; White, Rhiannon R; Sparkes, Imogen; Ashwin, Peter

2017-07-11

The endoplasmic reticulum (ER) in plant cells forms a highly dynamic network of complex geometry. ER network morphology and dynamics are influenced by a number of biophysical processes, including filament/tubule tension, viscous forces, Brownian diffusion, and interactions with many other organelles and cytoskeletal elements. Previous studies have indicated that ER networks can be thought of as constrained minimal-length networks acted on by a variety of forces that perturb and/or remodel the network. Here, we study two specific biophysical processes involved in remodeling. One is the dynamic relaxation process involving a combination of tubule tension and viscous forces. The other is the rapid creation of cross-connection tubules by direct or indirect interactions with cytoskeletal elements. These processes are able to remodel the ER network: the first reduces network length and complexity whereas the second increases both. Using live cell imaging of ER network dynamics in tobacco leaf epidermal cells, we examine these processes on ER network dynamics. Away from regions of cytoplasmic streaming, we suggest that the dynamic network structure is a balance between the two processes, and we build an integrative model of the two processes for network remodeling. This model produces quantitatively similar ER networks to those observed in experiments. We use the model to explore the effect of parameter variation on statistical properties of the ER network. Copyright © 2017 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Structure Shapes Dynamics and Directionality in Diverse Brain Networks: Mathematical Principles and Empirical Confirmation in Three Species

NASA Astrophysics Data System (ADS)

Moon, Joon-Young; Kim, Junhyeok; Ko, Tae-Wook; Kim, Minkyung; Iturria-Medina, Yasser; Choi, Jee-Hyun; Lee, Joseph; Mashour, George A.; Lee, Uncheol

2017-04-01

Identifying how spatially distributed information becomes integrated in the brain is essential to understanding higher cognitive functions. Previous computational and empirical studies suggest a significant influence of brain network structure on brain network function. However, there have been few analytical approaches to explain the role of network structure in shaping regional activities and directionality patterns. In this study, analytical methods are applied to a coupled oscillator model implemented in inhomogeneous networks. We first derive a mathematical principle that explains the emergence of directionality from the underlying brain network structure. We then apply the analytical methods to the anatomical brain networks of human, macaque, and mouse, successfully predicting simulation and empirical electroencephalographic data. The results demonstrate that the global directionality patterns in resting state brain networks can be predicted solely by their unique network structures. This study forms a foundation for a more comprehensive understanding of how neural information is directed and integrated in complex brain networks.

Infraslow Electroencephalographic and Dynamic Resting State Network Activity.

PubMed

Grooms, Joshua K; Thompson, Garth J; Pan, Wen-Ju; Billings, Jacob; Schumacher, Eric H; Epstein, Charles M; Keilholz, Shella D

2017-06-01

A number of studies have linked the blood oxygenation level dependent (BOLD) signal to electroencephalographic (EEG) signals in traditional frequency bands (δ, θ, α, β, and γ), but the relationship between BOLD and its direct frequency correlates in the infraslow band (<1 Hz) has been little studied. Previously, work in rodents showed that infraslow local field potentials play a role in functional connectivity, particularly in the dynamic organization of large-scale networks. To examine the relationship between infraslow activity and network dynamics in humans, direct current (DC) EEG and resting state magnetic resonance imaging data were acquired simultaneously. The DC EEG signals were correlated with the BOLD signal in patterns that resembled resting state networks. Subsequent dynamic analysis showed that the correlation between DC EEG and the BOLD signal varied substantially over time, even within individual subjects. The variation in DC EEG appears to reflect the time-varying contribution of different resting state networks. Furthermore, some of the patterns of DC EEG and BOLD correlation are consistent with previous work demonstrating quasiperiodic spatiotemporal patterns of large-scale network activity in resting state. These findings demonstrate that infraslow electrical activity is linked to BOLD fluctuations in humans and that it may provide a basis for large-scale organization comparable to that observed in animal studies.

Infraslow Electroencephalographic and Dynamic Resting State Network Activity

PubMed Central

Grooms, Joshua K.; Thompson, Garth J.; Pan, Wen-Ju; Billings, Jacob; Schumacher, Eric H.; Epstein, Charles M.

2017-01-01

Abstract A number of studies have linked the blood oxygenation level dependent (BOLD) signal to electroencephalographic (EEG) signals in traditional frequency bands (δ, θ, α, β, and γ), but the relationship between BOLD and its direct frequency correlates in the infraslow band (<1 Hz) has been little studied. Previously, work in rodents showed that infraslow local field potentials play a role in functional connectivity, particularly in the dynamic organization of large-scale networks. To examine the relationship between infraslow activity and network dynamics in humans, direct current (DC) EEG and resting state magnetic resonance imaging data were acquired simultaneously. The DC EEG signals were correlated with the BOLD signal in patterns that resembled resting state networks. Subsequent dynamic analysis showed that the correlation between DC EEG and the BOLD signal varied substantially over time, even within individual subjects. The variation in DC EEG appears to reflect the time-varying contribution of different resting state networks. Furthermore, some of the patterns of DC EEG and BOLD correlation are consistent with previous work demonstrating quasiperiodic spatiotemporal patterns of large-scale network activity in resting state. These findings demonstrate that infraslow electrical activity is linked to BOLD fluctuations in humans and that it may provide a basis for large-scale organization comparable to that observed in animal studies. PMID:28462586

Highly dynamic animal contact network and implications on disease transmission

PubMed Central

Chen, Shi; White, Brad J.; Sanderson, Michael W.; Amrine, David E.; Ilany, Amiyaal; Lanzas, Cristina

2014-01-01

Contact patterns among hosts are considered as one of the most critical factors contributing to unequal pathogen transmission. Consequently, networks have been widely applied in infectious disease modeling. However most studies assume static network structure due to lack of accurate observation and appropriate analytic tools. In this study we used high temporal and spatial resolution animal position data to construct a high-resolution contact network relevant to infectious disease transmission. The animal contact network aggregated at hourly level was highly variable and dynamic within and between days, for both network structure (network degree distribution) and individual rank of degree distribution in the network (degree order). We integrated network degree distribution and degree order heterogeneities with a commonly used contact-based, directly transmitted disease model to quantify the effect of these two sources of heterogeneity on the infectious disease dynamics. Four conditions were simulated based on the combination of these two heterogeneities. Simulation results indicated that disease dynamics and individual contribution to new infections varied substantially among these four conditions under both parameter settings. Changes in the contact network had a greater effect on disease dynamics for pathogens with smaller basic reproduction number (i.e. R0 < 2). PMID:24667241

Distinguishing between direct and indirect directional couplings in large oscillator networks: Partial or non-partial phase analyses?

NASA Astrophysics Data System (ADS)

Rings, Thorsten; Lehnertz, Klaus

2016-09-01

We investigate the relative merit of phase-based methods for inferring directional couplings in complex networks of weakly interacting dynamical systems from multivariate time-series data. We compare the evolution map approach and its partialized extension to each other with respect to their ability to correctly infer the network topology in the presence of indirect directional couplings for various simulated experimental situations using coupled model systems. In addition, we investigate whether the partialized approach allows for additional or complementary indications of directional interactions in evolving epileptic brain networks using intracranial electroencephalographic recordings from an epilepsy patient. For such networks, both direct and indirect directional couplings can be expected, given the brain's connection structure and effects that may arise from limitations inherent to the recording technique. Our findings indicate that particularly in larger networks (number of nodes ≫10 ), the partialized approach does not provide information about directional couplings extending the information gained with the evolution map approach.

Controllability of flow-conservation networks

NASA Astrophysics Data System (ADS)

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

2017-07-01

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

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

PubMed

Lindner, Michael; Donner, Reik V

2017-03-01

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

Three-dimensional multiscale modeling of dendritic spacing selection during Al-Si directional solidification

DOE PAGES

Tourret, Damien; Clarke, Amy J.; Imhoff, Seth D.; ...

2015-05-27

We present a three-dimensional extension of the multiscale dendritic needle network (DNN) model. This approach enables quantitative simulations of the unsteady dynamics of complex hierarchical networks in spatially extended dendritic arrays. We apply the model to directional solidification of Al-9.8 wt.%Si alloy and directly compare the model predictions with measurements from experiments with in situ x-ray imaging. The focus is on the dynamical selection of primary spacings over a range of growth velocities, and the influence of sample geometry on the selection of spacings. Simulation results show good agreement with experiments. The computationally efficient DNN model opens new avenues formore » investigating the dynamics of large dendritic arrays at scales relevant to solidification experiments and processes.« less

Evaluation of artificial time series microarray data for dynamic gene regulatory network inference.

PubMed

Xenitidis, P; Seimenis, I; Kakolyris, S; Adamopoulos, A

2017-08-07

High-throughput technology like microarrays is widely used in the inference of gene regulatory networks (GRNs). We focused on time series data since we are interested in the dynamics of GRNs and the identification of dynamic networks. We evaluated the amount of information that exists in artificial time series microarray data and the ability of an inference process to produce accurate models based on them. We used dynamic artificial gene regulatory networks in order to create artificial microarray data. Key features that characterize microarray data such as the time separation of directly triggered genes, the percentage of directly triggered genes and the triggering function type were altered in order to reveal the limits that are imposed by the nature of microarray data on the inference process. We examined the effect of various factors on the inference performance such as the network size, the presence of noise in microarray data, and the network sparseness. We used a system theory approach and examined the relationship between the pole placement of the inferred system and the inference performance. We examined the relationship between the inference performance in the time domain and the true system parameter identification. Simulation results indicated that time separation and the percentage of directly triggered genes are crucial factors. Also, network sparseness, the triggering function type and noise in input data affect the inference performance. When two factors were simultaneously varied, it was found that variation of one parameter significantly affects the dynamic response of the other. Crucial factors were also examined using a real GRN and acquired results confirmed simulation findings with artificial data. Different initial conditions were also used as an alternative triggering approach. Relevant results confirmed that the number of datasets constitutes the most significant parameter with regard to the inference performance. Copyright © 2017 Elsevier Ltd. All rights reserved.

Network Reconstruction Using Nonparametric Additive ODE Models

PubMed Central

Henderson, James; Michailidis, George

2014-01-01

Network representations of biological systems are widespread and reconstructing unknown networks from data is a focal problem for computational biologists. For example, the series of biochemical reactions in a metabolic pathway can be represented as a network, with nodes corresponding to metabolites and edges linking reactants to products. In a different context, regulatory relationships among genes are commonly represented as directed networks with edges pointing from influential genes to their targets. Reconstructing such networks from data is a challenging problem receiving much attention in the literature. There is a particular need for approaches tailored to time-series data and not reliant on direct intervention experiments, as the former are often more readily available. In this paper, we introduce an approach to reconstructing directed networks based on dynamic systems models. Our approach generalizes commonly used ODE models based on linear or nonlinear dynamics by extending the functional class for the functions involved from parametric to nonparametric models. Concomitantly we limit the complexity by imposing an additive structure on the estimated slope functions. Thus the submodel associated with each node is a sum of univariate functions. These univariate component functions form the basis for a novel coupling metric that we define in order to quantify the strength of proposed relationships and hence rank potential edges. We show the utility of the method by reconstructing networks using simulated data from computational models for the glycolytic pathway of Lactocaccus Lactis and a gene network regulating the pluripotency of mouse embryonic stem cells. For purposes of comparison, we also assess reconstruction performance using gene networks from the DREAM challenges. We compare our method to those that similarly rely on dynamic systems models and use the results to attempt to disentangle the distinct roles of linearity, sparsity, and derivative estimation. PMID:24732037

Synchronization Dynamics of Coupled Chemical Oscillators

NASA Astrophysics Data System (ADS)

Tompkins, Nathan

The synchronization dynamics of complex networks have been extensively studied over the past few decades due to their ubiquity in the natural world. Prominent examples include cardiac rhythms, circadian rhythms, the flashing of fireflies, predator/prey population dynamics, mammalian gait, human applause, pendulum clocks, the electrical grid, and of the course the brain. Detailed experiments have been done to map the topology of many of these systems and significant advances have been made to describe the mathematics of these networks. Compared to these bodies of work relatively little has been done to directly test the role of topology in the synchronization dynamics of coupled oscillators. This Dissertation develops technology to examine the dynamics due to topology within networks of discrete oscillatory components. The oscillatory system used here consists of the photo-inhibitable Belousov-Zhabotinsky (BZ) reaction water-in-oil emulsion where the oscillatory drops are diffusively coupled to one another and the topology is defined by the geometry of the diffusive connections. Ring networks are created from a close-packed 2D array of drops using the Programmable Illumination Microscope (PIM) in order to test Turing's theory of morphogenesis directly. Further technology is developed to create custom planar networks of BZ drops in more complicated topologies which can be individually perturbed using illumination from the PIM. The work presented here establishes the validity of using the BZ emulsion system with a PIM to study the topology induced effects on the synchronization dynamics of coupled chemical oscillators, tests the successes and limitations of Turing's theory of morphogenesis, and develops new technology to further probe the effects of network topology on a system of coupled oscillators. Finally, this Dissertation concludes by describing ongoing experiments which utilize this new technology to examine topology induced transitions of synchronization dynamics of diffusively coupled chemical oscillators.

Small Modifications to Network Topology Can Induce Stochastic Bistable Spiking Dynamics in a Balanced Cortical Model

PubMed Central

McDonnell, Mark D.; Ward, Lawrence M.

2014-01-01

Abstract Directed random graph models frequently are used successfully in modeling the population dynamics of networks of cortical neurons connected by chemical synapses. Experimental results consistently reveal that neuronal network topology is complex, however, in the sense that it differs statistically from a random network, and differs for classes of neurons that are physiologically different. This suggests that complex network models whose subnetworks have distinct topological structure may be a useful, and more biologically realistic, alternative to random networks. Here we demonstrate that the balanced excitation and inhibition frequently observed in small cortical regions can transiently disappear in otherwise standard neuronal-scale models of fluctuation-driven dynamics, solely because the random network topology was replaced by a complex clustered one, whilst not changing the in-degree of any neurons. In this network, a small subset of cells whose inhibition comes only from outside their local cluster are the cause of bistable population dynamics, where different clusters of these cells irregularly switch back and forth from a sparsely firing state to a highly active state. Transitions to the highly active state occur when a cluster of these cells spikes sufficiently often to cause strong unbalanced positive feedback to each other. Transitions back to the sparsely firing state rely on occasional large fluctuations in the amount of non-local inhibition received. Neurons in the model are homogeneous in their intrinsic dynamics and in-degrees, but differ in the abundance of various directed feedback motifs in which they participate. Our findings suggest that (i) models and simulations should take into account complex structure that varies for neuron and synapse classes; (ii) differences in the dynamics of neurons with similar intrinsic properties may be caused by their membership in distinctive local networks; (iii) it is important to identify neurons that share physiological properties and location, but differ in their connectivity. PMID:24743633

Competing dynamic phases of active polymer networks

NASA Astrophysics Data System (ADS)

Freedman, Simon; Banerjee, Shiladitya; Dinner, Aaron R.

Recent experiments on in-vitro reconstituted assemblies of F-actin, myosin-II motors, and cross-linking proteins show that tuning local network properties can changes the fundamental biomechanical behavior of the system. For example, by varying cross-linker density and actin bundle rigidity, one can switch between contractile networks useful for reshaping cells, polarity sorted networks ideal for directed molecular transport, and frustrated networks with robust structural properties. To efficiently investigate the dynamic phases of actomyosin networks, we developed a coarse grained non-equilibrium molecular dynamics simulation of model semiflexible filaments, molecular motors, and cross-linkers with phenomenologically defined interactions. The simulation's accuracy was verified by benchmarking the mechanical properties of its individual components and collective behavior against experimental results at the molecular and network scales. By adjusting the model's parameters, we can reproduce the qualitative phases observed in experiment and predict the protein characteristics where phase crossovers could occur in collective network dynamics. Our model provides a framework for understanding cells' multiple uses of actomyosin networks and their applicability in materials research. Supported by the Department of Defense (DoD) through the National Defense Science & Engineering Graduate Fellowship (NDSEG) Program.

EEG-Based Quantification of Cortical Current Density and Dynamic Causal Connectivity Generalized across Subjects Performing BCI-Monitored Cognitive Tasks

PubMed Central

Courellis, Hristos; Mullen, Tim; Poizner, Howard; Cauwenberghs, Gert; Iversen, John R.

2017-01-01

Quantification of dynamic causal interactions among brain regions constitutes an important component of conducting research and developing applications in experimental and translational neuroscience. Furthermore, cortical networks with dynamic causal connectivity in brain-computer interface (BCI) applications offer a more comprehensive view of brain states implicated in behavior than do individual brain regions. However, models of cortical network dynamics are difficult to generalize across subjects because current electroencephalography (EEG) signal analysis techniques are limited in their ability to reliably localize sources across subjects. We propose an algorithmic and computational framework for identifying cortical networks across subjects in which dynamic causal connectivity is modeled among user-selected cortical regions of interest (ROIs). We demonstrate the strength of the proposed framework using a “reach/saccade to spatial target” cognitive task performed by 10 right-handed individuals. Modeling of causal cortical interactions was accomplished through measurement of cortical activity using (EEG), application of independent component clustering to identify cortical ROIs as network nodes, estimation of cortical current density using cortically constrained low resolution electromagnetic brain tomography (cLORETA), multivariate autoregressive (MVAR) modeling of representative cortical activity signals from each ROI, and quantification of the dynamic causal interaction among the identified ROIs using the Short-time direct Directed Transfer function (SdDTF). The resulting cortical network and the computed causal dynamics among its nodes exhibited physiologically plausible behavior, consistent with past results reported in the literature. This physiological plausibility of the results strengthens the framework's applicability in reliably capturing complex brain functionality, which is required by applications, such as diagnostics and BCI. PMID:28566997

Controllability and observability analysis for vertex domination centrality in directed networks

NASA Astrophysics Data System (ADS)

Wang, Bingbo; Gao, Lin; Gao, Yong; Deng, Yue; Wang, Yu

2014-06-01

Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces under the global minimum-cost condition, we introduce a novel direction-specific index, domination centrality, to assess the intervention capabilities of vertices in a directed network. Statistical studies demonstrate that the domination centrality is, to a great extent, encoded by the underlying network's degree distribution and that most network positions through which one can intervene in a system are vertices with high domination centrality rather than network hubs. To analyse the interaction and functional dependence between vertices when they are used to dominate a network, we define the domination similarity and detect significant functional modules in glossary and metabolic networks through clustering analysis. The experimental results provide strong evidence that our indices are effective and practical in accurately depicting the structure of directed networks.

Controllability and observability analysis for vertex domination centrality in directed networks

PubMed Central

Wang, Bingbo; Gao, Lin; Gao, Yong; Deng, Yue; Wang, Yu

2014-01-01

Topological centrality is a significant measure for characterising the relative importance of a node in a complex network. For directed networks that model dynamic processes, however, it is of more practical importance to quantify a vertex's ability to dominate (control or observe) the state of other vertices. In this paper, based on the determination of controllable and observable subspaces under the global minimum-cost condition, we introduce a novel direction-specific index, domination centrality, to assess the intervention capabilities of vertices in a directed network. Statistical studies demonstrate that the domination centrality is, to a great extent, encoded by the underlying network's degree distribution and that most network positions through which one can intervene in a system are vertices with high domination centrality rather than network hubs. To analyse the interaction and functional dependence between vertices when they are used to dominate a network, we define the domination similarity and detect significant functional modules in glossary and metabolic networks through clustering analysis. The experimental results provide strong evidence that our indices are effective and practical in accurately depicting the structure of directed networks. PMID:24954137

Recruitment dynamics in adaptive social networks

NASA Astrophysics Data System (ADS)

Shkarayev, Maxim; Shaw, Leah; Schwartz, Ira

2011-03-01

We model recruitment in social networks in the presence of birth and death processes. The recruitment is characterized by nodes changing their status to that of the recruiting class as a result of contact with recruiting nodes. The recruiting nodes may adapt their connections in order to improve recruitment capabilities, thus changing the network structure. We develop a mean-field theory describing the system dynamics. Using mean-field theory we characterize the dependence of the growth threshold of the recruiting class on the adaptation parameter. Furthermore, we investigate the effect of adaptation on the recruitment dynamics, as well as on network topology. The theoretical predictions are confirmed by the direct simulations of the full system.

Measuring the regulation of keratin filament network dynamics

PubMed Central

Moch, Marcin; Herberich, Gerlind; Aach, Til; Leube, Rudolf E.; Windoffer, Reinhard

2013-01-01

The organization of the keratin intermediate filament cytoskeleton is closely linked to epithelial function. To study keratin network plasticity and its regulation at different levels, tools are needed to localize and measure local network dynamics. In this paper, we present image analysis methods designed to determine the speed and direction of keratin filament motion and to identify locations of keratin filament polymerization and depolymerization at subcellular resolution. Using these methods, we have analyzed time-lapse fluorescence recordings of fluorescent keratin 13 in human vulva carcinoma-derived A431 cells. The fluorescent keratins integrated into the endogenous keratin cytoskeleton, and thereby served as reliable markers of keratin dynamics. We found that increased times after seeding correlated with down-regulation of inward-directed keratin filament movement. Bulk flow analyses further revealed that keratin filament polymerization in the cell periphery and keratin depolymerization in the more central cytoplasm were both reduced. Treating these cells and other human keratinocyte-derived cells with EGF reversed all these processes within a few minutes, coinciding with increased keratin phosphorylation. These results highlight the value of the newly developed tools for identifying modulators of keratin filament network dynamics and characterizing their mode of action, which, in turn, contributes to understanding the close link between keratin filament network plasticity and epithelial physiology. PMID:23757496

Network analysis applications in hydrology

NASA Astrophysics Data System (ADS)

Price, Katie

2017-04-01

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

Finite-time consensus for controlled dynamical systems in network

NASA Astrophysics Data System (ADS)

Zoghlami, Naim; Mlayeh, Rhouma; Beji, Lotfi; Abichou, Azgal

2018-04-01

The key challenges in networked dynamical systems are the component heterogeneities, nonlinearities, and the high dimension of the formulated vector of state variables. In this paper, the emphasise is put on two classes of systems in network include most controlled driftless systems as well as systems with drift. For each model structure that defines homogeneous and heterogeneous multi-system behaviour, we derive protocols leading to finite-time consensus. For each model evolving in networks forming a homogeneous or heterogeneous multi-system, protocols integrating sufficient conditions are derived leading to finite-time consensus. Likewise, for the networking topology, we make use of fixed directed and undirected graphs. To prove our approaches, finite-time stability theory and Lyapunov methods are considered. As illustrative examples, the homogeneous multi-unicycle kinematics and the homogeneous/heterogeneous multi-second order dynamics in networks are studied.

Framework based on communicability and flow to analyze complex network dynamics

NASA Astrophysics Data System (ADS)

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

2018-05-01

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

Qualitative dynamics semantics for SBGN process description.

PubMed

Rougny, Adrien; Froidevaux, Christine; Calzone, Laurence; Paulevé, Loïc

2016-06-16

Qualitative dynamics semantics provide a coarse-grain modeling of networks dynamics by abstracting away kinetic parameters. They allow to capture general features of systems dynamics, such as attractors or reachability properties, for which scalable analyses exist. The Systems Biology Graphical Notation Process Description language (SBGN-PD) has become a standard to represent reaction networks. However, no qualitative dynamics semantics taking into account all the main features available in SBGN-PD had been proposed so far. We propose two qualitative dynamics semantics for SBGN-PD reaction networks, namely the general semantics and the stories semantics, that we formalize using asynchronous automata networks. While the general semantics extends standard Boolean semantics of reaction networks by taking into account all the main features of SBGN-PD, the stories semantics allows to model several molecules of a network by a unique variable. The obtained qualitative models can be checked against dynamical properties and therefore validated with respect to biological knowledge. We apply our framework to reason on the qualitative dynamics of a large network (more than 200 nodes) modeling the regulation of the cell cycle by RB/E2F. The proposed semantics provide a direct formalization of SBGN-PD networks in dynamical qualitative models that can be further analyzed using standard tools for discrete models. The dynamics in stories semantics have a lower dimension than the general one and prune multiple behaviors (which can be considered as spurious) by enforcing the mutual exclusiveness between the activity of different nodes of a same story. Overall, the qualitative semantics for SBGN-PD allow to capture efficiently important dynamical features of reaction network models and can be exploited to further refine them.

Individual-based approach to epidemic processes on arbitrary dynamic contact networks

NASA Astrophysics Data System (ADS)

Rocha, Luis E. C.; Masuda, Naoki

2016-08-01

The dynamics of contact networks and epidemics of infectious diseases often occur on comparable time scales. Ignoring one of these time scales may provide an incomplete understanding of the population dynamics of the infection process. We develop an individual-based approximation for the susceptible-infected-recovered epidemic model applicable to arbitrary dynamic networks. Our framework provides, at the individual-level, the probability flow over time associated with the infection dynamics. This computationally efficient framework discards the correlation between the states of different nodes, yet provides accurate results in approximating direct numerical simulations. It naturally captures the temporal heterogeneities and correlations of contact sequences, fundamental ingredients regulating the timing and size of an epidemic outbreak, and the number of secondary infections. The high accuracy of our approximation further allows us to detect the index individual of an epidemic outbreak in real-life network data.

Markets on Networks

NASA Astrophysics Data System (ADS)

Toroczkai, Zoltan; Anghel, Marian; Bassler, Kevin; Korniss, Gyorgy

2003-03-01

The dynamics of human, and most biological populations is characterized by competition for resources. By its own nature, this dynamics creates the group of "elites", formed by those agents who have strategies that are the most successful in the given situation, and therefore the rest of the agents will tend to follow, imitate, or interact with them, creating a social structure of leadership in the agent society. These inter-agent communications generate a complex social network with small-world character which itself forms the substrate for a second network, the action network. The latter is a highly dynamic, adaptive, directed network, defined by those inter-agent communication links on the substrate along which the passed information /prediction is acted upon by the other agents. By using the minority game for competition dynamics, here we show that when the substrate network is highly connected, the action network spontaneously develops hubs with a broad distribution of out-degrees, defining a robust leadership structure that is scale-free. Furthermore, in certain, realistic parameter ranges, facilitated by information passing on the action network, agents can spontaneously generate a high degree of cooperation making the collective almost maximally efficient.

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

Dmitriev, Alexander S.; Yemelyanov, Ruslan Yu.; Moscow Institute of Physics and Technology

The paper deals with a new multi-element processor platform assigned for modelling the behaviour of interacting dynamical systems, i.e., active wireless network. Experimentally, this ensemble is implemented in an active network, the active nodes of which include direct chaotic transceivers and special actuator boards containing microcontrollers for modelling the dynamical systems and an information display unit (colored LEDs). The modelling technique and experimental results are described and analyzed.

Terminal Sliding Mode-Based Consensus Tracking Control for Networked Uncertain Mechanical Systems on Digraphs.

PubMed

Chen, Gang; Song, Yongduan; Guan, Yanfeng

2018-03-01

This brief investigates the finite-time consensus tracking control problem for networked uncertain mechanical systems on digraphs. A new terminal sliding-mode-based cooperative control scheme is developed to guarantee that the tracking errors converge to an arbitrarily small bound around zero in finite time. All the networked systems can have different dynamics and all the dynamics are unknown. A neural network is used at each node to approximate the local unknown dynamics. The control schemes are implemented in a fully distributed manner. The proposed control method eliminates some limitations in the existing terminal sliding-mode-based consensus control methods and extends the existing analysis methods to the case of directed graphs. Simulation results on networked robot manipulators are provided to show the effectiveness of the proposed control algorithms.

Comparison of neural network applications for channel assignment in cellular TDMA networks and dynamically sectored PCS networks

NASA Astrophysics Data System (ADS)

Hortos, William S.

1997-04-01

The use of artificial neural networks (NNs) to address the channel assignment problem (CAP) for cellular time-division multiple access and code-division multiple access networks has previously been investigated by this author and many others. The investigations to date have been based on a hexagonal cell structure established by omnidirectional antennas at the base stations. No account was taken of the use of spatial isolation enabled by directional antennas to reduce interference between mobiles. Any reduction in interference translates into increased capacity and consequently alters the performance of the NNs. Previous studies have sought to improve the performance of Hopfield- Tank network algorithms and self-organizing feature map algorithms applied primarily to static channel assignment (SCA) for cellular networks that handle uniformly distributed, stationary traffic in each cell for a single type of service. The resulting algorithms minimize energy functions representing interference constraint and ad hoc conditions that promote convergence to optimal solutions. While the structures of the derived neural network algorithms (NNAs) offer the potential advantages of inherent parallelism and adaptability to changing system conditions, this potential has yet to be fulfilled the CAP for emerging mobile networks. The next-generation communication infrastructures must accommodate dynamic operating conditions. Macrocell topologies are being refined to microcells and picocells that can be dynamically sectored by adaptively controlled, directional antennas and programmable transceivers. These networks must support the time-varying demands for personal communication services (PCS) that simultaneously carry voice, data and video and, thus, require new dynamic channel assignment (DCA) algorithms. This paper examines the impact of dynamic cell sectoring and geometric conditioning on NNAs developed for SCA in omnicell networks with stationary traffic to improve the metrics of convergence rate and call blocking. Genetic algorithms (GAs) are also considered in PCS networks as a means to overcome the known weakness of Hopfield NNAs in determining global minima. The resulting GAs for DCA in PCS networks are compared to improved DCA algorithms based on Hopfield NNs for stationary cellular networks. Algorithm performance is compared on the basis of rate of convergence, blocking probability, analytic complexity, and parametric sensitivity to transient traffic demands and channel interference.

Adaptive-network models of collective dynamics

NASA Astrophysics Data System (ADS)

Zschaler, G.

2012-09-01

Complex systems can often be modelled as networks, in which their basic units are represented by abstract nodes and the interactions among them by abstract links. This network of interactions is the key to understanding emergent collective phenomena in such systems. In most cases, it is an adaptive network, which is defined by a feedback loop between the local dynamics of the individual units and the dynamical changes of the network structure itself. This feedback loop gives rise to many novel phenomena. Adaptive networks are a promising concept for the investigation of collective phenomena in different systems. However, they also present a challenge to existing modelling approaches and analytical descriptions due to the tight coupling between local and topological degrees of freedom. In this work, which is essentially my PhD thesis, I present a simple rule-based framework for the investigation of adaptive networks, using which a wide range of collective phenomena can be modelled and analysed from a common perspective. In this framework, a microscopic model is defined by the local interaction rules of small network motifs, which can be implemented in stochastic simulations straightforwardly. Moreover, an approximate emergent-level description in terms of macroscopic variables can be derived from the microscopic rules, which we use to analyse the system's collective and long-term behaviour by applying tools from dynamical systems theory. We discuss three adaptive-network models for different collective phenomena within our common framework. First, we propose a novel approach to collective motion in insect swarms, in which we consider the insects' adaptive interaction network instead of explicitly tracking their positions and velocities. We capture the experimentally observed onset of collective motion qualitatively in terms of a bifurcation in this non-spatial model. We find that three-body interactions are an essential ingredient for collective motion to emerge. Moreover, we show what minimal microscopic interaction rules determine whether the transition to collective motion is continuous or discontinuous. Second, we consider a model of opinion formation in groups of individuals, where we focus on the effect of directed links in adaptive networks. Extending the adaptive voter model to directed networks, we find a novel fragmentation mechanism, by which the network breaks into distinct components of opposing agents. This fragmentation is mediated by the formation of self-stabilizing structures in the network, which do not occur in the undirected case. We find that they are related to degree correlations stemming from the interplay of link directionality and adaptive topological change. Third, we discuss a model for the evolution of cooperation among self-interested agents, in which the adaptive nature of their interaction network gives rise to a novel dynamical mechanism promoting cooperation. We show that even full cooperation can be achieved asymptotically if the networks' adaptive response to the agents' dynamics is sufficiently fast.

A network dynamics approach to chemical reaction networks

NASA Astrophysics Data System (ADS)

van der Schaft, A. J.; Rao, S.; Jayawardhana, B.

2016-04-01

A treatment of a chemical reaction network theory is given from the perspective of nonlinear network dynamics, in particular of consensus dynamics. By starting from the complex-balanced assumption, the reaction dynamics governed by mass action kinetics can be rewritten into a form which allows for a very simple derivation of a number of key results in the chemical reaction network theory, and which directly relates to the thermodynamics and port-Hamiltonian formulation of the system. Central in this formulation is the definition of a balanced Laplacian matrix on the graph of chemical complexes together with a resulting fundamental inequality. This immediately leads to the characterisation of the set of equilibria and their stability. Furthermore, the assumption of complex balancedness is revisited from the point of view of Kirchhoff's matrix tree theorem. Both the form of the dynamics and the deduced behaviour are very similar to consensus dynamics, and provide additional perspectives to the latter. Finally, using the classical idea of extending the graph of chemical complexes by a 'zero' complex, a complete steady-state stability analysis of mass action kinetics reaction networks with constant inflows and mass action kinetics outflows is given, and a unified framework is provided for structure-preserving model reduction of this important class of open reaction networks.

Small-World Network Spectra in Mean-Field Theory

NASA Astrophysics Data System (ADS)

Grabow, Carsten; Grosskinsky, Stefan; Timme, Marc

2012-05-01

Collective dynamics on small-world networks emerge in a broad range of systems with their spectra characterizing fundamental asymptotic features. Here we derive analytic mean-field predictions for the spectra of small-world models that systematically interpolate between regular and random topologies by varying their randomness. These theoretical predictions agree well with the actual spectra (obtained by numerical diagonalization) for undirected and directed networks and from fully regular to strongly random topologies. These results may provide analytical insights to empirically found features of dynamics on small-world networks from various research fields, including biology, physics, engineering, and social science.

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

PubMed Central

Tan, Shaolin; Lü, Jinhu

2016-01-01

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

Automated identification of functional dynamic networks from X-ray crystallography

PubMed Central

van den Bedem, Henry; Bhabha, Gira; Yang, Kun; Wright, Peter E.; Fraser, James S.

2013-01-01

Protein function often depends on the exchange between conformational substates. Allosteric ligand binding or distal mutations can stabilize specific active site conformations and consequently alter protein function. In addition to comparing independently determined X-ray crystal structures, alternative conformations observed at low levels of electron density have the potential to provide mechanistic insights into conformational dynamics. Here, we report a new multi-conformer contact network algorithm (CONTACT) that identifies networks of conformationally heterogeneous residues directly from high-resolution X-ray crystallography data. Contact networks in Escherichia coli dihydrofolate reductase (ecDHFR) predict the long-range pattern of NMR chemical shift perturbations of an allosteric mutation. A comparison of contact networks in wild type and mutant ecDHFR suggests how mutations that alter optimized networks of coordinated motions can impair catalytic function. Thus, CONTACT-guided mutagenesis will allow the structure-dynamics-function relationship to be exploited in protein engineering and design. PMID:23913260

CollaborationViz: Interactive Visual Exploration of Biomedical Research Collaboration Networks

PubMed Central

Bian, Jiang; Xie, Mengjun; Hudson, Teresa J.; Eswaran, Hari; Brochhausen, Mathias; Hanna, Josh; Hogan, William R.

2014-01-01

Social network analysis (SNA) helps us understand patterns of interaction between social entities. A number of SNA studies have shed light on the characteristics of research collaboration networks (RCNs). Especially, in the Clinical Translational Science Award (CTSA) community, SNA provides us a set of effective tools to quantitatively assess research collaborations and the impact of CTSA. However, descriptive network statistics are difficult for non-experts to understand. In this article, we present our experiences of building meaningful network visualizations to facilitate a series of visual analysis tasks. The basis of our design is multidimensional, visual aggregation of network dynamics. The resulting visualizations can help uncover hidden structures in the networks, elicit new observations of the network dynamics, compare different investigators and investigator groups, determine critical factors to the network evolution, and help direct further analyses. We applied our visualization techniques to explore the biomedical RCNs at the University of Arkansas for Medical Sciences – a CTSA institution. And, we created CollaborationViz, an open-source visual analytical tool to help network researchers and administration apprehend the network dynamics of research collaborations through interactive visualization. PMID:25405477

Spatial-Temporal Dynamics of High-Resolution Animal Networks: What Can We Learn from Domestic Animals?

PubMed

Chen, Shi; Ilany, Amiyaal; White, Brad J; Sanderson, Michael W; Lanzas, Cristina

2015-01-01

Animal social network is the key to understand many ecological and epidemiological processes. We used real-time location system (RTLS) to accurately track cattle position, analyze their proximity networks, and tested the hypothesis of temporal stationarity and spatial homogeneity in these networks during different daily time periods and in different areas of the pen. The network structure was analyzed using global network characteristics (network density), subgroup clustering (modularity), triadic property (transitivity), and dyadic interactions (correlation coefficient from a quadratic assignment procedure) at hourly level. We demonstrated substantial spatial-temporal heterogeneity in these networks and potential link between indirect animal-environment contact and direct animal-animal contact. But such heterogeneity diminished if data were collected at lower spatial (aggregated at entire pen level) or temporal (aggregated at daily level) resolution. The network structure (described by the characteristics such as density, modularity, transitivity, etc.) also changed substantially at different time and locations. There were certain time (feeding) and location (hay) that the proximity network structures were more consistent based on the dyadic interaction analysis. These results reveal new insights for animal network structure and spatial-temporal dynamics, provide more accurate descriptions of animal social networks, and allow more accurate modeling of multiple (both direct and indirect) disease transmission pathways.

The co-evolutionary dynamics of directed network of spin market agents

NASA Astrophysics Data System (ADS)

Horváth, Denis; Kuscsik, Zoltán; Gmitra, Martin

2006-09-01

The spin market model [S. Bornholdt, Int. J. Mod. Phys. C 12 (2001) 667] is generalized by employing co-evolutionary principles, where strategies of the interacting and competitive traders are represented by local and global couplings between the nodes of dynamic directed stochastic network. The co-evolutionary principles are applied in the frame of Bak-Sneppen self-organized dynamics [P. Bak, K. Sneppen, Phys. Rev. Lett. 71 (1993) 4083] that includes the processes of selection and extinction actuated by the local (node) fitness. The local fitness is related to orientation of spin agent with respect to the instant magnetization. The stationary regime is formed due to the interplay of self-organization and adaptivity effects. The fat tailed distributions of log-price returns are identified numerically. The non-trivial model consequence is the evidence of the long time market memory indicated by the power-law range of the autocorrelation function of volatility with exponent smaller than one. The simulations yield network topology with broad-scale node degree distribution characterized by the range of exponents 1.3<γin<3 coinciding with social networks.

DNA-Based Dynamic Reaction Networks.

PubMed

Fu, Ting; Lyu, Yifan; Liu, Hui; Peng, Ruizi; Zhang, Xiaobing; Ye, Mao; Tan, Weihong

2018-05-21

Deriving from logical and mechanical interactions between DNA strands and complexes, DNA-based artificial reaction networks (RNs) are attractive for their high programmability, as well as cascading and fan-out ability, which are similar to the basic principles of electronic logic gates. Arising from the dream of creating novel computing mechanisms, researchers have placed high hopes on the development of DNA-based dynamic RNs and have strived to establish the basic theories and operative strategies of these networks. This review starts by looking back on the evolution of DNA dynamic RNs; in particular' the most significant applications in biochemistry occurring in recent years. Finally, we discuss the perspectives of DNA dynamic RNs and give a possible direction for the development of DNA circuits. Copyright © 2018. Published by Elsevier Ltd.

Control range: a controllability-based index for node significance in directed networks

NASA Astrophysics Data System (ADS)

Wang, Bingbo; Gao, Lin; Gao, Yong

2012-04-01

While a large number of methods for module detection have been developed for undirected networks, it is difficult to adapt them to handle directed networks due to the lack of consensus criteria for measuring the node significance in a directed network. In this paper, we propose a novel structural index, the control range, motivated by recent studies on the structural controllability of large-scale directed networks. The control range of a node quantifies the size of the subnetwork that the node can effectively control. A related index, called the control range similarity, is also introduced to measure the structural similarity between two nodes. When applying the index of control range to several real-world and synthetic directed networks, it is observed that the control range of the nodes is mainly influenced by the network's degree distribution and that nodes with a low degree may have a high control range. We use the index of control range similarity to detect and analyze functional modules in glossary networks and the enzyme-centric network of homo sapiens. Our results, as compared with other approaches to module detection such as modularity optimization algorithm, dynamic algorithm and clique percolation method, indicate that the proposed indices are effective and practical in depicting structural and modular characteristics of sparse directed networks.

Implications of Network Topology on Stability

PubMed Central

Kinkhabwala, Ali

2015-01-01

In analogy to chemical reaction networks, I demonstrate the utility of expressing the governing equations of an arbitrary dynamical system (interaction network) as sums of real functions (generalized reactions) multiplied by real scalars (generalized stoichiometries) for analysis of its stability. The reaction stoichiometries and first derivatives define the network’s “influence topology”, a signed directed bipartite graph. Parameter reduction of the influence topology permits simplified expression of the principal minors (sums of products of non-overlapping bipartite cycles) and Hurwitz determinants (sums of products of the principal minors or the bipartite cycles directly) for assessing the network’s steady state stability. Visualization of the Hurwitz determinants over the reduced parameters defines the network’s stability phase space, delimiting the range of its dynamics (specifically, the possible numbers of unstable roots at each steady state solution). Any further explicit algebraic specification of the network will project onto this stability phase space. Stability analysis via this hierarchical approach is demonstrated on classical networks from multiple fields. PMID:25826219

Dynamic Infinite Mixed-Membership Stochastic Blockmodel.

PubMed

Fan, Xuhui; Cao, Longbing; Xu, Richard Yi Da

2015-09-01

Directional and pairwise measurements are often used to model interactions in a social network setting. The mixed-membership stochastic blockmodel (MMSB) was a seminal work in this area, and its ability has been extended. However, models such as MMSB face particular challenges in modeling dynamic networks, for example, with the unknown number of communities. Accordingly, this paper proposes a dynamic infinite mixed-membership stochastic blockmodel, a generalized framework that extends the existing work to potentially infinite communities inside a network in dynamic settings (i.e., networks are observed over time). Additional model parameters are introduced to reflect the degree of persistence among one's memberships at consecutive time stamps. Under this framework, two specific models, namely mixture time variant and mixture time invariant models, are proposed to depict two different time correlation structures. Two effective posterior sampling strategies and their results are presented, respectively, using synthetic and real-world data.

Cell fate reprogramming by control of intracellular network dynamics

NASA Astrophysics Data System (ADS)

Zanudo, Jorge G. T.; Albert, Reka

Identifying control strategies for biological networks is paramount for practical applications that involve reprogramming a cell's fate, such as disease therapeutics and stem cell reprogramming. Although the topic of controlling the dynamics of a system has a long history in control theory, most of this work is not directly applicable to intracellular networks. Here we present a network control method that integrates the structural and functional information available for intracellular networks to predict control targets. Formulated in a logical dynamic scheme, our control method takes advantage of certain function-dependent network components and their relation to steady states in order to identify control targets, which are guaranteed to drive any initial state to the target state with 100% effectiveness and need to be applied only transiently for the system to reach and stay in the desired state. We illustrate our method's potential to find intervention targets for cancer treatment and cell differentiation by applying it to a leukemia signaling network and to the network controlling the differentiation of T cells. We find that the predicted control targets are effective in a broad dynamic framework. Moreover, several of the predicted interventions are supported by experiments. This work was supported by NSF Grant PHY 1205840.

Analyzing neuronal networks using discrete-time dynamics

NASA Astrophysics Data System (ADS)

Ahn, Sungwoo; Smith, Brian H.; Borisyuk, Alla; Terman, David

2010-05-01

We develop mathematical techniques for analyzing detailed Hodgkin-Huxley like models for excitatory-inhibitory neuronal networks. Our strategy for studying a given network is to first reduce it to a discrete-time dynamical system. The discrete model is considerably easier to analyze, both mathematically and computationally, and parameters in the discrete model correspond directly to parameters in the original system of differential equations. While these networks arise in many important applications, a primary focus of this paper is to better understand mechanisms that underlie temporally dynamic responses in early processing of olfactory sensory information. The models presented here exhibit several properties that have been described for olfactory codes in an insect’s Antennal Lobe. These include transient patterns of synchronization and decorrelation of sensory inputs. By reducing the model to a discrete system, we are able to systematically study how properties of the dynamics, including the complex structure of the transients and attractors, depend on factors related to connectivity and the intrinsic and synaptic properties of cells within the network.

Network Physiology: How Organ Systems Dynamically Interact

PubMed Central

Bartsch, Ronny P.; Liu, Kang K. L.; Bashan, Amir; Ivanov, Plamen Ch.

2015-01-01

We systematically study how diverse physiologic systems in the human organism dynamically interact and collectively behave to produce distinct physiologic states and functions. This is a fundamental question in the new interdisciplinary field of Network Physiology, and has not been previously explored. Introducing the novel concept of Time Delay Stability (TDS), we develop a computational approach to identify and quantify networks of physiologic interactions from long-term continuous, multi-channel physiological recordings. We also develop a physiologically-motivated visualization framework to map networks of dynamical organ interactions to graphical objects encoded with information about the coupling strength of network links quantified using the TDS measure. Applying a system-wide integrative approach, we identify distinct patterns in the network structure of organ interactions, as well as the frequency bands through which these interactions are mediated. We establish first maps representing physiologic organ network interactions and discover basic rules underlying the complex hierarchical reorganization in physiologic networks with transitions across physiologic states. Our findings demonstrate a direct association between network topology and physiologic function, and provide new insights into understanding how health and distinct physiologic states emerge from networked interactions among nonlinear multi-component complex systems. The presented here investigations are initial steps in building a first atlas of dynamic interactions among organ systems. PMID:26555073

Linking Individual and Collective Behavior in Adaptive Social Networks

NASA Astrophysics Data System (ADS)

Pinheiro, Flávio L.; Santos, Francisco C.; Pacheco, Jorge M.

2016-03-01

Adaptive social structures are known to promote the evolution of cooperation. However, up to now the characterization of the collective, population-wide dynamics resulting from the self-organization of individual strategies on a coevolving, adaptive network has remained unfeasible. Here we establish a (reversible) link between individual (micro)behavior and collective (macro)behavior for coevolutionary processes. We demonstrate that an adaptive network transforms a two-person social dilemma locally faced by individuals into a collective dynamics that resembles that associated with an N -person coordination game, whose characterization depends sensitively on the relative time scales between the entangled behavioral and network evolutions. In particular, we show that the faster the relative rate of adaptation of the network, the smaller the critical fraction of cooperators required for cooperation to prevail, thus establishing a direct link between network adaptation and the evolution of cooperation. The framework developed here is general and may be readily applied to other dynamical processes occurring on adaptive networks, notably, the spreading of contagious diseases or the diffusion of innovations.

Diffusion in Colocation Contact Networks: The Impact of Nodal Spatiotemporal Dynamics.

PubMed

Thomas, Bryce; Jurdak, Raja; Zhao, Kun; Atkinson, Ian

2016-01-01

Temporal contact networks are studied to understand dynamic spreading phenomena such as communicable diseases or information dissemination. To establish how spatiotemporal dynamics of nodes impact spreading potential in colocation contact networks, we propose "inducement-shuffling" null models which break one or more correlations between times, locations and nodes. By reconfiguring the time and/or location of each node's presence in the network, these models induce alternative sets of colocation events giving rise to contact networks with varying spreading potential. This enables second-order causal reasoning about how correlations in nodes' spatiotemporal preferences not only lead to a given contact network but ultimately influence the network's spreading potential. We find the correlation between nodes and times to be the greatest impediment to spreading, while the correlation between times and locations slightly catalyzes spreading. Under each of the presented null models we measure both the number of contacts and infection prevalence as a function of time, with the surprising finding that the two have no direct causality.

Information diffusion in structured online social networks

NASA Astrophysics Data System (ADS)

Li, Pei; Zhang, Yini; Qiao, Fengcai; Wang, Hui

2015-05-01

Nowadays, due to the word-of-mouth effect, online social networks have been considered to be efficient approaches to conduct viral marketing, which makes it of great importance to understand the diffusion dynamics in online social networks. However, most research on diffusion dynamics in epidemiology and existing social networks cannot be applied directly to characterize online social networks. In this paper, we propose models to characterize the information diffusion in structured online social networks with push-based forwarding mechanism. We introduce the term user influence to characterize the average number of times that messages are browsed which is incurred by a given type user generating a message, and study the diffusion threshold, above which the user influence of generating a message will approach infinity. We conduct simulations and provide the simulation results, which are consistent with the theoretical analysis results perfectly. These results are of use in understanding the diffusion dynamics in online social networks and also critical for advertisers in viral marketing who want to estimate the user influence before posting an advertisement.

Realizing actual feedback control of complex network

NASA Astrophysics Data System (ADS)

Tu, Chengyi; Cheng, Yuhua

2014-06-01

In this paper, we present the concept of feedbackability and how to identify the Minimum Feedbackability Set of an arbitrary complex directed network. Furthermore, we design an estimator and a feedback controller accessing one MFS to realize actual feedback control, i.e. control the system to our desired state according to the estimated system internal state from the output of estimator. Last but not least, we perform numerical simulations of a small linear time-invariant dynamics network and a real simple food network to verify the theoretical results. The framework presented here could make an arbitrary complex directed network realize actual feedback control and deepen our understanding of complex systems.

Dynamic security contingency screening and ranking using neural networks.

PubMed

Mansour, Y; Vaahedi, E; El-Sharkawi, M A

1997-01-01

This paper summarizes BC Hydro's experience in applying neural networks to dynamic security contingency screening and ranking. The idea is to use the information on the prevailing operating condition and directly provide contingency screening and ranking using a trained neural network. To train the two neural networks for the large scale systems of BC Hydro and Hydro Quebec, in total 1691 detailed transient stability simulation were conducted, 1158 for BC Hydro system and 533 for the Hydro Quebec system. The simulation program was equipped with the energy margin calculation module (second kick) to measure the energy margin in each run. The first set of results showed poor performance for the neural networks in assessing the dynamic security. However a number of corrective measures improved the results significantly. These corrective measures included: 1) the effectiveness of output; 2) the number of outputs; 3) the type of features (static versus dynamic); 4) the number of features; 5) system partitioning; and 6) the ratio of training samples to features. The final results obtained using the large scale systems of BC Hydro and Hydro Quebec demonstrates a good potential for neural network in dynamic security assessment contingency screening and ranking.

Characterizing time series: when Granger causality triggers complex networks

NASA Astrophysics Data System (ADS)

Ge, Tian; Cui, Yindong; Lin, Wei; Kurths, Jürgen; Liu, Chong

2012-08-01

In this paper, we propose a new approach to characterize time series with noise perturbations in both the time and frequency domains by combining Granger causality and complex networks. We construct directed and weighted complex networks from time series and use representative network measures to describe their physical and topological properties. Through analyzing the typical dynamical behaviors of some physical models and the MIT-BIHMassachusetts Institute of Technology-Beth Israel Hospital. human electrocardiogram data sets, we show that the proposed approach is able to capture and characterize various dynamics and has much potential for analyzing real-world time series of rather short length.

Decompositions of large-scale biological systems based on dynamical properties.

PubMed

Soranzo, Nicola; Ramezani, Fahimeh; Iacono, Giovanni; Altafini, Claudio

2012-01-01

Given a large-scale biological network represented as an influence graph, in this article we investigate possible decompositions of the network aimed at highlighting specific dynamical properties. The first decomposition we study consists in finding a maximal directed acyclic subgraph of the network, which dynamically corresponds to searching for a maximal open-loop subsystem of the given system. Another dynamical property investigated is strong monotonicity. We propose two methods to deal with this property, both aimed at decomposing the system into strongly monotone subsystems, but with different structural characteristics: one method tends to produce a single large strongly monotone component, while the other typically generates a set of smaller disjoint strongly monotone subsystems. Original heuristics for the methods investigated are described in the article. altafini@sissa.it

Dynamical modeling and analysis of large cellular regulatory networks

NASA Astrophysics Data System (ADS)

Bérenguier, D.; Chaouiya, C.; Monteiro, P. T.; Naldi, A.; Remy, E.; Thieffry, D.; Tichit, L.

2013-06-01

The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.

Simulating market dynamics: interactions between consumer psychology and social networks.

PubMed

Janssen, Marco A; Jager, Wander

2003-01-01

Markets can show different types of dynamics, from quiet markets dominated by one or a few products, to markets with continual penetration of new and reintroduced products. In a previous article we explored the dynamics of markets from a psychological perspective using a multi-agent simulation model. The main results indicated that the behavioral rules dominating the artificial consumer's decision making determine the resulting market dynamics, such as fashions, lock-in, and unstable renewal. Results also show the importance of psychological variables like social networks, preferences, and the need for identity to explain the dynamics of markets. In this article we extend this work in two directions. First, we will focus on a more systematic investigation of the effects of different network structures. The previous article was based on Watts and Strogatz's approach, which describes the small-world and clustering characteristics in networks. More recent research demonstrated that many large networks display a scale-free power-law distribution for node connectivity. In terms of market dynamics this may imply that a small proportion of consumers may have an exceptional influence on the consumptive behavior of others (hubs, or early adapters). We show that market dynamics is a self-organized property depending on the interaction between the agents' decision-making process (heuristics), the product characteristics (degree of satisfaction of unit of consumption, visibility), and the structure of interactions between agents (size of network and hubs in a social network).

Dynamical graph theory networks techniques for the analysis of sparse connectivity networks in dementia

NASA Astrophysics Data System (ADS)

Tahmassebi, Amirhessam; Pinker-Domenig, Katja; Wengert, Georg; Lobbes, Marc; Stadlbauer, Andreas; Romero, Francisco J.; Morales, Diego P.; Castillo, Encarnacion; Garcia, Antonio; Botella, Guillermo; Meyer-Bäse, Anke

2017-05-01

Graph network models in dementia have become an important computational technique in neuroscience to study fundamental organizational principles of brain structure and function of neurodegenerative diseases such as dementia. The graph connectivity is reflected in the connectome, the complete set of structural and functional connections of the graph network, which is mostly based on simple Pearson correlation links. In contrast to simple Pearson correlation networks, the partial correlations (PC) only identify direct correlations while indirect associations are eliminated. In addition to this, the state-of-the-art techniques in brain research are based on static graph theory, which is unable to capture the dynamic behavior of the brain connectivity, as it alters with disease evolution. We propose a new research avenue in neuroimaging connectomics based on combining dynamic graph network theory and modeling strategies at different time scales. We present the theoretical framework for area aggregation and time-scale modeling in brain networks as they pertain to disease evolution in dementia. This novel paradigm is extremely powerful, since we can derive both static parameters pertaining to node and area parameters, as well as dynamic parameters, such as system's eigenvalues. By implementing and analyzing dynamically both disease driven PC-networks and regular concentration networks, we reveal differences in the structure of these network that play an important role in the temporal evolution of this disease. The described research is key to advance biomedical research on novel disease prediction trajectories and dementia therapies.

Experimental evidence for the effect of habitat loss on the dynamics of migratory networks.

PubMed

Betini, Gustavo S; Fitzpatrick, Mark J; Norris, D Ryan

2015-06-01

Migratory animals present a unique challenge for understanding the consequences of habitat loss on population dynamics because individuals are typically distributed over a series of interconnected breeding and non-breeding sites (termed migratory network). Using replicated breeding and non-breeding populations of Drosophila melanogaster and a mathematical model, we investigated three hypotheses to explain how habitat loss influenced the dynamics of populations in networks with different degrees of connectivity between breeding and non-breeding seasons. We found that habitat loss increased the degree of connectivity in the network and influenced population size at sites that were not directly connected to the site where habitat loss occurred. However, connected networks only buffered global population declines at high levels of habitat loss. Our results demonstrate why knowledge of the patterns of connectivity across a species range is critical for predicting the effects of environmental change and provide empirical evidence for why connected migratory networks are commonly found in nature. © 2015 John Wiley & Sons Ltd/CNRS.

How to estimate the signs' configuration in the directed signed social networks?

NASA Astrophysics Data System (ADS)

Guo, Long; Gao, Fujuan; Jiang, Jian

2017-02-01

Inspired by the ensemble theory in statistical mechanics, we introduce a reshuffling approach to empirical analyze signs' configuration in the directed signed social networks of Epinions and Slashdots. In our reshuffling approach, each negative link has the reshuffling probability prs to exchange its sign with another positive link chosen randomly. Many reshuffled networks with different signs' configuration are built under different prss. For each reshuffled network, the entropies of the self social status are calculated and the opinion formation of the majority-rule model is analyzed. We find that Souts reach their own minimum values and the order parameter |m* | reaches its maximum value in the networks of Epinions and Slashdots without the reshuffling operation. Namely, individuals share the homogeneous properties of self social status and dynamic status in the real directed signed social networks. Our present work provides some interesting tools and perspective to understand the signs' configuration in signed social networks, especially in the online affiliation networks.

Dynamic and interacting complex networks

NASA Astrophysics Data System (ADS)

Dickison, Mark E.

This thesis employs methods of statistical mechanics and numerical simulations to study some aspects of dynamic and interacting complex networks. The mapping of various social and physical phenomena to complex networks has been a rich field in the past few decades. Subjects as broad as petroleum engineering, scientific collaborations, and the structure of the internet have all been analyzed in a network physics context, with useful and universal results. In the first chapter we introduce basic concepts in networks, including the two types of network configurations that are studied and the statistical physics and epidemiological models that form the framework of the network research, as well as covering various previously-derived results in network theory that are used in the work in the following chapters. In the second chapter we introduce a model for dynamic networks, where the links or the strengths of the links change over time. We solve the model by mapping dynamic networks to the problem of directed percolation, where the direction corresponds to the time evolution of the network. We show that the dynamic network undergoes a percolation phase transition at a critical concentration pc, that decreases with the rate r at which the network links are changed. The behavior near criticality is universal and independent of r. We find that for dynamic random networks fundamental laws are changed: i) The size of the giant component at criticality scales with the network size N for all values of r, rather than as N2/3 in static network, ii) In the presence of a broad distribution of disorder, the optimal path length between two nodes in a dynamic network scales as N1/2, compared to N1/3 in a static network. The third chapter consists of a study of the effect of quarantine on the propagation of epidemics on an adaptive network of social contacts. For this purpose, we analyze the susceptible-infected-recovered model in the presence of quarantine, where susceptible individuals protect themselves by disconnecting their links to infected neighbors with probability w and reconnecting them to other susceptible individuals chosen at random. Starting from a single infected individual, we show by an analytical approach and simulations that there is a phase transition at a critical rewiring (quarantine) threshold wc separating a phase (w < wc) where the disease reaches a large fraction of the population from a phase (w > wc) where the disease does not spread out. We find that in our model the topology of the network strongly affects the size of the propagation and that wc increases with the mean degree and heterogeneity of the network. We also find that wc is reduced if we perform a preferential rewiring, in which the rewiring probability is proportional to the degree of infected nodes. In the fourth chapter, we study epidemic processes on interconnected network systems, and find two distinct regimes. In strongly-coupled network systems, epidemics occur simultaneously across the entire system at a critical value betac. In contrast, in weakly-coupled network systems, a mixed phase exists below betac where an epidemic occurs in one network but does not spread to the coupled network. We derive an expression for the network and disease parameters that allow this mixed phase and verify it numerically. Public health implications of communities comprising these two classes of network systems are also mentioned.

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

Functional Roles of Slow Enzyme Conformational Changes in Network Dynamics

PubMed Central

Wu, Zhanghan; Xing, Jianhua

2012-01-01

Extensive studies from different fields reveal that many macromolecules, especially enzymes, show slow transitions among different conformations. This phenomenon is named such things as dynamic disorder, heterogeneity, hysteretic or mnemonic enzymes across these different fields, and has been directly demonstrated by single molecule enzymology and NMR studies recently. We analyzed enzyme slow conformational changes in the context of regulatory networks. A single enzymatic reaction with slow conformational changes can filter upstream network noises, and can either resonantly respond to the system stimulus at certain frequencies or respond adaptively for sustained input signals of the network fluctuations. It thus can serve as a basic functional motif with properties that are normally for larger intermolecular networks in the field of systems biology. We further analyzed examples including enzymes functioning against pH fluctuations, metabolic state change of Artemia embryos, and kinetic insulation of fluctuations in metabolic networks. The study also suggests that hysteretic enzymes may be building blocks of synthetic networks with various properties such as narrow-banded filtering. The work fills the missing gap between studies on enzyme biophysics and network level dynamics, and reveals that the coupling between the two is functionally important; it also suggests that the conformational dynamics of some enzymes may be evolutionally selected. PMID:23009855

Dynamics on Networks of Manifolds

NASA Astrophysics Data System (ADS)

DeVille, Lee; Lerman, Eugene

2015-03-01

We propose a precise definition of a continuous time dynamical system made up of interacting open subsystems. The interconnections of subsystems are coded by directed graphs. We prove that the appropriate maps of graphs called graph fibrations give rise to maps of dynamical systems. Consequently surjective graph fibrations give rise to invariant subsystems and injective graph fibrations give rise to projections of dynamical systems.

Decentralised fixed modes of networked MIMO systems

NASA Astrophysics Data System (ADS)

Hao, Yuqing; Duan, Zhisheng; Chen, Guanrong

2018-04-01

In this paper, decentralised fixed modes (DFMs) of a networked system are studied. The network topology is directed and weighted and the nodes are higher-dimensional linear time-invariant (LTI) dynamical systems. The effects of the network topology, the node-system dynamics, the external control inputs, and the inner interactions on the existence of DFMs for the whole networked system are investigated. A necessary and sufficient condition for networked multi-input/multi-output (MIMO) systems in a general topology to possess no DFMs is derived. For networked single-input/single-output (SISO) LTI systems in general as well as some typical topologies, some specific conditions for having no DFMs are established. It is shown that the existence of DFMs is an integrated result of the aforementioned relevant factors which cannot be decoupled into individual DFMs of the node-systems and the properties solely determined by the network topology.

Robust Weak Chimeras in Oscillator Networks with Delayed Linear and Quadratic Interactions

NASA Astrophysics Data System (ADS)

Bick, Christian; Sebek, Michael; Kiss, István Z.

2017-10-01

We present an approach to generate chimera dynamics (localized frequency synchrony) in oscillator networks with two populations of (at least) two elements using a general method based on a delayed interaction with linear and quadratic terms. The coupling design yields robust chimeras through a phase-model-based design of the delay and the ratio of linear and quadratic components of the interactions. We demonstrate the method in the Brusselator model and experiments with electrochemical oscillators. The technique opens the way to directly bridge chimera dynamics in phase models and real-world oscillator networks.

Dynamical Bayesian inference of time-evolving interactions: from a pair of coupled oscillators to networks of oscillators.

PubMed

Duggento, Andrea; Stankovski, Tomislav; McClintock, Peter V E; Stefanovska, Aneta

2012-12-01

Living systems have time-evolving interactions that, until recently, could not be identified accurately from recorded time series in the presence of noise. Stankovski et al. [Phys. Rev. Lett. 109, 024101 (2012)] introduced a method based on dynamical Bayesian inference that facilitates the simultaneous detection of time-varying synchronization, directionality of influence, and coupling functions. It can distinguish unsynchronized dynamics from noise-induced phase slips. The method is based on phase dynamics, with Bayesian inference of the time-evolving parameters being achieved by shaping the prior densities to incorporate knowledge of previous samples. We now present the method in detail using numerically generated data, data from an analog electronic circuit, and cardiorespiratory data. We also generalize the method to encompass networks of interacting oscillators and thus demonstrate its applicability to small-scale networks.

Local Difference Measures between Complex Networks for Dynamical System Model Evaluation

PubMed Central

Lange, Stefan; Donges, Jonathan F.; Volkholz, Jan; Kurths, Jürgen

2015-01-01

A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation. Building on a recent study by Feldhoff et al. [1] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system. Three types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node-weighted graphs are discussed. PMID:25856374

Local difference measures between complex networks for dynamical system model evaluation.

PubMed

Lange, Stefan; Donges, Jonathan F; Volkholz, Jan; Kurths, Jürgen

2015-01-01

A faithful modeling of real-world dynamical systems necessitates model evaluation. A recent promising methodological approach to this problem has been based on complex networks, which in turn have proven useful for the characterization of dynamical systems. In this context, we introduce three local network difference measures and demonstrate their capabilities in the field of climate modeling, where these measures facilitate a spatially explicit model evaluation.Building on a recent study by Feldhoff et al. [8] we comparatively analyze statistical and dynamical regional climate simulations of the South American monsoon system [corrected]. types of climate networks representing different aspects of rainfall dynamics are constructed from the modeled precipitation space-time series. Specifically, we define simple graphs based on positive as well as negative rank correlations between rainfall anomaly time series at different locations, and such based on spatial synchronizations of extreme rain events. An evaluation against respective networks built from daily satellite data provided by the Tropical Rainfall Measuring Mission 3B42 V7 reveals far greater differences in model performance between network types for a fixed but arbitrary climate model than between climate models for a fixed but arbitrary network type. We identify two sources of uncertainty in this respect. Firstly, climate variability limits fidelity, particularly in the case of the extreme event network; and secondly, larger geographical link lengths render link misplacements more likely, most notably in the case of the anticorrelation network; both contributions are quantified using suitable ensembles of surrogate networks. Our model evaluation approach is applicable to any multidimensional dynamical system and especially our simple graph difference measures are highly versatile as the graphs to be compared may be constructed in whatever way required. Generalizations to directed as well as edge- and node-weighted graphs are discussed.

Connectivity, excitability and activity patterns in neuronal networks

NASA Astrophysics Data System (ADS)

le Feber, Joost; Stoyanova, Irina I.; Chiappalone, Michela

2014-06-01

Extremely synchronized firing patterns such as those observed in brain diseases like epilepsy may result from excessive network excitability. Although network excitability is closely related to (excitatory) connectivity, a direct measure for network excitability remains unavailable. Several methods currently exist for estimating network connectivity, most of which are related to cross-correlation. An example is the conditional firing probability (CFP) analysis which calculates the pairwise probability (CFPi,j) that electrode j records an action potential at time t = τ, given that electrode i recorded a spike at t = 0. However, electrode i often records multiple spikes within the analysis interval, and CFP values are biased by the on-going dynamic state of the network. Here we show that in a linear approximation this bias may be removed by deconvoluting CFPi,j with the autocorrelation of i (i.e. CFPi,i), to obtain the single pulse response (SPRi,j)—the average response at electrode j to a single spike at electrode i. Thus, in a linear system SPRs would be independent of the dynamic network state. Nonlinear components of synaptic transmission, such as facilitation and short term depression, will however still affect SPRs. Therefore SPRs provide a clean measure of network excitability. We used carbachol and ghrelin to moderately activate cultured cortical networks to affect their dynamic state. Both neuromodulators transformed the bursting firing patterns of the isolated networks into more dispersed firing. We show that the influence of the dynamic state on SPRs is much smaller than the effect on CFPs, but not zero. The remaining difference reflects the alteration in network excitability. We conclude that SPRs are less contaminated by the dynamic network state and that mild excitation may decrease network excitability, possibly through short term synaptic depression.

miR-27 regulates mitochondrial networks by directly targeting the mitochondrial fission factor.

PubMed

Tak, Hyosun; Kim, Jihye; Jayabalan, Aravinth Kumar; Lee, Heejin; Kang, Hoin; Cho, Dong-Hyung; Ohn, Takbum; Nam, Suk Woo; Kim, Wook; Lee, Eun Kyung

2014-11-28

Mitochondrial morphology is dynamically regulated by forming small, fragmented units or interconnected networks, and this is a pivotal process that is used to maintain mitochondrial homeostasis. Although dysregulation of mitochondrial dynamics is related to the pathogenesis of several human diseases, its molecular mechanism is not fully elucidated. In this study, we demonstrate the potential role of miR-27 in the regulation of mitochondrial dynamics. Mitochondrial fission factor (MFF) mRNA is a direct target of miR-27, whose ectopic expression decreases MFF expression through binding to its 3'-untranslated region. Expression of miR-27 results in the elongation of mitochondria as well as an increased mitochondrial membrane potential and mitochondrial ATP level. Our results suggest that miR-27 is a novel regulator affecting morphological mitochondrial changes by targeting MFF.

miR-27 regulates mitochondrial networks by directly targeting the mitochondrial fission factor

PubMed Central

Tak, Hyosun; Kim, Jihye; Jayabalan, Aravinth Kumar; Lee, Heejin; Kang, Hoin; Cho, Dong-Hyung; Ohn, Takbum; Nam, Suk Woo; Kim, Wook; Lee, Eun Kyung

2014-01-01

Mitochondrial morphology is dynamically regulated by forming small, fragmented units or interconnected networks, and this is a pivotal process that is used to maintain mitochondrial homeostasis. Although dysregulation of mitochondrial dynamics is related to the pathogenesis of several human diseases, its molecular mechanism is not fully elucidated. In this study, we demonstrate the potential role of miR-27 in the regulation of mitochondrial dynamics. Mitochondrial fission factor (MFF) mRNA is a direct target of miR-27, whose ectopic expression decreases MFF expression through binding to its 3′-untranslated region. Expression of miR-27 results in the elongation of mitochondria as well as an increased mitochondrial membrane potential and mitochondrial ATP level. Our results suggest that miR-27 is a novel regulator affecting morphological mitochondrial changes by targeting MFF. PMID:25431021

Nonconsensus opinion model on directed networks

NASA Astrophysics Data System (ADS)

Qu, Bo; Li, Qian; Havlin, Shlomo; Stanley, H. Eugene; Wang, Huijuan

2014-11-01

Dynamic social opinion models have been widely studied on undirected networks, and most of them are based on spin interaction models that produce a consensus. In reality, however, many networks such as Twitter and the World Wide Web are directed and are composed of both unidirectional and bidirectional links. Moreover, from choosing a coffee brand to deciding who to vote for in an election, two or more competing opinions often coexist. In response to this ubiquity of directed networks and the coexistence of two or more opinions in decision-making situations, we study a nonconsensus opinion model introduced by Shao et al. [Phys. Rev. Lett. 103, 018701 (2009), 10.1103/PhysRevLett.103.018701] on directed networks. We define directionality ξ as the percentage of unidirectional links in a network, and we use the linear correlation coefficient ρ between the in-degree and out-degree of a node to quantify the relation between the in-degree and out-degree. We introduce two degree-preserving rewiring approaches which allow us to construct directed networks that can have a broad range of possible combinations of directionality ξ and linear correlation coefficient ρ and to study how ξ and ρ impact opinion competitions. We find that, as the directionality ξ or the in-degree and out-degree correlation ρ increases, the majority opinion becomes more dominant and the minority opinion's ability to survive is lowered.

Dynamics and control of diseases in networks with community structure.

PubMed

Salathé, Marcel; Jones, James H

2010-04-08

The dynamics of infectious diseases spread via direct person-to-person transmission (such as influenza, smallpox, HIV/AIDS, etc.) depends on the underlying host contact network. Human contact networks exhibit strong community structure. Understanding how such community structure affects epidemics may provide insights for preventing the spread of disease between communities by changing the structure of the contact network through pharmaceutical or non-pharmaceutical interventions. We use empirical and simulated networks to investigate the spread of disease in networks with community structure. We find that community structure has a major impact on disease dynamics, and we show that in networks with strong community structure, immunization interventions targeted at individuals bridging communities are more effective than those simply targeting highly connected individuals. Because the structure of relevant contact networks is generally not known, and vaccine supply is often limited, there is great need for efficient vaccination algorithms that do not require full knowledge of the network. We developed an algorithm that acts only on locally available network information and is able to quickly identify targets for successful immunization intervention. The algorithm generally outperforms existing algorithms when vaccine supply is limited, particularly in networks with strong community structure. Understanding the spread of infectious diseases and designing optimal control strategies is a major goal of public health. Social networks show marked patterns of community structure, and our results, based on empirical and simulated data, demonstrate that community structure strongly affects disease dynamics. These results have implications for the design of control strategies.

Network discovery with DCM

PubMed Central

Friston, Karl J.; Li, Baojuan; Daunizeau, Jean; Stephan, Klaas E.

2011-01-01

This paper is about inferring or discovering the functional architecture of distributed systems using Dynamic Causal Modelling (DCM). We describe a scheme that recovers the (dynamic) Bayesian dependency graph (connections in a network) using observed network activity. This network discovery uses Bayesian model selection to identify the sparsity structure (absence of edges or connections) in a graph that best explains observed time-series. The implicit adjacency matrix specifies the form of the network (e.g., cyclic or acyclic) and its graph-theoretical attributes (e.g., degree distribution). The scheme is illustrated using functional magnetic resonance imaging (fMRI) time series to discover functional brain networks. Crucially, it can be applied to experimentally evoked responses (activation studies) or endogenous activity in task-free (resting state) fMRI studies. Unlike conventional approaches to network discovery, DCM permits the analysis of directed and cyclic graphs. Furthermore, it eschews (implausible) Markovian assumptions about the serial independence of random fluctuations. The scheme furnishes a network description of distributed activity in the brain that is optimal in the sense of having the greatest conditional probability, relative to other networks. The networks are characterised in terms of their connectivity or adjacency matrices and conditional distributions over the directed (and reciprocal) effective connectivity between connected nodes or regions. We envisage that this approach will provide a useful complement to current analyses of functional connectivity for both activation and resting-state studies. PMID:21182971

Intermittent and sustained periodic windows in networked chaotic Rössler oscillators

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

He, Zhiwei; Sun, Yong; University of the Chinese Academy of Sciences, Beijing 100049

Route to chaos (or periodicity) in dynamical systems is one of fundamental problems. Here, dynamical behaviors of coupled chaotic Rössler oscillators on complex networks are investigated and two different types of periodic windows with the variation of coupling strength are found. Under a moderate coupling, the periodic window is intermittent, and the attractors within the window extremely sensitively depend on the initial conditions, coupling parameter, and topology of the network. Therefore, after adding or removing one edge of network, the periodic attractor can be destroyed and substituted by a chaotic one, or vice versa. In contrast, under an extremely weakmore » coupling, another type of periodic window appears, which insensitively depends on the initial conditions, coupling parameter, and network. It is sustained and unchanged for different types of network structure. It is also found that the phase differences of the oscillators are almost discrete and randomly distributed except that directly linked oscillators more likely have different phases. These dynamical behaviors have also been generally observed in other networked chaotic oscillators.« less

Containment control of networked autonomous underwater vehicles: A predictor-based neural DSC design.

PubMed

Peng, Zhouhua; Wang, Dan; Wang, Wei; Liu, Lu

2015-11-01

This paper investigates the containment control problem of networked autonomous underwater vehicles in the presence of model uncertainty and unknown ocean disturbances. A predictor-based neural dynamic surface control design method is presented to develop the distributed adaptive containment controllers, under which the trajectories of follower vehicles nearly converge to the dynamic convex hull spanned by multiple reference trajectories over a directed network. Prediction errors, rather than tracking errors, are used to update the neural adaptation laws, which are independent of the tracking error dynamics, resulting in two time-scales to govern the entire system. The stability property of the closed-loop network is established via Lyapunov analysis, and transient property is quantified in terms of L2 norms of the derivatives of neural weights, which are shown to be smaller than the classical neural dynamic surface control approach. Comparative studies are given to show the substantial improvements of the proposed new method. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

Neural networks with excitatory and inhibitory components: Direct and inverse problems by a mean-field approach

NASA Astrophysics Data System (ADS)

di Volo, Matteo; Burioni, Raffaella; Casartelli, Mario; Livi, Roberto; Vezzani, Alessandro

2016-01-01

We study the dynamics of networks with inhibitory and excitatory leak-integrate-and-fire neurons with short-term synaptic plasticity in the presence of depressive and facilitating mechanisms. The dynamics is analyzed by a heterogeneous mean-field approximation, which allows us to keep track of the effects of structural disorder in the network. We describe the complex behavior of different classes of excitatory and inhibitory components, which give rise to a rich dynamical phase diagram as a function of the fraction of inhibitory neurons. Using the same mean-field approach, we study and solve a global inverse problem: reconstructing the degree probability distributions of the inhibitory and excitatory components and the fraction of inhibitory neurons from the knowledge of the average synaptic activity field. This approach unveils new perspectives on the numerical study of neural network dynamics and the possibility of using these models as a test bed for the analysis of experimental data.

VORBrouter: A dynamic data routing system for Real-Time Seismic networks

NASA Astrophysics Data System (ADS)

Hansen, T.; Vernon, F.; Lindquist, K.; Orcutt, J.

2004-12-01

For anyone who has managed a moderately complex buffered real-time data transport system, the need for reliable adaptive data transport is clear. The ROADNet VORBrouter system, an extension to the ROADNet data catalog system [AGU-2003, Dynamic Dataflow Topology Monitoring for Real-time Seismic Networks], allows dynamic routing of real-time seismic data from sensor to end-user. Traditional networks consist of a series of data buffer computers with data transport interconnections configured by hand. This allows for arbitrarily complex data networks, which can often exceed full comprehension by network administrators, sometimes resulting in data loops or accidental data cutoff. In order to manage data transport systems in the event of a network failure, a network administrator must be called upon to change the data transport paths and to recover the missing data. Using VORBrouter, administrators can sleep at night while still providing 7/24 uninterupted data streams at realistic cost. This software package uses information from the ROADNet data catalog system to route packets around failed link outages and to new consumers in real-time. Dynamic data routing protocols operating on top of the Antelope Data buffering layer allow authorized users to request data sets from their local buffer and to have them delivered from anywhere within the network of buffers. The VORBrouter software also allows for dynamic routing around network outages, and the elimination of duplicate data paths within the network, while maintaining the nearly lossless data transport features exhibited by the underlying Antelope system. We present the design of the VORBrouter system, its features, limitations and some future research directions.

The default mode network and the working memory network are not anti-correlated during all phases of a working memory task.

PubMed

Piccoli, Tommaso; Valente, Giancarlo; Linden, David E J; Re, Marta; Esposito, Fabrizio; Sack, Alexander T; Di Salle, Francesco

2015-01-01

The default mode network and the working memory network are known to be anti-correlated during sustained cognitive processing, in a load-dependent manner. We hypothesized that functional connectivity among nodes of the two networks could be dynamically modulated by task phases across time. To address the dynamic links between default mode network and the working memory network, we used a delayed visuo-spatial working memory paradigm, which allowed us to separate three different phases of working memory (encoding, maintenance, and retrieval), and analyzed the functional connectivity during each phase within and between the default mode network and the working memory network networks. We found that the two networks are anti-correlated only during the maintenance phase of working memory, i.e. when attention is focused on a memorized stimulus in the absence of external input. Conversely, during the encoding and retrieval phases, when the external stimulation is present, the default mode network is positively coupled with the working memory network, suggesting the existence of a dynamically switching of functional connectivity between "task-positive" and "task-negative" brain networks. Our results demonstrate that the well-established dichotomy of the human brain (anti-correlated networks during rest and balanced activation-deactivation during cognition) has a more nuanced organization than previously thought and engages in different patterns of correlation and anti-correlation during specific sub-phases of a cognitive task. This nuanced organization reinforces the hypothesis of a direct involvement of the default mode network in cognitive functions, as represented by a dynamic rather than static interaction with specific task-positive networks, such as the working memory network.

The Default Mode Network and the Working Memory Network Are Not Anti-Correlated during All Phases of a Working Memory Task

PubMed Central

Piccoli, Tommaso; Valente, Giancarlo; Linden, David E. J.; Re, Marta; Esposito, Fabrizio; Sack, Alexander T.; Salle, Francesco Di

2015-01-01

Introduction The default mode network and the working memory network are known to be anti-correlated during sustained cognitive processing, in a load-dependent manner. We hypothesized that functional connectivity among nodes of the two networks could be dynamically modulated by task phases across time. Methods To address the dynamic links between default mode network and the working memory network, we used a delayed visuo-spatial working memory paradigm, which allowed us to separate three different phases of working memory (encoding, maintenance, and retrieval), and analyzed the functional connectivity during each phase within and between the default mode network and the working memory network networks. Results We found that the two networks are anti-correlated only during the maintenance phase of working memory, i.e. when attention is focused on a memorized stimulus in the absence of external input. Conversely, during the encoding and retrieval phases, when the external stimulation is present, the default mode network is positively coupled with the working memory network, suggesting the existence of a dynamically switching of functional connectivity between “task-positive” and “task-negative” brain networks. Conclusions Our results demonstrate that the well-established dichotomy of the human brain (anti-correlated networks during rest and balanced activation-deactivation during cognition) has a more nuanced organization than previously thought and engages in different patterns of correlation and anti-correlation during specific sub-phases of a cognitive task. This nuanced organization reinforces the hypothesis of a direct involvement of the default mode network in cognitive functions, as represented by a dynamic rather than static interaction with specific task-positive networks, such as the working memory network. PMID:25848951

The dynamics of information-driven coordination phenomena: A transfer entropy analysis

PubMed Central

Borge-Holthoefer, Javier; Perra, Nicola; Gonçalves, Bruno; González-Bailón, Sandra; Arenas, Alex; Moreno, Yamir; Vespignani, Alessandro

2016-01-01

Data from social media provide unprecedented opportunities to investigate the processes that govern the dynamics of collective social phenomena. We consider an information theoretical approach to define and measure the temporal and structural signatures typical of collective social events as they arise and gain prominence. We use the symbolic transfer entropy analysis of microblogging time series to extract directed networks of influence among geolocalized subunits in social systems. This methodology captures the emergence of system-level dynamics close to the onset of socially relevant collective phenomena. The framework is validated against a detailed empirical analysis of five case studies. In particular, we identify a change in the characteristic time scale of the information transfer that flags the onset of information-driven collective phenomena. Furthermore, our approach identifies an order-disorder transition in the directed network of influence between social subunits. In the absence of clear exogenous driving, social collective phenomena can be represented as endogenously driven structural transitions of the information transfer network. This study provides results that can help define models and predictive algorithms for the analysis of societal events based on open source data. PMID:27051875

The dynamics of information-driven coordination phenomena: A transfer entropy analysis.

PubMed

Borge-Holthoefer, Javier; Perra, Nicola; Gonçalves, Bruno; González-Bailón, Sandra; Arenas, Alex; Moreno, Yamir; Vespignani, Alessandro

2016-04-01

Data from social media provide unprecedented opportunities to investigate the processes that govern the dynamics of collective social phenomena. We consider an information theoretical approach to define and measure the temporal and structural signatures typical of collective social events as they arise and gain prominence. We use the symbolic transfer entropy analysis of microblogging time series to extract directed networks of influence among geolocalized subunits in social systems. This methodology captures the emergence of system-level dynamics close to the onset of socially relevant collective phenomena. The framework is validated against a detailed empirical analysis of five case studies. In particular, we identify a change in the characteristic time scale of the information transfer that flags the onset of information-driven collective phenomena. Furthermore, our approach identifies an order-disorder transition in the directed network of influence between social subunits. In the absence of clear exogenous driving, social collective phenomena can be represented as endogenously driven structural transitions of the information transfer network. This study provides results that can help define models and predictive algorithms for the analysis of societal events based on open source data.

Chaos control of the brushless direct current motor using adaptive dynamic surface control based on neural network with the minimum weights.

PubMed

Luo, Shaohua; Wu, Songli; Gao, Ruizhen

2015-07-01

This paper investigates chaos control for the brushless DC motor (BLDCM) system by adaptive dynamic surface approach based on neural network with the minimum weights. The BLDCM system contains parameter perturbation, chaotic behavior, and uncertainty. With the help of radial basis function (RBF) neural network to approximate the unknown nonlinear functions, the adaptive law is established to overcome uncertainty of the control gain. By introducing the RBF neural network and adaptive technology into the dynamic surface control design, a robust chaos control scheme is developed. It is proved that the proposed control approach can guarantee that all signals in the closed-loop system are globally uniformly bounded, and the tracking error converges to a small neighborhood of the origin. Simulation results are provided to show that the proposed approach works well in suppressing chaos and parameter perturbation.

Chaos control of the brushless direct current motor using adaptive dynamic surface control based on neural network with the minimum weights

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

Luo, Shaohua; Department of Mechanical Engineering, Chongqing Aerospace Polytechnic, Chongqing, 400021; Wu, Songli

2015-07-15

This paper investigates chaos control for the brushless DC motor (BLDCM) system by adaptive dynamic surface approach based on neural network with the minimum weights. The BLDCM system contains parameter perturbation, chaotic behavior, and uncertainty. With the help of radial basis function (RBF) neural network to approximate the unknown nonlinear functions, the adaptive law is established to overcome uncertainty of the control gain. By introducing the RBF neural network and adaptive technology into the dynamic surface control design, a robust chaos control scheme is developed. It is proved that the proposed control approach can guarantee that all signals in themore » closed-loop system are globally uniformly bounded, and the tracking error converges to a small neighborhood of the origin. Simulation results are provided to show that the proposed approach works well in suppressing chaos and parameter perturbation.« less

Nonzero-Sum Relationships in Mitigating Urban Carbon Emissions: A Dynamic Network Simulation.

PubMed

Chen, Shaoqing; Chen, Bin; Su, Meirong

2015-10-06

The "stove-pipe" way of thinking has been mostly used in mitigating carbon emissions and managing socioeconomics because of its convenience of implementation. However, systems-oriented approaches become imperative in pursuit of an efficient regulation of carbon emissions from systems as complicated as urban systems. The aim of this paper is to establish a dynamic network approach that is capable of assessing the effectiveness of carbon emissions mitigation in a more holistic way. A carbon metabolic network is constructed by modeling the carbon flows between economic sectors and environment. With the network shocked by interventions to the sectoral carbon flows, indirect emissions from the city are accounted for under certain carbon mitigation strategies. The nonzero-sum relationships between sectors and environmental components are identified based on utility analysis, which synthesize the nature of direct and indirect network interactions. The results of the case study of Beijing suggest that the stove-pipe mitigation strategies targeted the economic sectors might be not as efficient as they were expected. A direct cutting in material or energy import to the sectors may result in a rebound in indirect emissions and thus fails to achieve the carbon mitigation goal of the city as a whole. A promising way of foreseeing the dynamic mechanism of emissions is to analyze the nonzero-sum relationships between important urban components. Thinking cities as systems of interactions, the network approach is potentially a strong tool for appraising and filtering mitigation strategies of carbon emissions.

Distal gap junctions and active dendrites can tune network dynamics.

PubMed

Saraga, Fernanda; Ng, Leo; Skinner, Frances K

2006-03-01

Gap junctions allow direct electrical communication between CNS neurons. From theoretical and modeling studies, it is well known that although gap junctions can act to synchronize network output, they can also give rise to many other dynamic patterns including antiphase and other phase-locked states. The particular network pattern that arises depends on cellular, intrinsic properties that affect firing frequencies as well as the strength and location of the gap junctions. Interneurons or GABAergic neurons in hippocampus are diverse in their cellular characteristics and have been shown to have active dendrites. Furthermore, parvalbumin-positive GABAergic neurons, also known as basket cells, can contact one another via gap junctions on their distal dendrites. Using two-cell network models, we explore how distal electrical connections affect network output. We build multi-compartment models of hippocampal basket cells using NEURON and endow them with varying amounts of active dendrites. Two-cell networks of these model cells as well as reduced versions are explored. The relationship between intrinsic frequency and the level of active dendrites allows us to define three regions based on what sort of network dynamics occur with distal gap junction coupling. Weak coupling theory is used to predict the delineation of these regions as well as examination of phase response curves and distal dendritic polarization levels. We find that a nonmonotonic dependence of network dynamic characteristics (phase lags) on gap junction conductance occurs. This suggests that distal electrical coupling and active dendrite levels can control how sensitive network dynamics are to gap junction modulation. With the extended geometry, gap junctions located at more distal locations must have larger conductances for pure synchrony to occur. Furthermore, based on simulations with heterogeneous networks, it may be that one requires active dendrites if phase-locking is to occur in networks formed with distal gap junctions.

Generalizing Gillespie’s Direct Method to Enable Network-Free Simulations

DOE PAGES

Suderman, Ryan T.; Mitra, Eshan David; Lin, Yen Ting; ...

2018-03-28

Gillespie’s direct method for stochastic simulation of chemical kinetics is a staple of computational systems biology research. However, the algorithm requires explicit enumeration of all reactions and all chemical species that may arise in the system. In many cases, this is not feasible due to the combinatorial explosion of reactions and species in biological networks. Rule-based modeling frameworks provide a way to exactly represent networks containing such combinatorial complexity, and generalizations of Gillespie’s direct method have been developed as simulation engines for rule-based modeling languages. Here, we provide both a high-level description of the algorithms underlying the simulation engines, termedmore » network-free simulation algorithms, and how they have been applied in systems biology research. We also define a generic rule-based modeling framework and describe a number of technical details required for adapting Gillespie’s direct method for network-free simulation. Lastly, we briefly discuss potential avenues for advancing network-free simulation and the role they continue to play in modeling dynamical systems in biology.« less

Generalizing Gillespie’s Direct Method to Enable Network-Free Simulations

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

Suderman, Ryan T.; Mitra, Eshan David; Lin, Yen Ting

Gillespie’s direct method for stochastic simulation of chemical kinetics is a staple of computational systems biology research. However, the algorithm requires explicit enumeration of all reactions and all chemical species that may arise in the system. In many cases, this is not feasible due to the combinatorial explosion of reactions and species in biological networks. Rule-based modeling frameworks provide a way to exactly represent networks containing such combinatorial complexity, and generalizations of Gillespie’s direct method have been developed as simulation engines for rule-based modeling languages. Here, we provide both a high-level description of the algorithms underlying the simulation engines, termedmore » network-free simulation algorithms, and how they have been applied in systems biology research. We also define a generic rule-based modeling framework and describe a number of technical details required for adapting Gillespie’s direct method for network-free simulation. Lastly, we briefly discuss potential avenues for advancing network-free simulation and the role they continue to play in modeling dynamical systems in biology.« less

Development of dynamic Bayesian models for web application test management

NASA Astrophysics Data System (ADS)

Azarnova, T. V.; Polukhin, P. V.; Bondarenko, Yu V.; Kashirina, I. L.

2018-03-01

The mathematical apparatus of dynamic Bayesian networks is an effective and technically proven tool that can be used to model complex stochastic dynamic processes. According to the results of the research, mathematical models and methods of dynamic Bayesian networks provide a high coverage of stochastic tasks associated with error testing in multiuser software products operated in a dynamically changing environment. Formalized representation of the discrete test process as a dynamic Bayesian model allows us to organize the logical connection between individual test assets for multiple time slices. This approach gives an opportunity to present testing as a discrete process with set structural components responsible for the generation of test assets. Dynamic Bayesian network-based models allow us to combine in one management area individual units and testing components with different functionalities and a direct influence on each other in the process of comprehensive testing of various groups of computer bugs. The application of the proposed models provides an opportunity to use a consistent approach to formalize test principles and procedures, methods used to treat situational error signs, and methods used to produce analytical conclusions based on test results.

Self-Healing Nanocomposite Hydrogel with Well-Controlled Dynamic Mechanics

NASA Astrophysics Data System (ADS)

Li, Qiaochu; Mishra, Sumeet; Chen, Pangkuan; Tracy, Joseph; Holten-Andersen, Niels

Network dynamics is a crucial factor that determines the macroscopic self-healing rate and efficiency in polymeric hydrogel materials, yet its controllability is seldom studied in most reported self-healing hydrogel systems. Inspired by mussel's adhesion chemistry, we developed a novel approach to assemble inorganic nanoparticles and catechol-decorated PEG polymer into a hydrogel network. When utilized as reversible polymer-particle crosslinks, catechol-metal coordination bonds yield a unique gel network with dynamic mechanics controlled directly by interfacial crosslink structure. Taking advantage of this structure-property relationship at polymer-particle interfaces, we next designed a hierarchically structured hybrid gel with two distinct relaxation timescales. By tuning the relative contribution of the two hierarchical relaxation modes, we are able to finely control the gel's dynamic mechanical behavior from a viscoelastic fluid to a stiff solid, yet preserving its fast self-healing property without the need for external stimuli.

Rapid Self-healing Nanocomposite Hydrogel with Tunable Dynamic Mechanics

NASA Astrophysics Data System (ADS)

Li, Qiaochu; Mishra, Sumeet; Chapman, Brian; Chen, Pangkuan; Tracy, Joseph; Holten-Andersen, Niels

The macroscopic healing rate and efficiency in self-repairing hydrogel materials are largely determined by the dissociation dynamics of their polymer network, which is hardly achieved in a controllable manner. Inspired by mussel's adhesion chemistry, we developed a novel approach to assemble inorganic nanoparticles and catechol-decorated PEG polymer into a hydrogel network. When utilized as reversible polymer-particle crosslinks, catechol-metal coordination bonds yield a unique gel network with dynamic mechanics controlled directly by interfacial crosslink structure. Taking advantage of this structure-property relationship at polymer-particle interfaces, we designed a hierarchically structured hybrid gel with two distinct relaxation timescales. By tuning the relative contribution of the two relaxation modes, we are able to finely control the gel's dynamic mechanical behavior from a viscoelastic fluid to a stiff solid, yet preserving its rapid self-healing property without the need for external stimuli.

Spreading dynamics on complex networks: a general stochastic approach.

PubMed

Noël, Pierre-André; Allard, Antoine; Hébert-Dufresne, Laurent; Marceau, Vincent; Dubé, Louis J

2014-12-01

Dynamics on networks is considered from the perspective of Markov stochastic processes. We partially describe the state of the system through network motifs and infer any missing data using the available information. This versatile approach is especially well adapted for modelling spreading processes and/or population dynamics. In particular, the generality of our framework and the fact that its assumptions are explicitly stated suggests that it could be used as a common ground for comparing existing epidemics models too complex for direct comparison, such as agent-based computer simulations. We provide many examples for the special cases of susceptible-infectious-susceptible and susceptible-infectious-removed dynamics (e.g., epidemics propagation) and we observe multiple situations where accurate results may be obtained at low computational cost. Our perspective reveals a subtle balance between the complex requirements of a realistic model and its basic assumptions.

Dynamical Bayesian inference of time-evolving interactions: From a pair of coupled oscillators to networks of oscillators

NASA Astrophysics Data System (ADS)

Duggento, Andrea; Stankovski, Tomislav; McClintock, Peter V. E.; Stefanovska, Aneta

2012-12-01

Living systems have time-evolving interactions that, until recently, could not be identified accurately from recorded time series in the presence of noise. Stankovski [Phys. Rev. Lett.PRLTAO0031-900710.1103/PhysRevLett.109.024101 109, 024101 (2012)] introduced a method based on dynamical Bayesian inference that facilitates the simultaneous detection of time-varying synchronization, directionality of influence, and coupling functions. It can distinguish unsynchronized dynamics from noise-induced phase slips. The method is based on phase dynamics, with Bayesian inference of the time-evolving parameters being achieved by shaping the prior densities to incorporate knowledge of previous samples. We now present the method in detail using numerically generated data, data from an analog electronic circuit, and cardiorespiratory data. We also generalize the method to encompass networks of interacting oscillators and thus demonstrate its applicability to small-scale networks.

Deconstructing the core dynamics from a complex time-lagged regulatory biological circuit.

PubMed

Eriksson, O; Brinne, B; Zhou, Y; Björkegren, J; Tegnér, J

2009-03-01

Complex regulatory dynamics is ubiquitous in molecular networks composed of genes and proteins. Recent progress in computational biology and its application to molecular data generate a growing number of complex networks. Yet, it has been difficult to understand the governing principles of these networks beyond graphical analysis or extensive numerical simulations. Here the authors exploit several simplifying biological circumstances which thereby enable to directly detect the underlying dynamical regularities driving periodic oscillations in a dynamical nonlinear computational model of a protein-protein network. System analysis is performed using the cell cycle, a mathematically well-described complex regulatory circuit driven by external signals. By introducing an explicit time delay and using a 'tearing-and-zooming' approach the authors reduce the system to a piecewise linear system with two variables that capture the dynamics of this complex network. A key step in the analysis is the identification of functional subsystems by identifying the relations between state-variables within the model. These functional subsystems are referred to as dynamical modules operating as sensitive switches in the original complex model. By using reduced mathematical representations of the subsystems the authors derive explicit conditions on how the cell cycle dynamics depends on system parameters, and can, for the first time, analyse and prove global conditions for system stability. The approach which includes utilising biological simplifying conditions, identification of dynamical modules and mathematical reduction of the model complexity may be applicable to other well-characterised biological regulatory circuits. [Includes supplementary material].

Inference of time-delayed gene regulatory networks based on dynamic Bayesian network hybrid learning method

PubMed Central

Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui

2017-01-01

Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli, and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs. PMID:29113310

Inference of time-delayed gene regulatory networks based on dynamic Bayesian network hybrid learning method.

PubMed

Yu, Bin; Xu, Jia-Meng; Li, Shan; Chen, Cheng; Chen, Rui-Xin; Wang, Lei; Zhang, Yan; Wang, Ming-Hui

2017-10-06

Gene regulatory networks (GRNs) research reveals complex life phenomena from the perspective of gene interaction, which is an important research field in systems biology. Traditional Bayesian networks have a high computational complexity, and the network structure scoring model has a single feature. Information-based approaches cannot identify the direction of regulation. In order to make up for the shortcomings of the above methods, this paper presents a novel hybrid learning method (DBNCS) based on dynamic Bayesian network (DBN) to construct the multiple time-delayed GRNs for the first time, combining the comprehensive score (CS) with the DBN model. DBNCS algorithm first uses CMI2NI (conditional mutual inclusive information-based network inference) algorithm for network structure profiles learning, namely the construction of search space. Then the redundant regulations are removed by using the recursive optimization algorithm (RO), thereby reduce the false positive rate. Secondly, the network structure profiles are decomposed into a set of cliques without loss, which can significantly reduce the computational complexity. Finally, DBN model is used to identify the direction of gene regulation within the cliques and search for the optimal network structure. The performance of DBNCS algorithm is evaluated by the benchmark GRN datasets from DREAM challenge as well as the SOS DNA repair network in Escherichia coli , and compared with other state-of-the-art methods. The experimental results show the rationality of the algorithm design and the outstanding performance of the GRNs.

Form and function in gene regulatory networks: the structure of network motifs determines fundamental properties of their dynamical state space.

PubMed

Ahnert, S E; Fink, T M A

2016-07-01

Network motifs have been studied extensively over the past decade, and certain motifs, such as the feed-forward loop, play an important role in regulatory networks. Recent studies have used Boolean network motifs to explore the link between form and function in gene regulatory networks and have found that the structure of a motif does not strongly determine its function, if this is defined in terms of the gene expression patterns the motif can produce. Here, we offer a different, higher-level definition of the 'function' of a motif, in terms of two fundamental properties of its dynamical state space as a Boolean network. One is the basin entropy, which is a complexity measure of the dynamics of Boolean networks. The other is the diversity of cyclic attractor lengths that a given motif can produce. Using these two measures, we examine all 104 topologically distinct three-node motifs and show that the structural properties of a motif, such as the presence of feedback loops and feed-forward loops, predict fundamental characteristics of its dynamical state space, which in turn determine aspects of its functional versatility. We also show that these higher-level properties have a direct bearing on real regulatory networks, as both basin entropy and cycle length diversity show a close correspondence with the prevalence, in neural and genetic regulatory networks, of the 13 connected motifs without self-interactions that have been studied extensively in the literature. © 2016 The Authors.

Order or chaos in Boolean gene networks depends on the mean fraction of canalizing functions

NASA Astrophysics Data System (ADS)

Karlsson, Fredrik; Hörnquist, Michael

2007-10-01

We explore the connection between order/chaos in Boolean networks and the naturally occurring fraction of canalizing functions in such systems. This fraction turns out to give a very clear indication of whether the system possesses ordered or chaotic dynamics, as measured by Derrida plots, and also the degree of order when we compare different networks with the same number of vertices and edges. By studying also a wide distribution of indegrees in a network, we show that the mean probability of canalizing functions is a more reliable indicator of the type of dynamics for a finite network than the classical result on stability relating the bias to the mean indegree. Finally, we compare by direct simulations two biologically derived networks with networks of similar sizes but with power-law and Poisson distributions of indegrees, respectively. The biologically motivated networks are not more ordered than the latter, and in one case the biological network is even chaotic while the others are not.

Dynamical network of residue–residue contacts reveals coupled allosteric effects in recognition, catalysis, and mutation

PubMed Central

Doshi, Urmi; Holliday, Michael J.; Eisenmesser, Elan Z.; Hamelberg, Donald

2016-01-01

Detailed understanding of how conformational dynamics orchestrates function in allosteric regulation of recognition and catalysis remains ambiguous. Here, we simulate CypA using multiple-microsecond-long atomistic molecular dynamics in explicit solvent and carry out NMR experiments. We analyze a large amount of time-dependent multidimensional data with a coarse-grained approach and map key dynamical features within individual macrostates by defining dynamics in terms of residue–residue contacts. The effects of substrate binding are observed to be largely sensed at a location over 15 Å from the active site, implying its importance in allostery. Using NMR experiments, we confirm that a dynamic cluster of residues in this distal region is directly coupled to the active site. Furthermore, the dynamical network of interresidue contacts is found to be coupled and temporally dispersed, ranging over 4 to 5 orders of magnitude. Finally, using network centrality measures we demonstrate the changes in the communication network, connectivity, and influence of CypA residues upon substrate binding, mutation, and during catalysis. We identify key residues that potentially act as a bottleneck in the communication flow through the distinct regions in CypA and, therefore, as targets for future mutational studies. Mapping these dynamical features and the coupling of dynamics to function has crucial ramifications in understanding allosteric regulation in enzymes and proteins, in general. PMID:27071107

Hierarchical Organization for Large, Dynamic Radio Networks.

DTIC Science & Technology

1988-01-01

January 1985. [3] N. Shacharm and J. Tornow . Future Directions in Packet Radio Technology. In - Proc. of IEEE INFOCOM󈨙, Washington, D.C., 1985. [4] J.J...Freeman and Company, 1979. [7] J. Jubin and J. Tornow . The DARPA Packet Radio Network Protocols. Proceed- inga of the IEEE, 75(1):21-32, January 1987... Tornow . Future Directions in Packet Radio Technology. In Proc. of IEEE INFOCOM󈨙, Washington, D.C., 1985. [28] N. Shacham and J. Westcott. Future

Memory Dynamics in Cross-linked Actin Networks

NASA Astrophysics Data System (ADS)

Scheff, Danielle; Majumdar, Sayantan; Gardel, Margaret

Cells demonstrate the remarkable ability to adapt to mechanical stimuli through rearrangement of the actin cytoskeleton, a cross-linked network of actin filaments. In addition to its importance in cell biology, understanding this mechanical response provides strategies for creation of novel materials. A recent study has demonstrated that applied stress can encode mechanical memory in these networks through changes in network geometry, which gives rise to anisotropic shear response. Under later shear, the network is stiffer in the direction of the previously applied stress. However, the dynamics behind the encoding of this memory are unknown. To address this question, we explore the effect of varying either the rigidity of the cross-linkers or the length of actin filament on the time scales required for both memory encoding and over which it later decays. While previous experiments saw only a long-lived memory, initial results suggest another mechanism where memories relax relatively quickly. Overall, our study is crucial for understanding the process by which an external stress can impact network arrangement and thus the dynamics of memory formation.

Community Landscapes: An Integrative Approach to Determine Overlapping Network Module Hierarchy, Identify Key Nodes and Predict Network Dynamics

PubMed Central

Kovács, István A.; Palotai, Robin; Szalay, Máté S.; Csermely, Peter

2010-01-01

Background Network communities help the functional organization and evolution of complex networks. However, the development of a method, which is both fast and accurate, provides modular overlaps and partitions of a heterogeneous network, has proven to be rather difficult. Methodology/Principal Findings Here we introduce the novel concept of ModuLand, an integrative method family determining overlapping network modules as hills of an influence function-based, centrality-type community landscape, and including several widely used modularization methods as special cases. As various adaptations of the method family, we developed several algorithms, which provide an efficient analysis of weighted and directed networks, and (1) determine pervasively overlapping modules with high resolution; (2) uncover a detailed hierarchical network structure allowing an efficient, zoom-in analysis of large networks; (3) allow the determination of key network nodes and (4) help to predict network dynamics. Conclusions/Significance The concept opens a wide range of possibilities to develop new approaches and applications including network routing, classification, comparison and prediction. PMID:20824084

A network-based dynamical ranking system for competitive sports

NASA Astrophysics Data System (ADS)

Motegi, Shun; Masuda, Naoki

2012-12-01

From the viewpoint of networks, a ranking system for players or teams in sports is equivalent to a centrality measure for sports networks, whereby a directed link represents the result of a single game. Previously proposed network-based ranking systems are derived from static networks, i.e., aggregation of the results of games over time. However, the score of a player (or team) fluctuates over time. Defeating a renowned player in the peak performance is intuitively more rewarding than defeating the same player in other periods. To account for this factor, we propose a dynamic variant of such a network-based ranking system and apply it to professional men's tennis data. We derive a set of linear online update equations for the score of each player. The proposed ranking system predicts the outcome of the future games with a higher accuracy than the static counterparts.

On the Inference of Functional Circadian Networks Using Granger Causality

PubMed Central

Pourzanjani, Arya; Herzog, Erik D.; Petzold, Linda R.

2015-01-01

Being able to infer one way direct connections in an oscillatory network such as the suprachiastmatic nucleus (SCN) of the mammalian brain using time series data is difficult but crucial to understanding network dynamics. Although techniques have been developed for inferring networks from time series data, there have been no attempts to adapt these techniques to infer directional connections in oscillatory time series, while accurately distinguishing between direct and indirect connections. In this paper an adaptation of Granger Causality is proposed that allows for inference of circadian networks and oscillatory networks in general called Adaptive Frequency Granger Causality (AFGC). Additionally, an extension of this method is proposed to infer networks with large numbers of cells called LASSO AFGC. The method was validated using simulated data from several different networks. For the smaller networks the method was able to identify all one way direct connections without identifying connections that were not present. For larger networks of up to twenty cells the method shows excellent performance in identifying true and false connections; this is quantified by an area-under-the-curve (AUC) 96.88%. We note that this method like other Granger Causality-based methods, is based on the detection of high frequency signals propagating between cell traces. Thus it requires a relatively high sampling rate and a network that can propagate high frequency signals. PMID:26413748

Feedback topology and XOR-dynamics in Boolean networks with varying input structure

NASA Astrophysics Data System (ADS)

Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

Feedback topology and XOR-dynamics in Boolean networks with varying input structure.

PubMed

Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

The default network and self-generated thought: component processes, dynamic control, and clinical relevance

PubMed Central

Andrews-Hanna, Jessica R.; Smallwood, Jonathan; Spreng, R. Nathan

2014-01-01

Though only a decade has elapsed since the default network was first emphasized as being a large-scale brain system, recent years have brought great insight into the network’s adaptive functions. A growing theme highlights the default network as playing a key role in internally-directed—or self-generated—thought. Here, we synthesize recent findings from cognitive science, neuroscience, and clinical psychology to focus attention on two emerging topics as current and future directions surrounding the default network. First, we present evidence that self-generated thought is a multi-faceted construct whose component processes are supported by different subsystems within the network. Second, we highlight the dynamic nature of the default network, emphasizing its interaction with executive control systems when regulating aspects of internal thought. We conclude by discussing clinical implications of disruptions to the integrity of the network, and consider disorders when thought content becomes polarized or network interactions become disrupted or imbalanced. PMID:24502540

Fundamental structures of dynamic social networks.

PubMed

Sekara, Vedran; Stopczynski, Arkadiusz; Lehmann, Sune

2016-09-06

Social systems are in a constant state of flux, with dynamics spanning from minute-by-minute changes to patterns present on the timescale of years. Accurate models of social dynamics are important for understanding the spreading of influence or diseases, formation of friendships, and the productivity of teams. Although there has been much progress on understanding complex networks over the past decade, little is known about the regularities governing the microdynamics of social networks. Here, we explore the dynamic social network of a densely-connected population of ∼1,000 individuals and their interactions in the network of real-world person-to-person proximity measured via Bluetooth, as well as their telecommunication networks, online social media contacts, geolocation, and demographic data. These high-resolution data allow us to observe social groups directly, rendering community detection unnecessary. Starting from 5-min time slices, we uncover dynamic social structures expressed on multiple timescales. On the hourly timescale, we find that gatherings are fluid, with members coming and going, but organized via a stable core of individuals. Each core represents a social context. Cores exhibit a pattern of recurring meetings across weeks and months, each with varying degrees of regularity. Taken together, these findings provide a powerful simplification of the social network, where cores represent fundamental structures expressed with strong temporal and spatial regularity. Using this framework, we explore the complex interplay between social and geospatial behavior, documenting how the formation of cores is preceded by coordination behavior in the communication networks and demonstrating that social behavior can be predicted with high precision.

Fundamental structures of dynamic social networks

PubMed Central

Sekara, Vedran; Stopczynski, Arkadiusz; Lehmann, Sune

2016-01-01

Social systems are in a constant state of flux, with dynamics spanning from minute-by-minute changes to patterns present on the timescale of years. Accurate models of social dynamics are important for understanding the spreading of influence or diseases, formation of friendships, and the productivity of teams. Although there has been much progress on understanding complex networks over the past decade, little is known about the regularities governing the microdynamics of social networks. Here, we explore the dynamic social network of a densely-connected population of ∼1,000 individuals and their interactions in the network of real-world person-to-person proximity measured via Bluetooth, as well as their telecommunication networks, online social media contacts, geolocation, and demographic data. These high-resolution data allow us to observe social groups directly, rendering community detection unnecessary. Starting from 5-min time slices, we uncover dynamic social structures expressed on multiple timescales. On the hourly timescale, we find that gatherings are fluid, with members coming and going, but organized via a stable core of individuals. Each core represents a social context. Cores exhibit a pattern of recurring meetings across weeks and months, each with varying degrees of regularity. Taken together, these findings provide a powerful simplification of the social network, where cores represent fundamental structures expressed with strong temporal and spatial regularity. Using this framework, we explore the complex interplay between social and geospatial behavior, documenting how the formation of cores is preceded by coordination behavior in the communication networks and demonstrating that social behavior can be predicted with high precision. PMID:27555584

Interarrival times of message propagation on directed networks.

PubMed

Mihaljev, Tamara; de Arcangelis, Lucilla; Herrmann, Hans J

2011-08-01

One of the challenges in fighting cybercrime is to understand the dynamics of message propagation on botnets, networks of infected computers used to send viruses, unsolicited commercial emails (SPAM) or denial of service attacks. We map this problem to the propagation of multiple random walkers on directed networks and we evaluate the interarrival time distribution between successive walkers arriving at a target. We show that the temporal organization of this process, which models information propagation on unstructured peer to peer networks, has the same features as SPAM reaching a single user. We study the behavior of the message interarrival time distribution on three different network topologies using two different rules for sending messages. In all networks the propagation is not a pure Poisson process. It shows universal features on Poissonian networks and a more complex behavior on scale free networks. Results open the possibility to indirectly learn about the process of sending messages on networks with unknown topologies, by studying interarrival times at any node of the network.

Interarrival times of message propagation on directed networks

NASA Astrophysics Data System (ADS)

Mihaljev, Tamara; de Arcangelis, Lucilla; Herrmann, Hans J.

2011-08-01

One of the challenges in fighting cybercrime is to understand the dynamics of message propagation on botnets, networks of infected computers used to send viruses, unsolicited commercial emails (SPAM) or denial of service attacks. We map this problem to the propagation of multiple random walkers on directed networks and we evaluate the interarrival time distribution between successive walkers arriving at a target. We show that the temporal organization of this process, which models information propagation on unstructured peer to peer networks, has the same features as SPAM reaching a single user. We study the behavior of the message interarrival time distribution on three different network topologies using two different rules for sending messages. In all networks the propagation is not a pure Poisson process. It shows universal features on Poissonian networks and a more complex behavior on scale free networks. Results open the possibility to indirectly learn about the process of sending messages on networks with unknown topologies, by studying interarrival times at any node of the network.

Bottom-up view of water network-mediated CO2 reduction using cryogenic cluster ion spectroscopy and direct dynamics simulations.

PubMed

Breen, Kristin J; DeBlase, Andrew F; Guasco, Timothy L; Voora, Vamsee K; Jordan, Kenneth D; Nagata, Takashi; Johnson, Mark A

2012-01-26

The transition states of a chemical reaction in solution are generally accessed through exchange of thermal energy between the solvent and the reactants. As such, an ensemble of reacting systems approaches the transition state configuration of reactant and surrounding solvent in an incoherent manner that does not lend itself to direct experimental observation. Here we describe how gas-phase cluster chemistry can provide a detailed picture of the microscopic mechanics at play when a network of six water molecules mediates the trapping of a highly reactive "hydrated electron" onto a neutral CO(2) molecule to form a radical anion. The exothermic reaction is triggered from a metastable intermediate by selective excitation of either the reactant CO(2) or the water network, which is evidenced by the evaporative decomposition of the product cluster. Ab initio molecular dynamics simulations of energized CO(2)·(H(2)O)(6)(-) clusters are used to elucidate the nature of the network deformations that mediate intracluster electron capture, thus revealing the detailed solvent fluctuations implicit in the Marcus theory for electron-transfer kinetics in solution.

Dynamics of a minimal consumer network with bi-directional influence

NASA Astrophysics Data System (ADS)

Ekaterinchuk, Ekaterina; Jungeilges, Jochen; Ryazanova, Tatyana; Sushko, Iryna

2018-05-01

We study the dynamics of a model of interdependent consumer behavior defined by a family of two-dimensional noninvertible maps. This family belongs to a class of coupled logistic maps with different nonlinearity parameters and coupling terms that depend on one variable only. In our companion paper we considered the case of independent consumers as well as the case of uni-directionally connected consumers. The present paper aims at describing the dynamics in the case of a bi-directional connection. In particular, we investigate the bifurcation structure of the parameter plane associated with the strength of coupling between the consumers, focusing on the mechanisms of qualitative transformations of coexisting attractors and their basins of attraction.

Functional connectivity dynamically evolves on multiple time-scales over a static structural connectome: Models and mechanisms.

PubMed

Cabral, Joana; Kringelbach, Morten L; Deco, Gustavo

2017-10-15

Over the last decade, we have observed a revolution in brain structural and functional Connectomics. On one hand, we have an ever-more detailed characterization of the brain's white matter structural connectome. On the other, we have a repertoire of consistent functional networks that form and dissipate over time during rest. Despite the evident spatial similarities between structural and functional connectivity, understanding how different time-evolving functional networks spontaneously emerge from a single structural network requires analyzing the problem from the perspective of complex network dynamics and dynamical system's theory. In that direction, bottom-up computational models are useful tools to test theoretical scenarios and depict the mechanisms at the genesis of resting-state activity. Here, we provide an overview of the different mechanistic scenarios proposed over the last decade via computational models. Importantly, we highlight the need of incorporating additional model constraints considering the properties observed at finer temporal scales with MEG and the dynamical properties of FC in order to refresh the list of candidate scenarios. Copyright © 2017 Elsevier Inc. All rights reserved.

Health system tests CRM data base. Community Health Network uses direct mail to boost physicians.

PubMed

Botvin, Judith D

2003-01-01

A six-month pilot patient retention project for Community Health Network (CHN), Indianapolis, ran from July 2002 to January 2003. It was a direct mail campaign on behalf of some members of the group practices owned by CHN, designed to test the use of the system's CRM database. Patients of the physicians received personal, dynamically-generated cards reminding them to schedule appointments and tests. Each mailing cost $1.76, including production and mailing.

Optimizing performance of hybrid FSO/RF networks in realistic dynamic scenarios

NASA Astrophysics Data System (ADS)

Llorca, Jaime; Desai, Aniket; Baskaran, Eswaran; Milner, Stuart; Davis, Christopher

2005-08-01

Hybrid Free Space Optical (FSO) and Radio Frequency (RF) networks promise highly available wireless broadband connectivity and quality of service (QoS), particularly suitable for emerging network applications involving extremely high data rate transmissions such as high quality video-on-demand and real-time surveillance. FSO links are prone to atmospheric obscuration (fog, clouds, snow, etc) and are difficult to align over long distances due the use of narrow laser beams and the effect of atmospheric turbulence. These problems can be mitigated by using adjunct directional RF links, which provide backup connectivity. In this paper, methodologies for modeling and simulation of hybrid FSO/RF networks are described. Individual link propagation models are derived using scattering theory, as well as experimental measurements. MATLAB is used to generate realistic atmospheric obscuration scenarios, including moving cloud layers at different altitudes. These scenarios are then imported into a network simulator (OPNET) to emulate mobile hybrid FSO/RF networks. This framework allows accurate analysis of the effects of node mobility, atmospheric obscuration and traffic demands on network performance, and precise evaluation of topology reconfiguration algorithms as they react to dynamic changes in the network. Results show how topology reconfiguration algorithms, together with enhancements to TCP/IP protocols which reduce the network response time, enable the network to rapidly detect and act upon link state changes in highly dynamic environments, ensuring optimized network performance and availability.

Dynamic Network-Based Epistasis Analysis: Boolean Examples

PubMed Central

Azpeitia, Eugenio; Benítez, Mariana; Padilla-Longoria, Pablo; Espinosa-Soto, Carlos; Alvarez-Buylla, Elena R.

2011-01-01

In this article we focus on how the hierarchical and single-path assumptions of epistasis analysis can bias the inference of gene regulatory networks. Here we emphasize the critical importance of dynamic analyses, and specifically illustrate the use of Boolean network models. Epistasis in a broad sense refers to gene interactions, however, as originally proposed by Bateson, epistasis is defined as the blocking of a particular allelic effect due to the effect of another allele at a different locus (herein, classical epistasis). Classical epistasis analysis has proven powerful and useful, allowing researchers to infer and assign directionality to gene interactions. As larger data sets are becoming available, the analysis of classical epistasis is being complemented with computer science tools and system biology approaches. We show that when the hierarchical and single-path assumptions are not met in classical epistasis analysis, the access to relevant information and the correct inference of gene interaction topologies is hindered, and it becomes necessary to consider the temporal dynamics of gene interactions. The use of dynamical networks can overcome these limitations. We particularly focus on the use of Boolean networks that, like classical epistasis analysis, relies on logical formalisms, and hence can complement classical epistasis analysis and relax its assumptions. We develop a couple of theoretical examples and analyze them from a dynamic Boolean network model perspective. Boolean networks could help to guide additional experiments and discern among alternative regulatory schemes that would be impossible or difficult to infer without the elimination of these assumption from the classical epistasis analysis. We also use examples from the literature to show how a Boolean network-based approach has resolved ambiguities and guided epistasis analysis. Our article complements previous accounts, not only by focusing on the implications of the hierarchical and single-path assumption, but also by demonstrating the importance of considering temporal dynamics, and specifically introducing the usefulness of Boolean network models and also reviewing some key properties of network approaches. PMID:22645556

A Rotational Motion Perception Neural Network Based on Asymmetric Spatiotemporal Visual Information Processing.

PubMed

Hu, Bin; Yue, Shigang; Zhang, Zhuhong

All complex motion patterns can be decomposed into several elements, including translation, expansion/contraction, and rotational motion. In biological vision systems, scientists have found that specific types of visual neurons have specific preferences to each of the three motion elements. There are computational models on translation and expansion/contraction perceptions; however, little has been done in the past to create computational models for rotational motion perception. To fill this gap, we proposed a neural network that utilizes a specific spatiotemporal arrangement of asymmetric lateral inhibited direction selective neural networks (DSNNs) for rotational motion perception. The proposed neural network consists of two parts-presynaptic and postsynaptic parts. In the presynaptic part, there are a number of lateral inhibited DSNNs to extract directional visual cues. In the postsynaptic part, similar to the arrangement of the directional columns in the cerebral cortex, these direction selective neurons are arranged in a cyclic order to perceive rotational motion cues. In the postsynaptic network, the delayed excitation from each direction selective neuron is multiplied by the gathered excitation from this neuron and its unilateral counterparts depending on which rotation, clockwise (cw) or counter-cw (ccw), to perceive. Systematic experiments under various conditions and settings have been carried out and validated the robustness and reliability of the proposed neural network in detecting cw or ccw rotational motion. This research is a critical step further toward dynamic visual information processing.All complex motion patterns can be decomposed into several elements, including translation, expansion/contraction, and rotational motion. In biological vision systems, scientists have found that specific types of visual neurons have specific preferences to each of the three motion elements. There are computational models on translation and expansion/contraction perceptions; however, little has been done in the past to create computational models for rotational motion perception. To fill this gap, we proposed a neural network that utilizes a specific spatiotemporal arrangement of asymmetric lateral inhibited direction selective neural networks (DSNNs) for rotational motion perception. The proposed neural network consists of two parts-presynaptic and postsynaptic parts. In the presynaptic part, there are a number of lateral inhibited DSNNs to extract directional visual cues. In the postsynaptic part, similar to the arrangement of the directional columns in the cerebral cortex, these direction selective neurons are arranged in a cyclic order to perceive rotational motion cues. In the postsynaptic network, the delayed excitation from each direction selective neuron is multiplied by the gathered excitation from this neuron and its unilateral counterparts depending on which rotation, clockwise (cw) or counter-cw (ccw), to perceive. Systematic experiments under various conditions and settings have been carried out and validated the robustness and reliability of the proposed neural network in detecting cw or ccw rotational motion. This research is a critical step further toward dynamic visual information processing.

Interfacial welding of dynamic covalent network polymers

NASA Astrophysics Data System (ADS)

Yu, Kai; Shi, Qian; Li, Hao; Jabour, John; Yang, Hua; Dunn, Martin L.; Wang, Tiejun; Qi, H. Jerry

2016-09-01

Dynamic covalent network (or covalent adaptable network) polymers can rearrange their macromolecular chain network by bond exchange reactions (BERs) where an active unit replaces a unit in an existing bond to form a new bond. Such macromolecular events, when they occur in large amounts, can attribute to unusual properties that are not seen in conventional covalent network polymers, such as shape reforming and surface welding; the latter further enables the important attributes of material malleability and powder-based reprocessing. In this paper, a multiscale modeling framework is developed to study the surface welding of thermally induced dynamic covalent network polymers. At the macromolecular network level, a lattice model is developed to describe the chain density evolution across the interface and its connection to bulk stress relaxation due to BERs. The chain density evolution rule is then fed into a continuum level interfacial model that takes into account surface roughness and applied pressure to predict the effective elastic modulus and interfacial fracture energy of welded polymers. The model yields particularly accessible results where the moduli and interfacial strength of the welded samples as a function of temperature and pressure can be predicted with four parameters, three of which can be measured directly. The model identifies the dependency of surface welding efficiency on the applied thermal and mechanical fields: the pressure will affect the real contact area under the consideration of surface roughness of dynamic covalent network polymers; the chain density increment on the real contact area of interface is only dependent on the welding time and temperature. The modeling approach shows good agreement with experiments and can be extended to other types of dynamic covalent network polymers using different stimuli for BERs, such as light and moisture etc.

Coupled protein-ligand dynamics in truncated hemoglobin N from atomistic simulations and transition networks.

PubMed

Cazade, Pierre-André; Berezovska, Ganna; Meuwly, Markus

2015-05-01

The nature of ligand motion in proteins is difficult to characterize directly using experiment. Specifically, it is unclear to what degree these motions are coupled. All-atom simulations are used to sample ligand motion in truncated Hemoglobin N. A transition network analysis including ligand- and protein-degrees of freedom is used to analyze the microscopic dynamics. Clustering of two different subsets of MD trajectories highlights the importance of a diverse and exhaustive description to define the macrostates for a ligand-migration network. Monte Carlo simulations on the transition matrices from one particular clustering are able to faithfully capture the atomistic simulations. Contrary to clustering by ligand positions only, including a protein degree of freedom yields considerably improved coarse grained dynamics. Analysis with and without imposing detailed balance agree closely which suggests that the underlying atomistic simulations are converged with respect to sampling transitions between neighboring sites. Protein and ligand dynamics are not independent from each other and ligand migration through globular proteins is not passive diffusion. Transition network analysis is a powerful tool to analyze and characterize the microscopic dynamics in complex systems. This article is part of a Special Issue entitled Recent developments of molecular dynamics. Copyright © 2014 Elsevier B.V. All rights reserved.

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.

Multiplex social ecological network analysis reveals how social changes affect community robustness more than resource depletion.

PubMed

Baggio, Jacopo A; BurnSilver, Shauna B; Arenas, Alex; Magdanz, James S; Kofinas, Gary P; De Domenico, Manlio

2016-11-29

Network analysis provides a powerful tool to analyze complex influences of social and ecological structures on community and household dynamics. Most network studies of social-ecological systems use simple, undirected, unweighted networks. We analyze multiplex, directed, and weighted networks of subsistence food flows collected in three small indigenous communities in Arctic Alaska potentially facing substantial economic and ecological changes. Our analysis of plausible future scenarios suggests that changes to social relations and key households have greater effects on community robustness than changes to specific wild food resources.

A networks-based discrete dynamic systems approach to volcanic seismicity

NASA Astrophysics Data System (ADS)

Suteanu, Mirela

2013-04-01

The detection and relevant description of pattern change concerning earthquake events is an important, but challenging task. In this paper, earthquake events related to volcanic activity are considered manifestations of a dynamic system evolving over time. The system dynamics is seen as a succession of events with point-like appearance both in time and in space. Each event is characterized by a position in three-dimensional space, a moment of occurrence, and an event size (magnitude). A weighted directed network is constructed to capture the effects of earthquakes on subsequent events. Each seismic event represents a node. Relations among events represent edges. Edge directions are given by the temporal succession of the events. Edges are also characterized by weights reflecting the strengths of the relation between the nodes. Weights are calculated as a function of (i) the time interval separating the two events, (ii) the spatial distance between the events, (iii) the magnitude of the earliest event among the two. Different ways of addressing weight components are explored, and their implications for the properties of the produced networks are analyzed. The resulting networks are then characterized in terms of degree- and weight distributions. Subsequently, the distribution of system transitions is determined for all the edges connecting related events in the network. Two- and three-dimensional diagrams are constructed to reflect transition distributions for each set of events. Networks are thus generated for successive temporal windows of different size, and the evolution of (a) network properties and (b) system transition distributions are followed over time and compared to the timeline of documented geologic processes. Applications concerning volcanic seismicity on the Big Island of Hawaii show that this approach is capable of revealing novel aspects of change occurring in the volcanic system on different scales in time and in space.

Airborne Network Data Availability Using Peer to Peer Database Replication on a Distributed Hash Table

DTIC Science & Technology

2013-03-01

DSR Dynamic Source Routing DSSS Direct -sequence spread spectrum GUID Globally Unique ID MANET Mobile Ad-hoc Network NS3 Network Simulator 3 OLSR...networking schemes for safe maneuvering and data communication. Imagine needing to maintain an operational picture of an overall environment using a...as simple as O(n) where every node is sequentially queried to O log(n), or O(1). These schemes will be discussed with each individual DHT. Four of the

Critical dynamics on a large human Open Connectome network

NASA Astrophysics Data System (ADS)

Ódor, Géza

2016-12-01

Extended numerical simulations of threshold models have been performed on a human brain network with N =836 733 connected nodes available from the Open Connectome Project. While in the case of simple threshold models a sharp discontinuous phase transition without any critical dynamics arises, variable threshold models exhibit extended power-law scaling regions. This is attributed to fact that Griffiths effects, stemming from the topological or interaction heterogeneity of the network, can become relevant if the input sensitivity of nodes is equalized. I have studied the effects of link directness, as well as the consequence of inhibitory connections. Nonuniversal power-law avalanche size and time distributions have been found with exponents agreeing with the values obtained in electrode experiments of the human brain. The dynamical critical region occurs in an extended control parameter space without the assumption of self-organized criticality.

A common neural network differentially mediates direct and social fear learning.

PubMed

Lindström, Björn; Haaker, Jan; Olsson, Andreas

2018-02-15

Across species, fears often spread between individuals through social learning. Yet, little is known about the neural and computational mechanisms underlying social learning. Addressing this question, we compared social and direct (Pavlovian) fear learning showing that they showed indistinguishable behavioral effects, and involved the same cross-modal (self/other) aversive learning network, centered on the amygdala, the anterior insula (AI), and the anterior cingulate cortex (ACC). Crucially, the information flow within this network differed between social and direct fear learning. Dynamic causal modeling combined with reinforcement learning modeling revealed that the amygdala and AI provided input to this network during direct and social learning, respectively. Furthermore, the AI gated learning signals based on surprise (associability), which were conveyed to the ACC, in both learning modalities. Our findings provide insights into the mechanisms underlying social fear learning, with implications for understanding common psychological dysfunctions, such as phobias and other anxiety disorders. Copyright © 2017 Elsevier Inc. All rights reserved.

Dynamics of an SAITS alcoholism model on unweighted and weighted networks

NASA Astrophysics Data System (ADS)

Huo, Hai-Feng; Cui, Fang-Fang; Xiang, Hong

2018-04-01

A novel SAITS alcoholism model on networks is introduced, in which alcoholics are divided into light problem alcoholics and heavy problem alcoholics. Susceptible individuals can enter into the compartment of heavy problem alcoholics directly by contacting with light problem alcoholics or heavy problem alcoholics and the heavy problem alcoholics who receive treatment can relapse into the compartment of heavy problem alcoholics are also considered. First, the dynamics of our model on unweighted networks, including the basic reproduction number, existence and stability of equilibria are studied. Second, the models with fixed weighted and adaptive weighted networks are introduced and investigated. At last, some simulations are presented to illustrate and extend our results. Our results show that it is very important to treat alcoholics to quit the drinking.

Nonlinear microrheology and molecular imaging to map microscale deformations of entangled DNA networks

NASA Astrophysics Data System (ADS)

Wu, Tsai-Chin; Anderson, Rae

We use active microrheology coupled to single-molecule fluorescence imaging to elucidate the microscale dynamics of entangled DNA. DNA naturally exists in a wide range of lengths and topologies, and is often confined in cell nucleui, forming highly concentrated and entangled biopolymer networks. Thus, DNA is the model polymer for understanding entangled polymer dynamics as well as the crowded environment of cells. These networks display complex viscoelastic properties that are not well understood, especially at the molecular-level and in response to nonlinear perturbations. Specifically, how microscopic stresses and strains propagate through entangled networks, and what molecular deformations lead to the network stress responses are unknown. To answer these important questions, we optically drive a microsphere through entangled DNA, perturbing the system far from equilibrium, while measuring the resistive force the DNA exerts on the bead during and after bead motion. We simultaneously image single fluorescent-labeled DNA molecules throughout the network to directly link the microscale stress response to molecular deformations. We characterize the deformation of the network from the molecular-level to the mesoscale, and map the stress propagation throughout the network. We further study the impact of DNA length (11 - 115 kbp) and topology (linear vs ring DNA) on deformation and propagation dynamics, exploring key nonlinear features such as tube dilation and power-law relaxation.

Weighted and directed interactions in evolving large-scale epileptic brain networks

NASA Astrophysics Data System (ADS)

Dickten, Henning; Porz, Stephan; Elger, Christian E.; Lehnertz, Klaus

2016-10-01

Epilepsy can be regarded as a network phenomenon with functionally and/or structurally aberrant connections in the brain. Over the past years, concepts and methods from network theory substantially contributed to improve the characterization of structure and function of these epileptic networks and thus to advance understanding of the dynamical disease epilepsy. We extend this promising line of research and assess—with high spatial and temporal resolution and using complementary analysis approaches that capture different characteristics of the complex dynamics—both strength and direction of interactions in evolving large-scale epileptic brain networks of 35 patients that suffered from drug-resistant focal seizures with different anatomical onset locations. Despite this heterogeneity, we find that even during the seizure-free interval the seizure onset zone is a brain region that, when averaged over time, exerts strongest directed influences over other brain regions being part of a large-scale network. This crucial role, however, manifested by averaging on the population-sample level only - in more than one third of patients, strongest directed interactions can be observed between brain regions far off the seizure onset zone. This may guide new developments for individualized diagnosis, treatment and control.

Multicast routing for wavelength-routed WDM networks with dynamic membership

NASA Astrophysics Data System (ADS)

Huang, Nen-Fu; Liu, Te-Lung; Wang, Yao-Tzung; Li, Bo

2000-09-01

Future broadband networks must support integrated services and offer flexible bandwidth usage. In our previous work, we explore the optical link control layer on the top of optical layer that enables the possibility of bandwidth on-demand service directly over wavelength division multiplexed (WDM) networks. Today, more and more applications and services such as video-conferencing software and Virtual LAN service require multicast support over the underlying networks. Currently, it is difficult to provide wavelength multicast over the optical switches without optical/electronic conversions although the conversion takes extra cost. In this paper, based on the proposed wavelength router architecture (equipped with ATM switches to offer O/E and E/O conversions when necessary), a dynamic multicast routing algorithm is proposed to furnish multicast services over WDM networks. The goal is to joint a new group member into the multicast tree so that the cost, including the link cost and the optical/electronic conversion cost, is kept as less as possible. The effectiveness of the proposed wavelength router architecture as well as the dynamic multicast algorithm is evaluated by simulation.

A network of discrete events for the representation and analysis of diffusion dynamics.

PubMed

Pintus, Alberto M; Pazzona, Federico G; Demontis, Pierfranco; Suffritti, Giuseppe B

2015-11-14

We developed a coarse-grained description of the phenomenology of diffusive processes, in terms of a space of discrete events and its representation as a network. Once a proper classification of the discrete events underlying the diffusive process is carried out, their transition matrix is calculated on the basis of molecular dynamics data. This matrix can be represented as a directed, weighted network where nodes represent discrete events, and the weight of edges is given by the probability that one follows the other. The structure of this network reflects dynamical properties of the process of interest in such features as its modularity and the entropy rate of nodes. As an example of the applicability of this conceptual framework, we discuss here the physics of diffusion of small non-polar molecules in a microporous material, in terms of the structure of the corresponding network of events, and explain on this basis the diffusivity trends observed. A quantitative account of these trends is obtained by considering the contribution of the various events to the displacement autocorrelation function.

Concordant Chemical Reaction Networks and the Species-Reaction Graph

PubMed Central

Shinar, Guy; Feinberg, Martin

2015-01-01

In a recent paper it was shown that, for chemical reaction networks possessing a subtle structural property called concordance, dynamical behavior of a very circumscribed (and largely stable) kind is enforced, so long as the kinetics lies within the very broad and natural weakly monotonic class. In particular, multiple equilibria are precluded, as are degenerate positive equilibria. Moreover, under certain circumstances, also related to concordance, all real eigenvalues associated with a positive equilibrium are negative. Although concordance of a reaction network can be decided by readily available computational means, we show here that, when a nondegenerate network’s Species-Reaction Graph satisfies certain mild conditions, concordance and its dynamical consequences are ensured. These conditions are weaker than earlier ones invoked to establish kinetic system injectivity, which, in turn, is just one ramification of network concordance. Because the Species-Reaction Graph resembles pathway depictions often drawn by biochemists, results here expand the possibility of inferring significant dynamical information directly from standard biochemical reaction diagrams. PMID:22940368

Adaptive control of structural balance for complex dynamical networks based on dynamic coupling of nodes

NASA Astrophysics Data System (ADS)

Gao, Zilin; Wang, Yinhe; Zhang, Lili

2018-02-01

In the existing research results of the complex dynamical networks controlled, the controllers are mainly used to guarantee the synchronization or stabilization of the nodes’ state, and the terms coupled with connection relationships may affect the behaviors of nodes, this obviously ignores the dynamic common behavior of the connection relationships between the nodes. In fact, from the point of view of large-scale system, a complex dynamical network can be regarded to be composed of two time-varying dynamic subsystems, which can be called the nodes subsystem and the connection relationships subsystem, respectively. Similar to the synchronization or stabilization of the nodes subsystem, some characteristic phenomena can be also emerged in the connection relationships subsystem. For example, the structural balance in the social networks and the synaptic facilitation in the biological neural networks. This paper focuses on the structural balance in dynamic complex networks. Generally speaking, the state of the connection relationships subsystem is difficult to be measured accurately in practical applications, and thus it is not easy to implant the controller directly into the connection relationships subsystem. It is noted that the nodes subsystem and the relationships subsystem are mutually coupled, which implies that the state of the connection relationships subsystem can be affected by the controllable state of nodes subsystem. Inspired by this observation, by using the structural balance theory of triad, the controller with the parameter adaptive law is proposed for the nodes subsystem in this paper, which may ensure the connection relationship matrix to approximate a given structural balance matrix in the sense of the uniformly ultimately bounded (UUB). That is, the structural balance may be obtained by employing the controlling state of the nodes subsystem. Finally, the simulations are used to show the validity of the method in this paper.

Phase transitions in Ising models on directed networks

NASA Astrophysics Data System (ADS)

Lipowski, Adam; Ferreira, António Luis; Lipowska, Dorota; Gontarek, Krzysztof

2015-11-01

We examine Ising models with heat-bath dynamics on directed networks. Our simulations show that Ising models on directed triangular and simple cubic lattices undergo a phase transition that most likely belongs to the Ising universality class. On the directed square lattice the model remains paramagnetic at any positive temperature as already reported in some previous studies. We also examine random directed graphs and show that contrary to undirected ones, percolation of directed bonds does not guarantee ferromagnetic ordering. Only above a certain threshold can a random directed graph support finite-temperature ferromagnetic ordering. Such behavior is found also for out-homogeneous random graphs, but in this case the analysis of magnetic and percolative properties can be done exactly. Directed random graphs also differ from undirected ones with respect to zero-temperature freezing. Only at low connectivity do they remain trapped in a disordered configuration. Above a certain threshold, however, the zero-temperature dynamics quickly drives the model toward a broken symmetry (magnetized) state. Only above this threshold, which is almost twice as large as the percolation threshold, do we expect the Ising model to have a positive critical temperature. With a very good accuracy, the behavior on directed random graphs is reproduced within a certain approximate scheme.

Single-Molecule Studies of Actin Assembly and Disassembly Factors

PubMed Central

Smith, Benjamin A.; Gelles, Jeff; Goode, Bruce L.

2014-01-01

The actin cytoskeleton is very dynamic and highly regulated by multiple associated proteins in vivo. Understanding how this system of proteins functions in the processes of actin network assembly and disassembly requires methods to dissect the mechanisms of activity of individual factors and of multiple factors acting in concert. The advent of single-filament and single-molecule fluorescence imaging methods has provided a powerful new approach to discovering actin-regulatory activities and obtaining direct, quantitative insights into the pathways of molecular interactions that regulate actin network architecture and dynamics. Here we describe techniques for acquisition and analysis of single-molecule data, applied to the novel challenges of studying the filament assembly and disassembly activities of actin-associated proteins in vitro. We discuss the advantages of single-molecule analysis in directly visualizing the order of molecular events, measuring the kinetic rates of filament binding and dissociation, and studying the coordination among multiple factors. The methods described here complement traditional biochemical approaches in elucidating actin-regulatory mechanisms in reconstituted filamentous networks. PMID:24630103

A modular architecture for transparent computation in recurrent neural networks.

PubMed

Carmantini, Giovanni S; Beim Graben, Peter; Desroches, Mathieu; Rodrigues, Serafim

2017-01-01

Computation is classically studied in terms of automata, formal languages and algorithms; yet, the relation between neural dynamics and symbolic representations and operations is still unclear in traditional eliminative connectionism. Therefore, we suggest a unique perspective on this central issue, to which we would like to refer as transparent connectionism, by proposing accounts of how symbolic computation can be implemented in neural substrates. In this study we first introduce a new model of dynamics on a symbolic space, the versatile shift, showing that it supports the real-time simulation of a range of automata. We then show that the Gödelization of versatile shifts defines nonlinear dynamical automata, dynamical systems evolving on a vectorial space. Finally, we present a mapping between nonlinear dynamical automata and recurrent artificial neural networks. The mapping defines an architecture characterized by its granular modularity, where data, symbolic operations and their control are not only distinguishable in activation space, but also spatially localizable in the network itself, while maintaining a distributed encoding of symbolic representations. The resulting networks simulate automata in real-time and are programmed directly, in the absence of network training. To discuss the unique characteristics of the architecture and their consequences, we present two examples: (i) the design of a Central Pattern Generator from a finite-state locomotive controller, and (ii) the creation of a network simulating a system of interactive automata that supports the parsing of garden-path sentences as investigated in psycholinguistics experiments. Copyright © 2016 Elsevier Ltd. All rights reserved.

Dynamic Policy-Driven Quality of Service in Service-Oriented Information Management Systems

DTIC Science & Technology

2011-01-01

both DiffServ and IntServ net- work QoS mechanisms. Wang et al [48] provide middleware APIs to shield applications from directly interacting with...complex network QoS mechanism APIs . Middleware frameworks transparently converted the specified application QoS requirements into low- er-level network...QoS mechanism APIs and provided network QoS assurances. Deployment-time resource allocation. Other prior work has focused on deploying ap- plications

Distributed Time Synchronization Algorithms and Opinion Dynamics

NASA Astrophysics Data System (ADS)

Manita, Anatoly; Manita, Larisa

2018-01-01

We propose new deterministic and stochastic models for synchronization of clocks in nodes of distributed networks. An external accurate time server is used to ensure convergence of the node clocks to the exact time. These systems have much in common with mathematical models of opinion formation in multiagent systems. There is a direct analogy between the time server/node clocks pair in asynchronous networks and the leader/follower pair in the context of social network models.

BoolFilter: an R package for estimation and identification of partially-observed Boolean dynamical systems.

PubMed

Mcclenny, Levi D; Imani, Mahdi; Braga-Neto, Ulisses M

2017-11-25

Gene regulatory networks govern the function of key cellular processes, such as control of the cell cycle, response to stress, DNA repair mechanisms, and more. Boolean networks have been used successfully in modeling gene regulatory networks. In the Boolean network model, the transcriptional state of each gene is represented by 0 (inactive) or 1 (active), and the relationship among genes is represented by logical gates updated at discrete time points. However, the Boolean gene states are never observed directly, but only indirectly and incompletely through noisy measurements based on expression technologies such as cDNA microarrays, RNA-Seq, and cell imaging-based assays. The Partially-Observed Boolean Dynamical System (POBDS) signal model is distinct from other deterministic and stochastic Boolean network models in removing the requirement of a directly observable Boolean state vector and allowing uncertainty in the measurement process, addressing the scenario encountered in practice in transcriptomic analysis. BoolFilter is an R package that implements the POBDS model and associated algorithms for state and parameter estimation. It allows the user to estimate the Boolean states, network topology, and measurement parameters from time series of transcriptomic data using exact and approximated (particle) filters, as well as simulate the transcriptomic data for a given Boolean network model. Some of its infrastructure, such as the network interface, is the same as in the previously published R package for Boolean Networks BoolNet, which enhances compatibility and user accessibility to the new package. We introduce the R package BoolFilter for Partially-Observed Boolean Dynamical Systems (POBDS). The BoolFilter package provides a useful toolbox for the bioinformatics community, with state-of-the-art algorithms for simulation of time series transcriptomic data as well as the inverse process of system identification from data obtained with various expression technologies such as cDNA microarrays, RNA-Seq, and cell imaging-based assays.

Competitive Dynamics on Complex Networks

PubMed Central

Zhao, Jiuhua; Liu, Qipeng; Wang, Xiaofan

2014-01-01

We consider a dynamical network model in which two competitors have fixed and different states, and each normal agent adjusts its state according to a distributed consensus protocol. The state of each normal agent converges to a steady value which is a convex combination of the competitors' states, and is independent of the initial states of agents. This implies that the competition result is fully determined by the network structure and positions of competitors in the network. We compute an Influence Matrix (IM) in which each element characterizing the influence of an agent on another agent in the network. We use the IM to predict the bias of each normal agent and thus predict which competitor will win. Furthermore, we compare the IM criterion with seven node centrality measures to predict the winner. We find that the competitor with higher Katz Centrality in an undirected network or higher PageRank in a directed network is most likely to be the winner. These findings may shed new light on the role of network structure in competition and to what extent could competitors adjust network structure so as to win the competition. PMID:25068622

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

Dynamic reorganization of human resting-state networks during visuospatial attention.

PubMed

Spadone, Sara; Della Penna, Stefania; Sestieri, Carlo; Betti, Viviana; Tosoni, Annalisa; Perrucci, Mauro Gianni; Romani, Gian Luca; Corbetta, Maurizio

2015-06-30

Fundamental problems in neuroscience today are understanding how patterns of ongoing spontaneous activity are modified by task performance and whether/how these intrinsic patterns influence task-evoked activation and behavior. We examined these questions by comparing instantaneous functional connectivity (IFC) and directed functional connectivity (DFC) changes in two networks that are strongly correlated and segregated at rest: the visual (VIS) network and the dorsal attention network (DAN). We measured how IFC and DFC during a visuospatial attention task, which requires dynamic selective rerouting of visual information across hemispheres, changed with respect to rest. During the attention task, the two networks remained relatively segregated, and their general pattern of within-network correlation was maintained. However, attention induced a decrease of correlation in the VIS network and an increase of the DAN→VIS IFC and DFC, especially in a top-down direction. In contrast, within the DAN, IFC was not modified by attention, whereas DFC was enhanced. Importantly, IFC modulations were behaviorally relevant. We conclude that a stable backbone of within-network functional connectivity topography remains in place when transitioning between resting wakefulness and attention selection. However, relative decrease of correlation of ongoing "idling" activity in visual cortex and synchronization between frontoparietal and visual cortex were behaviorally relevant, indicating that modulations of resting activity patterns are important for task performance. Higher order resting connectivity in the DAN was relatively unaffected during attention, potentially indicating a role for simultaneous ongoing activity as a "prior" for attention selection.

Alignment and integration of complex networks by hypergraph-based spectral clustering

NASA Astrophysics Data System (ADS)

Michoel, Tom; Nachtergaele, Bruno

2012-11-01

Complex networks possess a rich, multiscale structure reflecting the dynamical and functional organization of the systems they model. Often there is a need to analyze multiple networks simultaneously, to model a system by more than one type of interaction, or to go beyond simple pairwise interactions, but currently there is a lack of theoretical and computational methods to address these problems. Here we introduce a framework for clustering and community detection in such systems using hypergraph representations. Our main result is a generalization of the Perron-Frobenius theorem from which we derive spectral clustering algorithms for directed and undirected hypergraphs. We illustrate our approach with applications for local and global alignment of protein-protein interaction networks between multiple species, for tripartite community detection in folksonomies, and for detecting clusters of overlapping regulatory pathways in directed networks.

Alignment and integration of complex networks by hypergraph-based spectral clustering.

PubMed

Michoel, Tom; Nachtergaele, Bruno

2012-11-01

Complex networks possess a rich, multiscale structure reflecting the dynamical and functional organization of the systems they model. Often there is a need to analyze multiple networks simultaneously, to model a system by more than one type of interaction, or to go beyond simple pairwise interactions, but currently there is a lack of theoretical and computational methods to address these problems. Here we introduce a framework for clustering and community detection in such systems using hypergraph representations. Our main result is a generalization of the Perron-Frobenius theorem from which we derive spectral clustering algorithms for directed and undirected hypergraphs. We illustrate our approach with applications for local and global alignment of protein-protein interaction networks between multiple species, for tripartite community detection in folksonomies, and for detecting clusters of overlapping regulatory pathways in directed networks.

Physiological modules for generating discrete and rhythmic movements: action identification by a dynamic recurrent neural network.

PubMed

Bengoetxea, Ana; Leurs, Françoise; Hoellinger, Thomas; Cebolla, Ana M; Dan, Bernard; McIntyre, Joseph; Cheron, Guy

2014-01-01

In this study we employed a dynamic recurrent neural network (DRNN) in a novel fashion to reveal characteristics of control modules underlying the generation of muscle activations when drawing figures with the outstretched arm. We asked healthy human subjects to perform four different figure-eight movements in each of two workspaces (frontal plane and sagittal plane). We then trained a DRNN to predict the movement of the wrist from information in the EMG signals from seven different muscles. We trained different instances of the same network on a single movement direction, on all four movement directions in a single movement plane, or on all eight possible movement patterns and looked at the ability of the DRNN to generalize and predict movements for trials that were not included in the training set. Within a single movement plane, a DRNN trained on one movement direction was not able to predict movements of the hand for trials in the other three directions, but a DRNN trained simultaneously on all four movement directions could generalize across movement directions within the same plane. Similarly, the DRNN was able to reproduce the kinematics of the hand for both movement planes, but only if it was trained on examples performed in each one. As we will discuss, these results indicate that there are important dynamical constraints on the mapping of EMG to hand movement that depend on both the time sequence of the movement and on the anatomical constraints of the musculoskeletal system. In a second step, we injected EMG signals constructed from different synergies derived by the PCA in order to identify the mechanical significance of each of these components. From these results, one can surmise that discrete-rhythmic movements may be constructed from three different fundamental modules, one regulating the co-activation of all muscles over the time span of the movement and two others elliciting patterns of reciprocal activation operating in orthogonal directions.

Modelling indirect interactions during failure spreading in a project activity network.

PubMed

Ellinas, Christos

2018-03-12

Spreading broadly refers to the notion of an entity propagating throughout a networked system via its interacting components. Evidence of its ubiquity and severity can be seen in a range of phenomena, from disease epidemics to financial systemic risk. In order to understand the dynamics of these critical phenomena, computational models map the probability of propagation as a function of direct exposure, typically in the form of pairwise interactions between components. By doing so, the important role of indirect interactions remains unexplored. In response, we develop a simple model that accounts for the effect of both direct and subsequent exposure, which we deploy in the novel context of failure propagation within a real-world engineering project. We show that subsequent exposure has a significant effect in key aspects, including the: (a) final spreading event size, (b) propagation rate, and (c) spreading event structure. In addition, we demonstrate the existence of 'hidden influentials' in large-scale spreading events, and evaluate the role of direct and subsequent exposure in their emergence. Given the evidence of the importance of subsequent exposure, our findings offer new insight on particular aspects that need to be included when modelling network dynamics in general, and spreading processes specifically.

Exploring the evolution of node neighborhoods in Dynamic Networks

NASA Astrophysics Data System (ADS)

Orman, Günce Keziban; Labatut, Vincent; Naskali, Ahmet Teoman

2017-09-01

Dynamic Networks are a popular way of modeling and studying the behavior of evolving systems. However, their analysis constitutes a relatively recent subfield of Network Science, and the number of available tools is consequently much smaller than for static networks. In this work, we propose a method specifically designed to take advantage of the longitudinal nature of dynamic networks. It characterizes each individual node by studying the evolution of its direct neighborhood, based on the assumption that the way this neighborhood changes reflects the role and position of the node in the whole network. For this purpose, we define the concept of neighborhood event, which corresponds to the various transformations such groups of nodes can undergo, and describe an algorithm for detecting such events. We demonstrate the interest of our method on three real-world networks: DBLP, LastFM and Enron. We apply frequent pattern mining to extract meaningful information from temporal sequences of neighborhood events. This results in the identification of behavioral trends emerging in the whole network, as well as the individual characterization of specific nodes. We also perform a cluster analysis, which reveals that, in all three networks, one can distinguish two types of nodes exhibiting different behaviors: a very small group of active nodes, whose neighborhood undergo diverse and frequent events, and a very large group of stable nodes.

A boundedness result for the direct heuristic dynamic programming.

PubMed

Liu, Feng; Sun, Jian; Si, Jennie; Guo, Wentao; Mei, Shengwei

2012-08-01

Approximate/adaptive dynamic programming (ADP) has been studied extensively in recent years for its potential scalability to solve large state and control space problems, including those involving continuous states and continuous controls. The applicability of ADP algorithms, especially the adaptive critic designs has been demonstrated in several case studies. Direct heuristic dynamic programming (direct HDP) is one of the ADP algorithms inspired by the adaptive critic designs. It has been shown applicable to industrial scale, realistic and complex control problems. In this paper, we provide a uniformly ultimately boundedness (UUB) result for the direct HDP learning controller under mild and intuitive conditions. By using a Lyapunov approach we show that the estimation errors of the learning parameters or the weights in the action and critic networks remain UUB. This result provides a useful controller convergence guarantee for the first time for the direct HDP design. Copyright © 2012 Elsevier Ltd. All rights reserved.

Slow synaptic dynamics in a network: From exponential to power-law forgetting

NASA Astrophysics Data System (ADS)

Luck, J. M.; Mehta, A.

2014-09-01

We investigate a mean-field model of interacting synapses on a directed neural network. Our interest lies in the slow adaptive dynamics of synapses, which are driven by the fast dynamics of the neurons they connect. Cooperation is modeled from the usual Hebbian perspective, while competition is modeled by an original polarity-driven rule. The emergence of a critical manifold culminating in a tricritical point is crucially dependent on the presence of synaptic competition. This leads to a universal 1/t power-law relaxation of the mean synaptic strength along the critical manifold and an equally universal 1/√t relaxation at the tricritical point, to be contrasted with the exponential relaxation that is otherwise generic. In turn, this leads to the natural emergence of long- and short-term memory from different parts of parameter space in a synaptic network, which is the most original and important result of our present investigations.

The method of parallel-hierarchical transformation for rapid recognition of dynamic images using GPGPU technology

NASA Astrophysics Data System (ADS)

Timchenko, Leonid; Yarovyi, Andrii; Kokriatskaya, Nataliya; Nakonechna, Svitlana; Abramenko, Ludmila; Ławicki, Tomasz; Popiel, Piotr; Yesmakhanova, Laura

2016-09-01

The paper presents a method of parallel-hierarchical transformations for rapid recognition of dynamic images using GPU technology. Direct parallel-hierarchical transformations based on cluster CPU-and GPU-oriented hardware platform. Mathematic models of training of the parallel hierarchical (PH) network for the transformation are developed, as well as a training method of the PH network for recognition of dynamic images. This research is most topical for problems on organizing high-performance computations of super large arrays of information designed to implement multi-stage sensing and processing as well as compaction and recognition of data in the informational structures and computer devices. This method has such advantages as high performance through the use of recent advances in parallelization, possibility to work with images of ultra dimension, ease of scaling in case of changing the number of nodes in the cluster, auto scan of local network to detect compute nodes.

Dynamic ADMM for Real-Time Optimal Power Flow

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

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

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

Dynamic ADMM for Real-Time Optimal Power Flow: Preprint

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

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

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

A Dynamic Network Model to Explain the Development of Excellent Human Performance

PubMed Central

Den Hartigh, Ruud J. R.; Van Dijk, Marijn W. G.; Steenbeek, Henderien W.; Van Geert, Paul L. C.

2016-01-01

Across different domains, from sports to science, some individuals accomplish excellent levels of performance. For over 150 years, researchers have debated the roles of specific nature and nurture components to develop excellence. In this article, we argue that the key to excellence does not reside in specific underlying components, but rather in the ongoing interactions among the components. We propose that excellence emerges out of dynamic networks consisting of idiosyncratic mixtures of interacting components such as genetic endowment, motivation, practice, and coaching. Using computer simulations we demonstrate that the dynamic network model accurately predicts typical properties of excellence reported in the literature, such as the idiosyncratic developmental trajectories leading to excellence and the highly skewed distributions of productivity present in virtually any achievement domain. Based on this novel theoretical perspective on excellent human performance, this article concludes by suggesting policy implications and directions for future research. PMID:27148140

Exploration and Modulation of Brain Network Interactions with Noninvasive Brain Stimulation in Combination with Neuroimaging

PubMed Central

Shafi, Mouhsin M.; Westover, M. Brandon; Fox, Michael D.; Pascual-Leone, Alvaro

2012-01-01

Much recent work in systems neuroscience has focused on how dynamic interactions between different cortical regions underlie complex brain functions such as motor coordination, language, and emotional regulation. Various studies using neuroimaging and neurophysiologic techniques have suggested that in many neuropsychiatric disorders, these dynamic brain networks are dysregulated. Here we review the utility of combined noninvasive brain stimulation and neuroimaging approaches towards greater understanding of dynamic brain networks in health and disease. Brain stimulation techniques, such as transcranial magnetic stimulation and transcranial direct current stimulation, use electromagnetic principles to noninvasively alter brain activity, and induce focal but also network effects beyond the stimulation site. When combined with brain imaging techniques such as functional MRI, PET and EEG, these brain stimulation techniques enable a causal assessment of the interaction between different network components, and their respective functional roles. The same techniques can also be applied to explore hypotheses regarding the changes in functional connectivity that occur during task performance and in various disease states such as stroke, depression and schizophrenia. Finally, in diseases characterized by pathologic alterations in either the excitability within a single region or in the activity of distributed networks, such techniques provide a potential mechanism to alter cortical network function and architectures in a beneficial manner. PMID:22429242

Methods of information geometry in computational system biology (consistency between chemical and biological evolution).

PubMed

Astakhov, Vadim

2009-01-01

Interest in simulation of large-scale metabolic networks, species development, and genesis of various diseases requires new simulation techniques to accommodate the high complexity of realistic biological networks. Information geometry and topological formalisms are proposed to analyze information processes. We analyze the complexity of large-scale biological networks as well as transition of the system functionality due to modification in the system architecture, system environment, and system components. The dynamic core model is developed. The term dynamic core is used to define a set of causally related network functions. Delocalization of dynamic core model provides a mathematical formalism to analyze migration of specific functions in biosystems which undergo structure transition induced by the environment. The term delocalization is used to describe these processes of migration. We constructed a holographic model with self-poetic dynamic cores which preserves functional properties under those transitions. Topological constraints such as Ricci flow and Pfaff dimension were found for statistical manifolds which represent biological networks. These constraints can provide insight on processes of degeneration and recovery which take place in large-scale networks. We would like to suggest that therapies which are able to effectively implement estimated constraints, will successfully adjust biological systems and recover altered functionality. Also, we mathematically formulate the hypothesis that there is a direct consistency between biological and chemical evolution. Any set of causal relations within a biological network has its dual reimplementation in the chemistry of the system environment.

Direct Imaging of Lipid-Ion Network Formation under Physiological Conditions by Frequency Modulation Atomic Force Microscopy

NASA Astrophysics Data System (ADS)

Fukuma, Takeshi; Higgins, Michael J.; Jarvis, Suzanne P.

2007-03-01

Various metal cations in physiological solutions interact with lipid headgroups in biological membranes, having an impact on their structure and stability, yet little is known about the molecular-scale dynamics of the lipid-ion interactions. Here we directly investigate the extensive lipid-ion interaction networks and their transient formation between headgroups in a dipalmitoylphosphatidylcholine bilayer under physiological conditions. The spatial distribution of ion occupancy is imaged in real space by frequency modulation atomic force microscopy with sub-Ångstrom resolution.

Dynamical Networks Characterization of Space Weather Events

NASA Astrophysics Data System (ADS)

Orr, L.; Chapman, S. C.; Dods, J.; Gjerloev, J. W.

2017-12-01

Space weather can cause disturbances to satellite systems, impacting navigation technology and telecommunications; it can cause power loss and aviation disruption. A central aspect of the earth's magnetospheric response to space weather events are large scale and rapid changes in ionospheric current patterns. Space weather is highly dynamic and there are still many controversies about how the current system evolves in time. The recent SuperMAG initiative, collates ground-based vector magnetic field time series from over 200 magnetometers with 1-minute temporal resolution. In principle this combined dataset is an ideal candidate for quantification using dynamical networks. Network properties and parameters allow us to characterize the time dynamics of the full spatiotemporal pattern of the ionospheric current system. However, applying network methodologies to physical data presents new challenges. We establish whether a given pair of magnetometers are connected in the network by calculating their canonical cross correlation. The magnetometers are connected if their cross correlation exceeds a threshold. In our physical time series this threshold needs to be both station specific, as it varies with (non-linear) individual station sensitivity and location, and able to vary with season, which affects ground conductivity. Additionally, the earth rotates and therefore the ground stations move significantly on the timescales of geomagnetic disturbances. The magnetometers are non-uniformly spatially distributed. We will present new methodology which addresses these problems and in particular achieves dynamic normalization of the physical time series in order to form the network. Correlated disturbances across the magnetometers capture transient currents. Once the dynamical network has been obtained [1][2] from the full magnetometer data set it can be used to directly identify detailed inferred transient ionospheric current patterns and track their dynamics. We will show our first results that use network properties such as cliques and clustering coefficients to map these highly dynamic changes in ionospheric current patterns.[l] Dods et al, J. Geophys. Res 120, doi:10.1002/2015JA02 (2015). [2] Dods et al, J. Geophys. Res. 122, doi:10.1002/2016JA02 (2017).

Statistical inference to advance network models in epidemiology.

PubMed

Welch, David; Bansal, Shweta; Hunter, David R

2011-03-01

Contact networks are playing an increasingly important role in the study of epidemiology. Most of the existing work in this area has focused on considering the effect of underlying network structure on epidemic dynamics by using tools from probability theory and computer simulation. This work has provided much insight on the role that heterogeneity in host contact patterns plays on infectious disease dynamics. Despite the important understanding afforded by the probability and simulation paradigm, this approach does not directly address important questions about the structure of contact networks such as what is the best network model for a particular mode of disease transmission, how parameter values of a given model should be estimated, or how precisely the data allow us to estimate these parameter values. We argue that these questions are best answered within a statistical framework and discuss the role of statistical inference in estimating contact networks from epidemiological data. Copyright © 2011 Elsevier B.V. All rights reserved.

Dysregulation of prefrontal cortex-mediated slow evolving limbic dynamics drives stress-induced emotional pathology

PubMed Central

Hultman, Rainbo; Mague, Stephen D.; Li, Qiang; Katz, Brittany M.; Michel, Nadine; Lin, Lizhen; Wang, Joyce; David, Lisa K.; Blount, Cameron; Chandy, Rithi; Carlson, David; Ulrich, Kyle; Carin, Lawrence; Dunson, David; Kumar, Sunil; Deisseroth, Karl; Moore, Scott D.; Dzirasa, Kafui

2016-01-01

Summary Circuits distributed across cortico-limbic brain regions compose the networks that mediate emotional behavior. The prefrontal cortex (PFC) regulates ultraslow (<1Hz) dynamics across these networks, and PFC dysfunction is implicated in stress-related illnesses including major depressive disorder (MDD). To uncover the mechanism whereby stress-induced changes in PFC circuitry alter emotional networks to yield pathology, we used a multi-disciplinary approach including in vivo recordings in mice and chronic social-defeat stress. Our network model, inferred using machine learning, linked stress-induced behavioral pathology to the capacity of PFC to synchronize amygdala and VTA activity. Direct stimulation of PFC-amygdala circuitry with DREADDs normalized PFC-dependent limbic synchrony in stress-susceptible animals and restored normal behavior. In addition to providing insights into MDD mechanisms, our findings demonstrate an interdisciplinary approach that can be used to identify the large-scale network changes that underlie complex emotional pathologies and the specific network nodes that can be used to develop targeted interventions. PMID:27346529

Evolving dynamics of trading behavior based on coordination game in complex networks

NASA Astrophysics Data System (ADS)

Bian, Yue-tang; Xu, Lu; Li, Jin-sheng

2016-05-01

This work concerns the modeling of evolvement of trading behavior in stock markets. Based on the assumption of the investors' limited rationality, the evolution mechanism of trading behavior is modeled according to the investment strategy of coordination game in network, that investors are prone to imitate their neighbors' activity through comprehensive analysis on the risk dominance degree of certain investment behavior, the network topology of their relationship and its heterogeneity. We investigate by mean-field analysis and extensive simulations the evolution of investors' trading behavior in various typical networks under different risk dominance degree of investment behavior. Our results indicate that the evolution of investors' behavior is affected by the network structure of stock market and the effect of risk dominance degree of investment behavior; the stability of equilibrium states of investors' behavior dynamics is directly related with the risk dominance degree of some behavior; connectivity and heterogeneity of the network plays an important role in the evolution of the investment behavior in stock market.

Supervised Learning Based on Temporal Coding in Spiking Neural Networks.

PubMed

Mostafa, Hesham

2017-08-01

Gradient descent training techniques are remarkably successful in training analog-valued artificial neural networks (ANNs). Such training techniques, however, do not transfer easily to spiking networks due to the spike generation hard nonlinearity and the discrete nature of spike communication. We show that in a feedforward spiking network that uses a temporal coding scheme where information is encoded in spike times instead of spike rates, the network input-output relation is differentiable almost everywhere. Moreover, this relation is piecewise linear after a transformation of variables. Methods for training ANNs thus carry directly to the training of such spiking networks as we show when training on the permutation invariant MNIST task. In contrast to rate-based spiking networks that are often used to approximate the behavior of ANNs, the networks we present spike much more sparsely and their behavior cannot be directly approximated by conventional ANNs. Our results highlight a new approach for controlling the behavior of spiking networks with realistic temporal dynamics, opening up the potential for using these networks to process spike patterns with complex temporal information.

Distributed Containment Control for Multiple Unknown Second-Order Nonlinear Systems With Application to Networked Lagrangian Systems.

PubMed

Mei, Jie; Ren, Wei; Li, Bing; Ma, Guangfu

2015-09-01

In this paper, we consider the distributed containment control problem for multiagent systems with unknown nonlinear dynamics. More specifically, we focus on multiple second-order nonlinear systems and networked Lagrangian systems. We first study the distributed containment control problem for multiple second-order nonlinear systems with multiple dynamic leaders in the presence of unknown nonlinearities and external disturbances under a general directed graph that characterizes the interaction among the leaders and the followers. A distributed adaptive control algorithm with an adaptive gain design based on the approximation capability of neural networks is proposed. We present a necessary and sufficient condition on the directed graph such that the containment error can be reduced as small as desired. As a byproduct, the leaderless consensus problem is solved with asymptotical convergence. Because relative velocity measurements between neighbors are generally more difficult to obtain than relative position measurements, we then propose a distributed containment control algorithm without using neighbors' velocity information. A two-step Lyapunov-based method is used to study the convergence of the closed-loop system. Next, we apply the ideas to deal with the containment control problem for networked unknown Lagrangian systems under a general directed graph. All the proposed algorithms are distributed and can be implemented using only local measurements in the absence of communication. Finally, simulation examples are provided to show the effectiveness of the proposed control algorithms.

Past makes future: role of pFC in prediction.

PubMed

Fuster, Joaquín M; Bressler, Steven L

2015-04-01

The pFC enables the essential human capacities for predicting future events and preadapting to them. These capacities rest on both the structure and dynamics of the human pFC. Structurally, pFC, together with posterior association cortex, is at the highest hierarchical level of cortical organization, harboring neural networks that represent complex goal-directed actions. Dynamically, pFC is at the highest level of the perception-action cycle, the circular processing loop through the cortex that interfaces the organism with the environment in the pursuit of goals. In its predictive and preadaptive roles, pFC supports cognitive functions that are critical for the temporal organization of future behavior, including planning, attentional set, working memory, decision-making, and error monitoring. These functions have a common future perspective and are dynamically intertwined in goal-directed action. They all utilize the same neural infrastructure: a vast array of widely distributed, overlapping, and interactive cortical networks of personal memory and semantic knowledge, named cognits, which are formed by synaptic reinforcement in learning and memory acquisition. From this cortex-wide reservoir of memory and knowledge, pFC generates purposeful, goal-directed actions that are preadapted to predicted future events.

Modular analysis of biological networks.

PubMed

Kaltenbach, Hans-Michael; Stelling, Jörg

2012-01-01

The analysis of complex biological networks has traditionally relied on decomposition into smaller, semi-autonomous units such as individual signaling pathways. With the increased scope of systems biology (models), rational approaches to modularization have become an important topic. With increasing acceptance of de facto modularity in biology, widely different definitions of what constitutes a module have sparked controversies. Here, we therefore review prominent classes of modular approaches based on formal network representations. Despite some promising research directions, several important theoretical challenges remain open on the way to formal, function-centered modular decompositions for dynamic biological networks.

Creative Cognition and Brain Network Dynamics

PubMed Central

Beaty, Roger E.; Benedek, Mathias; Silvia, Paul J.; Schacter, Daniel L.

2015-01-01

Creative thinking is central to the arts, sciences, and everyday life. How does the brain produce creative thought? A series of recently published papers has begun to provide insight into this question, reporting a strikingly similar pattern of brain activity and connectivity across a range of creative tasks and domains, from divergent thinking to poetry composition to musical improvisation. This research suggests that creative thought involves dynamic interactions of large-scale brain systems, with the most compelling finding being that the default and executive control networks, which can show an antagonistic relationship, actually cooperate during creative cognition and artistic performance. These findings have implications for understanding how brain networks interact to support complex cognitive processes, particularly those involving goal-directed, self-generated thought. PMID:26553223

Collection Directions: The Evolution of Library Collections and Collecting

ERIC Educational Resources Information Center

Dempsey, Lorcan; Malpas, Constance; Lavoie, Brian

2014-01-01

This article takes a broad view of the evolution of collecting behaviors in a network environment and suggests some future directions based on various simple models. The authors look at the changing dynamics of print collections, at the greater engagement with research and learning behaviors, and at trends in scholarly communication. The goal is…

Motion-related resource allocation in dynamic wireless visual sensor network environments.

PubMed

Katsenou, Angeliki V; Kondi, Lisimachos P; Parsopoulos, Konstantinos E

2014-01-01

This paper investigates quality-driven cross-layer optimization for resource allocation in direct sequence code division multiple access wireless visual sensor networks. We consider a single-hop network topology, where each sensor transmits directly to a centralized control unit (CCU) that manages the available network resources. Our aim is to enable the CCU to jointly allocate the transmission power and source-channel coding rates for each node, under four different quality-driven criteria that take into consideration the varying motion characteristics of each recorded video. For this purpose, we studied two approaches with a different tradeoff of quality and complexity. The first one allocates the resources individually for each sensor, whereas the second clusters them according to the recorded level of motion. In order to address the dynamic nature of the recorded scenery and re-allocate the resources whenever it is dictated by the changes in the amount of motion in the scenery, we propose a mechanism based on the particle swarm optimization algorithm, combined with two restarting schemes that either exploit the previously determined resource allocation or conduct a rough estimation of it. Experimental simulations demonstrate the efficiency of the proposed approaches.

Flexible Web services integration: a novel personalised social approach

NASA Astrophysics Data System (ADS)

Metrouh, Abdelmalek; Mokhati, Farid

2018-05-01

Dynamic composition or integration remains one of the key objectives of Web services technology. This paper aims to propose an innovative approach of dynamic Web services composition based on functional and non-functional attributes and individual preferences. In this approach, social networks of Web services are used to maintain interactions between Web services in order to select and compose Web services that are more tightly related to user's preferences. We use the concept of Web services community in a social network of Web services to reduce considerably their search space. These communities are created by the direct involvement of Web services providers.

Pressure effects on collective density fluctuations in water and protein solutions

PubMed Central

Russo, Daniela; Laloni, Alessio; Filabozzi, Alessandra; Heyden, Matthias

2017-01-01

Neutron Brillouin scattering and molecular dynamics simulations have been used to investigate protein hydration water density fluctuations as a function of pressure. Our results show significant differences between the pressure and density dependence of collective dynamics in bulk water and in concentrated protein solutions. Pressure-induced changes in the tetrahedral order of the water HB network have direct consequences for the high-frequency sound velocity and damping coefficients, which we find to be a sensitive probe for changes in the HB network structure as well as the wetting of biomolecular surfaces. PMID:29073065

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

PubMed

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

2013-01-01

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

Irrelevant stimulus processing in ADHD: catecholamine dynamics and attentional networks.

PubMed

Aboitiz, Francisco; Ossandón, Tomás; Zamorano, Francisco; Palma, Bárbara; Carrasco, Ximena

2014-01-01

A cardinal symptom of attention deficit and hyperactivity disorder (ADHD) is a general distractibility where children and adults shift their attentional focus to stimuli that are irrelevant to the ongoing behavior. This has been attributed to a deficit in dopaminergic signaling in cortico-striatal networks that regulate goal-directed behavior. Furthermore, recent imaging evidence points to an impairment of large scale, antagonistic brain networks that normally contribute to attentional engagement and disengagement, such as the task-positive networks and the default mode network (DMN). Related networks are the ventral attentional network (VAN) involved in attentional shifting, and the salience network (SN) related to task expectancy. Here we discuss the tonic-phasic dynamics of catecholaminergic signaling in the brain, and attempt to provide a link between this and the activities of the large-scale cortical networks that regulate behavior. More specifically, we propose that a disbalance of tonic catecholamine levels during task performance produces an emphasis of phasic signaling and increased excitability of the VAN, yielding distractibility symptoms. Likewise, immaturity of the SN may relate to abnormal tonic signaling and an incapacity to build up a proper executive system during task performance. We discuss different lines of evidence including pharmacology, brain imaging and electrophysiology, that are consistent with our proposal. Finally, restoring the pharmacodynamics of catecholaminergic signaling seems crucial to alleviate ADHD symptoms; however, the possibility is open to explore cognitive rehabilitation strategies to top-down modulate network dynamics compensating the pharmacological deficits.

Irrelevant stimulus processing in ADHD: catecholamine dynamics and attentional networks

PubMed Central

Aboitiz, Francisco; Ossandón, Tomás; Zamorano, Francisco; Palma, Bárbara; Carrasco, Ximena

2014-01-01

A cardinal symptom of attention deficit and hyperactivity disorder (ADHD) is a general distractibility where children and adults shift their attentional focus to stimuli that are irrelevant to the ongoing behavior. This has been attributed to a deficit in dopaminergic signaling in cortico-striatal networks that regulate goal-directed behavior. Furthermore, recent imaging evidence points to an impairment of large scale, antagonistic brain networks that normally contribute to attentional engagement and disengagement, such as the task-positive networks and the default mode network (DMN). Related networks are the ventral attentional network (VAN) involved in attentional shifting, and the salience network (SN) related to task expectancy. Here we discuss the tonic–phasic dynamics of catecholaminergic signaling in the brain, and attempt to provide a link between this and the activities of the large-scale cortical networks that regulate behavior. More specifically, we propose that a disbalance of tonic catecholamine levels during task performance produces an emphasis of phasic signaling and increased excitability of the VAN, yielding distractibility symptoms. Likewise, immaturity of the SN may relate to abnormal tonic signaling and an incapacity to build up a proper executive system during task performance. We discuss different lines of evidence including pharmacology, brain imaging and electrophysiology, that are consistent with our proposal. Finally, restoring the pharmacodynamics of catecholaminergic signaling seems crucial to alleviate ADHD symptoms; however, the possibility is open to explore cognitive rehabilitation strategies to top-down modulate network dynamics compensating the pharmacological deficits. PMID:24723897

What's Next in Complex Networks? Capturing the Concept of Attacking Play in Invasive Team Sports.

PubMed

Ramos, João; Lopes, Rui J; Araújo, Duarte

2018-01-01

The evolution of performance analysis within sports sciences is tied to technology development and practitioner demands. However, how individual and collective patterns self-organize and interact in invasive team sports remains elusive. Social network analysis has been recently proposed to resolve some aspects of this problem, and has proven successful in capturing collective features resulting from the interactions between team members as well as a powerful communication tool. Despite these advances, some fundamental team sports concepts such as an attacking play have not been properly captured by the more common applications of social network analysis to team sports performance. In this article, we propose a novel approach to team sports performance centered on sport concepts, namely that of an attacking play. Network theory and tools including temporal and bipartite or multilayered networks were used to capture this concept. We put forward eight questions directly related to team performance to discuss how common pitfalls in the use of network tools for capturing sports concepts can be avoided. Some answers are advanced in an attempt to be more precise in the description of team dynamics and to uncover other metrics directly applied to sport concepts, such as the structure and dynamics of attacking plays. Finally, we propose that, at this stage of knowledge, it may be advantageous to build up from fundamental sport concepts toward complex network theory and tools, and not the other way around.

Impact of environmental inputs on reverse-engineering approach to network structures.

PubMed

Wu, Jianhua; Sinfield, James L; Buchanan-Wollaston, Vicky; Feng, Jianfeng

2009-12-04

Uncovering complex network structures from a biological system is one of the main topic in system biology. The network structures can be inferred by the dynamical Bayesian network or Granger causality, but neither techniques have seriously taken into account the impact of environmental inputs. With considerations of natural rhythmic dynamics of biological data, we propose a system biology approach to reveal the impact of environmental inputs on network structures. We first represent the environmental inputs by a harmonic oscillator and combine them with Granger causality to identify environmental inputs and then uncover the causal network structures. We also generalize it to multiple harmonic oscillators to represent various exogenous influences. This system approach is extensively tested with toy models and successfully applied to a real biological network of microarray data of the flowering genes of the model plant Arabidopsis Thaliana. The aim is to identify those genes that are directly affected by the presence of the sunlight and uncover the interactive network structures associating with flowering metabolism. We demonstrate that environmental inputs are crucial for correctly inferring network structures. Harmonic causal method is proved to be a powerful technique to detect environment inputs and uncover network structures, especially when the biological data exhibit periodic oscillations.

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

PubMed

Greenbaum, Gili; Fefferman, Nina H

2017-06-01

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

Dynamic Power-Saving Method for Wi-Fi Direct Based IoT Networks Considering Variable-Bit-Rate Video Traffic.

PubMed

Jin, Meihua; Jung, Ji-Young; Lee, Jung-Ryun

2016-10-12

With the arrival of the era of Internet of Things (IoT), Wi-Fi Direct is becoming an emerging wireless technology that allows one to communicate through a direct connection between the mobile devices anytime, anywhere. In Wi-Fi Direct-based IoT networks, all devices are categorized by group of owner (GO) and client. Since portability is emphasized in Wi-Fi Direct devices, it is essential to control the energy consumption of a device very efficiently. In order to avoid unnecessary power consumed by GO, Wi-Fi Direct standard defines two power-saving methods: Opportunistic and Notice of Absence (NoA) power-saving methods. In this paper, we suggest an algorithm to enhance the energy efficiency of Wi-Fi Direct power-saving, considering the characteristics of multimedia video traffic. Proposed algorithm utilizes the statistical distribution for the size of video frames and adjusts the lengths of awake intervals in a beacon interval dynamically. In addition, considering the inter-dependency among video frames, the proposed algorithm ensures that a video frame having high priority is transmitted with higher probability than other frames having low priority. Simulation results show that the proposed method outperforms the traditional NoA method in terms of average delay and energy efficiency.

Dynamic Power-Saving Method for Wi-Fi Direct Based IoT Networks Considering Variable-Bit-Rate Video Traffic

PubMed Central

Jin, Meihua; Jung, Ji-Young; Lee, Jung-Ryun

2016-01-01

With the arrival of the era of Internet of Things (IoT), Wi-Fi Direct is becoming an emerging wireless technology that allows one to communicate through a direct connection between the mobile devices anytime, anywhere. In Wi-Fi Direct-based IoT networks, all devices are categorized by group of owner (GO) and client. Since portability is emphasized in Wi-Fi Direct devices, it is essential to control the energy consumption of a device very efficiently. In order to avoid unnecessary power consumed by GO, Wi-Fi Direct standard defines two power-saving methods: Opportunistic and Notice of Absence (NoA) power-saving methods. In this paper, we suggest an algorithm to enhance the energy efficiency of Wi-Fi Direct power-saving, considering the characteristics of multimedia video traffic. Proposed algorithm utilizes the statistical distribution for the size of video frames and adjusts the lengths of awake intervals in a beacon interval dynamically. In addition, considering the inter-dependency among video frames, the proposed algorithm ensures that a video frame having high priority is transmitted with higher probability than other frames having low priority. Simulation results show that the proposed method outperforms the traditional NoA method in terms of average delay and energy efficiency. PMID:27754315

Characterization of contact structures for the spread of infectious diseases in a pork supply chain in northern Germany by dynamic network analysis of yearly and monthly networks.

PubMed

Büttner, K; Krieter, J; Traulsen, I

2015-04-01

A major risk factor in the spread of diseases between holdings is the transport of live animals. This study analysed the animal movements of the pork supply chain of a producer group in Northern Germany. The parameters in-degree and out-degree, ingoing and outgoing infection chain, betweenness and ingoing and outgoing closeness were measured using dynamic network analysis to identify holdings with central positions in the network and to characterize the overall network topology. The potential maximum epidemic size was also estimated. All parameters were calculated for three time periods: the 3-yearly network, the yearly and the monthly networks. The yearly and the monthly networks were more fragmented than the 3-yearly network. On average, one-third of the holdings were isolated in the yearly networks and almost three quarters in the monthly networks. This represented an immense reduction in the number of holdings participating in the trade of the monthly networks. The overall network topology showed right-skewed distributions for all calculated centrality parameters indicating that network resilience was high concerning the random removal of holdings. However, for a targeted removal of holdings according to their centrality, a rapid fragmentation of the trade network could be expected. Furthermore, to capture the real importance of holdings for disease transmission, indirect trade contacts (infection chain) should be considered. In contrast to the parameters regarding direct trade contacts (degree), the infection chain parameter did not underestimate the potential risk of disease transmission. This became more obvious, the longer the observed time period was. For all three time periods, the results for the estimation of the potential maximum epidemic size illustrated that the outgoing infection chain should be chosen. It considers the chronological order and the directed nature of the contacts and has no restrictions such as the strongly connected components of a cyclic network. © 2013 Blackwell Verlag GmbH.

Predicting and Detecting Emerging Cyberattack Patterns Using StreamWorks

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

Chin, George; Choudhury, Sutanay; Feo, John T.

2014-06-30

The number and sophistication of cyberattacks on industries and governments have dramatically grown in recent years. To counter this movement, new advanced tools and techniques are needed to detect cyberattacks in their early stages such that defensive actions may be taken to avert or mitigate potential damage. From a cybersecurity analysis perspective, detecting cyberattacks may be cast as a problem of identifying patterns in computer network traffic. Logically and intuitively, these patterns may take on the form of a directed graph that conveys how an attack or intrusion propagates through the computers of a network. Such cyberattack graphs could providemore » cybersecurity analysts with powerful conceptual representations that are natural to express and analyze. We have been researching and developing graph-centric approaches and algorithms for dynamic cyberattack detection. The advanced dynamic graph algorithms we are developing will be packaged into a streaming network analysis framework known as StreamWorks. With StreamWorks, a scientist or analyst may detect and identify precursor events and patterns as they emerge in complex networks. This analysis framework is intended to be used in a dynamic environment where network data is streamed in and is appended to a large-scale dynamic graph. Specific graphical query patterns are decomposed and collected into a graph query library. The individual decomposed subpatterns in the library are continuously and efficiently matched against the dynamic graph as it evolves to identify and detect early, partial subgraph patterns. The scalable emerging subgraph pattern algorithms will match on both structural and semantic network properties.« less

Time Course of Brain Network Reconfiguration Supporting Inhibitory Control.

PubMed

Popov, Tzvetan; Westner, Britta U; Silton, Rebecca L; Sass, Sarah M; Spielberg, Jeffrey M; Rockstroh, Brigitte; Heller, Wendy; Miller, Gregory A

2018-05-02

Hemodynamic research has recently clarified key nodes and links in brain networks implementing inhibitory control. Although fMRI methods are optimized for identifying the structure of brain networks, the relatively slow temporal course of fMRI limits the ability to characterize network operation. The latter is crucial for developing a mechanistic understanding of how brain networks shift dynamically to support inhibitory control. To address this critical gap, we applied spectrally resolved Granger causality (GC) and random forest machine learning tools to human EEG data in two large samples of adults (test sample n = 96, replication sample n = 237, total N = 333, both sexes) who performed a color-word Stroop task. Time-frequency analysis confirmed that recruitment of inhibitory control accompanied by slower behavioral responses was related to changes in theta and alpha/beta power. GC analyses revealed directionally asymmetric exchanges within frontal and between frontal and parietal brain areas: top-down influence of superior frontal gyrus (SFG) over both dorsal ACC (dACC) and inferior frontal gyrus (IFG), dACC control over middle frontal gyrus (MFG), and frontal-parietal exchanges (IFG, precuneus, MFG). Predictive analytics confirmed a combination of behavioral and brain-derived variables as the best set of predictors of inhibitory control demands, with SFG theta bearing higher classification importance than dACC theta and posterior beta tracking the onset of behavioral response. The present results provide mechanistic insight into the biological implementation of a psychological phenomenon: inhibitory control is implemented by dynamic routing processes during which the target response is upregulated via theta-mediated effective connectivity within key PFC nodes and via beta-mediated motor preparation. SIGNIFICANCE STATEMENT Hemodynamic neuroimaging research has recently clarified regional structures in brain networks supporting inhibitory control. However, due to inherent methodological constraints, much of this research has been unable to characterize the temporal dynamics of such networks (e.g., direction of information flow between nodes). Guided by fMRI research identifying the structure of brain networks supporting inhibitory control, results of EEG source analysis in a test sample ( n = 96) and replication sample ( n = 237) using effective connectivity and predictive analytics strategies advance a model of inhibitory control by characterizing the precise temporal dynamics by which this network operates and exemplify an approach by which mechanistic models can be developed for other key psychological processes. Copyright © 2018 the authors 0270-6474/18/384348-09$15.00/0.

Boolean Dynamic Modeling Approaches to Study Plant Gene Regulatory Networks: Integration, Validation, and Prediction.

PubMed

Velderraín, José Dávila; Martínez-García, Juan Carlos; Álvarez-Buylla, Elena R

2017-01-01

Mathematical models based on dynamical systems theory are well-suited tools for the integration of available molecular experimental data into coherent frameworks in order to propose hypotheses about the cooperative regulatory mechanisms driving developmental processes. Computational analysis of the proposed models using well-established methods enables testing the hypotheses by contrasting predictions with observations. Within such framework, Boolean gene regulatory network dynamical models have been extensively used in modeling plant development. Boolean models are simple and intuitively appealing, ideal tools for collaborative efforts between theorists and experimentalists. In this chapter we present protocols used in our group for the study of diverse plant developmental processes. We focus on conceptual clarity and practical implementation, providing directions to the corresponding technical literature.

Self-organized topology of recurrence-based complex networks

NASA Astrophysics Data System (ADS)

Yang, Hui; Liu, Gang

2013-12-01

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., "what is the self-organizing geometry of a recurrence network?" and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.

Self-organized topology of recurrence-based complex networks.

PubMed

Yang, Hui; Liu, Gang

2013-12-01

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article is to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., "what is the self-organizing geometry of a recurrence network?" and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.

Self-organized topology of recurrence-based complex networks

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

Yang, Hui, E-mail: huiyang@usf.edu; Liu, Gang

With the rapid technological advancement, network is almost everywhere in our daily life. Network theory leads to a new way to investigate the dynamics of complex systems. As a result, many methods are proposed to construct a network from nonlinear time series, including the partition of state space, visibility graph, nearest neighbors, and recurrence approaches. However, most previous works focus on deriving the adjacency matrix to represent the complex network and extract new network-theoretic measures. Although the adjacency matrix provides connectivity information of nodes and edges, the network geometry can take variable forms. The research objective of this article ismore » to develop a self-organizing approach to derive the steady geometric structure of a network from the adjacency matrix. We simulate the recurrence network as a physical system by treating the edges as springs and the nodes as electrically charged particles. Then, force-directed algorithms are developed to automatically organize the network geometry by minimizing the system energy. Further, a set of experiments were designed to investigate important factors (i.e., dynamical systems, network construction methods, force-model parameter, nonhomogeneous distribution) affecting this self-organizing process. Interestingly, experimental results show that the self-organized geometry recovers the attractor of a dynamical system that produced the adjacency matrix. This research addresses a question, i.e., “what is the self-organizing geometry of a recurrence network?” and provides a new way to reproduce the attractor or time series from the recurrence plot. As a result, novel network-theoretic measures (e.g., average path length and proximity ratio) can be achieved based on actual node-to-node distances in the self-organized network topology. The paper brings the physical models into the recurrence analysis and discloses the spatial geometry of recurrence networks.« less

Secure and Cost-Effective Distributed Aggregation for Mobile Sensor Networks

PubMed Central

Guo, Kehua; Zhang, Ping; Ma, Jianhua

2016-01-01

Secure data aggregation (SDA) schemes are widely used in distributed applications, such as mobile sensor networks, to reduce communication cost, prolong the network life cycle and provide security. However, most SDA are only suited for a single type of statistics (i.e., summation-based or comparison-based statistics) and are not applicable to obtaining multiple statistic results. Most SDA are also inefficient for dynamic networks. This paper presents multi-functional secure data aggregation (MFSDA), in which the mapping step and coding step are introduced to provide value-preserving and order-preserving and, later, to enable arbitrary statistics support in the same query. MFSDA is suited for dynamic networks because these active nodes can be counted directly from aggregation data. The proposed scheme is tolerant to many types of attacks. The network load of the proposed scheme is balanced, and no significant bottleneck exists. The MFSDA includes two versions: MFSDA-I and MFSDA-II. The first one can obtain accurate results, while the second one is a more generalized version that can significantly reduce network traffic at the expense of less accuracy loss. PMID:27120599

Birth of an abstraction: a dynamical systems account of the discovery of an elsewhere principle in a category learning task.

PubMed

Tabor, Whitney; Cho, Pyeong W; Dankowicz, Harry

2013-01-01

Human participants and recurrent ("connectionist") neural networks were both trained on a categorization system abstractly similar to natural language systems involving irregular ("strong") classes and a default class. Both the humans and the networks exhibited staged learning and a generalization pattern reminiscent of the Elsewhere Condition (Kiparsky, 1973). Previous connectionist accounts of related phenomena have often been vague about the nature of the networks' encoding systems. We analyzed our network using dynamical systems theory, revealing topological and geometric properties that can be directly compared with the mechanisms of non-connectionist, rule-based accounts. The results reveal that the networks "contain" structures related to mechanisms posited by rule-based models, partly vindicating the insights of these models. On the other hand, they support the one mechanism (OM), as opposed to the more than one mechanism (MOM), view of symbolic abstraction by showing how the appearance of MOM behavior can arise emergently from one underlying set of principles. The key new contribution of this study is to show that dynamical systems theory can allow us to explicitly characterize the relationship between the two perspectives in implemented models. © 2013 Cognitive Science Society, Inc.

Between “design” and “bricolage”: Genetic networks, levels of selection, and adaptive evolution

PubMed Central

Wilkins, Adam S.

2007-01-01

The extent to which “developmental constraints” in complex organisms restrict evolutionary directions remains contentious. Yet, other forms of internal constraint, which have received less attention, may also exist. It will be argued here that a set of partial constraints below the level of phenotypes, those involving genes and molecules, influences and channels the set of possible evolutionary trajectories. At the top-most organizational level there are the genetic network modules, whose operations directly underlie complex morphological traits. The properties of these network modules, however, have themselves been set by the evolutionary history of the component genes and their interactions. Characterization of the components, structures, and operational dynamics of specific genetic networks should lead to a better understanding not only of the morphological traits they underlie but of the biases that influence the directions of evolutionary change. Furthermore, such knowledge may permit assessment of the relative degrees of probability of short evolutionary trajectories, those on the microevolutionary scale. In effect, a “network perspective” may help transform evolutionary biology into a scientific enterprise with greater predictive capability than it has hitherto possessed. PMID:17494754

Between "design" and "bricolage": genetic networks, levels of selection, and adaptive evolution.

PubMed

Wilkins, Adam S

2007-05-15

The extent to which "developmental constraints" in complex organisms restrict evolutionary directions remains contentious. Yet, other forms of internal constraint, which have received less attention, may also exist. It will be argued here that a set of partial constraints below the level of phenotypes, those involving genes and molecules, influences and channels the set of possible evolutionary trajectories. At the top-most organizational level there are the genetic network modules, whose operations directly underlie complex morphological traits. The properties of these network modules, however, have themselves been set by the evolutionary history of the component genes and their interactions. Characterization of the components, structures, and operational dynamics of specific genetic networks should lead to a better understanding not only of the morphological traits they underlie but of the biases that influence the directions of evolutionary change. Furthermore, such knowledge may permit assessment of the relative degrees of probability of short evolutionary trajectories, those on the microevolutionary scale. In effect, a "network perspective" may help transform evolutionary biology into a scientific enterprise with greater predictive capability than it has hitherto possessed.

Modeling oscillatory dynamics in brain microcircuits as a way to help uncover neurological disease mechanisms: A proposal

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

Skinner, F. K.; Department of Medicine; Department of Physiology, University of Toronto Medical Sciences Building, 3rd Floor, 1 King's College Circle, Toronto, Ontario M5S 1A8

There is an undisputed need and requirement for theoretical and computational studies in Neuroscience today. Furthermore, it is clear that oscillatory dynamical output from brain networks is representative of various behavioural states, and it is becoming clear that one could consider these outputs as measures of normal and pathological brain states. Although mathematical modeling of oscillatory dynamics in the context of neurological disease exists, it is a highly challenging endeavour because of the many levels of organization in the nervous system. This challenge is coupled with the increasing knowledge of cellular specificity and network dysfunction that is associated with disease.more » Recently, whole hippocampus in vitro preparations from control animals have been shown to spontaneously express oscillatory activities. In addition, when using preparations derived from animal models of disease, these activities show particular alterations. These preparations present an opportunity to address challenges involved with using models to gain insight because of easier access to simultaneous cellular and network measurements, and pharmacological modulations. We propose that by developing and using models with direct links to experiment at multiple levels, which at least include cellular and microcircuit, a cycling can be set up and used to help us determine critical mechanisms underlying neurological disease. We illustrate our proposal using our previously developed inhibitory network models in the context of these whole hippocampus preparations and show the importance of having direct links at multiple levels.« less

Dynamic functional-structural coupling within acute functional state change phases: Evidence from a depression recognition study.

PubMed

Bi, Kun; Hua, Lingling; Wei, Maobin; Qin, Jiaolong; Lu, Qing; Yao, Zhijian

2016-02-01

Dynamic functional-structural connectivity (FC-SC) coupling might reflect the flexibility by which SC relates to functional connectivity (FC). However, during the dynamic acute state change phases of FC, the relationship between FC and SC may be distinctive and embody the abnormality inherent in depression. This study investigated the depression-related inter-network FC-SC coupling within particular dynamic acute state change phases of FC. Magnetoencephalography (MEG) and diffusion tensor imaging (DTI) data were collected from 26 depressive patients (13 women) and 26 age-matched controls (13 women). We constructed functional brain networks based on MEG data and structural networks from DTI data. The dynamic connectivity regression algorithm was used to identify the state change points of a time series of inter-network FC. The time period of FC that contained change points were partitioned into types of dynamic phases (acute rising phase, acute falling phase,acute rising and falling phase and abrupt FC variation phase) to explore the inter-network FC-SC coupling. The selected FC-SC couplings were then fed into the support vector machine (SVM) for depression recognition. The best discrimination accuracy was 82.7% (P=0.0069) with FC-SC couplings, particularly in the acute rising phase of FC. Within the FC phases of interest, the significant discriminative network pair was related to the salience network vs ventral attention network (SN-VAN) (P=0.0126) during the early rising phase (70-170ms). This study suffers from a small sample size, and the individual acute length of the state change phases was not considered. The increased values of significant discriminative vectors of FC-SC coupling in depression suggested that the capacity to process negative emotion might be more directly related to the SC abnormally and be indicative of more stringent and less dynamic brain function in SN-VAN, especially in the acute rising phase of FC. We demonstrated that depressive brain dysfunctions could be better characterized by reduced FC-SC coupling flexibility in this particular phase. Copyright © 2015 Elsevier B.V. All rights reserved.

Network Inference via the Time-Varying Graphical Lasso

PubMed Central

Hallac, David; Park, Youngsuk; Boyd, Stephen; Leskovec, Jure

2018-01-01

Many important problems can be modeled as a system of interconnected entities, where each entity is recording time-dependent observations or measurements. In order to spot trends, detect anomalies, and interpret the temporal dynamics of such data, it is essential to understand the relationships between the different entities and how these relationships evolve over time. In this paper, we introduce the time-varying graphical lasso (TVGL), a method of inferring time-varying networks from raw time series data. We cast the problem in terms of estimating a sparse time-varying inverse covariance matrix, which reveals a dynamic network of interdependencies between the entities. Since dynamic network inference is a computationally expensive task, we derive a scalable message-passing algorithm based on the Alternating Direction Method of Multipliers (ADMM) to solve this problem in an efficient way. We also discuss several extensions, including a streaming algorithm to update the model and incorporate new observations in real time. Finally, we evaluate our TVGL algorithm on both real and synthetic datasets, obtaining interpretable results and outperforming state-of-the-art baselines in terms of both accuracy and scalability. PMID:29770256

Synchronization and coordination of sequences in two neural ensembles

NASA Astrophysics Data System (ADS)

Venaille, Antoine; Varona, Pablo; Rabinovich, Mikhail I.

2005-06-01

There are many types of neural networks involved in the sequential motor behavior of animals. For high species, the control and coordination of the network dynamics is a function of the higher levels of the central nervous system, in particular the cerebellum. However, in many cases, especially for invertebrates, such coordination is the result of direct synaptic connections between small circuits. We show here that even the chaotic sequential activity of small model networks can be coordinated by electrotonic synapses connecting one or several pairs of neurons that belong to two different networks. As an example, we analyzed the coordination and synchronization of the sequential activity of two statocyst model networks of the marine mollusk Clione. The statocysts are gravity sensory organs that play a key role in postural control of the animal and the generation of a complex hunting motor program. Each statocyst network was modeled by a small ensemble of neurons with Lotka-Volterra type dynamics and nonsymmetric inhibitory interactions. We studied how two such networks were synchronized by electrical coupling in the presence of an external signal which lead to winnerless competition among the neurons. We found that as a function of the number and the strength of connections between the two networks, it is possible to coordinate and synchronize the sequences that each network generates with its own chaotic dynamics. In spite of the chaoticity, the coordination of the signals is established through an activation sequence lock for those neurons that are active at a particular instant of time.

Genomic analysis of regulatory network dynamics reveals large topological changes

NASA Astrophysics Data System (ADS)

Luscombe, Nicholas M.; Madan Babu, M.; Yu, Haiyuan; Snyder, Michael; Teichmann, Sarah A.; Gerstein, Mark

2004-09-01

Network analysis has been applied widely, providing a unifying language to describe disparate systems ranging from social interactions to power grids. It has recently been used in molecular biology, but so far the resulting networks have only been analysed statically. Here we present the dynamics of a biological network on a genomic scale, by integrating transcriptional regulatory information and gene-expression data for multiple conditions in Saccharomyces cerevisiae. We develop an approach for the statistical analysis of network dynamics, called SANDY, combining well-known global topological measures, local motifs and newly derived statistics. We uncover large changes in underlying network architecture that are unexpected given current viewpoints and random simulations. In response to diverse stimuli, transcription factors alter their interactions to varying degrees, thereby rewiring the network. A few transcription factors serve as permanent hubs, but most act transiently only during certain conditions. By studying sub-network structures, we show that environmental responses facilitate fast signal propagation (for example, with short regulatory cascades), whereas the cell cycle and sporulation direct temporal progression through multiple stages (for example, with highly inter-connected transcription factors). Indeed, to drive the latter processes forward, phase-specific transcription factors inter-regulate serially, and ubiquitously active transcription factors layer above them in a two-tiered hierarchy. We anticipate that many of the concepts presented here-particularly the large-scale topological changes and hub transience-will apply to other biological networks, including complex sub-systems in higher eukaryotes.

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.

Receiver Statistics for Cognitive Radios in Dynamic Spectrum Access Networks

DTIC Science & Technology

2012-02-28

SNR) are employed by many protocols and processes in direct-sequence ( DS ) spread-spectrum packet radio networks, including soft-decision decoding...adaptive modulation protocols, and power adjustment protocols. For DS spread spectrum, we have introduced and evaluated SNR estimators that employ...obtained during demodulation in a binary CDMA receiver. We investigated several methods to apply the proposed metric to the demodulator’s soft-decision

Effect of interaction strength on robustness of controlling edge dynamics in complex networks

NASA Astrophysics Data System (ADS)

Pang, Shao-Peng; Hao, Fei

2018-05-01

Robustness plays a critical role in the controllability of complex networks to withstand failures and perturbations. Recent advances in the edge controllability show that the interaction strength among edges plays a more important role than network structure. Therefore, we focus on the effect of interaction strength on the robustness of edge controllability. Using three categories of all edges to quantify the robustness, we develop a universal framework to evaluate and analyze the robustness in complex networks with arbitrary structures and interaction strengths. Applying our framework to a large number of model and real-world networks, we find that the interaction strength is a dominant factor for the robustness in undirected networks. Meanwhile, the strongest robustness and the optimal edge controllability in undirected networks can be achieved simultaneously. Different from the case of undirected networks, the robustness in directed networks is determined jointly by the interaction strength and the network's degree distribution. Moreover, a stronger robustness is usually associated with a larger number of driver nodes required to maintain full control in directed networks. This prompts us to provide an optimization method by adjusting the interaction strength to optimize the robustness of edge controllability.

Collection Directions: Some Reflections on the Future of Library Collections and Collecting

ERIC Educational Resources Information Center

Dempsey, Lorcan; Malpas, Constance; Lavoie, Brian

2014-01-01

This article takes a broad view of the evolution of collecting behaviors in a network environment and suggests some future directions based on various simple models. The authors look at the changing dynamics of print collections, at the greater engagement with research and learning behaviors, and at trends in scholarly communication. The goal is…

Review of Literature on Mentorship Networks in Medicine: Where Are We Now and Where Are We Going?

NASA Astrophysics Data System (ADS)

Mickelson, Jennifer Judith

Mentorship is imperative in medical training and conceptual frameworks for mentoring continue to evolve. This study is an integrated review of the literature on mentoring networks. A systematic review of the literature on mentoring networks identified 943 articles from multiple databases. 24 relevant articles under went qualitative analysis. An iterative approach was taken to formulate themes, subthemes and codes. Three major themes were identified. The first theme was that group or peer networks meet evolving and dynamic or changing needs through training and career development. A prominent subtheme was identified which was the need for mentees to be the architects or directors of their evolving mentorship networks. The second theme identified was that mentorship networks offered a solution to barriers associated with the dyad model of mentorship. The third theme was the importance of the informality or "voluntary marriages", as distinguished from structured formal programs, to create meaningful mentorship networks. Future directions of study include examining how to empower mentees to facilitate and direct their mentorship networks.

Reconstruction and topological characterization of the sigma factor regulatory network of Mycobacterium tuberculosis

PubMed Central

Chauhan, Rinki; Ravi, Janani; Datta, Pratik; Chen, Tianlong; Schnappinger, Dirk; Bassler, Kevin E.; Balázsi, Gábor; Gennaro, Maria Laura

2016-01-01

Accessory sigma factors, which reprogram RNA polymerase to transcribe specific gene sets, activate bacterial adaptive responses to noxious environments. Here we reconstruct the complete sigma factor regulatory network of the human pathogen Mycobacterium tuberculosis by an integrated approach. The approach combines identification of direct regulatory interactions between M. tuberculosis sigma factors in an E. coli model system, validation of selected links in M. tuberculosis, and extensive literature review. The resulting network comprises 41 direct interactions among all 13 sigma factors. Analysis of network topology reveals (i) a three-tiered hierarchy initiating at master regulators, (ii) high connectivity and (iii) distinct communities containing multiple sigma factors. These topological features are likely associated with multi-layer signal processing and specialized stress responses involving multiple sigma factors. Moreover, the identification of overrepresented network motifs, such as autoregulation and coregulation of sigma and anti-sigma factor pairs, provides structural information that is relevant for studies of network dynamics. PMID:27029515

Some new results on stability and synchronization for delayed inertial neural networks based on non-reduced order method.

PubMed

Li, Xuanying; Li, Xiaotong; Hu, Cheng

2017-12-01

In this paper, without transforming the second order inertial neural networks into the first order differential systems by some variable substitutions, asymptotic stability and synchronization for a class of delayed inertial neural networks are investigated. Firstly, a new Lyapunov functional is constructed to directly propose the asymptotic stability of the inertial neural networks, and some new stability criteria are derived by means of Barbalat Lemma. Additionally, by designing a new feedback control strategy, the asymptotic synchronization of the addressed inertial networks is studied and some effective conditions are obtained. To reduce the control cost, an adaptive control scheme is designed to realize the asymptotic synchronization. It is noted that the dynamical behaviors of inertial neural networks are directly analyzed in this paper by constructing some new Lyapunov functionals, this is totally different from the traditional reduced-order variable substitution method. Finally, some numerical simulations are given to demonstrate the effectiveness of the derived theoretical results. Copyright © 2017 Elsevier Ltd. All rights reserved.

Optimization of matrix tablets controlled drug release using Elman dynamic neural networks and decision trees.

PubMed

Petrović, Jelena; Ibrić, Svetlana; Betz, Gabriele; Đurić, Zorica

2012-05-30

The main objective of the study was to develop artificial intelligence methods for optimization of drug release from matrix tablets regardless of the matrix type. Static and dynamic artificial neural networks of the same topology were developed to model dissolution profiles of different matrix tablets types (hydrophilic/lipid) using formulation composition, compression force used for tableting and tablets porosity and tensile strength as input data. Potential application of decision trees in discovering knowledge from experimental data was also investigated. Polyethylene oxide polymer and glyceryl palmitostearate were used as matrix forming materials for hydrophilic and lipid matrix tablets, respectively whereas selected model drugs were diclofenac sodium and caffeine. Matrix tablets were prepared by direct compression method and tested for in vitro dissolution profiles. Optimization of static and dynamic neural networks used for modeling of drug release was performed using Monte Carlo simulations or genetic algorithms optimizer. Decision trees were constructed following discretization of data. Calculated difference (f(1)) and similarity (f(2)) factors for predicted and experimentally obtained dissolution profiles of test matrix tablets formulations indicate that Elman dynamic neural networks as well as decision trees are capable of accurate predictions of both hydrophilic and lipid matrix tablets dissolution profiles. Elman neural networks were compared to most frequently used static network, Multi-layered perceptron, and superiority of Elman networks have been demonstrated. Developed methods allow simple, yet very precise way of drug release predictions for both hydrophilic and lipid matrix tablets having controlled drug release. Copyright © 2012 Elsevier B.V. All rights reserved.

Modeling Brain Dynamics in Brain Tumor Patients Using the Virtual Brain.

PubMed

Aerts, Hannelore; Schirner, Michael; Jeurissen, Ben; Van Roost, Dirk; Achten, Eric; Ritter, Petra; Marinazzo, Daniele

2018-01-01

Presurgical planning for brain tumor resection aims at delineating eloquent tissue in the vicinity of the lesion to spare during surgery. To this end, noninvasive neuroimaging techniques such as functional MRI and diffusion-weighted imaging fiber tracking are currently employed. However, taking into account this information is often still insufficient, as the complex nonlinear dynamics of the brain impede straightforward prediction of functional outcome after surgical intervention. Large-scale brain network modeling carries the potential to bridge this gap by integrating neuroimaging data with biophysically based models to predict collective brain dynamics. As a first step in this direction, an appropriate computational model has to be selected, after which suitable model parameter values have to be determined. To this end, we simulated large-scale brain dynamics in 25 human brain tumor patients and 11 human control participants using The Virtual Brain, an open-source neuroinformatics platform. Local and global model parameters of the Reduced Wong-Wang model were individually optimized and compared between brain tumor patients and control subjects. In addition, the relationship between model parameters and structural network topology and cognitive performance was assessed. Results showed (1) significantly improved prediction accuracy of individual functional connectivity when using individually optimized model parameters; (2) local model parameters that can differentiate between regions directly affected by a tumor, regions distant from a tumor, and regions in a healthy brain; and (3) interesting associations between individually optimized model parameters and structural network topology and cognitive performance.

Understanding the representativeness of FLUXNET for upscaling carbon flux from eddy covariance measurements

DOE PAGES

Kumar, Jitendra; Hoffman, Forrest M.; Hargrove, William W.; ...

2016-08-23

Eddy covariance data from regional flux networks are direct in situ measurement of carbon, water, and energy fluxes and are of vital importance for understanding the spatio-temporal dynamics of the the global carbon cycle. FLUXNET links regional networks of eddy covariance sites across the globe to quantify the spatial and temporal variability of fluxes at regional to global scales and to detect emergent ecosystem properties. This study presents an assessment of the representativeness of FLUXNET based on the recently released FLUXNET2015 data set. We present a detailed high resolution analysis of the evolving representativeness of FLUXNET through time. Results providemore » quantitative insights into the extent that various biomes are sampled by the network of networks, the role of the spatial distribution of the sites on the network scale representativeness at any given time, and how that representativeness has changed through time due to changing operational status and data availability at sites in the network. To realize the full potential of FLUXNET observations for understanding emergent ecosystem properties at regional and global scales, we present an approach for upscaling eddy covariance measurements. Informed by the representativeness of observations at the flux sites in the network, the upscaled data reflects the spatio-temporal dynamics of the carbon cycle captured by the in situ measurements. In conclusion, this study presents a method for optimal use of the rich point measurements from FLUXNET to derive an understanding of upscaled carbon fluxes, which can be routinely updated as new data become available, and direct network expansion by identifying regions poorly sampled by the current network.« less

Comprehensive risk assessment method of catastrophic accident based on complex network properties

NASA Astrophysics Data System (ADS)

Cui, Zhen; Pang, Jun; Shen, Xiaohong

2017-09-01

On the macro level, the structural properties of the network and the electrical characteristics of the micro components determine the risk of cascading failures. And the cascading failures, as a process with dynamic development, not only the direct risk but also potential risk should be considered. In this paper, comprehensively considered the direct risk and potential risk of failures based on uncertain risk analysis theory and connection number theory, quantified uncertain correlation by the node degree and node clustering coefficient, then established a comprehensive risk indicator of failure. The proposed method has been proved by simulation on the actual power grid. Modeling a network according to the actual power grid, and verified the rationality of the proposed method.

Creative Cognition and Brain Network Dynamics.

PubMed

Beaty, Roger E; Benedek, Mathias; Silvia, Paul J; Schacter, Daniel L

2016-02-01

Creative thinking is central to the arts, sciences, and everyday life. How does the brain produce creative thought? A series of recently published papers has begun to provide insight into this question, reporting a strikingly similar pattern of brain activity and connectivity across a range of creative tasks and domains, from divergent thinking to poetry composition to musical improvisation. This research suggests that creative thought involves dynamic interactions of large-scale brain systems, with the most compelling finding being that the default and executive control networks, which can show an antagonistic relation, tend to cooperate during creative cognition and artistic performance. These findings have implications for understanding how brain networks interact to support complex cognitive processes, particularly those involving goal-directed, self-generated thought. Copyright © 2015 Elsevier Ltd. All rights reserved.

Creep-induced anisotropy in covalent adaptable network polymers.

PubMed

Hanzon, Drew W; He, Xu; Yang, Hua; Shi, Qian; Yu, Kai

2017-10-11

Anisotropic polymers with aligned macromolecule chains exhibit directional strengthening of mechanical and physical properties. However, manipulating the orientation of polymer chains in a fully cured thermoset is almost impossible due to its permanently crosslinked nature. In this paper, we demonstrate that rearrangeable networks with bond exchange reactions (BERs) can be utilized to tailor the anisotropic mechanical properties of thermosetting polymers. When a constant force is maintained at BER activated temperatures, the malleable thermoset creeps in the direction of stress, and macromolecule chains align themselves in the same direction. The aligned polymer chains result in an anisotropic network with a stiffer mechanical behavior in the direction of creep, while with a more compliant behavior in the transverse direction. The degree of network anisotropy is proportional to the amount of creep strain. A multi-length scale constitutive model is developed to study the creep-induced anisotropy of thermosetting polymers. The model connects the micro-scale BER kinetics, orientation of polymer chains, and directional mechanical properties of network polymers. Without any fitting parameters, it is able to predict the evolution of creep strain at different temperatures and anisotropic stress-strain behaviors of CANs after creep. Predictions on the chain orientation are verified by molecular dynamics (MD) simulation. Based on parametric studies, it is shown that the influences of creep time and temperature on the network anisotropy can be generalized into a single parameter, and the evolution of directional modulus follows an Arrhenius type time-temperature superposition principle (TTSP). The presented work provides a facile approach to transform isotropic thermosets into anisotropic ones using simple heating, and their directional properties can be readily tailored by the processing conditions.

Phase dynamics of coupled oscillators reconstructed from data

NASA Astrophysics Data System (ADS)

Rosenblum, Michael; Kralemann, Bjoern; Pikovsky, Arkady

2013-03-01

We present a technique for invariant reconstruction of the phase dynamics equations for coupled oscillators from data. The invariant description is achieved by means of a transformation of phase estimates (protophases) obtained from general scalar observables to genuine phases. Staring from the bivariate data, we obtain the coupling functions in terms of these phases. We discuss the importance of the protophase-to-phase transformation for characterization of strength and directionality of interaction. To illustrate the technique we analyse the cardio-respiratory interaction on healthy humans. Our invariant approach is confirmed by high similarity of the coupling functions obtained from different observables of the cardiac system. Next, we generalize the technique to cover the case of small networks of coupled periodic units. We use the partial norms of the reconstructed coupling functions to quantify directed coupling between the oscillators. We illustrate the method by different network motifs for three coupled oscillators. We also discuss nonlinear effects in coupling.

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

NASA Astrophysics Data System (ADS)

Guo, Li; Chen, Jin; Lin, Henry

2014-12-01

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

Linking social and pathogen transmission networks using microbial genetics in giraffe (Giraffa camelopardalis).

PubMed

VanderWaal, Kimberly L; Atwill, Edward R; Isbell, Lynne A; McCowan, Brenda

2014-03-01

Although network analysis has drawn considerable attention as a promising tool for disease ecology, empirical research has been hindered by limitations in detecting the occurrence of pathogen transmission (who transmitted to whom) within social networks. Using a novel approach, we utilize the genetics of a diverse microbe, Escherichia coli, to infer where direct or indirect transmission has occurred and use these data to construct transmission networks for a wild giraffe population (Giraffe camelopardalis). Individuals were considered to be a part of the same transmission chain and were interlinked in the transmission network if they shared genetic subtypes of E. coli. By using microbial genetics to quantify who transmits to whom independently from the behavioural data on who is in contact with whom, we were able to directly investigate how the structure of contact networks influences the structure of the transmission network. To distinguish between the effects of social and environmental contact on transmission dynamics, the transmission network was compared with two separate contact networks defined from the behavioural data: a social network based on association patterns, and a spatial network based on patterns of home-range overlap among individuals. We found that links in the transmission network were more likely to occur between individuals that were strongly linked in the social network. Furthermore, individuals that had more numerous connections or that occupied 'bottleneck' positions in the social network tended to occupy similar positions in the transmission network. No similar correlations were observed between the spatial and transmission networks. This indicates that an individual's social network position is predictive of transmission network position, which has implications for identifying individuals that function as super-spreaders or transmission bottlenecks in the population. These results emphasize the importance of association patterns in understanding transmission dynamics, even for environmentally transmitted microbes like E. coli. This study is the first to use microbial genetics to construct and analyse transmission networks in a wildlife population and highlights the potential utility of an approach integrating microbial genetics with network analysis. © 2013 The Authors. Journal of Animal Ecology © 2013 British Ecological Society.

A study on predicting network corrections in PPP-RTK processing

NASA Astrophysics Data System (ADS)

Wang, Kan; Khodabandeh, Amir; Teunissen, Peter

2017-10-01

In PPP-RTK processing, the network corrections including the satellite clocks, the satellite phase biases and the ionospheric delays are provided to the users to enable fast single-receiver integer ambiguity resolution. To solve the rank deficiencies in the undifferenced observation equations, the estimable parameters are formed to generate full-rank design matrix. In this contribution, we firstly discuss the interpretation of the estimable parameters without and with a dynamic satellite clock model incorporated in a Kalman filter during the network processing. The functionality of the dynamic satellite clock model is tested in the PPP-RTK processing. Due to the latency generated by the network processing and data transfer, the network corrections are delayed for the real-time user processing. To bridge the latencies, we discuss and compare two prediction approaches making use of the network corrections without and with the dynamic satellite clock model, respectively. The first prediction approach is based on the polynomial fitting of the estimated network parameters, while the second approach directly follows the dynamic model in the Kalman filter of the network processing and utilises the satellite clock drifts estimated in the network processing. Using 1 Hz data from two networks in Australia, the influences of the two prediction approaches on the user positioning results are analysed and compared for latencies ranging from 3 to 10 s. The accuracy of the positioning results decreases with the increasing latency of the network products. For a latency of 3 s, the RMS of the horizontal and the vertical coordinates (with respect to the ground truth) do not show large differences applying both prediction approaches. For a latency of 10 s, the prediction approach making use of the satellite clock model has generated slightly better positioning results with the differences of the RMS at mm-level. Further advantages and disadvantages of both prediction approaches are also discussed in this contribution.

Controlling infectious disease through the targeted manipulation of contact network structure

PubMed Central

Gates, M. Carolyn; Woolhouse, Mark E.J.

2015-01-01

Individuals in human and animal populations are linked through dynamic contact networks with characteristic structural features that drive the epidemiology of directly transmissible infectious diseases. Using animal movement data from the British cattle industry as an example, this analysis explores whether disease dynamics can be altered by placing targeted restrictions on contact formation to reconfigure network topology. This was accomplished using a simple network generation algorithm that combined configuration wiring with stochastic block modelling techniques to preserve the weighted in- and out-degree of individual nodes (farms) as well as key demographic characteristics of the individual network connections (movement date, livestock market, and animal production type). We then tested a control strategy based on introducing additional constraints into the network generation algorithm to prevent farms with a high in-degree from selling cattle to farms with a high out-degree as these particular network connections are predicted to have a disproportionately strong role in spreading disease. Results from simple dynamic disease simulation models predicted significantly lower endemic disease prevalences on the trade restricted networks compared to the baseline generated networks. As expected, the relative magnitude of the predicted changes in endemic prevalence was greater for diseases with short infectious periods and low transmission probabilities. Overall, our study findings demonstrate that there is significant potential for controlling multiple infectious diseases simultaneously by manipulating networks to have more epidemiologically favourable topological configurations. Further research is needed to determine whether the economic and social benefits of controlling disease can justify the costs of restricting contact formation. PMID:26342238

Controlling infectious disease through the targeted manipulation of contact network structure.

PubMed

Gates, M Carolyn; Woolhouse, Mark E J

2015-09-01

Individuals in human and animal populations are linked through dynamic contact networks with characteristic structural features that drive the epidemiology of directly transmissible infectious diseases. Using animal movement data from the British cattle industry as an example, this analysis explores whether disease dynamics can be altered by placing targeted restrictions on contact formation to reconfigure network topology. This was accomplished using a simple network generation algorithm that combined configuration wiring with stochastic block modelling techniques to preserve the weighted in- and out-degree of individual nodes (farms) as well as key demographic characteristics of the individual network connections (movement date, livestock market, and animal production type). We then tested a control strategy based on introducing additional constraints into the network generation algorithm to prevent farms with a high in-degree from selling cattle to farms with a high out-degree as these particular network connections are predicted to have a disproportionately strong role in spreading disease. Results from simple dynamic disease simulation models predicted significantly lower endemic disease prevalences on the trade restricted networks compared to the baseline generated networks. As expected, the relative magnitude of the predicted changes in endemic prevalence was greater for diseases with short infectious periods and low transmission probabilities. Overall, our study findings demonstrate that there is significant potential for controlling multiple infectious diseases simultaneously by manipulating networks to have more epidemiologically favourable topological configurations. Further research is needed to determine whether the economic and social benefits of controlling disease can justify the costs of restricting contact formation. Copyright © 2015 The Authors. Published by Elsevier B.V. All rights reserved.

Random and Directed Walk-Based Top-k Queries in Wireless Sensor Networks

PubMed Central

Fu, Jun-Song; Liu, Yun

2015-01-01

In wireless sensor networks, filter-based top-k query approaches are the state-of-the-art solutions and have been extensively researched in the literature, however, they are very sensitive to the network parameters, including the size of the network, dynamics of the sensors’ readings and declines in the overall range of all the readings. In this work, a random walk-based top-k query approach called RWTQ and a directed walk-based top-k query approach called DWTQ are proposed. At the beginning of a top-k query, one or several tokens are sent to the specific node(s) in the network by the base station. Then, each token walks in the network independently to record and process the readings in a random or directed way. A strategy of choosing the “right” way in DWTQ is carefully designed for the token(s) to arrive at the high-value regions as soon as possible. When designing the walking strategy for DWTQ, the spatial correlations of the readings are also considered. Theoretical analysis and simulation results indicate that RWTQ and DWTQ both are very robust against these parameters discussed previously. In addition, DWTQ outperforms TAG, FILA and EXTOK in transmission cost, energy consumption and network lifetime. PMID:26016914

Mathematical modeling and computational prediction of cancer drug resistance.

PubMed

Sun, Xiaoqiang; Hu, Bin

2017-06-23

Diverse forms of resistance to anticancer drugs can lead to the failure of chemotherapy. Drug resistance is one of the most intractable issues for successfully treating cancer in current clinical practice. Effective clinical approaches that could counter drug resistance by restoring the sensitivity of tumors to the targeted agents are urgently needed. As numerous experimental results on resistance mechanisms have been obtained and a mass of high-throughput data has been accumulated, mathematical modeling and computational predictions using systematic and quantitative approaches have become increasingly important, as they can potentially provide deeper insights into resistance mechanisms, generate novel hypotheses or suggest promising treatment strategies for future testing. In this review, we first briefly summarize the current progress of experimentally revealed resistance mechanisms of targeted therapy, including genetic mechanisms, epigenetic mechanisms, posttranslational mechanisms, cellular mechanisms, microenvironmental mechanisms and pharmacokinetic mechanisms. Subsequently, we list several currently available databases and Web-based tools related to drug sensitivity and resistance. Then, we focus primarily on introducing some state-of-the-art computational methods used in drug resistance studies, including mechanism-based mathematical modeling approaches (e.g. molecular dynamics simulation, kinetic model of molecular networks, ordinary differential equation model of cellular dynamics, stochastic model, partial differential equation model, agent-based model, pharmacokinetic-pharmacodynamic model, etc.) and data-driven prediction methods (e.g. omics data-based conventional screening approach for node biomarkers, static network approach for edge biomarkers and module biomarkers, dynamic network approach for dynamic network biomarkers and dynamic module network biomarkers, etc.). Finally, we discuss several further questions and future directions for the use of computational methods for studying drug resistance, including inferring drug-induced signaling networks, multiscale modeling, drug combinations and precision medicine. © The Author 2017. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

EEG functional connectivity is partially predicted by underlying white matter connectivity

PubMed Central

Chu, CJ; Tanaka, N; Diaz, J; Edlow, BL; Wu, O; Hämäläinen, M; Stufflebeam, S; Cash, SS; Kramer, MA.

2015-01-01

Over the past decade, networks have become a leading model to illustrate both the anatomical relationships (structural networks) and the coupling of dynamic physiology (functional networks) linking separate brain regions. The relationship between these two levels of description remains incompletely understood and an area of intense research interest. In particular, it is unclear how cortical currents relate to underlying brain structural architecture. In addition, although theory suggests that brain communication is highly frequency dependent, how structural connections influence overlying functional connectivity in different frequency bands has not been previously explored. Here we relate functional networks inferred from statistical associations between source imaging of EEG activity and underlying cortico-cortical structural brain connectivity determined by probabilistic white matter tractography. We evaluate spontaneous fluctuating cortical brain activity over a long time scale (minutes) and relate inferred functional networks to underlying structural connectivity for broadband signals, as well as in seven distinct frequency bands. We find that cortical networks derived from source EEG estimates partially reflect both direct and indirect underlying white matter connectivity in all frequency bands evaluated. In addition, we find that when structural support is absent, functional connectivity is significantly reduced for high frequency bands compared to low frequency bands. The association between cortical currents and underlying white matter connectivity highlights the obligatory interdependence of functional and structural networks in the human brain. The increased dependence on structural support for the coupling of higher frequency brain rhythms provides new evidence for how underlying anatomy directly shapes emergent brain dynamics at fast time scales. PMID:25534110

Dysregulation of Prefrontal Cortex-Mediated Slow-Evolving Limbic Dynamics Drives Stress-Induced Emotional Pathology.

PubMed

Hultman, Rainbo; Mague, Stephen D; Li, Qiang; Katz, Brittany M; Michel, Nadine; Lin, Lizhen; Wang, Joyce; David, Lisa K; Blount, Cameron; Chandy, Rithi; Carlson, David; Ulrich, Kyle; Carin, Lawrence; Dunson, David; Kumar, Sunil; Deisseroth, Karl; Moore, Scott D; Dzirasa, Kafui

2016-07-20

Circuits distributed across cortico-limbic brain regions compose the networks that mediate emotional behavior. The prefrontal cortex (PFC) regulates ultraslow (<1 Hz) dynamics across these networks, and PFC dysfunction is implicated in stress-related illnesses including major depressive disorder (MDD). To uncover the mechanism whereby stress-induced changes in PFC circuitry alter emotional networks to yield pathology, we used a multi-disciplinary approach including in vivo recordings in mice and chronic social defeat stress. Our network model, inferred using machine learning, linked stress-induced behavioral pathology to the capacity of PFC to synchronize amygdala and VTA activity. Direct stimulation of PFC-amygdala circuitry with DREADDs normalized PFC-dependent limbic synchrony in stress-susceptible animals and restored normal behavior. In addition to providing insights into MDD mechanisms, our findings demonstrate an interdisciplinary approach that can be used to identify the large-scale network changes that underlie complex emotional pathologies and the specific network nodes that can be used to develop targeted interventions. Copyright © 2016 Elsevier Inc. All rights reserved.

Estimating User Influence in Online Social Networks Subject to Information Overload

NASA Astrophysics Data System (ADS)

Li, Pei; Sun, Yunchuan; Chen, Yingwen; Tian, Zhi

2014-11-01

Online social networks have attracted remarkable attention since they provide various approaches for hundreds of millions of people to stay connected with their friends. Due to the existence of information overload, the research on diffusion dynamics in epidemiology cannot be adopted directly to that in online social networks. In this paper, we consider diffusion dynamics in online social networks subject to information overload, and model the information-processing process of a user by a queue with a batch arrival and a finite buffer. We use the average number of times a message is processed after it is generated by a given user to characterize the user influence, which is then estimated through theoretical analysis for a given network. We validate the accuracy of our estimation by simulations, and apply the results to study the impacts of different factors on the user influence. Among the observations, we find that the impact of network size on the user influence is marginal while the user influence decreases with assortativity due to information overload, which is particularly interesting.

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

PubMed

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

2017-05-15

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

An artificial network model for estimating the network structure underlying partially observed neuronal signals.

PubMed

Komatsu, Misako; Namikawa, Jun; Chao, Zenas C; Nagasaka, Yasuo; Fujii, Naotaka; Nakamura, Kiyohiko; Tani, Jun

2014-01-01

Many previous studies have proposed methods for quantifying neuronal interactions. However, these methods evaluated the interactions between recorded signals in an isolated network. In this study, we present a novel approach for estimating interactions between observed neuronal signals by theorizing that those signals are observed from only a part of the network that also includes unobserved structures. We propose a variant of the recurrent network model that consists of both observable and unobservable units. The observable units represent recorded neuronal activity, and the unobservable units are introduced to represent activity from unobserved structures in the network. The network structures are characterized by connective weights, i.e., the interaction intensities between individual units, which are estimated from recorded signals. We applied this model to multi-channel brain signals recorded from monkeys, and obtained robust network structures with physiological relevance. Furthermore, the network exhibited common features that portrayed cortical dynamics as inversely correlated interactions between excitatory and inhibitory populations of neurons, which are consistent with the previous view of cortical local circuits. Our results suggest that the novel concept of incorporating an unobserved structure into network estimations has theoretical advantages and could provide insights into brain dynamics beyond what can be directly observed. Copyright © 2014 Elsevier Ireland Ltd and the Japan Neuroscience Society. All rights reserved.

The Strategic Direction for Army Science and Technology

DTIC Science & Technology

2013-02-01

methods to characterize the nature of trust (e.g., trust in information, trust in a network node or link), and to take measures to manage the trust...Science and Technology Executive, Dr. Thomas Killion, requested a study of peer review methods in use at Army laboratories. The paper discusses... sensors  Characterization of network dynamics and quality of information important to tactical decision-making Work that should be supported

Animal transportation networks

PubMed Central

Perna, Andrea; Latty, Tanya

2014-01-01

Many group-living animals construct transportation networks of trails, galleries and burrows by modifying the environment to facilitate faster, safer or more efficient movement. Animal transportation networks can have direct influences on the fitness of individuals, whereas the shape and structure of transportation networks can influence community dynamics by facilitating contacts between different individuals and species. In this review, we discuss three key areas in the study of animal transportation networks: the topological properties of networks, network morphogenesis and growth, and the behaviour of network users. We present a brief primer on elements of network theory, and then discuss the different ways in which animal groups deal with the fundamental trade-off between the competing network properties of travel efficiency, robustness and infrastructure cost. We consider how the behaviour of network users can impact network efficiency, and call for studies that integrate both network topology and user behaviour. We finish with a prospectus for future research. PMID:25165598

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.

A Hybrid Lifetime Extended Directional Approach for WBANs

PubMed Central

Li, Changle; Yuan, Xiaoming; Yang, Li; Song, Yueyang

2015-01-01

Wireless Body Area Networks (WBANs) can provide real-time and reliable health monitoring, attributing to the human-centered and sensor interoperability properties. WBANs have become a key component of the ubiquitous eHealth (electronic health) revolution that prospers on the basis of information and communication technologies. The prime consideration in WBAN is how to maximize the network lifetime with battery-powered sensor nodes in energy constraint. Novel solutions in Medium Access Control (MAC) protocols are imperative to satisfy the particular BAN scenario and the need of excellent energy efficiency in healthcare applications. In this paper, we propose a hybrid Lifetime Extended Directional Approach (LEDA) MAC protocol based on IEEE 802.15.6 to reduce energy consumption and prolong network lifetime. The LEDA MAC protocol takes full advantages of directional superiority in energy saving that employs multi-beam directional mode in Carrier Sense Multiple Access/Collision Avoidance (CSMA/CA) and single-beam directional mode in Time Division Multiple Access (TDMA) for alternative in data reservation and transmission according to the traffic varieties. Moreover, the impacts of some inherent problems of directional antennas such as deafness and hidden terminal problem can be decreased owing to that all nodes generate individual beam according to user priorities designated. Furthermore, LEDA MAC employs a Dynamic Polled Allocation Period (DPAP) for burst data transmissions to increase the network reliability and adaptability. Extensive analysis and simulation results show that the proposed LEDA MAC protocol achieves extended network lifetime with improved performance compared with IEEE 802.15.6. PMID:26556357

Early alterations of social brain networks in young children with autism

PubMed Central

Kojovic, Nada; Rihs, Tonia Anahi; Jan, Reem Kais; Franchini, Martina; Plomp, Gijs; Vulliemoz, Serge; Eliez, Stephan; Michel, Christoph Martin; Schaer, Marie

2018-01-01

Social impairments are a hallmark of Autism Spectrum Disorders (ASD), but empirical evidence for early brain network alterations in response to social stimuli is scant in ASD. We recorded the gaze patterns and brain activity of toddlers with ASD and their typically developing peers while they explored dynamic social scenes. Directed functional connectivity analyses based on electrical source imaging revealed frequency specific network atypicalities in the theta and alpha frequency bands, manifesting as alterations in both the driving and the connections from key nodes of the social brain associated with autism. Analyses of brain-behavioural relationships within the ASD group suggested that compensatory mechanisms from dorsomedial frontal, inferior temporal and insular cortical regions were associated with less atypical gaze patterns and lower clinical impairment. Our results provide strong evidence that directed functional connectivity alterations of social brain networks is a core component of atypical brain development at early stages of ASD. PMID:29482718

The Local Structure of Globalization. The Network Dynamics of Foreign Direct Investments in the International Electricity Industry

NASA Astrophysics Data System (ADS)

Koskinen, Johan; Lomi, Alessandro

2013-05-01

We study the evolution of the network of foreign direct investment (FDI) in the international electricity industry during the period 1994-2003. We assume that the ties in the network of investment relations between countries are created and deleted in continuous time, according to a conditional Gibbs distribution. This assumption allows us to take simultaneously into account the aggregate predictions of the well-established gravity model of international trade as well as local dependencies between network ties connecting the countries in our sample. According to the modified version of the gravity model that we specify, the probability of observing an investment tie between two countries depends on the mass of the economies involved, their physical distance, and the tendency of the network to self-organize into local configurations of network ties. While the limiting distribution of the data generating process is an exponential random graph model, we do not assume the system to be in equilibrium. We find evidence of the effects of the standard gravity model of international trade on evolution of the global FDI network. However, we also provide evidence of significant dyadic and extra-dyadic dependencies between investment ties that are typically ignored in available research. We show that local dependencies between national electricity industries are sufficient for explaining global properties of the network of foreign direct investments. We also show, however, that network dependencies vary significantly over time giving rise to a time-heterogeneous localized process of network evolution.

APINetworks: A general API for the treatment of complex networks in arbitrary computational environments

NASA Astrophysics Data System (ADS)

Niño, Alfonso; Muñoz-Caro, Camelia; Reyes, Sebastián

2015-11-01

The last decade witnessed a great development of the structural and dynamic study of complex systems described as a network of elements. Therefore, systems can be described as a set of, possibly, heterogeneous entities or agents (the network nodes) interacting in, possibly, different ways (defining the network edges). In this context, it is of practical interest to model and handle not only static and homogeneous networks but also dynamic, heterogeneous ones. Depending on the size and type of the problem, these networks may require different computational approaches involving sequential, parallel or distributed systems with or without the use of disk-based data structures. In this work, we develop an Application Programming Interface (APINetworks) for the modeling and treatment of general networks in arbitrary computational environments. To minimize dependency between components, we decouple the network structure from its function using different packages for grouping sets of related tasks. The structural package, the one in charge of building and handling the network structure, is the core element of the system. In this work, we focus in this API structural component. We apply an object-oriented approach that makes use of inheritance and polymorphism. In this way, we can model static and dynamic networks with heterogeneous elements in the nodes and heterogeneous interactions in the edges. In addition, this approach permits a unified treatment of different computational environments. Tests performed on a C++11 version of the structural package show that, on current standard computers, the system can handle, in main memory, directed and undirected linear networks formed by tens of millions of nodes and edges. Our results compare favorably to those of existing tools.

An Application Development Platform for Neuromorphic Computing

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

Dean, Mark; Chan, Jason; Daffron, Christopher

2016-01-01

Dynamic Adaptive Neural Network Arrays (DANNAs) are neuromorphic computing systems developed as a hardware based approach to the implementation of neural networks. They feature highly adaptive and programmable structural elements, which model arti cial neural networks with spiking behavior. We design them to solve problems using evolutionary optimization. In this paper, we highlight the current hardware and software implementations of DANNA, including their features, functionalities and performance. We then describe the development of an Application Development Platform (ADP) to support efficient application implementation and testing of DANNA based solutions. We conclude with future directions.

Exploring the Epileptic Brain Network Using Time-Variant Effective Connectivity and Graph Theory.

PubMed

Storti, Silvia Francesca; Galazzo, Ilaria Boscolo; Khan, Sehresh; Manganotti, Paolo; Menegaz, Gloria

2017-09-01

The application of time-varying measures of causality between source time series can be very informative to elucidate the direction of communication among the regions of an epileptic brain. The aim of the study was to identify the dynamic patterns of epileptic networks in focal epilepsy by applying multivariate adaptive directed transfer function (ADTF) analysis and graph theory to high-density electroencephalographic recordings. The cortical network was modeled after source reconstruction and topology modulations were detected during interictal spikes. First a distributed linear inverse solution, constrained to the individual grey matter, was applied to the averaged spikes and the mean source activity over 112 regions, as identified by the Harvard-Oxford Atlas, was calculated. Then, the ADTF, a dynamic measure of causality, was used to quantify the connectivity strength between pairs of regions acting as nodes in the graph, and the measure of node centrality was derived. The proposed analysis was effective in detecting the focal regions as well as in characterizing the dynamics of the spike propagation, providing evidence of the fact that the node centrality is a reliable feature for the identification of the epileptogenic zones. Validation was performed by multimodal analysis as well as from surgical outcomes. In conclusion, the time-variant connectivity analysis applied to the epileptic patients can distinguish the generator of the abnormal activity from the propagation spread and identify the connectivity pattern over time.

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.

Optical control demonstrates switch-like PIP3 dynamics underlying the initiation of immune cell migration

PubMed Central

Karunarathne, W. K. Ajith; Giri, Lopamudra; Patel, Anilkumar K.; Venkatesh, Kareenhalli V.; Gautam, N.

2013-01-01

There is a dearth of approaches to experimentally direct cell migration by continuously varying signal input to a single cell, evoking all possible migratory responses and quantitatively monitoring the cellular and molecular response dynamics. Here we used a visual blue opsin to recruit the endogenous G-protein network that mediates immune cell migration. Specific optical inputs to this optical trigger of signaling helped steer migration in all possible directions with precision. Spectrally selective imaging was used to monitor cell-wide phosphatidylinositol (3,4,5)-triphosphate (PIP3), cytoskeletal, and cellular dynamics. A switch-like PIP3 increase at the cell front and a decrease at the back were identified, underlying the decisive migratory response. Migration was initiated at the rapidly increasing switch stage of PIP3 dynamics. This result explains how a migratory cell filters background fluctuations in the intensity of an extracellular signal but responds by initiating directionally sensitive migration to a persistent signal gradient across the cell. A two-compartment computational model incorporating a localized activator that is antagonistic to a diffusible inhibitor was able to simulate the switch-like PIP3 response. It was also able simulate the slow dissipation of PIP3 on signal termination. The ability to independently apply similar signaling inputs to single cells detected two cell populations with distinct thresholds for migration initiation. Overall the optical approach here can be applied to understand G-protein–coupled receptor network control of other cell behaviors. PMID:23569254

Optical control demonstrates switch-like PIP3 dynamics underlying the initiation of immune cell migration.

PubMed

Karunarathne, W K Ajith; Giri, Lopamudra; Patel, Anilkumar K; Venkatesh, Kareenhalli V; Gautam, N

2013-04-23

There is a dearth of approaches to experimentally direct cell migration by continuously varying signal input to a single cell, evoking all possible migratory responses and quantitatively monitoring the cellular and molecular response dynamics. Here we used a visual blue opsin to recruit the endogenous G-protein network that mediates immune cell migration. Specific optical inputs to this optical trigger of signaling helped steer migration in all possible directions with precision. Spectrally selective imaging was used to monitor cell-wide phosphatidylinositol (3,4,5)-triphosphate (PIP3), cytoskeletal, and cellular dynamics. A switch-like PIP3 increase at the cell front and a decrease at the back were identified, underlying the decisive migratory response. Migration was initiated at the rapidly increasing switch stage of PIP3 dynamics. This result explains how a migratory cell filters background fluctuations in the intensity of an extracellular signal but responds by initiating directionally sensitive migration to a persistent signal gradient across the cell. A two-compartment computational model incorporating a localized activator that is antagonistic to a diffusible inhibitor was able to simulate the switch-like PIP3 response. It was also able simulate the slow dissipation of PIP3 on signal termination. The ability to independently apply similar signaling inputs to single cells detected two cell populations with distinct thresholds for migration initiation. Overall the optical approach here can be applied to understand G-protein-coupled receptor network control of other cell behaviors.

Synaptic plasticity and neuronal refractory time cause scaling behaviour of neuronal avalanches

NASA Astrophysics Data System (ADS)

Michiels van Kessenich, L.; de Arcangelis, L.; Herrmann, H. J.

2016-08-01

Neuronal avalanches measured in vitro and in vivo in different cortical networks consistently exhibit power law behaviour for the size and duration distributions with exponents typical for a mean field self-organized branching process. These exponents are also recovered in neuronal network simulations implementing various neuronal dynamics on different network topologies. They can therefore be considered a very robust feature of spontaneous neuronal activity. Interestingly, this scaling behaviour is also observed on regular lattices in finite dimensions, which raises the question about the origin of the mean field behavior observed experimentally. In this study we provide an answer to this open question by investigating the effect of activity dependent plasticity in combination with the neuronal refractory time in a neuronal network. Results show that the refractory time hinders backward avalanches forcing a directed propagation. Hebbian plastic adaptation plays the role of sculpting these directed avalanche patterns into the topology of the network slowly changing it into a branched structure where loops are marginal.

Synaptic plasticity and neuronal refractory time cause scaling behaviour of neuronal avalanches.

PubMed

Michiels van Kessenich, L; de Arcangelis, L; Herrmann, H J

2016-08-18

Neuronal avalanches measured in vitro and in vivo in different cortical networks consistently exhibit power law behaviour for the size and duration distributions with exponents typical for a mean field self-organized branching process. These exponents are also recovered in neuronal network simulations implementing various neuronal dynamics on different network topologies. They can therefore be considered a very robust feature of spontaneous neuronal activity. Interestingly, this scaling behaviour is also observed on regular lattices in finite dimensions, which raises the question about the origin of the mean field behavior observed experimentally. In this study we provide an answer to this open question by investigating the effect of activity dependent plasticity in combination with the neuronal refractory time in a neuronal network. Results show that the refractory time hinders backward avalanches forcing a directed propagation. Hebbian plastic adaptation plays the role of sculpting these directed avalanche patterns into the topology of the network slowly changing it into a branched structure where loops are marginal.

In vitro large-scale experimental and theoretical studies for the realization of bi-directional brain-prostheses.

PubMed

Bonifazi, Paolo; Difato, Francesco; Massobrio, Paolo; Breschi, Gian L; Pasquale, Valentina; Levi, Timothée; Goldin, Miri; Bornat, Yannick; Tedesco, Mariateresa; Bisio, Marta; Kanner, Sivan; Galron, Ronit; Tessadori, Jacopo; Taverna, Stefano; Chiappalone, Michela

2013-01-01

Brain-machine interfaces (BMI) were born to control "actions from thoughts" in order to recover motor capability of patients with impaired functional connectivity between the central and peripheral nervous system. The final goal of our studies is the development of a new proof-of-concept BMI-a neuromorphic chip for brain repair-to reproduce the functional organization of a damaged part of the central nervous system. To reach this ambitious goal, we implemented a multidisciplinary "bottom-up" approach in which in vitro networks are the paradigm for the development of an in silico model to be incorporated into a neuromorphic device. In this paper we present the overall strategy and focus on the different building blocks of our studies: (i) the experimental characterization and modeling of "finite size networks" which represent the smallest and most general self-organized circuits capable of generating spontaneous collective dynamics; (ii) the induction of lesions in neuronal networks and the whole brain preparation with special attention on the impact on the functional organization of the circuits; (iii) the first production of a neuromorphic chip able to implement a real-time model of neuronal networks. A dynamical characterization of the finite size circuits with single cell resolution is provided. A neural network model based on Izhikevich neurons was able to replicate the experimental observations. Changes in the dynamics of the neuronal circuits induced by optical and ischemic lesions are presented respectively for in vitro neuronal networks and for a whole brain preparation. Finally the implementation of a neuromorphic chip reproducing the network dynamics in quasi-real time (10 ns precision) is presented.

Successful Reconstruction of a Physiological Circuit with Known Connectivity from Spiking Activity Alone

PubMed Central

Gerhard, Felipe; Kispersky, Tilman; Gutierrez, Gabrielle J.; Marder, Eve; Kramer, Mark; Eden, Uri

2013-01-01

Identifying the structure and dynamics of synaptic interactions between neurons is the first step to understanding neural network dynamics. The presence of synaptic connections is traditionally inferred through the use of targeted stimulation and paired recordings or by post-hoc histology. More recently, causal network inference algorithms have been proposed to deduce connectivity directly from electrophysiological signals, such as extracellularly recorded spiking activity. Usually, these algorithms have not been validated on a neurophysiological data set for which the actual circuitry is known. Recent work has shown that traditional network inference algorithms based on linear models typically fail to identify the correct coupling of a small central pattern generating circuit in the stomatogastric ganglion of the crab Cancer borealis. In this work, we show that point process models of observed spike trains can guide inference of relative connectivity estimates that match the known physiological connectivity of the central pattern generator up to a choice of threshold. We elucidate the necessary steps to derive faithful connectivity estimates from a model that incorporates the spike train nature of the data. We then apply the model to measure changes in the effective connectivity pattern in response to two pharmacological interventions, which affect both intrinsic neural dynamics and synaptic transmission. Our results provide the first successful application of a network inference algorithm to a circuit for which the actual physiological synapses between neurons are known. The point process methodology presented here generalizes well to larger networks and can describe the statistics of neural populations. In general we show that advanced statistical models allow for the characterization of effective network structure, deciphering underlying network dynamics and estimating information-processing capabilities. PMID:23874181

Environmentally induced amplitude death and firing provocation in large-scale networks of neuronal systems

NASA Astrophysics Data System (ADS)

Pankratova, Evgeniya V.; Kalyakulina, Alena I.

2016-12-01

We study the dynamics of multielement neuronal systems taking into account both the direct interaction between the cells via linear coupling and nondiffusive cell-to-cell communication via common environment. For the cells exhibiting individual bursting behavior, we have revealed the dependence of the network activity on its scale. Particularly, we show that small-scale networks demonstrate the inability to maintain complicated oscillations: for a small number of elements in an ensemble, the phenomenon of amplitude death is observed. The existence of threshold network scales and mechanisms causing firing in artificial and real multielement neural networks, as well as their significance for biological applications, are discussed.

Inferring phenomenological models of Markov processes from data

NASA Astrophysics Data System (ADS)

Rivera, Catalina; Nemenman, Ilya

Microscopically accurate modeling of stochastic dynamics of biochemical networks is hard due to the extremely high dimensionality of the state space of such networks. Here we propose an algorithm for inference of phenomenological, coarse-grained models of Markov processes describing the network dynamics directly from data, without the intermediate step of microscopically accurate modeling. The approach relies on the linear nature of the Chemical Master Equation and uses Bayesian Model Selection for identification of parsimonious models that fit the data. When applied to synthetic data from the Kinetic Proofreading process (KPR), a common mechanism used by cells for increasing specificity of molecular assembly, the algorithm successfully uncovers the known coarse-grained description of the process. This phenomenological description has been notice previously, but this time it is derived in an automated manner by the algorithm. James S. McDonnell Foundation Grant No. 220020321.

Direct adaptive control of wind energy conversion systems using Gaussian networks.

PubMed

Mayosky, M A; Cancelo, I E

1999-01-01

Grid connected wind energy conversion systems (WECS) present interesting control demands, due to the intrinsic nonlinear characteristics of windmills and electric generators. In this paper a direct adaptive control strategy for WECS control is proposed. It is based on the combination of two control actions: a radial basis zfunction network-based adaptive controller, which drives the tracking error to zero with user specified dynamics, and a supervisory controller, based on crude bounds of the system's nonlinearities. The supervisory controller fires when the finite neural-network approximation properties cannot be guaranteed. The form of the supervisor control and the adaptation law for the neural controller are derived from a Lyapunov analysis of stability. The results are applied to a typical turbine/generator pair, showing the feasibility of the proposed solution.

The NASA F-15 Intelligent Flight Control Systems: Generation II

NASA Technical Reports Server (NTRS)

Buschbacher, Mark; Bosworth, John

2006-01-01

The Second Generation (Gen II) control system for the F-15 Intelligent Flight Control System (IFCS) program implements direct adaptive neural networks to demonstrate robust tolerance to faults and failures. The direct adaptive tracking controller integrates learning neural networks (NNs) with a dynamic inversion control law. The term direct adaptive is used because the error between the reference model and the aircraft response is being compensated or directly adapted to minimize error without regard to knowing the cause of the error. No parameter estimation is needed for this direct adaptive control system. In the Gen II design, the feedback errors are regulated with a proportional-plus-integral (PI) compensator. This basic compensator is augmented with an online NN that changes the system gains via an error-based adaptation law to improve aircraft performance at all times, including normal flight, system failures, mispredicted behavior, or changes in behavior resulting from damage.

Small-world networks exhibit pronounced intermittent synchronization

NASA Astrophysics Data System (ADS)

Choudhary, Anshul; Mitra, Chiranjit; Kohar, Vivek; Sinha, Sudeshna; Kurths, Jürgen

2017-11-01

We report the phenomenon of temporally intermittently synchronized and desynchronized dynamics in Watts-Strogatz networks of chaotic Rössler oscillators. We consider topologies for which the master stability function (MSF) predicts stable synchronized behaviour, as the rewiring probability (p) is tuned from 0 to 1. MSF essentially utilizes the largest non-zero Lyapunov exponent transversal to the synchronization manifold in making stability considerations, thereby ignoring the other Lyapunov exponents. However, for an N-node networked dynamical system, we observe that the difference in its Lyapunov spectra (corresponding to the N - 1 directions transversal to the synchronization manifold) is crucial and serves as an indicator of the presence of intermittently synchronized behaviour. In addition to the linear stability-based (MSF) analysis, we further provide global stability estimate in terms of the fraction of state-space volume shared by the intermittently synchronized state, as p is varied from 0 to 1. This fraction becomes appreciably large in the small-world regime, which is surprising, since this limit has been otherwise considered optimal for synchronized dynamics. Finally, we characterize the nature of the observed intermittency and its dominance in state-space as network rewiring probability (p) is varied.

Threshold behaviors of social dynamics and financial outcomes of Ponzi scheme diffusion in complex networks

NASA Astrophysics Data System (ADS)

Fu, Peihua; Zhu, Anding; Ni, He; Zhao, Xin; Li, Xiulin

2018-01-01

Ponzi schemes always lead to mass disasters after collapse. It is important to study the critical behaviors of both social dynamics and financial outcomes for Ponzi scheme diffusion in complex networks. We develop the potential-investor-divestor-investor (PIDI) model by considering the individual behavior of direct reinvestment. We find that only the spreading rate relates to the epidemic outbreak while the reinvestment rate relates to the zero and non-zero final states for social dynamics of both homo- and inhomogeneous networks. Financially, we find that there is a critical spreading threshold, above which the scheme needs not to use its own initial capital for taking off, i.e. the starting cost is covered by the rapidly inflowing funds. However, the higher the cost per recruit, the larger the critical spreading threshold and the worse the financial outcomes. Theoretical and simulation results also reveal that schemes are easier to take off in inhomogeneous networks. The reinvestment rate does not affect the starting. However, it improves the financial outcome in the early stages and postpones the outbreak of financial collapse. Some policy suggestions for the regulator from the perspective of social physics are proposed in the end of the paper.

Intelligent Sensing and Classification in DSR-Based Ad Hoc Networks

NASA Astrophysics Data System (ADS)

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

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

Parameter space exploration within dynamic simulations of signaling networks.

PubMed

De Ambrosi, Cristina; Barla, Annalisa; Tortolina, Lorenzo; Castagnino, Nicoletta; Pesenti, Raffaele; Verri, Alessandro; Ballestrero, Alberto; Patrone, Franco; Parodi, Silvio

2013-02-01

We started offering an introduction to very basic aspects of molecular biology, for the reader coming from computer sciences, information technology, mathematics. Similarly we offered a minimum of information about pathways and networks in graph theory, for a reader coming from the bio-medical sector. At the crossover about the two different types of expertise, we offered some definition about Systems Biology. The core of the article deals with a Molecular Interaction Map (MIM), a network of biochemical interactions involved in a small signaling-network sub-region relevant in breast cancer. We explored robustness/sensitivity to random perturbations. It turns out that our MIM is a non-isomorphic directed graph. For non physiological directions of propagation of the signal the network is quite resistant to perturbations. The opposite happens for biologically significant directions of signal propagation. In these cases we can have no signal attenuation, and even signal amplification. Signal propagation along a given pathway is highly unidirectional, with the exception of signal-feedbacks, that again have a specific biological role and significance. In conclusion, even a relatively small network like our present MIM reveals the preponderance of specific biological functions over unspecific isomorphic behaviors. This is perhaps the consequence of hundreds of millions of years of biological evolution.

Opinion formation of free speech on the directed social network

NASA Astrophysics Data System (ADS)

Su, Jiongming; Ma, Hongxu; Liu, Baohong; Li, Qi

2014-12-01

A dynamical model with continuous opinion is proposed to study how the speech order and the topology of directed social network affect the opinion formation of free speech. In the model, agents express their opinions one by one with random order (RO) or probability order (PO), other agents paying attentions to the speaking agent, receive provider's opinion, update their opinions and then express their new opinions in their turns. It is proved that with the same agent j repeats its opinion more, other agents who pay their attentions to j and include j's opinion in their confidence level at initial time, will continue approaching j's opinion. Simulation results reveal that on directed scale-free network: (1) the model for PO forms fewer opinion clusters, larger maximum cluster (MC), smaller standard deviation (SD), and needs less waiting time to reach a middle level of consensus than RO; (2) as the parameter of scale-free degree distribution decreases or the confidence level increases, the results often get better for both speech orders; (3) the differences between PO and RO get smaller as the size of network decreases.

Dynamic defense workshop :

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

Crosby, Sean Michael; Doak, Justin E.; Haas, Jason Juedes.

2013-02-01

On September 5th and 6th, 2012, the Dynamic Defense Workshop: From Research to Practice brought together researchers from academia, industry, and Sandia with the goals of increasing collaboration between Sandia National Laboratories and external organizations, de ning and un- derstanding dynamic, or moving target, defense concepts and directions, and gaining a greater understanding of the state of the art for dynamic defense. Through the workshop, we broadened and re ned our de nition and understanding, identi ed new approaches to inherent challenges, and de ned principles of dynamic defense. Half of the workshop was devoted to presentations of current state-of-the-artmore » work. Presentation topics included areas such as the failure of current defenses, threats, techniques, goals of dynamic defense, theory, foundations of dynamic defense, future directions and open research questions related to dynamic defense. The remainder of the workshop was discussion, which was broken down into sessions on de ning challenges, applications to host or mobile environments, applications to enterprise network environments, exploring research and operational taxonomies, and determining how to apply scienti c rigor to and investigating the eld of dynamic defense.« less

CellNetVis: a web tool for visualization of biological networks using force-directed layout constrained by cellular components.

PubMed

Heberle, Henry; Carazzolle, Marcelo Falsarella; Telles, Guilherme P; Meirelles, Gabriela Vaz; Minghim, Rosane

2017-09-13

The advent of "omics" science has brought new perspectives in contemporary biology through the high-throughput analyses of molecular interactions, providing new clues in protein/gene function and in the organization of biological pathways. Biomolecular interaction networks, or graphs, are simple abstract representations where the components of a cell (e.g. proteins, metabolites etc.) are represented by nodes and their interactions are represented by edges. An appropriate visualization of data is crucial for understanding such networks, since pathways are related to functions that occur in specific regions of the cell. The force-directed layout is an important and widely used technique to draw networks according to their topologies. Placing the networks into cellular compartments helps to quickly identify where network elements are located and, more specifically, concentrated. Currently, only a few tools provide the capability of visually organizing networks by cellular compartments. Most of them cannot handle large and dense networks. Even for small networks with hundreds of nodes the available tools are not able to reposition the network while the user is interacting, limiting the visual exploration capability. Here we propose CellNetVis, a web tool to easily display biological networks in a cell diagram employing a constrained force-directed layout algorithm. The tool is freely available and open-source. It was originally designed for networks generated by the Integrated Interactome System and can be used with networks from others databases, like InnateDB. CellNetVis has demonstrated to be applicable for dynamic investigation of complex networks over a consistent representation of a cell on the Web, with capabilities not matched elsewhere.

An Improved Co-evolutionary Particle Swarm Optimization for Wireless Sensor Networks with Dynamic Deployment

PubMed Central

Wang, Xue; Wang, Sheng; Ma, Jun-Jie

2007-01-01

The effectiveness of wireless sensor networks (WSNs) depends on the coverage and target detection probability provided by dynamic deployment, which is usually supported by the virtual force (VF) algorithm. However, in the VF algorithm, the virtual force exerted by stationary sensor nodes will hinder the movement of mobile sensor nodes. Particle swarm optimization (PSO) is introduced as another dynamic deployment algorithm, but in this case the computation time required is the big bottleneck. This paper proposes a dynamic deployment algorithm which is named “virtual force directed co-evolutionary particle swarm optimization” (VFCPSO), since this algorithm combines the co-evolutionary particle swarm optimization (CPSO) with the VF algorithm, whereby the CPSO uses multiple swarms to optimize different components of the solution vectors for dynamic deployment cooperatively and the velocity of each particle is updated according to not only the historical local and global optimal solutions, but also the virtual forces of sensor nodes. Simulation results demonstrate that the proposed VFCPSO is competent for dynamic deployment in WSNs and has better performance with respect to computation time and effectiveness than the VF, PSO and VFPSO algorithms.

Network structure shapes spontaneous functional connectivity dynamics.

PubMed

Shen, Kelly; Hutchison, R Matthew; Bezgin, Gleb; Everling, Stefan; McIntosh, Anthony R

2015-04-08

The structural organization of the brain constrains the range of interactions between different regions and shapes ongoing information processing. Therefore, it is expected that large-scale dynamic functional connectivity (FC) patterns, a surrogate measure of coordination between brain regions, will be closely tied to the fiber pathways that form the underlying structural network. Here, we empirically examined the influence of network structure on FC dynamics by comparing resting-state FC (rsFC) obtained using BOLD-fMRI in macaques (Macaca fascicularis) to structural connectivity derived from macaque axonal tract tracing studies. Consistent with predictions from simulation studies, the correspondence between rsFC and structural connectivity increased as the sample duration increased. Regions with reciprocal structural connections showed the most stable rsFC across time. The data suggest that the transient nature of FC is in part dependent on direct underlying structural connections, but also that dynamic coordination can occur via polysynaptic pathways. Temporal stability was found to be dependent on structural topology, with functional connections within the rich-club core exhibiting the greatest stability over time. We discuss these findings in light of highly variable functional hubs. The results further elucidate how large-scale dynamic functional coordination exists within a fixed structural architecture. Copyright © 2015 the authors 0270-6474/15/355579-10$15.00/0.

Using directed information for influence discovery in interconnected dynamical systems

NASA Astrophysics Data System (ADS)

Rao, Arvind; Hero, Alfred O.; States, David J.; Engel, James Douglas

2008-08-01

Structure discovery in non-linear dynamical systems is an important and challenging problem that arises in various applications such as computational neuroscience, econometrics, and biological network discovery. Each of these systems have multiple interacting variables and the key problem is the inference of the underlying structure of the systems (which variables are connected to which others) based on the output observations (such as multiple time trajectories of the variables). Since such applications demand the inference of directed relationships among variables in these non-linear systems, current methods that have a linear assumption on structure or yield undirected variable dependencies are insufficient. Hence, in this work, we present a methodology for structure discovery using an information-theoretic metric called directed time information (DTI). Using both synthetic dynamical systems as well as true biological datasets (kidney development and T-cell data), we demonstrate the utility of DTI in such problems.

On mobile wireless ad hoc IP video transports

NASA Astrophysics Data System (ADS)

Kazantzidis, Matheos

2006-05-01

Multimedia transports in wireless, ad-hoc, multi-hop or mobile networks must be capable of obtaining information about the network and adaptively tune sending and encoding parameters to the network response. Obtaining meaningful metrics to guide a stable congestion control mechanism in the transport (i.e. passive, simple, end-to-end and network technology independent) is a complex problem. Equally difficult is obtaining a reliable QoS metrics that agrees with user perception in a client/server or distributed environment. Existing metrics, objective or subjective, are commonly used after or before to test or report on a transmission and require access to both original and transmitted frames. In this paper, we propose that an efficient and successful video delivery and the optimization of overall network QoS requires innovation in a) a direct measurement of available and bottleneck capacity for its congestion control and b) a meaningful subjective QoS metric that is dynamically reported to video sender. Once these are in place, a binomial -stable, fair and TCP friendly- algorithm can be used to determine the sending rate and other packet video parameters. An adaptive mpeg codec can then continually test and fit its parameters and temporal-spatial data-error control balance using the perceived QoS dynamic feedback. We suggest a new measurement based on a packet dispersion technique that is independent of underlying network mechanisms. We then present a binomial control based on direct measurements. We implement a QoS metric that is known to agree with user perception (MPQM) in a client/server, distributed environment by using predetermined table lookups and characterization of video content.

Laser dynamics: The system dynamics and network theory of optoelectronic integrated circuit design

NASA Astrophysics Data System (ADS)

Tarng, Tom Shinming-T. K.

Laser dynamics is the system dynamics, communication and network theory for the design of opto-electronic integrated circuit (OEIC). Combining the optical network theory and optical communication theory, the system analysis and design for the OEIC fundamental building blocks is considered. These building blocks include the direct current modulation, inject light modulation, wideband filter, super-gain optical amplifier, E/O and O/O optical bistability and current-controlled optical oscillator. Based on the rate equations, the phase diagram and phase portrait analysis is applied to the theoretical studies and numerical simulation. The OEIC system design methodologies are developed for the OEIC design. Stimulating-field-dependent rate equations are used to model the line-width narrowing/broadening mechanism for the CW mode and frequency chirp of semiconductor lasers. The momentary spectra are carrier-density-dependent. Furthermore, the phase portrait analysis and the nonlinear refractive index is used to simulate the single mode frequency chirp. The average spectra of chaos, period doubling, period pulsing, multi-loops and analog modulation are generated and analyzed. The bifurcation-chirp design chart with modulation depth and modulation frequency as parameters is provided for design purpose.

A Role of Phase-Resetting in Coordinating Large Scale Neural Networks During Attention and Goal-Directed Behavior

PubMed Central

Voloh, Benjamin; Womelsdorf, Thilo

2016-01-01

Short periods of oscillatory activation are ubiquitous signatures of neural circuits. A broad range of studies documents not only their circuit origins, but also a fundamental role for oscillatory activity in coordinating information transfer during goal directed behavior. Recent studies suggest that resetting the phase of ongoing oscillatory activity to endogenous or exogenous cues facilitates coordinated information transfer within circuits and between distributed brain areas. Here, we review evidence that pinpoints phase resetting as a critical marker of dynamic state changes of functional networks. Phase resets: (1) set a “neural context” in terms of narrow band frequencies that uniquely characterizes the activated circuits; (2) impose coherent low frequency phases to which high frequency activations can synchronize, identifiable as cross-frequency correlations across large anatomical distances; (3) are critical for neural coding models that depend on phase, increasing the informational content of neural representations; and (4) likely originate from the dynamics of canonical E-I circuits that are anatomically ubiquitous. These multiple signatures of phase resets are directly linked to enhanced information transfer and behavioral success. We survey how phase resets re-organize oscillations in diverse task contexts, including sensory perception, attentional stimulus selection, cross-modal integration, Pavlovian conditioning, and spatial navigation. The evidence we consider suggests that phase-resets can drive changes in neural excitability, ensemble organization, functional networks, and ultimately, overt behavior. PMID:27013986

Application of stochastic processes in random growth and evolutionary dynamics

NASA Astrophysics Data System (ADS)

Oikonomou, Panagiotis

We study the effect of power-law distributed randomness on the dynamical behavior of processes such as stochastic growth patterns and evolution. First, we examine the geometrical properties of random shapes produced by a generalized stochastic Loewner Evolution driven by a superposition of a Brownian motion and a stable Levy process. The situation is defined by the usual stochastic Loewner Evolution parameter, kappa, as well as alpha which defines the power-law tail of the stable Levy distribution. We show that the properties of these patterns change qualitatively and singularly at critical values of kappa and alpha. It is reasonable to call such changes "phase transitions". These transitions occur as kappa passes through four and as alpha passes through one. Numerical simulations are used to explore the global scaling behavior of these patterns in each "phase". We show both analytically and numerically that the growth continues indefinitely in the vertical direction for alpha greater than 1, goes as logarithmically with time for alpha equals to 1, and saturates for alpha smaller than 1. The probability density has two different scales corresponding to directions along and perpendicular to the boundary. Scaling functions for the probability density are given for various limiting cases. Second, we study the effect of the architecture of biological networks on their evolutionary dynamics. In recent years, studies of the architecture of large networks have unveiled a common topology, called scale-free, in which a majority of the elements are poorly connected except for a small fraction of highly connected components. We ask how networks with distinct topologies can evolve towards a pre-established target phenotype through a process of random mutations and selection. We use networks of Boolean components as a framework to model a large class of phenotypes. Within this approach, we find that homogeneous random networks and scale-free networks exhibit drastically different evolutionary paths. While homogeneous random networks accumulate neutral mutations and evolve by sparse punctuated steps, scale-free networks evolve rapidly and continuously towards the target phenotype. Moreover, we show that scale-free networks always evolve faster than homogeneous random networks; remarkably, this property does not depend on the precise value of the topological parameter. By contrast, homogeneous random networks require a specific tuning of their topological parameter in order to optimize their fitness. This model suggests that the evolutionary paths of biological networks, punctuated or continuous, may solely be determined by the network topology.

Analysis of the dynamic co-expression network of heart regeneration in the zebrafish

PubMed Central

Rodius, Sophie; Androsova, Ganna; Götz, Lou; Liechti, Robin; Crespo, Isaac; Merz, Susanne; Nazarov, Petr V.; de Klein, Niek; Jeanty, Céline; González-Rosa, Juan M.; Muller, Arnaud; Bernardin, Francois; Niclou, Simone P.; Vallar, Laurent; Mercader, Nadia; Ibberson, Mark; Xenarios, Ioannis; Azuaje, Francisco

2016-01-01

The zebrafish has the capacity to regenerate its heart after severe injury. While the function of a few genes during this process has been studied, we are far from fully understanding how genes interact to coordinate heart regeneration. To enable systematic insights into this phenomenon, we generated and integrated a dynamic co-expression network of heart regeneration in the zebrafish and linked systems-level properties to the underlying molecular events. Across multiple post-injury time points, the network displays topological attributes of biological relevance. We show that regeneration steps are mediated by modules of transcriptionally coordinated genes, and by genes acting as network hubs. We also established direct associations between hubs and validated drivers of heart regeneration with murine and human orthologs. The resulting models and interactive analysis tools are available at http://infused.vital-it.ch. Using a worked example, we demonstrate the usefulness of this unique open resource for hypothesis generation and in silico screening for genes involved in heart regeneration. PMID:27241320

Computing by robust transience: How the fronto-parietal network performs sequential category-based decisions

PubMed Central

Chaisangmongkon, Warasinee; Swaminathan, Sruthi K.; Freedman, David J.; Wang, Xiao-Jing

2017-01-01

Summary Decision making involves dynamic interplay between internal judgements and external perception, which has been investigated in delayed match-to-category (DMC) experiments. Our analysis of neural recordings shows that, during DMC tasks, LIP and PFC neurons demonstrate mixed, time-varying, and heterogeneous selectivity, but previous theoretical work has not established the link between these neural characteristics and population-level computations. We trained a recurrent network model to perform DMC tasks and found that the model can remarkably reproduce key features of neuronal selectivity at the single-neuron and population levels. Analysis of the trained networks elucidates that robust transient trajectories of the neural population are the key driver of sequential categorical decisions. The directions of trajectories are governed by network self-organized connectivity, defining a ‘neural landscape’, consisting of a task-tailored arrangement of slow states and dynamical tunnels. With this model, we can identify functionally-relevant circuit motifs and generalize the framework to solve other categorization tasks. PMID:28334612

MEMS-based beam-steerable free-space optical communication link for reconfigurable wireless data center

NASA Astrophysics Data System (ADS)

Deng, Peng; Kavehrad, Mohsen; Lou, Yan

2017-01-01

Flexible wireless datacenter networks based on free space optical communication (FSO) links are being considered as promising solutions to meet the future datacenter demands of high throughput, robustness to dynamic traffic patterns, cabling complexity and energy efficiency. Robust and precise steerable FSO links over dynamic traffic play a key role in the reconfigurable optical wireless datacenter inter-rack network. In this work, we propose and demonstrate a reconfigurable 10Gbps FSO system incorporated with smart beam acquisition and tracking mechanism based on gimballess two-axis MEMS micro-mirror and retro-reflective film marked aperture. The fast MEMS-based beam acquisition switches laser beam of FSO terminal from one rack to the next for reconfigurable networks, and the precise beam tracking makes FSO device auto-correct the misalignment in real-time. We evaluate the optical power loss and bit error rate performance of steerable FSO links at various directions. Experimental results suggest that the MEMS based beam steerable FSO links hold considerable promise for the future reconfigurable wireless datacenter networks.

Analysis of the dynamic co-expression network of heart regeneration in the zebrafish

NASA Astrophysics Data System (ADS)

Rodius, Sophie; Androsova, Ganna; Götz, Lou; Liechti, Robin; Crespo, Isaac; Merz, Susanne; Nazarov, Petr V.; de Klein, Niek; Jeanty, Céline; González-Rosa, Juan M.; Muller, Arnaud; Bernardin, Francois; Niclou, Simone P.; Vallar, Laurent; Mercader, Nadia; Ibberson, Mark; Xenarios, Ioannis; Azuaje, Francisco

2016-05-01

The zebrafish has the capacity to regenerate its heart after severe injury. While the function of a few genes during this process has been studied, we are far from fully understanding how genes interact to coordinate heart regeneration. To enable systematic insights into this phenomenon, we generated and integrated a dynamic co-expression network of heart regeneration in the zebrafish and linked systems-level properties to the underlying molecular events. Across multiple post-injury time points, the network displays topological attributes of biological relevance. We show that regeneration steps are mediated by modules of transcriptionally coordinated genes, and by genes acting as network hubs. We also established direct associations between hubs and validated drivers of heart regeneration with murine and human orthologs. The resulting models and interactive analysis tools are available at http://infused.vital-it.ch. Using a worked example, we demonstrate the usefulness of this unique open resource for hypothesis generation and in silico screening for genes involved in heart regeneration.

On Connection Between Topology and Memory Loss in Sheared Granular Materials

NASA Astrophysics Data System (ADS)

Kovalcinova, Lenka; Kramar, Miro; Mischaikow, Konstantin; Kondic, Lou

We present combined results of discrete element simulations and topological data analysis that allows us to characterize the geometrical properties of force networks. Our numerical setup consists of the system of cylindrical particles placed inside rectangular box with periodic boundary conditions along the horizontal direction. System dynamics is driven by constant shearing speed of the top and bottom walls (in the opposite directions) and pressure applied on the top wall in a dense flow regime. Our study reveals the origin of memory loss in granular systems through local rapid changes in force networks. To understand these rapid events we analyze the evolution of the largest Lyapunov exponent in a simpler case of granular system without inter-particle friction and explore a correlation with topological measures. Surprisingly, our results suggest that the memory loss is driven mainly by pressure even in the case of fixed inertial number. We conclude that the interplay between physical properties of the granular system and force network geometry is a key to understand the dynamics of the sheared systems. This research was supported by NSF Grant No. DMS-1521717 and DARPA No. HR0011-16-2-0033.

Predicting perturbation patterns from the topology of biological networks.

PubMed

Santolini, Marc; Barabási, Albert-László

2018-06-20

High-throughput technologies, offering an unprecedented wealth of quantitative data underlying the makeup of living systems, are changing biology. Notably, the systematic mapping of the relationships between biochemical entities has fueled the rapid development of network biology, offering a suitable framework to describe disease phenotypes and predict potential drug targets. However, our ability to develop accurate dynamical models remains limited, due in part to the limited knowledge of the kinetic parameters underlying these interactions. Here, we explore the degree to which we can make reasonably accurate predictions in the absence of the kinetic parameters. We find that simple dynamically agnostic models are sufficient to recover the strength and sign of the biochemical perturbation patterns observed in 87 biological models for which the underlying kinetics are known. Surprisingly, a simple distance-based model achieves 65% accuracy. We show that this predictive power is robust to topological and kinetic parameter perturbations, and we identify key network properties that can increase up to 80% the recovery rate of the true perturbation patterns. We validate our approach using experimental data on the chemotactic pathway in bacteria, finding that a network model of perturbation spreading predicts with ∼80% accuracy the directionality of gene expression and phenotype changes in knock-out and overproduction experiments. These findings show that the steady advances in mapping out the topology of biochemical interaction networks opens avenues for accurate perturbation spread modeling, with direct implications for medicine and drug development.

Molecular Dynamics Simulations with Quantum Mechanics/Molecular Mechanics and Adaptive Neural Networks.

PubMed

Shen, Lin; Yang, Weitao

2018-03-13

Direct molecular dynamics (MD) simulation with ab initio quantum mechanical and molecular mechanical (QM/MM) methods is very powerful for studying the mechanism of chemical reactions in a complex environment but also very time-consuming. The computational cost of QM/MM calculations during MD simulations can be reduced significantly using semiempirical QM/MM methods with lower accuracy. To achieve higher accuracy at the ab initio QM/MM level, a correction on the existing semiempirical QM/MM model is an attractive idea. Recently, we reported a neural network (NN) method as QM/MM-NN to predict the potential energy difference between semiempirical and ab initio QM/MM approaches. The high-level results can be obtained using neural network based on semiempirical QM/MM MD simulations, but the lack of direct MD samplings at the ab initio QM/MM level is still a deficiency that limits the applications of QM/MM-NN. In the present paper, we developed a dynamic scheme of QM/MM-NN for direct MD simulations on the NN-predicted potential energy surface to approximate ab initio QM/MM MD. Since some configurations excluded from the database for NN training were encountered during simulations, which may cause some difficulties on MD samplings, an adaptive procedure inspired by the selection scheme reported by Behler [ Behler Int. J. Quantum Chem. 2015 , 115 , 1032 ; Behler Angew. Chem., Int. Ed. 2017 , 56 , 12828 ] was employed with some adaptions to update NN and carry out MD iteratively. We further applied the adaptive QM/MM-NN MD method to the free energy calculation and transition path optimization on chemical reactions in water. The results at the ab initio QM/MM level can be well reproduced using this method after 2-4 iteration cycles. The saving in computational cost is about 2 orders of magnitude. It demonstrates that the QM/MM-NN with direct MD simulations has great potentials not only for the calculation of thermodynamic properties but also for the characterization of reaction dynamics, which provides a useful tool to study chemical or biochemical systems in solution or enzymes.

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

NASA Astrophysics Data System (ADS)

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

2016-11-01

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

Network dynamics of 3D engineered neuronal cultures: a new experimental model for in-vitro electrophysiology.

PubMed

Frega, Monica; Tedesco, Mariateresa; Massobrio, Paolo; Pesce, Mattia; Martinoia, Sergio

2014-06-30

Despite the extensive use of in-vitro models for neuroscientific investigations and notwithstanding the growing field of network electrophysiology, all studies on cultured cells devoted to elucidate neurophysiological mechanisms and computational properties, are based on 2D neuronal networks. These networks are usually grown onto specific rigid substrates (also with embedded electrodes) and lack of most of the constituents of the in-vivo like environment: cell morphology, cell-to-cell interaction and neuritic outgrowth in all directions. Cells in a brain region develop in a 3D space and interact with a complex multi-cellular environment and extracellular matrix. Under this perspective, 3D networks coupled to micro-transducer arrays, represent a new and powerful in-vitro model capable of better emulating in-vivo physiology. In this work, we present a new experimental paradigm constituted by 3D hippocampal networks coupled to Micro-Electrode-Arrays (MEAs) and we show how the features of the recorded network dynamics differ from the corresponding 2D network model. Further development of the proposed 3D in-vitro model by adding embedded functionalized scaffolds might open new prospects for manipulating, stimulating and recording the neuronal activity to elucidate neurophysiological mechanisms and to design bio-hybrid microsystems.

Network dynamics of 3D engineered neuronal cultures: a new experimental model for in-vitro electrophysiology

PubMed Central

Frega, Monica; Tedesco, Mariateresa; Massobrio, Paolo; Pesce, Mattia; Martinoia, Sergio

2014-01-01

Despite the extensive use of in-vitro models for neuroscientific investigations and notwithstanding the growing field of network electrophysiology, all studies on cultured cells devoted to elucidate neurophysiological mechanisms and computational properties, are based on 2D neuronal networks. These networks are usually grown onto specific rigid substrates (also with embedded electrodes) and lack of most of the constituents of the in-vivo like environment: cell morphology, cell-to-cell interaction and neuritic outgrowth in all directions. Cells in a brain region develop in a 3D space and interact with a complex multi-cellular environment and extracellular matrix. Under this perspective, 3D networks coupled to micro-transducer arrays, represent a new and powerful in-vitro model capable of better emulating in-vivo physiology. In this work, we present a new experimental paradigm constituted by 3D hippocampal networks coupled to Micro-Electrode-Arrays (MEAs) and we show how the features of the recorded network dynamics differ from the corresponding 2D network model. Further development of the proposed 3D in-vitro model by adding embedded functionalized scaffolds might open new prospects for manipulating, stimulating and recording the neuronal activity to elucidate neurophysiological mechanisms and to design bio-hybrid microsystems. PMID:24976386

Shifts of Gamma Phase across Primary Visual Cortical Sites Reflect Dynamic Stimulus-Modulated Information Transfer.

PubMed

Besserve, Michel; Lowe, Scott C; Logothetis, Nikos K; Schölkopf, Bernhard; Panzeri, Stefano

2015-01-01

Distributed neural processing likely entails the capability of networks to reconfigure dynamically the directionality and strength of their functional connections. Yet, the neural mechanisms that may allow such dynamic routing of the information flow are not yet fully understood. We investigated the role of gamma band (50-80 Hz) oscillations in transient modulations of communication among neural populations by using measures of direction-specific causal information transfer. We found that the local phase of gamma-band rhythmic activity exerted a stimulus-modulated and spatially-asymmetric directed effect on the firing rate of spatially separated populations within the primary visual cortex. The relationships between gamma phases at different sites (phase shifts) could be described as a stimulus-modulated gamma-band wave propagating along the spatial directions with the largest information transfer. We observed transient stimulus-related changes in the spatial configuration of phases (compatible with changes in direction of gamma wave propagation) accompanied by a relative increase of the amount of information flowing along the instantaneous direction of the gamma wave. These effects were specific to the gamma-band and suggest that the time-varying relationships between gamma phases at different locations mark, and possibly causally mediate, the dynamic reconfiguration of functional connections.

Shifts of Gamma Phase across Primary Visual Cortical Sites Reflect Dynamic Stimulus-Modulated Information Transfer

PubMed Central

Besserve, Michel; Lowe, Scott C.; Logothetis, Nikos K.; Schölkopf, Bernhard; Panzeri, Stefano

2015-01-01

Distributed neural processing likely entails the capability of networks to reconfigure dynamically the directionality and strength of their functional connections. Yet, the neural mechanisms that may allow such dynamic routing of the information flow are not yet fully understood. We investigated the role of gamma band (50–80 Hz) oscillations in transient modulations of communication among neural populations by using measures of direction-specific causal information transfer. We found that the local phase of gamma-band rhythmic activity exerted a stimulus-modulated and spatially-asymmetric directed effect on the firing rate of spatially separated populations within the primary visual cortex. The relationships between gamma phases at different sites (phase shifts) could be described as a stimulus-modulated gamma-band wave propagating along the spatial directions with the largest information transfer. We observed transient stimulus-related changes in the spatial configuration of phases (compatible with changes in direction of gamma wave propagation) accompanied by a relative increase of the amount of information flowing along the instantaneous direction of the gamma wave. These effects were specific to the gamma-band and suggest that the time-varying relationships between gamma phases at different locations mark, and possibly causally mediate, the dynamic reconfiguration of functional connections. PMID:26394205

Research on the exponential growth effect on network topology: Theoretical and empirical analysis

NASA Astrophysics Data System (ADS)

Li, Shouwei; You, Zongjun

Integrated circuit (IC) industry network has been built in Yangtze River Delta with the constant expansion of IC industry. The IC industry network grows exponentially with the establishment of new companies and the establishment of contacts with old firms. Based on preferential attachment and exponential growth, the paper presents the analytical results in which the vertices degree of scale-free network follows power-law distribution p(k)˜k‑γ (γ=2β+1) and parameter β satisfies 0.5≤β≤1. At the same time, we find that the preferential attachment takes place in a dynamic local world and the size of the dynamic local world is in direct proportion to the size of whole networks. The paper also gives the analytical results of no-preferential attachment and exponential growth on random networks. The computer simulated results of the model illustrate these analytical results. Through some investigations on the enterprises, this paper at first presents the distribution of IC industry, composition of industrial chain and service chain firstly. Then, the correlative network and its analysis of industrial chain and service chain are presented. The correlative analysis of the whole IC industry is also presented at the same time. Based on the theory of complex network, the analysis and comparison of industrial chain network and service chain network in Yangtze River Delta are provided in the paper.

Single-cell resolution of intracellular T cell Ca2+ dynamics in response to frequency-based H2O2 stimulation.

PubMed

Kniss-James, Ariel S; Rivet, Catherine A; Chingozha, Loice; Lu, Hang; Kemp, Melissa L

2017-03-01

Adaptive immune cells, such as T cells, integrate information from their extracellular environment through complex signaling networks with exquisite sensitivity in order to direct decisions on proliferation, apoptosis, and cytokine production. These signaling networks are reliant on the interplay between finely tuned secondary messengers, such as Ca 2+ and H 2 O 2 . Frequency response analysis, originally developed in control engineering, is a tool used for discerning complex networks. This analytical technique has been shown to be useful for understanding biological systems and facilitates identification of the dominant behaviour of the system. We probed intracellular Ca 2+ dynamics in the frequency domain to investigate the complex relationship between two second messenger signaling molecules, H 2 O 2 and Ca 2+ , during T cell activation with single cell resolution. Single-cell analysis provides a unique platform for interrogating and monitoring cellular processes of interest. We utilized a previously developed microfluidic device to monitor individual T cells through time while applying a dynamic input to reveal a natural frequency of the system at approximately 2.78 mHz stimulation. Although our network was much larger with more unknown connections than previous applications, we are able to derive features from our data, observe forced oscillations associated with specific amplitudes and frequencies of stimuli, and arrive at conclusions about potential transfer function fits as well as the underlying population dynamics.

Detectability Thresholds and Optimal Algorithms for Community Structure in Dynamic Networks

NASA Astrophysics Data System (ADS)

Ghasemian, Amir; Zhang, Pan; Clauset, Aaron; Moore, Cristopher; Peel, Leto

2016-07-01

The detection of communities within a dynamic network is a common means for obtaining a coarse-grained view of a complex system and for investigating its underlying processes. While a number of methods have been proposed in the machine learning and physics literature, we lack a theoretical analysis of their strengths and weaknesses, or of the ultimate limits on when communities can be detected. Here, we study the fundamental limits of detecting community structure in dynamic networks. Specifically, we analyze the limits of detectability for a dynamic stochastic block model where nodes change their community memberships over time, but where edges are generated independently at each time step. Using the cavity method, we derive a precise detectability threshold as a function of the rate of change and the strength of the communities. Below this sharp threshold, we claim that no efficient algorithm can identify the communities better than chance. We then give two algorithms that are optimal in the sense that they succeed all the way down to this threshold. The first uses belief propagation, which gives asymptotically optimal accuracy, and the second is a fast spectral clustering algorithm, based on linearizing the belief propagation equations. These results extend our understanding of the limits of community detection in an important direction, and introduce new mathematical tools for similar extensions to networks with other types of auxiliary information.

Adaptive dynamical networks

NASA Astrophysics Data System (ADS)

Maslennikov, O. V.; Nekorkin, V. I.

2017-10-01

Dynamical networks are systems of active elements (nodes) interacting with each other through links. Examples are power grids, neural structures, coupled chemical oscillators, and communications networks, all of which are characterized by a networked structure and intrinsic dynamics of their interacting components. If the coupling structure of a dynamical network can change over time due to nodal dynamics, then such a system is called an adaptive dynamical network. The term ‘adaptive’ implies that the coupling topology can be rewired; the term ‘dynamical’ implies the presence of internal node and link dynamics. The main results of research on adaptive dynamical networks are reviewed. Key notions and definitions of the theory of complex networks are given, and major collective effects that emerge in adaptive dynamical networks are described.

Age-related changes in the ease of dynamical transitions in human brain activity.

PubMed

Ezaki, Takahiro; Sakaki, Michiko; Watanabe, Takamitsu; Masuda, Naoki

2018-06-01

Executive functions, a set of cognitive processes that enable flexible behavioral control, are known to decay with aging. Because such complex mental functions are considered to rely on the dynamic coordination of functionally different neural systems, the age-related decline in executive functions should be underpinned by alteration of large-scale neural dynamics. However, the effects of age on brain dynamics have not been firmly formulated. Here, we investigate such age-related changes in brain dynamics by applying "energy landscape analysis" to publicly available functional magnetic resonance imaging data from healthy younger and older human adults. We quantified the ease of dynamical transitions between different major patterns of brain activity, and estimated it for the default mode network (DMN) and the cingulo-opercular network (CON) separately. We found that the two age groups shared qualitatively the same trajectories of brain dynamics in both the DMN and CON. However, in both of networks, the ease of transitions was significantly smaller in the older than the younger group. Moreover, the ease of transitions was associated with the performance in executive function tasks in a doubly dissociated manner: for the younger adults, the ability of executive functions was mainly correlated with the ease of transitions in the CON, whereas that for the older adults was specifically associated with the ease of transitions in the DMN. These results provide direct biological evidence for age-related changes in macroscopic brain dynamics and suggest that such neural dynamics play key roles when individuals carry out cognitively demanding tasks. © 2018 Wiley Periodicals, Inc.

Dynamic Connectivity between Brain Networks Supports Working Memory: Relationships to Dopamine Release and Schizophrenia.

PubMed

Cassidy, Clifford M; Van Snellenberg, Jared X; Benavides, Caridad; Slifstein, Mark; Wang, Zhishun; Moore, Holly; Abi-Dargham, Anissa; Horga, Guillermo

2016-04-13

Connectivity between brain networks may adapt flexibly to cognitive demand, a process that could underlie adaptive behaviors and cognitive deficits, such as those observed in neuropsychiatric conditions like schizophrenia. Dopamine signaling is critical for working memory but its influence on internetwork connectivity is relatively unknown. We addressed these questions in healthy humans using functional magnetic resonance imaging (during ann-back working-memory task) and positron emission tomography using the radiotracer [(11)C]FLB457 before and after amphetamine to measure the capacity for dopamine release in extrastriatal brain regions. Brain networks were defined by spatial independent component analysis (ICA) and working-memory-load-dependent connectivity between task-relevant pairs of networks was determined via a modified psychophysiological interaction analysis. For most pairs of task-relevant networks, connectivity significantly changed as a function of working-memory load. Moreover, load-dependent changes in connectivity between left and right frontoparietal networks (Δ connectivity lFPN-rFPN) predicted interindividual differences in task performance more accurately than other fMRI and PET imaging measures. Δ Connectivity lFPN-rFPN was not related to cortical dopamine release capacity. A second study in unmedicated patients with schizophrenia showed no abnormalities in load-dependent connectivity but showed a weaker relationship between Δ connectivity lFPN-rFPN and working memory performance in patients compared with matched healthy individuals. Poor working memory performance in patients was, in contrast, related to deficient cortical dopamine release. Our findings indicate that interactions between brain networks dynamically adapt to fluctuating environmental demands. These dynamic adaptations underlie successful working memory performance in healthy individuals and are not well predicted by amphetamine-induced dopamine release capacity. It is unclear how communication between brain networks responds to changing environmental demands during complex cognitive processes. Also, unknown in regard to these network dynamics is the role of neuromodulators, such as dopamine, and whether their dysregulation could underlie cognitive deficits in neuropsychiatric illness. We found that connectivity between brain networks changes with working-memory load and greater increases predict better working memory performance; however, it was not related to capacity for dopamine release in the cortex. Patients with schizophrenia did show dynamic internetwork connectivity; however, this was more weakly associated with successful performance in patients compared with healthy individuals. Our findings indicate that dynamic interactions between brain networks may support the type of flexible adaptations essential to goal-directed behavior. Copyright © 2016 the authors 0270-6474/16/364378-12$15.00/0.

Dynamic Connectivity between Brain Networks Supports Working Memory: Relationships to Dopamine Release and Schizophrenia

PubMed Central

Van Snellenberg, Jared X.; Benavides, Caridad; Slifstein, Mark; Wang, Zhishun; Moore, Holly; Abi-Dargham, Anissa

2016-01-01

Connectivity between brain networks may adapt flexibly to cognitive demand, a process that could underlie adaptive behaviors and cognitive deficits, such as those observed in neuropsychiatric conditions like schizophrenia. Dopamine signaling is critical for working memory but its influence on internetwork connectivity is relatively unknown. We addressed these questions in healthy humans using functional magnetic resonance imaging (during an n-back working-memory task) and positron emission tomography using the radiotracer [11C]FLB457 before and after amphetamine to measure the capacity for dopamine release in extrastriatal brain regions. Brain networks were defined by spatial independent component analysis (ICA) and working-memory-load-dependent connectivity between task-relevant pairs of networks was determined via a modified psychophysiological interaction analysis. For most pairs of task-relevant networks, connectivity significantly changed as a function of working-memory load. Moreover, load-dependent changes in connectivity between left and right frontoparietal networks (Δ connectivity lFPN-rFPN) predicted interindividual differences in task performance more accurately than other fMRI and PET imaging measures. Δ Connectivity lFPN-rFPN was not related to cortical dopamine release capacity. A second study in unmedicated patients with schizophrenia showed no abnormalities in load-dependent connectivity but showed a weaker relationship between Δ connectivity lFPN-rFPN and working memory performance in patients compared with matched healthy individuals. Poor working memory performance in patients was, in contrast, related to deficient cortical dopamine release. Our findings indicate that interactions between brain networks dynamically adapt to fluctuating environmental demands. These dynamic adaptations underlie successful working memory performance in healthy individuals and are not well predicted by amphetamine-induced dopamine release capacity. SIGNIFICANCE STATEMENT It is unclear how communication between brain networks responds to changing environmental demands during complex cognitive processes. Also, unknown in regard to these network dynamics is the role of neuromodulators, such as dopamine, and whether their dysregulation could underlie cognitive deficits in neuropsychiatric illness. We found that connectivity between brain networks changes with working-memory load and greater increases predict better working memory performance; however, it was not related to capacity for dopamine release in the cortex. Patients with schizophrenia did show dynamic internetwork connectivity; however, this was more weakly associated with successful performance in patients compared with healthy individuals. Our findings indicate that dynamic interactions between brain networks may support the type of flexible adaptations essential to goal-directed behavior. PMID:27076432

Sensitivity analysis of dynamic biological systems with time-delays.

PubMed

Wu, Wu Hsiung; Wang, Feng Sheng; Chang, Maw Shang

2010-10-15

Mathematical modeling has been applied to the study and analysis of complex biological systems for a long time. Some processes in biological systems, such as the gene expression and feedback control in signal transduction networks, involve a time delay. These systems are represented as delay differential equation (DDE) models. Numerical sensitivity analysis of a DDE model by the direct method requires the solutions of model and sensitivity equations with time-delays. The major effort is the computation of Jacobian matrix when computing the solution of sensitivity equations. The computation of partial derivatives of complex equations either by the analytic method or by symbolic manipulation is time consuming, inconvenient, and prone to introduce human errors. To address this problem, an automatic approach to obtain the derivatives of complex functions efficiently and accurately is necessary. We have proposed an efficient algorithm with an adaptive step size control to compute the solution and dynamic sensitivities of biological systems described by ordinal differential equations (ODEs). The adaptive direct-decoupled algorithm is extended to solve the solution and dynamic sensitivities of time-delay systems describing by DDEs. To save the human effort and avoid the human errors in the computation of partial derivatives, an automatic differentiation technique is embedded in the extended algorithm to evaluate the Jacobian matrix. The extended algorithm is implemented and applied to two realistic models with time-delays: the cardiovascular control system and the TNF-α signal transduction network. The results show that the extended algorithm is a good tool for dynamic sensitivity analysis on DDE models with less user intervention. By comparing with direct-coupled methods in theory, the extended algorithm is efficient, accurate, and easy to use for end users without programming background to do dynamic sensitivity analysis on complex biological systems with time-delays.

Elucidating the design principles of photosynthetic electron-transfer proteins by site-directed spin labeling EPR spectroscopy.

PubMed

Ishara Silva, K; Jagannathan, Bharat; Golbeck, John H; Lakshmi, K V

2016-05-01

Site-directed spin labeling electron paramagnetic resonance (SDSL EPR) spectroscopy is a powerful tool to determine solvent accessibility, side-chain dynamics, and inter-spin distances at specific sites in biological macromolecules. This information provides important insights into the structure and dynamics of both natural and designed proteins and protein complexes. Here, we discuss the application of SDSL EPR spectroscopy in probing the charge-transfer cofactors in photosynthetic reaction centers (RC) such as photosystem I (PSI) and the bacterial reaction center (bRC). Photosynthetic RCs are large multi-subunit proteins (molecular weight≥300 kDa) that perform light-driven charge transfer reactions in photosynthesis. These reactions are carried out by cofactors that are paramagnetic in one of their oxidation states. This renders the RCs unsuitable for conventional nuclear magnetic resonance spectroscopy investigations. However, the presence of native paramagnetic centers and the ability to covalently attach site-directed spin labels in RCs makes them ideally suited for the application of SDSL EPR spectroscopy. The paramagnetic centers serve as probes of conformational changes, dynamics of subunit assembly, and the relative motion of cofactors and peptide subunits. In this review, we describe novel applications of SDSL EPR spectroscopy for elucidating the effects of local structure and dynamics on the electron-transfer cofactors of photosynthetic RCs. Because SDSL EPR Spectroscopy is uniquely suited to provide dynamic information on protein motion, it is a particularly useful method in the engineering and analysis of designed electron transfer proteins and protein networks. This article is part of a Special Issue entitled Biodesign for Bioenergetics--the design and engineering of electronic transfer cofactors, proteins and protein networks, edited by Ronald L. Koder and J.L. Ross Anderson. Copyright © 2016. Published by Elsevier B.V.

Time-Varying Networks of Inter-Ictal Discharging Reveal Epileptogenic Zone.

PubMed

Zhang, Luyan; Liang, Yi; Li, Fali; Sun, Hongbin; Peng, Wenjing; Du, Peishan; Si, Yajing; Song, Limeng; Yu, Liang; Xu, Peng

2017-01-01

The neuronal synchronous discharging may cause an epileptic seizure. Currently, most of the studies conducted to investigate the mechanism of epilepsy are based on EEGs or functional magnetic resonance imaging (fMRI) recorded during the ictal discharging or the resting-state, and few studies have probed into the dynamic patterns during the inter-ictal discharging that are much easier to record in clinical applications. Here, we propose a time-varying network analysis based on adaptive directed transfer function to uncover the dynamic brain network patterns during the inter-ictal discharging. In addition, an algorithm based on the time-varying outflow of information derived from the network analysis is developed to detect the epileptogenic zone. The analysis performed revealed the time-varying network patterns during different stages of inter-ictal discharging; the epileptogenic zone was activated prior to the discharge onset then worked as the source to propagate the activity to other brain regions. Consistence between the epileptogenic zones detected by our proposed approach and the actual epileptogenic zones proved that time-varying network analysis could not only reveal the underlying neural mechanism of epilepsy, but also function as a useful tool in detecting the epileptogenic zone based on the EEGs in the inter-ictal discharging.

Embedding recurrent neural networks into predator-prey models.

PubMed

Moreau, Yves; Louiès, Stephane; Vandewalle, Joos; Brenig, Leon

1999-03-01

We study changes of coordinates that allow the embedding of ordinary differential equations describing continuous-time recurrent neural networks into differential equations describing predator-prey models-also called Lotka-Volterra systems. We transform the equations for the neural network first into quasi-monomial form (Brenig, L. (1988). Complete factorization and analytic solutions of generalized Lotka-Volterra equations. Physics Letters A, 133(7-8), 378-382), where we express the vector field of the dynamical system as a linear combination of products of powers of the variables. In practice, this transformation is possible only if the activation function is the hyperbolic tangent or the logistic sigmoid. From this quasi-monomial form, we can directly transform the system further into Lotka-Volterra equations. The resulting Lotka-Volterra system is of higher dimension than the original system, but the behavior of its first variables is equivalent to the behavior of the original neural network. We expect that this transformation will permit the application of existing techniques for the analysis of Lotka-Volterra systems to recurrent neural networks. Furthermore, our results show that Lotka-Volterra systems are universal approximators of dynamical systems, just as are continuous-time neural networks.

Reciprocity of weighted networks

PubMed Central

Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

2013-01-01

In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation. PMID:24056721

Reciprocity of weighted networks.

PubMed

Squartini, Tiziano; Picciolo, Francesco; Ruzzenenti, Franco; Garlaschelli, Diego

2013-01-01

In directed networks, reciprocal links have dramatic effects on dynamical processes, network growth, and higher-order structures such as motifs and communities. While the reciprocity of binary networks has been extensively studied, that of weighted networks is still poorly understood, implying an ever-increasing gap between the availability of weighted network data and our understanding of their dyadic properties. Here we introduce a general approach to the reciprocity of weighted networks, and define quantities and null models that consistently capture empirical reciprocity patterns at different structural levels. We show that, counter-intuitively, previous reciprocity measures based on the similarity of mutual weights are uninformative. By contrast, our measures allow to consistently classify different weighted networks according to their reciprocity, track the evolution of a network's reciprocity over time, identify patterns at the level of dyads and vertices, and distinguish the effects of flux (im)balances or other (a)symmetries from a true tendency towards (anti-)reciprocation.

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

PubMed

Gibbs, David L; Shmulevich, Ilya

2017-06-01

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

Regulation of dopamine D1 receptor dynamics within the postsynaptic density of hippocampal glutamate synapses.

PubMed

Ladepeche, Laurent; Yang, Luting; Bouchet, Delphine; Groc, Laurent

2013-01-01

Dopamine receptor potently modulates glutamate signalling, synaptic plasticity and neuronal network adaptations in various pathophysiological processes. Although key intracellular signalling cascades have been identified, the cellular mechanism by which dopamine and glutamate receptor-mediated signalling interplay at glutamate synapse remain poorly understood. Among the cellular mechanisms proposed to aggregate D1R in glutamate synapses, the direct interaction between D1R and the scaffold protein PSD95 or the direct interaction with the glutamate NMDA receptor (NMDAR) have been proposed. To tackle this question we here used high-resolution single nanoparticle imaging since it provides a powerful way to investigate at the sub-micron resolution the dynamic interaction between these partners in live synapses. We demonstrate in hippocampal neuronal networks that dopamine D1 receptors (D1R) laterally diffuse within glutamate synapses, in which their diffusion is reduced. Disrupting the interaction between D1R and PSD95, through genetical manipulation and competing peptide, did not affect D1R dynamics in glutamatergic synapses. However, preventing the physical interaction between D1R and the GluN1 subunit of NMDAR abolished the synaptic stabilization of diffusing D1R. Together, these data provide direct evidence that the interaction between D1R and NMDAR in synapses participate in the building of the dopamine-receptor-mediated signalling, and most likely to the glutamate-dopamine cross-talk.

Passive and Active Analysis in DSR-Based Ad Hoc Networks

NASA Astrophysics Data System (ADS)

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

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

Fast reversible learning based on neurons functioning as anisotropic multiplex hubs

NASA Astrophysics Data System (ADS)

Vardi, Roni; Goldental, Amir; Sheinin, Anton; Sardi, Shira; Kanter, Ido

2017-05-01

Neural networks are composed of neurons and synapses, which are responsible for learning in a slow adaptive dynamical process. Here we experimentally show that neurons act like independent anisotropic multiplex hubs, which relay and mute incoming signals following their input directions. Theoretically, the observed information routing enriches the computational capabilities of neurons by allowing, for instance, equalization among different information routes in the network, as well as high-frequency transmission of complex time-dependent signals constructed via several parallel routes. In addition, this kind of hubs adaptively eliminate very noisy neurons from the dynamics of the network, preventing masking of information transmission. The timescales for these features are several seconds at most, as opposed to the imprint of information by the synaptic plasticity, a process which exceeds minutes. Results open the horizon to the understanding of fast and adaptive learning realities in higher cognitive brain's functionalities.

All-Optical Implementation of the Ant Colony Optimization Algorithm

PubMed Central

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

2016-01-01

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

Current-Sensitive Path Planning for an Underactuated Free-Floating Ocean Sensorweb

NASA Technical Reports Server (NTRS)

Dahl, Kristen P.; Thompson, David R.; McLaren, David; Chao, Yi; Chien, Steve

2011-01-01

This work investigates multi-agent path planning in strong, dynamic currents using thousands of highly under-actuated vehicles. We address the specific task of path planning for a global network of ocean-observing floats. These submersibles are typified by the Argo global network consisting of over 3000 sensor platforms. They can control their buoyancy to float at depth for data collection or rise to the surface for satellite communications. Currently, floats drift at a constant depth regardless of the local currents. However, accurate current forecasts have become available which present the possibility of intentionally controlling floats' motion by dynamically commanding them to linger at different depths. This project explores the use of these current predictions to direct float networks to some desired final formation or position. It presents multiple algorithms for such path optimization and demonstrates their advantage over the standard approach of constant-depth drifting.

MicroRNA networks in mouse lung organogenesis.

PubMed

Dong, Jie; Jiang, Guoqian; Asmann, Yan W; Tomaszek, Sandra; Jen, Jin; Kislinger, Thomas; Wigle, Dennis A

2010-05-26

MicroRNAs (miRNAs) are known to be important regulators of both organ development and tumorigenesis. MiRNA networks and their regulation of messenger RNA (mRNA) translation and protein expression in specific biological processes are poorly understood. We explored the dynamic regulation of miRNAs in mouse lung organogenesis. Comprehensive miRNA and mRNA profiling was performed encompassing all recognized stages of lung development beginning at embryonic day 12 and continuing to adulthood. We analyzed the expression patterns of dynamically regulated miRNAs and mRNAs using a number of statistical and computational approaches, and in an integrated manner with protein levels from an existing mass-spectrometry derived protein database for lung development. In total, 117 statistically significant miRNAs were dynamically regulated during mouse lung organogenesis and clustered into distinct temporal expression patterns. 11,220 mRNA probes were also shown to be dynamically regulated and clustered into distinct temporal expression patterns, with 3 major patterns accounting for 75% of all probes. 3,067 direct miRNA-mRNA correlation pairs were identified involving 37 miRNAs. Two defined correlation patterns were observed upon integration with protein data: 1) increased levels of specific miRNAs directly correlating with downregulation of predicted mRNA targets; and 2) increased levels of specific miRNAs directly correlating with downregulation of translated target proteins without detectable changes in mRNA levels. Of 1345 proteins analyzed, 55% appeared to be regulated in this manner with a direct correlation between miRNA and protein level, but without detectable change in mRNA levels. Systematic analysis of microRNA, mRNA, and protein levels over the time course of lung organogenesis demonstrates dynamic regulation and reveals 2 distinct patterns of miRNA-mRNA interaction. The translation of target proteins affected by miRNAs independent of changes in mRNA level appears to be a prominent mechanism of developmental regulation in lung organogenesis.

Dynamics of the human brain network revealed by time-frequency effective connectivity in fNIRS

PubMed Central

Vergotte, Grégoire; Torre, Kjerstin; Chirumamilla, Venkata Chaitanya; Anwar, Abdul Rauf; Groppa, Sergiu; Perrey, Stéphane; Muthuraman, Muthuraman

2017-01-01

Functional near infrared spectroscopy (fNIRS) is a promising neuroimaging method for investigating networks of cortical regions over time. We propose a directed effective connectivity method (TPDC) allowing the capture of both time and frequency evolution of the brain’s networks using fNIRS data acquired from healthy subjects performing a continuous finger-tapping task. Using this method we show the directed connectivity patterns among cortical motor regions involved in the task and their significant variations in the strength of information flow exchanges. Intra and inter-hemispheric connections during the motor task with their temporal evolution are also provided. Characterisation of the fluctuations in brain connectivity opens up a new way to assess the organisation of the brain to adapt to changing task constraints, or under pathological conditions. PMID:29188123

Adaptive neural network output feedback control for stochastic nonlinear systems with unknown dead-zone and unmodeled dynamics.

PubMed

Tong, Shaocheng; Wang, Tong; Li, Yongming; Zhang, Huaguang

2014-06-01

This paper discusses the problem of adaptive neural network output feedback control for a class of stochastic nonlinear strict-feedback systems. The concerned systems have certain characteristics, such as unknown nonlinear uncertainties, unknown dead-zones, unmodeled dynamics and without the direct measurements of state variables. In this paper, the neural networks (NNs) are employed to approximate the unknown nonlinear uncertainties, and then by representing the dead-zone as a time-varying system with a bounded disturbance. An NN state observer is designed to estimate the unmeasured states. Based on both backstepping design technique and a stochastic small-gain theorem, a robust adaptive NN output feedback control scheme is developed. It is proved that all the variables involved in the closed-loop system are input-state-practically stable in probability, and also have robustness to the unmodeled dynamics. Meanwhile, the observer errors and the output of the system can be regulated to a small neighborhood of the origin by selecting appropriate design parameters. Simulation examples are also provided to illustrate the effectiveness of the proposed approach.

Epigenetics and Why Biological Networks are More Controllable than Expected

NASA Astrophysics Data System (ADS)

Motter, Adilson

2013-03-01

A fundamental property of networks is that perturbations to one node can affect other nodes, potentially causing the entire system to change behavior or fail. In this talk, I will show that it is possible to exploit this same principle to control network behavior. This approach takes advantage of the nonlinear dynamics inherent to real networks, and allows bringing the system to a desired target state even when this state is not directly accessible or the linear counterpart is not controllable. Applications show that this framework permits both reprogramming a network to a desired task as well as rescuing networks from the brink of failure, which I will illustrate through various biological problems. I will also briefly review the progress our group has made over the past 5 years on related control of complex networks in non-biological domains.

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.

Investigating the Influence Relationship Models for Stocks in Indian Equity Market: A Weighted Network Modelling Study

PubMed Central

Acharjee, Animesh

2016-01-01

The socio-economic systems today possess high levels of both interconnectedness and interdependencies, and such system-level relationships behave very dynamically. In such situations, it is all around perceived that influence is a perplexing power that has an overseeing part in affecting the dynamics and behaviours of involved ones. As a result of the force & direction of influence, the transformative change of one entity has a cogent aftereffect on the other entities in the system. The current study employs directed weighted networks for investigating the influential relationship patterns existent in a typical equity market as an outcome of inter-stock interactions happening at the market level, the sectorial level and the industrial level. The study dataset is derived from 335 constituent stocks of ‘Standard & Poor Bombay Stock Exchange 500 index’ and study period is 1st June 2005 to 30th June 2015. The study identifies the set of most dynamically influential stocks & their respective temporal pattern at three hierarchical levels: the complete equity market, different sectors, and constituting industry segments of those sectors. A detailed influence relationship analysis is performed for the sectorial level network of the construction sector, and it was found that stocks belonging to the cement industry possessed high influence within this sector. Also, the detailed network analysis of construction sector revealed that it follows scale-free characteristics and power law distribution. In the industry specific influence relationship analysis for cement industry, methods based on threshold filtering and minimum spanning tree were employed to derive a set of sub-graphs having temporally stable high-correlation structure over this ten years period. PMID:27846251

Investigating the Influence Relationship Models for Stocks in Indian Equity Market: A Weighted Network Modelling Study.

PubMed

Bhattacharjee, Biplab; Shafi, Muhammad; Acharjee, Animesh

2016-01-01

The socio-economic systems today possess high levels of both interconnectedness and interdependencies, and such system-level relationships behave very dynamically. In such situations, it is all around perceived that influence is a perplexing power that has an overseeing part in affecting the dynamics and behaviours of involved ones. As a result of the force & direction of influence, the transformative change of one entity has a cogent aftereffect on the other entities in the system. The current study employs directed weighted networks for investigating the influential relationship patterns existent in a typical equity market as an outcome of inter-stock interactions happening at the market level, the sectorial level and the industrial level. The study dataset is derived from 335 constituent stocks of 'Standard & Poor Bombay Stock Exchange 500 index' and study period is 1st June 2005 to 30th June 2015. The study identifies the set of most dynamically influential stocks & their respective temporal pattern at three hierarchical levels: the complete equity market, different sectors, and constituting industry segments of those sectors. A detailed influence relationship analysis is performed for the sectorial level network of the construction sector, and it was found that stocks belonging to the cement industry possessed high influence within this sector. Also, the detailed network analysis of construction sector revealed that it follows scale-free characteristics and power law distribution. In the industry specific influence relationship analysis for cement industry, methods based on threshold filtering and minimum spanning tree were employed to derive a set of sub-graphs having temporally stable high-correlation structure over this ten years period.

Importance of small-degree nodes in assortative networks with degree-weight correlations

NASA Astrophysics Data System (ADS)

Ma, Sijuan; Feng, Ling; Monterola, Christopher Pineda; Lai, Choy Heng

2017-10-01

It has been known that assortative network structure plays an important role in spreading dynamics for unweighted networks. Yet its influence on weighted networks is not clear, in particular when weight is strongly correlated with the degrees of the nodes as we empirically observed in Twitter. Here we use the self-consistent probability method and revised nonperturbative heterogenous mean-field theory method to investigate this influence on both susceptible-infective-recovered (SIR) and susceptible-infective-susceptible (SIS) spreading dynamics. Both our simulation and theoretical results show that while the critical threshold is not significantly influenced by the assortativity, the prevalence in the supercritical regime shows a crossover under different degree-weight correlations. In particular, unlike the case of random mixing networks, in assortative networks, the negative degree-weight correlation leads to higher prevalence in their spreading beyond the critical transmissivity than that of the positively correlated. In addition, the previously observed inhibition effect on spreading velocity by assortative structure is not apparent in negatively degree-weight correlated networks, while it is enhanced for that of the positively correlated. Detailed investigation into the degree distribution of the infected nodes reveals that small-degree nodes play essential roles in the supercritical phase of both SIR and SIS spreadings. Our results have direct implications in understanding viral information spreading over online social networks and epidemic spreading over contact networks.

Theta rhythm-like bidirectional cycling dynamics of living neuronal networks in vitro.

PubMed

Gladkov, Arseniy; Grinchuk, Oleg; Pigareva, Yana; Mukhina, Irina; Kazantsev, Victor; Pimashkin, Alexey

2018-01-01

The phenomena of synchronization, rhythmogenesis and coherence observed in brain networks are believed to be a dynamic substrate for cognitive functions such as learning and memory. However, researchers are still debating whether the rhythmic activity emerges from the network morphology that developed during neurogenesis or as a result of neuronal dynamics achieved under certain conditions. In the present study, we observed self-organized spiking activity that converged to long, complex and rhythmically repeated superbursts in neural networks formed by mature hippocampal cultures with a high cellular density. The superburst lasted for tens of seconds and consisted of hundreds of short (50-100 ms) small bursts with a high spiking rate of 139.0 ± 78.6 Hz that is associated with high-frequency oscillations in the hippocampus. In turn, the bursting frequency represents a theta rhythm (11.2 ± 1.5 Hz). The distribution of spikes within the bursts was non-random, representing a set of well-defined spatio-temporal base patterns or motifs. The long superburst was classified into two types. Each type was associated with a unique direction of spike propagation and, hence, was encoded by a binary sequence with random switching between the two "functional" states. The precisely structured bidirectional rhythmic activity that developed in self-organizing cultured networks was quite similar to the activity observed in the in vivo experiments.

Cytoskeletal actin dynamics shape a ramifying actin network underpinning immunological synapse formation

PubMed Central

Fritzsche, Marco; Fernandes, Ricardo A.; Chang, Veronica T.; Colin-York, Huw; Clausen, Mathias P.; Felce, James H.; Galiani, Silvia; Erlenkämper, Christoph; Santos, Ana M.; Heddleston, John M.; Pedroza-Pacheco, Isabela; Waithe, Dominic; de la Serna, Jorge Bernardino; Lagerholm, B. Christoffer; Liu, Tsung-li; Chew, Teng-Leong; Betzig, Eric; Davis, Simon J.; Eggeling, Christian

2017-01-01

T cell activation and especially trafficking of T cell receptor microclusters during immunological synapse formation are widely thought to rely on cytoskeletal remodeling. However, important details on the involvement of actin in the latter transport processes are missing. Using a suite of advanced optical microscopes to analyze resting and activated T cells, we show that, following contact formation with activating surfaces, these cells sequentially rearrange their cortical actin across the entire cell, creating a previously unreported ramifying actin network above the immunological synapse. This network shows all the characteristics of an inward-growing transportation network and its dynamics correlating with T cell receptor rearrangements. This actin reorganization is accompanied by an increase in the nanoscale actin meshwork size and the dynamic adjustment of the turnover times and filament lengths of two differently sized filamentous actin populations, wherein formin-mediated long actin filaments support a very flat and stiff contact at the immunological synapse interface. The initiation of immunological synapse formation, as highlighted by calcium release, requires markedly little contact with activating surfaces and no cytoskeletal rearrangements. Our work suggests that incipient signaling in T cells initiates global cytoskeletal rearrangements across the whole cell, including a stiffening process for possibly mechanically supporting contact formation at the immunological synapse interface as well as a central ramified transportation network apparently directed at the consolidation of the contact and the delivery of effector functions. PMID:28691087

Constructing networks from a dynamical system perspective for multivariate nonlinear time series.

PubMed

Nakamura, Tomomichi; Tanizawa, Toshihiro; Small, Michael

2016-03-01

We describe a method for constructing networks for multivariate nonlinear time series. We approach the interaction between the various scalar time series from a deterministic dynamical system perspective and provide a generic and algorithmic test for whether the interaction between two measured time series is statistically significant. The method can be applied even when the data exhibit no obvious qualitative similarity: a situation in which the naive method utilizing the cross correlation function directly cannot correctly identify connectivity. To establish the connectivity between nodes we apply the previously proposed small-shuffle surrogate (SSS) method, which can investigate whether there are correlation structures in short-term variabilities (irregular fluctuations) between two data sets from the viewpoint of deterministic dynamical systems. The procedure to construct networks based on this idea is composed of three steps: (i) each time series is considered as a basic node of a network, (ii) the SSS method is applied to verify the connectivity between each pair of time series taken from the whole multivariate time series, and (iii) the pair of nodes is connected with an undirected edge when the null hypothesis cannot be rejected. The network constructed by the proposed method indicates the intrinsic (essential) connectivity of the elements included in the system or the underlying (assumed) system. The method is demonstrated for numerical data sets generated by known systems and applied to several experimental time series.

Moving target tracking through distributed clustering in directional sensor networks.

PubMed

Enayet, Asma; Razzaque, Md Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif

2014-12-18

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works.

Moving Target Tracking through Distributed Clustering in Directional Sensor Networks

PubMed Central

Enayet, Asma; Razzaque, Md. Abdur; Hassan, Mohammad Mehedi; Almogren, Ahmad; Alamri, Atif

2014-01-01

The problem of moving target tracking in directional sensor networks (DSNs) introduces new research challenges, including optimal selection of sensing and communication sectors of the directional sensor nodes, determination of the precise location of the target and an energy-efficient data collection mechanism. Existing solutions allow individual sensor nodes to detect the target's location through collaboration among neighboring nodes, where most of the sensors are activated and communicate with the sink. Therefore, they incur much overhead, loss of energy and reduced target tracking accuracy. In this paper, we have proposed a clustering algorithm, where distributed cluster heads coordinate their member nodes in optimizing the active sensing and communication directions of the nodes, precisely determining the target location by aggregating reported sensing data from multiple nodes and transferring the resultant location information to the sink. Thus, the proposed target tracking mechanism minimizes the sensing redundancy and maximizes the number of sleeping nodes in the network. We have also investigated the dynamic approach of activating sleeping nodes on-demand so that the moving target tracking accuracy can be enhanced while maximizing the network lifetime. We have carried out our extensive simulations in ns-3, and the results show that the proposed mechanism achieves higher performance compared to the state-of-the-art works. PMID:25529205

Altered predictive capability of the brain network EEG model in schizophrenia during cognition.

PubMed

Gomez-Pilar, Javier; Poza, Jesús; Gómez, Carlos; Northoff, Georg; Lubeiro, Alba; Cea-Cañas, Benjamín B; Molina, Vicente; Hornero, Roberto

2018-05-12

The study of the mechanisms involved in cognition is of paramount importance for the understanding of the neurobiological substrates in psychiatric disorders. Hence, this research is aimed at exploring the brain network dynamics during a cognitive task. Specifically, we analyze the predictive capability of the pre-stimulus theta activity to ascertain the functional brain dynamics during cognition in both healthy and schizophrenia subjects. Firstly, EEG recordings were acquired during a three-tone oddball task from fifty-one healthy subjects and thirty-five schizophrenia patients. Secondly, phase-based coupling measures were used to generate the time-varying functional network for each subject. Finally, pre-stimulus network connections were iteratively modified according to different models of network reorganization. This adjustment was applied by minimizing the prediction error through recurrent iterations, following the predictive coding approach. Both controls and schizophrenia patients follow a reinforcement of the secondary neural pathways (i.e., pathways between cortical brain regions weakly connected during pre-stimulus) for most of the subjects, though the ratio of controls that exhibited this behavior was statistically significant higher than for patients. These findings suggest that schizophrenia is associated with an impaired ability to modify brain network configuration during cognition. Furthermore, we provide direct evidence that the changes in phase-based brain network parameters from pre-stimulus to cognitive response in the theta band are closely related to the performance in important cognitive domains. Our findings not only contribute to the understanding of healthy brain dynamics, but also shed light on the altered predictive neuronal substrates in schizophrenia. Copyright © 2018 Elsevier B.V. All rights reserved.

Pharmacological modulation of pulvinar resting-state regional oscillations and network dynamics in major depression

PubMed Central

Tadayonnejad, Reza; Ajilore, Olusola; Mickey, Brian J.; Crane, Natania A.; Hsu, David T.; Kumar, Anand; Zubieta, Jon-Kar; Langenecker, Scott A.

2016-01-01

The pulvinar, the largest thalamus nucleus, has rich anatomical connections with several different cortical and subcortical regions suggesting its important involvement in high-level cognitive and emotional functions. Unfortunately, pulvinar dysfunction in psychiatric disorders particularly major depression disorder has not been thoroughly examined to date. In this study we explored the alterations in the baseline regional and network activities of the pulvinar in MDD by applying spectral analysis of resting-state oscillatory activity, functional connectivity and directed (effective) connectivity on resting-state fMRI data acquired from 20 healthy controls and 19 participants with MDD. Furthermore, we tested how pharmacological treatment with duloxetine can modulate the measured local and network variables in ten participants who completed treatment. Our results revealed a frequency-band dependent modulation of power spectrum characteristics of pulvinar regional oscillatory activity. At the network level, we found MDD is associated with aberrant causal interactions between pulvinar and several systems including default-mode and posterior insular networks. It was also shown that duloxetine treatment can correct or overcompensate the pathologic network behavior of the pulvinar. In conclusion, we suggest that pulvinar regional baseline oscillatory activity and its resting-state network dynamics are compromised in MDD and can be modulated therapeutically by pharmacological treatment. PMID:27148894

Elimination of spiral waves in a locally connected chaotic neural network by a dynamic phase space constraint.

PubMed

Li, Yang; Oku, Makito; He, Guoguang; Aihara, Kazuyuki

2017-04-01

In this study, a method is proposed that eliminates spiral waves in a locally connected chaotic neural network (CNN) under some simplified conditions, using a dynamic phase space constraint (DPSC) as a control method. In this method, a control signal is constructed from the feedback internal states of the neurons to detect phase singularities based on their amplitude reduction, before modulating a threshold value to truncate the refractory internal states of the neurons and terminate the spirals. Simulations showed that with appropriate parameter settings, the network was directed from a spiral wave state into either a plane wave (PW) state or a synchronized oscillation (SO) state, where the control vanished automatically and left the original CNN model unaltered. Each type of state had a characteristic oscillation frequency, where spiral wave states had the highest, and the intra-control dynamics was dominated by low-frequency components, thereby indicating slow adjustments to the state variables. In addition, the PW-inducing and SO-inducing control processes were distinct, where the former generally had longer durations but smaller average proportions of affected neurons in the network. Furthermore, variations in the control parameter allowed partial selectivity of the control results, which were accompanied by modulation of the control processes. The results of this study broaden the applicability of DPSC to chaos control and they may also facilitate the utilization of locally connected CNNs in memory retrieval and the exploration of traveling wave dynamics in biological neural networks. Copyright © 2017 Elsevier Ltd. All rights reserved.

Theory of feedback controlled brain stimulations for Parkinson's disease

NASA Astrophysics Data System (ADS)

Sanzeni, A.; Celani, A.; Tiana, G.; Vergassola, M.

2016-01-01

Limb tremor and other debilitating symptoms caused by the neurodegenerative Parkinson's disease are currently treated by administering drugs and by fixed-frequency deep brain stimulation. The latter interferes directly with the brain dynamics by delivering electrical impulses to neurons in the subthalamic nucleus. While deep brain stimulation has shown therapeutic benefits in many instances, its mechanism is still unclear. Since its understanding could lead to improved protocols of stimulation and feedback control, we have studied a mathematical model of the many-body neural network dynamics controlling the dynamics of the basal ganglia. On the basis of the results obtained from the model, we propose a new procedure of active stimulation, that depends on the feedback of the network and that respects the constraints imposed by existing technology. We show by numerical simulations that the new protocol outperforms the standard ones for deep brain stimulation and we suggest future experiments that could further improve the feedback procedure.

Synchronization of Coupled Dynamical Systems: Tolerance to Weak Connectivity and Arbitrarily Bounded Time-Varying Delays

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

Meng, Ziyang; Yang, Tao; Li, Guoqi

Here, we study synchronization of coupled linear systems over networks with weak connectivity and nonuniform time-varying delays. We focus on the case where the internal dynamics are time-varying but non-expansive (stable dynamics with a quadratic Lyapunov function). Both uniformly jointly connected and infinitely jointly connected communication topologies are considered. A new concept of quadratic synchronization is introduced. We first show that global asymptotic quadratic synchronization can be achieved over directed networks with uniform joint connectivity and arbitrarily bounded delays. We then study the case of infinitely jointly connected communication topology. In particular, for the undirected communication topologies, it turns outmore » that the existence of a uniform time interval for the jointly connected communication topology is not necessary and quadratic synchronization can be achieved when the time-varying nonuniform delays are arbitrarily bounded. Finally, simulation results are provided to validate the theoretical results.« less

Advanced optical fiber communication systems

NASA Astrophysics Data System (ADS)

Kazovsky, Leonid G.

1994-03-01

Our research is focused on three major aspects of advanced optical fiber communication systems: dynamic wavelength division multiplexing (WDM) networks, fiber nonlinearities, and high dynamic range coherent analog optical links. In the area of WDM networks, we have designed and implemented two high-speed interface boards and measured their throughput and latency. Furthermore, we designed and constructed an experimental PSK/ASK transceiver that simultaneously transmits packet-switched ASK data and circuit-switched PSK data on the same optical carrier. In the area of fiber nonlinearities, we investigated the theoretical impact of modulation frequency on cross-phase modulation (XPM) in dispersive fibers. In the area of high dynamic range coherent analog optical links, we developed theoretical expressions for the RF power transfer ratio (or RF power gain) and the noise figure (NF) of angle-modulated links. We then compared the RF power gains and noise figures of these links to that of an intensity modulated direct detection (DD) link.

Role of uncrosslinked chains in droplets dynamics on silicone elastomers.

PubMed

Hourlier-Fargette, Aurélie; Antkowiak, Arnaud; Chateauminois, Antoine; Neukirch, Sébastien

2017-05-21

We report an unexpected behavior in wetting dynamics on soft silicone substrates: the dynamics of aqueous droplets deposited on vertical plates of such elastomers exhibits two successive speed regimes. This macroscopic observation is found to be closely related to microscopic phenomena occurring at the scale of the polymer network: we show that uncrosslinked chains found in most widely used commercial silicone elastomers are responsible for this surprising behavior. A direct visualization of the uncrosslinked oligomers collected by water droplets is performed, evidencing that a capillarity-induced phase separation occurs: uncrosslinked oligomers are extracted from the silicone elastomer network by the water-glycerol mixture droplet. The sharp speed change is shown to coincide with an abrupt transition in surface tension of the droplets, when a critical surface concentration in uncrosslinked oligomer chains is reached. We infer that a droplet shifts to a second regime with a faster speed when it is completely covered with a homogeneous oil film.

Synchronization of Coupled Dynamical Systems: Tolerance to Weak Connectivity and Arbitrarily Bounded Time-Varying Delays

DOE PAGES

Meng, Ziyang; Yang, Tao; Li, Guoqi; ...

2017-09-18

Here, we study synchronization of coupled linear systems over networks with weak connectivity and nonuniform time-varying delays. We focus on the case where the internal dynamics are time-varying but non-expansive (stable dynamics with a quadratic Lyapunov function). Both uniformly jointly connected and infinitely jointly connected communication topologies are considered. A new concept of quadratic synchronization is introduced. We first show that global asymptotic quadratic synchronization can be achieved over directed networks with uniform joint connectivity and arbitrarily bounded delays. We then study the case of infinitely jointly connected communication topology. In particular, for the undirected communication topologies, it turns outmore » that the existence of a uniform time interval for the jointly connected communication topology is not necessary and quadratic synchronization can be achieved when the time-varying nonuniform delays are arbitrarily bounded. Finally, simulation results are provided to validate the theoretical results.« less

Detecting malicious chaotic signals in wireless sensor network

NASA Astrophysics Data System (ADS)

Upadhyay, Ranjit Kumar; Kumari, Sangeeta

2018-02-01

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

A fast new algorithm for a robot neurocontroller using inverse QR decomposition

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

Morris, A.S.; Khemaissia, S.

2000-01-01

A new adaptive neural network controller for robots is presented. The controller is based on direct adaptive techniques. Unlike many neural network controllers in the literature, inverse dynamical model evaluation is not required. A numerically robust, computationally efficient processing scheme for neutral network weight estimation is described, namely, the inverse QR decomposition (INVQR). The inverse QR decomposition and a weighted recursive least-squares (WRLS) method for neural network weight estimation is derived using Cholesky factorization of the data matrix. The algorithm that performs the efficient INVQR of the underlying space-time data matrix may be implemented in parallel on a triangular array.more » Furthermore, its systolic architecture is well suited for VLSI implementation. Another important benefit is well suited for VLSI implementation. Another important benefit of the INVQR decomposition is that it solves directly for the time-recursive least-squares filter vector, while avoiding the sequential back-substitution step required by the QR decomposition approaches.« less

Spatial Dynamics of Multilayer Cellular Neural Networks

NASA Astrophysics Data System (ADS)

Wu, Shi-Liang; Hsu, Cheng-Hsiung

2018-02-01

The purpose of this work is to study the spatial dynamics of one-dimensional multilayer cellular neural networks. We first establish the existence of rightward and leftward spreading speeds of the model. Then we show that the spreading speeds coincide with the minimum wave speeds of the traveling wave fronts in the right and left directions. Moreover, we obtain the asymptotic behavior of the traveling wave fronts when the wave speeds are positive and greater than the spreading speeds. According to the asymptotic behavior and using various kinds of comparison theorems, some front-like entire solutions are constructed by combining the rightward and leftward traveling wave fronts with different speeds and a spatially homogeneous solution of the model. Finally, various qualitative features of such entire solutions are investigated.

Empirical and Theoretical Aspects of Generation and Transfer of Information in a Neuromagnetic Source Network

PubMed Central

Vakorin, Vasily A.; Mišić, Bratislav; Krakovska, Olga; McIntosh, Anthony Randal

2011-01-01

Variability in source dynamics across the sources in an activated network may be indicative of how the information is processed within a network. Information-theoretic tools allow one not only to characterize local brain dynamics but also to describe interactions between distributed brain activity. This study follows such a framework and explores the relations between signal variability and asymmetry in mutual interdependencies in a data-driven pipeline of non-linear analysis of neuromagnetic sources reconstructed from human magnetoencephalographic (MEG) data collected as a reaction to a face recognition task. Asymmetry in non-linear interdependencies in the network was analyzed using transfer entropy, which quantifies predictive information transfer between the sources. Variability of the source activity was estimated using multi-scale entropy, quantifying the rate of which information is generated. The empirical results are supported by an analysis of synthetic data based on the dynamics of coupled systems with time delay in coupling. We found that the amount of information transferred from one source to another was correlated with the difference in variability between the dynamics of these two sources, with the directionality of net information transfer depending on the time scale at which the sample entropy was computed. The results based on synthetic data suggest that both time delay and strength of coupling can contribute to the relations between variability of brain signals and information transfer between them. Our findings support the previous attempts to characterize functional organization of the activated brain, based on a combination of non-linear dynamics and temporal features of brain connectivity, such as time delay. PMID:22131968

Learning to Estimate Dynamical State with Probabilistic Population Codes.

PubMed

Makin, Joseph G; Dichter, Benjamin K; Sabes, Philip N

2015-11-01

Tracking moving objects, including one's own body, is a fundamental ability of higher organisms, playing a central role in many perceptual and motor tasks. While it is unknown how the brain learns to follow and predict the dynamics of objects, it is known that this process of state estimation can be learned purely from the statistics of noisy observations. When the dynamics are simply linear with additive Gaussian noise, the optimal solution is the well known Kalman filter (KF), the parameters of which can be learned via latent-variable density estimation (the EM algorithm). The brain does not, however, directly manipulate matrices and vectors, but instead appears to represent probability distributions with the firing rates of population of neurons, "probabilistic population codes." We show that a recurrent neural network-a modified form of an exponential family harmonium (EFH)-that takes a linear probabilistic population code as input can learn, without supervision, to estimate the state of a linear dynamical system. After observing a series of population responses (spike counts) to the position of a moving object, the network learns to represent the velocity of the object and forms nearly optimal predictions about the position at the next time-step. This result builds on our previous work showing that a similar network can learn to perform multisensory integration and coordinate transformations for static stimuli. The receptive fields of the trained network also make qualitative predictions about the developing and learning brain: tuning gradually emerges for higher-order dynamical states not explicitly present in the inputs, appearing as delayed tuning for the lower-order states.

Dynamic Granger causality based on Kalman filter for evaluation of functional network connectivity in fMRI data

PubMed Central

Havlicek, Martin; Jan, Jiri; Brazdil, Milan; Calhoun, Vince D.

2015-01-01

Increasing interest in understanding dynamic interactions of brain neural networks leads to formulation of sophisticated connectivity analysis methods. Recent studies have applied Granger causality based on standard multivariate autoregressive (MAR) modeling to assess the brain connectivity. Nevertheless, one important flaw of this commonly proposed method is that it requires the analyzed time series to be stationary, whereas such assumption is mostly violated due to the weakly nonstationary nature of functional magnetic resonance imaging (fMRI) time series. Therefore, we propose an approach to dynamic Granger causality in the frequency domain for evaluating functional network connectivity in fMRI data. The effectiveness and robustness of the dynamic approach was significantly improved by combining a forward and backward Kalman filter that improved estimates compared to the standard time-invariant MAR modeling. In our method, the functional networks were first detected by independent component analysis (ICA), a computational method for separating a multivariate signal into maximally independent components. Then the measure of Granger causality was evaluated using generalized partial directed coherence that is suitable for bivariate as well as multivariate data. Moreover, this metric provides identification of causal relation in frequency domain, which allows one to distinguish the frequency components related to the experimental paradigm. The procedure of evaluating Granger causality via dynamic MAR was demonstrated on simulated time series as well as on two sets of group fMRI data collected during an auditory sensorimotor (SM) or auditory oddball discrimination (AOD) tasks. Finally, a comparison with the results obtained from a standard time-invariant MAR model was provided. PMID:20561919

Two-dimensional priority-based dynamic resource allocation algorithm for QoS in WDM/TDM PON networks

NASA Astrophysics Data System (ADS)

Sun, Yixin; Liu, Bo; Zhang, Lijia; Xin, Xiangjun; Zhang, Qi; Rao, Lan

2018-01-01

Wavelength division multiplexing/time division multiplexing (WDM/TDM) passive optical networks (PON) is being viewed as a promising solution for delivering multiple services and applications. The hybrid WDM / TDM PON uses the wavelength and bandwidth allocation strategy to control the distribution of the wavelength channels in the uplink direction, so that it can ensure the high bandwidth requirements of multiple Optical Network Units (ONUs) while improving the wavelength resource utilization. Through the investigation of the presented dynamic bandwidth allocation algorithms, these algorithms can't satisfy the requirements of different levels of service very well while adapting to the structural characteristics of mixed WDM / TDM PON system. This paper introduces a novel wavelength and bandwidth allocation algorithm to efficiently utilize the bandwidth and support QoS (Quality of Service) guarantees in WDM/TDM PON. Two priority based polling subcycles are introduced in order to increase system efficiency and improve system performance. The fixed priority polling subcycle and dynamic priority polling subcycle follow different principles to implement wavelength and bandwidth allocation according to the priority of different levels of service. A simulation was conducted to study the performance of the priority based polling in dynamic resource allocation algorithm in WDM/TDM PON. The results show that the performance of delay-sensitive services is greatly improved without degrading QoS guarantees for other services. Compared with the traditional dynamic bandwidth allocation algorithms, this algorithm can meet bandwidth needs of different priority traffic class, achieve low loss rate performance, and ensure real-time of high priority traffic class in terms of overall traffic on the network.

Self-similarity and quasi-idempotence in neural networks and related dynamical systems.

PubMed

Minati, Ludovico; Winkel, Julia; Bifone, Angelo; Oświęcimka, Paweł; Jovicich, Jorge

2017-04-01

Self-similarity across length scales is pervasively observed in natural systems. Here, we investigate topological self-similarity in complex networks representing diverse forms of connectivity in the brain and some related dynamical systems, by considering the correlation between edges directly connecting any two nodes in a network and indirect connection between the same via all triangles spanning the rest of the network. We note that this aspect of self-similarity, which is distinct from hierarchically nested connectivity (coarse-grain similarity), is closely related to idempotence of the matrix representing the graph. We introduce two measures, ι(1) and ι(∞), which represent the element-wise correlation coefficients between the initial matrix and the ones obtained after squaring it once or infinitely many times, and term the matrices which yield large values of these parameters "quasi-idempotent". These measures delineate qualitatively different forms of "shallow" and "deep" quasi-idempotence, which are influenced by nodal strength heterogeneity. A high degree of quasi-idempotence was observed for partially synchronized mean-field Kuramoto oscillators with noise, electronic chaotic oscillators, and cultures of dissociated neurons, wherein the expression of quasi-idempotence correlated strongly with network maturity. Quasi-idempotence was also detected for macro-scale brain networks representing axonal connectivity, synchronization of slow activity fluctuations during idleness, and co-activation across experimental tasks, and preliminary data indicated that quasi-idempotence of structural connectivity may decrease with ageing. This initial study highlights that the form of network self-similarity indexed by quasi-idempotence is detectable in diverse dynamical systems, and draws attention to it as a possible basis for measures representing network "collectivity" and pattern formation.

Self-similarity and quasi-idempotence in neural networks and related dynamical systems

NASA Astrophysics Data System (ADS)

Minati, Ludovico; Winkel, Julia; Bifone, Angelo; Oświecimka, Paweł; Jovicich, Jorge

2017-04-01

Self-similarity across length scales is pervasively observed in natural systems. Here, we investigate topological self-similarity in complex networks representing diverse forms of connectivity in the brain and some related dynamical systems, by considering the correlation between edges directly connecting any two nodes in a network and indirect connection between the same via all triangles spanning the rest of the network. We note that this aspect of self-similarity, which is distinct from hierarchically nested connectivity (coarse-grain similarity), is closely related to idempotence of the matrix representing the graph. We introduce two measures, ι ( 1 ) and ι ( ∞ ) , which represent the element-wise correlation coefficients between the initial matrix and the ones obtained after squaring it once or infinitely many times, and term the matrices which yield large values of these parameters "quasi-idempotent". These measures delineate qualitatively different forms of "shallow" and "deep" quasi-idempotence, which are influenced by nodal strength heterogeneity. A high degree of quasi-idempotence was observed for partially synchronized mean-field Kuramoto oscillators with noise, electronic chaotic oscillators, and cultures of dissociated neurons, wherein the expression of quasi-idempotence correlated strongly with network maturity. Quasi-idempotence was also detected for macro-scale brain networks representing axonal connectivity, synchronization of slow activity fluctuations during idleness, and co-activation across experimental tasks, and preliminary data indicated that quasi-idempotence of structural connectivity may decrease with ageing. This initial study highlights that the form of network self-similarity indexed by quasi-idempotence is detectable in diverse dynamical systems, and draws attention to it as a possible basis for measures representing network "collectivity" and pattern formation.

Two-way communication with neural networks in vivo using focused light

PubMed Central

Wilson, Nathan R.; Schummers, James; Runyan, Caroline A.; Yan, Sherry; Chen, Robert F.; Deng, Yuting; Sur, Mriganka

2014-01-01

Neuronal networks process information in a distributed, spatially heterogeneous fashion that transcends the layout of electrodes. In contrast, directed and steerable light offers the potential to engage specific cells on demand. We present a unified framework for adapting microscopes to use light for simultaneous in vivo stimulation and recording of cells at fine spatiotemporal resolutions. We utilize straightforward optics to lock onto networks in vivo, steer light to activate circuit elements, and simultaneously record from other cells. We then actualize this “free” augmentation on both an “open” two-photon microscope, and a leading commercial one. Following this protocol, setup of the system takes a few days and the result is a non-invasive interface to brain dynamics based on directed light, at a network resolution that was not previously possible and which will further improve with the rapid advance in development of optical reporters and effectors. This protocol is for physiologists who are competent with computers and wish to extend hardware and software to interface more fluidly with neuronal networks. PMID:23702834

Nucleophilic catalysis of acylhydrazone equilibration for protein-directed dynamic covalent chemistry

PubMed Central

Bhat, Venugopal T.; Caniard, Anne M.; Luksch, Torsten; Brenk, Ruth; Campopiano, Dominic J.; Greaney, Michael F.

2010-01-01

Dynamic covalent chemistry uses reversible chemical reactions to set up an equilibrating network of molecules at thermodynamic equilibrium, which can adjust its composition in response to any agent capable of altering the free energy of the system. When the target is a biological macromolecule, such as a protein, the process corresponds to the protein directing the synthesis of its own best ligand. Here, we demonstrate that reversible acylhydrazone formation is an effective chemistry for biological dynamic combinatorial library formation. In the presence of aniline as a nucleophilic catalyst, dynamic combinatorial libraries equilibrate rapidly at pH 6.2, are fully reversible, and may be switched on or off by means of a change in pH. We have interfaced these hydrazone dynamic combinatorial libraries with two isozymes from the glutathione S-transferase class of enzyme, and observed divergent amplification effects, where each protein selects the best-fitting hydrazone for the hydrophobic region of its active site. PMID:20489719

Detection of social group instability among captive rhesus macaques using joint network modeling

PubMed Central

Beisner, Brianne A.; Jin, Jian; Fushing, Hsieh; Mccowan, Brenda

2015-01-01

Social stability in group-living animals is an emergent property which arises from the interaction amongst multiple behavioral networks. However, pinpointing when a social group is at risk of collapse is difficult. We used a joint network modeling approach to examine the interdependencies between two behavioral networks, aggression and status signaling, from four stable and three unstable groups of rhesus macaques in order to identify characteristic patterns of network interdependence in stable groups that are readily distinguishable from unstable groups. Our results showed that the most prominent source of aggression-status network interdependence in stable social groups came from more frequent dyads than expected with opposite direction status-aggression (i.e. A threatens B and B signals acceptance of subordinate status). In contrast, unstable groups showed a decrease in opposite direction aggression-status dyads (but remained higher than expected) as well as more frequent than expected dyads with bidirectional aggression. These results demonstrate that not only was the stable joint relationship between aggression and status networks readily distinguishable from unstable time points, social instability manifested in at least two different ways. In sum, our joint modeling approach may prove useful in quantifying and monitoring the complex social dynamics of any wild or captive social system, as all social systems are composed of multiple interconnected networks PMID:26052339

Interdependence and dynamics of essential services in an extensive risk context: a case study in Montserrat, West Indies

NASA Astrophysics Data System (ADS)

Sword-Daniels, V. L.; Rossetto, T.; Wilson, T. M.; Sargeant, S.

2015-05-01

The essential services that support urban living are complex and interdependent, and their disruption in disasters directly affects society. Yet there are few empirical studies to inform our understanding of the vulnerabilities and resilience of complex infrastructure systems in disasters. This research takes a systems thinking approach to explore the dynamic behaviour of a network of essential services, in the presence and absence of volcanic ashfall hazards in Montserrat, West Indies. Adopting a case study methodology and qualitative methods to gather empirical data, we centre the study on the healthcare system and its interconnected network of essential services. We identify different types of relationship between sectors and develop a new interdependence classification system for analysis. Relationships are further categorised by hazard conditions, for use in extensive risk contexts. During heightened volcanic activity, relationships between systems transform in both number and type: connections increase across the network by 41%, and adapt to increase cooperation and information sharing. Interconnections add capacities to the network, increasing the resilience of prioritised sectors. This in-depth and context-specific approach provides a new methodology for studying the dynamics of infrastructure interdependence in an extensive risk context, and can be adapted for use in other hazard contexts.

Interdependence and dynamics of essential services in an extensive risk context: a case study in Montserrat, West Indies

NASA Astrophysics Data System (ADS)

Sword-Daniels, V. L.; Rossetto, T.; Wilson, T. M.; Sargeant, S.

2015-02-01

The essential services that support urban living are complex and interdependent, and their disruption in disasters directly affects society. Yet there are few empirical studies to inform our understanding of the vulnerabilities and resilience of complex infrastructure systems in disasters. This research takes a systems thinking approach to explore the dynamic behaviour of a network of essential services, in the presence and absence of volcanic ashfall hazards in Montserrat, West Indies. Adopting a case study methodology and qualitative methods to gather empirical data we centre the study on the healthcare system and its interconnected network of essential services. We identify different types of relationship between sectors and develop a new interdependence classification system for analysis. Relationships are further categorised by hazard condition, for use in extensive risk contexts. During heightened volcanic activity, relationships between systems transform in both number and type: connections increase across the network by 41%, and adapt to increase cooperation and information sharing. Interconnections add capacities to the network, increasing the resilience of prioritised sectors. This in-depth and context-specific approach provides a new methodology for studying the dynamics of infrastructure interdependence in an extensive risk context, and can be adapted for use in other hazard contexts.

Dynamics and causalities of atmospheric and oceanic data identified by complex networks and Granger causality analysis

NASA Astrophysics Data System (ADS)

Charakopoulos, A. K.; Katsouli, G. A.; Karakasidis, T. E.

2018-04-01

Understanding the underlying processes and extracting detailed characteristics of spatiotemporal dynamics of ocean and atmosphere as well as their interaction is of significant interest and has not been well thoroughly established. The purpose of this study was to examine the performance of two main additional methodologies for the identification of spatiotemporal underlying dynamic characteristics and patterns among atmospheric and oceanic variables from Seawatch buoys from Aegean and Ionian Sea, provided by the Hellenic Center for Marine Research (HCMR). The first approach involves the estimation of cross correlation analysis in an attempt to investigate time-lagged relationships, and further in order to identify the direction of interactions between the variables we performed the Granger causality method. According to the second approach the time series are converted into complex networks and then the main topological network properties such as degree distribution, average path length, diameter, modularity and clustering coefficient are evaluated. Our results show that the proposed analysis of complex network analysis of time series can lead to the extraction of hidden spatiotemporal characteristics. Also our findings indicate high level of positive and negative correlations and causalities among variables, both from the same buoy and also between buoys from different stations, which cannot be determined from the use of simple statistical measures.

Tight Coupling of Astrocyte pH Dynamics to Epileptiform Activity Revealed by Genetically Encoded pH Sensors.

PubMed

Raimondo, Joseph V; Tomes, Hayley; Irkle, Agnese; Kay, Louise; Kellaway, Lauriston; Markram, Henry; Millar, Robert P; Akerman, Colin J

2016-06-29

Astrocytes can both sense and shape the evolution of neuronal network activity and are known to possess unique ion regulatory mechanisms. Here we explore the relationship between astrocytic intracellular pH dynamics and the synchronous network activity that occurs during seizure-like activity. By combining confocal and two-photon imaging of genetically encoded pH reporters with simultaneous electrophysiological recordings, we perform pH measurements in defined cell populations and relate these to ongoing network activity. This approach reveals marked differences in the intracellular pH dynamics between hippocampal astrocytes and neighboring pyramidal neurons in rodent in vitro models of epilepsy. With three different genetically encoded pH reporters, astrocytes are observed to alkalinize during epileptiform activity, whereas neurons are observed to acidify. In addition to the direction of pH change, the kinetics of epileptiform-associated intracellular pH transients are found to differ between the two cell types, with astrocytes displaying significantly more rapid changes in pH. The astrocytic alkalinization is shown to be highly correlated with astrocytic membrane potential changes during seizure-like events and mediated by an electrogenic Na(+)/HCO3 (-) cotransporter. Finally, comparisons across different cell-pair combinations reveal that astrocytic pH dynamics are more closely related to network activity than are neuronal pH dynamics. This work demonstrates that astrocytes exhibit distinct pH dynamics during periods of epileptiform activity, which has relevance to multiple processes including neurometabolic coupling and the control of network excitability. Dynamic changes in intracellular ion concentrations are central to the initiation and progression of epileptic seizures. However, it is not known how changes in intracellular H(+) concentration (ie, pH) differ between different cell types during seizures. Using recently developed pH-sensitive proteins, we demonstrate that astrocytes undergo rapid alkalinization during periods of seizure-like activity, which is in stark contrast to the acidification that occurs in neighboring neurons. Rapid astrocytic pH changes are highly temporally correlated with seizure activity, are mediated by an electrogenic Na(+)/HCO3- cotransporter, and are more tightly coupled to network activity than are neuronal pH changes. As pH has profound effects on signaling in the nervous system, this work has implications for our understanding of seizure dynamics. Copyright © 2016 the authors 0270-6474/16/367002-12$15.00/0.

Watershed geomorphological characteristics

USGS Publications Warehouse

Fitzpatrick, Faith A.

2016-01-01

This chapter describes commonly used geomorphological characteristics that are useful for analyzing watershed-scale hydrology and sediment dynamics. It includes calculations and measurements for stream network features and areal basin characteristics that cover a range of spatial and temporal scales and dimensions of watersheds. Construction and application of longitudinal profiles are described in terms of understanding the three-dimensional development of stream networks. A brief discussion of outstanding problems and directions for future work, particularly as they relate to water-resources management, is provided. Notations with preferred units are given.

Robustness of Oscillatory Behavior in Correlated Networks

PubMed Central

Sasai, Takeyuki; Morino, Kai; Tanaka, Gouhei; Almendral, Juan A.; Aihara, Kazuyuki

2015-01-01

Understanding network robustness against failures of network units is useful for preventing large-scale breakdowns and damages in real-world networked systems. The tolerance of networked systems whose functions are maintained by collective dynamical behavior of the network units has recently been analyzed in the framework called dynamical robustness of complex networks. The effect of network structure on the dynamical robustness has been examined with various types of network topology, but the role of network assortativity, or degree–degree correlations, is still unclear. Here we study the dynamical robustness of correlated (assortative and disassortative) networks consisting of diffusively coupled oscillators. Numerical analyses for the correlated networks with Poisson and power-law degree distributions show that network assortativity enhances the dynamical robustness of the oscillator networks but the impact of network disassortativity depends on the detailed network connectivity. Furthermore, we theoretically analyze the dynamical robustness of correlated bimodal networks with two-peak degree distributions and show the positive impact of the network assortativity. PMID:25894574

Dynamics of Fractal Cluster Gels with Embedded Active Colloids

NASA Astrophysics Data System (ADS)

Szakasits, Megan E.; Zhang, Wenxuan; Solomon, Michael J.

2017-08-01

We find that embedded active colloids increase the ensemble-averaged mean squared displacement of particles in otherwise passively fluctuating fractal cluster gels. The enhancement in dynamics occurs by a mechanism in which the active colloids contribute to the average dynamics both directly through their own active motion and indirectly through their excitation of neighboring passive colloids in the fractal network. Fractal cluster gels are synthesized by addition of magnesium chloride to an initially stable suspension of 1.0 μ m polystyrene colloids in which a dilute concentration of platinum coated Janus colloids has been dispersed. The Janus colloids are thereby incorporated into the fractal network. We measure the ensemble-averaged mean squared displacement of all colloids in the gel before and after the addition of hydrogen peroxide, a fuel that drives diffusiophoretic motion of the Janus particles. The gel mean squared displacement increases by up to a factor of 3 for an active to passive particle ratio of 1 ∶20 and inputted active energy—defined based on the hydrogen peroxide's effect on colloid swim speed and run length—that is up to 9.5 times thermal energy, on a per particle basis. We model the enhancement in gel particle dynamics as the sum of a direct contribution from the displacement of the Janus particles themselves and an indirect contribution from the strain field that the active colloids induce in the surrounding passive particles.

Modeling and analyzing malware propagation in social networks with heterogeneous infection rates

NASA Astrophysics Data System (ADS)

Jia, Peng; Liu, Jiayong; Fang, Yong; Liu, Liang; Liu, Luping

2018-10-01

With the rapid development of social networks, hackers begin to try to spread malware more widely by utilizing various kinds of social networks. Thus, studying malware epidemic dynamics in these networks is becoming a popular subject in the literature. Most of the previous works focus on the effects of factors, such as network topology and user behavior, on malware propagation. Some researchers try to analyze the heterogeneity of infection rates, but the common problem of their works is the factors they mentioned that could affect the heterogeneity are not comprehensive enough. In this paper, focusing on the effects of heterogeneous infection rates, we propose a novel model called HSID (heterogeneous-susceptible-infectious-dormant model) to characterize virus propagation in social networks, in which a connection factor is presented to evaluate the heterogeneous relationships between nodes, and a resistance factor is introduced to represent node's mutable resistant ability. We analyzed how key parameters in the two factors affect the heterogeneity and then performed simulations to explore the effects in three real-world social networks. The results indicate: heterogeneous relationship could lead to wider diffusion in directed network, and heterogeneous security awareness could lead to wider diffusion in both directed and undirected networks; heterogeneous relationship could restrain the outbreak of malware but heterogeneous initial security awareness would increase the probability; furthermore, the increasing resistibility along with infected times would lead to malware's disappearance in social networks.

An Assessment of Direct and Indirect Economic Losses of Climatic Extreme Events

NASA Astrophysics Data System (ADS)

Otto, C.; Willner, S. N.; Wenz, L.; Levermann, A.

2015-12-01

Risk of extreme weather events like storms, heat extremes, and floods has already risen due to anthropogenic climate change and is likely to increase further under future global warming. Additionally, the structure of the global economy has changed importantly in the last decades. In the process of globalization, local economies have become more and more interwoven forming a complex network. Together with a trend towards lean production, this has resulted in a strong dependency of local manufacturers on global supply and value added chains, which may render the economic network more vulnerable to climatic extremes; outages of local manufacturers trigger indirect losses, which spread along supply chains and can even outstrip direct losses. Accordingly, in a comprehensive climate risk assessment these inter-linkages should be considered. Here, we present acclimate, an agent based dynamic damage propagation model. Its agents are production and consumption sites, which are interlinked by economic flows accounting for the complexity as well as the heterogeneity of the global supply network. Assessing the economic response on the timescale of the adverse event, the model permits to study temporal and spatial evolution of indirect production losses during the disaster and in the subsequent recovery phase of the economy. In this study, we focus on the dynamic economic resilience defined here as the ratio of direct to total losses. This implies that the resilience of the system under consideration is low if the high indirect losses are high. We find and assess a nonlinear dependence of the resilience on the disaster size. Further, we analyze the influence of the network structure upon resilience and discuss the potential of warehousing as an adaptation option.

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

NASA Astrophysics Data System (ADS)

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

2017-12-01

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

Event-Triggered Distributed Average Consensus Over Directed Digital Networks With Limited Communication Bandwidth.

PubMed

Li, Huaqing; Chen, Guo; Huang, Tingwen; Dong, Zhaoyang; Zhu, Wei; Gao, Lan

2016-12-01

In this paper, we consider the event-triggered distributed average-consensus of discrete-time first-order multiagent systems with limited communication data rate and general directed network topology. In the framework of digital communication network, each agent has a real-valued state but can only exchange finite-bit binary symbolic data sequence with its neighborhood agents at each time step due to the digital communication channels with energy constraints. Novel event-triggered dynamic encoder and decoder for each agent are designed, based on which a distributed control algorithm is proposed. A scheme that selects the number of channel quantization level (number of bits) at each time step is developed, under which all the quantizers in the network are never saturated. The convergence rate of consensus is explicitly characterized, which is related to the scale of network, the maximum degree of nodes, the network structure, the scaling function, the quantization interval, the initial states of agents, the control gain and the event gain. It is also found that under the designed event-triggered protocol, by selecting suitable parameters, for any directed digital network containing a spanning tree, the distributed average consensus can be always achieved with an exponential convergence rate based on merely one bit information exchange between each pair of adjacent agents at each time step. Two simulation examples are provided to illustrate the feasibility of presented protocol and the correctness of the theoretical results.

The relevance of network micro-structure for neural dynamics.

PubMed

Pernice, Volker; Deger, Moritz; Cardanobile, Stefano; Rotter, Stefan

2013-01-01

The activity of cortical neurons is determined by the input they receive from presynaptic neurons. Many previous studies have investigated how specific aspects of the statistics of the input affect the spike trains of single neurons and neurons in recurrent networks. However, typically very simple random network models are considered in such studies. Here we use a recently developed algorithm to construct networks based on a quasi-fractal probability measure which are much more variable than commonly used network models, and which therefore promise to sample the space of recurrent networks in a more exhaustive fashion than previously possible. We use the generated graphs as the underlying network topology in simulations of networks of integrate-and-fire neurons in an asynchronous and irregular state. Based on an extensive dataset of networks and neuronal simulations we assess statistical relations between features of the network structure and the spiking activity. Our results highlight the strong influence that some details of the network structure have on the activity dynamics of both single neurons and populations, even if some global network parameters are kept fixed. We observe specific and consistent relations between activity characteristics like spike-train irregularity or correlations and network properties, for example the distributions of the numbers of in- and outgoing connections or clustering. Exploiting these relations, we demonstrate that it is possible to estimate structural characteristics of the network from activity data. We also assess higher order correlations of spiking activity in the various networks considered here, and find that their occurrence strongly depends on the network structure. These results provide directions for further theoretical studies on recurrent networks, as well as new ways to interpret spike train recordings from neural circuits.

Sparse networks of directly coupled, polymorphic, and functional side chains in allosteric proteins.

PubMed

Soltan Ghoraie, Laleh; Burkowski, Forbes; Zhu, Mu

2015-03-01

Recent studies have highlighted the role of coupled side-chain fluctuations alone in the allosteric behavior of proteins. Moreover, examination of X-ray crystallography data has recently revealed new information about the prevalence of alternate side-chain conformations (conformational polymorphism), and attempts have been made to uncover the hidden alternate conformations from X-ray data. Hence, new computational approaches are required that consider the polymorphic nature of the side chains, and incorporate the effects of this phenomenon in the study of information transmission and functional interactions of residues in a molecule. These studies can provide a more accurate understanding of the allosteric behavior. In this article, we first present a novel approach to generate an ensemble of conformations and an efficient computational method to extract direct couplings of side chains in allosteric proteins, and provide sparse network representations of the couplings. We take the side-chain conformational polymorphism into account, and show that by studying the intrinsic dynamics of an inactive structure, we are able to construct a network of functionally crucial residues. Second, we show that the proposed method is capable of providing a magnified view of the coupled and conformationally polymorphic residues. This model reveals couplings between the alternate conformations of a coupled residue pair. To the best of our knowledge, this is the first computational method for extracting networks of side chains' alternate conformations. Such networks help in providing a detailed image of side-chain dynamics in functionally important and conformationally polymorphic sites, such as binding and/or allosteric sites. © 2014 Wiley Periodicals, Inc.

Discovery of Intramolecular Signal Transduction Network Based on a New Protein Dynamics Model of Energy Dissipation

PubMed Central

Ma, Cheng-Wei; Xiu, Zhi-Long; Zeng, An-Ping

2012-01-01

A novel approach to reveal intramolecular signal transduction network is proposed in this work. To this end, a new algorithm of network construction is developed, which is based on a new protein dynamics model of energy dissipation. A key feature of this approach is that direction information is specified after inferring protein residue-residue interaction network involved in the process of signal transduction. This enables fundamental analysis of the regulation hierarchy and identification of regulation hubs of the signaling network. A well-studied allosteric enzyme, E. coli aspartokinase III, is used as a model system to demonstrate the new method. Comparison with experimental results shows that the new approach is able to predict all the sites that have been experimentally proved to desensitize allosteric regulation of the enzyme. In addition, the signal transduction network shows a clear preference for specific structural regions, secondary structural types and residue conservation. Occurrence of super-hubs in the network indicates that allosteric regulation tends to gather residues with high connection ability to collectively facilitate the signaling process. Furthermore, a new parameter of propagation coefficient is defined to determine the propagation capability of residues within a signal transduction network. In conclusion, the new approach is useful for fundamental understanding of the process of intramolecular signal transduction and thus has significant impact on rational design of novel allosteric proteins. PMID:22363664

Effects of Four Different Regulatory Mechanisms on the Dynamics of Gene Regulatory Cascades

NASA Astrophysics Data System (ADS)

Hansen, Sabine; Krishna, Sandeep; Semsey, Szabolcs; Lo Svenningsen, Sine

2015-07-01

Gene regulatory cascades (GRCs) are common motifs in cellular molecular networks. A given logical function in these cascades, such as the repression of the activity of a transcription factor, can be implemented by a number of different regulatory mechanisms. The potential consequences for the dynamic performance of the GRC of choosing one mechanism over another have not been analysed systematically. Here, we report the construction of a synthetic GRC in Escherichia coli, which allows us for the first time to directly compare and contrast the dynamics of four different regulatory mechanisms, affecting the transcription, translation, stability, or activity of a transcriptional repressor. We developed a biologically motivated mathematical model which is sufficient to reproduce the response dynamics determined by experimental measurements. Using the model, we explored the potential response dynamics that the constructed GRC can perform. We conclude that dynamic differences between regulatory mechanisms at an individual step in a GRC are often concealed in the overall performance of the GRC, and suggest that the presence of a given regulatory mechanism in a certain network environment does not necessarily mean that it represents a single optimal evolutionary solution.

The Ribosome Shape Directs mRNA Translocation through Entrance and Exit Dynamics

USDA-ARS?s Scientific Manuscript database

The protein-synthesizing ribosome undergoes large motions to effect the translocation of tRNAs (transfer ribonucleic acids) and mRNA (messenger ribonucleic acid); here the domain motions of this system are explored with a coarse-grained elastic network model using normal mode analysis. Crystal struc...

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

Efficient spiking neural network model of pattern motion selectivity in visual cortex.

PubMed

Beyeler, Michael; Richert, Micah; Dutt, Nikil D; Krichmar, Jeffrey L

2014-07-01

Simulating large-scale models of biological motion perception is challenging, due to the required memory to store the network structure and the computational power needed to quickly solve the neuronal dynamics. A low-cost yet high-performance approach to simulating large-scale neural network models in real-time is to leverage the parallel processing capability of graphics processing units (GPUs). Based on this approach, we present a two-stage model of visual area MT that we believe to be the first large-scale spiking network to demonstrate pattern direction selectivity. In this model, component-direction-selective (CDS) cells in MT linearly combine inputs from V1 cells that have spatiotemporal receptive fields according to the motion energy model of Simoncelli and Heeger. Pattern-direction-selective (PDS) cells in MT are constructed by pooling over MT CDS cells with a wide range of preferred directions. Responses of our model neurons are comparable to electrophysiological results for grating and plaid stimuli as well as speed tuning. The behavioral response of the network in a motion discrimination task is in agreement with psychophysical data. Moreover, our implementation outperforms a previous implementation of the motion energy model by orders of magnitude in terms of computational speed and memory usage. The full network, which comprises 153,216 neurons and approximately 40 million synapses, processes 20 frames per second of a 40 × 40 input video in real-time using a single off-the-shelf GPU. To promote the use of this algorithm among neuroscientists and computer vision researchers, the source code for the simulator, the network, and analysis scripts are publicly available.

Flow-Based Network Analysis of the Caenorhabditis elegans Connectome

PubMed Central

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

2016-01-01

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

Fractional lattice charge transport

NASA Astrophysics Data System (ADS)

Flach, Sergej; Khomeriki, Ramaz

2017-01-01

We consider the dynamics of noninteracting quantum particles on a square lattice in the presence of a magnetic flux α and a dc electric field E oriented along the lattice diagonal. In general, the adiabatic dynamics will be characterized by Bloch oscillations in the electrical field direction and dispersive ballistic transport in the perpendicular direction. For rational values of α and a corresponding discrete set of values of E(α) vanishing gaps in the spectrum induce a fractionalization of the charge in the perpendicular direction - while left movers are still performing dispersive ballistic transport, the complementary fraction of right movers is propagating in a dispersionless relativistic manner in the opposite direction. Generalizations and the possible probing of the effect with atomic Bose-Einstein condensates and photonic networks are discussed. Zak phase of respective band associated with gap closing regime has been computed and it is found converging to π/2 value.

Adaptative synchronization in multi-output fractional-order complex dynamical networks and secure communications

NASA Astrophysics Data System (ADS)

Mata-Machuca, Juan L.; Aguilar-López, Ricardo

2018-01-01

This work deals with the adaptative synchronization of complex dynamical networks with fractional-order nodes and its application in secure communications employing chaotic parameter modulation. The complex network is composed of multiple fractional-order systems with mismatch parameters and the coupling functions are given to realize the network synchronization. We introduce a fractional algebraic synchronizability condition (FASC) and a fractional algebraic identifiability condition (FAIC) which are used to know if the synchronization and parameters estimation problems can be solved. To overcome these problems, an adaptative synchronization methodology is designed; the strategy consists in proposing multiple receiver systems which tend to follow asymptotically the uncertain transmitters systems. The coupling functions and parameters of the receiver systems are adjusted continually according to a convenient sigmoid-like adaptative controller (SLAC), until the measurable output errors converge to zero, hence, synchronization between transmitter and receivers is achieved and message signals are recovered. Indeed, the stability analysis of the synchronization error is based on the fractional Lyapunov direct method. Finally, numerical results corroborate the satisfactory performance of the proposed scheme by means of the synchronization of a complex network consisting of several fractional-order unified chaotic systems.

Competitive diffusion in online social networks with heterogeneous users

NASA Astrophysics Data System (ADS)

Li, Pei; He, Su; Wang, Hui; Zhang, Xin

2014-06-01

Online social networks have attracted increasing attention since they provide various approaches for hundreds of millions of people to stay connected with their friends. However, most research on diffusion dynamics in epidemiology cannot be applied directly to characterize online social networks, where users are heterogeneous and may act differently according to their standpoints. In this paper, we propose models to characterize the competitive diffusion in online social networks with heterogeneous users. We classify messages into two types (i.e., positive and negative) and users into three types (i.e., positive, negative and neutral). We estimate the positive (negative) influence for a user generating a given type message, which is the number of times that positive (negative) messages are processed (i.e., read) incurred by this action. We then consider the diffusion threshold, above which the corresponding influence will approach infinity, and the effect threshold, above which the unexpected influence of generating a message will exceed the expected one. We verify all these results by simulations, which show the analysis results are perfectly consistent with the simulation results. These results are of importance in understanding the diffusion dynamics in online social networks, and also critical for advertisers in viral marketing where there are fans, haters and neutrals.

Electronic neural network for dynamic resource allocation

NASA Technical Reports Server (NTRS)

Thakoor, A. P.; Eberhardt, S. P.; Daud, T.

1991-01-01

A VLSI implementable neural network architecture for dynamic assignment is presented. The resource allocation problems involve assigning members of one set (e.g. resources) to those of another (e.g. consumers) such that the global 'cost' of the associations is minimized. The network consists of a matrix of sigmoidal processing elements (neurons), where the rows of the matrix represent resources and columns represent consumers. Unlike previous neural implementations, however, association costs are applied directly to the neurons, reducing connectivity of the network to VLSI-compatible 0 (number of neurons). Each row (and column) has an additional neuron associated with it to independently oversee activations of all the neurons in each row (and each column), providing a programmable 'k-winner-take-all' function. This function simultaneously enforces blocking (excitatory/inhibitory) constraints during convergence to control the number of active elements in each row and column within desired boundary conditions. Simulations show that the network, when implemented in fully parallel VLSI hardware, offers optimal (or near-optimal) solutions within only a fraction of a millisecond, for problems up to 128 resources and 128 consumers, orders of magnitude faster than conventional computing or heuristic search methods.

MapReduce Based Parallel Bayesian Network for Manufacturing Quality Control

NASA Astrophysics Data System (ADS)

Zheng, Mao-Kuan; Ming, Xin-Guo; Zhang, Xian-Yu; Li, Guo-Ming

2017-09-01

Increasing complexity of industrial products and manufacturing processes have challenged conventional statistics based quality management approaches in the circumstances of dynamic production. A Bayesian network and big data analytics integrated approach for manufacturing process quality analysis and control is proposed. Based on Hadoop distributed architecture and MapReduce parallel computing model, big volume and variety quality related data generated during the manufacturing process could be dealt with. Artificial intelligent algorithms, including Bayesian network learning, classification and reasoning, are embedded into the Reduce process. Relying on the ability of the Bayesian network in dealing with dynamic and uncertain problem and the parallel computing power of MapReduce, Bayesian network of impact factors on quality are built based on prior probability distribution and modified with posterior probability distribution. A case study on hull segment manufacturing precision management for ship and offshore platform building shows that computing speed accelerates almost directly proportionally to the increase of computing nodes. It is also proved that the proposed model is feasible for locating and reasoning of root causes, forecasting of manufacturing outcome, and intelligent decision for precision problem solving. The integration of bigdata analytics and BN method offers a whole new perspective in manufacturing quality control.

Anharmonic Normal Mode Analysis of Elastic Network Model Improves the Modeling of Atomic Fluctuations in Protein Crystal Structures

PubMed Central

Zheng, Wenjun

2010-01-01

Abstract Protein conformational dynamics, despite its significant anharmonicity, has been widely explored by normal mode analysis (NMA) based on atomic or coarse-grained potential functions. To account for the anharmonic aspects of protein dynamics, this study proposes, and has performed, an anharmonic NMA (ANMA) based on the Cα-only elastic network models, which assume elastic interactions between pairs of residues whose Cα atoms or heavy atoms are within a cutoff distance. The key step of ANMA is to sample an anharmonic potential function along the directions of eigenvectors of the lowest normal modes to determine the mean-squared fluctuations along these directions. ANMA was evaluated based on the modeling of anisotropic displacement parameters (ADPs) from a list of 83 high-resolution protein crystal structures. Significant improvement was found in the modeling of ADPs by ANMA compared with standard NMA. Further improvement in the modeling of ADPs is attained if the interactions between a protein and its crystalline environment are taken into account. In addition, this study has determined the optimal cutoff distances for ADP modeling based on elastic network models, and these agree well with the peaks of the statistical distributions of distances between Cα atoms or heavy atoms derived from a large set of protein crystal structures. PMID:20550915

Integrating atomistic molecular dynamics simulations, experiments, and network analysis to study protein dynamics: strength in unity.

PubMed

Papaleo, Elena

2015-01-01

In the last years, we have been observing remarkable improvements in the field of protein dynamics. Indeed, we can now study protein dynamics in atomistic details over several timescales with a rich portfolio of experimental and computational techniques. On one side, this provides us with the possibility to validate simulation methods and physical models against a broad range of experimental observables. On the other side, it also allows a complementary and comprehensive view on protein structure and dynamics. What is needed now is a better understanding of the link between the dynamic properties that we observe and the functional properties of these important cellular machines. To make progresses in this direction, we need to improve the physical models used to describe proteins and solvent in molecular dynamics, as well as to strengthen the integration of experiments and simulations to overcome their own limitations. Moreover, now that we have the means to study protein dynamics in great details, we need new tools to understand the information embedded in the protein ensembles and in their dynamic signature. With this aim in mind, we should enrich the current tools for analysis of biomolecular simulations with attention to the effects that can be propagated over long distances and are often associated to important biological functions. In this context, approaches inspired by network analysis can make an important contribution to the analysis of molecular dynamics simulations.

GrDHP: a general utility function representation for dual heuristic dynamic programming.

PubMed

Ni, Zhen; He, Haibo; Zhao, Dongbin; Xu, Xin; Prokhorov, Danil V

2015-03-01

A general utility function representation is proposed to provide the required derivable and adjustable utility function for the dual heuristic dynamic programming (DHP) design. Goal representation DHP (GrDHP) is presented with a goal network being on top of the traditional DHP design. This goal network provides a general mapping between the system states and the derivatives of the utility function. With this proposed architecture, we can obtain the required derivatives of the utility function directly from the goal network. In addition, instead of a fixed predefined utility function in literature, we conduct an online learning process for the goal network so that the derivatives of the utility function can be adaptively tuned over time. We provide the control performance of both the proposed GrDHP and the traditional DHP approaches under the same environment and parameter settings. The statistical simulation results and the snapshot of the system variables are presented to demonstrate the improved learning and controlling performance. We also apply both approaches to a power system example to further demonstrate the control capabilities of the GrDHP approach.

Resting state brain dynamics and its transients: a combined TMS-EEG study.

PubMed

Bonnard, Mireille; Chen, Sophie; Gaychet, Jérôme; Carrere, Marcel; Woodman, Marmaduke; Giusiano, Bernard; Jirsa, Viktor

2016-08-04

The brain at rest exhibits a spatio-temporally rich dynamics which adheres to systematic behaviours that persist in task paradigms but appear altered in disease. Despite this hypothesis, many rest state paradigms do not act directly upon the rest state and therefore cannot confirm hypotheses about its mechanisms. To address this challenge, we combined transcranial magnetic stimulation (TMS) and electroencephalography (EEG) to study brain's relaxation toward rest following a transient perturbation. Specifically, TMS targeted either the medial prefrontal cortex (MPFC), i.e. part of the Default Mode Network (DMN) or the superior parietal lobule (SPL), involved in the Dorsal Attention Network. TMS was triggered by a given brain state, namely an increase in occipital alpha rhythm power. Following the initial TMS-Evoked Potential, TMS at MPFC enhances the induced occipital alpha rhythm, called Event Related Synchronisation, with a longer transient lifetime than TMS at SPL, and a higher amplitude. Our findings show a strong coupling between MPFC and the occipital alpha power. Although the rest state is organized around a core of resting state networks, the DMN functionally takes a special role among these resting state networks.

A continually online-trained neural network controller for brushless DC motor drives

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

Rubaai, A.; Kotaru, R.; Kankam, M.D.

2000-04-01

In this paper, a high-performance controller with simultaneous online identification and control is designed for brushless dc motor drives. The dynamics of the motor/load are modeled online, and controlled using two different neural network based identification and control schemes, as the system is in operation. In the first scheme, an attempt is made to control the rotor angular speed, utilizing a single three-hidden-layer network. The second scheme attempts to control the stator currents, using a predetermined control law as a function of the estimated states. This schemes incorporates three multilayered feedforward neural networks that are online trained, using the Levenburg-Marquadtmore » training algorithm. The control of the direct and quadrature components of the stator current successfully tracked a wide variety of trajectories after relatively short online training periods. The control strategy adapts to the uncertainties of the motor/load dynamics and, in addition, learns their inherent nonlinearities. Simulation results illustrated that a neurocontroller used in conjunction with adaptive control schemes can result in a flexible control device which may be utilized in a wide range of environments.« less

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.

Diversified Control Paths: A Significant Way Disease Genes Perturb the Human Regulatory Network

PubMed Central

Wang, Bingbo; Gao, Lin; Zhang, Qingfang; Li, Aimin; Deng, Yue; Guo, Xingli

2015-01-01

Background The complexity of biological systems motivates us to use the underlying networks to provide deep understanding of disease etiology and the human diseases are viewed as perturbations of dynamic properties of networks. Control theory that deals with dynamic systems has been successfully used to capture systems-level knowledge in large amount of quantitative biological interactions. But from the perspective of system control, the ways by which multiple genetic factors jointly perturb a disease phenotype still remain. Results In this work, we combine tools from control theory and network science to address the diversified control paths in complex networks. Then the ways by which the disease genes perturb biological systems are identified and quantified by the control paths in a human regulatory network. Furthermore, as an application, prioritization of candidate genes is presented by use of control path analysis and gene ontology annotation for definition of similarities. We use leave-one-out cross-validation to evaluate the ability of finding the gene-disease relationship. Results have shown compatible performance with previous sophisticated works, especially in directed systems. Conclusions Our results inspire a deeper understanding of molecular mechanisms that drive pathological processes. Diversified control paths offer a basis for integrated intervention techniques which will ultimately lead to the development of novel therapeutic strategies. PMID:26284649

Optimal occlusion uniformly partitions red blood cells fluxes within a microvascular network

PubMed Central

Tu, Shenyinying; Liu, Yu-Hsiu; Savage, Van M.; Hsiai, Tzung K.; Roper, Marcus

2017-01-01

In animals, gas exchange between blood and tissues occurs in narrow vessels, whose diameter is comparable to that of a red blood cell. Red blood cells must deform to squeeze through these narrow vessels, transiently blocking or occluding the vessels they pass through. Although the dynamics of vessel occlusion have been studied extensively, it remains an open question why microvessels need to be so narrow. We study occlusive dynamics within a model microvascular network: the embryonic zebrafish trunk. We show that pressure feedbacks created when red blood cells enter the finest vessels of the trunk act together to uniformly partition red blood cells through the microvasculature. Using mathematical models as well as direct observation, we show that these occlusive feedbacks are tuned throughout the trunk network to prevent the vessels closest to the heart from short-circuiting the network. Thus occlusion is linked with another open question of microvascular function: how are red blood cells delivered at the same rate to each micro-vessel? Our analysis shows that tuning of occlusive feedbacks increase the total dissipation within the network by a factor of 11, showing that uniformity of flows rather than minimization of transport costs may be prioritized by the microvascular network. PMID:29244812

Identifying highly connected counties compensates for resource limitations when evaluating national spread of an invasive pathogen.

PubMed

Sutrave, Sweta; Scoglio, Caterina; Isard, Scott A; Hutchinson, J M Shawn; Garrett, Karen A

2012-01-01

Surveying invasive species can be highly resource intensive, yet near-real-time evaluations of invasion progress are important resources for management planning. In the case of the soybean rust invasion of the United States, a linked monitoring, prediction, and communication network saved U.S. soybean growers approximately $200 M/yr. Modeling of future movement of the pathogen (Phakopsora pachyrhizi) was based on data about current disease locations from an extensive network of sentinel plots. We developed a dynamic network model for U.S. soybean rust epidemics, with counties as nodes and link weights a function of host hectarage and wind speed and direction. We used the network model to compare four strategies for selecting an optimal subset of sentinel plots, listed here in order of increasing performance: random selection, zonal selection (based on more heavily weighting regions nearer the south, where the pathogen overwinters), frequency-based selection (based on how frequently the county had been infected in the past), and frequency-based selection weighted by the node strength of the sentinel plot in the network model. When dynamic network properties such as node strength are characterized for invasive species, this information can be used to reduce the resources necessary to survey and predict invasion progress.

On controlling networks of limit-cycle oscillators

NASA Astrophysics Data System (ADS)

Skardal, Per Sebastian; Arenas, Alex

2016-09-01

The control of network-coupled nonlinear dynamical systems is an active area of research in the nonlinear science community. Coupled oscillator networks represent a particularly important family of nonlinear systems, with applications ranging from the power grid to cardiac excitation. Here, we study the control of network-coupled limit cycle oscillators, extending the previous work that focused on phase oscillators. Based on stabilizing a target fixed point, our method aims to attain complete frequency synchronization, i.e., consensus, by applying control to as few oscillators as possible. We develop two types of controls. The first type directs oscillators towards larger amplitudes, while the second does not. We present numerical examples of both control types and comment on the potential failures of the method.

Animal Social Network Theory Can Help Wildlife Conservation.

PubMed

Snijders, Lysanne; Blumstein, Daniel T; Stanley, Christina R; Franks, Daniel W

2017-08-01

Many animals preferentially associate with certain other individuals. This social structuring can influence how populations respond to changes to their environment, thus making network analysis a promising technique for understanding, predicting, and potentially manipulating population dynamics. Various network statistics can correlate with individual fitness components and key population-level processes, yet the logical role and formal application of animal social network theory for conservation and management have not been well articulated. We outline how understanding of direct and indirect relationships between animals can be profitably applied by wildlife managers and conservationists. By doing so, we aim to stimulate the development and implementation of practical tools for wildlife conservation and management and to inspire novel behavioral research in this field. Copyright © 2017 Elsevier Ltd. All rights reserved.

Network analysis shining light on parasite ecology and diversity.

PubMed

Poulin, Robert

2010-10-01

The vast number of species making up natural communities, and the myriad interactions among them, pose great difficulties for the study of community structure, dynamics and stability. Borrowed from other fields, network analysis is making great inroads in community ecology and is only now being applied to host-parasite interactions. It allows a complex system to be examined in its entirety, as opposed to one or a few components at a time. This review explores what network analysis is and how it can be used to investigate parasite ecology. It also summarizes the first findings to emerge from network analyses of host-parasite interactions and identifies promising future directions made possible by this approach. Copyright © 2010 Elsevier Ltd. All rights reserved.

Electron Heat Flux in Pressure Balance Structures at Ulysses

NASA Technical Reports Server (NTRS)

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

2001-01-01

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

Robust Adaptive Synchronization of Ring Configured Uncertain Chaotic FitzHugh–Nagumo Neurons under Direction-Dependent Coupling

PubMed Central

Iqbal, Muhammad; Rehan, Muhammad; Hong, Keum-Shik

2018-01-01

This paper exploits the dynamical modeling, behavior analysis, and synchronization of a network of four different FitzHugh–Nagumo (FHN) neurons with unknown parameters linked in a ring configuration under direction-dependent coupling. The main purpose is to investigate a robust adaptive control law for the synchronization of uncertain and perturbed neurons, communicating in a medium of bidirectional coupling. The neurons are assumed to be different and interconnected in a ring structure. The strength of the gap junctions is taken to be different for each link in the network, owing to the inter-neuronal coupling medium properties. Robust adaptive control mechanism based on Lyapunov stability analysis is employed and theoretical criteria are derived to realize the synchronization of the network of four FHN neurons in a ring form with unknown parameters under direction-dependent coupling and disturbances. The proposed scheme for synchronization of dissimilar neurons, under external electrical stimuli, coupled in a ring communication topology, having all parameters unknown, and subject to directional coupling medium and perturbations, is addressed for the first time as per our knowledge. To demonstrate the efficacy of the proposed strategy, simulation results are provided. PMID:29535622

Applying dynamic Bayesian networks to perturbed gene expression data.

PubMed

Dojer, Norbert; Gambin, Anna; Mizera, Andrzej; Wilczyński, Bartek; Tiuryn, Jerzy

2006-05-08

A central goal of molecular biology is to understand the regulatory mechanisms of gene transcription and protein synthesis. Because of their solid basis in statistics, allowing to deal with the stochastic aspects of gene expressions and noisy measurements in a natural way, Bayesian networks appear attractive in the field of inferring gene interactions structure from microarray experiments data. However, the basic formalism has some disadvantages, e.g. it is sometimes hard to distinguish between the origin and the target of an interaction. Two kinds of microarray experiments yield data particularly rich in information regarding the direction of interactions: time series and perturbation experiments. In order to correctly handle them, the basic formalism must be modified. For example, dynamic Bayesian networks (DBN) apply to time series microarray data. To our knowledge the DBN technique has not been applied in the context of perturbation experiments. We extend the framework of dynamic Bayesian networks in order to incorporate perturbations. Moreover, an exact algorithm for inferring an optimal network is proposed and a discretization method specialized for time series data from perturbation experiments is introduced. We apply our procedure to realistic simulations data. The results are compared with those obtained by standard DBN learning techniques. Moreover, the advantages of using exact learning algorithm instead of heuristic methods are analyzed. We show that the quality of inferred networks dramatically improves when using data from perturbation experiments. We also conclude that the exact algorithm should be used when it is possible, i.e. when considered set of genes is small enough.

LETTER TO THE EDITOR: Dynamics of interacting neural networks

NASA Astrophysics Data System (ADS)

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

2000-04-01

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

Hybrid function projective synchronization in complex dynamical networks

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

Wei, Qiang; Wang, Xing-yuan, E-mail: wangxy@dlut.edu.cn; Hu, Xiao-peng

2014-02-15

This paper investigates hybrid function projective synchronization in complex dynamical networks. When the complex dynamical networks could be synchronized up to an equilibrium or periodic orbit, a hybrid feedback controller is designed to realize the different component of vector of node could be synchronized up to different desired scaling function in complex dynamical networks with time delay. Hybrid function projective synchronization (HFPS) in complex dynamical networks with constant delay and HFPS in complex dynamical networks with time-varying coupling delay are researched, respectively. Finally, the numerical simulations show the effectiveness of theoretical analysis.

Dynamical networks of influence in small group discussions.

PubMed

Moussaïd, Mehdi; Noriega Campero, Alejandro; Almaatouq, Abdullah

2018-01-01

In many domains of life, business and management, numerous problems are addressed by small groups of individuals engaged in face-to-face discussions. While research in social psychology has a long history of studying the determinants of small group performances, the internal dynamics that govern a group discussion are not yet well understood. Here, we rely on computational methods based on network analyses and opinion dynamics to describe how individuals influence each other during a group discussion. We consider the situation in which a small group of three individuals engages in a discussion to solve an estimation task. We propose a model describing how group members gradually influence each other and revise their judgments over the course of the discussion. The main component of the model is an influence network-a weighted, directed graph that determines the extent to which individuals influence each other during the discussion. In simulations, we first study the optimal structure of the influence network that yields the best group performances. Then, we implement a social learning process by which individuals adapt to the past performance of their peers, thereby affecting the structure of the influence network in the long run. We explore the mechanisms underlying the emergence of efficient or maladaptive networks and show that the influence network can converge towards the optimal one, but only when individuals exhibit a social discounting bias by downgrading the relative performances of their peers. Finally, we find a late-speaker effect, whereby individuals who speak later in the discussion are perceived more positively in the long run and are thus more influential. The numerous predictions of the model can serve as a basis for future experiments, and this work opens research on small group discussion to computational social sciences.

Model-Free Reconstruction of Excitatory Neuronal Connectivity from Calcium Imaging Signals

PubMed Central

Stetter, Olav; Battaglia, Demian; Soriano, Jordi; Geisel, Theo

2012-01-01

A systematic assessment of global neural network connectivity through direct electrophysiological assays has remained technically infeasible, even in simpler systems like dissociated neuronal cultures. We introduce an improved algorithmic approach based on Transfer Entropy to reconstruct structural connectivity from network activity monitored through calcium imaging. We focus in this study on the inference of excitatory synaptic links. Based on information theory, our method requires no prior assumptions on the statistics of neuronal firing and neuronal connections. The performance of our algorithm is benchmarked on surrogate time series of calcium fluorescence generated by the simulated dynamics of a network with known ground-truth topology. We find that the functional network topology revealed by Transfer Entropy depends qualitatively on the time-dependent dynamic state of the network (bursting or non-bursting). Thus by conditioning with respect to the global mean activity, we improve the performance of our method. This allows us to focus the analysis to specific dynamical regimes of the network in which the inferred functional connectivity is shaped by monosynaptic excitatory connections, rather than by collective synchrony. Our method can discriminate between actual causal influences between neurons and spurious non-causal correlations due to light scattering artifacts, which inherently affect the quality of fluorescence imaging. Compared to other reconstruction strategies such as cross-correlation or Granger Causality methods, our method based on improved Transfer Entropy is remarkably more accurate. In particular, it provides a good estimation of the excitatory network clustering coefficient, allowing for discrimination between weakly and strongly clustered topologies. Finally, we demonstrate the applicability of our method to analyses of real recordings of in vitro disinhibited cortical cultures where we suggest that excitatory connections are characterized by an elevated level of clustering compared to a random graph (although not extreme) and can be markedly non-local. PMID:22927808

Impaired social brain network for processing dynamic facial expressions in autism spectrum disorders.

PubMed

Sato, Wataru; Toichi, Motomi; Uono, Shota; Kochiyama, Takanori

2012-08-13

Impairment of social interaction via facial expressions represents a core clinical feature of autism spectrum disorders (ASD). However, the neural correlates of this dysfunction remain unidentified. Because this dysfunction is manifested in real-life situations, we hypothesized that the observation of dynamic, compared with static, facial expressions would reveal abnormal brain functioning in individuals with ASD.We presented dynamic and static facial expressions of fear and happiness to individuals with high-functioning ASD and to age- and sex-matched typically developing controls and recorded their brain activities using functional magnetic resonance imaging (fMRI). Regional analysis revealed reduced activation of several brain regions in the ASD group compared with controls in response to dynamic versus static facial expressions, including the middle temporal gyrus (MTG), fusiform gyrus, amygdala, medial prefrontal cortex, and inferior frontal gyrus (IFG). Dynamic causal modeling analyses revealed that bi-directional effective connectivity involving the primary visual cortex-MTG-IFG circuit was enhanced in response to dynamic as compared with static facial expressions in the control group. Group comparisons revealed that all these modulatory effects were weaker in the ASD group than in the control group. These results suggest that weak activity and connectivity of the social brain network underlie the impairment in social interaction involving dynamic facial expressions in individuals with ASD.

Dynamic fair node spectrum allocation for ad hoc networks using random matrices

NASA Astrophysics Data System (ADS)

Rahmes, Mark; Lemieux, George; Chester, Dave; Sonnenberg, Jerry

2015-05-01

Dynamic Spectrum Access (DSA) is widely seen as a solution to the problem of limited spectrum, because of its ability to adapt the operating frequency of a radio. Mobile Ad Hoc Networks (MANETs) can extend high-capacity mobile communications over large areas where fixed and tethered-mobile systems are not available. In one use case with high potential impact, cognitive radio employs spectrum sensing to facilitate the identification of allocated frequencies not currently accessed by their primary users. Primary users own the rights to radiate at a specific frequency and geographic location, while secondary users opportunistically attempt to radiate at a specific frequency when the primary user is not using it. We populate a spatial radio environment map (REM) database with known information that can be leveraged in an ad hoc network to facilitate fair path use of the DSA-discovered links. Utilization of high-resolution geospatial data layers in RF propagation analysis is directly applicable. Random matrix theory (RMT) is useful in simulating network layer usage in nodes by a Wishart adjacency matrix. We use the Dijkstra algorithm for discovering ad hoc network node connection patterns. We present a method for analysts to dynamically allocate node-node path and link resources using fair division. User allocation of limited resources as a function of time must be dynamic and based on system fairness policies. The context of fair means that first available request for an asset is not envied as long as it is not yet allocated or tasked in order to prevent cycling of the system. This solution may also save money by offering a Pareto efficient repeatable process. We use a water fill queue algorithm to include Shapley value marginal contributions for allocation.

A general modeling framework for describing spatially structured population dynamics

USGS Publications Warehouse

Sample, Christine; Fryxell, John; Bieri, Joanna; Federico, Paula; Earl, Julia; Wiederholt, Ruscena; Mattsson, Brady; Flockhart, Tyler; Nicol, Sam; Diffendorfer, James E.; Thogmartin, Wayne E.; Erickson, Richard A.; Norris, D. Ryan

2017-01-01

Variation in movement across time and space fundamentally shapes the abundance and distribution of populations. Although a variety of approaches model structured population dynamics, they are limited to specific types of spatially structured populations and lack a unifying framework. Here, we propose a unified network-based framework sufficiently novel in its flexibility to capture a wide variety of spatiotemporal processes including metapopulations and a range of migratory patterns. It can accommodate different kinds of age structures, forms of population growth, dispersal, nomadism and migration, and alternative life-history strategies. Our objective was to link three general elements common to all spatially structured populations (space, time and movement) under a single mathematical framework. To do this, we adopt a network modeling approach. The spatial structure of a population is represented by a weighted and directed network. Each node and each edge has a set of attributes which vary through time. The dynamics of our network-based population is modeled with discrete time steps. Using both theoretical and real-world examples, we show how common elements recur across species with disparate movement strategies and how they can be combined under a unified mathematical framework. We illustrate how metapopulations, various migratory patterns, and nomadism can be represented with this modeling approach. We also apply our network-based framework to four organisms spanning a wide range of life histories, movement patterns, and carrying capacities. General computer code to implement our framework is provided, which can be applied to almost any spatially structured population. This framework contributes to our theoretical understanding of population dynamics and has practical management applications, including understanding the impact of perturbations on population size, distribution, and movement patterns. By working within a common framework, there is less chance that comparative analyses are colored by model details rather than general principles

International and Domestic Business Cycles as Dynamics of a Network of Networks

NASA Astrophysics Data System (ADS)

Ikeda, Yuichi; Iyetomi, Hiroshi; Aoyama, Hideaki; Yoshikawa, Hiroshi

2014-03-01

Synchronization in business cycles has attracted economists and physicists as self-organization in the time domain. From a different point of view, international and domestic business cycles are also interesting as dynamics of a network of networks or a multi-level network. In this paper, we analyze the Indices of Industrial Production monthly time-series in Japan from January 1988 to December 2007 to develop a deeper understanding of domestic business cycles. The frequency entrainment and the partial phase locking were observed for the 16 sectors to be direct evidence of synchronization. We also showed that the information of the economic shock is carried by the phase time-series. The common shock and individual shocks are separated using phase time-series. The former dominates the economic recession in all of 1992, 1998 and 2001. In addition to the above analysis, we analyze the quarterly GDP time series for Australia, Canada, France, Italy, the United Kingdom, and the United States from Q2 1960 to Q1 2010 in order to clarify its origin. We find frequency entrainment and partial phase locking. Furthermore, a coupled limit-cycle oscillator model is developed to explain the mechanism of synchronization. In this model, the interaction due to international trade is interpreted as the origin of the synchronization. The obtained results suggest that the business cycle may be described as a dynamics of the multi-level coupled oscillators exposed to random individual shocks.

Mathematical model of a gene regulatory network reconciles effects of genetic perturbations on hematopoietic stem cell emergence.

PubMed

Narula, Jatin; Williams, C J; Tiwari, Abhinav; Marks-Bluth, Jonathon; Pimanda, John E; Igoshin, Oleg A

2013-07-15

Interlinked gene regulatory networks (GRNs) are vital for the spatial and temporal control of gene expression during development. The hematopoietic transcription factors (TFs) Scl, Gata2 and Fli1 form one such densely connected GRN which acts as a master regulator of embryonic hematopoiesis. This triad has been shown to direct the specification of the hemogenic endothelium and emergence of hematopoietic stem cells (HSCs) in response to Notch1 and Bmp4-Smad signaling. Here we employ previously published data to construct a mathematical model of this GRN network and use this model to systematically investigate the network dynamical properties. Our model uses a statistical-thermodynamic framework to describe the combinatorial regulation of gene expression and reconciles, mechanistically, several previously published but unexplained results from different genetic perturbation experiments. In particular, our results demonstrate how the interactions of Runx1, an essential hematopoietic TF, with components of the Bmp4 signaling pathway allow it to affect triad activation and acts as a key regulator of HSC emergence. We also explain why heterozygous deletion of this essential TF, Runx1, speeds up the network dynamics leading to accelerated HSC emergence. Taken together our results demonstrate that the triad, a master-level controller of definitive hematopoiesis, is an irreversible bistable switch whose dynamical properties are modulated by Runx1 and components of the Bmp4 signaling pathway. Copyright © 2013 Elsevier Inc. All rights reserved.

Time-dependent Increase in the Network Response to the Stimulation of Neuronal Cell Cultures on Micro-electrode Arrays.

PubMed

Gertz, Monica L; Baker, Zachary; Jose, Sharon; Peixoto, Nathalia

2017-05-29

Micro-electrode arrays (MEAs) can be used to investigate drug toxicity, design paradigms for next-generation personalized medicine, and study network dynamics in neuronal cultures. In contrast with more traditional methods, such as patch-clamping, which can only record activity from a single cell, MEAs can record simultaneously from multiple sites in a network, without requiring the arduous task of placing each electrode individually. Moreover, numerous control and stimulation configurations can be easily applied within the same experimental setup, allowing for a broad range of dynamics to be explored. One of the key dynamics of interest in these in vitro studies has been the extent to which cultured networks display properties indicative of learning. Mouse neuronal cells cultured on MEAs display an increase in response following training induced by electrical stimulation. This protocol demonstrates how to culture neuronal cells on MEAs; successfully record from over 95% of the plated dishes; establish a protocol to train the networks to respond to patterns of stimulation; and sort, plot, and interpret the results from such experiments. The use of a proprietary system for stimulating and recording neuronal cultures is demonstrated. Software packages are also used to sort neuronal units. A custom-designed graphical user interface is used to visualize post-stimulus time histograms, inter-burst intervals, and burst duration, as well as to compare the cellular response to stimulation before and after a training protocol. Finally, representative results and future directions of this research effort are discussed.

Role of topographical defects in organic film growth of 4,4' -biphenyldicarboxylic acid on graphene: A low-energy electron microscopy study

NASA Astrophysics Data System (ADS)

Khokhar, Fawad S.; van Gastel, Raoul; Poelsema, Bene

2010-11-01

We have used low-energy electron microscopy (LEEM) to study the formation of self-assembled molecular networks on graphene sheets. 4,4' -biphenyldicarboxylic acid (BDA) molecular networks were grown using organic molecular beam epitaxy. LEEM images provide direct insight in the growth dynamics and show that defects in the graphene play a crucial role in the final morphology of the molecular film that forms. BDA is demonstrated to form hydrogen bond-stabilized chains on graphene. Dark-field LEEM images reveal that the same defects that determine the morphology of the film, also direct the orientation of the domains, highlighting the importance of understanding the role of defects in epitaxial processes on graphene.

Network cosmology.

PubMed

Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S; Rideout, David; Meyer, David; Boguñá, Marián

2012-01-01

Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology.

Network Cosmology

PubMed Central

Krioukov, Dmitri; Kitsak, Maksim; Sinkovits, Robert S.; Rideout, David; Meyer, David; Boguñá, Marián

2012-01-01

Prediction and control of the dynamics of complex networks is a central problem in network science. Structural and dynamical similarities of different real networks suggest that some universal laws might accurately describe the dynamics of these networks, albeit the nature and common origin of such laws remain elusive. Here we show that the causal network representing the large-scale structure of spacetime in our accelerating universe is a power-law graph with strong clustering, similar to many complex networks such as the Internet, social, or biological networks. We prove that this structural similarity is a consequence of the asymptotic equivalence between the large-scale growth dynamics of complex networks and causal networks. This equivalence suggests that unexpectedly similar laws govern the dynamics of complex networks and spacetime in the universe, with implications to network science and cosmology. PMID:23162688

Real-Time Imaging of Self-Organization and Mechanical Competition in Carbon Nanotube Forest Growth.

PubMed

Balakrishnan, Viswanath; Bedewy, Mostafa; Meshot, Eric R; Pattinson, Sebastian W; Polsen, Erik S; Laye, Fabrice; Zakharov, Dmitri N; Stach, Eric A; Hart, A John

2016-12-27

The properties of carbon nanotube (CNT) networks and analogous materials comprising filamentary nanostructures are governed by the intrinsic filament properties and their hierarchical organization and interconnection. As a result, direct knowledge of the collective dynamics of CNT synthesis and self-organization is essential to engineering improved CNT materials for applications such as membranes and thermal interfaces. Here, we use real-time environmental transmission electron microscopy (E-TEM) to observe nucleation and self-organization of CNTs into vertically aligned forests. Upon introduction of the carbon source, we observe a large scatter in the onset of nucleation of individual CNTs and the ensuing growth rates. Experiments performed at different temperatures and catalyst particle densities show the critical role of CNT density on the dynamics of self-organization; low-density CNT nucleation results in the CNTs becoming pinned to the substrate and forming random networks, whereas higher density CNT nucleation results in self-organization of the CNTs into bundles that are oriented perpendicular to the substrate. We also find that mechanical coupling between growing CNTs alters their growth trajectory and shape, causing significant deformations, buckling, and defects in the CNT walls. Therefore, it appears that CNT-CNT coupling not only is critical for self-organization but also directly influences CNT quality and likely the resulting properties of the forest. Our findings show that control of the time-distributed kinetics of CNT nucleation and bundle formation are critical to manufacturing well-organized CNT assemblies and that E-TEM can be a powerful tool to investigate the mesoscale dynamics of CNT networks.

From neurons to epidemics: How trophic coherence affects spreading processes.

PubMed

Klaise, Janis; Johnson, Samuel

2016-06-01

Trophic coherence, a measure of the extent to which the nodes of a directed network are organised in levels, has recently been shown to be closely related to many structural and dynamical aspects of complex systems, including graph eigenspectra, the prevalence or absence of feedback cycles, and linear stability. Furthermore, non-trivial trophic structures have been observed in networks of neurons, species, genes, metabolites, cellular signalling, concatenated words, P2P users, and world trade. Here, we consider two simple yet apparently quite different dynamical models-one a susceptible-infected-susceptible epidemic model adapted to include complex contagion and the other an Amari-Hopfield neural network-and show that in both cases the related spreading processes are modulated in similar ways by the trophic coherence of the underlying networks. To do this, we propose a network assembly model which can generate structures with tunable trophic coherence, limiting in either perfectly stratified networks or random graphs. We find that trophic coherence can exert a qualitative change in spreading behaviour, determining whether a pulse of activity will percolate through the entire network or remain confined to a subset of nodes, and whether such activity will quickly die out or endure indefinitely. These results could be important for our understanding of phenomena such as epidemics, rumours, shocks to ecosystems, neuronal avalanches, and many other spreading processes.

A Security Assessment Mechanism for Software-Defined Networking-Based Mobile Networks.

PubMed

Luo, Shibo; Dong, Mianxiong; Ota, Kaoru; Wu, Jun; Li, Jianhua

2015-12-17

Software-Defined Networking-based Mobile Networks (SDN-MNs) are considered the future of 5G mobile network architecture. With the evolving cyber-attack threat, security assessments need to be performed in the network management. Due to the distinctive features of SDN-MNs, such as their dynamic nature and complexity, traditional network security assessment methodologies cannot be applied directly to SDN-MNs, and a novel security assessment methodology is needed. In this paper, an effective security assessment mechanism based on attack graphs and an Analytic Hierarchy Process (AHP) is proposed for SDN-MNs. Firstly, this paper discusses the security assessment problem of SDN-MNs and proposes a methodology using attack graphs and AHP. Secondly, to address the diversity and complexity of SDN-MNs, a novel attack graph definition and attack graph generation algorithm are proposed. In order to quantify security levels, the Node Minimal Effort (NME) is defined to quantify attack cost and derive system security levels based on NME. Thirdly, to calculate the NME of an attack graph that takes the dynamic factors of SDN-MN into consideration, we use AHP integrated with the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) as the methodology. Finally, we offer a case study to validate the proposed methodology. The case study and evaluation show the advantages of the proposed security assessment mechanism.

The Reciprocal Relationship Between Social Connectedness and Mental Health Among Older European Adults: A SHARE-Based Analysis.

PubMed

Schwartz, Ella; Litwin, Howard

2017-11-04

The current study aimed to understand the reciprocal relationship between social networks and mental health in old age. It explored the dynamic aspects of that relationship and assessed the influence of social networks on mental health, as well as a concurrent influence of mental health on change in social connectedness. The data came from two measurement points in the Survey of Health, Aging and Retirement in Europe (SHARE). The analytic sample was composed of adults aged 65 years and above (N = 14,706). Analyses were conducted via latent change score models. Analyses showed a reciprocal association between social networks and mental health; baseline social connectedness led to mental health improvements and a better initial mental state led to richer social networks. The results further indicated that the relative effect of mental health on change in social network connectedness was greater than the corresponding effect of social network connectedness on change in mental health. No gender differences were found regarding the reciprocal associations. The results of this study demonstrate the dynamic inter-relationship of social networks and mental health. It highlights the need to take into account both directions of influence when studying the impact of social relationships on mental health. © The Author 2017. Published by Oxford University Press on behalf of The Gerontological Society of America. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

A Security Assessment Mechanism for Software-Defined Networking-Based Mobile Networks

PubMed Central

Luo, Shibo; Dong, Mianxiong; Ota, Kaoru; Wu, Jun; Li, Jianhua

2015-01-01

Software-Defined Networking-based Mobile Networks (SDN-MNs) are considered the future of 5G mobile network architecture. With the evolving cyber-attack threat, security assessments need to be performed in the network management. Due to the distinctive features of SDN-MNs, such as their dynamic nature and complexity, traditional network security assessment methodologies cannot be applied directly to SDN-MNs, and a novel security assessment methodology is needed. In this paper, an effective security assessment mechanism based on attack graphs and an Analytic Hierarchy Process (AHP) is proposed for SDN-MNs. Firstly, this paper discusses the security assessment problem of SDN-MNs and proposes a methodology using attack graphs and AHP. Secondly, to address the diversity and complexity of SDN-MNs, a novel attack graph definition and attack graph generation algorithm are proposed. In order to quantify security levels, the Node Minimal Effort (NME) is defined to quantify attack cost and derive system security levels based on NME. Thirdly, to calculate the NME of an attack graph that takes the dynamic factors of SDN-MN into consideration, we use AHP integrated with the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) as the methodology. Finally, we offer a case study to validate the proposed methodology. The case study and evaluation show the advantages of the proposed security assessment mechanism. PMID:26694409

Distributed Coordination of Heterogeneous Agents Using a Semantic Overlay Network and a Goal-Directed Graphplan Planner

PubMed Central

Lopes, António Luís; Botelho, Luís Miguel

2013-01-01

In this paper, we describe a distributed coordination system that allows agents to seamlessly cooperate in problem solving by partially contributing to a problem solution and delegating the subproblems for which they do not have the required skills or knowledge to appropriate agents. The coordination mechanism relies on a dynamically built semantic overlay network that allows the agents to efficiently locate, even in very large unstructured networks, the necessary skills for a specific problem. Each agent performs partial contributions to the problem solution using a new distributed goal-directed version of the Graphplan algorithm. This new goal-directed version of the original Graphplan algorithm provides an efficient solution to the problem of "distraction", which most forward-chaining algorithms suffer from. We also discuss a set of heuristics to be used in the backward-search process of the planning algorithm in order to distribute this process amongst idle agents in an attempt to find a solution in less time. The evaluation results show that our approach is effective in building a scalable and efficient agent society capable of solving complex distributable problems. PMID:23704885

Inference of topology and the nature of synapses, and the flow of information in neuronal networks

NASA Astrophysics Data System (ADS)

Borges, F. S.; Lameu, E. L.; Iarosz, K. C.; Protachevicz, P. R.; Caldas, I. L.; Viana, R. L.; Macau, E. E. N.; Batista, A. M.; Baptista, M. S.

2018-02-01

The characterization of neuronal connectivity is one of the most important matters in neuroscience. In this work, we show that a recently proposed informational quantity, the causal mutual information, employed with an appropriate methodology, can be used not only to correctly infer the direction of the underlying physical synapses, but also to identify their excitatory or inhibitory nature, considering easy to handle and measure bivariate time series. The success of our approach relies on a surprising property found in neuronal networks by which nonadjacent neurons do "understand" each other (positive mutual information), however, this exchange of information is not capable of causing effect (zero transfer entropy). Remarkably, inhibitory connections, responsible for enhancing synchronization, transfer more information than excitatory connections, known to enhance entropy in the network. We also demonstrate that our methodology can be used to correctly infer directionality of synapses even in the presence of dynamic and observational Gaussian noise, and is also successful in providing the effective directionality of intermodular connectivity, when only mean fields can be measured.

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics

NASA Astrophysics Data System (ADS)

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics.

PubMed

Chen, Yu-Zhong; Lai, Ying-Cheng

2018-03-01

Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

Mapping Systemic Risk: Critical Degree and Failures Distribution in Financial Networks.

PubMed

Smerlak, Matteo; Stoll, Brady; Gupta, Agam; Magdanz, James S

2015-01-01

The financial crisis illustrated the need for a functional understanding of systemic risk in strongly interconnected financial structures. Dynamic processes on complex networks being intrinsically difficult to model analytically, most recent studies of this problem have relied on numerical simulations. Here we report analytical results in a network model of interbank lending based on directly relevant financial parameters, such as interest rates and leverage ratios. We obtain a closed-form formula for the "critical degree" (the number of creditors per bank below which an individual shock can propagate throughout the network), and relate failures distributions to network topologies, in particular scalefree ones. Our criterion for the onset of contagion turns out to be isomorphic to the condition for cooperation to evolve on graphs and social networks, as recently formulated in evolutionary game theory. This remarkable connection supports recent calls for a methodological rapprochement between finance and ecology.

Correlations in the degeneracy of structurally controllable topologies for networks

NASA Astrophysics Data System (ADS)

Campbell, Colin; Aucott, Steven; Ruths, Justin; Ruths, Derek; Shea, Katriona; Albert, Réka

2017-04-01

Many dynamic systems display complex emergent phenomena. By directly controlling a subset of system components (nodes) via external intervention it is possible to indirectly control every other component in the system. When the system is linear or can be approximated sufficiently well by a linear model, methods exist to identify the number and connectivity of a minimum set of external inputs (constituting a so-called minimal control topology, or MCT). In general, many MCTs exist for a given network; here we characterize a broad ensemble of empirical networks in terms of the fraction of nodes and edges that are always, sometimes, or never a part of an MCT. We study the relationships between the measures, and apply the methodology to the T-LGL leukemia signaling network as a case study. We show that the properties introduced in this report can be used to predict key components of biological networks, with potentially broad applications to network medicine.

Mapping Systemic Risk: Critical Degree and Failures Distribution in Financial Networks

PubMed Central

Smerlak, Matteo; Stoll, Brady; Gupta, Agam; Magdanz, James S.

2015-01-01

The financial crisis illustrated the need for a functional understanding of systemic risk in strongly interconnected financial structures. Dynamic processes on complex networks being intrinsically difficult to model analytically, most recent studies of this problem have relied on numerical simulations. Here we report analytical results in a network model of interbank lending based on directly relevant financial parameters, such as interest rates and leverage ratios. We obtain a closed-form formula for the “critical degree” (the number of creditors per bank below which an individual shock can propagate throughout the network), and relate failures distributions to network topologies, in particular scalefree ones. Our criterion for the onset of contagion turns out to be isomorphic to the condition for cooperation to evolve on graphs and social networks, as recently formulated in evolutionary game theory. This remarkable connection supports recent calls for a methodological rapprochement between finance and ecology. PMID:26207631

Neural dynamics for landmark orientation and angular path integration

PubMed Central

Seelig, Johannes D.; Jayaraman, Vivek

2015-01-01

Summary Many animals navigate using a combination of visual landmarks and path integration. In mammalian brains, head direction cells integrate these two streams of information by representing an animal's heading relative to landmarks, yet maintaining their directional tuning in darkness based on self-motion cues. Here we use two-photon calcium imaging in head-fixed flies walking on a ball in a virtual reality arena to demonstrate that landmark-based orientation and angular path integration are combined in the population responses of neurons whose dendrites tile the ellipsoid body — a toroidal structure in the center of the fly brain. The population encodes the fly's azimuth relative to its environment, tracking visual landmarks when available and relying on self-motion cues in darkness. When both visual and self-motion cues are absent, a representation of the animal's orientation is maintained in this network through persistent activity — a potential substrate for short-term memory. Several features of the population dynamics of these neurons and their circular anatomical arrangement are suggestive of ring attractors — network structures proposed to support the function of navigational brain circuits. PMID:25971509

DAWN: Dynamic Ad-hoc Wireless Network

DTIC Science & Technology

2016-06-19

DAWN: Dynamic Ad-hoc Wireless Network The DAWN (Dynamic Ad-hoc Wireless Networks) project is developing a general theory of complex and dynamic... wireless communication networks. To accomplish this, DAWN adopts a very different approach than those followed in the past and summarized above. DAWN... wireless communication networks. The members of DAWN investigated difference aspects of wireless mobile ad hoc networks (MANET). The views, opinions and/or

Deciding where to attend: Large-scale network mechanisms underlying attention and intention revealed by graph-theoretic analysis.

PubMed

Liu, Yuelu; Hong, Xiangfei; Bengson, Jesse J; Kelley, Todd A; Ding, Mingzhou; Mangun, George R

2017-08-15

The neural mechanisms by which intentions are transformed into actions remain poorly understood. We investigated the network mechanisms underlying spontaneous voluntary decisions about where to focus visual-spatial attention (willed attention). Graph-theoretic analysis of two independent datasets revealed that regions activated during willed attention form a set of functionally-distinct networks corresponding to the frontoparietal network, the cingulo-opercular network, and the dorsal attention network. Contrasting willed attention with instructed attention (where attention is directed by external cues), we observed that the dorsal anterior cingulate cortex was allied with the dorsal attention network in instructed attention, but shifted connectivity during willed attention to interact with the cingulo-opercular network, which then mediated communications between the frontoparietal network and the dorsal attention network. Behaviorally, greater connectivity in network hubs, including the dorsolateral prefrontal cortex, the dorsal anterior cingulate cortex, and the inferior parietal lobule, was associated with faster reaction times. These results, shown to be consistent across the two independent datasets, uncover the dynamic organization of functionally-distinct networks engaged to support intentional acts. Copyright © 2017 Elsevier Inc. All rights reserved.

Visual question answering using hierarchical dynamic memory networks

NASA Astrophysics Data System (ADS)

Shang, Jiayu; Li, Shiren; Duan, Zhikui; Huang, Junwei

2018-04-01

Visual Question Answering (VQA) is one of the most popular research fields in machine learning which aims to let the computer learn to answer natural language questions with images. In this paper, we propose a new method called hierarchical dynamic memory networks (HDMN), which takes both question attention and visual attention into consideration impressed by Co-Attention method, which is the best (or among the best) algorithm for now. Additionally, we use bi-directional LSTMs, which have a better capability to remain more information from the question and image, to replace the old unit so that we can capture information from both past and future sentences to be used. Then we rebuild the hierarchical architecture for not only question attention but also visual attention. What's more, we accelerate the algorithm via a new technic called Batch Normalization which helps the network converge more quickly than other algorithms. The experimental result shows that our model improves the state of the art on the large COCO-QA dataset, compared with other methods.

Efficient Usage of Dense GNSS Networks in Central Europe for the Visualization and Investigation of Ionospheric TEC Variations

PubMed Central

Zanimonskiy, Yevgen M.; Yampolski, Yuri M.; Figurski, Mariusz

2017-01-01

The technique of the orthogonal projection of ionosphere electronic content variations for mapping total electron content (TEC) allows us to visualize ionospheric irregularities. For the reconstruction of global ionospheric characteristics, numerous global navigation satellite system (GNSS) receivers located in different regions of the Earth are used as sensors. We used dense GNSS networks in central Europe to detect and investigate a special type of plasma inhomogeneities, called travelling ionospheric disturbances (TID). Such use of GNSS sensors allows us to reconstruct the main TID parameters, such as spatial dimensions, velocities, and directions of their movement. The paper gives examples of the restoration of dynamic characteristics of ionospheric irregularities for quiet and disturbed geophysical conditions. Special attention is paid to the dynamics of ionospheric disturbances stimulated by the magnetic storms of two St. Patrick’s Days (17 March 2013 and 2015). Additional opportunities for the remote sensing of the ionosphere with the use of dense regional networks of GNSS receiving sensors have been noted too. PMID:28994718

Efficient Usage of Dense GNSS Networks in Central Europe for the Visualization and Investigation of Ionospheric TEC Variations.

PubMed

Nykiel, Grzegorz; Zanimonskiy, Yevgen M; Yampolski, Yuri M; Figurski, Mariusz

2017-10-10

The technique of the orthogonal projection of ionosphere electronic content variations for mapping total electron content (TEC) allows us to visualize ionospheric irregularities. For the reconstruction of global ionospheric characteristics, numerous global navigation satellite system (GNSS) receivers located in different regions of the Earth are used as sensors. We used dense GNSS networks in central Europe to detect and investigate a special type of plasma inhomogeneities, called travelling ionospheric disturbances (TID). Such use of GNSS sensors allows us to reconstruct the main TID parameters, such as spatial dimensions, velocities, and directions of their movement. The paper gives examples of the restoration of dynamic characteristics of ionospheric irregularities for quiet and disturbed geophysical conditions. Special attention is paid to the dynamics of ionospheric disturbances stimulated by the magnetic storms of two St. Patrick's Days (17 March 2013 and 2015). Additional opportunities for the remote sensing of the ionosphere with the use of dense regional networks of GNSS receiving sensors have been noted too.

The neural circuit and synaptic dynamics underlying perceptual decision-making

NASA Astrophysics Data System (ADS)

Liu, Feng

2015-03-01

Decision-making with several choice options is central to cognition. To elucidate the neural mechanisms of multiple-choice motion discrimination, we built a continuous recurrent network model to represent a local circuit in the lateral intraparietal area (LIP). The network is composed of pyramidal cells and interneurons, which are directionally tuned. All neurons are reciprocally connected, and the synaptic connectivity strength is heterogeneous. Specifically, we assume two types of inhibitory connectivity to pyramidal cells: opposite-feature and similar-feature inhibition. The model accounted for both physiological and behavioral data from monkey experiments. The network is endowed with slow excitatory reverberation, which subserves the buildup and maintenance of persistent neural activity, and predominant feedback inhibition, which underlies the winner-take-all competition and attractor dynamics. The opposite-feature and opposite-feature inhibition have different effects on decision-making, and only their combination allows for a categorical choice among 12 alternatives. Together, our work highlights the importance of structured synaptic inhibition in multiple-choice decision-making processes.

Variable and complex food web structures revealed by exploring missing trophic links between birds and biofilm.

PubMed

Kuwae, Tomohiro; Miyoshi, Eiichi; Hosokawa, Shinya; Ichimi, Kazuhiko; Hosoya, Jun; Amano, Tatsuya; Moriya, Toshifumi; Kondoh, Michio; Ydenberg, Ronald C; Elner, Robert W

2012-04-01

Food webs are comprised of a network of trophic interactions and are essential to elucidating ecosystem processes and functions. However, the presence of unknown, but critical networks hampers understanding of complex and dynamic food webs in nature. Here, we empirically demonstrate a missing link, both critical and variable, by revealing that direct predator-prey relationships between shorebirds and biofilm are widespread and mediated by multiple ecological and evolutionary determinants. Food source mixing models and energy budget estimates indicate that the strength of the missing linkage is dependent on predator traits (body mass and foraging action rate) and the environment that determines food density. Morphological analyses, showing that smaller bodied species possess more developed feeding apparatus to consume biofilm, suggest that the linkage is also phylogenetically dependent and affords a compelling re-interpretation of niche differentiation. We contend that exploring missing links is a necessity for revealing true network structure and dynamics. © 2012 Blackwell Publishing Ltd/CNRS.

Teleconnection Paths via Climate Network Direct Link Detection.

PubMed

Zhou, Dong; Gozolchiani, Avi; Ashkenazy, Yosef; Havlin, Shlomo

2015-12-31

Teleconnections describe remote connections (typically thousands of kilometers) of the climate system. These are of great importance in climate dynamics as they reflect the transportation of energy and climate change on global scales (like the El Niño phenomenon). Yet, the path of influence propagation between such remote regions, and weighting associated with different paths, are only partially known. Here we propose a systematic climate network approach to find and quantify the optimal paths between remotely distant interacting locations. Specifically, we separate the correlations between two grid points into direct and indirect components, where the optimal path is found based on a minimal total cost function of the direct links. We demonstrate our method using near surface air temperature reanalysis data, on identifying cross-latitude teleconnections and their corresponding optimal paths. The proposed method may be used to quantify and improve our understanding regarding the emergence of climate patterns on global scales.

Distributed Adaptive Finite-Time Approach for Formation-Containment Control of Networked Nonlinear Systems Under Directed Topology.

PubMed

Wang, Yujuan; Song, Yongduan; Ren, Wei

2017-07-06

This paper presents a distributed adaptive finite-time control solution to the formation-containment problem for multiple networked systems with uncertain nonlinear dynamics and directed communication constraints. By integrating the special topology feature of the new constructed symmetrical matrix, the technical difficulty in finite-time formation-containment control arising from the asymmetrical Laplacian matrix under single-way directed communication is circumvented. Based upon fractional power feedback of the local error, an adaptive distributed control scheme is established to drive the leaders into the prespecified formation configuration in finite time. Meanwhile, a distributed adaptive control scheme, independent of the unavailable inputs of the leaders, is designed to keep the followers within a bounded distance from the moving leaders and then to make the followers enter the convex hull shaped by the formation of the leaders in finite time. The effectiveness of the proposed control scheme is confirmed by the simulation.

Social opinion dynamics is not chaotic

NASA Astrophysics Data System (ADS)

Lim, Chjan; Zhang, Weituo

2016-08-01

Motivated by the research on social opinion dynamics over large and dense networks, a general framework for verifying the monotonicity property of multi-agent dynamics is introduced. This allows a derivation of sociologically meaningful sufficient conditions for monotonicity that are tailor-made for social opinion dynamics, which typically have high nonlinearity. A direct consequence of monotonicity is that social opinion dynamics is nonchaotic. A key part of this framework is the definition of a partial order relation that is suitable for a large class of social opinion dynamics such as the generalized naming games. Comparisons are made to previous techniques to verify monotonicity. Using the results obtained, we extend many of the consequences of monotonicity to this class of social dynamics, including several corollaries on their asymptotic behavior, such as global convergence to consensus and tipping points of a minority fraction of zealots or leaders.

Role of local network oscillations in resting-state functional connectivity.

PubMed

Cabral, Joana; Hugues, Etienne; Sporns, Olaf; Deco, Gustavo

2011-07-01

Spatio-temporally organized low-frequency fluctuations (<0.1 Hz), observed in BOLD fMRI signal during rest, suggest the existence of underlying network dynamics that emerge spontaneously from intrinsic brain processes. Furthermore, significant correlations between distinct anatomical regions-or functional connectivity (FC)-have led to the identification of several widely distributed resting-state networks (RSNs). This slow dynamics seems to be highly structured by anatomical connectivity but the mechanism behind it and its relationship with neural activity, particularly in the gamma frequency range, remains largely unknown. Indeed, direct measurements of neuronal activity have revealed similar large-scale correlations, particularly in slow power fluctuations of local field potential gamma frequency range oscillations. To address these questions, we investigated neural dynamics in a large-scale model of the human brain's neural activity. A key ingredient of the model was a structural brain network defined by empirically derived long-range brain connectivity together with the corresponding conduction delays. A neural population, assumed to spontaneously oscillate in the gamma frequency range, was placed at each network node. When these oscillatory units are integrated in the network, they behave as weakly coupled oscillators. The time-delayed interaction between nodes is described by the Kuramoto model of phase oscillators, a biologically-based model of coupled oscillatory systems. For a realistic setting of axonal conduction speed, we show that time-delayed network interaction leads to the emergence of slow neural activity fluctuations, whose patterns correlate significantly with the empirically measured FC. The best agreement of the simulated FC with the empirically measured FC is found for a set of parameters where subsets of nodes tend to synchronize although the network is not globally synchronized. Inside such clusters, the simulated BOLD signal between nodes is found to be correlated, instantiating the empirically observed RSNs. Between clusters, patterns of positive and negative correlations are observed, as described in experimental studies. These results are found to be robust with respect to a biologically plausible range of model parameters. In conclusion, our model suggests how resting-state neural activity can originate from the interplay between the local neural dynamics and the large-scale structure of the brain. Copyright © 2011 Elsevier Inc. All rights reserved.

Computing the Local Field Potential (LFP) from Integrate-and-Fire Network Models.

PubMed

Mazzoni, Alberto; Lindén, Henrik; Cuntz, Hermann; Lansner, Anders; Panzeri, Stefano; Einevoll, Gaute T

2015-12-01

Leaky integrate-and-fire (LIF) network models are commonly used to study how the spiking dynamics of neural networks changes with stimuli, tasks or dynamic network states. However, neurophysiological studies in vivo often rather measure the mass activity of neuronal microcircuits with the local field potential (LFP). Given that LFPs are generated by spatially separated currents across the neuronal membrane, they cannot be computed directly from quantities defined in models of point-like LIF neurons. Here, we explore the best approximation for predicting the LFP based on standard output from point-neuron LIF networks. To search for this best "LFP proxy", we compared LFP predictions from candidate proxies based on LIF network output (e.g, firing rates, membrane potentials, synaptic currents) with "ground-truth" LFP obtained when the LIF network synaptic input currents were injected into an analogous three-dimensional (3D) network model of multi-compartmental neurons with realistic morphology, spatial distributions of somata and synapses. We found that a specific fixed linear combination of the LIF synaptic currents provided an accurate LFP proxy, accounting for most of the variance of the LFP time course observed in the 3D network for all recording locations. This proxy performed well over a broad set of conditions, including substantial variations of the neuronal morphologies. Our results provide a simple formula for estimating the time course of the LFP from LIF network simulations in cases where a single pyramidal population dominates the LFP generation, and thereby facilitate quantitative comparison between computational models and experimental LFP recordings in vivo.

Computing the Local Field Potential (LFP) from Integrate-and-Fire Network Models

PubMed Central

Cuntz, Hermann; Lansner, Anders; Panzeri, Stefano; Einevoll, Gaute T.

2015-01-01

Leaky integrate-and-fire (LIF) network models are commonly used to study how the spiking dynamics of neural networks changes with stimuli, tasks or dynamic network states. However, neurophysiological studies in vivo often rather measure the mass activity of neuronal microcircuits with the local field potential (LFP). Given that LFPs are generated by spatially separated currents across the neuronal membrane, they cannot be computed directly from quantities defined in models of point-like LIF neurons. Here, we explore the best approximation for predicting the LFP based on standard output from point-neuron LIF networks. To search for this best “LFP proxy”, we compared LFP predictions from candidate proxies based on LIF network output (e.g, firing rates, membrane potentials, synaptic currents) with “ground-truth” LFP obtained when the LIF network synaptic input currents were injected into an analogous three-dimensional (3D) network model of multi-compartmental neurons with realistic morphology, spatial distributions of somata and synapses. We found that a specific fixed linear combination of the LIF synaptic currents provided an accurate LFP proxy, accounting for most of the variance of the LFP time course observed in the 3D network for all recording locations. This proxy performed well over a broad set of conditions, including substantial variations of the neuronal morphologies. Our results provide a simple formula for estimating the time course of the LFP from LIF network simulations in cases where a single pyramidal population dominates the LFP generation, and thereby facilitate quantitative comparison between computational models and experimental LFP recordings in vivo. PMID:26657024

NDRAM: nonlinear dynamic recurrent associative memory for learning bipolar and nonbipolar correlated patterns.

PubMed

Chartier, Sylvain; Proulx, Robert

2005-11-01

This paper presents a new unsupervised attractor neural network, which, contrary to optimal linear associative memory models, is able to develop nonbipolar attractors as well as bipolar attractors. Moreover, the model is able to develop less spurious attractors and has a better recall performance under random noise than any other Hopfield type neural network. Those performances are obtained by a simple Hebbian/anti-Hebbian online learning rule that directly incorporates feedback from a specific nonlinear transmission rule. Several computer simulations show the model's distinguishing properties.

Scenario analysis and disaster preparedness for port and maritime logistics risk management.

PubMed

Kwesi-Buor, John; Menachof, David A; Talas, Risto

2016-08-01

System Dynamics (SD) modelling is used to investigate the impacts of policy interventions on industry actors' preparedness to mitigate risks and to recover from disruptions along the maritime logistics and supply chain network. The model suggests a bi-directional relation between regulation and industry actors' behaviour towards Disaster Preparedness (DP) in maritime logistics networks. The model also showed that the level of DP is highly contingent on forecast accuracy, technology change, attitude to risk prevention, port activities, and port environment. Copyright © 2016 Elsevier Ltd. All rights reserved.

Endogenous Molecular-Cellular Network Cancer Theory: A Systems Biology Approach.

PubMed

Wang, Gaowei; Yuan, Ruoshi; Zhu, Xiaomei; Ao, Ping

2018-01-01

In light of ever apparent limitation of the current dominant cancer mutation theory, a quantitative hypothesis for cancer genesis and progression, endogenous molecular-cellular network hypothesis has been proposed from the systems biology perspective, now for more than 10 years. It was intended to include both the genetic and epigenetic causes to understand cancer. Its development enters the stage of meaningful interaction with experimental and clinical data and the limitation of the traditional cancer mutation theory becomes more evident. Under this endogenous network hypothesis, we established a core working network of hepatocellular carcinoma (HCC) according to the hypothesis and quantified the working network by a nonlinear dynamical system. We showed that the two stable states of the working network reproduce the main known features of normal liver and HCC at both the modular and molecular levels. Using endogenous network hypothesis and validated working network, we explored genetic mutation pattern in cancer and potential strategies to cure or relieve HCC from a totally new perspective. Patterns of genetic mutations have been traditionally analyzed by posteriori statistical association approaches in light of traditional cancer mutation theory. One may wonder the possibility of a priori determination of any mutation regularity. Here, we found that based on the endogenous network theory the features of genetic mutations in cancers may be predicted without any prior knowledge of mutation propensities. Normal hepatocyte and cancerous hepatocyte stable states, specified by distinct patterns of expressions or activities of proteins in the network, provide means to directly identify a set of most probable genetic mutations and their effects in HCC. As the key proteins and main interactions in the network are conserved through cell types in an organism, similar mutational features may also be found in other cancers. This analysis yielded straightforward and testable predictions on an accumulated and preferred mutation spectrum in normal tissue. The validation of predicted cancer state mutation patterns demonstrates the usefulness and potential of a causal dynamical framework to understand and predict genetic mutations in cancer. We also obtained the following implication related to HCC therapy, (1) specific positive feedback loops are responsible for the maintenance of normal liver and HCC; (2) inhibiting proliferation and inflammation-related positive feedback loops, and simultaneously inducing liver-specific positive feedback loop is predicated as the potential strategy to cure or relieve HCC; (3) the genesis and regression of HCC is asymmetric. In light of the characteristic property of the nonlinear dynamical system, we demonstrate that positive feedback loops must be existed as a simple and general molecular basis for the maintenance of phenotypes such as normal liver and HCC, and regulating the positive feedback loops directly or indirectly provides potential strategies to cure or relieve HCC.

Multiscale Quantum Mechanics/Molecular Mechanics Simulations with Neural Networks.

PubMed

Shen, Lin; Wu, Jingheng; Yang, Weitao

2016-10-11

Molecular dynamics simulation with multiscale quantum mechanics/molecular mechanics (QM/MM) methods is a very powerful tool for understanding the mechanism of chemical and biological processes in solution or enzymes. However, its computational cost can be too high for many biochemical systems because of the large number of ab initio QM calculations. Semiempirical QM/MM simulations have much higher efficiency. Its accuracy can be improved with a correction to reach the ab initio QM/MM level. The computational cost on the ab initio calculation for the correction determines the efficiency. In this paper we developed a neural network method for QM/MM calculation as an extension of the neural-network representation reported by Behler and Parrinello. With this approach, the potential energy of any configuration along the reaction path for a given QM/MM system can be predicted at the ab initio QM/MM level based on the semiempirical QM/MM simulations. We further applied this method to three reactions in water to calculate the free energy changes. The free-energy profile obtained from the semiempirical QM/MM simulation is corrected to the ab initio QM/MM level with the potential energies predicted with the constructed neural network. The results are in excellent accordance with the reference data that are obtained from the ab initio QM/MM molecular dynamics simulation or corrected with direct ab initio QM/MM potential energies. Compared with the correction using direct ab initio QM/MM potential energies, our method shows a speed-up of 1 or 2 orders of magnitude. It demonstrates that the neural network method combined with the semiempirical QM/MM calculation can be an efficient and reliable strategy for chemical reaction simulations.

Ramification of Channel Networks Incised by Groundwater Flow

NASA Astrophysics Data System (ADS)

Yi, R. S.; Seybold, H. F.; Petroff, A. P.; Devauchelle, O.; Rothman, D.

2011-12-01

The geometry of channel networks has been a source of fascination since at least Leonardo da Vinci's time. Yet a comprehensive understanding of ramification---the mechanism of branching by which a stream network acquires its geometric complexity---remains elusive. To investigate the mechanisms of ramification and network growth, we consider channel growth driven by groundwater flow as a model system, analogous to a medical scientist's laboratory rat. We test our theoretical predictions through analysis of a particularly compelling example found on the Florida Panhandle north of Bristol. As our ultimate goal is to understand ramification and growth dynamics of the entire network, we build a computational model based on the following growth hypothesis: Channels grow in the direction that captures the maximum water flux. When there are two such directions, tips bifurcate. The direction of growth can be determined from the expansion of the ground water field around each tip, where each coefficient in this expansion has a physical interpretation. The first coefficient in the expansion determines the ground water discharge, leading to a straight growth of the channel. The second term describes the asymmetry in the water field leading to a bending of the stream in the direction of maximal water flux. The ratio between the first and the third coefficient determines a critical distance rc over which the tip feels inhomogeneities in the ground water table. This initiates then the splitting of the tip. In order to test our growth hypothesis and to determine rc, we grow the Florida network backward. At each time step we calculate the solution of the ground water field and determine the appropriate expansion coefficients around each tip. Comparing this simulation result to the predicted values provides us with a stringent measure for rc and the significance of our growth hypothesis.

Fast packet switching algorithms for dynamic resource control over ATM networks

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

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

1996-12-01

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

Coherent periodic activity in excitatory Erdös-Renyi neural networks: the role of network connectivity.

PubMed

Tattini, Lorenzo; Olmi, Simona; Torcini, Alessandro

2012-06-01

In this article, we investigate the role of connectivity in promoting coherent activity in excitatory neural networks. In particular, we would like to understand if the onset of collective oscillations can be related to a minimal average connectivity and how this critical connectivity depends on the number of neurons in the networks. For these purposes, we consider an excitatory random network of leaky integrate-and-fire pulse coupled neurons. The neurons are connected as in a directed Erdös-Renyi graph with average connectivity scaling as a power law with the number of neurons in the network. The scaling is controlled by a parameter γ, which allows to pass from massively connected to sparse networks and therefore to modify the topology of the system. At a macroscopic level, we observe two distinct dynamical phases: an asynchronous state corresponding to a desynchronized dynamics of the neurons and a regime of partial synchronization (PS) associated with a coherent periodic activity of the network. At low connectivity, the system is in an asynchronous state, while PS emerges above a certain critical average connectivity (c). For sufficiently large networks, (c) saturates to a constant value suggesting that a minimal average connectivity is sufficient to observe coherent activity in systems of any size irrespectively of the kind of considered network: sparse or massively connected. However, this value depends on the nature of the synapses: reliable or unreliable. For unreliable synapses, the critical value required to observe the onset of macroscopic behaviors is noticeably smaller than for reliable synaptic transmission. Due to the disorder present in the system, for finite number of neurons we have inhomogeneities in the neuronal behaviors, inducing a weak form of chaos, which vanishes in the thermodynamic limit. In such a limit, the disordered systems exhibit regular (non chaotic) dynamics and their properties correspond to that of a homogeneous fully connected network for any γ-value. Apart for the peculiar exception of sparse networks, which remain intrinsically inhomogeneous at any system size.

Network marketing on a small-world network

NASA Astrophysics Data System (ADS)

Kim, Beom Jun; Jun, Tackseung; Kim, Jeong-Yoo; Choi, M. Y.

2006-02-01

We investigate a dynamic model of network marketing in a small-world network structure artificially constructed similarly to the Watts-Strogatz network model. Different from the traditional marketing, consumers can also play the role of the manufacturer's selling agents in network marketing, which is stimulated by the referral fee the manufacturer offers. As the wiring probability α is increased from zero to unity, the network changes from the one-dimensional regular directed network to the star network where all but one player are connected to one consumer. The price p of the product and the referral fee r are used as free parameters to maximize the profit of the manufacturer. It is observed that at α=0 the maximized profit is constant independent of the network size N while at α≠0, it increases linearly with N. This is in parallel to the small-world transition. It is also revealed that while the optimal value of p stays at an almost constant level in a broad range of α, that of r is sensitive to a change in the network structure. The consumer surplus is also studied and discussed.

Highly designable phenotypes and mutational buffers emerge from a systematic mapping between network topology and dynamic output.

PubMed

Nochomovitz, Yigal D; Li, Hao

2006-03-14

Deciphering the design principles for regulatory networks is fundamental to an understanding of biological systems. We have explored the mapping from the space of network topologies to the space of dynamical phenotypes for small networks. Using exhaustive enumeration of a simple model of three- and four-node networks, we demonstrate that certain dynamical phenotypes can be generated by an atypically broad spectrum of network topologies. Such dynamical outputs are highly designable, much like certain protein structures can be designed by an unusually broad spectrum of sequences. The network topologies that encode a highly designable dynamical phenotype possess two classes of connections: a fully conserved core of dedicated connections that encodes the stable dynamical phenotype and a partially conserved set of variable connections that controls the transient dynamical flow. By comparing the topologies and dynamics of the three- and four-node network ensembles, we observe a large number of instances of the phenomenon of "mutational buffering," whereby addition of a fourth node suppresses phenotypic variation amongst a set of three-node networks.

Structural connectivity in schizophrenia and its impact on the dynamics of spontaneous functional networks

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

Cabral, Joana; Department of Psychiatry, University of Oxford, Oxford OX3 7JX; Fernandes, Henrique M.

The neuropathology of schizophrenia remains unclear. Some insight has come from modern neuroimaging techniques, which offer an unparalleled opportunity to explore in vivo the structure and function of the brain. Using functional magnetic resonance imaging, it has been found that the large-scale resting-state functional connectivity (rsFC) in schizophrenia — measured as the temporal correlations of the blood-oxygen-level-dependent (BOLD) signal — exhibit altered network topology, with lower small-world index. The origin of these rsFC alterations and link with the underlying structural connectivity remain unclear. In this work, we used a computational model of spontaneous large-scale brain activity to explore the rolemore » of the structural connectivity in the large-scale dynamics of the brain in health and schizophrenia. The structural connectomes from 15 adolescent patients with early-onset schizophrenia and 15 age- and gender-matched controls were built from diffusion tensor imaging data to detect the white matter tracts between 90 brain areas. Brain areas, simulated using a reduced dynamic mean-field model, receive excitatory input from other areas in proportion to the number of fibre tracts between them. The simulated mean field activity was transformed into BOLD signal, and the properties of the simulated functional networks were analyzed. Our results suggest that the functional alterations observed in schizophrenia are not directly linked to alterations in the structural topology. Instead, subtly randomized and less small-world functional networks appear when the brain operates with lower global coupling, which shifts the dynamics from the optimal healthy regime.« less

Structural connectivity in schizophrenia and its impact on the dynamics of spontaneous functional networks

NASA Astrophysics Data System (ADS)

Cabral, Joana; Fernandes, Henrique M.; Van Hartevelt, Tim J.; James, Anthony C.; Kringelbach, Morten L.; Deco, Gustavo

2013-12-01

The neuropathology of schizophrenia remains unclear. Some insight has come from modern neuroimaging techniques, which offer an unparalleled opportunity to explore in vivo the structure and function of the brain. Using functional magnetic resonance imaging, it has been found that the large-scale resting-state functional connectivity (rsFC) in schizophrenia — measured as the temporal correlations of the blood-oxygen-level-dependent (BOLD) signal — exhibit altered network topology, with lower small-world index. The origin of these rsFC alterations and link with the underlying structural connectivity remain unclear. In this work, we used a computational model of spontaneous large-scale brain activity to explore the role of the structural connectivity in the large-scale dynamics of the brain in health and schizophrenia. The structural connectomes from 15 adolescent patients with early-onset schizophrenia and 15 age- and gender-matched controls were built from diffusion tensor imaging data to detect the white matter tracts between 90 brain areas. Brain areas, simulated using a reduced dynamic mean-field model, receive excitatory input from other areas in proportion to the number of fibre tracts between them. The simulated mean field activity was transformed into BOLD signal, and the properties of the simulated functional networks were analyzed. Our results suggest that the functional alterations observed in schizophrenia are not directly linked to alterations in the structural topology. Instead, subtly randomized and less small-world functional networks appear when the brain operates with lower global coupling, which shifts the dynamics from the optimal healthy regime.

The sleeping brain as a complex system.

PubMed

Olbrich, Eckehard; Achermann, Peter; Wennekers, Thomas

2011-10-13

'Complexity science' is a rapidly developing research direction with applications in a multitude of fields that study complex systems consisting of a number of nonlinear elements with interesting dynamics and mutual interactions. This Theme Issue 'The complexity of sleep' aims at fostering the application of complexity science to sleep research, because the brain in its different sleep stages adopts different global states that express distinct activity patterns in large and complex networks of neural circuits. This introduction discusses the contributions collected in the present Theme Issue. We highlight the potential and challenges of a complex systems approach to develop an understanding of the brain in general and the sleeping brain in particular. Basically, we focus on two topics: the complex networks approach to understand the changes in the functional connectivity of the brain during sleep, and the complex dynamics of sleep, including sleep regulation. We hope that this Theme Issue will stimulate and intensify the interdisciplinary communication to advance our understanding of the complex dynamics of the brain that underlies sleep and consciousness.

Gr-GDHP: A New Architecture for Globalized Dual Heuristic Dynamic Programming.

PubMed

Zhong, Xiangnan; Ni, Zhen; He, Haibo

2017-10-01

Goal representation globalized dual heuristic dynamic programming (Gr-GDHP) method is proposed in this paper. A goal neural network is integrated into the traditional GDHP method providing an internal reinforcement signal and its derivatives to help the control and learning process. From the proposed architecture, it is shown that the obtained internal reinforcement signal and its derivatives can be able to adjust themselves online over time rather than a fixed or predefined function in literature. Furthermore, the obtained derivatives can directly contribute to the objective function of the critic network, whose learning process is thus simplified. Numerical simulation studies are applied to show the performance of the proposed Gr-GDHP method and compare the results with other existing adaptive dynamic programming designs. We also investigate this method on a ball-and-beam balancing system. The statistical simulation results are presented for both the Gr-GDHP and the GDHP methods to demonstrate the improved learning and controlling performance.

Dynamics of assembly production flow

NASA Astrophysics Data System (ADS)

Ezaki, Takahiro; Yanagisawa, Daichi; Nishinari, Katsuhiro

2015-06-01

Despite recent developments in management theory, maintaining a manufacturing schedule remains difficult because of production delays and fluctuations in demand and supply of materials. The response of manufacturing systems to such disruptions to dynamic behavior has been rarely studied. To capture these responses, we investigate a process that models the assembly of parts into end products. The complete assembly process is represented by a directed tree, where the smallest parts are injected at leaves and the end products are removed at the root. A discrete assembly process, represented by a node on the network, integrates parts, which are then sent to the next downstream node as a single part. The model exhibits some intriguing phenomena, including overstock cascade, phase transition in terms of demand and supply fluctuations, nonmonotonic distribution of stockout in the network, and the formation of a stockout path and stockout chains. Surprisingly, these rich phenomena result from only the nature of distributed assembly processes. From a physical perspective, these phenomena provide insight into delay dynamics and inventory distributions in large-scale manufacturing systems.

Vehicle dynamic analysis using neuronal network algorithms

NASA Astrophysics Data System (ADS)

Oloeriu, Florin; Mocian, Oana

2014-06-01

Theoretical developments of certain engineering areas, the emergence of new investigation tools, which are better and more precise and their implementation on-board the everyday vehicles, all these represent main influence factors that impact the theoretical and experimental study of vehicle's dynamic behavior. Once the implementation of these new technologies onto the vehicle's construction had been achieved, it had led to more and more complex systems. Some of the most important, such as the electronic control of engine, transmission, suspension, steering, braking and traction had a positive impact onto the vehicle's dynamic behavior. The existence of CPU on-board vehicles allows data acquisition and storage and it leads to a more accurate and better experimental and theoretical study of vehicle dynamics. It uses the information offered directly by the already on-board built-in elements of electronic control systems. The technical literature that studies vehicle dynamics is entirely focused onto parametric analysis. This kind of approach adopts two simplifying assumptions. Functional parameters obey certain distribution laws, which are known in classical statistics theory. The second assumption states that the mathematical models are previously known and have coefficients that are not time-dependent. Both the mentioned assumptions are not confirmed in real situations: the functional parameters do not follow any known statistical repartition laws and the mathematical laws aren't previously known and contain families of parameters and are mostly time-dependent. The purpose of the paper is to present a more accurate analysis methodology that can be applied when studying vehicle's dynamic behavior. A method that provides the setting of non-parametrical mathematical models for vehicle's dynamic behavior is relying on neuronal networks. This method contains coefficients that are time-dependent. Neuronal networks are mostly used in various types' system controls, thus being a non-linear process identification algorithm. The common use of neuronal networks for non-linear processes is justified by the fact that both have the ability to organize by themselves. That is why the neuronal networks best define intelligent systems, thus the word `neuronal' is sending one's mind to the biological neuron cell. The paper presents how to better interpret data fed from the on-board computer and a new way of processing that data to better model the real life dynamic behavior of the vehicle.

Structural Efficiency of Percolated Landscapes in Flow Networks

PubMed Central

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

2008-01-01

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

A state space approach for piecewise-linear recurrent neural networks for identifying computational dynamics from neural measurements.

PubMed

Durstewitz, Daniel

2017-06-01

The computational and cognitive properties of neural systems are often thought to be implemented in terms of their (stochastic) network dynamics. Hence, recovering the system dynamics from experimentally observed neuronal time series, like multiple single-unit recordings or neuroimaging data, is an important step toward understanding its computations. Ideally, one would not only seek a (lower-dimensional) state space representation of the dynamics, but would wish to have access to its statistical properties and their generative equations for in-depth analysis. Recurrent neural networks (RNNs) are a computationally powerful and dynamically universal formal framework which has been extensively studied from both the computational and the dynamical systems perspective. Here we develop a semi-analytical maximum-likelihood estimation scheme for piecewise-linear RNNs (PLRNNs) within the statistical framework of state space models, which accounts for noise in both the underlying latent dynamics and the observation process. The Expectation-Maximization algorithm is used to infer the latent state distribution, through a global Laplace approximation, and the PLRNN parameters iteratively. After validating the procedure on toy examples, and using inference through particle filters for comparison, the approach is applied to multiple single-unit recordings from the rodent anterior cingulate cortex (ACC) obtained during performance of a classical working memory task, delayed alternation. Models estimated from kernel-smoothed spike time data were able to capture the essential computational dynamics underlying task performance, including stimulus-selective delay activity. The estimated models were rarely multi-stable, however, but rather were tuned to exhibit slow dynamics in the vicinity of a bifurcation point. In summary, the present work advances a semi-analytical (thus reasonably fast) maximum-likelihood estimation framework for PLRNNs that may enable to recover relevant aspects of the nonlinear dynamics underlying observed neuronal time series, and directly link these to computational properties.

Adaptive Neuron Model: An architecture for the rapid learning of nonlinear topological transformations

NASA Technical Reports Server (NTRS)

Tawel, Raoul (Inventor)

1994-01-01

A method for the rapid learning of nonlinear mappings and topological transformations using a dynamically reconfigurable artificial neural network is presented. This fully-recurrent Adaptive Neuron Model (ANM) network was applied to the highly degenerate inverse kinematics problem in robotics, and its performance evaluation is bench-marked. Once trained, the resulting neuromorphic architecture was implemented in custom analog neural network hardware and the parameters capturing the functional transformation downloaded onto the system. This neuroprocessor, capable of 10(exp 9) ops/sec, was interfaced directly to a three degree of freedom Heathkit robotic manipulator. Calculation of the hardware feed-forward pass for this mapping was benchmarked at approximately 10 microsec.

Prestressed F-actin networks cross-linked by hinged filamins replicate mechanical properties of cells

NASA Astrophysics Data System (ADS)

Gardel, M. L.; Nakamura, F.; Hartwig, J. H.; Crocker, J. C.; Stossel, T. P.; Weitz, D. A.

2006-02-01

We show that actin filaments, shortened to physiological lengths by gelsolin and cross-linked with recombinant human filamins (FLNs), exhibit dynamic elastic properties similar to those reported for live cells. To achieve elasticity values of comparable magnitude to those of cells, the in vitro network must be subjected to external prestress, which directly controls network elasticity. A molecular requirement for the strain-related behavior at physiological conditionsis a flexible hinge found in FLNa and some FLNb molecules. Basic physical properties of the in vitro filamin-F-actin network replicate the essential mechanical properties of living cells. This physical behavior could accommodate passive deformation and internal organelle trafficking at low strains yet resist externally or internally generated high shear forces. cytoskeleton | cell mechanics | nonlinear rheology

Analysis of remote synchronization in complex networks

NASA Astrophysics Data System (ADS)

Gambuzza, Lucia Valentina; Cardillo, Alessio; Fiasconaro, Alessandro; Fortuna, Luigi; Gómez-Gardeñes, Jesus; Frasca, Mattia

2013-12-01

A novel regime of synchronization, called remote synchronization, where the peripheral nodes form a phase synchronized cluster not including the hub, was recently observed in star motifs [Bergner et al., Phys. Rev. E 85, 026208 (2012)]. We show the existence of a more general dynamical state of remote synchronization in arbitrary networks of coupled oscillators. This state is characterized by the synchronization of pairs of nodes that are not directly connected via a physical link or any sequence of synchronized nodes. This phenomenon is almost negligible in networks of phase oscillators as its underlying mechanism is the modulation of the amplitude of those intermediary nodes between the remotely synchronized units. Our findings thus show the ubiquity and robustness of these states and bridge the gap from their recent observation in simple toy graphs to complex networks.

Tree tensor network approach to simulating Shor's algorithm

NASA Astrophysics Data System (ADS)

Dumitrescu, Eugene

2017-12-01

Constructively simulating quantum systems furthers our understanding of qualitative and quantitative features which may be analytically intractable. In this paper, we directly simulate and explore the entanglement structure present in the paradigmatic example for exponential quantum speedups: Shor's algorithm. To perform our simulation, we construct a dynamic tree tensor network which manifestly captures two salient circuit features for modular exponentiation. These are the natural two-register bipartition and the invariance of entanglement with respect to permutations of the top-register qubits. Our construction help identify the entanglement entropy properties, which we summarize by a scaling relation. Further, the tree network is efficiently projected onto a matrix product state from which we efficiently execute the quantum Fourier transform. Future simulation of quantum information states with tensor networks exploiting circuit symmetries is discussed.

Advanced Polymer Network Structures

DTIC Science & Technology

2016-02-01

double networks in a single step was identified from coarse-grained molecular dynamics simulations of polymer solvents bearing rigid side chains dissolved...in a polymer network. Coarse-grained molecular dynamics simulations also explored the mechanical behavior of traditional double networks and...DRI), polymer networks, polymer gels, molecular dynamics simulations , double networks 16. SECURITY CLASSIFICATION OF: 17. LIMITATION OF

Dynamic Trust Management for Mobile Networks and Its Applications

ERIC Educational Resources Information Center

Bao, Fenye

2013-01-01

Trust management in mobile networks is challenging due to dynamically changing network environments and the lack of a centralized trusted authority. In this dissertation research, we "design" and "validate" a class of dynamic trust management protocols for mobile networks, and demonstrate the utility of dynamic trust management…

Allosteric pathway identification through network analysis: from molecular dynamics simulations to interactive 2D and 3D graphs.

PubMed

Allain, Ariane; Chauvot de Beauchêne, Isaure; Langenfeld, Florent; Guarracino, Yann; Laine, Elodie; Tchertanov, Luba

2014-01-01

Allostery is a universal phenomenon that couples the information induced by a local perturbation (effector) in a protein to spatially distant regulated sites. Such an event can be described in terms of a large scale transmission of information (communication) through a dynamic coupling between structurally rigid (minimally frustrated) and plastic (locally frustrated) clusters of residues. To elaborate a rational description of allosteric coupling, we propose an original approach - MOdular NETwork Analysis (MONETA) - based on the analysis of inter-residue dynamical correlations to localize the propagation of both structural and dynamical effects of a perturbation throughout a protein structure. MONETA uses inter-residue cross-correlations and commute times computed from molecular dynamics simulations and a topological description of a protein to build a modular network representation composed of clusters of residues (dynamic segments) linked together by chains of residues (communication pathways). MONETA provides a brand new direct and simple visualization of protein allosteric communication. A GEPHI module implemented in the MONETA package allows the generation of 2D graphs of the communication network. An interactive PyMOL plugin permits drawing of the communication pathways between chosen protein fragments or residues on a 3D representation. MONETA is a powerful tool for on-the-fly display of communication networks in proteins. We applied MONETA for the analysis of communication pathways (i) between the main regulatory fragments of receptors tyrosine kinases (RTKs), KIT and CSF-1R, in the native and mutated states and (ii) in proteins STAT5 (STAT5a and STAT5b) in the phosphorylated and the unphosphorylated forms. The description of the physical support for allosteric coupling by MONETA allowed a comparison of the mechanisms of (a) constitutive activation induced by equivalent mutations in two RTKs and (b) allosteric regulation in the activated and non-activated STAT5 proteins. Our theoretical prediction based on results obtained with MONETA was validated for KIT by in vitro experiments. MONETA is a versatile analytical and visualization tool entirely devoted to the understanding of the functioning/malfunctioning of allosteric regulation in proteins - a crucial basis to guide the discovery of next-generation allosteric drugs.

Social adaptation in multi-agent model of linguistic categorization is affected by network information flow.

PubMed

Zubek, Julian; Denkiewicz, Michał; Barański, Juliusz; Wróblewski, Przemysław; Rączaszek-Leonardi, Joanna; Plewczynski, Dariusz

2017-01-01

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems.

Social adaptation in multi-agent model of linguistic categorization is affected by network information flow

PubMed Central

Denkiewicz, Michał; Barański, Juliusz; Wróblewski, Przemysław; Rączaszek-Leonardi, Joanna; Plewczynski, Dariusz

2017-01-01

This paper explores how information flow properties of a network affect the formation of categories shared between individuals, who are communicating through that network. Our work is based on the established multi-agent model of the emergence of linguistic categories grounded in external environment. We study how network information propagation efficiency and the direction of information flow affect categorization by performing simulations with idealized network topologies optimizing certain network centrality measures. We measure dynamic social adaptation when either network topology or environment is subject to change during the experiment, and the system has to adapt to new conditions. We find that both decentralized network topology efficient in information propagation and the presence of central authority (information flow from the center to peripheries) are beneficial for the formation of global agreement between agents. Systems with central authority cope well with network topology change, but are less robust in the case of environment change. These findings help to understand which network properties affect processes of social adaptation. They are important to inform the debate on the advantages and disadvantages of centralized systems. PMID:28809957

Detailed analysis of routing protocols with different network limitations

NASA Astrophysics Data System (ADS)

Masood, Mohsin; Abuhelala, Mohamed; Glesk, Ivan

2016-12-01

In network communication field, routing protocols have got a significant role which are not only used in networks to handle the user data but also to monitor the different network environments. Dynamic routing protocols such as OSPF, EIGRP and RIP are used for forwarding user data to its destination by instantly detecting the dynamic changes across the network. The dynamic changes in the network can be in the form of topological changes, congestions, links failure etc. Therefore, it becomes a challenge to develop and implement dynamic routing protocols that fulfills the network requirements. Hence, each routing protocol has its own characteristics such as convergence activity, routing metric, routing table etc. and will perform differently in various network environments. This paper presents a comprehensive study of static and dynamic routing, along with dynamic routing protocols. Experiments that are conducted under various network limitations are presented using the OPNET tool. The performance of each of dynamic routing protocols are monitored and explained in the form of simulated results using network parameters. The results are analyzed, in order to provide a clear understanding of each protocol performance for the selection of the proper protocol for a given network environment.

Effective Connectivity Modeling for fMRI: Six Issues and Possible Solutions Using Linear Dynamic Systems

PubMed Central

Smith, Jason F.; Pillai, Ajay; Chen, Kewei; Horwitz, Barry

2012-01-01

Analysis of directionally specific or causal interactions between regions in functional magnetic resonance imaging (fMRI) data has proliferated. Here we identify six issues with existing effective connectivity methods that need to be addressed. The issues are discussed within the framework of linear dynamic systems for fMRI (LDSf). The first concerns the use of deterministic models to identify inter-regional effective connectivity. We show that deterministic dynamics are incapable of identifying the trial-to-trial variability typically investigated as the marker of connectivity while stochastic models can capture this variability. The second concerns the simplistic (constant) connectivity modeled by most methods. Connectivity parameters of the LDSf model can vary at the same timescale as the input data. Further, extending LDSf to mixtures of multiple models provides more robust connectivity variation. The third concerns the correct identification of the network itself including the number and anatomical origin of the network nodes. Augmentation of the LDSf state space can identify additional nodes of a network. The fourth concerns the locus of the signal used as a “node” in a network. A novel extension LDSf incorporating sparse canonical correlations can select most relevant voxels from an anatomically defined region based on connectivity. The fifth concerns connection interpretation. Individual parameter differences have received most attention. We present alternative network descriptors of connectivity changes which consider the whole network. The sixth concerns the temporal resolution of fMRI data relative to the timescale of the inter-regional interactions in the brain. LDSf includes an “instantaneous” connection term to capture connectivity occurring at timescales faster than the data resolution. The LDS framework can also be extended to statistically combine fMRI and EEG data. The LDSf framework is a promising foundation for effective connectivity analysis. PMID:22279430

Dynamical networks of influence in small group discussions

PubMed Central

Noriega Campero, Alejandro; Almaatouq, Abdullah

2018-01-01

In many domains of life, business and management, numerous problems are addressed by small groups of individuals engaged in face-to-face discussions. While research in social psychology has a long history of studying the determinants of small group performances, the internal dynamics that govern a group discussion are not yet well understood. Here, we rely on computational methods based on network analyses and opinion dynamics to describe how individuals influence each other during a group discussion. We consider the situation in which a small group of three individuals engages in a discussion to solve an estimation task. We propose a model describing how group members gradually influence each other and revise their judgments over the course of the discussion. The main component of the model is an influence network—a weighted, directed graph that determines the extent to which individuals influence each other during the discussion. In simulations, we first study the optimal structure of the influence network that yields the best group performances. Then, we implement a social learning process by which individuals adapt to the past performance of their peers, thereby affecting the structure of the influence network in the long run. We explore the mechanisms underlying the emergence of efficient or maladaptive networks and show that the influence network can converge towards the optimal one, but only when individuals exhibit a social discounting bias by downgrading the relative performances of their peers. Finally, we find a late-speaker effect, whereby individuals who speak later in the discussion are perceived more positively in the long run and are thus more influential. The numerous predictions of the model can serve as a basis for future experiments, and this work opens research on small group discussion to computational social sciences. PMID:29338013

Network Structure and Community Evolution on Twitter: Human Behavior Change in Response to the 2011 Japanese Earthquake and Tsunami

PubMed Central

Lu, Xin; Brelsford, Christa

2014-01-01

To investigate the dynamics of social networks and the formation and evolution of online communities in response to extreme events, we collected three datasets from Twitter shortly before and after the 2011 earthquake and tsunami in Japan. We find that while almost all users increased their online activity after the earthquake, Japanese speakers, who are assumed to be more directly affected by the event, expanded the network of people they interact with to a much higher degree than English speakers or the global average. By investigating the evolution of communities, we find that the behavior of joining or quitting a community is far from random: users tend to stay in their current status and are less likely to join new communities from solitary or shift to other communities from their current community. While non-Japanese speakers did not change their conversation topics significantly after the earthquake, nearly all Japanese users changed their conversations to earthquake-related content. This study builds a systematic framework for investigating human behaviors under extreme events with online social network data and our findings on the dynamics of networks and communities may provide useful insight for understanding how patterns of social interaction are influenced by extreme events. PMID:25346468

Network Structure and Community Evolution on Twitter: Human Behavior Change in Response to the 2011 Japanese Earthquake and Tsunami

NASA Astrophysics Data System (ADS)

Lu, Xin; Brelsford, Christa

2014-10-01

To investigate the dynamics of social networks and the formation and evolution of online communities in response to extreme events, we collected three datasets from Twitter shortly before and after the 2011 earthquake and tsunami in Japan. We find that while almost all users increased their online activity after the earthquake, Japanese speakers, who are assumed to be more directly affected by the event, expanded the network of people they interact with to a much higher degree than English speakers or the global average. By investigating the evolution of communities, we find that the behavior of joining or quitting a community is far from random: users tend to stay in their current status and are less likely to join new communities from solitary or shift to other communities from their current community. While non-Japanese speakers did not change their conversation topics significantly after the earthquake, nearly all Japanese users changed their conversations to earthquake-related content. This study builds a systematic framework for investigating human behaviors under extreme events with online social network data and our findings on the dynamics of networks and communities may provide useful insight for understanding how patterns of social interaction are influenced by extreme events.

Reward-Modulated Hebbian Plasticity as Leverage for Partially Embodied Control in Compliant Robotics

PubMed Central

Burms, Jeroen; Caluwaerts, Ken; Dambre, Joni

2015-01-01

In embodied computation (or morphological computation), part of the complexity of motor control is offloaded to the body dynamics. We demonstrate that a simple Hebbian-like learning rule can be used to train systems with (partial) embodiment, and can be extended outside of the scope of traditional neural networks. To this end, we apply the learning rule to optimize the connection weights of recurrent neural networks with different topologies and for various tasks. We then apply this learning rule to a simulated compliant tensegrity robot by optimizing static feedback controllers that directly exploit the dynamics of the robot body. This leads to partially embodied controllers, i.e., hybrid controllers that naturally integrate the computations that are performed by the robot body into a neural network architecture. Our results demonstrate the universal applicability of reward-modulated Hebbian learning. Furthermore, they demonstrate the robustness of systems trained with the learning rule. This study strengthens our belief that compliant robots should or can be seen as computational units, instead of dumb hardware that needs a complex controller. This link between compliant robotics and neural networks is also the main reason for our search for simple universal learning rules for both neural networks and robotics. PMID:26347645

Phase Resetting Reveals Network Dynamics Underlying a Bacterial Cell Cycle

PubMed Central

Lin, Yihan; Li, Ying; Crosson, Sean; Dinner, Aaron R.; Scherer, Norbert F.

2012-01-01

Genomic and proteomic methods yield networks of biological regulatory interactions but do not provide direct insight into how those interactions are organized into functional modules, or how information flows from one module to another. In this work we introduce an approach that provides this complementary information and apply it to the bacterium Caulobacter crescentus, a paradigm for cell-cycle control. Operationally, we use an inducible promoter to express the essential transcriptional regulatory gene ctrA in a periodic, pulsed fashion. This chemical perturbation causes the population of cells to divide synchronously, and we use the resulting advance or delay of the division times of single cells to construct a phase resetting curve. We find that delay is strongly favored over advance. This finding is surprising since it does not follow from the temporal expression profile of CtrA and, in turn, simulations of existing network models. We propose a phenomenological model that suggests that the cell-cycle network comprises two distinct functional modules that oscillate autonomously and couple in a highly asymmetric fashion. These features collectively provide a new mechanism for tight temporal control of the cell cycle in C. crescentus. We discuss how the procedure can serve as the basis for a general approach for probing network dynamics, which we term chemical perturbation spectroscopy (CPS). PMID:23209388

Phase resetting reveals network dynamics underlying a bacterial cell cycle.

PubMed

Lin, Yihan; Li, Ying; Crosson, Sean; Dinner, Aaron R; Scherer, Norbert F

2012-01-01

Genomic and proteomic methods yield networks of biological regulatory interactions but do not provide direct insight into how those interactions are organized into functional modules, or how information flows from one module to another. In this work we introduce an approach that provides this complementary information and apply it to the bacterium Caulobacter crescentus, a paradigm for cell-cycle control. Operationally, we use an inducible promoter to express the essential transcriptional regulatory gene ctrA in a periodic, pulsed fashion. This chemical perturbation causes the population of cells to divide synchronously, and we use the resulting advance or delay of the division times of single cells to construct a phase resetting curve. We find that delay is strongly favored over advance. This finding is surprising since it does not follow from the temporal expression profile of CtrA and, in turn, simulations of existing network models. We propose a phenomenological model that suggests that the cell-cycle network comprises two distinct functional modules that oscillate autonomously and couple in a highly asymmetric fashion. These features collectively provide a new mechanism for tight temporal control of the cell cycle in C. crescentus. We discuss how the procedure can serve as the basis for a general approach for probing network dynamics, which we term chemical perturbation spectroscopy (CPS).

TinyONet: A Cache-Based Sensor Network Bridge Enabling Sensing Data Reusability and Customized Wireless Sensor Network Services

PubMed Central

Jung, Eui-Hyun; Park, Yong-Jin

2008-01-01

In recent years, a few protocol bridge research projects have been announced to enable a seamless integration of Wireless Sensor Networks (WSNs) with the TCP/IP network. These studies have ensured the transparent end-to-end communication between two network sides in the node-centric manner. Researchers expect this integration will trigger the development of various application domains. However, prior research projects have not fully explored some essential features for WSNs, especially the reusability of sensing data and the data-centric communication. To resolve these issues, we suggested a new protocol bridge system named TinyONet. In TinyONet, virtual sensors play roles as virtual counterparts of physical sensors and they dynamically group to make a functional entity, Slice. Instead of direct interaction with individual physical sensors, each sensor application uses its own WSN service provided by Slices. If a new kind of service is required in TinyONet, the corresponding function can be dynamically added at runtime. Beside the data-centric communication, it also supports the node-centric communication and the synchronous access. In order to show the effectiveness of the system, we implemented TinyONet on an embedded Linux machine and evaluated it with several experimental scenarios. PMID:27873968

Evolutionary method for finding communities in bipartite networks.

PubMed

Zhan, Weihua; Zhang, Zhongzhi; Guan, Jihong; Zhou, Shuigeng

2011-06-01

An important step in unveiling the relation between network structure and dynamics defined on networks is to detect communities, and numerous methods have been developed separately to identify community structure in different classes of networks, such as unipartite networks, bipartite networks, and directed networks. Here, we show that the finding of communities in such networks can be unified in a general framework-detection of community structure in bipartite networks. Moreover, we propose an evolutionary method for efficiently identifying communities in bipartite networks. To this end, we show that both unipartite and directed networks can be represented as bipartite networks, and their modularity is completely consistent with that for bipartite networks, the detection of modular structure on which can be reformulated as modularity maximization. To optimize the bipartite modularity, we develop a modified adaptive genetic algorithm (MAGA), which is shown to be especially efficient for community structure detection. The high efficiency of the MAGA is based on the following three improvements we make. First, we introduce a different measure for the informativeness of a locus instead of the standard deviation, which can exactly determine which loci mutate. This measure is the bias between the distribution of a locus over the current population and the uniform distribution of the locus, i.e., the Kullback-Leibler divergence between them. Second, we develop a reassignment technique for differentiating the informative state a locus has attained from the random state in the initial phase. Third, we present a modified mutation rule which by incorporating related operations can guarantee the convergence of the MAGA to the global optimum and can speed up the convergence process. Experimental results show that the MAGA outperforms existing methods in terms of modularity for both bipartite and unipartite networks.

Optimal Objective-Based Experimental Design for Uncertain Dynamical Gene Networks with Experimental Error.

PubMed

Mohsenizadeh, Daniel N; Dehghannasiri, Roozbeh; Dougherty, Edward R

2018-01-01

In systems biology, network models are often used to study interactions among cellular components, a salient aim being to develop drugs and therapeutic mechanisms to change the dynamical behavior of the network to avoid undesirable phenotypes. Owing to limited knowledge, model uncertainty is commonplace and network dynamics can be updated in different ways, thereby giving multiple dynamic trajectories, that is, dynamics uncertainty. In this manuscript, we propose an experimental design method that can effectively reduce the dynamics uncertainty and improve performance in an interaction-based network. Both dynamics uncertainty and experimental error are quantified with respect to the modeling objective, herein, therapeutic intervention. The aim of experimental design is to select among a set of candidate experiments the experiment whose outcome, when applied to the network model, maximally reduces the dynamics uncertainty pertinent to the intervention objective.

River landscapes and optimal channel networks.

PubMed

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

2018-06-26

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

Quantitative implementation of the endogenous molecular-cellular network hypothesis in hepatocellular carcinoma.

PubMed

Wang, Gaowei; Zhu, Xiaomei; Gu, Jianren; Ao, Ping

2014-06-06

A quantitative hypothesis for cancer genesis and progression-the endogenous molecular-cellular network hypothesis, intended to include both genetic and epigenetic causes of cancer-has been proposed recently. Using this hypothesis, here we address the molecular basis for maintaining normal liver and hepatocellular carcinoma (HCC), and the potential strategy to cure or relieve HCC. First, we elaborate the basic assumptions of the hypothesis and establish a core working network of HCC according to the hypothesis. Second, we quantify the working network by a nonlinear dynamical system. We show that the working network reproduces the main known features of normal liver and HCC at both the modular and molecular levels. Lastly, the validated working network reveals that (i) specific positive feedback loops are responsible for the maintenance of normal liver and HCC; (ii) inhibiting proliferation and inflammation-related positive feedback loops and simultaneously inducing a liver-specific positive feedback loop is predicated as a potential strategy to cure or relieve HCC; and (iii) the genesis and regression of HCC are asymmetric. In light of the characteristic properties of the nonlinear dynamical system, we demonstrate that positive feedback loops must exist as a simple and general molecular basis for the maintenance of heritable phenotypes, such as normal liver and HCC, and regulating the positive feedback loops directly or indirectly provides potential strategies to cure or relieve HCC.

Modular verification of chemical reaction network encodings via serializability analysis

PubMed Central

Lakin, Matthew R.; Stefanovic, Darko; Phillips, Andrew

2015-01-01

Chemical reaction networks are a powerful means of specifying the intended behaviour of synthetic biochemical systems. A high-level formal specification, expressed as a chemical reaction network, may be compiled into a lower-level encoding, which can be directly implemented in wet chemistry and may itself be expressed as a chemical reaction network. Here we present conditions under which a lower-level encoding correctly emulates the sequential dynamics of a high-level chemical reaction network. We require that encodings are transactional, such that their execution is divided by a “commit reaction” that irreversibly separates the reactant-consuming phase of the encoding from the product-generating phase. We also impose restrictions on the sharing of species between reaction encodings, based on a notion of “extra tolerance”, which defines species that may be shared between encodings without enabling unwanted reactions. Our notion of correctness is serializability of interleaved reaction encodings, and if all reaction encodings satisfy our correctness properties then we can infer that the global dynamics of the system are correct. This allows us to infer correctness of any system constructed using verified encodings. As an example, we show how this approach may be used to verify two- and four-domain DNA strand displacement encodings of chemical reaction networks, and we generalize our result to the limit where the populations of helper species are unlimited. PMID:27325906

From neurons to epidemics: How trophic coherence affects spreading processes

NASA Astrophysics Data System (ADS)

Klaise, Janis; Johnson, Samuel

2016-06-01

Trophic coherence, a measure of the extent to which the nodes of a directed network are organised in levels, has recently been shown to be closely related to many structural and dynamical aspects of complex systems, including graph eigenspectra, the prevalence or absence of feedback cycles, and linear stability. Furthermore, non-trivial trophic structures have been observed in networks of neurons, species, genes, metabolites, cellular signalling, concatenated words, P2P users, and world trade. Here, we consider two simple yet apparently quite different dynamical models—one a susceptible-infected-susceptible epidemic model adapted to include complex contagion and the other an Amari-Hopfield neural network—and show that in both cases the related spreading processes are modulated in similar ways by the trophic coherence of the underlying networks. To do this, we propose a network assembly model which can generate structures with tunable trophic coherence, limiting in either perfectly stratified networks or random graphs. We find that trophic coherence can exert a qualitative change in spreading behaviour, determining whether a pulse of activity will percolate through the entire network or remain confined to a subset of nodes, and whether such activity will quickly die out or endure indefinitely. These results could be important for our understanding of phenomena such as epidemics, rumours, shocks to ecosystems, neuronal avalanches, and many other spreading processes.

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

NASA Astrophysics Data System (ADS)

Coffey, T.

2016-02-01

Distributary channel bifurcations on river deltas are important features in both actively prograding river deltas and in lithified deltas within the stratigraphic record. Attributes of distributary channels have long been thought to be defined by flow velocity, grain size and channel aspect ratio where the channel enters the basin. Interestingly, bifurcations in groundwater-fed tributary networks have been shown to grow and bifurcate independent of flow within the exposed channel network. These networks possess a characteristic bifurcation angle of 72°, based on Laplacian flow (water surface concavity equals zero) in the groundwater flow field near tributary channel tips. Based on the tributary channel model, we develop and test the hypothesis that bifurcation angles in distributary channels are likewise dictated by the external flow field, in this case the surface water surrounding the subaqueous portion of distributary channel tips in a deltaic setting. We measured 64 unique distributary bifurcations in an experimental delta, yielding a characteristic angle of 70.2°±2.2° (95% confidence interval), in line with the theoretical prediction for tributary channels. This similarity between bifurcation angles suggests that (A) flow directly outside of the distributary network is Laplacian, (B) the external flow field controls the bifurcation dynamics of distributary channels, and (C) that flow within the channel plays a secondary role in network dynamics.

Spontaneous Symmetry Breaking in Interdependent Networked Game

PubMed Central

Jin, Qing; Wang, Lin; Xia, Cheng-Yi; Wang, Zhen

2014-01-01

Spatial evolution game has traditionally assumed that players interact with direct neighbors on a single network, which is isolated and not influenced by other systems. However, this is not fully consistent with recent research identification that interactions between networks play a crucial rule for the outcome of evolutionary games taking place on them. In this work, we introduce the simple game model into the interdependent networks composed of two networks. By means of imitation dynamics, we display that when the interdependent factor α is smaller than a threshold value αC, the symmetry of cooperation can be guaranteed. Interestingly, as interdependent factor exceeds αC, spontaneous symmetry breaking of fraction of cooperators presents itself between different networks. With respect to the breakage of symmetry, it is induced by asynchronous expansion between heterogeneous strategy couples of both networks, which further enriches the content of spatial reciprocity. Moreover, our results can be well predicted by the strategy-couple pair approximation method. PMID:24526076

Supply network configuration—A benchmarking problem

NASA Astrophysics Data System (ADS)

Brandenburg, Marcus

2018-03-01

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

Distributed containment control of heterogeneous fractional-order multi-agent systems with communication delays

NASA Astrophysics Data System (ADS)

Yang, Hongyong; Han, Fujun; Zhao, Mei; Zhang, Shuning; Yue, Jun

2017-08-01

Because many networked systems can only be characterized with fractional-order dynamics in complex environments, fractional-order calculus has been studied deeply recently. When diverse individual features are shown in different agents of networked systems, heterogeneous fractional-order dynamics will be used to describe the complex systems. Based on the distinguishing properties of agents, heterogeneous fractional-order multi-agent systems (FOMAS) are presented. With the supposition of multiple leader agents in FOMAS, distributed containment control of FOMAS is studied in directed weighted topologies. By applying Laplace transformation and frequency domain theory of the fractional-order operator, an upper bound of delays is obtained to ensure containment consensus of delayed heterogenous FOMAS. Consensus results of delayed FOMAS in this paper can be extended to systems with integer-order models. Finally, numerical examples are used to verify our results.

Synchronization of Coupled Dynamical Systems: Tolerance to Weak Connectivity and Arbitrarily Bounded Time-Varying Delays

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

Meng, Ziyang; Yang, Tao; Li, Guoqi

We study synchronization of coupled linear systems over networks with weak connectivity and time-varying delays. We focus on the case that the internal dynamics are time-varying but non-expansive. Both uniformly connected and infinitely connected communication topologies are considered. A new concept of P-synchronization is introduced and we first show that global asymptotic P-synchronization can be achieved over directed networks with uniform joint connectivity and arbitrarily bounded delays. We then study the case of the infinitely jointly connected communication topology. In particular, for the undirected communication topologies, it turns out that the existence of a uniform time interval for the communicationmore » topology is not necessary and P-synchronization can be achieved when the time varying delays are arbitrarily bounded. Simulations are given to validate the theoretical results.« less

Restricted Complexity Framework for Nonlinear Adaptive Control in Complex Systems

NASA Astrophysics Data System (ADS)

Williams, Rube B.

2004-02-01

Control law adaptation that includes implicit or explicit adaptive state estimation, can be a fundamental underpinning for the success of intelligent control in complex systems, particularly during subsystem failures, where vital system states and parameters can be impractical or impossible to measure directly. A practical algorithm is proposed for adaptive state filtering and control in nonlinear dynamic systems when the state equations are unknown or are too complex to model analytically. The state equations and inverse plant model are approximated by using neural networks. A framework for a neural network based nonlinear dynamic inversion control law is proposed, as an extrapolation of prior developed restricted complexity methodology used to formulate the adaptive state filter. Examples of adaptive filter performance are presented for an SSME simulation with high pressure turbine failure to support extrapolations to adaptive control problems.

Assembly of Reconfigurable Colloidal Structures by Multidirectional Field-Induced Interactions.

PubMed

Bharti, Bhuvnesh; Velev, Orlin D

2015-07-28

Field-directed colloidal assembly has shown remarkable recent progress in increasing the complexity, degree of control, and multiscale organization of the structures. This has largely been achieved by using particles of complex shapes and polarizabilites (Janus, patchy, shaped, and faceted). We review the fundamentals of the interactions leading to the directed assembly of such structures, the ways to simulate the dynamics of the process, and the effect of particle size, shape, and properties on the type of structure obtained. We discuss how directional polarization interactions induced by external electric and magnetic fields can be used to assemble complex particles or particle mixtures into lattices of tailored structure. Examples of such systems include isotropic and anisotropic shaped particles with surface patches, which form networks and crystals of unusual symmetry by dipolar, quadrupolar, and multipolar interactions in external fields. The emerging trends in making reconfigurable and dynamic structures are discussed.

Organization of excitable dynamics in hierarchical biological networks.

PubMed

Müller-Linow, Mark; Hilgetag, Claus C; Hütt, Marc-Thorsten

2008-09-26

This study investigates the contributions of network topology features to the dynamic behavior of hierarchically organized excitable networks. Representatives of different types of hierarchical networks as well as two biological neural networks are explored with a three-state model of node activation for systematically varying levels of random background network stimulation. The results demonstrate that two principal topological aspects of hierarchical networks, node centrality and network modularity, correlate with the network activity patterns at different levels of spontaneous network activation. The approach also shows that the dynamic behavior of the cerebral cortical systems network in the cat is dominated by the network's modular organization, while the activation behavior of the cellular neuronal network of Caenorhabditis elegans is strongly influenced by hub nodes. These findings indicate the interaction of multiple topological features and dynamic states in the function of complex biological networks.

Recurrent network dynamics reconciles visual motion segmentation and integration.

PubMed

Medathati, N V Kartheek; Rankin, James; Meso, Andrew I; Kornprobst, Pierre; Masson, Guillaume S

2017-09-12

In sensory systems, a range of computational rules are presumed to be implemented by neuronal subpopulations with different tuning functions. For instance, in primate cortical area MT, different classes of direction-selective cells have been identified and related either to motion integration, segmentation or transparency. Still, how such different tuning properties are constructed is unclear. The dominant theoretical viewpoint based on a linear-nonlinear feed-forward cascade does not account for their complex temporal dynamics and their versatility when facing different input statistics. Here, we demonstrate that a recurrent network model of visual motion processing can reconcile these different properties. Using a ring network, we show how excitatory and inhibitory interactions can implement different computational rules such as vector averaging, winner-take-all or superposition. The model also captures ordered temporal transitions between these behaviors. In particular, depending on the inhibition regime the network can switch from motion integration to segmentation, thus being able to compute either a single pattern motion or to superpose multiple inputs as in motion transparency. We thus demonstrate that recurrent architectures can adaptively give rise to different cortical computational regimes depending upon the input statistics, from sensory flow integration to segmentation.

Shifted dynamic interactions between subcortical nuclei and inferior frontal gyri during response preparation in persistent developmental stuttering.

PubMed

Metzger, F Luise; Auer, Tibor; Helms, Gunther; Paulus, Walter; Frahm, Jens; Sommer, Martin; Neef, Nicole E

2018-01-01

Persistent developmental stuttering is associated with basal ganglia dysfunction or dopamine dysregulation. Here, we studied whole-brain functional connectivity to test how basal ganglia structures coordinate and reorganize sensorimotor brain networks in stuttering. To this end, adults who stutter and fluent speakers (control participants) performed a response anticipation paradigm in the MRI scanner. The preparation of a manual Go/No-Go response reliably produced activity in the basal ganglia and thalamus and particularly in the substantia nigra. Strikingly, in adults who stutter, substantia nigra activity correlated positively with stuttering severity. Furthermore, functional connectivity analyses yielded altered task-related network formations in adults who stutter compared to fluent speakers. Specifically, in adults who stutter, the globus pallidus and the thalamus showed increased network synchronization with the inferior frontal gyrus. This implies dynamic shifts in the response preparation-related network organization through the basal ganglia in the context of a non-speech motor task in stuttering. Here we discuss current findings in the traditional framework of how D1 and D2 receptor activity shapes focused movement selection, thereby suggesting a disproportional involvement of the direct and the indirect pathway in stuttering.

The dynamics of social networks among female Asian elephants

PubMed Central

2011-01-01

Background Patterns in the association of individuals can shed light on the underlying conditions and processes that shape societies. Here we characterize patterns of association in a population of wild Asian Elephants at Uda Walawe National Park in Sri Lanka. We observed 286 individually-identified adult female elephants over 20 months and examined their social dynamics at three levels of organization: pairs of individuals (dyads), small sets of direct companions (ego-networks), and the population level (complete networks). Results Corroborating previous studies of this and other Asian elephant populations, we find that the sizes of elephant groups observed in the field on any particular day are typically small and that rates of association are low. In contrast to earlier studies, our longitudinal observations reveal that individuals form larger social units that can be remarkably stable across years while associations among such units change across seasons. Association rates tend to peak in dry seasons as opposed to wet seasons, with some cyclicity at the level of dyads. In addition, we find that individuals vary substantially in their fidelity to companions. At the ego-network level, we find that despite these fluctuations, individuals associate with a pool of long-term companions. At the population level, social networks do not exhibit any clear seasonal structure or hierarchical stratification. Conclusions This detailed longitudinal study reveals different social dynamics at different levels of organization. Taken together, these results demonstrate that low association rates, seemingly small group sizes, and fission-fusion grouping behavior mask hidden stability in the extensive and fluid social affiliations in this population of Asian elephants. PMID:21794147

Neural network approach to time-dependent dividing surfaces in classical reaction dynamics.

PubMed

Schraft, Philippe; Junginger, Andrej; Feldmaier, Matthias; Bardakcioglu, Robin; Main, Jörg; Wunner, Günter; Hernandez, Rigoberto

2018-04-01

In a dynamical system, the transition between reactants and products is typically mediated by an energy barrier whose properties determine the corresponding pathways and rates. The latter is the flux through a dividing surface (DS) between the two corresponding regions, and it is exact only if it is free of recrossings. For time-independent barriers, the DS can be attached to the top of the corresponding saddle point of the potential energy surface, and in time-dependent systems, the DS is a moving object. The precise determination of these direct reaction rates, e.g., using transition state theory, requires the actual construction of a DS for a given saddle geometry, which is in general a demanding methodical and computational task, especially in high-dimensional systems. In this paper, we demonstrate how such time-dependent, global, and recrossing-free DSs can be constructed using neural networks. In our approach, the neural network uses the bath coordinates and time as input, and it is trained in a way that its output provides the position of the DS along the reaction coordinate. An advantage of this procedure is that, once the neural network is trained, the complete information about the dynamical phase space separation is stored in the network's parameters, and a precise distinction between reactants and products can be made for all possible system configurations, all times, and with little computational effort. We demonstrate this general method for two- and three-dimensional systems and explain its straightforward extension to even more degrees of freedom.

Neural network approach to time-dependent dividing surfaces in classical reaction dynamics

NASA Astrophysics Data System (ADS)

Schraft, Philippe; Junginger, Andrej; Feldmaier, Matthias; Bardakcioglu, Robin; Main, Jörg; Wunner, Günter; Hernandez, Rigoberto

2018-04-01

In a dynamical system, the transition between reactants and products is typically mediated by an energy barrier whose properties determine the corresponding pathways and rates. The latter is the flux through a dividing surface (DS) between the two corresponding regions, and it is exact only if it is free of recrossings. For time-independent barriers, the DS can be attached to the top of the corresponding saddle point of the potential energy surface, and in time-dependent systems, the DS is a moving object. The precise determination of these direct reaction rates, e.g., using transition state theory, requires the actual construction of a DS for a given saddle geometry, which is in general a demanding methodical and computational task, especially in high-dimensional systems. In this paper, we demonstrate how such time-dependent, global, and recrossing-free DSs can be constructed using neural networks. In our approach, the neural network uses the bath coordinates and time as input, and it is trained in a way that its output provides the position of the DS along the reaction coordinate. An advantage of this procedure is that, once the neural network is trained, the complete information about the dynamical phase space separation is stored in the network's parameters, and a precise distinction between reactants and products can be made for all possible system configurations, all times, and with little computational effort. We demonstrate this general method for two- and three-dimensional systems and explain its straightforward extension to even more degrees of freedom.

Mapping hydration dynamics around a protein surface

PubMed Central

Zhang, Luyuan; Wang, Lijuan; Kao, Ya-Ting; Qiu, Weihong; Yang, Yi; Okobiah, Oghaghare; Zhong, Dongping

2007-01-01

Protein surface hydration is fundamental to its structure and activity. We report here the direct mapping of global hydration dynamics around a protein in its native and molten globular states, using a tryptophan scan by site-specific mutations. With 16 tryptophan mutants and in 29 different positions and states, we observed two robust, distinct water dynamics in the hydration layer on a few (≈1–8 ps) and tens to hundreds of picoseconds (≈20–200 ps), representing the initial local relaxation and subsequent collective network restructuring, respectively. Both time scales are strongly correlated with protein's structural and chemical properties. These results reveal the intimate relationship between hydration dynamics and protein fluctuations and such biologically relevant water–protein interactions fluctuate on picosecond time scales. PMID:18003912

Dynamics of place, boundary and object encoding in rat anterior claustrum

PubMed Central

Jankowski, Maciej M.; O’Mara, Shane M.

2015-01-01

Discrete populations of brain cells signal differing types of spatial information. These “spatial cells” are largely confined to a closely-connected network of sites. We describe here, for the first time, cells in the anterior claustrum of the freely-moving rat encoding place, boundary and object information. This novel claustral spatial signal potentially directly modulates a wide variety of anterior cortical regions. We hypothesize that one of the functions of the claustrum is to provide information about body position, boundaries and landmark information, enabling dynamic control of behavior. PMID:26557060

Comparative Investigation of Normal Modes and Molecular Dynamics of Hepatitis C NS5B Protein

NASA Astrophysics Data System (ADS)

Asafi, M. S.; Yildirim, A.; Tekpinar, M.

2016-04-01

Understanding dynamics of proteins has many practical implications in terms of finding a cure for many protein related diseases. Normal mode analysis and molecular dynamics methods are widely used physics-based computational methods for investigating dynamics of proteins. In this work, we studied dynamics of Hepatitis C NS5B protein with molecular dynamics and normal mode analysis. Principal components obtained from a 100 nanoseconds molecular dynamics simulation show good overlaps with normal modes calculated with a coarse-grained elastic network model. Coarse-grained normal mode analysis takes at least an order of magnitude shorter time. Encouraged by this good overlaps and short computation times, we analyzed further low frequency normal modes of Hepatitis C NS5B. Motion directions and average spatial fluctuations have been analyzed in detail. Finally, biological implications of these motions in drug design efforts against Hepatitis C infections have been elaborated.

Impaired social brain network for processing dynamic facial expressions in autism spectrum disorders

PubMed Central

2012-01-01

Background Impairment of social interaction via facial expressions represents a core clinical feature of autism spectrum disorders (ASD). However, the neural correlates of this dysfunction remain unidentified. Because this dysfunction is manifested in real-life situations, we hypothesized that the observation of dynamic, compared with static, facial expressions would reveal abnormal brain functioning in individuals with ASD. We presented dynamic and static facial expressions of fear and happiness to individuals with high-functioning ASD and to age- and sex-matched typically developing controls and recorded their brain activities using functional magnetic resonance imaging (fMRI). Result Regional analysis revealed reduced activation of several brain regions in the ASD group compared with controls in response to dynamic versus static facial expressions, including the middle temporal gyrus (MTG), fusiform gyrus, amygdala, medial prefrontal cortex, and inferior frontal gyrus (IFG). Dynamic causal modeling analyses revealed that bi-directional effective connectivity involving the primary visual cortex–MTG–IFG circuit was enhanced in response to dynamic as compared with static facial expressions in the control group. Group comparisons revealed that all these modulatory effects were weaker in the ASD group than in the control group. Conclusions These results suggest that weak activity and connectivity of the social brain network underlie the impairment in social interaction involving dynamic facial expressions in individuals with ASD. PMID:22889284

Research on Social Networking Sites and Social Support from 2004 to 2015: A Narrative Review and Directions for Future Research.

PubMed

Meng, Jingbo; Martinez, Lourdes; Holmstrom, Amanda; Chung, Minwoong; Cox, Jeff

2017-01-01

The article presents a narrative review of scholarship on social support through social networking sites (SNSs) published from 2004 to 2015. By searching keywords related to social support and SNSs in major databases for social sciences, we identified and content analyzed directly relevant articles (N = 88). The article summarizes the prevalence of theory usage; the function of theory usage (e.g., testing a theory, developing a theory); major theories referenced; and methodologies, including research designs, measurement, and the roles of social support and SNS examined in this literature. It also reports four themes identified across the studies, indicating the trends in the current research. Based on the review, the article presents a discussion about study sites, conceptualization of social support, theoretical coherence, the role of social networks, and the dynamic relationships between SNS use and social support, which points out potential avenues for shaping a future research agenda.

Future Directions for Examination of Brain Networks in Neurodevelopmental Disorders.

PubMed

Uddin, Lucina Q; Karlsgodt, Katherine H

2018-01-01

Neurodevelopmental disorders are associated with atypical development and maturation of brain networks. A recent focus on human connectomics research and the growing popularity of open science initiatives has created the ideal climate in which to make real progress toward understanding the neurobiology of disorders affecting youth. Here we outline future directions for neuroscience researchers examining brain networks in neurodevelopmental disorders, highlighting gaps in the current literature. We emphasize the importance of leveraging large neuroimaging and phenotypic data sets recently made available to the research community, and we suggest specific novel methodological approaches, including analysis of brain dynamics and structural connectivity, that have the potential to produce the greatest clinical insight. Transdiagnostic approaches will also become increasingly necessary as the Research Domain Criteria framework put forth by the National Institute of Mental Health permeates scientific discourse. During this exciting era of big data and increased computational sophistication of analytic tools, the possibilities for significant advancement in understanding neurodevelopmental disorders are limitless.