A Multiobjective Sparse Feature Learning Model for Deep Neural Networks.

Science.gov (United States)

Gong, Maoguo; Liu, Jia; Li, Hao; Cai, Qing; Su, Linzhi

2015-12-01

Hierarchical deep neural networks are currently popular learning models for imitating the hierarchical architecture of human brain. Single-layer feature extractors are the bricks to build deep networks. Sparse feature learning models are popular models that can learn useful representations. But most of those models need a user-defined constant to control the sparsity of representations. In this paper, we propose a multiobjective sparse feature learning model based on the autoencoder. The parameters of the model are learnt by optimizing two objectives, reconstruction error and the sparsity of hidden units simultaneously to find a reasonable compromise between them automatically. We design a multiobjective induced learning procedure for this model based on a multiobjective evolutionary algorithm. In the experiments, we demonstrate that the learning procedure is effective, and the proposed multiobjective model can learn useful sparse features.

Population coding in sparsely connected networks of noisy neurons.

Science.gov (United States)

Tripp, Bryan P; Orchard, Jeff

2012-01-01

This study examines the relationship between population coding and spatial connection statistics in networks of noisy neurons. Encoding of sensory information in the neocortex is thought to require coordinated neural populations, because individual cortical neurons respond to a wide range of stimuli, and exhibit highly variable spiking in response to repeated stimuli. Population coding is rooted in network structure, because cortical neurons receive information only from other neurons, and because the information they encode must be decoded by other neurons, if it is to affect behavior. However, population coding theory has often ignored network structure, or assumed discrete, fully connected populations (in contrast with the sparsely connected, continuous sheet of the cortex). In this study, we modeled a sheet of cortical neurons with sparse, primarily local connections, and found that a network with this structure could encode multiple internal state variables with high signal-to-noise ratio. However, we were unable to create high-fidelity networks by instantiating connections at random according to spatial connection probabilities. In our models, high-fidelity networks required additional structure, with higher cluster factors and correlations between the inputs to nearby neurons.

An investigation of 'sparse channel networks'. Characteristic behaviours and their causes

International Nuclear Information System (INIS)

Black, J.H.; Barker, J.A.; Woodman, N.D.

2007-09-01

This report represents a third study in a series concerned with groundwater flow in poorly permeable fractured crystalline rocks. The study has brought together three linked, but distinct, elements; a mathematical analysis of the intersection of ellipses, a review of field measurements associated with nuclear waste repository investigations and probabilistic simulations using a lattice network numerical model. We conclude that the model of channels that traverse fracture intersections without necessarily branching is a very likely representation of reality. More generally, assembling all the lines of evidence, it is suggested that groundwater flow systems in fractured crystalline rocks in the environs of underground laboratories have the following characteristics: Groundwater flows within a sparse network of channels just above the percolation limit. The frequency of intersections is low in that individual channels extend considerable distances between significant junctions. Individual channels often extend over many fracture surfaces and the resulting flow system is only weakly related to the density or size of mappable fractures. The sparseness of systems compared to the size of drifts and tunnels means that only a very few flow channels are intersected by drifts and tunnels. Highly convergent flow is required to connect to the rest of the network and this is misinterpreted as a skin of low hydraulic conductivity. Systems are so sparse that they are controlled by a few 'chokes' that give rise to compartments of head, and probably, of groundwater chemistry. Channels occur on all fracture planes, including those within fracture zones, and although the characteristics of the fracture zone channel networks may differ from those in surrounding rocks, they are nonetheless still channel networks. The actively flowing sparse channel network, occurring within any particular rock, is a naturally selected, small sub-set of the available channels. Hence, there are many

Sparse dynamics for partial differential equations.

Science.gov (United States)

Schaeffer, Hayden; Caflisch, Russel; Hauck, Cory D; Osher, Stanley

2013-04-23

We investigate the approximate dynamics of several differential equations when the solutions are restricted to a sparse subset of a given basis. The restriction is enforced at every time step by simply applying soft thresholding to the coefficients of the basis approximation. By reducing or compressing the information needed to represent the solution at every step, only the essential dynamics are represented. In many cases, there are natural bases derived from the differential equations, which promote sparsity. We find that our method successfully reduces the dynamics of convection equations, diffusion equations, weak shocks, and vorticity equations with high-frequency source terms.

Network dynamics with BrainX(3): a large-scale simulation of the human brain network with real-time interaction.

Science.gov (United States)

Arsiwalla, Xerxes D; Zucca, Riccardo; Betella, Alberto; Martinez, Enrique; Dalmazzo, David; Omedas, Pedro; Deco, Gustavo; Verschure, Paul F M J

2015-01-01

BrainX(3) is a large-scale simulation of human brain activity with real-time interaction, rendered in 3D in a virtual reality environment, which combines computational power with human intuition for the exploration and analysis of complex dynamical networks. We ground this simulation on structural connectivity obtained from diffusion spectrum imaging data and model it on neuronal population dynamics. Users can interact with BrainX(3) in real-time by perturbing brain regions with transient stimulations to observe reverberating network activity, simulate lesion dynamics or implement network analysis functions from a library of graph theoretic measures. BrainX(3) can thus be used as a novel immersive platform for exploration and analysis of dynamical activity patterns in brain networks, both at rest or in a task-related state, for discovery of signaling pathways associated to brain function and/or dysfunction and as a tool for virtual neurosurgery. Our results demonstrate these functionalities and shed insight on the dynamics of the resting-state attractor. Specifically, we found that a noisy network seems to favor a low firing attractor state. We also found that the dynamics of a noisy network is less resilient to lesions. Our simulations on TMS perturbations show that even though TMS inhibits most of the network, it also sparsely excites a few regions. This is presumably due to anti-correlations in the dynamics and suggests that even a lesioned network can show sparsely distributed increased activity compared to healthy resting-state, over specific brain areas.

Network dynamics with BrainX3: a large-scale simulation of the human brain network with real-time interaction

Science.gov (United States)

Arsiwalla, Xerxes D.; Zucca, Riccardo; Betella, Alberto; Martinez, Enrique; Dalmazzo, David; Omedas, Pedro; Deco, Gustavo; Verschure, Paul F. M. J.

2015-01-01

BrainX3 is a large-scale simulation of human brain activity with real-time interaction, rendered in 3D in a virtual reality environment, which combines computational power with human intuition for the exploration and analysis of complex dynamical networks. We ground this simulation on structural connectivity obtained from diffusion spectrum imaging data and model it on neuronal population dynamics. Users can interact with BrainX3 in real-time by perturbing brain regions with transient stimulations to observe reverberating network activity, simulate lesion dynamics or implement network analysis functions from a library of graph theoretic measures. BrainX3 can thus be used as a novel immersive platform for exploration and analysis of dynamical activity patterns in brain networks, both at rest or in a task-related state, for discovery of signaling pathways associated to brain function and/or dysfunction and as a tool for virtual neurosurgery. Our results demonstrate these functionalities and shed insight on the dynamics of the resting-state attractor. Specifically, we found that a noisy network seems to favor a low firing attractor state. We also found that the dynamics of a noisy network is less resilient to lesions. Our simulations on TMS perturbations show that even though TMS inhibits most of the network, it also sparsely excites a few regions. This is presumably due to anti-correlations in the dynamics and suggests that even a lesioned network can show sparsely distributed increased activity compared to healthy resting-state, over specific brain areas. PMID:25759649

Network Dynamics with BrainX3: A Large-Scale Simulation of the Human Brain Network with Real-Time Interaction

Directory of Open Access Journals (Sweden)

Xerxes D. Arsiwalla

2015-02-01

Full Text Available BrainX3 is a large-scale simulation of human brain activity with real-time interaction, rendered in 3D in a virtual reality environment, which combines computational power with human intuition for the exploration and analysis of complex dynamical networks. We ground this simulation on structural connectivity obtained from diffusion spectrum imaging data and model it on neuronal population dynamics. Users can interact with BrainX3 in real-time by perturbing brain regions with transient stimulations to observe reverberating network activity, simulate lesion dynamics or implement network analysis functions from a library of graph theoretic measures. BrainX3 can thus be used as a novel immersive platform for real-time exploration and analysis of dynamical activity patterns in brain networks, both at rest or in a task-related state, for discovery of signaling pathways associated to brain function and/or dysfunction and as a tool for virtual neurosurgery. Our results demonstrate these functionalities and shed insight on the dynamics of the resting-state attractor. Specifically, we found that a noisy network seems to favor a low firing attractor state. We also found that the dynamics of a noisy network is less resilient to lesions. Our simulations on TMS perturbations show that even though TMS inhibits most of the network, it also sparsely excites a few regions. This is presumably, due to anti-correlations in the dynamics and suggests that even a lesioned network can show sparsely distributed increased activity compared to healthy resting-state, over specific brain areas.

Reconstruction of sparse connectivity in neural networks from spike train covariances

International Nuclear Information System (INIS)

Pernice, Volker; Rotter, Stefan

2013-01-01

The inference of causation from correlation is in general highly problematic. Correspondingly, it is difficult to infer the existence of physical synaptic connections between neurons from correlations in their activity. Covariances in neural spike trains and their relation to network structure have been the subject of intense research, both experimentally and theoretically. The influence of recurrent connections on covariances can be characterized directly in linear models, where connectivity in the network is described by a matrix of linear coupling kernels. However, as indirect connections also give rise to covariances, the inverse problem of inferring network structure from covariances can generally not be solved unambiguously. Here we study to what degree this ambiguity can be resolved if the sparseness of neural networks is taken into account. To reconstruct a sparse network, we determine the minimal set of linear couplings consistent with the measured covariances by minimizing the L 1 norm of the coupling matrix under appropriate constraints. Contrary to intuition, after stochastic optimization of the coupling matrix, the resulting estimate of the underlying network is directed, despite the fact that a symmetric matrix of count covariances is used for inference. The performance of the new method is best if connections are neither exceedingly sparse, nor too dense, and it is easily applicable for networks of a few hundred nodes. Full coupling kernels can be obtained from the matrix of full covariance functions. We apply our method to networks of leaky integrate-and-fire neurons in an asynchronous–irregular state, where spike train covariances are well described by a linear model. (paper)

A Practical View on Tunable Sparse Network Coding

DEFF Research Database (Denmark)

Sørensen, Chres Wiant; Shahbaz Badr, Arash; Cabrera Guerrero, Juan Alberto

2015-01-01

Tunable sparse network coding (TSNC) constitutes a promising concept for trading off computational complexity and delay performance. This paper advocates for the use of judicious feedback as a key not only to make TSNC practical, but also to deliver a highly consistent and controlled delay perfor...

NetRaVE: constructing dependency networks using sparse linear regression

DEFF Research Database (Denmark)

Phatak, A.; Kiiveri, H.; Clemmensen, Line Katrine Harder

2010-01-01

NetRaVE is a small suite of R functions for generating dependency networks using sparse regression methods. Such networks provide an alternative to interpreting 'top n lists' of genes arising out of an analysis of microarray data, and they provide a means of organizing and visualizing the resulting...

Sparse encoding of automatic visual association in hippocampal networks

DEFF Research Database (Denmark)

Hulme, Oliver J; Skov, Martin; Chadwick, Martin J

2014-01-01

Intelligent action entails exploiting predictions about associations between elements of ones environment. The hippocampus and mediotemporal cortex are endowed with the network topology, physiology, and neurochemistry to automatically and sparsely code sensori-cognitive associations that can...

Population Coding in Sparsely Connected Networks of Noisy Neurons

Directory of Open Access Journals (Sweden)

Bryan Patrick Tripp

2012-05-01

Full Text Available This study examines the relationship between population coding and spatial connection statistics in networks of noisy neurons. Encoding of sensory information in the neocortex is thought to require coordinated neural populations, because individual cortical neurons respond to a wide range of stimuli, and exhibit highly variable spiking in response to repeated stimuli. Population coding is rooted in network structure, because cortical neurons receive information only from other neurons, and because the information they encode must be decoded by other neurons, if it is to affect behaviour. However, population coding theory has often ignored network structure, or assumed discrete, fully-connected populations (in contrast with the sparsely connected, continuous sheet of the cortex. In this study, we model a sheet of cortical neurons with sparse, primarily local connections, and find that a network with this structure can encode multiple internal state variables with high signal-to-noise ratio. However, in our model, although connection probability varies with the distance between neurons, we find that the connections cannot be instantiated at random according to these probabilities, but must have additional structure if information is to be encoded with high fidelity.

Natural image sequences constrain dynamic receptive fields and imply a sparse code.

Science.gov (United States)

Häusler, Chris; Susemihl, Alex; Nawrot, Martin P

2013-11-06

In their natural environment, animals experience a complex and dynamic visual scenery. Under such natural stimulus conditions, neurons in the visual cortex employ a spatially and temporally sparse code. For the input scenario of natural still images, previous work demonstrated that unsupervised feature learning combined with the constraint of sparse coding can predict physiologically measured receptive fields of simple cells in the primary visual cortex. This convincingly indicated that the mammalian visual system is adapted to the natural spatial input statistics. Here, we extend this approach to the time domain in order to predict dynamic receptive fields that can account for both spatial and temporal sparse activation in biological neurons. We rely on temporal restricted Boltzmann machines and suggest a novel temporal autoencoding training procedure. When tested on a dynamic multi-variate benchmark dataset this method outperformed existing models of this class. Learning features on a large dataset of natural movies allowed us to model spatio-temporal receptive fields for single neurons. They resemble temporally smooth transformations of previously obtained static receptive fields and are thus consistent with existing theories. A neuronal spike response model demonstrates how the dynamic receptive field facilitates temporal and population sparseness. We discuss the potential mechanisms and benefits of a spatially and temporally sparse representation of natural visual input. Copyright © 2013 The Authors. Published by Elsevier B.V. All rights reserved.

Clustering promotes switching dynamics in networks of noisy neurons

Science.gov (United States)

Franović, Igor; Klinshov, Vladimir

2018-02-01

Macroscopic variability is an emergent property of neural networks, typically manifested in spontaneous switching between the episodes of elevated neuronal activity and the quiescent episodes. We investigate the conditions that facilitate switching dynamics, focusing on the interplay between the different sources of noise and heterogeneity of the network topology. We consider clustered networks of rate-based neurons subjected to external and intrinsic noise and derive an effective model where the network dynamics is described by a set of coupled second-order stochastic mean-field systems representing each of the clusters. The model provides an insight into the different contributions to effective macroscopic noise and qualitatively indicates the parameter domains where switching dynamics may occur. By analyzing the mean-field model in the thermodynamic limit, we demonstrate that clustering promotes multistability, which gives rise to switching dynamics in a considerably wider parameter region compared to the case of a non-clustered network with sparse random connection topology.

Comparison of Beam-Forming and Relaying in Sparse Sensor Networks

Directory of Open Access Journals (Sweden)

Mikuláš Krebs

2015-12-01

Full Text Available This study focuses on the differences in power consumption between beam-forming and relaying data transmission methods in a sparse wireless ad-hoc network. These two methods are observed for the same parameters using an identical network topology in a simulation programme that was developed as a part of this study.

On the role of sparseness in the evolution of modularity in gene regulatory networks.

Science.gov (United States)

Espinosa-Soto, Carlos

2018-05-01

Modularity is a widespread property in biological systems. It implies that interactions occur mainly within groups of system elements. A modular arrangement facilitates adjustment of one module without perturbing the rest of the system. Therefore, modularity of developmental mechanisms is a major factor for evolvability, the potential to produce beneficial variation from random genetic change. Understanding how modularity evolves in gene regulatory networks, that create the distinct gene activity patterns that characterize different parts of an organism, is key to developmental and evolutionary biology. One hypothesis for the evolution of modules suggests that interactions between some sets of genes become maladaptive when selection favours additional gene activity patterns. The removal of such interactions by selection would result in the formation of modules. A second hypothesis suggests that modularity evolves in response to sparseness, the scarcity of interactions within a system. Here I simulate the evolution of gene regulatory networks and analyse diverse experimentally sustained networks to study the relationship between sparseness and modularity. My results suggest that sparseness alone is neither sufficient nor necessary to explain modularity in gene regulatory networks. However, sparseness amplifies the effects of forms of selection that, like selection for additional gene activity patterns, already produce an increase in modularity. That evolution of new gene activity patterns is frequent across evolution also supports that it is a major factor in the evolution of modularity. That sparseness is widespread across gene regulatory networks indicates that it may have facilitated the evolution of modules in a wide variety of cases.

Generic, network schema agnostic sparse tensor factorization for single-pass clustering of heterogeneous information networks.

Science.gov (United States)

Wu, Jibing; Meng, Qinggang; Deng, Su; Huang, Hongbin; Wu, Yahui; Badii, Atta

2017-01-01

Heterogeneous information networks (e.g. bibliographic networks and social media networks) that consist of multiple interconnected objects are ubiquitous. Clustering analysis is an effective method to understand the semantic information and interpretable structure of the heterogeneous information networks, and it has attracted the attention of many researchers in recent years. However, most studies assume that heterogeneous information networks usually follow some simple schemas, such as bi-typed networks or star network schema, and they can only cluster one type of object in the network each time. In this paper, a novel clustering framework is proposed based on sparse tensor factorization for heterogeneous information networks, which can cluster multiple types of objects simultaneously in a single pass without any network schema information. The types of objects and the relations between them in the heterogeneous information networks are modeled as a sparse tensor. The clustering issue is modeled as an optimization problem, which is similar to the well-known Tucker decomposition. Then, an Alternating Least Squares (ALS) algorithm and a feasible initialization method are proposed to solve the optimization problem. Based on the tensor factorization, we simultaneously partition different types of objects into different clusters. The experimental results on both synthetic and real-world datasets have demonstrated that our proposed clustering framework, STFClus, can model heterogeneous information networks efficiently and can outperform state-of-the-art clustering algorithms as a generally applicable single-pass clustering method for heterogeneous network which is network schema agnostic.

A Sparse Auto Encoder Deep Process Neural Network Model and its Application

Directory of Open Access Journals (Sweden)

Xu Shaohua

2017-01-01

Full Text Available Aiming at the problem of time-varying signal pattern classification, a sparse auto-encoder deep process neural network (SAE-DPNN is proposed. The input of SAE-DPNN is time-varying process signal and the output is pattern category. It combines the time-varying signal classification method of process neural network (PNN and the data feature extraction and hierarchical sparse representation mechanism of sparse automatic encoder (SAE. Based on the feedforward PNN model, SAE-DPNN is constructed by stacking the process neurons, SAE network and softmax classifier. It can maintain the time-sequence and structure of the input signal, express and synthesize the process distribution characteristics of multidimensional time-varying signals and their combinations. SAE-DPNN improves the identification of complex features and distinguishes between different types of signals, realizes the direct classification of time-varying signals. In this paper, the feature extraction and representation mechanism of time-varying signal in SAE-DPNN are analyzed, and a specific learning algorithm is given. The experimental results verify the effectiveness of the model and algorithm.

Uncovering Transcriptional Regulatory Networks by Sparse Bayesian Factor Model

Directory of Open Access Journals (Sweden)

Qi Yuan(Alan

2010-01-01

Full Text Available Abstract The problem of uncovering transcriptional regulation by transcription factors (TFs based on microarray data is considered. A novel Bayesian sparse correlated rectified factor model (BSCRFM is proposed that models the unknown TF protein level activity, the correlated regulations between TFs, and the sparse nature of TF-regulated genes. The model admits prior knowledge from existing database regarding TF-regulated target genes based on a sparse prior and through a developed Gibbs sampling algorithm, a context-specific transcriptional regulatory network specific to the experimental condition of the microarray data can be obtained. The proposed model and the Gibbs sampling algorithm were evaluated on the simulated systems, and results demonstrated the validity and effectiveness of the proposed approach. The proposed model was then applied to the breast cancer microarray data of patients with Estrogen Receptor positive ( status and Estrogen Receptor negative ( status, respectively.

Robust Single Image Super-Resolution via Deep Networks With Sparse Prior.

Science.gov (United States)

Liu, Ding; Wang, Zhaowen; Wen, Bihan; Yang, Jianchao; Han, Wei; Huang, Thomas S

2016-07-01

Single image super-resolution (SR) is an ill-posed problem, which tries to recover a high-resolution image from its low-resolution observation. To regularize the solution of the problem, previous methods have focused on designing good priors for natural images, such as sparse representation, or directly learning the priors from a large data set with models, such as deep neural networks. In this paper, we argue that domain expertise from the conventional sparse coding model can be combined with the key ingredients of deep learning to achieve further improved results. We demonstrate that a sparse coding model particularly designed for SR can be incarnated as a neural network with the merit of end-to-end optimization over training data. The network has a cascaded structure, which boosts the SR performance for both fixed and incremental scaling factors. The proposed training and testing schemes can be extended for robust handling of images with additional degradation, such as noise and blurring. A subjective assessment is conducted and analyzed in order to thoroughly evaluate various SR techniques. Our proposed model is tested on a wide range of images, and it significantly outperforms the existing state-of-the-art methods for various scaling factors both quantitatively and perceptually.

Improving information dissemination in sparse vehicular networks by adding satellite communication

NARCIS (Netherlands)

Kloiber, Bernhard; Strang, Thomas; Spijker, Hanno; Heijenk, Geert

Information dissemination in pure Vehicular Ad Hoc NETworks (VANETs) such as ITS-G5 becomes problematic when the network is sparse. In situations where the number of vehicles, that can act as a communication node, is insufficiently low, e.g. in rural areas, during night-time or because of a low

An investigation of 'sparse channel networks'. Characteristic behaviours and their causes

Energy Technology Data Exchange (ETDEWEB)

Black, J.H. (In Situ Solutions, East Bridgford (GB)); Barker, J.A.; Woodman, N.D. (Univ. of Southampton (GB))

2007-09-15

This report represents a third study in a series concerned with groundwater flow in poorly permeable fractured crystalline rocks. The study has brought together three linked, but distinct, elements; a mathematical analysis of the intersection of ellipses, a review of field measurements associated with nuclear waste repository investigations and probabilistic simulations using a lattice network numerical model. We conclude that the model of channels that traverse fracture intersections without necessarily branching is a very likely representation of reality. More generally, assembling all the lines of evidence, it is suggested that groundwater flow systems in fractured crystalline rocks in the environs of underground laboratories have the following characteristics: Groundwater flows within a sparse network of channels just above the percolation limit. The frequency of intersections is low in that individual channels extend considerable distances between significant junctions. Individual channels often extend over many fracture surfaces and the resulting flow system is only weakly related to the density or size of mappable fractures. The sparseness of systems compared to the size of drifts and tunnels means that only a very few flow channels are intersected by drifts and tunnels. Highly convergent flow is required to connect to the rest of the network and this is misinterpreted as a skin of low hydraulic conductivity. Systems are so sparse that they are controlled by a few 'chokes' that give rise to compartments of head, and probably, of groundwater chemistry. Channels occur on all fracture planes, including those within fracture zones, and although the characteristics of the fracture zone channel networks may differ from those in surrounding rocks, they are nonetheless still channel networks. The actively flowing sparse channel network, occurring within any particular rock, is a naturally selected, small sub-set of the available channels. Hence, there are

Tourist activated networks: Implications for dynamic packaging systems in tourism

DEFF Research Database (Denmark)

Zach, Florian; Gretzel, Ulrike; Fesenmaier, Daniel R.

2008-01-01

This paper discusses tourist activated networks as a concept to inform technological applications supporting dynamic bundling and en-route recommendations. Empirical data was collected from travellers who visited a regional destination in the US and then analyzed with respect to its network...... structure. The results indicate that the tourist activated network for the destination is rather sparse and that there are clearly differences in core and peripheral nodes. The findings illustrate the structure of a tourist activated network and provide implications for technology design and tourism...

Tourist activated networks: Implications for dynamic bundling and en-route recommendations

DEFF Research Database (Denmark)

Zach, Florian; Gretzel, Ulrike

2011-01-01

This article discusses tourist-activated networks as a concept to inform technological applications supporting dynamic bundling and en route recommendations. Empirical data were collected from travelers who visited a regional destination in the US and then analyzed with respect to its network...... structure. The results indicate that the tourist-activated network for the destination is rather sparse and that there are clearly differences in core and peripheral nodes. The findings illustrate the structure of a tourist-activated network and provide implications for technology design and tourism...

Packetized Predictive Control for Rate-Limited Networks via Sparse Representation

DEFF Research Database (Denmark)

Nagahara, Masaaki; Quevedo, Daniel; Østergaard, Jan

2012-01-01

controller and the plant input. To achieve robustness with respect to dropouts, the controller transmits data packets containing plant input predictions, which minimize a finite horizon cost function. In our formulation, we design sparse packets for rate-limited networks, by adopting an an ℓ0 optimization...

Reliability of Broadcast Communications Under Sparse Random Linear Network Coding

OpenAIRE

Brown, Suzie; Johnson, Oliver; Tassi, Andrea

2018-01-01

Ultra-reliable Point-to-Multipoint (PtM) communications are expected to become pivotal in networks offering future dependable services for smart cities. In this regard, sparse Random Linear Network Coding (RLNC) techniques have been widely employed to provide an efficient way to improve the reliability of broadcast and multicast data streams. This paper addresses the pressing concern of providing a tight approximation to the probability of a user recovering a data stream protected by this kin...

An efficient optical architecture for sparsely connected neural networks

Science.gov (United States)

Hine, Butler P., III; Downie, John D.; Reid, Max B.

1990-01-01

An architecture for general-purpose optical neural network processor is presented in which the interconnections and weights are formed by directing coherent beams holographically, thereby making use of the space-bandwidth products of the recording medium for sparsely interconnected networks more efficiently that the commonly used vector-matrix multiplier, since all of the hologram area is in use. An investigation is made of the use of computer-generated holograms recorded on such updatable media as thermoplastic materials, in order to define the interconnections and weights of a neural network processor; attention is given to limits on interconnection densities, diffraction efficiencies, and weighing accuracies possible with such an updatable thin film holographic device.

Performance and complexity of tunable sparse network coding with gradual growing tuning functions over wireless networks

OpenAIRE

Garrido Ortiz, Pablo; Sørensen, Chres W.; Lucani Roetter, Daniel Enrique; Agüero Calvo, Ramón

2016-01-01

Random Linear Network Coding (RLNC) has been shown to be a technique with several benefits, in particular when applied over wireless mesh networks, since it provides robustness against packet losses. On the other hand, Tunable Sparse Network Coding (TSNC) is a promising concept, which leverages a trade-off between computational complexity and goodput. An optimal density tuning function has not been found yet, due to the lack of a closed-form expression that links density, performance and comp...

Sparse/Low Rank Constrained Reconstruction for Dynamic PET Imaging.

Directory of Open Access Journals (Sweden)

Xingjian Yu

Full Text Available In dynamic Positron Emission Tomography (PET, an estimate of the radio activity concentration is obtained from a series of frames of sinogram data taken at ranging in duration from 10 seconds to minutes under some criteria. So far, all the well-known reconstruction algorithms require known data statistical properties. It limits the speed of data acquisition, besides, it is unable to afford the separated information about the structure and the variation of shape and rate of metabolism which play a major role in improving the visualization of contrast for some requirement of the diagnosing in application. This paper presents a novel low rank-based activity map reconstruction scheme from emission sinograms of dynamic PET, termed as SLCR representing Sparse/Low Rank Constrained Reconstruction for Dynamic PET Imaging. In this method, the stationary background is formulated as a low rank component while variations between successive frames are abstracted to the sparse. The resulting nuclear norm and l1 norm related minimization problem can also be efficiently solved by many recently developed numerical methods. In this paper, the linearized alternating direction method is applied. The effectiveness of the proposed scheme is illustrated on three data sets.

Death and rebirth of neural activity in sparse inhibitory networks

Science.gov (United States)

Angulo-Garcia, David; Luccioli, Stefano; Olmi, Simona; Torcini, Alessandro

2017-05-01

Inhibition is a key aspect of neural dynamics playing a fundamental role for the emergence of neural rhythms and the implementation of various information coding strategies. Inhibitory populations are present in several brain structures, and the comprehension of their dynamics is strategical for the understanding of neural processing. In this paper, we clarify the mechanisms underlying a general phenomenon present in pulse-coupled heterogeneous inhibitory networks: inhibition can induce not only suppression of neural activity, as expected, but can also promote neural re-activation. In particular, for globally coupled systems, the number of firing neurons monotonically reduces upon increasing the strength of inhibition (neuronal death). However, the random pruning of connections is able to reverse the action of inhibition, i.e. in a random sparse network a sufficiently strong synaptic strength can surprisingly promote, rather than depress, the activity of neurons (neuronal rebirth). Thus, the number of firing neurons reaches a minimum value at some intermediate synaptic strength. We show that this minimum signals a transition from a regime dominated by neurons with a higher firing activity to a phase where all neurons are effectively sub-threshold and their irregular firing is driven by current fluctuations. We explain the origin of the transition by deriving a mean field formulation of the problem able to provide the fraction of active neurons as well as the first two moments of their firing statistics. The introduction of a synaptic time scale does not modify the main aspects of the reported phenomenon. However, for sufficiently slow synapses the transition becomes dramatic, and the system passes from a perfectly regular evolution to irregular bursting dynamics. In this latter regime the model provides predictions consistent with experimental findings for a specific class of neurons, namely the medium spiny neurons in the striatum.

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

Science.gov (United States)

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.

Storage of phase-coded patterns via STDP in fully-connected and sparse network: a study of the network capacity

Directory of Open Access Journals (Sweden)

Silvia Scarpetta

2010-08-01

Full Text Available We study the storage and retrieval of phase-coded patterns as stable dynamical attractors in recurrent neural networks, for both an analog and a integrate-and-fire spiking model. The synaptic strength is determined by a learning rule based on spike-time-dependent plasticity, with an asymmetric time window depending on the relative timing between pre- and post-synaptic activity. We store multiple patterns and study the network capacity. For the analog model, we find that the network capacity scales linearly with the network size, and that both capacity and the oscillation frequency of the retrieval state depend on the asymmetry of the learning time window. In addition to fully-connected networks, we study sparse networks, where each neuron is connected only to a small number $zll N$ of other neurons. Connections can be short range, between neighboring neurons placed on a regular lattice, or long range, between randomly chosen pairs of neurons. We find that a small fraction of long range connections is able to amplify the capacity of the network. This imply that a small-world-network topology is optimal, as a compromise between the cost of long range connections and the capacity increase. Also in the spiking integrate and fire model the crucial result of storing and retrieval of multiple phase-coded patterns is observed. The capacity of the fully-connected spiking network is investigated, together with the relation between oscillation frequency of retrieval state and window asymmetry.

Performance and Complexity of Tunable Sparse Network Coding with Gradual Growing Tuning Functions over Wireless Networks

DEFF Research Database (Denmark)

Garrido, Pablo; Sørensen, Chres Wiant; Roetter, Daniel Enrique Lucani

2016-01-01

Random Linear Network Coding (RLNC) has been shown to be a technique with several benefits, in particular when applied over wireless mesh networks, since it provides robustness against packet losses. On the other hand, Tunable Sparse Network Coding (TSNC) is a promising concept, which leverages...... a trade-off between computational complexity and goodput. An optimal density tuning function has not been found yet, due to the lack of a closed-form expression that links density, performance and computational cost. In addition, it would be difficult to implement, due to the feedback delay. In this work...

The architecture of dynamic reservoir in the echo state network

Science.gov (United States)

Cui, Hongyan; Liu, Xiang; Li, Lixiang

2012-09-01

Echo state network (ESN) has recently attracted increasing interests because of its superior capability in modeling nonlinear dynamic systems. In the conventional echo state network model, its dynamic reservoir (DR) has a random and sparse topology, which is far from the real biological neural networks from both structural and functional perspectives. We hereby propose three novel types of echo state networks with new dynamic reservoir topologies based on complex network theory, i.e., with a small-world topology, a scale-free topology, and a mixture of small-world and scale-free topologies, respectively. We then analyze the relationship between the dynamic reservoir structure and its prediction capability. We utilize two commonly used time series to evaluate the prediction performance of the three proposed echo state networks and compare them to the conventional model. We also use independent and identically distributed time series to analyze the short-term memory and prediction precision of these echo state networks. Furthermore, we study the ratio of scale-free topology and the small-world topology in the mixed-topology network, and examine its influence on the performance of the echo state networks. Our simulation results show that the proposed echo state network models have better prediction capabilities, a wider spectral radius, but retain almost the same short-term memory capacity as compared to the conventional echo state network model. We also find that the smaller the ratio of the scale-free topology over the small-world topology, the better the memory capacities.

Sparse Localization with a Mobile Beacon Based on LU Decomposition in Wireless Sensor Networks

Directory of Open Access Journals (Sweden)

Chunhui Zhao

2015-09-01

Full Text Available Node localization is the core in wireless sensor network. It can be solved by powerful beacons, which are equipped with global positioning system devices to know their location information. In this article, we present a novel sparse localization approach with a mobile beacon based on LU decomposition. Our scheme firstly translates node localization problem into a 1-sparse vector recovery problem by establishing sparse localization model. Then, LU decomposition pre-processing is adopted to solve the problem that measurement matrix does not meet the re¬stricted isometry property. Later, the 1-sparse vector can be exactly recovered by compressive sensing. Finally, as the 1-sparse vector is approximate sparse, weighted Cen¬troid scheme is introduced to accurately locate the node. Simulation and analysis show that our scheme has better localization performance and lower requirement for the mobile beacon than MAP+GC, MAP-M, and MAP-MN schemes. In addition, the obstacles and DOI have little effect on the novel scheme, and it has great localization performance under low SNR, thus, the scheme proposed is robust.

The role of degree distribution in shaping the dynamics in networks of sparsely connected spiking neurons

Directory of Open Access Journals (Sweden)

Alex eRoxin

2011-03-01

Full Text Available Neuronal network models often assume a fixed probability of connectionbetween neurons. This assumption leads to random networks withbinomial in-degree and out-degree distributions which are relatively narrow. Here I study the effect of broaddegree distributions on network dynamics by interpolating between abinomial and a truncated powerlaw distribution for the in-degree andout-degree independently. This is done both for an inhibitory network(I network as well as for the recurrent excitatory connections in anetwork of excitatory and inhibitory neurons (EI network. In bothcases increasing the width of the in-degree distribution affects theglobal state of the network by driving transitions betweenasynchronous behavior and oscillations. This effect is reproduced ina simplified rate model which includes the heterogeneity in neuronalinput due to the in-degree of cells. On the other hand, broadeningthe out-degree distribution is shown to increase the fraction ofcommon inputs to pairs of neurons. This leads to increases in theamplitude of the cross-correlation (CC of synaptic currents. In thecase of the I network, despite strong oscillatory CCs in the currents, CCs of the membrane potential are low due to filtering and reset effects, leading to very weak CCs of the spikecount. In the asynchronous regime ofthe EI network, broadening the out-degree increases the amplitude ofCCs in the recurrent excitatory currents, while CC of the totalcurrent is essentially unaffected as are pairwise spikingcorrelations. This is due to a dynamic balance between excitatoryand inhibitory synaptic currents. In the oscillatory regime, changesin the out-degree can have a large effect on spiking correlations andeven on the qualitative dynamical state of the network.

Aspect-Aided Dynamic Non-Negative Sparse Representation-Based Microwave Image Classification

Directory of Open Access Journals (Sweden)

Xinzheng Zhang

2016-09-01

Full Text Available Classification of target microwave images is an important application in much areas such as security, surveillance, etc. With respect to the task of microwave image classification, a recognition algorithm based on aspect-aided dynamic non-negative least square (ADNNLS sparse representation is proposed. Firstly, an aspect sector is determined, the center of which is the estimated aspect angle of the testing sample. The training samples in the aspect sector are divided into active atoms and inactive atoms by smooth self-representative learning. Secondly, for each testing sample, the corresponding active atoms are selected dynamically, thereby establishing dynamic dictionary. Thirdly, the testing sample is represented with ℓ 1 -regularized non-negative sparse representation under the corresponding dynamic dictionary. Finally, the class label of the testing sample is identified by use of the minimum reconstruction error. Verification of the proposed algorithm was conducted using the Moving and Stationary Target Acquisition and Recognition (MSTAR database which was acquired by synthetic aperture radar. Experiment results validated that the proposed approach was able to capture the local aspect characteristics of microwave images effectively, thereby improving the classification performance.

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

Science.gov (United States)

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

Locality constrained joint dynamic sparse representation for local matching based face recognition.

Science.gov (United States)

Wang, Jianzhong; Yi, Yugen; Zhou, Wei; Shi, Yanjiao; Qi, Miao; Zhang, Ming; Zhang, Baoxue; Kong, Jun

2014-01-01

Recently, Sparse Representation-based Classification (SRC) has attracted a lot of attention for its applications to various tasks, especially in biometric techniques such as face recognition. However, factors such as lighting, expression, pose and disguise variations in face images will decrease the performances of SRC and most other face recognition techniques. In order to overcome these limitations, we propose a robust face recognition method named Locality Constrained Joint Dynamic Sparse Representation-based Classification (LCJDSRC) in this paper. In our method, a face image is first partitioned into several smaller sub-images. Then, these sub-images are sparsely represented using the proposed locality constrained joint dynamic sparse representation algorithm. Finally, the representation results for all sub-images are aggregated to obtain the final recognition result. Compared with other algorithms which process each sub-image of a face image independently, the proposed algorithm regards the local matching-based face recognition as a multi-task learning problem. Thus, the latent relationships among the sub-images from the same face image are taken into account. Meanwhile, the locality information of the data is also considered in our algorithm. We evaluate our algorithm by comparing it with other state-of-the-art approaches. Extensive experiments on four benchmark face databases (ORL, Extended YaleB, AR and LFW) demonstrate the effectiveness of LCJDSRC.

Locality constrained joint dynamic sparse representation for local matching based face recognition.

Directory of Open Access Journals (Sweden)

Jianzhong Wang

Full Text Available Recently, Sparse Representation-based Classification (SRC has attracted a lot of attention for its applications to various tasks, especially in biometric techniques such as face recognition. However, factors such as lighting, expression, pose and disguise variations in face images will decrease the performances of SRC and most other face recognition techniques. In order to overcome these limitations, we propose a robust face recognition method named Locality Constrained Joint Dynamic Sparse Representation-based Classification (LCJDSRC in this paper. In our method, a face image is first partitioned into several smaller sub-images. Then, these sub-images are sparsely represented using the proposed locality constrained joint dynamic sparse representation algorithm. Finally, the representation results for all sub-images are aggregated to obtain the final recognition result. Compared with other algorithms which process each sub-image of a face image independently, the proposed algorithm regards the local matching-based face recognition as a multi-task learning problem. Thus, the latent relationships among the sub-images from the same face image are taken into account. Meanwhile, the locality information of the data is also considered in our algorithm. We evaluate our algorithm by comparing it with other state-of-the-art approaches. Extensive experiments on four benchmark face databases (ORL, Extended YaleB, AR and LFW demonstrate the effectiveness of LCJDSRC.

Emergence of ultrafast sparsely synchronized rhythms and their responses to external stimuli in an inhomogeneous small-world complex neuronal network.

Science.gov (United States)

Kim, Sang-Yoon; Lim, Woochang

2017-09-01

We consider an inhomogeneous small-world network (SWN) composed of inhibitory short-range (SR) and long-range (LR) interneurons, and investigate the effect of network architecture on emergence of synchronized brain rhythms by varying the fraction of LR interneurons p long . The betweenness centralities of the LR and SR interneurons (characterizing the potentiality in controlling communication between other interneurons) are distinctly different. Hence, in view of the betweenness, SWNs we consider are inhomogeneous, unlike the "canonical" Watts-Strogatz SWN with nearly the same betweenness centralities. For small p long , the load of communication traffic is much concentrated on a few LR interneurons. However, as p long is increased, the number of LR connections (coming from LR interneurons) increases, and then the load of communication traffic is less concentrated on LR interneurons, which leads to better efficiency of global communication between interneurons. Sparsely synchronized rhythms are thus found to emerge when passing a small critical value p long (c) (≃0.16). The population frequency of the sparsely synchronized rhythm is ultrafast (higher than 100 Hz), while the mean firing rate of individual interneurons is much lower (∼30 Hz) due to stochastic and intermittent neural discharges. These dynamical behaviors in the inhomogeneous SWN are also compared with those in the homogeneous Watts-Strogatz SWN, in connection with their network topologies. Particularly, we note that the main difference between the two types of SWNs lies in the distribution of betweenness centralities. Unlike the case of the Watts-Strogatz SWN, dynamical responses to external stimuli vary depending on the type of stimulated interneurons in the inhomogeneous SWN. We consider two cases of external time-periodic stimuli applied to sub-populations of the LR and SR interneurons, respectively. Dynamical responses (such as synchronization suppression and enhancement) to these two cases of

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

Science.gov (United States)

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

2012-01-01

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

Assimilating irregularly spaced sparsely observed turbulent signals with hierarchical Bayesian reduced stochastic filters

International Nuclear Information System (INIS)

Brown, Kristen A.; Harlim, John

2013-01-01

In this paper, we consider a practical filtering approach for assimilating irregularly spaced, sparsely observed turbulent signals through a hierarchical Bayesian reduced stochastic filtering framework. The proposed hierarchical Bayesian approach consists of two steps, blending a data-driven interpolation scheme and the Mean Stochastic Model (MSM) filter. We examine the potential of using the deterministic piecewise linear interpolation scheme and the ordinary kriging scheme in interpolating irregularly spaced raw data to regularly spaced processed data and the importance of dynamical constraint (through MSM) in filtering the processed data on a numerically stiff state estimation problem. In particular, we test this approach on a two-layer quasi-geostrophic model in a two-dimensional domain with a small radius of deformation to mimic ocean turbulence. Our numerical results suggest that the dynamical constraint becomes important when the observation noise variance is large. Second, we find that the filtered estimates with ordinary kriging are superior to those with linear interpolation when observation networks are not too sparse; such robust results are found from numerical simulations with many randomly simulated irregularly spaced observation networks, various observation time intervals, and observation error variances. Third, when the observation network is very sparse, we find that both the kriging and linear interpolations are comparable

Nonuniform Sparse Data Clustering Cascade Algorithm Based on Dynamic Cumulative Entropy

Directory of Open Access Journals (Sweden)

Ning Li

2016-01-01

Full Text Available A small amount of prior knowledge and randomly chosen initial cluster centers have a direct impact on the accuracy of the performance of iterative clustering algorithm. In this paper we propose a new algorithm to compute initial cluster centers for k-means clustering and the best number of the clusters with little prior knowledge and optimize clustering result. It constructs the Euclidean distance control factor based on aggregation density sparse degree to select the initial cluster center of nonuniform sparse data and obtains initial data clusters by multidimensional diffusion density distribution. Multiobjective clustering approach based on dynamic cumulative entropy is adopted to optimize the initial data clusters and the best number of the clusters. The experimental results show that the newly proposed algorithm has good performance to obtain the initial cluster centers for the k-means algorithm and it effectively improves the clustering accuracy of nonuniform sparse data by about 5%.

Online learning control using adaptive critic designs with sparse kernel machines.

Science.gov (United States)

Xu, Xin; Hou, Zhongsheng; Lian, Chuanqiang; He, Haibo

2013-05-01

In the past decade, adaptive critic designs (ACDs), including heuristic dynamic programming (HDP), dual heuristic programming (DHP), and their action-dependent ones, have been widely studied to realize online learning control of dynamical systems. However, because neural networks with manually designed features are commonly used to deal with continuous state and action spaces, the generalization capability and learning efficiency of previous ACDs still need to be improved. In this paper, a novel framework of ACDs with sparse kernel machines is presented by integrating kernel methods into the critic of ACDs. To improve the generalization capability as well as the computational efficiency of kernel machines, a sparsification method based on the approximately linear dependence analysis is used. Using the sparse kernel machines, two kernel-based ACD algorithms, that is, kernel HDP (KHDP) and kernel DHP (KDHP), are proposed and their performance is analyzed both theoretically and empirically. Because of the representation learning and generalization capability of sparse kernel machines, KHDP and KDHP can obtain much better performance than previous HDP and DHP with manually designed neural networks. Simulation and experimental results of two nonlinear control problems, that is, a continuous-action inverted pendulum problem and a ball and plate control problem, demonstrate the effectiveness of the proposed kernel ACD methods.

Optimal deep neural networks for sparse recovery via Laplace techniques

OpenAIRE

Limmer, Steffen; Stanczak, Slawomir

2017-01-01

This paper introduces Laplace techniques for designing a neural network, with the goal of estimating simplex-constraint sparse vectors from compressed measurements. To this end, we recast the problem of MMSE estimation (w.r.t. a pre-defined uniform input distribution) as the problem of computing the centroid of some polytope that results from the intersection of the simplex and an affine subspace determined by the measurements. Owing to the specific structure, it is shown that the centroid ca...

A Data-Driven Sparse-Learning Approach to Model Reduction in Chemical Reaction Networks

OpenAIRE

Harirchi, Farshad; Khalil, Omar A.; Liu, Sijia; Elvati, Paolo; Violi, Angela; Hero, Alfred O.

2017-01-01

In this paper, we propose an optimization-based sparse learning approach to identify the set of most influential reactions in a chemical reaction network. This reduced set of reactions is then employed to construct a reduced chemical reaction mechanism, which is relevant to chemical interaction network modeling. The problem of identifying influential reactions is first formulated as a mixed-integer quadratic program, and then a relaxation method is leveraged to reduce the computational comple...

Discovering governing equations from data by sparse identification of nonlinear dynamics

Science.gov (United States)

Brunton, Steven

The ability to discover physical laws and governing equations from data is one of humankind's greatest intellectual achievements. A quantitative understanding of dynamic constraints and balances in nature has facilitated rapid development of knowledge and enabled advanced technology, including aircraft, combustion engines, satellites, and electrical power. There are many more critical data-driven problems, such as understanding cognition from neural recordings, inferring patterns in climate, determining stability of financial markets, predicting and suppressing the spread of disease, and controlling turbulence for greener transportation and energy. With abundant data and elusive laws, data-driven discovery of dynamics will continue to play an increasingly important role in these efforts. This work develops a general framework to discover the governing equations underlying a dynamical system simply from data measurements, leveraging advances in sparsity-promoting techniques and machine learning. The resulting models are parsimonious, balancing model complexity with descriptive ability while avoiding overfitting. The only assumption about the structure of the model is that there are only a few important terms that govern the dynamics, so that the equations are sparse in the space of possible functions. This perspective, combining dynamical systems with machine learning and sparse sensing, is explored with the overarching goal of real-time closed-loop feedback control of complex systems. This is joint work with Joshua L. Proctor and J. Nathan Kutz. Video Abstract: https://www.youtube.com/watch?v=gSCa78TIldg

Sparse and shrunken estimates of MRI networks in the brain and their influence on network properties

DEFF Research Database (Denmark)

Romero-Garcia, Rafael; Clemmensen, Line Katrine Harder

2014-01-01

approaches showed more stable results with a relative low variance at the expense of a little bias. Interestingly, topological properties as local and global efficiency estimated in networks constructed from traditional non-regularized correlations also showed higher variability when compared to those from...... regularized networks. Our findings suggest that a population-based connectivity study can achieve a more robust description of cortical topology through regularization of the correlation estimates. Four regularization methods were examined: Two with shrinkage (Ridge and Schäfer’s shrinkage), one with sparsity...... (Lasso) and one with both shrinkage and sparsity (Elastic net). Furthermore, the different regularizations resulted in different correlation estimates as well as network properties. The shrunken estimates resulted in lower variance of the estimates than the sparse estimates....

Sparse Channel Estimation for MIMO-OFDM Two-Way Relay Network with Compressed Sensing

Directory of Open Access Journals (Sweden)

Aihua Zhang

2013-01-01

Full Text Available Accurate channel impulse response (CIR is required for equalization and can help improve communication service quality in next-generation wireless communication systems. An example of an advanced system is amplify-and-forward multiple-input multiple-output two-way relay network, which is modulated by orthogonal frequency-division multiplexing. Linear channel estimation methods, for example, least squares and expectation conditional maximization, have been proposed previously for the system. However, these methods do not take advantage of channel sparsity, and they decrease estimation performance. We propose a sparse channel estimation scheme, which is different from linear methods, at end users under the relay channel to enable us to exploit sparsity. First, we formulate the sparse channel estimation problem as a compressed sensing problem by using sparse decomposition theory. Second, the CIR is reconstructed by CoSaMP and OMP algorithms. Finally, computer simulations are conducted to confirm the superiority of the proposed methods over traditional linear channel estimation methods.

Functional inference of complex anatomical tendinous networks at a macroscopic scale via sparse experimentation.

Science.gov (United States)

Saxena, Anupam; Lipson, Hod; Valero-Cuevas, Francisco J

2012-01-01

In systems and computational biology, much effort is devoted to functional identification of systems and networks at the molecular-or cellular scale. However, similarly important networks exist at anatomical scales such as the tendon network of human fingers: the complex array of collagen fibers that transmits and distributes muscle forces to finger joints. This network is critical to the versatility of the human hand, and its function has been debated since at least the 16(th) century. Here, we experimentally infer the structure (both topology and parameter values) of this network through sparse interrogation with force inputs. A population of models representing this structure co-evolves in simulation with a population of informative future force inputs via the predator-prey estimation-exploration algorithm. Model fitness depends on their ability to explain experimental data, while the fitness of future force inputs depends on causing maximal functional discrepancy among current models. We validate our approach by inferring two known synthetic Latex networks, and one anatomical tendon network harvested from a cadaver's middle finger. We find that functionally similar but structurally diverse models can exist within a narrow range of the training set and cross-validation errors. For the Latex networks, models with low training set error [functional structure of complex anatomical networks. This work expands current bioinformatics inference approaches by demonstrating that sparse, yet informative interrogation of biological specimens holds significant computational advantages in accurate and efficient inference over random testing, or assuming model topology and only inferring parameters values. These findings also hold clues to both our evolutionary history and the development of versatile machines.

Inference of gene regulatory networks with sparse structural equation models exploiting genetic perturbations.

Directory of Open Access Journals (Sweden)

Xiaodong Cai

Full Text Available Integrating genetic perturbations with gene expression data not only improves accuracy of regulatory network topology inference, but also enables learning of causal regulatory relations between genes. Although a number of methods have been developed to integrate both types of data, the desiderata of efficient and powerful algorithms still remains. In this paper, sparse structural equation models (SEMs are employed to integrate both gene expression data and cis-expression quantitative trait loci (cis-eQTL, for modeling gene regulatory networks in accordance with biological evidence about genes regulating or being regulated by a small number of genes. A systematic inference method named sparsity-aware maximum likelihood (SML is developed for SEM estimation. Using simulated directed acyclic or cyclic networks, the SML performance is compared with that of two state-of-the-art algorithms: the adaptive Lasso (AL based scheme, and the QTL-directed dependency graph (QDG method. Computer simulations demonstrate that the novel SML algorithm offers significantly better performance than the AL-based and QDG algorithms across all sample sizes from 100 to 1,000, in terms of detection power and false discovery rate, in all the cases tested that include acyclic or cyclic networks of 10, 30 and 300 genes. The SML method is further applied to infer a network of 39 human genes that are related to the immune function and are chosen to have a reliable eQTL per gene. The resulting network consists of 9 genes and 13 edges. Most of the edges represent interactions reasonably expected from experimental evidence, while the remaining may just indicate the emergence of new interactions. The sparse SEM and efficient SML algorithm provide an effective means of exploiting both gene expression and perturbation data to infer gene regulatory networks. An open-source computer program implementing the SML algorithm is freely available upon request.

A sparse regulatory network of copy-number driven gene expression reveals putative breast cancer oncogenes.

Science.gov (United States)

Yuan, Yinyin; Curtis, Christina; Caldas, Carlos; Markowetz, Florian

2012-01-01

Copy number aberrations are recognized to be important in cancer as they may localize to regions harboring oncogenes or tumor suppressors. Such genomic alterations mediate phenotypic changes through their impact on expression. Both cis- and transacting alterations are important since they may help to elucidate putative cancer genes. However, amidst numerous passenger genes, trans-effects are less well studied due to the computational difficulty in detecting weak and sparse signals in the data, and yet may influence multiple genes on a global scale. We propose an integrative approach to learn a sparse interaction network of DNA copy-number regions with their downstream transcriptional targets in breast cancer. With respect to goodness of fit on both simulated and real data, the performance of sparse network inference is no worse than other state-of-the-art models but with the advantage of simultaneous feature selection and efficiency. The DNA-RNA interaction network helps to distinguish copy-number driven expression alterations from those that are copy-number independent. Further, our approach yields a quantitative copy-number dependency score, which distinguishes cis- versus trans-effects. When applied to a breast cancer data set, numerous expression profiles were impacted by cis-acting copy-number alterations, including several known oncogenes such as GRB7, ERBB2, and LSM1. Several trans-acting alterations were also identified, impacting genes such as ADAM2 and BAGE, which warrant further investigation. An R package named lol is available from www.markowetzlab.org/software/lol.html.

An energy-efficient MAC protocol using dynamic queue management for delay-tolerant mobile sensor networks.

Science.gov (United States)

Li, Jie; Li, Qiyue; Qu, Yugui; Zhao, Baohua

2011-01-01

Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC) for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.

An Energy-Efficient MAC Protocol Using Dynamic Queue Management for Delay-Tolerant Mobile Sensor Networks

Directory of Open Access Journals (Sweden)

Yugui Qu

2011-02-01

Full Text Available Conventional MAC protocols for wireless sensor network perform poorly when faced with a delay-tolerant mobile network environment. Characterized by a highly dynamic and sparse topology, poor network connectivity as well as data delay-tolerance, delay-tolerant mobile sensor networks exacerbate the severe power constraints and memory limitations of nodes. This paper proposes an energy-efficient MAC protocol using dynamic queue management (EQ-MAC for power saving and data queue management. Via data transfers initiated by the target sink and the use of a dynamic queue management strategy based on priority, EQ-MAC effectively avoids untargeted transfers, increases the chance of successful data transmission, and makes useful data reach the target terminal in a timely manner. Experimental results show that EQ-MAC has high energy efficiency in comparison with a conventional MAC protocol. It also achieves a 46% decrease in packet drop probability, 79% increase in system throughput, and 25% decrease in mean packet delay.

Discovering governing equations from data by sparse identification of nonlinear dynamical systems.

Science.gov (United States)

Brunton, Steven L; Proctor, Joshua L; Kutz, J Nathan

2016-04-12

Extracting governing equations from data is a central challenge in many diverse areas of science and engineering. Data are abundant whereas models often remain elusive, as in climate science, neuroscience, ecology, finance, and epidemiology, to name only a few examples. In this work, we combine sparsity-promoting techniques and machine learning with nonlinear dynamical systems to discover governing equations from noisy measurement data. The only assumption about the structure of the model is that there are only a few important terms that govern the dynamics, so that the equations are sparse in the space of possible functions; this assumption holds for many physical systems in an appropriate basis. In particular, we use sparse regression to determine the fewest terms in the dynamic governing equations required to accurately represent the data. This results in parsimonious models that balance accuracy with model complexity to avoid overfitting. We demonstrate the algorithm on a wide range of problems, from simple canonical systems, including linear and nonlinear oscillators and the chaotic Lorenz system, to the fluid vortex shedding behind an obstacle. The fluid example illustrates the ability of this method to discover the underlying dynamics of a system that took experts in the community nearly 30 years to resolve. We also show that this method generalizes to parameterized systems and systems that are time-varying or have external forcing.

Dynamic characterisation of the specific surface area for fracture networks

Science.gov (United States)

Cvetkovic, V.

2017-12-01

One important application of chemical transport is geological disposal of high-level nuclear waste for which crystalline rock is a prime candidate for instance in Scandinavia. Interconnected heterogeneous fractures of sparsely fractured rock such as granite, act as conduits for transport of dissolved tracers. Fluid flow is known to be highly channelized in such rocks. Channels imply narrow flow paths, adjacent to essentially stagnant water in the fracture and/or the rock matrix. Tracers are transported along channelised flow paths and retained by minerals and/or stagnant water, depending on their sorption properties; this mechanism is critical for rocks to act as a barrier and ultimately provide safety for a geological repository. The sorbing tracers are retained by diffusion and sorption on mineral surfaces, whereas non-sorbing tracers can be retained only by diffusion into stagnant water of fractures. The retention and transport properties of a sparsely fractured rock will primarily depend on the specific surface area (SSA) of the fracture network which is determined by the heterogeneous structure and flow. The main challenge when characterising SSA on the field-scale is its dependence on the flow dynamics. We first define SSA as a physical quantity and clarify its importance for chemical transport. A methodology for dynamic characterisation of SSA in fracture networks is proposed that relies on three sets of data: i) Flow rate data as obtained by a flow logging procedure; ii) transmissivity data as obtained by pumping tests; iii) fracture network data as obtained from outcrop and geophysical observations. The proposed methodology utilises these data directly as well as indirectly through flow and particle tracking simulations in three-dimensional discrete fracture networks. The methodology is exemplified using specific data from the Swedish site Laxemar. The potential impact of uncertainties is of particular significance and is illustrated for radionuclide

Non-parametric co-clustering of large scale sparse bipartite networks on the GPU

DEFF Research Database (Denmark)

Hansen, Toke Jansen; Mørup, Morten; Hansen, Lars Kai

2011-01-01

of row and column clusters from a hypothesis space of an infinite number of clusters. To reach large scale applications of co-clustering we exploit that parameter inference for co-clustering is well suited for parallel computing. We develop a generic GPU framework for efficient inference on large scale...... sparse bipartite networks and achieve a speedup of two orders of magnitude compared to estimation based on conventional CPUs. In terms of scalability we find for networks with more than 100 million links that reliable inference can be achieved in less than an hour on a single GPU. To efficiently manage...

Microseismic Monitoring Using Sparse Surface Network of Broadband Instruments: Western Canada Shale Play Case Study

Science.gov (United States)

Yenier, E.; Baturan, D.; Karimi, S.

2016-12-01

Monitoring of seismicity related to oil and gas operations is routinely performed nowadays using a number of different surface and downhole seismic array configurations and technologies. Here, we provide a hydraulic fracture (HF) monitoring case study that compares the data set generated by a sparse local surface network of broadband seismometers to a data set generated by a single downhole geophone string. Our data was collected during a 5-day single-well HF operation, by a temporary surface network consisting of 10 stations deployed within 5 km of the production well. The downhole data was recorded by a 20 geophone string deployed in an observation well located 15 m from the production well. Surface network data processing included standard STA/LTA event triggering enhanced by template-matching subspace detection, grid search locations which was improved using the double-differencing re-location technique, as well as Richter (ML) and moment (Mw) magnitude computations for all detected events. In addition, moment tensors were computed from first motion polarities and amplitudes for the subset of highest SNR events. The resulting surface event catalog shows a very weak spatio-temporal correlation to HF operations with only 43% of recorded seismicity occurring during HF stages times. This along with source mechanisms shows that the surface-recorded seismicity delineates the activation of several pre-existing structures striking NNE-SSW and consistent with regional stress conditions as indicated by the orientation of SHmax. Comparison of the sparse-surface and single downhole string datasets allows us to perform a cost-benefit analysis of the two monitoring methods. Our findings show that although the downhole array recorded ten times as many events, the surface network provides a more coherent delineation of the underlying structure and more accurate magnitudes for larger magnitude events. We attribute this to the enhanced focal coverage provided by the surface

Novel recurrent neural network for modelling biological networks: oscillatory p53 interaction dynamics.

Science.gov (United States)

Ling, Hong; Samarasinghe, Sandhya; Kulasiri, Don

2013-12-01

Understanding the control of cellular networks consisting of gene and protein interactions and their emergent properties is a central activity of Systems Biology research. For this, continuous, discrete, hybrid, and stochastic methods have been proposed. Currently, the most common approach to modelling accurate temporal dynamics of networks is ordinary differential equations (ODE). However, critical limitations of ODE models are difficulty in kinetic parameter estimation and numerical solution of a large number of equations, making them more suited to smaller systems. In this article, we introduce a novel recurrent artificial neural network (RNN) that addresses above limitations and produces a continuous model that easily estimates parameters from data, can handle a large number of molecular interactions and quantifies temporal dynamics and emergent systems properties. This RNN is based on a system of ODEs representing molecular interactions in a signalling network. Each neuron represents concentration change of one molecule represented by an ODE. Weights of the RNN correspond to kinetic parameters in the system and can be adjusted incrementally during network training. The method is applied to the p53-Mdm2 oscillation system - a crucial component of the DNA damage response pathways activated by a damage signal. Simulation results indicate that the proposed RNN can successfully represent the behaviour of the p53-Mdm2 oscillation system and solve the parameter estimation problem with high accuracy. Furthermore, we presented a modified form of the RNN that estimates parameters and captures systems dynamics from sparse data collected over relatively large time steps. We also investigate the robustness of the p53-Mdm2 system using the trained RNN under various levels of parameter perturbation to gain a greater understanding of the control of the p53-Mdm2 system. Its outcomes on robustness are consistent with the current biological knowledge of this system. As more

Detection of Pitting in Gears Using a Deep Sparse Autoencoder

Directory of Open Access Journals (Sweden)

Yongzhi Qu

2017-05-01

Full Text Available In this paper; a new method for gear pitting fault detection is presented. The presented method is developed based on a deep sparse autoencoder. The method integrates dictionary learning in sparse coding into a stacked autoencoder network. Sparse coding with dictionary learning is viewed as an adaptive feature extraction method for machinery fault diagnosis. An autoencoder is an unsupervised machine learning technique. A stacked autoencoder network with multiple hidden layers is considered to be a deep learning network. The presented method uses a stacked autoencoder network to perform the dictionary learning in sparse coding and extract features from raw vibration data automatically. These features are then used to perform gear pitting fault detection. The presented method is validated with vibration data collected from gear tests with pitting faults in a gearbox test rig and compared with an existing deep learning-based approach.

Sparse Representation Based Range-Doppler Processing for Integrated OFDM Radar-Communication Networks

Directory of Open Access Journals (Sweden)

Bo Kong

2017-01-01

Full Text Available In an integrated radar-communication network, multiuser access techniques with minimal performance degradation and without range-Doppler ambiguities are required, especially in a dense user environment. In this paper, a multiuser access scheme with random subcarrier allocation mechanism is proposed for orthogonal frequency division multiplexing (OFDM based integrated radar-communication networks. The expression of modulation Symbol-Domain method combined with sparse representation (SR for range-Doppler estimation is introduced and a parallel reconstruction algorithm is employed. The radar target detection performance is improved with less spectrum occupation. Additionally, a Doppler frequency detector is exploited to decrease the computational complexity. Numerical simulations show that the proposed method outperforms the traditional modulation Symbol-Domain method under ideal and realistic nonideal scenarios.

Sparse coding reveals greater functional connectivity in female brains during naturalistic emotional experience.

Directory of Open Access Journals (Sweden)

Yudan Ren

Full Text Available Functional neuroimaging is widely used to examine changes in brain function associated with age, gender or neuropsychiatric conditions. FMRI (functional magnetic resonance imaging studies employ either laboratory-designed tasks that engage the brain with abstracted and repeated stimuli, or resting state paradigms with little behavioral constraint. Recently, novel neuroimaging paradigms using naturalistic stimuli are gaining increasing attraction, as they offer an ecologically-valid condition to approximate brain function in real life. Wider application of naturalistic paradigms in exploring individual differences in brain function, however, awaits further advances in statistical methods for modeling dynamic and complex dataset. Here, we developed a novel data-driven strategy that employs group sparse representation to assess gender differences in brain responses during naturalistic emotional experience. Comparing to independent component analysis (ICA, sparse coding algorithm considers the intrinsic sparsity of neural coding and thus could be more suitable in modeling dynamic whole-brain fMRI signals. An online dictionary learning and sparse coding algorithm was applied to the aggregated fMRI signals from both groups, which was subsequently factorized into a common time series signal dictionary matrix and the associated weight coefficient matrix. Our results demonstrate that group sparse representation can effectively identify gender differences in functional brain network during natural viewing, with improved sensitivity and reliability over ICA-based method. Group sparse representation hence offers a superior data-driven strategy for examining brain function during naturalistic conditions, with great potential for clinical application in neuropsychiatric disorders.

Sparse adaptive filters for echo cancellation

CERN Document Server

Paleologu, Constantin

2011-01-01

Adaptive filters with a large number of coefficients are usually involved in both network and acoustic echo cancellation. Consequently, it is important to improve the convergence rate and tracking of the conventional algorithms used for these applications. This can be achieved by exploiting the sparseness character of the echo paths. Identification of sparse impulse responses was addressed mainly in the last decade with the development of the so-called ``proportionate''-type algorithms. The goal of this book is to present the most important sparse adaptive filters developed for echo cancellati

A linear programming approach for estimating the structure of a sparse linear genetic network from transcript profiling data

Directory of Open Access Journals (Sweden)

Chandra Nagasuma R

2009-02-01

Full Text Available Abstract Background A genetic network can be represented as a directed graph in which a node corresponds to a gene and a directed edge specifies the direction of influence of one gene on another. The reconstruction of such networks from transcript profiling data remains an important yet challenging endeavor. A transcript profile specifies the abundances of many genes in a biological sample of interest. Prevailing strategies for learning the structure of a genetic network from high-dimensional transcript profiling data assume sparsity and linearity. Many methods consider relatively small directed graphs, inferring graphs with up to a few hundred nodes. This work examines large undirected graphs representations of genetic networks, graphs with many thousands of nodes where an undirected edge between two nodes does not indicate the direction of influence, and the problem of estimating the structure of such a sparse linear genetic network (SLGN from transcript profiling data. Results The structure learning task is cast as a sparse linear regression problem which is then posed as a LASSO (l1-constrained fitting problem and solved finally by formulating a Linear Program (LP. A bound on the Generalization Error of this approach is given in terms of the Leave-One-Out Error. The accuracy and utility of LP-SLGNs is assessed quantitatively and qualitatively using simulated and real data. The Dialogue for Reverse Engineering Assessments and Methods (DREAM initiative provides gold standard data sets and evaluation metrics that enable and facilitate the comparison of algorithms for deducing the structure of networks. The structures of LP-SLGNs estimated from the INSILICO1, INSILICO2 and INSILICO3 simulated DREAM2 data sets are comparable to those proposed by the first and/or second ranked teams in the DREAM2 competition. The structures of LP-SLGNs estimated from two published Saccharomyces cerevisae cell cycle transcript profiling data sets capture known

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

Science.gov (United States)

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

2017-12-01

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

High resolution depth reconstruction from monocular images and sparse point clouds using deep convolutional neural network

Science.gov (United States)

Dimitrievski, Martin; Goossens, Bart; Veelaert, Peter; Philips, Wilfried

2017-09-01

Understanding the 3D structure of the environment is advantageous for many tasks in the field of robotics and autonomous vehicles. From the robot's point of view, 3D perception is often formulated as a depth image reconstruction problem. In the literature, dense depth images are often recovered deterministically from stereo image disparities. Other systems use an expensive LiDAR sensor to produce accurate, but semi-sparse depth images. With the advent of deep learning there have also been attempts to estimate depth by only using monocular images. In this paper we combine the best of the two worlds, focusing on a combination of monocular images and low cost LiDAR point clouds. We explore the idea that very sparse depth information accurately captures the global scene structure while variations in image patches can be used to reconstruct local depth to a high resolution. The main contribution of this paper is a supervised learning depth reconstruction system based on a deep convolutional neural network. The network is trained on RGB image patches reinforced with sparse depth information and the output is a depth estimate for each pixel. Using image and point cloud data from the KITTI vision dataset we are able to learn a correspondence between local RGB information and local depth, while at the same time preserving the global scene structure. Our results are evaluated on sequences from the KITTI dataset and our own recordings using a low cost camera and LiDAR setup.

Discrete dynamic modeling of T cell survival signaling networks

Science.gov (United States)

Zhang, Ranran

2009-03-01

Biochemistry-based frameworks are often not applicable for the modeling of heterogeneous regulatory systems that are sparsely documented in terms of quantitative information. As an alternative, qualitative models assuming a small set of discrete states are gaining acceptance. This talk will present a discrete dynamic model of the signaling network responsible for the survival and long-term competence of cytotoxic T cells in the blood cancer T-LGL leukemia. We integrated the signaling pathways involved in normal T cell activation and the known deregulations of survival signaling in leukemic T-LGL, and formulated the regulation of each network element as a Boolean (logic) rule. Our model suggests that the persistence of two signals is sufficient to reproduce all known deregulations in leukemic T-LGL. It also indicates the nodes whose inactivity is necessary and sufficient for the reversal of the T-LGL state. We have experimentally validated several model predictions, including: (i) Inhibiting PDGF signaling induces apoptosis in leukemic T-LGL. (ii) Sphingosine kinase 1 and NFκB are essential for the long-term survival of T cells in T-LGL leukemia. (iii) T box expressed in T cells (T-bet) is constitutively activated in the T-LGL state. The model has identified potential therapeutic targets for T-LGL leukemia and can be used for generating long-term competent CTL necessary for tumor and cancer vaccine development. The success of this model, and of other discrete dynamic models, suggests that the organization of signaling networks has an determining role in their dynamics. Reference: R. Zhang, M. V. Shah, J. Yang, S. B. Nyland, X. Liu, J. K. Yun, R. Albert, T. P. Loughran, Jr., Network Model of Survival Signaling in LGL Leukemia, PNAS 105, 16308-16313 (2008).

Analysis and Optimization of Sparse Random Linear Network Coding for Reliable Multicast Services

DEFF Research Database (Denmark)

Tassi, Andrea; Chatzigeorgiou, Ioannis; Roetter, Daniel Enrique Lucani

2016-01-01

Point-to-multipoint communications are expected to play a pivotal role in next-generation networks. This paper refers to a cellular system transmitting layered multicast services to a multicast group of users. Reliability of communications is ensured via different random linear network coding (RLNC......) techniques. We deal with a fundamental problem: the computational complexity of the RLNC decoder. The higher the number of decoding operations is, the more the user's computational overhead grows and, consequently, the faster the battery of mobile devices drains. By referring to several sparse RLNC...... techniques, and without any assumption on the implementation of the RLNC decoder in use, we provide an efficient way to characterize the performance of users targeted by ultra-reliable layered multicast services. The proposed modeling allows to efficiently derive the average number of coded packet...

Dynamical analysis of Schrodinger operators with growing sparse potentials

CERN Document Server

Tcheremchantsev, S

2003-01-01

We consider Scr\\"odinger operators in l^2(Z^+) with potentials of the form V(n)=S(n)+Q(n). Here S is a sparse potential: S(n)=n^{1-\\eta \\over 2 \\eta}, 0<\\eta <1, for n=L_N and S(n)=0 else, where L_N is a very fast growing sequence. The real function Q(n) is compactly supported. We give a rather complete description of the (time-averaged) dynamics exp(-itH) \\psi for different initial states \\psi. In particular, for some \\psi we calculate explicitely the "intermittency function" \\beta_\\psi^- (p) which turns out to be nonconstant. As a particular corollary of obtained results, we show that the spectral measure restricted to (-2,2) has exact Hausdorff dimension \\eta for all boundary conditions, improving the result of Jitomirskaya and Last.

Diurnal Transcriptome and Gene Network Represented through Sparse Modeling in Brachypodium distachyon

Directory of Open Access Journals (Sweden)

Satoru Koda

2017-11-01

Full Text Available We report the comprehensive identification of periodic genes and their network inference, based on a gene co-expression analysis and an Auto-Regressive eXogenous (ARX model with a group smoothly clipped absolute deviation (SCAD method using a time-series transcriptome dataset in a model grass, Brachypodium distachyon. To reveal the diurnal changes in the transcriptome in B. distachyon, we performed RNA-seq analysis of its leaves sampled through a diurnal cycle of over 48 h at 4 h intervals using three biological replications, and identified 3,621 periodic genes through our wavelet analysis. The expression data are feasible to infer network sparsity based on ARX models. We found that genes involved in biological processes such as transcriptional regulation, protein degradation, and post-transcriptional modification and photosynthesis are significantly enriched in the periodic genes, suggesting that these processes might be regulated by circadian rhythm in B. distachyon. On the basis of the time-series expression patterns of the periodic genes, we constructed a chronological gene co-expression network and identified putative transcription factors encoding genes that might be involved in the time-specific regulatory transcriptional network. Moreover, we inferred a transcriptional network composed of the periodic genes in B. distachyon, aiming to identify genes associated with other genes through variable selection by grouping time points for each gene. Based on the ARX model with the group SCAD regularization using our time-series expression datasets of the periodic genes, we constructed gene networks and found that the networks represent typical scale-free structure. Our findings demonstrate that the diurnal changes in the transcriptome in B. distachyon leaves have a sparse network structure, demonstrating the spatiotemporal gene regulatory network over the cyclic phase transitions in B. distachyon diurnal growth.

Structure and dynamics of the global financial network

International Nuclear Information System (INIS)

Silva, Thiago Christiano; Rubens Stancato de Souza, Sergio; Tabak, Benjamin Miranda

2016-01-01

In this paper, we study the evolution of the network topology for the global financial market. We evaluate the level of diversification and participation of developed and emerging economies in cross-border exposures and find that the gross exposure network is dense, the vulnerability matrix is sparse, and the network’s fragility changes over time. Prior to the financial crisis in 2008, the network was relatively fragile, whereas it became more resilient afterwards, showing a reduction in financial institutions’ risk appetite. Our results suggest that financial regulators should track down the network evolution in their systemic risk assessment.

Opinion competition dynamics on multiplex networks

Science.gov (United States)

Amato, R.; Kouvaris, N. E.; San Miguel, M.; Díaz-Guilera, A.

2017-12-01

Multilayer and multiplex networks represent a good proxy for the description of social phenomena where social structure is important and can have different origins. Here, we propose a model of opinion competition where individuals are organized according to two different structures in two layers. Agents exchange opinions according to the Abrams-Strogatz model in each layer separately and opinions can be copied across layers by the same individual. In each layer a different opinion is dominant, so each layer has a different absorbing state. Consensus in one opinion is not the only possible stable solution because of the interaction between the two layers. A new mean field solution has been found where both opinions coexist. In a finite system there is a long transient time for the dynamical coexistence of both opinions. However, the system ends in a consensus state due to finite size effects. We analyze sparse topologies in the two layers and the existence of positive correlations between them, which enables the coexistence of inter-layer groups of agents sharing the same opinion.

Dynamic Representations of Sparse Graphs

DEFF Research Database (Denmark)

Brodal, Gerth Stølting; Fagerberg, Rolf

1999-01-01

We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....

Fast convolutional sparse coding using matrix inversion lemma

Czech Academy of Sciences Publication Activity Database

Šorel, Michal; Šroubek, Filip

2016-01-01

Roč. 55, č. 1 (2016), s. 44-51 ISSN 1051-2004 R&D Projects: GA ČR GA13-29225S Institutional support: RVO:67985556 Keywords : Convolutional sparse coding * Feature learning * Deconvolution networks * Shift-invariant sparse coding Subject RIV: JD - Computer Applications, Robotics Impact factor: 2.337, year: 2016 http://library.utia.cas.cz/separaty/2016/ZOI/sorel-0459332.pdf

The cell wall of Arabidopsis thaliana influences actin network dynamics.

Science.gov (United States)

Tolmie, Frances; Poulet, Axel; McKenna, Joseph; Sassmann, Stefan; Graumann, Katja; Deeks, Michael; Runions, John

2017-07-20

In plant cells, molecular connections link the cell wall-plasma membrane-actin cytoskeleton to form a continuum. It is hypothesized that the cell wall provides stable anchor points around which the actin cytoskeleton remodels. Here we use live cell imaging of fluorescently labelled marker proteins to quantify the organization and dynamics of the actin cytoskeleton and to determine the impact of disrupting connections within the continuum. Labelling of the actin cytoskeleton with green fluorescent protein (GFP)-fimbrin actin-binding domain 2 (FABD2) resulted in a network composed of fine filaments and thicker bundles that appeared as a highly dynamic remodelling meshwork. This differed substantially from the GFP-Lifeact-labelled network that appeared much more sparse with thick bundles that underwent 'simple movement', in which the bundles slightly change position, but in such a manner that the structure of the network was not substantially altered during the time of observation. Label-dependent differences in actin network morphology and remodelling necessitated development of two new image analysis techniques. The first of these, 'pairwise image subtraction', was applied to measurement of the more rapidly remodelling actin network labelled with GFP-FABD2, while the second, 'cumulative fluorescence intensity', was used to measure bulk remodelling of the actin cytoskeleton when labelled with GFP-Lifeact. In each case, these analysis techniques show that the actin cytoskeleton has a decreased rate of bulk remodelling when the cell wall-plasma membrane-actin continuum is disrupted either by plasmolysis or with isoxaben, a drug that specifically inhibits cellulose deposition. Changes in the rate of actin remodelling also affect its functionality, as observed by alteration in Golgi body motility. © The Author 2017. Published by Oxford University Press on behalf of the Society for Experimental Biology. All rights reserved. For permissions, please email: journals.permissions@oup.com.

A network dynamics approach to chemical reaction networks

NARCIS (Netherlands)

van der Schaft, Abraham; Rao, S.; Jayawardhana, B.

2016-01-01

A treatment of 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

Sparsely-Packetized Predictive Control by Orthogonal Matching Pursuit

DEFF Research Database (Denmark)

Nagahara, Masaaki; Quevedo, Daniel; Østergaard, Jan

2012-01-01

We study packetized predictive control, known to be robust against packet dropouts in networked systems. To obtain sparse packets for rate-limited networks, we design control packets via an ℓ0 optimization, which can be eectively solved by orthogonal matching pursuit. Our formulation ensures...

Deep ensemble learning of sparse regression models for brain disease diagnosis.

Science.gov (United States)

Suk, Heung-Il; Lee, Seong-Whan; Shen, Dinggang

2017-04-01

Recent studies on brain imaging analysis witnessed the core roles of machine learning techniques in computer-assisted intervention for brain disease diagnosis. Of various machine-learning techniques, sparse regression models have proved their effectiveness in handling high-dimensional data but with a small number of training samples, especially in medical problems. In the meantime, deep learning methods have been making great successes by outperforming the state-of-the-art performances in various applications. In this paper, we propose a novel framework that combines the two conceptually different methods of sparse regression and deep learning for Alzheimer's disease/mild cognitive impairment diagnosis and prognosis. Specifically, we first train multiple sparse regression models, each of which is trained with different values of a regularization control parameter. Thus, our multiple sparse regression models potentially select different feature subsets from the original feature set; thereby they have different powers to predict the response values, i.e., clinical label and clinical scores in our work. By regarding the response values from our sparse regression models as target-level representations, we then build a deep convolutional neural network for clinical decision making, which thus we call 'Deep Ensemble Sparse Regression Network.' To our best knowledge, this is the first work that combines sparse regression models with deep neural network. In our experiments with the ADNI cohort, we validated the effectiveness of the proposed method by achieving the highest diagnostic accuracies in three classification tasks. We also rigorously analyzed our results and compared with the previous studies on the ADNI cohort in the literature. Copyright © 2017 Elsevier B.V. All rights reserved.

Entropy of dynamical social networks

Science.gov (United States)

Zhao, Kun; Karsai, Marton; Bianconi, Ginestra

2012-02-01

Dynamical social networks are evolving rapidly and are highly adaptive. Characterizing the information encoded in social networks is essential to gain insight into the structure, evolution, adaptability and dynamics. Recently entropy measures have been used to quantify the information in email correspondence, static networks and mobility patterns. Nevertheless, we still lack methods to quantify the information encoded in time-varying dynamical social networks. In this talk we present a model to quantify the entropy of dynamical social networks and use this model to analyze the data of phone-call communication. We show evidence that the entropy of the phone-call interaction network changes according to circadian rhythms. Moreover we show that social networks are extremely adaptive and are modified by the use of technologies such as mobile phone communication. Indeed the statistics of duration of phone-call is described by a Weibull distribution and is significantly different from the distribution of duration of face-to-face interactions in a conference. Finally we investigate how much the entropy of dynamical social networks changes in realistic models of phone-call or face-to face interactions characterizing in this way different type human social behavior.

Comparison between sparsely distributed memory and Hopfield-type neural network models

Science.gov (United States)

Keeler, James D.

1986-01-01

The Sparsely Distributed Memory (SDM) model (Kanerva, 1984) is compared to Hopfield-type neural-network models. A mathematical framework for comparing the two is developed, and the capacity of each model is investigated. The capacity of the SDM can be increased independently of the dimension of the stored vectors, whereas the Hopfield capacity is limited to a fraction of this dimension. However, the total number of stored bits per matrix element is the same in the two models, as well as for extended models with higher order interactions. The models are also compared in their ability to store sequences of patterns. The SDM is extended to include time delays so that contextual information can be used to cover sequences. Finally, it is shown how a generalization of the SDM allows storage of correlated input pattern vectors.

Input dependent cell assembly dynamics in a model of the striatal medium spiny neuron network

Directory of Open Access Journals (Sweden)

Adam ePonzi

2012-03-01

Full Text Available The striatal medium spiny neuron (MSNs network is sparsely connected with fairly weak GABAergic collaterals receiving an excitatory glutamatergic cortical projection. Peri stimulus time histograms (PSTH of MSN population response investigated in various experimental studies display strong firing rate modulations distributed throughout behavioural task epochs. In previous work we have shown by numerical simulation that sparse random networks of inhibitory spiking neurons with characteristics appropriate for UP state MSNs form cell assemblies which fire together coherently in sequences on long behaviourally relevant timescales when the network receives a fixed pattern of constant input excitation. Here we first extend that model to the case where cortical excitation is composed of many independent noisy Poisson processes and demonstrate that cell assembly dynamics is still observed when the input is sufficiently weak. However if cortical excitation strength is increased more regularly firing and completely quiescent cells are found, which depend on the cortical stimulation. Subsequently we further extend previous work to consider what happens when the excitatory input varies as it would in when the animal is engaged in behavior. We investigate how sudden switches in excitation interact with network generated patterned activity. We show that sequences of cell assembly activations can be locked to the excitatory input sequence and delineate the range of parameters where this behaviour is shown. Model cell population PSTH display both stimulus and temporal specificity, with large population firing rate modulations locked to elapsed time from task events. Thus the random network can generate a large diversity of temporally evolving stimulus dependent responses even though the input is fixed between switches. We suggest the MSN network is well suited to the generation of such slow coherent task dependent response

Input dependent cell assembly dynamics in a model of the striatal medium spiny neuron network.

Science.gov (United States)

Ponzi, Adam; Wickens, Jeff

2012-01-01

The striatal medium spiny neuron (MSN) network is sparsely connected with fairly weak GABAergic collaterals receiving an excitatory glutamatergic cortical projection. Peri-stimulus time histograms (PSTH) of MSN population response investigated in various experimental studies display strong firing rate modulations distributed throughout behavioral task epochs. In previous work we have shown by numerical simulation that sparse random networks of inhibitory spiking neurons with characteristics appropriate for UP state MSNs form cell assemblies which fire together coherently in sequences on long behaviorally relevant timescales when the network receives a fixed pattern of constant input excitation. Here we first extend that model to the case where cortical excitation is composed of many independent noisy Poisson processes and demonstrate that cell assembly dynamics is still observed when the input is sufficiently weak. However if cortical excitation strength is increased more regularly firing and completely quiescent cells are found, which depend on the cortical stimulation. Subsequently we further extend previous work to consider what happens when the excitatory input varies as it would when the animal is engaged in behavior. We investigate how sudden switches in excitation interact with network generated patterned activity. We show that sequences of cell assembly activations can be locked to the excitatory input sequence and outline the range of parameters where this behavior is shown. Model cell population PSTH display both stimulus and temporal specificity, with large population firing rate modulations locked to elapsed time from task events. Thus the random network can generate a large diversity of temporally evolving stimulus dependent responses even though the input is fixed between switches. We suggest the MSN network is well suited to the generation of such slow coherent task dependent response which could be utilized by the animal in behavior.

Structured chaos shapes spike-response noise entropy in balanced neural networks

Directory of Open Access Journals (Sweden)

Guillaume eLajoie

2014-10-01

Full Text Available Large networks of sparsely coupled, excitatory and inhibitory cells occur throughout the brain. For many models of these networks, a striking feature is that their dynamics are chaotic and thus, are sensitive to small perturbations. How does this chaos manifest in the neural code? Specifically, how variable are the spike patterns that such a network produces in response to an input signal? To answer this, we derive a bound for a general measure of variability -- spike-train entropy. This leads to important insights on the variability of multi-cell spike pattern distributions in large recurrent networks of spiking neurons responding to fluctuating inputs. The analysis is based on results from random dynamical systems theory and is complemented by detailed numerical simulations. We find that the spike pattern entropy is an order of magnitude lower than what would be extrapolated from single cells. This holds despite the fact that network coupling becomes vanishingly sparse as network size grows -- a phenomenon that depends on ``extensive chaos, as previously discovered for balanced networks without stimulus drive. Moreover, we show how spike pattern entropy is controlled by temporal features of the inputs. Our findings provide insight into how neural networks may encode stimuli in the presence of inherently chaotic dynamics.

Dynamic Controllability and Dispatchability Relationships

Science.gov (United States)

Morris, Paul Henry

2014-01-01

An important issue for temporal planners is the ability to handle temporal uncertainty. Recent papers have addressed the question of how to tell whether a temporal network is Dynamically Controllable, i.e., whether the temporal requirements are feasible in the light of uncertain durations of some processes. We present a fast algorithm for Dynamic Controllability. We also note a correspondence between the reduction steps in the algorithm and the operations involved in converting the projections to dispatchable form. This has implications for the complexity for sparse networks.

A network of spiking neurons for computing sparse representations in an energy-efficient way.

Science.gov (United States)

Hu, Tao; Genkin, Alexander; Chklovskii, Dmitri B

2012-11-01

Computing sparse redundant representations is an important problem in both applied mathematics and neuroscience. In many applications, this problem must be solved in an energy-efficient way. Here, we propose a hybrid distributed algorithm (HDA), which solves this problem on a network of simple nodes communicating by low-bandwidth channels. HDA nodes perform both gradient-descent-like steps on analog internal variables and coordinate-descent-like steps via quantized external variables communicated to each other. Interestingly, the operation is equivalent to a network of integrate-and-fire neurons, suggesting that HDA may serve as a model of neural computation. We show that the numerical performance of HDA is on par with existing algorithms. In the asymptotic regime, the representation error of HDA decays with time, t, as 1/t. HDA is stable against time-varying noise; specifically, the representation error decays as 1/√t for gaussian white noise.

An NoC Traffic Compiler for Efficient FPGA Implementation of Sparse Graph-Oriented Workloads

Directory of Open Access Journals (Sweden)

Nachiket Kapre

2011-01-01

synchronization to optimize our workloads for large networks up to 2025 parallel elements for BSP model and 25 parallel elements for Token Dataflow. This allows us to demonstrate speedups between 1.2× and 22× (3.5× mean, area reductions (number of Processing Elements between 3× and 15× (9× mean and dynamic energy savings between 2× and 3.5× (2.7× mean over a range of real-world graph applications in the BSP compute model. We deliver speedups of 0.5–13× (geomean 3.6× for Sparse Direct Matrix Solve (Token Dataflow compute model applied to a range of sparse matrices when using a high-quality placement algorithm. We expect such traffic optimization tools and techniques to become an essential part of the NoC application-mapping flow.

SparseM: A Sparse Matrix Package for R *

Directory of Open Access Journals (Sweden)

Roger Koenker

2003-02-01

Full Text Available SparseM provides some basic R functionality for linear algebra with sparse matrices. Use of the package is illustrated by a family of linear model fitting functions that implement least squares methods for problems with sparse design matrices. Significant performance improvements in memory utilization and computational speed are possible for applications involving large sparse matrices.

A network dynamics approach to chemical reaction networks

Science.gov (United States)

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.

Inferring network topology from complex dynamics

International Nuclear Information System (INIS)

Shandilya, Srinivas Gorur; Timme, Marc

2011-01-01

Inferring the network topology from dynamical observations is a fundamental problem pervading research on complex systems. Here, we present a simple, direct method for inferring the structural connection topology of a network, given an observation of one collective dynamical trajectory. The general theoretical framework is applicable to arbitrary network dynamical systems described by ordinary differential equations. No interference (external driving) is required and the type of dynamics is hardly restricted in any way. In particular, the observed dynamics may be arbitrarily complex; stationary, invariant or transient; synchronous or asynchronous and chaotic or periodic. Presupposing a knowledge of the functional form of the dynamical units and of the coupling functions between them, we present an analytical solution to the inverse problem of finding the network topology from observing a time series of state variables only. Robust reconstruction is achieved in any sufficiently long generic observation of the system. We extend our method to simultaneously reconstructing both the entire network topology and all parameters appearing linear in the system's equations of motion. Reconstruction of network topology and system parameters is viable even in the presence of external noise that distorts the original dynamics substantially. The method provides a conceptually new step towards reconstructing a variety of real-world networks, including gene and protein interaction networks and neuronal circuits.

Analog system for computing sparse codes

Science.gov (United States)

Rozell, Christopher John; Johnson, Don Herrick; Baraniuk, Richard Gordon; Olshausen, Bruno A.; Ortman, Robert Lowell

2010-08-24

A parallel dynamical system for computing sparse representations of data, i.e., where the data can be fully represented in terms of a small number of non-zero code elements, and for reconstructing compressively sensed images. The system is based on the principles of thresholding and local competition that solves a family of sparse approximation problems corresponding to various sparsity metrics. The system utilizes Locally Competitive Algorithms (LCAs), nodes in a population continually compete with neighboring units using (usually one-way) lateral inhibition to calculate coefficients representing an input in an over complete dictionary.

Sparse linear systems: Theory of decomposition, methods, technology, applications and implementation in Wolfram Mathematica

Energy Technology Data Exchange (ETDEWEB)

Pilipchuk, L. A., E-mail: pilipchik@bsu.by [Belarussian State University, 220030 Minsk, 4, Nezavisimosti avenue, Republic of Belarus (Belarus); Pilipchuk, A. S., E-mail: an.pilipchuk@gmail.com [The Natural Resources and Environmental Protestion Ministry of the Republic of Belarus, 220004 Minsk, 10 Kollektornaya Street, Republic of Belarus (Belarus)

2015-11-30

In this paper we propose the theory of decomposition, methods, technologies, applications and implementation in Wol-fram Mathematica for the constructing the solutions of the sparse linear systems. One of the applications is the Sensor Location Problem for the symmetric graph in the case when split ratios of some arc flows can be zeros. The objective of that application is to minimize the number of sensors that are assigned to the nodes. We obtain a sparse system of linear algebraic equations and research its matrix rank. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure.

Sparse linear systems: Theory of decomposition, methods, technology, applications and implementation in Wolfram Mathematica

International Nuclear Information System (INIS)

Pilipchuk, L. A.; Pilipchuk, A. S.

2015-01-01

In this paper we propose the theory of decomposition, methods, technologies, applications and implementation in Wol-fram Mathematica for the constructing the solutions of the sparse linear systems. One of the applications is the Sensor Location Problem for the symmetric graph in the case when split ratios of some arc flows can be zeros. The objective of that application is to minimize the number of sensors that are assigned to the nodes. We obtain a sparse system of linear algebraic equations and research its matrix rank. Sparse systems of these types appear in generalized network flow programming problems in the form of restrictions and can be characterized as systems with a large sparse sub-matrix representing the embedded network structure

Sparse Linear Identifiable Multivariate Modeling

DEFF Research Database (Denmark)

Henao, Ricardo; Winther, Ole

2011-01-01

and bench-marked on artificial and real biological data sets. SLIM is closest in spirit to LiNGAM (Shimizu et al., 2006), but differs substantially in inference, Bayesian network structure learning and model comparison. Experimentally, SLIM performs equally well or better than LiNGAM with comparable......In this paper we consider sparse and identifiable linear latent variable (factor) and linear Bayesian network models for parsimonious analysis of multivariate data. We propose a computationally efficient method for joint parameter and model inference, and model comparison. It consists of a fully...

Phase Diagram of Spiking Neural Networks

Directory of Open Access Journals (Sweden)

Hamed eSeyed-Allaei

2015-03-01

Full Text Available In computer simulations of spiking neural networks, often it is assumed that every two neurons of the network are connected by a probablilty of 2%, 20% of neurons are inhibitory and 80% are excitatory. These common values are based on experiments, observations. but here, I take a different perspective, inspired by evolution. I simulate many networks, each with a different set of parameters, and then I try to figure out what makes the common values desirable by nature. Networks which are configured according to the common values, have the best dynamic range in response to an impulse and their dynamic range is more robust in respect to synaptic weights. In fact, evolution has favored networks of best dynamic range. I present a phase diagram that shows the dynamic ranges of different networks of different parameteres. This phase diagram gives an insight into the space of parameters -- excitatory to inhibitory ratio, sparseness of connections and synaptic weights. It may serve as a guideline to decide about the values of parameters in a simulation of spiking neural network.

Tourism-planning network knowledge dynamics

DEFF Research Database (Denmark)

Dredge, Dianne

2014-01-01

This chapter explores the characteristics and functions of tourism networks as a first step in understanding how networks facilitate and reproduce knowledge. A framework to progress understandings of knowledge dynamics in tourism networks is presented that includes four key dimensions: context......, network agents, network boundaries and network resources. A case study of the development of the Next Generation Tourism Handbook (Queensland, Australia), a policy initiative that sought to bring tourism and land use planning knowledge closer together is presented. The case study illustrates...... that the tourism policy and land use planning networks operate in very different spheres and that context, network agents, network boundaries and network resources have a significant influence not only on knowledge dynamics but also on the capacity of network agents to overcome barriers to learning and to innovate....

A new strategy for weak events in sparse networks: the first-motion polarity solutions constrained by single-station waveform inversion

Czech Academy of Sciences Publication Activity Database

Fojtíková, Lucia; Zahradník, J.

2014-01-01

Roč. 85, č. 6 (2014), s. 1265-1274 ISSN 0895-0695 R&D Projects: GA ČR GAP210/12/2336 Institutional support: RVO:67985891 Keywords : weak events * sparse networks * focal mechanism * waveform inversion Subject RIV: DC - Siesmology, Volcanology, Earth Structure Impact factor: 2.156, year: 2014 http://srl.geoscienceworld.org/content/85/6/1265.full

Continuous time modelling of dynamical spatial lattice data observed at sparsely distributed times

DEFF Research Database (Denmark)

Rasmussen, Jakob Gulddahl; Møller, Jesper

2007-01-01

Summary. We consider statistical and computational aspects of simulation-based Bayesian inference for a spatial-temporal model based on a multivariate point process which is only observed at sparsely distributed times. The point processes are indexed by the sites of a spatial lattice......, and they exhibit spatial interaction. For specificity we consider a particular dynamical spatial lattice data set which has previously been analysed by a discrete time model involving unknown normalizing constants. We discuss the advantages and disadvantages of using continuous time processes compared...... with discrete time processes in the setting of the present paper as well as other spatial-temporal situations....

Information filtering in sparse online systems: recommendation via semi-local diffusion.

Science.gov (United States)

Zeng, Wei; Zeng, An; Shang, Ming-Sheng; Zhang, Yi-Cheng

2013-01-01

With the rapid growth of the Internet and overwhelming amount of information and choices that people are confronted with, recommender systems have been developed to effectively support users' decision-making process in the online systems. However, many recommendation algorithms suffer from the data sparsity problem, i.e. the user-object bipartite networks are so sparse that algorithms cannot accurately recommend objects for users. This data sparsity problem makes many well-known recommendation algorithms perform poorly. To solve the problem, we propose a recommendation algorithm based on the semi-local diffusion process on the user-object bipartite network. The simulation results on two sparse datasets, Amazon and Bookcross, show that our method significantly outperforms the state-of-the-art methods especially for those small-degree users. Two personalized semi-local diffusion methods are proposed which further improve the recommendation accuracy. Finally, our work indicates that sparse online systems are essentially different from the dense online systems, so it is necessary to reexamine former algorithms and conclusions based on dense data in sparse systems.

Conflict and convention in dynamic networks.

Science.gov (United States)

Foley, Michael; Forber, Patrick; Smead, Rory; Riedl, Christoph

2018-03-01

An important way to resolve games of conflict (snowdrift, hawk-dove, chicken) involves adopting a convention: a correlated equilibrium that avoids any conflict between aggressive strategies. Dynamic networks allow individuals to resolve conflict via their network connections rather than changing their strategy. Exploring how behavioural strategies coevolve with social networks reveals new dynamics that can help explain the origins and robustness of conventions. Here, we model the emergence of conventions as correlated equilibria in dynamic networks. Our results show that networks have the tendency to break the symmetry between the two conventional solutions in a strongly biased way. Rather than the correlated equilibrium associated with ownership norms (play aggressive at home, not away), we usually see the opposite host-guest norm (play aggressive away, not at home) evolve on dynamic networks, a phenomenon common to human interaction. We also show that learning to avoid conflict can produce realistic network structures in a way different than preferential attachment models. © 2017 The Author(s).

Activating and inhibiting connections in biological network dynamics

Directory of Open Access Journals (Sweden)

Knight Rob

2008-12-01

Full Text Available Abstract Background Many studies of biochemical networks have analyzed network topology. Such work has suggested that specific types of network wiring may increase network robustness and therefore confer a selective advantage. However, knowledge of network topology does not allow one to predict network dynamical behavior – for example, whether deleting a protein from a signaling network would maintain the network's dynamical behavior, or induce oscillations or chaos. Results Here we report that the balance between activating and inhibiting connections is important in determining whether network dynamics reach steady state or oscillate. We use a simple dynamical model of a network of interacting genes or proteins. Using the model, we study random networks, networks selected for robust dynamics, and examples of biological network topologies. The fraction of activating connections influences whether the network dynamics reach steady state or oscillate. Conclusion The activating fraction may predispose a network to oscillate or reach steady state, and neutral evolution or selection of this parameter may affect the behavior of biological networks. This principle may unify the dynamics of a wide range of cellular networks. Reviewers Reviewed by Sergei Maslov, Eugene Koonin, and Yu (Brandon Xia (nominated by Mark Gerstein. For the full reviews, please go to the Reviewers' comments section.

Asynchronous networks: modularization of dynamics theorem

Science.gov (United States)

Bick, Christian; Field, Michael

2017-02-01

Building on the first part of this paper, we develop the theory of functional asynchronous networks. We show that a large class of functional asynchronous networks can be (uniquely) represented as feedforward networks connecting events or dynamical modules. For these networks we can give a complete description of the network function in terms of the function of the events comprising the network: the modularization of dynamics theorem. We give examples to illustrate the main results.

Periodic dynamics in queuing networks

Energy Technology Data Exchange (ETDEWEB)

Addabbo, Tommaso [Information Engineering Department, University of Siena, Via Roma 56, 53100 Siena (Italy)], E-mail: addabbo@dii.unisi.it; Kocarev, Ljupco [Macedonian Academy of Sciences and Arts, bul. Krste Misirkov 2, P.O. Box 428, 1000 Skopje, Republic of Macedonia (Macedonia, The Former Yugoslav Republic of)], E-mail: lkocarev@ucsd.edu

2009-08-30

This paper deals with state-dependent open Markovian (or exponential) queuing networks, for which arrival and service rates, as well as routing probabilities, may depend on the queue lengths. For a network of this kind, following Mandelbaum and Pats, we provide a formal definition of its associated fluid model, and we focus on the relationships which may occur between the network stochastic dynamics and the deterministic dynamics of its corresponding fluid model, particularly focusing on queuing networks whose fluid models have global periodic attractors.

Comparison of the dynamics of neural interactions in integrate-and-fire networks with current-based and conductance-based synapses

Directory of Open Access Journals (Sweden)

Stefano eCavallari

2014-03-01

Full Text Available Models of networks of Leaky Integrate-and-Fire neurons (LIF are a widely used tool for theoretical investigations of brain function. These models have been used both with current- and conductance-based synapses. However, the differences in the dynamics expressed by these two approaches have been so far mainly studied at the single neuron level. To investigate how these synaptic models affect network activity, we compared the single-neuron and neural population dynamics of conductance-based networks (COBN and current-based networks (CUBN of LIF neurons. These networks were endowed with sparse excitatory and inhibitory recurrent connections, and were tested in conditions including both low- and high-conductance states. We developed a novel procedure to obtain comparable networks by properly tuning the synaptic parameters not shared by the models. The so defined comparable networks displayed an excellent and robust match of first order statistics (average single neuron firing rates and average frequency spectrum of network activity. However, these comparable networks showed profound differences in the second order statistics of neural population interactions and in the modulation of these properties by external inputs. The correlation between inhibitory and excitatory synaptic currents and the cross-neuron correlation between synaptic inputs, membrane potentials and spike trains were stronger and more stimulus-sensitive in the COBN. Because of these properties, the spike train correlation carried more information about the strength of the input in the COBN, although the firing rates were equally informative in both network models. Moreover, COBN showed stronger neuronal population synchronization in the gamma band, and their spectral information about the network input was higher and spread over a broader range of frequencies. These results suggest that second order properties of network dynamics depend strongly on the choice of synaptic model.

Psychology and social networks: a dynamic network theory perspective.

Science.gov (United States)

Westaby, James D; Pfaff, Danielle L; Redding, Nicholas

2014-04-01

Research on social networks has grown exponentially in recent years. However, despite its relevance, the field of psychology has been relatively slow to explain the underlying goal pursuit and resistance processes influencing social networks in the first place. In this vein, this article aims to demonstrate how a dynamic network theory perspective explains the way in which social networks influence these processes and related outcomes, such as goal achievement, performance, learning, and emotional contagion at the interpersonal level of analysis. The theory integrates goal pursuit, motivation, and conflict conceptualizations from psychology with social network concepts from sociology and organizational science to provide a taxonomy of social network role behaviors, such as goal striving, system supporting, goal preventing, system negating, and observing. This theoretical perspective provides psychologists with new tools to map social networks (e.g., dynamic network charts), which can help inform the development of change interventions. Implications for social, industrial-organizational, and counseling psychology as well as conflict resolution are discussed, and new opportunities for research are highlighted, such as those related to dynamic network intelligence (also known as cognitive accuracy), levels of analysis, methodological/ethical issues, and the need to theoretically broaden the study of social networking and social media behavior. (PsycINFO Database Record (c) 2014 APA, all rights reserved).

Continuous speech recognition with sparse coding

CSIR Research Space (South Africa)

Smit, WJ

2009-04-01

Full Text Available generative model. The spike train is classified by making use of a spike train model and dynamic programming. It is computationally expensive to find a sparse code. We use an iterative subset selection algorithm with quadratic programming for this process...

Revealing networks from dynamics: an introduction

International Nuclear Information System (INIS)

Timme, Marc; Casadiego, Jose

2014-01-01

What can we learn from the collective dynamics of a complex network about its interaction topology? Taking the perspective from nonlinear dynamics, we briefly review recent progress on how to infer structural connectivity (direct interactions) from accessing the dynamics of the units. Potential applications range from interaction networks in physics, to chemical and metabolic reactions, protein and gene regulatory networks as well as neural circuits in biology and electric power grids or wireless sensor networks in engineering. Moreover, we briefly mention some standard ways of inferring effective or functional connectivity. (topical review)

Fracture size and transmissivity correlations: Implications for transport simulations in sparse three-dimensional discrete fracture networks following a truncated power law distribution of fracture size

Science.gov (United States)

Hyman, J.; Aldrich, G. A.; Viswanathan, H. S.; Makedonska, N.; Karra, S.

2016-12-01

We characterize how different fracture size-transmissivity relationships influence flow and transport simulations through sparse three-dimensional discrete fracture networks. Although it is generally accepted that there is a positive correlation between a fracture's size and its transmissivity/aperture, the functional form of that relationship remains a matter of debate. Relationships that assume perfect correlation, semi-correlation, and non-correlation between the two have been proposed. To study the impact that adopting one of these relationships has on transport properties, we generate multiple sparse fracture networks composed of circular fractures whose radii follow a truncated power law distribution. The distribution of transmissivities are selected so that the mean transmissivity of the fracture networks are the same and the distributions of aperture and transmissivity in models that include a stochastic term are also the same.We observe that adopting a correlation between a fracture size and its transmissivity leads to earlier breakthrough times and higher effective permeability when compared to networks where no correlation is used. While fracture network geometry plays the principal role in determining where transport occurs within the network, the relationship between size and transmissivity controls the flow speed. These observations indicate DFN modelers should be aware that breakthrough times and effective permeabilities can be strongly influenced by such a relationship in addition to fracture and network statistics.

Dynamic and interacting complex networks

Science.gov (United States)

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

Assimilation of Spatially Sparse In Situ Soil Moisture Networks into a Continuous Model Domain

Science.gov (United States)

Gruber, A.; Crow, W. T.; Dorigo, W. A.

2018-02-01

Growth in the availability of near-real-time soil moisture observations from ground-based networks has spurred interest in the assimilation of these observations into land surface models via a two-dimensional data assimilation system. However, the design of such systems is currently hampered by our ignorance concerning the spatial structure of error afflicting ground and model-based soil moisture estimates. Here we apply newly developed triple collocation techniques to provide the spatial error information required to fully parameterize a two-dimensional (2-D) data assimilation system designed to assimilate spatially sparse observations acquired from existing ground-based soil moisture networks into a spatially continuous Antecedent Precipitation Index (API) model for operational agricultural drought monitoring. Over the contiguous United States (CONUS), the posterior uncertainty of surface soil moisture estimates associated with this 2-D system is compared to that obtained from the 1-D assimilation of remote sensing retrievals to assess the value of ground-based observations to constrain a surface soil moisture analysis. Results demonstrate that a fourfold increase in existing CONUS ground station density is needed for ground network observations to provide a level of skill comparable to that provided by existing satellite-based surface soil moisture retrievals.

The dynamics of transmission and the dynamics of networks.

Science.gov (United States)

Farine, Damien

2017-05-01

A toy example depicted here highlighting the results of a study in this issue of the Journal of Animal Ecology that investigates the impact of network dynamics on potential disease outbreaks. Infections (stars) that spread by contact only (left) reduce the predicted outbreak size compared to situations where individuals can become infected by moving through areas that previously contained infected individuals (right). This is potentially important in species where individuals, or in this case groups, have overlapping ranges (as depicted on the top right). Incorporating network dynamics that maintain information about the ordering of contacts (central blocks; including the ordering of spatial overlap as noted by the arrows that highlight the blue group arriving after the red group in top-right of the figure) is important for capturing how a disease might not have the opportunity to spread to all individuals. By contrast, a static or 'average' network (lower blocks) does not capture any of these dynamics. Interestingly, although static networks generally predict larger outbreak sizes, the authors find that in cases when transmission probability is low, this prediction can switch as a result of changes in the estimated intensity of contacts among individuals. [Colour figure can be viewed at wileyonlinelibrary.com]. Springer, A., Kappeler, P.M. & Nunn, C.L. (2017) Dynamic vs. static social networks in models of parasite transmission: Predicting Cryptosporidium spread in wild lemurs. Journal of Animal Ecology, 86, 419-433. The spread of disease or information through networks can be affected by several factors. Whether and how these factors are accounted for can fundamentally change the predicted impact of a spreading epidemic. Springer, Kappeler & Nunn () investigate the role of different modes of transmission and network dynamics on the predicted size of a disease outbreak across several groups of Verreaux's sifakas, a group-living species of lemur. While some factors

Dynamics of High-Resolution Networks

DEFF Research Database (Denmark)

Sekara, Vedran

the unprecedented amounts of information collected by mobile phones to gain detailed insight into the dynamics of social systems. This dissertation presents an unparalleled data collection campaign, collecting highly detailed traces for approximately 1000 people over the course of multiple years. The availability...... are we all affected by an ever changing network structure? Answering these questions will enrich our understanding of ourselves, our organizations, and our societies. Yet, mapping the dynamics of social networks has traditionally been an arduous undertaking. Today, however, it is possible to use...... of such dynamic maps allows us to probe the underlying social network and understand how individuals interact and form lasting friendships. More importantly, these highly detailed dynamic maps provide us new perspectives at traditional problems and allow us to quantify and predict human life....

Signal Sampling for Efficient Sparse Representation of Resting State FMRI Data

Science.gov (United States)

Ge, Bao; Makkie, Milad; Wang, Jin; Zhao, Shijie; Jiang, Xi; Li, Xiang; Lv, Jinglei; Zhang, Shu; Zhang, Wei; Han, Junwei; Guo, Lei; Liu, Tianming

2015-01-01

As the size of brain imaging data such as fMRI grows explosively, it provides us with unprecedented and abundant information about the brain. How to reduce the size of fMRI data but not lose much information becomes a more and more pressing issue. Recent literature studies tried to deal with it by dictionary learning and sparse representation methods, however, their computation complexities are still high, which hampers the wider application of sparse representation method to large scale fMRI datasets. To effectively address this problem, this work proposes to represent resting state fMRI (rs-fMRI) signals of a whole brain via a statistical sampling based sparse representation. First we sampled the whole brain’s signals via different sampling methods, then the sampled signals were aggregate into an input data matrix to learn a dictionary, finally this dictionary was used to sparsely represent the whole brain’s signals and identify the resting state networks. Comparative experiments demonstrate that the proposed signal sampling framework can speed-up by ten times in reconstructing concurrent brain networks without losing much information. The experiments on the 1000 Functional Connectomes Project further demonstrate its effectiveness and superiority. PMID:26646924

Facial Expression Recognition via Non-Negative Least-Squares Sparse Coding

Directory of Open Access Journals (Sweden)

Ying Chen

2014-05-01

Full Text Available Sparse coding is an active research subject in signal processing, computer vision, and pattern recognition. A novel method of facial expression recognition via non-negative least squares (NNLS sparse coding is presented in this paper. The NNLS sparse coding is used to form a facial expression classifier. To testify the performance of the presented method, local binary patterns (LBP and the raw pixels are extracted for facial feature representation. Facial expression recognition experiments are conducted on the Japanese Female Facial Expression (JAFFE database. Compared with other widely used methods such as linear support vector machines (SVM, sparse representation-based classifier (SRC, nearest subspace classifier (NSC, K-nearest neighbor (KNN and radial basis function neural networks (RBFNN, the experiment results indicate that the presented NNLS method performs better than other used methods on facial expression recognition tasks.

Information governance in dynamic networked business process management

NARCIS (Netherlands)

Rasouli, M.; Eshuis, H.; Grefen, P.W.P.J.; Trienekens, J.J.M.; Kusters, R.J.

2016-01-01

Competition in today’s globalized markets forces organizations to collaborate within dynamic business networks to provide mass-customized integrated solutions for customers. The collaboration within dynamic business networks necessitates forming dynamic networked business processes (DNBPs).

Fundamental structures of dynamic social networks

DEFF Research Database (Denmark)

Sekara, Vedran; Stopczynski, Arkadiusz; Jørgensen, Sune Lehmann

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

Stability and stabilisation of a class of networked dynamic systems

Science.gov (United States)

Liu, H. B.; Wang, D. Q.

2018-04-01

We investigate the stability and stabilisation of a linear time invariant networked heterogeneous system with arbitrarily connected subsystems. A new linear matrix inequality based sufficient and necessary condition for the stability is derived, based on which the stabilisation is provided. The obtained conditions efficiently utilise the block-diagonal characteristic of system parameter matrices and the sparseness of subsystem connection matrix. Moreover, a sufficient condition only dependent on each individual subsystem is also presented for the stabilisation of the networked systems with a large scale. Numerical simulations show that these conditions are computationally valid in the analysis and synthesis of a large-scale networked system.

Studying Dynamics in Business Networks

DEFF Research Database (Denmark)

Andersen, Poul Houman; Anderson, Helen; Havila, Virpi

1998-01-01

This paper develops a theory on network dynamics using the concepts of role and position from sociological theory. Moreover, the theory is further tested using case studies from Denmark and Finland......This paper develops a theory on network dynamics using the concepts of role and position from sociological theory. Moreover, the theory is further tested using case studies from Denmark and Finland...

How complex a dynamical network can be?

International Nuclear Information System (INIS)

Baptista, M.S.; Kakmeni, F. Moukam; Del Magno, Gianluigi; Hussein, M.S.

2011-01-01

Positive Lyapunov exponents measure the asymptotic exponential divergence of nearby trajectories of a dynamical system. Not only they quantify how chaotic a dynamical system is, but since their sum is an upper bound for the rate of information production, they also provide a convenient way to quantify the complexity of a dynamical network. We conjecture based on numerical evidences that for a large class of dynamical networks composed by equal nodes, the sum of the positive Lyapunov exponents is bounded by the sum of all the positive Lyapunov exponents of both the synchronization manifold and its transversal directions, the last quantity being in principle easier to compute than the latter. As applications of our conjecture we: (i) show that a dynamical network composed of equal nodes and whose nodes are fully linearly connected produces more information than similar networks but whose nodes are connected with any other possible connecting topology; (ii) show how one can calculate upper bounds for the information production of realistic networks whose nodes have parameter mismatches, randomly chosen; (iii) discuss how to predict the behavior of a large dynamical network by knowing the information provided by a system composed of only two coupled nodes.

Complex Dynamical Network Control for Trajectory Tracking Using Delayed Recurrent Neural Networks

Directory of Open Access Journals (Sweden)

Jose P. Perez

2014-01-01

Full Text Available In this paper, the problem of trajectory tracking is studied. Based on the V-stability and Lyapunov theory, a control law that achieves the global asymptotic stability of the tracking error between a delayed recurrent neural network and a complex dynamical network is obtained. To illustrate the analytic results, we present a tracking simulation of a dynamical network with each node being just one Lorenz’s dynamical system and three identical Chen’s dynamical systems.

Markovian dynamics on complex reaction networks

Energy Technology Data Exchange (ETDEWEB)

Goutsias, J., E-mail: goutsias@jhu.edu; Jenkinson, G., E-mail: jenkinson@jhu.edu

2013-08-10

Complex networks, comprised of individual elements that interact with each other through reaction channels, are ubiquitous across many scientific and engineering disciplines. Examples include biochemical, pharmacokinetic, epidemiological, ecological, social, neural, and multi-agent networks. A common approach to modeling such networks is by a master equation that governs the dynamic evolution of the joint probability mass function of the underlying population process and naturally leads to Markovian dynamics for such process. Due however to the nonlinear nature of most reactions and the large size of the underlying state-spaces, computation and analysis of the resulting stochastic population dynamics is a difficult task. This review article provides a coherent and comprehensive coverage of recently developed approaches and methods to tackle this problem. After reviewing a general framework for modeling Markovian reaction networks and giving specific examples, the authors present numerical and computational techniques capable of evaluating or approximating the solution of the master equation, discuss a recently developed approach for studying the stationary behavior of Markovian reaction networks using a potential energy landscape perspective, and provide an introduction to the emerging theory of thermodynamic analysis of such networks. Three representative problems of opinion formation, transcription regulation, and neural network dynamics are used as illustrative examples.

Markovian dynamics on complex reaction networks

International Nuclear Information System (INIS)

Goutsias, J.; Jenkinson, G.

2013-01-01

Complex networks, comprised of individual elements that interact with each other through reaction channels, are ubiquitous across many scientific and engineering disciplines. Examples include biochemical, pharmacokinetic, epidemiological, ecological, social, neural, and multi-agent networks. A common approach to modeling such networks is by a master equation that governs the dynamic evolution of the joint probability mass function of the underlying population process and naturally leads to Markovian dynamics for such process. Due however to the nonlinear nature of most reactions and the large size of the underlying state-spaces, computation and analysis of the resulting stochastic population dynamics is a difficult task. This review article provides a coherent and comprehensive coverage of recently developed approaches and methods to tackle this problem. After reviewing a general framework for modeling Markovian reaction networks and giving specific examples, the authors present numerical and computational techniques capable of evaluating or approximating the solution of the master equation, discuss a recently developed approach for studying the stationary behavior of Markovian reaction networks using a potential energy landscape perspective, and provide an introduction to the emerging theory of thermodynamic analysis of such networks. Three representative problems of opinion formation, transcription regulation, and neural network dynamics are used as illustrative examples

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

Science.gov (United States)

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

2002-01-01

Wind tunnels use scale models to characterize aerodynamic coefficients, Wind tunnel testing can be slow and costly due to high personnel overhead and intensive power utilization. Although manual curve fitting can be done, it is highly efficient to use a neural network to define the complex relationship between variables. Numerical simulation of complex vehicles on the wide range of conditions required for flight simulation requires static and dynamic data. Static data at low Mach numbers and angles of attack may be obtained with simpler Euler codes. Static data of stalled vehicles where zones of flow separation are usually present at higher angles of attack require Navier-Stokes simulations which are costly due to the large processing time required to attain convergence. Preliminary dynamic data may be obtained with simpler methods based on correlations and vortex methods; however, accurate prediction of the dynamic coefficients requires complex and costly numerical simulations. A reliable and fast method of predicting complex aerodynamic coefficients for flight simulation I'S presented using a neural network. The training data for the neural network are derived from numerical simulations and wind-tunnel experiments. The aerodynamic coefficients are modeled as functions of the flow characteristics and the control surfaces of the vehicle. The basic coefficients of lift, drag and pitching moment are expressed as functions of angles of attack and Mach number. The modeled and training aerodynamic coefficients show good agreement. This method shows excellent potential for rapid development of aerodynamic models for flight simulation. Genetic Algorithms (GA) are used to optimize a previously built Artificial Neural Network (ANN) that reliably predicts aerodynamic coefficients. Results indicate that the GA provided an efficient method of optimizing the ANN model to predict aerodynamic coefficients. The reliability of the ANN using the GA includes prediction of aerodynamic

Local Dynamics in Trained Recurrent Neural Networks.

Science.gov (United States)

Rivkind, Alexander; Barak, Omri

2017-06-23

Learning a task induces connectivity changes in neural circuits, thereby changing their dynamics. To elucidate task-related neural dynamics, we study trained recurrent neural networks. We develop a mean field theory for reservoir computing networks trained to have multiple fixed point attractors. Our main result is that the dynamics of the network's output in the vicinity of attractors is governed by a low-order linear ordinary differential equation. The stability of the resulting equation can be assessed, predicting training success or failure. As a consequence, networks of rectified linear units and of sigmoidal nonlinearities are shown to have diametrically different properties when it comes to learning attractors. Furthermore, a characteristic time constant, which remains finite at the edge of chaos, offers an explanation of the network's output robustness in the presence of variability of the internal neural dynamics. Finally, the proposed theory predicts state-dependent frequency selectivity in the network response.

Local Dynamics in Trained Recurrent Neural Networks

Science.gov (United States)

Rivkind, Alexander; Barak, Omri

2017-06-01

Learning a task induces connectivity changes in neural circuits, thereby changing their dynamics. To elucidate task-related neural dynamics, we study trained recurrent neural networks. We develop a mean field theory for reservoir computing networks trained to have multiple fixed point attractors. Our main result is that the dynamics of the network's output in the vicinity of attractors is governed by a low-order linear ordinary differential equation. The stability of the resulting equation can be assessed, predicting training success or failure. As a consequence, networks of rectified linear units and of sigmoidal nonlinearities are shown to have diametrically different properties when it comes to learning attractors. Furthermore, a characteristic time constant, which remains finite at the edge of chaos, offers an explanation of the network's output robustness in the presence of variability of the internal neural dynamics. Finally, the proposed theory predicts state-dependent frequency selectivity in the network response.

Small-world networks of fuzzy chaotic oscillators

CERN Document Server

Bucolo, M; Fortuna, L

2003-01-01

Small-world topology has been used to build lattices of nonlinear fuzzy systems. Chaotic units, ruled by linguistic description and with specified Lyapunov exponent, have been realized and connected using linear diffusion coefficient. The dynamic features of the networks versus the number of systems connected have been investigated to underline phenomena like spatiotemporal chaos and complete regularization. The synchronization characteristics in case of sparse long-term connections and the performances comparison with regular and random network configurations are shown.

Evolution of regulatory networks towards adaptability and stability in a changing environment

Science.gov (United States)

Lee, Deok-Sun

2014-11-01

Diverse biological networks exhibit universal features distinguished from those of random networks, calling much attention to their origins and implications. Here we propose a minimal evolution model of Boolean regulatory networks, which evolve by selectively rewiring links towards enhancing adaptability to a changing environment and stability against dynamical perturbations. We find that sparse and heterogeneous connectivity patterns emerge, which show qualitative agreement with real transcriptional regulatory networks and metabolic networks. The characteristic scaling behavior of stability reflects the balance between robustness and flexibility. The scaling of fluctuation in the perturbation spread shows a dynamic crossover, which is analyzed by investigating separately the stochasticity of internal dynamics and the network structure differences depending on the evolution pathways. Our study delineates how the ambivalent pressure of evolution shapes biological networks, which can be helpful for studying general complex systems interacting with environments.

Temporal fidelity in dynamic social networks

DEFF Research Database (Denmark)

Stopczynski, Arkadiusz; Sapiezynski, Piotr; Pentland, Alex ‘Sandy’

2015-01-01

of the network dynamics can be used to inform the process of measuring social networks. The details of measurement are of particular importance when considering dynamic processes where minute-to-minute details are important, because collection of physical proximity interactions with high temporal resolution...

Pinning Synchronization of Switched Complex Dynamical Networks

Directory of Open Access Journals (Sweden)

Liming Du

2015-01-01

Full Text Available Network topology and node dynamics play a key role in forming synchronization of complex networks. Unfortunately there is no effective synchronization criterion for pinning synchronization of complex dynamical networks with switching topology. In this paper, pinning synchronization of complex dynamical networks with switching topology is studied. Two basic problems are considered: one is pinning synchronization of switched complex networks under arbitrary switching; the other is pinning synchronization of switched complex networks by design of switching when synchronization cannot achieved by using any individual connection topology alone. For the two problems, common Lyapunov function method and single Lyapunov function method are used respectively, some global synchronization criteria are proposed and the designed switching law is given. Finally, simulation results verify the validity of the results.

Semi-supervised sparse coding

KAUST Repository

Wang, Jim Jing-Yan; Gao, Xin

2014-01-01

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.

Semi-supervised sparse coding

KAUST Repository

Wang, Jim Jing-Yan

2014-07-06

Sparse coding approximates the data sample as a sparse linear combination of some basic codewords and uses the sparse codes as new presentations. In this paper, we investigate learning discriminative sparse codes by sparse coding in a semi-supervised manner, where only a few training samples are labeled. By using the manifold structure spanned by the data set of both labeled and unlabeled samples and the constraints provided by the labels of the labeled samples, we learn the variable class labels for all the samples. Furthermore, to improve the discriminative ability of the learned sparse codes, we assume that the class labels could be predicted from the sparse codes directly using a linear classifier. By solving the codebook, sparse codes, class labels and classifier parameters simultaneously in a unified objective function, we develop a semi-supervised sparse coding algorithm. Experiments on two real-world pattern recognition problems demonstrate the advantage of the proposed methods over supervised sparse coding methods on partially labeled data sets.

Interestingness-Driven Diffusion Process Summarization in Dynamic Networks

DEFF Research Database (Denmark)

Qu, Qiang; Liu, Siyuan; Jensen, Christian S.

2014-01-01

The widespread use of social networks enables the rapid diffusion of information, e.g., news, among users in very large communities. It is a substantial challenge to be able to observe and understand such diffusion processes, which may be modeled as networks that are both large and dynamic. A key...... tool in this regard is data summarization. However, few existing studies aim to summarize graphs/networks for dynamics. Dynamic networks raise new challenges not found in static settings, including time sensitivity and the needs for online interestingness evaluation and summary traceability, which...... render existing techniques inapplicable. We study the topic of dynamic network summarization: how to summarize dynamic networks with millions of nodes by only capturing the few most interesting nodes or edges over time, and we address the problem by finding interestingness-driven diffusion processes...

Self-consistent determination of the spike-train power spectrum in a neural network with sparse connectivity

Directory of Open Access Journals (Sweden)

Benjamin eDummer

2014-09-01

Full Text Available A major source of random variability in cortical networks is the quasi-random arrival of presynaptic action potentials from many other cells. In network studies as well as in the study of the response properties of single cells embedded in a network, synaptic background input is often approximated by Poissonian spike trains. However, the output statistics of the cells is in most cases far from being Poisson. This is inconsistent with the assumption of similar spike-train statistics for pre- and postsynaptic cells in a recurrent network. Here we tackle this problem for the popular class of integrate-and-fire neurons and study a self-consistent statistics of input and output spectra of neural spike trains. Instead of actually using a large network, we use an iterative scheme, in which we simulate a single neuron over several generations. In each of these generations, the neuron is stimulated with surrogate stochastic input that has a similar statistics as the output of the previous generation. For the surrogate input, we employ two distinct approximations: (i a superposition of renewal spike trains with the same interspike interval density as observed in the previous generation and (ii a Gaussian current with a power spectrum proportional to that observed in the previous generation. For input parameters that correspond to balanced input in the network, both the renewal and the Gaussian iteration procedure converge quickly and yield comparable results for the self-consistent spike-train power spectrum. We compare our results to large-scale simulations of a random sparsely connected network of leaky integrate-and-fire neurons (Brunel, J. Comp. Neurosci. 2000 and show that in the asynchronous regime close to a state of balanced synaptic input from the network, our iterative schemes provide excellent approximations to the autocorrelation of spike trains in the recurrent network.

Sequentially switching cell assemblies in random inhibitory networks of spiking neurons in the striatum.

Science.gov (United States)

Ponzi, Adam; Wickens, Jeff

2010-04-28

The striatum is composed of GABAergic medium spiny neurons with inhibitory collaterals forming a sparse random asymmetric network and receiving an excitatory glutamatergic cortical projection. Because the inhibitory collaterals are sparse and weak, their role in striatal network dynamics is puzzling. However, here we show by simulation of a striatal inhibitory network model composed of spiking neurons that cells form assemblies that fire in sequential coherent episodes and display complex identity-temporal spiking patterns even when cortical excitation is simply constant or fluctuating noisily. Strongly correlated large-scale firing rate fluctuations on slow behaviorally relevant timescales of hundreds of milliseconds are shown by members of the same assembly whereas members of different assemblies show strong negative correlation, and we show how randomly connected spiking networks can generate this activity. Cells display highly irregular spiking with high coefficients of variation, broadly distributed low firing rates, and interspike interval distributions that are consistent with exponentially tailed power laws. Although firing rates vary coherently on slow timescales, precise spiking synchronization is absent in general. Our model only requires the minimal but striatally realistic assumptions of sparse to intermediate random connectivity, weak inhibitory synapses, and sufficient cortical excitation so that some cells are depolarized above the firing threshold during up states. Our results are in good qualitative agreement with experimental studies, consistent with recently determined striatal anatomy and physiology, and support a new view of endogenously generated metastable state switching dynamics of the striatal network underlying its information processing operations.

Framing U-Net via Deep Convolutional Framelets: Application to Sparse-View CT.

Science.gov (United States)

Han, Yoseob; Ye, Jong Chul

2018-06-01

X-ray computed tomography (CT) using sparse projection views is a recent approach to reduce the radiation dose. However, due to the insufficient projection views, an analytic reconstruction approach using the filtered back projection (FBP) produces severe streaking artifacts. Recently, deep learning approaches using large receptive field neural networks such as U-Net have demonstrated impressive performance for sparse-view CT reconstruction. However, theoretical justification is still lacking. Inspired by the recent theory of deep convolutional framelets, the main goal of this paper is, therefore, to reveal the limitation of U-Net and propose new multi-resolution deep learning schemes. In particular, we show that the alternative U-Net variants such as dual frame and tight frame U-Nets satisfy the so-called frame condition which makes them better for effective recovery of high frequency edges in sparse-view CT. Using extensive experiments with real patient data set, we demonstrate that the new network architectures provide better reconstruction performance.

Dynamic training algorithm for dynamic neural networks

International Nuclear Information System (INIS)

Tan, Y.; Van Cauwenberghe, A.; Liu, Z.

1996-01-01

The widely used backpropagation algorithm for training neural networks based on the gradient descent has a significant drawback of slow convergence. A Gauss-Newton method based recursive least squares (RLS) type algorithm with dynamic error backpropagation is presented to speed-up the learning procedure of neural networks with local recurrent terms. Finally, simulation examples concerning the applications of the RLS type algorithm to identification of nonlinear processes using a local recurrent neural network are also included in this paper

Complex networks under dynamic repair model

Science.gov (United States)

Chaoqi, Fu; Ying, Wang; Kun, Zhao; Yangjun, Gao

2018-01-01

Invulnerability is not the only factor of importance when considering complex networks' security. It is also critical to have an effective and reasonable repair strategy. Existing research on network repair is confined to the static model. The dynamic model makes better use of the redundant capacity of repaired nodes and repairs the damaged network more efficiently than the static model; however, the dynamic repair model is complex and polytropic. In this paper, we construct a dynamic repair model and systematically describe the energy-transfer relationships between nodes in the repair process of the failure network. Nodes are divided into three types, corresponding to three structures. We find that the strong coupling structure is responsible for secondary failure of the repaired nodes and propose an algorithm that can select the most suitable targets (nodes or links) to repair the failure network with minimal cost. Two types of repair strategies are identified, with different effects under the two energy-transfer rules. The research results enable a more flexible approach to network repair.

Inference algorithms and learning theory for Bayesian sparse factor analysis

International Nuclear Information System (INIS)

Rattray, Magnus; Sharp, Kevin; Stegle, Oliver; Winn, John

2009-01-01

Bayesian sparse factor analysis has many applications; for example, it has been applied to the problem of inferring a sparse regulatory network from gene expression data. We describe a number of inference algorithms for Bayesian sparse factor analysis using a slab and spike mixture prior. These include well-established Markov chain Monte Carlo (MCMC) and variational Bayes (VB) algorithms as well as a novel hybrid of VB and Expectation Propagation (EP). For the case of a single latent factor we derive a theory for learning performance using the replica method. We compare the MCMC and VB/EP algorithm results with simulated data to the theoretical prediction. The results for MCMC agree closely with the theory as expected. Results for VB/EP are slightly sub-optimal but show that the new algorithm is effective for sparse inference. In large-scale problems MCMC is infeasible due to computational limitations and the VB/EP algorithm then provides a very useful computationally efficient alternative.

Inference algorithms and learning theory for Bayesian sparse factor analysis

Energy Technology Data Exchange (ETDEWEB)

Rattray, Magnus; Sharp, Kevin [School of Computer Science, University of Manchester, Manchester M13 9PL (United Kingdom); Stegle, Oliver [Max-Planck-Institute for Biological Cybernetics, Tuebingen (Germany); Winn, John, E-mail: magnus.rattray@manchester.ac.u [Microsoft Research Cambridge, Roger Needham Building, Cambridge, CB3 0FB (United Kingdom)

2009-12-01

Bayesian sparse factor analysis has many applications; for example, it has been applied to the problem of inferring a sparse regulatory network from gene expression data. We describe a number of inference algorithms for Bayesian sparse factor analysis using a slab and spike mixture prior. These include well-established Markov chain Monte Carlo (MCMC) and variational Bayes (VB) algorithms as well as a novel hybrid of VB and Expectation Propagation (EP). For the case of a single latent factor we derive a theory for learning performance using the replica method. We compare the MCMC and VB/EP algorithm results with simulated data to the theoretical prediction. The results for MCMC agree closely with the theory as expected. Results for VB/EP are slightly sub-optimal but show that the new algorithm is effective for sparse inference. In large-scale problems MCMC is infeasible due to computational limitations and the VB/EP algorithm then provides a very useful computationally efficient alternative.

Organization of excitable dynamics in hierarchical biological networks.

Directory of Open Access Journals (Sweden)

Mark Müller-Linow

Full Text Available 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.

In Defense of Sparse Tracking: Circulant Sparse Tracker

KAUST Repository

Zhang, Tianzhu; Bibi, Adel Aamer; Ghanem, Bernard

2016-01-01

Sparse representation has been introduced to visual tracking by finding the best target candidate with minimal reconstruction error within the particle filter framework. However, most sparse representation based trackers have high computational cost, less than promising tracking performance, and limited feature representation. To deal with the above issues, we propose a novel circulant sparse tracker (CST), which exploits circulant target templates. Because of the circulant structure property, CST has the following advantages: (1) It can refine and reduce particles using circular shifts of target templates. (2) The optimization can be efficiently solved entirely in the Fourier domain. (3) High dimensional features can be embedded into CST to significantly improve tracking performance without sacrificing much computation time. Both qualitative and quantitative evaluations on challenging benchmark sequences demonstrate that CST performs better than all other sparse trackers and favorably against state-of-the-art methods.

In Defense of Sparse Tracking: Circulant Sparse Tracker

KAUST Repository

Zhang, Tianzhu

2016-12-13

Sparse representation has been introduced to visual tracking by finding the best target candidate with minimal reconstruction error within the particle filter framework. However, most sparse representation based trackers have high computational cost, less than promising tracking performance, and limited feature representation. To deal with the above issues, we propose a novel circulant sparse tracker (CST), which exploits circulant target templates. Because of the circulant structure property, CST has the following advantages: (1) It can refine and reduce particles using circular shifts of target templates. (2) The optimization can be efficiently solved entirely in the Fourier domain. (3) High dimensional features can be embedded into CST to significantly improve tracking performance without sacrificing much computation time. Both qualitative and quantitative evaluations on challenging benchmark sequences demonstrate that CST performs better than all other sparse trackers and favorably against state-of-the-art methods.

Sparse PDF Volumes for Consistent Multi-Resolution Volume Rendering

KAUST Repository

Sicat, Ronell Barrera

2014-12-31

This paper presents a new multi-resolution volume representation called sparse pdf volumes, which enables consistent multi-resolution volume rendering based on probability density functions (pdfs) of voxel neighborhoods. These pdfs are defined in the 4D domain jointly comprising the 3D volume and its 1D intensity range. Crucially, the computation of sparse pdf volumes exploits data coherence in 4D, resulting in a sparse representation with surprisingly low storage requirements. At run time, we dynamically apply transfer functions to the pdfs using simple and fast convolutions. Whereas standard low-pass filtering and down-sampling incur visible differences between resolution levels, the use of pdfs facilitates consistent results independent of the resolution level used. We describe the efficient out-of-core computation of large-scale sparse pdf volumes, using a novel iterative simplification procedure of a mixture of 4D Gaussians. Finally, our data structure is optimized to facilitate interactive multi-resolution volume rendering on GPUs.

Network dynamics and its relationships to topology and coupling structure in excitable complex networks

International Nuclear Information System (INIS)

Zhang Li-Sheng; Mi Yuan-Yuan; Gu Wei-Feng; Hu Gang

2014-01-01

All dynamic complex networks have two important aspects, pattern dynamics and network topology. Discovering different types of pattern dynamics and exploring how these dynamics depend on network topologies are tasks of both great theoretical importance and broad practical significance. In this paper we study the oscillatory behaviors of excitable complex networks (ECNs) and find some interesting dynamic behaviors of ECNs in oscillatory probability, the multiplicity of oscillatory attractors, period distribution, and different types of oscillatory patterns (e.g., periodic, quasiperiodic, and chaotic). In these aspects, we further explore strikingly sharp differences among network dynamics induced by different topologies (random or scale-free topologies) and different interaction structures (symmetric or asymmetric couplings). The mechanisms behind these differences are explained physically. (interdisciplinary physics and related areas of science and technology)

Robust adaptive synchronization of general dynamical networks ...

Indian Academy of Sciences (India)

Robust adaptive synchronization; dynamical network; multiple delays; multiple uncertainties. ... Networks such as neural networks, communication transmission networks, social rela- tionship networks etc. ..... a very good effect. Pramana – J.

Physical Proximity and Spreading in Dynamic Social Networks

OpenAIRE

Stopczynski, Arkadiusz; Pentland, Alex Sandy; Lehmann, Sune

2015-01-01

Most infectious diseases spread on a dynamic network of human interactions. Recent studies of social dynamics have provided evidence that spreading patterns may depend strongly on detailed micro-dynamics of the social system. We have recorded every single interaction within a large population, mapping out---for the first time at scale---the complete proximity network for a densely-connected system. Here we show the striking impact of interaction-distance on the network structure and dynamics ...

Decoding network dynamics in cancer

DEFF Research Database (Denmark)

Linding, Rune

2014-01-01

Biological systems are composed of highly dynamic and interconnected molecular networks that drive biological decision processes. The goal of network biology is to describe, quantify and predict the information flow and functional behaviour of living systems in a formal language and with an accur......Biological systems are composed of highly dynamic and interconnected molecular networks that drive biological decision processes. The goal of network biology is to describe, quantify and predict the information flow and functional behaviour of living systems in a formal language...... and with an accuracy that parallels our characterisation of other physical systems such as Jumbo-jets. Decades of targeted molecular and biological studies have led to numerous pathway models of developmental and disease related processes. However, so far no global models have been derived from pathways, capable...

Decoding the encoding of functional brain networks: An fMRI classification comparison of non-negative matrix factorization (NMF), independent component analysis (ICA), and sparse coding algorithms.

Science.gov (United States)

Xie, Jianwen; Douglas, Pamela K; Wu, Ying Nian; Brody, Arthur L; Anderson, Ariana E

2017-04-15

Brain networks in fMRI are typically identified using spatial independent component analysis (ICA), yet other mathematical constraints provide alternate biologically-plausible frameworks for generating brain networks. Non-negative matrix factorization (NMF) would suppress negative BOLD signal by enforcing positivity. Spatial sparse coding algorithms (L1 Regularized Learning and K-SVD) would impose local specialization and a discouragement of multitasking, where the total observed activity in a single voxel originates from a restricted number of possible brain networks. The assumptions of independence, positivity, and sparsity to encode task-related brain networks are compared; the resulting brain networks within scan for different constraints are used as basis functions to encode observed functional activity. These encodings are then decoded using machine learning, by using the time series weights to predict within scan whether a subject is viewing a video, listening to an audio cue, or at rest, in 304 fMRI scans from 51 subjects. The sparse coding algorithm of L1 Regularized Learning outperformed 4 variations of ICA (pcoding algorithms. Holding constant the effect of the extraction algorithm, encodings using sparser spatial networks (containing more zero-valued voxels) had higher classification accuracy (pcoding algorithms suggests that algorithms which enforce sparsity, discourage multitasking, and promote local specialization may capture better the underlying source processes than those which allow inexhaustible local processes such as ICA. Negative BOLD signal may capture task-related activations. Copyright © 2017 Elsevier B.V. All rights reserved.

Convergent dynamics for multistable delayed neural networks

International Nuclear Information System (INIS)

Shih, Chih-Wen; Tseng, Jui-Pin

2008-01-01

This investigation aims at developing a methodology to establish convergence of dynamics for delayed neural network systems with multiple stable equilibria. The present approach is general and can be applied to several network models. We take the Hopfield-type neural networks with both instantaneous and delayed feedbacks to illustrate the idea. We shall construct the complete dynamical scenario which comprises exactly 2 n stable equilibria and exactly (3 n − 2 n ) unstable equilibria for the n-neuron network. In addition, it is shown that every solution of the system converges to one of the equilibria as time tends to infinity. The approach is based on employing the geometrical structure of the network system. Positively invariant sets and componentwise dynamical properties are derived under the geometrical configuration. An iteration scheme is subsequently designed to confirm the convergence of dynamics for the system. Two examples with numerical simulations are arranged to illustrate the present theory

Dynamic Evolution Model Based on Social Network Services

Science.gov (United States)

Xiong, Xi; Gou, Zhi-Jian; Zhang, Shi-Bin; Zhao, Wen

2013-11-01

Based on the analysis of evolutionary characteristics of public opinion in social networking services (SNS), in the paper we propose a dynamic evolution model, in which opinions are coupled with topology. This model shows the clustering phenomenon of opinions in dynamic network evolution. The simulation results show that the model can fit the data from a social network site. The dynamic evolution of networks accelerates the opinion, separation and aggregation. The scale and the number of clusters are influenced by confidence limit and rewiring probability. Dynamic changes of the topology reduce the number of isolated nodes, while the increased confidence limit allows nodes to communicate more sufficiently. The two effects make the distribution of opinion more neutral. The dynamic evolution of networks generates central clusters with high connectivity and high betweenness, which make it difficult to control public opinions in SNS.

Traffic Dynamics on Complex Networks: A Survey

Directory of Open Access Journals (Sweden)

Shengyong Chen

2012-01-01

Full Text Available Traffic dynamics on complex networks are intriguing in recent years due to their practical implications in real communication networks. In this survey, we give a brief review of studies on traffic routing dynamics on complex networks. Strategies for improving transport efficiency, including designing efficient routing strategies and making appropriate adjustments to the underlying network structure, are introduced in this survey. Finally, a few open problems are discussed in this survey.

Using Network Dynamical Influence to Drive Consensus

Science.gov (United States)

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.

LOGISTIC NETWORK REGRESSION FOR SCALABLE ANALYSIS OF NETWORKS WITH JOINT EDGE/VERTEX DYNAMICS.

Science.gov (United States)

Almquist, Zack W; Butts, Carter T

2014-08-01

Change in group size and composition has long been an important area of research in the social sciences. Similarly, interest in interaction dynamics has a long history in sociology and social psychology. However, the effects of endogenous group change on interaction dynamics are a surprisingly understudied area. One way to explore these relationships is through social network models. Network dynamics may be viewed as a process of change in the edge structure of a network, in the vertex set on which edges are defined, or in both simultaneously. Although early studies of such processes were primarily descriptive, recent work on this topic has increasingly turned to formal statistical models. Although showing great promise, many of these modern dynamic models are computationally intensive and scale very poorly in the size of the network under study and/or the number of time points considered. Likewise, currently used models focus on edge dynamics, with little support for endogenously changing vertex sets. Here, the authors show how an existing approach based on logistic network regression can be extended to serve as a highly scalable framework for modeling large networks with dynamic vertex sets. The authors place this approach within a general dynamic exponential family (exponential-family random graph modeling) context, clarifying the assumptions underlying the framework (and providing a clear path for extensions), and they show how model assessment methods for cross-sectional networks can be extended to the dynamic case. Finally, the authors illustrate this approach on a classic data set involving interactions among windsurfers on a California beach.

Examining the Suitability of a Sparse In Situ Soil Moisture Monitoring Network for Assimilation into a Spatially Distributed Hydrologic Model

Science.gov (United States)

De Vleeschouwer, N.; Verhoest, N.; Pauwels, V. R. N.

2015-12-01

The continuous monitoring of soil moisture in a permanent network can yield an interesting data product for use in hydrological data assimilation. Major advantages of in situ observations compared to remote sensing products are the potential vertical extent of the measurements, the finer temporal resolution of the observation time series, the smaller impact of land cover variability on the observation bias, etc. However, two major disadvantages are the typical small integration volume of in situ measurements and the often large spacing between monitoring locations. This causes only a small part of the modelling domain to be directly observed. Furthermore, the spatial configuration of the monitoring network is typically temporally non-dynamic. Therefore two questions can be raised. Do spatially sparse in situ soil moisture observations contain a sufficient data representativeness to successfully assimilate them into the largely unobserved spatial extent of a distributed hydrological model? And if so, how is this assimilation best performed? Consequently two important factors that can influence the success of assimilating in situ monitored soil moisture are the spatial configuration of the monitoring network and the applied assimilation algorithm. In this research the influence of those factors is examined by means of synthetic data-assimilation experiments. The study area is the ± 100 km² catchment of the Bellebeek in Flanders, Belgium. The influence of the spatial configuration is examined by varying the amount of locations and their position in the landscape. The latter is performed using several techniques including temporal stability analysis and clustering. Furthermore the observation depth is considered by comparing assimilation of surface layer (5 cm) and deeper layer (50 cm) observations. The impact of the assimilation algorithm is assessed by comparing the performance obtained with two well-known algorithms: Newtonian nudging and the Ensemble Kalman

Accelerated dynamic cardiac MRI exploiting sparse-Kalman-smoother self-calibration and reconstruction (k  −  t SPARKS)

International Nuclear Information System (INIS)

Park, Suhyung; Park, Jaeseok

2015-01-01

Accelerated dynamic MRI, which exploits spatiotemporal redundancies in k  −  t space and coil dimension, has been widely used to reduce the number of signal encoding and thus increase imaging efficiency with minimal loss of image quality. Nonetheless, particularly in cardiac MRI it still suffers from artifacts and amplified noise in the presence of time-drifting coil sensitivity due to relative motion between coil and subject (e.g. free breathing). Furthermore, a substantial number of additional calibrating signals is to be acquired to warrant accurate calibration of coil sensitivity. In this work, we propose a novel, accelerated dynamic cardiac MRI with sparse-Kalman-smoother self-calibration and reconstruction (k  −  t SPARKS), which is robust to time-varying coil sensitivity even with a small number of calibrating signals. The proposed k  −  t SPARKS incorporates Kalman-smoother self-calibration in k  −  t space and sparse signal recovery in x  −   f space into a single optimization problem, leading to iterative, joint estimation of time-varying convolution kernels and missing signals in k  −  t space. In the Kalman-smoother calibration, motion-induced uncertainties over the entire time frames were included in modeling state transition while a coil-dependent noise statistic in describing measurement process. The sparse signal recovery iteratively alternates with the self-calibration to tackle the ill-conditioning problem potentially resulting from insufficient calibrating signals. Simulations and experiments were performed using both the proposed and conventional methods for comparison, revealing that the proposed k  −  t SPARKS yields higher signal-to-error ratio and superior temporal fidelity in both breath-hold and free-breathing cardiac applications over all reduction factors. (paper)

Learning State Space Dynamics in Recurrent Networks

Science.gov (United States)

Simard, Patrice Yvon

Fully recurrent (asymmetrical) networks can be used to learn temporal trajectories. The network is unfolded in time, and backpropagation is used to train the weights. The presence of recurrent connections creates internal states in the system which vary as a function of time. The resulting dynamics can provide interesting additional computing power but learning is made more difficult by the existence of internal memories. This study first exhibits the properties of recurrent networks in terms of convergence when the internal states of the system are unknown. A new energy functional is provided to change the weights of the units in order to the control the stability of the fixed points of the network's dynamics. The power of the resultant algorithm is illustrated with the simulation of a content addressable memory. Next, the more general case of time trajectories on a recurrent network is studied. An application is proposed in which trajectories are generated to draw letters as a function of an input. In another application of recurrent systems, a neural network certain temporal properties observed in human callosally sectioned brains. Finally the proposed algorithm for stabilizing dynamics around fixed points is extended to one for stabilizing dynamics around time trajectories. Its effects are illustrated on a network which generates Lisajous curves.

Controlling the dynamics of multi-state neural networks

International Nuclear Information System (INIS)

Jin, Tao; Zhao, Hong

2008-01-01

In this paper, we first analyze the distribution of local fields (DLF) which is induced by the memory patterns in the Q-Ising model. It is found that the structure of the DLF is closely correlated with the network dynamics and the system performance. However, the design rule adopted in the Q-Ising model, like the other rules adopted for multi-state neural networks with associative memories, cannot be applied to directly control the DLF for a given set of memory patterns, and thus cannot be applied to further study the relationships between the structure of the DLF and the dynamics of the network. We then extend a design rule, which was presented recently for designing binary-state neural networks, to make it suitable for designing general multi-state neural networks. This rule is able to control the structure of the DLF as expected. We show that controlling the DLF not only can affect the dynamic behaviors of the multi-state neural networks for a given set of memory patterns, but also can improve the storage capacity. With the change of the DLF, the network shows very rich dynamic behaviors, such as the 'chaos phase', the 'memory phase', and the 'mixture phase'. These dynamic behaviors are also observed in the binary-state neural networks; therefore, our results imply that they may be the universal behaviors of feedback neural networks

A Middleware Solution for Wireless IoT Applications in Sparse Smart Cities

Science.gov (United States)

Lanzone, Stefano; Riberto, Giulio; Stefanelli, Cesare; Tortonesi, Mauro

2017-01-01

The spread of off-the-shelf mobile devices equipped with multiple wireless interfaces together with sophisticated sensors is paving the way to novel wireless Internet of Things (IoT) environments, characterized by multi-hop infrastructure-less wireless networks where devices carried by users act as sensors/actuators as well as network nodes. In particular, the paper presents Real Ad-hoc Multi-hop Peer-to peer-Wireless IoT Application (RAMP-WIA), a novel solution that facilitates the development, deployment, and management of applications in sparse Smart City environments, characterized by users willing to collaborate by allowing new applications to be deployed on their smartphones to remotely monitor and control fixed/mobile devices. RAMP-WIA allows users to dynamically configure single-hop wireless links, to manage opportunistically multi-hop packet dispatching considering that the network topology (together with the availability of sensors and actuators) may abruptly change, to actuate reliably sensor nodes specifically considering that only part of them could be actually reachable in a timely manner, and to upgrade dynamically the nodes through over-the-air distribution of new software components. The paper also reports the performance of RAMP-WIA on simple but realistic cases of small-scale deployment scenarios with off-the-shelf Android smartphones and Raspberry Pi devices; these results show not only the feasibility and soundness of the proposed approach, but also the efficiency of the middleware implemented when deployed on real testbeds. PMID:29099745

A Middleware Solution for Wireless IoT Applications in Sparse Smart Cities.

Science.gov (United States)

Bellavista, Paolo; Giannelli, Carlo; Lanzone, Stefano; Riberto, Giulio; Stefanelli, Cesare; Tortonesi, Mauro

2017-11-03

The spread of off-the-shelf mobile devices equipped with multiple wireless interfaces together with sophisticated sensors is paving the way to novel wireless Internet of Things (IoT) environments, characterized by multi-hop infrastructure-less wireless networks where devices carried by users act as sensors/actuators as well as network nodes. In particular, the paper presents Real Ad-hoc Multi-hop Peer-to peer-Wireless IoT Application (RAMP-WIA), a novel solution that facilitates the development, deployment, and management of applications in sparse Smart City environments, characterized by users willing to collaborate by allowing new applications to be deployed on their smartphones to remotely monitor and control fixed/mobile devices. RAMP-WIA allows users to dynamically configure single-hop wireless links, to manage opportunistically multi-hop packet dispatching considering that the network topology (together with the availability of sensors and actuators) may abruptly change, to actuate reliably sensor nodes specifically considering that only part of them could be actually reachable in a timely manner, and to upgrade dynamically the nodes through over-the-air distribution of new software components. The paper also reports the performance of RAMP-WIA on simple but realistic cases of small-scale deployment scenarios with off-the-shelf Android smartphones and Raspberry Pi devices; these results show not only the feasibility and soundness of the proposed approach, but also the efficiency of the middleware implemented when deployed on real testbeds.

A Middleware Solution for Wireless IoT Applications in Sparse Smart Cities

Directory of Open Access Journals (Sweden)

Paolo Bellavista

2017-11-01

Full Text Available The spread of off-the-shelf mobile devices equipped with multiple wireless interfaces together with sophisticated sensors is paving the way to novel wireless Internet of Things (IoT environments, characterized by multi-hop infrastructure-less wireless networks where devices carried by users act as sensors/actuators as well as network nodes. In particular, the paper presents Real Ad-hoc Multi-hop Peer-to peer-Wireless IoT Application (RAMP-WIA, a novel solution that facilitates the development, deployment, and management of applications in sparse Smart City environments, characterized by users willing to collaborate by allowing new applications to be deployed on their smartphones to remotely monitor and control fixed/mobile devices. RAMP-WIA allows users to dynamically configure single-hop wireless links, to manage opportunistically multi-hop packet dispatching considering that the network topology (together with the availability of sensors and actuators may abruptly change, to actuate reliably sensor nodes specifically considering that only part of them could be actually reachable in a timely manner, and to upgrade dynamically the nodes through over-the-air distribution of new software components. The paper also reports the performance of RAMP-WIA on simple but realistic cases of small-scale deployment scenarios with off-the-shelf Android smartphones and Raspberry Pi devices; these results show not only the feasibility and soundness of the proposed approach, but also the efficiency of the middleware implemented when deployed on real testbeds.

Dynamic Intelligent Feedback Scheduling in Networked Control Systems

Directory of Open Access Journals (Sweden)

Hui-ying Chen

2013-01-01

Full Text Available For the networked control system with limited bandwidth and flexible workload, a dynamic intelligent feedback scheduling strategy is proposed. Firstly, a monitor is used to acquire the current available network bandwidth. Then, the new available bandwidth in the next interval is predicted by using LS_SVM approach. At the same time, the dynamic performance indices of all control loops are obtained with a two-dimensional fuzzy logic modulator. Finally, the predicted network bandwidth is dynamically allocated by the bandwidth manager and the priority allocator in terms of the loops' dynamic performance indices. Simulation results show that the sampling periods and priorities of control loops are adjusted timely according to the network workload condition and the dynamic performance of control loops, which make the system running in the optimal state all the time.

Axon initial segment cytoskeleton comprises a multiprotein submembranous coat containing sparse actin filaments

Science.gov (United States)

Jones, Steven L.; Korobova, Farida

2014-01-01

The axon initial segment (AIS) of differentiated neurons regulates action potential initiation and axon–dendritic polarity. The latter function depends on actin dynamics, but actin structure and functions at the AIS remain unclear. Using platinum replica electron microscopy (PREM), we have characterized the architecture of the AIS cytoskeleton in mature and developing hippocampal neurons. The AIS cytoskeleton assembly begins with bundling of microtubules and culminates in formation of a dense, fibrillar–globular coat over microtubule bundles. Immunogold PREM revealed that the coat contains a network of known AIS proteins, including ankyrin G, spectrin βIV, neurofascin, neuronal cell adhesion molecule, voltage-gated sodium channels, and actin filaments. Contrary to existing models, we find neither polarized actin arrays, nor dense actin meshworks in the AIS. Instead, the AIS contains two populations of sparse actin filaments: short, stable filaments and slightly longer dynamic filaments. We propose that stable actin filaments play a structural role for formation of the AIS diffusion barrier, whereas dynamic actin may promote AIS coat remodeling. PMID:24711503

Dynamic Trust Management for Mobile Networks and Its Applications

Science.gov (United States)

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…

Adaptive-network models of collective dynamics

Science.gov (United States)

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

Discrete dynamic modeling of cellular signaling networks.

Science.gov (United States)

Albert, Réka; Wang, Rui-Sheng

2009-01-01

Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.

Solving Dynamic Battlespace Movement Problems Using Dynamic Distributed Computer Networks

National Research Council Canada - National Science Library

Bradford, Robert

2000-01-01

.... The thesis designs a system using this architecture that invokes operations research network optimization algorithms to solve problems involving movement of people and equipment over dynamic road networks...

Functional asynchronous networks: Factorization of dynamics and function

Directory of Open Access Journals (Sweden)

Bick Christian

2016-01-01

Full Text Available In this note we describe the theory of functional asynchronous networks and one of the main results, the Modularization of Dynamics Theorem, which for a large class of functional asynchronous networks gives a factorization of dynamics in terms of constituent subnetworks. For these networks we can give a complete description of the network function in terms of the function of the events comprising the network and thereby answer a question originally raised by Alon in the context of biological networks.

Centralized Networks to Generate Human Body Motions.

Science.gov (United States)

Vakulenko, Sergei; Radulescu, Ovidiu; Morozov, Ivan; Weber, Andres

2017-12-14

We consider continuous-time recurrent neural networks as dynamical models for the simulation of human body motions. These networks consist of a few centers and many satellites connected to them. The centers evolve in time as periodical oscillators with different frequencies. The center states define the satellite neurons' states by a radial basis function (RBF) network. To simulate different motions, we adjust the parameters of the RBF networks. Our network includes a switching module that allows for turning from one motion to another. Simulations show that this model allows us to simulate complicated motions consisting of many different dynamical primitives. We also use the model for learning human body motion from markers' trajectories. We find that center frequencies can be learned from a small number of markers and can be transferred to other markers, such that our technique seems to be capable of correcting for missing information resulting from sparse control marker settings.

Synchronization in complex networks with a modular structure.

Science.gov (United States)

Park, Kwangho; Lai, Ying-Cheng; Gupte, Saurabh; Kim, Jong-Won

2006-03-01

Networks with a community (or modular) structure arise in social and biological sciences. In such a network individuals tend to form local communities, each having dense internal connections. The linkage among the communities is, however, much more sparse. The dynamics on modular networks, for instance synchronization, may be of great social or biological interest. (Here by synchronization we mean some synchronous behavior among the nodes in the network, not, for example, partially synchronous behavior in the network or the synchronizability of the network with some external dynamics.) By using a recent theoretical framework, the master-stability approach originally introduced by Pecora and Carroll in the context of synchronization in coupled nonlinear oscillators, we address synchronization in complex modular networks. We use a prototype model and develop scaling relations for the network synchronizability with respect to variations of some key network structural parameters. Our results indicate that random, long-range links among distant modules is the key to synchronization. As an application we suggest a viable strategy to achieve synchronous behavior in social networks.

Competing dynamic phases of active polymer networks

Science.gov (United States)

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.

Omnidirectional sparse visual path following with occlusion-robust feature tracking

OpenAIRE

Goedemé, Toon; Tuytelaars, Tinne; Van Gool, Luc; Vanacker, Gerolf; Nuttin, Marnix

2005-01-01

Goedemé T., Tuytelaars T., Van Gool L., Vanacker G., Nuttin M., ''Omnidirectional sparse visual path following with occlusion-robust feature tracking'', Proceedings 6th workshop on omnidirectional vision, camera networks and non-classical cameras, 8 pp., October 21, 2005, Beijing, China.

Dynamic behaviors in directed networks

International Nuclear Information System (INIS)

Park, Sung Min; Kim, Beom Jun

2006-01-01

Motivated by the abundance of directed synaptic couplings in a real biological neuronal network, we investigate the synchronization behavior of the Hodgkin-Huxley model in a directed network. We start from the standard model of the Watts-Strogatz undirected network and then change undirected edges to directed arcs with a given probability, still preserving the connectivity of the network. A generalized clustering coefficient for directed networks is defined and used to investigate the interplay between the synchronization behavior and underlying structural properties of directed networks. We observe that the directedness of complex networks plays an important role in emerging dynamical behaviors, which is also confirmed by a numerical study of the sociological game theoretic voter model on directed networks

Inverse stochastic resonance in networks of spiking neurons.

Science.gov (United States)

Uzuntarla, Muhammet; Barreto, Ernest; Torres, Joaquin J

2017-07-01

Inverse Stochastic Resonance (ISR) is a phenomenon in which the average spiking rate of a neuron exhibits a minimum with respect to noise. ISR has been studied in individual neurons, but here, we investigate ISR in scale-free networks, where the average spiking rate is calculated over the neuronal population. We use Hodgkin-Huxley model neurons with channel noise (i.e., stochastic gating variable dynamics), and the network connectivity is implemented via electrical or chemical connections (i.e., gap junctions or excitatory/inhibitory synapses). We find that the emergence of ISR depends on the interplay between each neuron's intrinsic dynamical structure, channel noise, and network inputs, where the latter in turn depend on network structure parameters. We observe that with weak gap junction or excitatory synaptic coupling, network heterogeneity and sparseness tend to favor the emergence of ISR. With inhibitory coupling, ISR is quite robust. We also identify dynamical mechanisms that underlie various features of this ISR behavior. Our results suggest possible ways of experimentally observing ISR in actual neuronal systems.

Identify Dynamic Network Modules with Temporal and Spatial Constraints

Energy Technology Data Exchange (ETDEWEB)

Jin, R; McCallen, S; Liu, C; Almaas, E; Zhou, X J

2007-09-24

Despite the rapid accumulation of systems-level biological data, understanding the dynamic nature of cellular activity remains a difficult task. The reason is that most biological data are static, or only correspond to snapshots of cellular activity. In this study, we explicitly attempt to detangle the temporal complexity of biological networks by using compilations of time-series gene expression profiling data.We define a dynamic network module to be a set of proteins satisfying two conditions: (1) they form a connected component in the protein-protein interaction (PPI) network; and (2) their expression profiles form certain structures in the temporal domain. We develop the first efficient mining algorithm to discover dynamic modules in a temporal network, as well as frequently occurring dynamic modules across many temporal networks. Using yeast as a model system, we demonstrate that the majority of the identified dynamic modules are functionally homogeneous. Additionally, many of them provide insight into the sequential ordering of molecular events in cellular systems. We further demonstrate that identifying frequent dynamic network modules can significantly increase the signal to noise separation, despite the fact that most dynamic network modules are highly condition-specific. Finally, we note that the applicability of our algorithm is not limited to the study of PPI systems, instead it is generally applicable to the combination of any type of network and time-series data.

Network Physiology: How Organ Systems Dynamically Interact

Science.gov (United States)

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

Network Physiology: How Organ Systems Dynamically Interact.

Science.gov (United States)

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.

Dynamical Networks Characterization of Space Weather Events

Science.gov (United States)

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

Complex networks: Dynamics and security

Indian Academy of Sciences (India)

This paper presents a perspective in the study of complex networks by focusing on how dynamics may affect network security under attacks. ... Department of Mathematics and Statistics, Arizona State University, Tempe, Arizona 85287, USA; Institute of Mathematics and Computer Science, University of Sao Paulo, Brazil ...

Learning dynamic Bayesian networks with mixed variables

DEFF Research Database (Denmark)

Bøttcher, Susanne Gammelgaard

This paper considers dynamic Bayesian networks for discrete and continuous variables. We only treat the case, where the distribution of the variables is conditional Gaussian. We show how to learn the parameters and structure of a dynamic Bayesian network and also how the Markov order can be learned...

Chimera-like states in structured heterogeneous networks

Science.gov (United States)

Li, Bo; Saad, David

2017-04-01

Chimera-like states are manifested through the coexistence of synchronous and asynchronous dynamics and have been observed in various systems. To analyze the role of network topology in giving rise to chimera-like states, we study a heterogeneous network model comprising two groups of nodes, of high and low degrees of connectivity. The architecture facilitates the analysis of the system, which separates into a densely connected coherent group of nodes, perturbed by their sparsely connected drifting neighbors. It describes a synchronous behavior of the densely connected group and scaling properties of the induced perturbations.

Structural Sparse Tracking

KAUST Repository

Zhang, Tianzhu

2015-06-01

Sparse representation has been applied to visual tracking by finding the best target candidate with minimal reconstruction error by use of target templates. However, most sparse representation based trackers only consider holistic or local representations and do not make full use of the intrinsic structure among and inside target candidates, thereby making the representation less effective when similar objects appear or under occlusion. In this paper, we propose a novel Structural Sparse Tracking (SST) algorithm, which not only exploits the intrinsic relationship among target candidates and their local patches to learn their sparse representations jointly, but also preserves the spatial layout structure among the local patches inside each target candidate. We show that our SST algorithm accommodates most existing sparse trackers with the respective merits. Both qualitative and quantitative evaluations on challenging benchmark image sequences demonstrate that the proposed SST algorithm performs favorably against several state-of-the-art methods.

A Low Delay and Fast Converging Improved Proportionate Algorithm for Sparse System Identification

Directory of Open Access Journals (Sweden)

Benesty Jacob

2007-01-01

Full Text Available A sparse system identification algorithm for network echo cancellation is presented. This new approach exploits both the fast convergence of the improved proportionate normalized least mean square (IPNLMS algorithm and the efficient implementation of the multidelay adaptive filtering (MDF algorithm inheriting the beneficial properties of both. The proposed IPMDF algorithm is evaluated using impulse responses with various degrees of sparseness. Simulation results are also presented for both speech and white Gaussian noise input sequences. It has been shown that the IPMDF algorithm outperforms the MDF and IPNLMS algorithms for both sparse and dispersive echo path impulse responses. Computational complexity of the proposed algorithm is also discussed.

Dynamic defense and network randomization for computer systems

Science.gov (United States)

Chavez, Adrian R.; Stout, William M. S.; Hamlet, Jason R.; Lee, Erik James; Martin, Mitchell Tyler

2018-05-29

The various technologies presented herein relate to determining a network attack is taking place, and further to adjust one or more network parameters such that the network becomes dynamically configured. A plurality of machine learning algorithms are configured to recognize an active attack pattern. Notification of the attack can be generated, and knowledge gained from the detected attack pattern can be utilized to improve the knowledge of the algorithms to detect a subsequent attack vector(s). Further, network settings and application communications can be dynamically randomized, wherein artificial diversity converts control systems into moving targets that help mitigate the early reconnaissance stages of an attack. An attack(s) based upon a known static address(es) of a critical infrastructure network device(s) can be mitigated by the dynamic randomization. Network parameters that can be randomized include IP addresses, application port numbers, paths data packets navigate through the network, application randomization, etc.

Self-organization of complex networks as a dynamical system.

Science.gov (United States)

Aoki, Takaaki; Yawata, Koichiro; Aoyagi, Toshio

2015-01-01

To understand the dynamics of real-world networks, we investigate a mathematical model of the interplay between the dynamics of random walkers on a weighted network and the link weights driven by a resource carried by the walkers. Our numerical studies reveal that, under suitable conditions, the co-evolving dynamics lead to the emergence of stationary power-law distributions of the resource and link weights, while the resource quantity at each node ceaselessly changes with time. We analyze the network organization as a deterministic dynamical system and find that the system exhibits multistability, with numerous fixed points, limit cycles, and chaotic states. The chaotic behavior of the system leads to the continual changes in the microscopic network dynamics in the absence of any external random noises. We conclude that the intrinsic interplay between the states of the nodes and network reformation constitutes a major factor in the vicissitudes of real-world networks.

Single and Multiple Object Tracking Using a Multi-Feature Joint Sparse Representation.

Science.gov (United States)

Hu, Weiming; Li, Wei; Zhang, Xiaoqin; Maybank, Stephen

2015-04-01

In this paper, we propose a tracking algorithm based on a multi-feature joint sparse representation. The templates for the sparse representation can include pixel values, textures, and edges. In the multi-feature joint optimization, noise or occlusion is dealt with using a set of trivial templates. A sparse weight constraint is introduced to dynamically select the relevant templates from the full set of templates. A variance ratio measure is adopted to adaptively adjust the weights of different features. The multi-feature template set is updated adaptively. We further propose an algorithm for tracking multi-objects with occlusion handling based on the multi-feature joint sparse reconstruction. The observation model based on sparse reconstruction automatically focuses on the visible parts of an occluded object by using the information in the trivial templates. The multi-object tracking is simplified into a joint Bayesian inference. The experimental results show the superiority of our algorithm over several state-of-the-art tracking algorithms.

Replicating receptive fields of simple and complex cells in primary visual cortex in a neuronal network model with temporal and population sparseness and reliability.

Science.gov (United States)

Tanaka, Takuma; Aoyagi, Toshio; Kaneko, Takeshi

2012-10-01

We propose a new principle for replicating receptive field properties of neurons in the primary visual cortex. We derive a learning rule for a feedforward network, which maintains a low firing rate for the output neurons (resulting in temporal sparseness) and allows only a small subset of the neurons in the network to fire at any given time (resulting in population sparseness). Our learning rule also sets the firing rates of the output neurons at each time step to near-maximum or near-minimum levels, resulting in neuronal reliability. The learning rule is simple enough to be written in spatially and temporally local forms. After the learning stage is performed using input image patches of natural scenes, output neurons in the model network are found to exhibit simple-cell-like receptive field properties. When the output of these simple-cell-like neurons are input to another model layer using the same learning rule, the second-layer output neurons after learning become less sensitive to the phase of gratings than the simple-cell-like input neurons. In particular, some of the second-layer output neurons become completely phase invariant, owing to the convergence of the connections from first-layer neurons with similar orientation selectivity to second-layer neurons in the model network. We examine the parameter dependencies of the receptive field properties of the model neurons after learning and discuss their biological implications. We also show that the localized learning rule is consistent with experimental results concerning neuronal plasticity and can replicate the receptive fields of simple and complex cells.

Nonlinear Dynamics on Interconnected Networks

Science.gov (United States)

Arenas, Alex; De Domenico, Manlio

2016-06-01

Networks of dynamical interacting units can represent many complex systems, from the human brain to transportation systems and societies. The study of these complex networks, when accounting for different types of interactions has become a subject of interest in the last few years, especially because its representational power in the description of users' interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.) [1], or in representing different transportation modes in urban networks [2,3]. The general name coined for these networks is multilayer networks, where each layer accounts for a type of interaction (see Fig. 1).

Dynamic capabilities and network benefits

Directory of Open Access Journals (Sweden)

Helge Svare

2017-01-01

Full Text Available The number of publicly funded initiatives to establish or strengthen networks and clusters, in order to enhance innovation, has been increasing. Returns on such investments vary, and the aim of this study is to explore to what extent the variation in benefits for firms participating in networks or clusters can be explained by their dynamic capabilities (DC. Based on survey data from five Norwegian networks, the results suggest that firms with higher DC are more successful in harvesting the potential benefits of being member of a network.

Incremental Centrality Algorithms for Dynamic Network Analysis

Science.gov (United States)

2013-08-01

literature.   7.1.3 Small World Networks In 1998, Watts and Strogatz introduced a model that starts with a regular lattice (ring) of n nodes and...and S. Strogatz , "Collective Dynamics of ‘Small-World’ Networks," Nature, vol. 393, pp. 440-442, 1998. [13] T. Opsahl, "Structure and Evolution of...34On Random Graphs," Publicationes Mathematicae, vol. 6, 1959. [167] D.J. Watts and S.H. Strogatz , "Collective Dynamics of ‘Small-World’ Networks

Salience network dynamics underlying successful resistance of temptation

Science.gov (United States)

Nomi, Jason S; Calhoun, Vince D; Stelzel, Christine; Paschke, Lena M; Gaschler, Robert; Goschke, Thomas; Walter, Henrik; Uddin, Lucina Q

2017-01-01

Abstract Self-control and the ability to resist temptation are critical for successful completion of long-term goals. Contemporary models in cognitive neuroscience emphasize the primary role of prefrontal cognitive control networks in aligning behavior with such goals. Here, we use gaze pattern analysis and dynamic functional connectivity fMRI data to explore how individual differences in the ability to resist temptation are related to intrinsic brain dynamics of the cognitive control and salience networks. Behaviorally, individuals exhibit greater gaze distance from target location (e.g. higher distractibility) during presentation of tempting erotic images compared with neutral images. Individuals whose intrinsic dynamic functional connectivity patterns gravitate toward configurations in which salience detection systems are less strongly coupled with visual systems resist tempting distractors more effectively. The ability to resist tempting distractors was not significantly related to intrinsic dynamics of the cognitive control network. These results suggest that susceptibility to temptation is governed in part by individual differences in salience network dynamics and provide novel evidence for involvement of brain systems outside canonical cognitive control networks in contributing to individual differences in self-control. PMID:29048582

Agent Based Modeling on Organizational Dynamics of Terrorist Network

OpenAIRE

Bo Li; Duoyong Sun; Renqi Zhu; Ze Li

2015-01-01

Modeling organizational dynamics of terrorist network is a critical issue in computational analysis of terrorism research. The first step for effective counterterrorism and strategic intervention is to investigate how the terrorists operate with the relational network and what affects the performance. In this paper, we investigate the organizational dynamics by employing a computational experimentation methodology. The hierarchical cellular network model and the organizational dynamics model ...

Complex systems and networks dynamics, controls and applications

CERN Document Server

Yu, Xinghuo; Chen, Guanrong; Yu, Wenwu

2016-01-01

This elementary book provides some state-of-the-art research results on broad disciplinary sciences on complex networks. It presents an in-depth study with detailed description of dynamics, controls and applications of complex networks. The contents of this book can be summarized as follows. First, the dynamics of complex networks, for example, the cluster dynamic analysis by using kernel spectral methods, community detection algorithms in bipartite networks, epidemiological modeling with demographics and epidemic spreading on multi-layer networks, are studied. Second, the controls of complex networks are investigated including topics like distributed finite-time cooperative control of multi-agent systems by applying homogenous-degree and Lyapunov methods, composite finite-time containment control for disturbed second-order multi-agent systems, fractional-order observer design of multi-agent systems, chaos control and anticontrol of complex systems via Parrondos game and many more. Third, the applications of ...

Structural network heterogeneities and network dynamics: a possible dynamical mechanism for hippocampal memory reactivation.

Science.gov (United States)

Jablonski, Piotr; Poe, Gina; Zochowski, Michal

2007-03-01

The hippocampus has the capacity for reactivating recently acquired memories and it is hypothesized that one of the functions of sleep reactivation is the facilitation of consolidation of novel memory traces. The dynamic and network processes underlying such a reactivation remain, however, unknown. We show that such a reactivation characterized by local, self-sustained activity of a network region may be an inherent property of the recurrent excitatory-inhibitory network with a heterogeneous structure. The entry into the reactivation phase is mediated through a physiologically feasible regulation of global excitability and external input sources, while the reactivated component of the network is formed through induced network heterogeneities during learning. We show that structural changes needed for robust reactivation of a given network region are well within known physiological parameters.

Quantifying the dynamics of coupled networks of switches and oscillators.

Directory of Open Access Journals (Sweden)

Matthew R Francis

Full Text Available Complex network dynamics have been analyzed with models of systems of coupled switches or systems of coupled oscillators. However, many complex systems are composed of components with diverse dynamics whose interactions drive the system's evolution. We, therefore, introduce a new modeling framework that describes the dynamics of networks composed of both oscillators and switches. Both oscillator synchronization and switch stability are preserved in these heterogeneous, coupled networks. Furthermore, this model recapitulates the qualitative dynamics for the yeast cell cycle consistent with the hypothesized dynamics resulting from decomposition of the regulatory network into dynamic motifs. Introducing feedback into the cell-cycle network induces qualitative dynamics analogous to limitless replicative potential that is a hallmark of cancer. As a result, the proposed model of switch and oscillator coupling provides the ability to incorporate mechanisms that underlie the synchronized stimulus response ubiquitous in biochemical systems.

Synthesis of recurrent neural networks for dynamical system simulation.

Science.gov (United States)

Trischler, Adam P; D'Eleuterio, Gabriele M T

2016-08-01

We review several of the most widely used techniques for training recurrent neural networks to approximate dynamical systems, then describe a novel algorithm for this task. The algorithm is based on an earlier theoretical result that guarantees the quality of the network approximation. We show that a feedforward neural network can be trained on the vector-field representation of a given dynamical system using backpropagation, then recast it as a recurrent network that replicates the original system's dynamics. After detailing this algorithm and its relation to earlier approaches, we present numerical examples that demonstrate its capabilities. One of the distinguishing features of our approach is that both the original dynamical systems and the recurrent networks that simulate them operate in continuous time. Copyright © 2016 Elsevier Ltd. All rights reserved.

Sparse distributed representation of odors in a large-scale olfactory bulb circuit.

Directory of Open Access Journals (Sweden)

Yuguo Yu

Full Text Available In the olfactory bulb, lateral inhibition mediated by granule cells has been suggested to modulate the timing of mitral cell firing, thereby shaping the representation of input odorants. Current experimental techniques, however, do not enable a clear study of how the mitral-granule cell network sculpts odor inputs to represent odor information spatially and temporally. To address this critical step in the neural basis of odor recognition, we built a biophysical network model of mitral and granule cells, corresponding to 1/100th of the real system in the rat, and used direct experimental imaging data of glomeruli activated by various odors. The model allows the systematic investigation and generation of testable hypotheses of the functional mechanisms underlying odor representation in the olfactory bulb circuit. Specifically, we demonstrate that lateral inhibition emerges within the olfactory bulb network through recurrent dendrodendritic synapses when constrained by a range of balanced excitatory and inhibitory conductances. We find that the spatio-temporal dynamics of lateral inhibition plays a critical role in building the glomerular-related cell clusters observed in experiments, through the modulation of synaptic weights during odor training. Lateral inhibition also mediates the development of sparse and synchronized spiking patterns of mitral cells related to odor inputs within the network, with the frequency of these synchronized spiking patterns also modulated by the sniff cycle.

Major component analysis of dynamic networks of physiologic organ interactions

International Nuclear Information System (INIS)

Liu, Kang K L; Ma, Qianli D Y; Ivanov, Plamen Ch; Bartsch, Ronny P

2015-01-01

The human organism is a complex network of interconnected organ systems, where the behavior of one system affects the dynamics of other systems. Identifying and quantifying dynamical networks of diverse physiologic systems under varied conditions is a challenge due to the complexity in the output dynamics of the individual systems and the transient and nonlinear characteristics of their coupling. We introduce a novel computational method based on the concept of time delay stability and major component analysis to investigate how organ systems interact as a network to coordinate their functions. We analyze a large database of continuously recorded multi-channel physiologic signals from healthy young subjects during night-time sleep. We identify a network of dynamic interactions between key physiologic systems in the human organism. Further, we find that each physiologic state is characterized by a distinct network structure with different relative contribution from individual organ systems to the global network dynamics. Specifically, we observe a gradual decrease in the strength of coupling of heart and respiration to the rest of the network with transition from wake to deep sleep, and in contrast, an increased relative contribution to network dynamics from chin and leg muscle tone and eye movement, demonstrating a robust association between network topology and physiologic function. (paper)

Recovery time after localized perturbations in complex dynamical networks

International Nuclear Information System (INIS)

Mitra, Chiranjit; Kittel, Tim; Kurths, Jürgen; Donner, Reik V; Choudhary, Anshul

2017-01-01

Maintaining the synchronous motion of dynamical systems interacting on complex networks is often critical to their functionality. However, real-world networked dynamical systems operating synchronously are prone to random perturbations driving the system to arbitrary states within the corresponding basin of attraction, thereby leading to epochs of desynchronized dynamics with a priori unknown durations. Thus, it is highly relevant to have an estimate of the duration of such transient phases before the system returns to synchrony, following a random perturbation to the dynamical state of any particular node of the network. We address this issue here by proposing the framework of single-node recovery time (SNRT) which provides an estimate of the relative time scales underlying the transient dynamics of the nodes of a network during its restoration to synchrony. We utilize this in differentiating the particularly slow nodes of the network from the relatively fast nodes, thus identifying the critical nodes which when perturbed lead to significantly enlarged recovery time of the system before resuming synchronized operation. Further, we reveal explicit relationships between the SNRT values of a network, and its global relaxation time when starting all the nodes from random initial conditions. Earlier work on relaxation time generally focused on investigating its dependence on macroscopic topological properties of the respective network. However, we employ the proposed concept for deducing microscopic relationships between topological features of nodes and their respective SNRT values. The framework of SNRT is further extended to a measure of resilience of the different nodes of a networked dynamical system. We demonstrate the potential of SNRT in networks of Rössler oscillators on paradigmatic topologies and a model of the power grid of the United Kingdom with second-order Kuramoto-type nodal dynamics illustrating the conceivable practical applicability of the proposed

Recovery time after localized perturbations in complex dynamical networks

Science.gov (United States)

Mitra, Chiranjit; Kittel, Tim; Choudhary, Anshul; Kurths, Jürgen; Donner, Reik V.

2017-10-01

Maintaining the synchronous motion of dynamical systems interacting on complex networks is often critical to their functionality. However, real-world networked dynamical systems operating synchronously are prone to random perturbations driving the system to arbitrary states within the corresponding basin of attraction, thereby leading to epochs of desynchronized dynamics with a priori unknown durations. Thus, it is highly relevant to have an estimate of the duration of such transient phases before the system returns to synchrony, following a random perturbation to the dynamical state of any particular node of the network. We address this issue here by proposing the framework of single-node recovery time (SNRT) which provides an estimate of the relative time scales underlying the transient dynamics of the nodes of a network during its restoration to synchrony. We utilize this in differentiating the particularly slow nodes of the network from the relatively fast nodes, thus identifying the critical nodes which when perturbed lead to significantly enlarged recovery time of the system before resuming synchronized operation. Further, we reveal explicit relationships between the SNRT values of a network, and its global relaxation time when starting all the nodes from random initial conditions. Earlier work on relaxation time generally focused on investigating its dependence on macroscopic topological properties of the respective network. However, we employ the proposed concept for deducing microscopic relationships between topological features of nodes and their respective SNRT values. The framework of SNRT is further extended to a measure of resilience of the different nodes of a networked dynamical system. We demonstrate the potential of SNRT in networks of Rössler oscillators on paradigmatic topologies and a model of the power grid of the United Kingdom with second-order Kuramoto-type nodal dynamics illustrating the conceivable practical applicability of the proposed

Cognitive radio networks dynamic resource allocation schemes

CERN Document Server

Wang, Shaowei

2014-01-01

This SpringerBrief presents a survey of dynamic resource allocation schemes in Cognitive Radio (CR) Systems, focusing on the spectral-efficiency and energy-efficiency in wireless networks. It also introduces a variety of dynamic resource allocation schemes for CR networks and provides a concise introduction of the landscape of CR technology. The author covers in detail the dynamic resource allocation problem for the motivations and challenges in CR systems. The Spectral- and Energy-Efficient resource allocation schemes are comprehensively investigated, including new insights into the trade-off

Dynamics-based centrality for directed networks.

Science.gov (United States)

Masuda, Naoki; Kori, Hiroshi

2010-11-01

Determining the relative importance of nodes in directed networks is important in, for example, ranking websites, publications, and sports teams, and for understanding signal flows in systems biology. A prevailing centrality measure in this respect is the PageRank. In this work, we focus on another class of centrality derived from the Laplacian of the network. We extend the Laplacian-based centrality, which has mainly been applied to strongly connected networks, to the case of general directed networks such that we can quantitatively compare arbitrary nodes. Toward this end, we adopt the idea used in the PageRank to introduce global connectivity between all the pairs of nodes with a certain strength. Numerical simulations are carried out on some networks. We also offer interpretations of the Laplacian-based centrality for general directed networks in terms of various dynamical and structural properties of networks. Importantly, the Laplacian-based centrality defined as the stationary density of the continuous-time random walk with random jumps is shown to be equivalent to the absorption probability of the random walk with sinks at each node but without random jumps. Similarly, the proposed centrality represents the importance of nodes in dynamics on the original network supplied with sinks but not with random jumps.

Enhancement of dynamic myocardial perfusion PET images based on low-rank plus sparse decomposition.

Science.gov (United States)

Lu, Lijun; Ma, Xiaomian; Mohy-Ud-Din, Hassan; Ma, Jianhua; Feng, Qianjin; Rahmim, Arman; Chen, Wufan

2018-02-01

The absolute quantification of dynamic myocardial perfusion (MP) PET imaging is challenged by the limited spatial resolution of individual frame images due to division of the data into shorter frames. This study aims to develop a method for restoration and enhancement of dynamic PET images. We propose that the image restoration model should be based on multiple constraints rather than a single constraint, given the fact that the image characteristic is hardly described by a single constraint alone. At the same time, it may be possible, but not optimal, to regularize the image with multiple constraints simultaneously. Fortunately, MP PET images can be decomposed into a superposition of background vs. dynamic components via low-rank plus sparse (L + S) decomposition. Thus, we propose an L + S decomposition based MP PET image restoration model and express it as a convex optimization problem. An iterative soft thresholding algorithm was developed to solve the problem. Using realistic dynamic 82 Rb MP PET scan data, we optimized and compared its performance with other restoration methods. The proposed method resulted in substantial visual as well as quantitative accuracy improvements in terms of noise versus bias performance, as demonstrated in extensive 82 Rb MP PET simulations. In particular, the myocardium defect in the MP PET images had improved visual as well as contrast versus noise tradeoff. The proposed algorithm was also applied on an 8-min clinical cardiac 82 Rb MP PET study performed on the GE Discovery PET/CT, and demonstrated improved quantitative accuracy (CNR and SNR) compared to other algorithms. The proposed method is effective for restoration and enhancement of dynamic PET images. Copyright © 2017 Elsevier B.V. All rights reserved.

RADYBAN: A tool for reliability analysis of dynamic fault trees through conversion into dynamic Bayesian networks

International Nuclear Information System (INIS)

Montani, S.; Portinale, L.; Bobbio, A.; Codetta-Raiteri, D.

2008-01-01

In this paper, we present RADYBAN (Reliability Analysis with DYnamic BAyesian Networks), a software tool which allows to analyze a dynamic fault tree relying on its conversion into a dynamic Bayesian network. The tool implements a modular algorithm for automatically translating a dynamic fault tree into the corresponding dynamic Bayesian network and exploits classical algorithms for the inference on dynamic Bayesian networks, in order to compute reliability measures. After having described the basic features of the tool, we show how it operates on a real world example and we compare the unreliability results it generates with those returned by other methodologies, in order to verify the correctness and the consistency of the results obtained

Critical dynamics in associative memory networks

Directory of Open Access Journals (Sweden)

Maximilian eUhlig

2013-07-01

Full Text Available Critical behavior in neural networks is characterized by scale-free avalanche size distributions and can be explained by self-regulatory mechanisms. Theoretical and experimental evidence indicates that information storage capacity reaches its maximum in the critical regime. We study the effect of structural connectivity formed by Hebbian learning on the criticality of network dynamics. The network endowed with Hebbian learning only does not allow for simultaneous information storage and criticality. However, the critical regime is can be stabilized by short-term synaptic dynamics in the form of synaptic depression and facilitation or, alternatively, by homeostatic adaptation of the synaptic weights. We show that a heterogeneous distribution of maximal synaptic strengths does not preclude criticality if the Hebbian learning is alternated with periods of critical dynamics recovery. We discuss the relevance of these findings for the flexibility of memory in aging and with respect to the recent theory of synaptic plasticity.

A Re-entrant Phase Transition in the Survival of Secondary Infections on Networks

Science.gov (United States)

Moore, Sam; Mörters, Peter; Rogers, Tim

2018-06-01

We study the dynamics of secondary infections on networks, in which only the individuals currently carrying a certain primary infection are susceptible to the secondary infection. In the limit of large sparse networks, the model is mapped to a branching process spreading in a random time-sensitive environment, determined by the dynamics of the underlying primary infection. When both epidemics follow the Susceptible-Infective-Recovered model, we show that in order to survive, it is necessary for the secondary infection to evolve on a timescale that is closely matched to that of the primary infection on which it depends.

Phase diagram of spiking neural networks.

Science.gov (United States)

Seyed-Allaei, Hamed

2015-01-01

In computer simulations of spiking neural networks, often it is assumed that every two neurons of the network are connected by a probability of 2%, 20% of neurons are inhibitory and 80% are excitatory. These common values are based on experiments, observations, and trials and errors, but here, I take a different perspective, inspired by evolution, I systematically simulate many networks, each with a different set of parameters, and then I try to figure out what makes the common values desirable. I stimulate networks with pulses and then measure their: dynamic range, dominant frequency of population activities, total duration of activities, maximum rate of population and the occurrence time of maximum rate. The results are organized in phase diagram. This phase diagram gives an insight into the space of parameters - excitatory to inhibitory ratio, sparseness of connections and synaptic weights. This phase diagram can be used to decide the parameters of a model. The phase diagrams show that networks which are configured according to the common values, have a good dynamic range in response to an impulse and their dynamic range is robust in respect to synaptic weights, and for some synaptic weights they oscillates in α or β frequencies, independent of external stimuli.

Network dynamics in the healthy and epileptic developing brain

Directory of Open Access Journals (Sweden)

Richard Rosch

2018-03-01

Full Text Available Electroencephalography (EEG allows recording of cortical activity at high temporal resolution. EEG recordings can be summarized along different dimensions using network-level quantitative measures, such as channel-to-channel correlation, or band power distributions across channels. These reveal network patterns that unfold over a range of different timescales and can be tracked dynamically. Here we describe the dynamics of network state transitions in EEG recordings of spontaneous brain activity in normally developing infants and infants with severe early infantile epileptic encephalopathies (n = 8, age: 1–8 months. We describe differences in measures of EEG dynamics derived from band power, and correlation-based summaries of network-wide brain activity. We further show that EEGs from different patient groups and controls may be distinguishable on a small set of the novel quantitative measures introduced here, which describe dynamic network state switching. Quantitative measures related to the sharpness of switching from one correlation pattern to another show the largest differences between groups. These findings reveal that the early epileptic encephalopathies are associated with characteristic dynamic features at the network level. Quantitative network-based analyses like the one presented here may in the future inform the clinical use of quantitative EEG for diagnosis.

Design and implementation of dynamic hybrid Honeypot network

Science.gov (United States)

Qiao, Peili; Hu, Shan-Shan; Zhai, Ji-Qiang

2013-05-01

The method of constructing a dynamic and self-adaptive virtual network is suggested to puzzle adversaries, delay and divert attacks, exhaust attacker resources and collect attacking information. The concepts of Honeypot and Honeyd, which is the frame of virtual Honeypot are introduced. The techniques of network scanning including active fingerprint recognition are analyzed. Dynamic virtual network system is designed and implemented. A virtual network similar to real network topology is built according to the collected messages from real environments in this system. By doing this, the system can perplex the attackers when Hackers attack and can further analyze and research the attacks. The tests to this system prove that this design can successfully simulate real network environment and can be used in network security analysis.

Evolutionary dynamics of complex communications networks

CERN Document Server

Karyotis, Vasileios; Papavassiliou, Symeon

2013-01-01

Until recently, most network design techniques employed a bottom-up approach with lower protocol layer mechanisms affecting the development of higher ones. This approach, however, has not yielded fascinating results in the case of wireless distributed networks. Addressing the emerging aspects of modern network analysis and design, Evolutionary Dynamics of Complex Communications Networks introduces and develops a top-bottom approach where elements of the higher layer can be exploited in modifying the lowest physical topology-closing the network design loop in an evolutionary fashion similar to

Exponential Synchronization of Uncertain Complex Dynamical Networks with Delay Coupling

International Nuclear Information System (INIS)

Wang Lifu; Kong Zhi; Jing Yuanwei

2010-01-01

This paper studies the global exponential synchronization of uncertain complex delayed dynamical networks. The network model considered is general dynamical delay networks with unknown network structure and unknown coupling functions but bounded. Novel delay-dependent linear controllers are designed via the Lyapunov stability theory. Especially, it is shown that the controlled networks are globally exponentially synchronized with a given convergence rate. An example of typical dynamical network of this class, having the Lorenz system at each node, has been used to demonstrate and verify the novel design proposed. And, the numerical simulation results show the effectiveness of proposed synchronization approaches. (general)

Concurrency-Induced Transitions in Epidemic Dynamics on Temporal Networks.

Science.gov (United States)

Onaga, Tomokatsu; Gleeson, James P; Masuda, Naoki

2017-09-08

Social contact networks underlying epidemic processes in humans and animals are highly dynamic. The spreading of infections on such temporal networks can differ dramatically from spreading on static networks. We theoretically investigate the effects of concurrency, the number of neighbors that a node has at a given time point, on the epidemic threshold in the stochastic susceptible-infected-susceptible dynamics on temporal network models. We show that network dynamics can suppress epidemics (i.e., yield a higher epidemic threshold) when the node's concurrency is low, but can also enhance epidemics when the concurrency is high. We analytically determine different phases of this concurrency-induced transition, and confirm our results with numerical simulations.

Concurrency-Induced Transitions in Epidemic Dynamics on Temporal Networks

Science.gov (United States)

Onaga, Tomokatsu; Gleeson, James P.; Masuda, Naoki

2017-09-01

Social contact networks underlying epidemic processes in humans and animals are highly dynamic. The spreading of infections on such temporal networks can differ dramatically from spreading on static networks. We theoretically investigate the effects of concurrency, the number of neighbors that a node has at a given time point, on the epidemic threshold in the stochastic susceptible-infected-susceptible dynamics on temporal network models. We show that network dynamics can suppress epidemics (i.e., yield a higher epidemic threshold) when the node's concurrency is low, but can also enhance epidemics when the concurrency is high. We analytically determine different phases of this concurrency-induced transition, and confirm our results with numerical simulations.

Sparsity in Model Gene Regulatory Networks

International Nuclear Information System (INIS)

Zagorski, M.

2011-01-01

We propose a gene regulatory network model which incorporates the microscopic interactions between genes and transcription factors. In particular the gene's expression level is determined by deterministic synchronous dynamics with contribution from excitatory interactions. We study the structure of networks that have a particular '' function '' and are subject to the natural selection pressure. The question of network robustness against point mutations is addressed, and we conclude that only a small part of connections defined as '' essential '' for cell's existence is fragile. Additionally, the obtained networks are sparse with narrow in-degree and broad out-degree, properties well known from experimental study of biological regulatory networks. Furthermore, during sampling procedure we observe that significantly different genotypes can emerge under mutation-selection balance. All the preceding features hold for the model parameters which lay in the experimentally relevant range. (author)

Dynamics of subway networks based on vehicles operation timetable

Science.gov (United States)

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.

Density-dependence of functional spiking networks in vitro

Energy Technology Data Exchange (ETDEWEB)

Ham, Michael I [Los Alamos National Laboratory; Gintautuas, Vadas [Los Alamos National Laboratory; Rodriguez, Marko A [Los Alamos National Laboratory; Bettencourt, Luis M A [Los Alamos National Laboratory; Bennett, Ryan [UNIV OF NORTH TEXAS; Santa Maria, Cara L [UNIV OF NORTH TEXAS

2008-01-01

During development, the mammalian brain differentiates into specialized regions with unique functional abilities. While many factors contribute to this functional specialization, we explore the effect neuronal density can have on neuronal interactions. Two types of networks, dense (50,000 neurons and glia support cells) and sparse (12,000 neurons and glia support cells), are studied. A competitive first response model is applied to construct activation graphs that represent pairwise neuronal interactions. By observing the evolution of these graphs during development in vitro we observe that dense networks form activation connections earlier than sparse networks, and that link-!llltropy analysis of the resulting dense activation graphs reveals that balanced directional connections dominate. Information theoretic measures reveal in addition that early functional information interactions (of order 3) are synergetic in both dense and sparse networks. However, during development in vitro, such interactions become redundant in dense, but not sparse networks. Large values of activation graph link-entropy correlate strongly with redundant ensembles observed in the dense networks. Results demonstrate differences between dense and sparse networks in terms of informational groups, pairwise relationships, and activation graphs. These differences suggest that variations in cell density may result in different functional specialization of nervous system tissue also in vivo.

Modeling Insurgent Network Structure and Dynamics

Science.gov (United States)

Gabbay, Michael; Thirkill-Mackelprang, Ashley

2010-03-01

We present a methodology for mapping insurgent network structure based on their public rhetoric. Indicators of cooperative links between insurgent groups at both the leadership and rank-and-file levels are used, such as joint policy statements or joint operations claims. In addition, a targeting policy measure is constructed on the basis of insurgent targeting claims. Network diagrams which integrate these measures of insurgent cooperation and ideology are generated for different periods of the Iraqi and Afghan insurgencies. The network diagrams exhibit meaningful changes which track the evolution of the strategic environment faced by insurgent groups. Correlations between targeting policy and network structure indicate that insurgent targeting claims are aimed at establishing a group identity among the spectrum of rank-and-file insurgency supporters. A dynamical systems model of insurgent alliance formation and factionalism is presented which evolves the relationship between insurgent group dyads as a function of their ideological differences and their current relationships. The ability of the model to qualitatively and quantitatively capture insurgent network dynamics observed in the data is discussed.

Dynamic motifs in socio-economic networks

Science.gov (United States)

Zhang, Xin; Shao, Shuai; Stanley, H. Eugene; Havlin, Shlomo

2014-12-01

Socio-economic networks are of central importance in economic life. We develop a method of identifying and studying motifs in socio-economic networks by focusing on “dynamic motifs,” i.e., evolutionary connection patterns that, because of “node acquaintances” in the network, occur much more frequently than random patterns. We examine two evolving bi-partite networks: i) the world-wide commercial ship chartering market and ii) the ship build-to-order market. We find similar dynamic motifs in both bipartite networks, even though they describe different economic activities. We also find that “influence” and “persistence” are strong factors in the interaction behavior of organizations. When two companies are doing business with the same customer, it is highly probable that another customer who currently only has business relationship with one of these two companies, will become customer of the second in the future. This is the effect of influence. Persistence means that companies with close business ties to customers tend to maintain their relationships over a long period of time.

Resumption of dynamism in damaged networks of coupled oscillators

Science.gov (United States)

Kundu, Srilena; Majhi, Soumen; Ghosh, Dibakar

2018-05-01

Deterioration in dynamical activities may come up naturally or due to environmental influences in a massive portion of biological and physical systems. Such dynamical degradation may have outright effect on the substantive network performance. This requires us to provide some proper prescriptions to overcome undesired circumstances. In this paper, we present a scheme based on external feedback that can efficiently revive dynamism in damaged networks of active and inactive oscillators and thus enhance the network survivability. Both numerical and analytical investigations are performed in order to verify our claim. We also provide a comparative study on the effectiveness of this mechanism for feedbacks to the inactive group or to the active group only. Most importantly, resurrection of dynamical activity is realized even in time-delayed damaged networks, which are considered to be less persistent against deterioration in the form of inactivity in the oscillators. Furthermore, prominence in our approach is substantiated by providing evidence of enhanced network persistence in complex network topologies taking small-world and scale-free architectures, which makes the proposed remedy quite general. Besides the study in the network of Stuart-Landau oscillators, affirmative influence of external feedback has been justified in the network of chaotic Rössler systems as well.

The Social Dynamics of Innovation Networks

NARCIS (Netherlands)

Rutten, Roel; Benneworth, Paul Stephen; Irawati, Dessy; Boekema, Frans

2014-01-01

The social dynamics of innovation networks captures the important role of trust, social capital, institutions and norms and values in the creation of knowledge in innovation networks. In doing so, this book connects to a long-standing debate on the socio-spatial context of innovation in economic

Dynamical Adaptation in Terrorist Cells/Networks

DEFF Research Database (Denmark)

Hussain, Dil Muhammad Akbar; Ahmed, Zaki

2010-01-01

Typical terrorist cells/networks have dynamical structure as they evolve or adapt to changes which may occur due to capturing or killing of a member of the cell/network. Analytical measures in graph theory like degree centrality, betweenness and closeness centralities are very common and have long...

Efficient Neural Network Modeling for Flight and Space Dynamics Simulation

Directory of Open Access Journals (Sweden)

Ayman Hamdy Kassem

2011-01-01

Full Text Available This paper represents an efficient technique for neural network modeling of flight and space dynamics simulation. The technique will free the neural network designer from guessing the size and structure for the required neural network model and will help to minimize the number of neurons. For linear flight/space dynamics systems, the technique can find the network weights and biases directly by solving a system of linear equations without the need for training. Nonlinear flight dynamic systems can be easily modeled by training its linearized models keeping the same network structure. The training is fast, as it uses the linear system knowledge to speed up the training process. The technique is tested on different flight/space dynamic models and showed promising results.

Modelling flow dynamics in water distribution networks using ...

African Journals Online (AJOL)

One such approach is the Artificial Neural Networks (ANNs) technique. The advantage of ANNs is that they are robust and can be used to model complex linear and non-linear systems without making implicit assumptions. ANNs can be trained to forecast flow dynamics in a water distribution network. Such flow dynamics ...

Advances in dynamic network modeling in complex transportation systems

CERN Document Server

Ukkusuri, Satish V

2013-01-01

This book focuses on the latest in dynamic network modeling, including route guidance and traffic control in transportation systems and other complex infrastructure networks. Covers dynamic traffic assignment, flow modeling, mobile sensor deployment and more.

Higher-Order Synaptic Interactions Coordinate Dynamics in Recurrent Networks.

Directory of Open Access Journals (Sweden)

Brendan Chambers

2016-08-01

Full Text Available Linking synaptic connectivity to dynamics is key to understanding information processing in neocortex. Circuit dynamics emerge from complex interactions of interconnected neurons, necessitating that links between connectivity and dynamics be evaluated at the network level. Here we map propagating activity in large neuronal ensembles from mouse neocortex and compare it to a recurrent network model, where connectivity can be precisely measured and manipulated. We find that a dynamical feature dominates statistical descriptions of propagating activity for both neocortex and the model: convergent clusters comprised of fan-in triangle motifs, where two input neurons are themselves connected. Fan-in triangles coordinate the timing of presynaptic inputs during ongoing activity to effectively generate postsynaptic spiking. As a result, paradoxically, fan-in triangles dominate the statistics of spike propagation even in randomly connected recurrent networks. Interplay between higher-order synaptic connectivity and the integrative properties of neurons constrains the structure of network dynamics and shapes the routing of information in neocortex.

Actin dynamics and the elasticity of cytoskeletal networks

Directory of Open Access Journals (Sweden)

2009-09-01

Full Text Available The structural integrity of a cell depends on its cytoskeleton, which includes an actin network. This network is transient and depends upon the continual polymerization and depolymerization of actin. The degradation of an actin network, and a corresponding reduction in cell stiffness, can indicate the presence of disease. Numerical simulations will be invaluable for understanding the physics of these systems and the correlation between actin dynamics and elasticity. Here we develop a model that is capable of generating actin network structures. In particular, we develop a model of actin dynamics which considers the polymerization, depolymerization, nucleation, severing, and capping of actin filaments. The structures obtained are then fed directly into a mechanical model. This allows us to qualitatively assess the effects of changing various parameters associated with actin dynamics on the elasticity of the material.

Dynamic Data-Driven UAV Network for Plume Characterization

Science.gov (United States)

2016-05-23

AFRL-AFOSR-VA-TR-2016-0203 Dynamic Data-Driven UAV Network for Plume Characterization Kamran Mohseni UNIVERSITY OF FLORIDA Final Report 05/23/2016...AND SUBTITLE Dynamic Data-Driven UAV Network for Plume Characterization 5a.  CONTRACT NUMBER 5b.  GRANT NUMBER FA9550-13-1-0090 5c.  PROGRAM ELEMENT...studied a dynamic data driven (DDD) approach to operation of a heterogeneous team of unmanned aerial vehicles ( UAVs ) or micro/miniature aerial

Cloud-In-Cell modeling of shocked particle-laden flows at a ``SPARSE'' cost

Science.gov (United States)

Taverniers, Soren; Jacobs, Gustaaf; Sen, Oishik; Udaykumar, H. S.

2017-11-01

A common tool for enabling process-scale simulations of shocked particle-laden flows is Eulerian-Lagrangian Particle-Source-In-Cell (PSIC) modeling where each particle is traced in its Lagrangian frame and treated as a mathematical point. Its dynamics are governed by Stokes drag corrected for high Reynolds and Mach numbers. The computational burden is often reduced further through a ``Cloud-In-Cell'' (CIC) approach which amalgamates groups of physical particles into computational ``macro-particles''. CIC does not account for subgrid particle fluctuations, leading to erroneous predictions of cloud dynamics. A Subgrid Particle-Averaged Reynolds-Stress Equivalent (SPARSE) model is proposed that incorporates subgrid interphase velocity and temperature perturbations. A bivariate Gaussian source distribution, whose covariance captures the cloud's deformation to first order, accounts for the particles' momentum and energy influence on the carrier gas. SPARSE is validated by conducting tests on the interaction of a particle cloud with the accelerated flow behind a shock. The cloud's average dynamics and its deformation over time predicted with SPARSE converge to their counterparts computed with reference PSIC models as the number of Gaussians is increased from 1 to 16. This work was supported by AFOSR Grant No. FA9550-16-1-0008.

Dynamical community structure of populations evolving on genotype networks

International Nuclear Information System (INIS)

Capitán, José A.; Aguirre, Jacobo; Manrubia, Susanna

2015-01-01

Neutral evolutionary dynamics of replicators occurs on large and heterogeneous networks of genotypes. These networks, formed by all genotypes that yield the same phenotype, have a complex architecture that conditions the molecular composition of populations and their movements on genome spaces. Here we consider as an example the case of populations evolving on RNA secondary structure neutral networks and study the community structure of the network revealed through dynamical properties of the population at equilibrium and during adaptive transients. We unveil a rich hierarchical community structure that, eventually, can be traced back to the non-trivial relationship between RNA secondary structure and sequence composition. We demonstrate that usual measures of modularity that only take into account the static, topological structure of networks, cannot identify the community structure disclosed by population dynamics

Structure-based control of complex networks with nonlinear dynamics.

Science.gov (United States)

Zañudo, Jorge Gomez Tejeda; Yang, Gang; Albert, Réka

2017-07-11

What can we learn about controlling a system solely from its underlying network structure? Here we adapt a recently developed framework for control of networks governed by a broad class of nonlinear dynamics that includes the major dynamic models of biological, technological, and social processes. This feedback-based framework provides realizable node overrides that steer a system toward any of its natural long-term dynamic behaviors, regardless of the specific functional forms and system parameters. We use this framework on several real networks, identify the topological characteristics that underlie the predicted node overrides, and compare its predictions to those of structural controllability in control theory. Finally, we demonstrate this framework's applicability in dynamic models of gene regulatory networks and identify nodes whose override is necessary for control in the general case but not in specific model instances.

Dynamic social networks based on movement

Science.gov (United States)

Scharf, Henry; Hooten, Mevin B.; Fosdick, Bailey K.; Johnson, Devin S.; London, Joshua M.; Durban, John W.

2016-01-01

Network modeling techniques provide a means for quantifying social structure in populations of individuals. Data used to define social connectivity are often expensive to collect and based on case-specific, ad hoc criteria. Moreover, in applications involving animal social networks, collection of these data is often opportunistic and can be invasive. Frequently, the social network of interest for a given population is closely related to the way individuals move. Thus, telemetry data, which are minimally invasive and relatively inexpensive to collect, present an alternative source of information. We develop a framework for using telemetry data to infer social relationships among animals. To achieve this, we propose a Bayesian hierarchical model with an underlying dynamic social network controlling movement of individuals via two mechanisms: an attractive effect and an aligning effect. We demonstrate the model and its ability to accurately identify complex social behavior in simulation, and apply our model to telemetry data arising from killer whales. Using auxiliary information about the study population, we investigate model validity and find the inferred dynamic social network is consistent with killer whale ecology and expert knowledge.

Dynamic Frequency Control in Power Networks

OpenAIRE

Zhao, Changhong; Mallada Garcia, Enrique; Low, Steven H.

2016-01-01

Node controllers in power distribution networks in accordance with embodiments of the invention enable dynamic frequency control. One embodiment includes a node controller comprising a network interface a processor; and a memory containing a frequency control application; and a plurality of node operating parameters describing the operating parameters of a node, where the node is selected from a group consisting of at least one generator node in a power distribution network wherein the proces...

Fast Sparse Coding for Range Data Denoising with Sparse Ridges Constraint

Directory of Open Access Journals (Sweden)

Zhi Gao

2018-05-01

Full Text Available Light detection and ranging (LiDAR sensors have been widely deployed on intelligent systems such as unmanned ground vehicles (UGVs and unmanned aerial vehicles (UAVs to perform localization, obstacle detection, and navigation tasks. Thus, research into range data processing with competitive performance in terms of both accuracy and efficiency has attracted increasing attention. Sparse coding has revolutionized signal processing and led to state-of-the-art performance in a variety of applications. However, dictionary learning, which plays the central role in sparse coding techniques, is computationally demanding, resulting in its limited applicability in real-time systems. In this study, we propose sparse coding algorithms with a fixed pre-learned ridge dictionary to realize range data denoising via leveraging the regularity of laser range measurements in man-made environments. Experiments on both synthesized data and real data demonstrate that our method obtains accuracy comparable to that of sophisticated sparse coding methods, but with much higher computational efficiency.

Fast Sparse Coding for Range Data Denoising with Sparse Ridges Constraint.

Science.gov (United States)

Gao, Zhi; Lao, Mingjie; Sang, Yongsheng; Wen, Fei; Ramesh, Bharath; Zhai, Ruifang

2018-05-06

Light detection and ranging (LiDAR) sensors have been widely deployed on intelligent systems such as unmanned ground vehicles (UGVs) and unmanned aerial vehicles (UAVs) to perform localization, obstacle detection, and navigation tasks. Thus, research into range data processing with competitive performance in terms of both accuracy and efficiency has attracted increasing attention. Sparse coding has revolutionized signal processing and led to state-of-the-art performance in a variety of applications. However, dictionary learning, which plays the central role in sparse coding techniques, is computationally demanding, resulting in its limited applicability in real-time systems. In this study, we propose sparse coding algorithms with a fixed pre-learned ridge dictionary to realize range data denoising via leveraging the regularity of laser range measurements in man-made environments. Experiments on both synthesized data and real data demonstrate that our method obtains accuracy comparable to that of sophisticated sparse coding methods, but with much higher computational efficiency.

Network evolution driven by dynamics applied to graph coloring

International Nuclear Information System (INIS)

Wu Jian-She; Li Li-Guang; Yu Xin; Jiao Li-Cheng; Wang Xiao-Hua

2013-01-01

An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weights, so an interesting structure-dynamics co-evolutionary scheme appears. By providing two evolutionary strategies, a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics. The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors. In this way, a co-evolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring

Dynamic network expansion, contraction, and connectivity in the river corridor of mountain stream network

Science.gov (United States)

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

2017-12-01

River networks are broadly recognized to expand and contract in response to hydrologic forcing. Additionally, the individual controls on river corridor dynamics of hydrologic forcing and geologic setting are well recognized. However, we currently lack tools to integrate our understanding of process dynamics in the river corridor and make predictions at the scale of river networks. In this study, we develop a perceptual model of the river corridor in mountain river networks, translate this into a reduced-complexity mechanistic model, and implement the model in a well-studied headwater catchment. We found that the river network was most sensitive to hydrologic dynamics under the lowest discharges (Qgauge managers of water resources who need to estimate connectivity and flow initiation location along the river corridor over broad, unstudied catchments.

When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores

KAUST Repository

Wang, Jim Jing-Yan

2017-06-28

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays an important role. Up to now, these two problems have always been considered separately, assuming that data coding and ranking are two independent and irrelevant problems. However, is there any internal relationship between sparse coding and ranking score learning? If yes, how to explore and make use of this internal relationship? In this paper, we try to answer these questions by developing the first joint sparse coding and ranking score learning algorithm. To explore the local distribution in the sparse code space, and also to bridge coding and ranking problems, we assume that in the neighborhood of each data point, the ranking scores can be approximated from the corresponding sparse codes by a local linear function. By considering the local approximation error of ranking scores, the reconstruction error and sparsity of sparse coding, and the query information provided by the user, we construct a unified objective function for learning of sparse codes, the dictionary and ranking scores. We further develop an iterative algorithm to solve this optimization problem.

An Improved Information Hiding Method Based on Sparse Representation

Directory of Open Access Journals (Sweden)

Minghai Yao

2015-01-01

Full Text Available A novel biometric authentication information hiding method based on the sparse representation is proposed for enhancing the security of biometric information transmitted in the network. In order to make good use of abundant information of the cover image, the sparse representation method is adopted to exploit the correlation between the cover and biometric images. Thus, the biometric image is divided into two parts. The first part is the reconstructed image, and the other part is the residual image. The biometric authentication image cannot be restored by any one part. The residual image and sparse representation coefficients are embedded into the cover image. Then, for the sake of causing much less attention of attackers, the visual attention mechanism is employed to select embedding location and embedding sequence of secret information. Finally, the reversible watermarking algorithm based on histogram is utilized for embedding the secret information. For verifying the validity of the algorithm, the PolyU multispectral palmprint and the CASIA iris databases are used as biometric information. The experimental results show that the proposed method exhibits good security, invisibility, and high capacity.

Applications of flow-networks to opinion-dynamics

Science.gov (United States)

Tupikina, Liubov; Kurths, Jürgen

2015-04-01

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

Generalized master equations for non-Poisson dynamics on networks.

Science.gov (United States)

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

2012-10-01

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

Malware Propagation and Prevention Model for Time-Varying Community Networks within Software Defined Networks

Directory of Open Access Journals (Sweden)

Lan Liu

2017-01-01

Full Text Available As the adoption of Software Defined Networks (SDNs grows, the security of SDN still has several unaddressed limitations. A key network security research area is in the study of malware propagation across the SDN-enabled networks. To analyze the spreading processes of network malware (e.g., viruses in SDN, we propose a dynamic model with a time-varying community network, inspired by research models on the spread of epidemics in complex networks across communities. We assume subnets of the network as communities and links that are dense in subnets but sparse between subnets. Using numerical simulation and theoretical analysis, we find that the efficiency of network malware propagation in this model depends on the mobility rate q of the nodes between subnets. We also find that there exists a mobility rate threshold qc. The network malware will spread in the SDN when the mobility rate q>qc. The malware will survive when q>qc and perish when qnetwork malware and provide a theoretical basis to reduce and prevent network security incidents.

Regulatory networks and connected components of the neutral space. A look at functional islands

Science.gov (United States)

Boldhaus, G.; Klemm, K.

2010-09-01

The functioning of a living cell is largely determined by the structure of its regulatory network, comprising non-linear interactions between regulatory genes. An important factor for the stability and evolvability of such regulatory systems is neutrality - typically a large number of alternative network structures give rise to the necessary dynamics. Here we study the discretized regulatory dynamics of the yeast cell cycle [Li et al., PNAS, 2004] and the set of networks capable of reproducing it, which we call functional. Among these, the empirical yeast wildtype network is close to optimal with respect to sparse wiring. Under point mutations, which establish or delete single interactions, the neutral space of functional networks is fragmented into ≈ 4.7 × 108 components. One of the smaller ones contains the wildtype network. On average, functional networks reachable from the wildtype by mutations are sparser, have higher noise resilience and fewer fixed point attractors as compared with networks outside of this wildtype component.

Efficient sparse matrix-matrix multiplication for computing periodic responses by shooting method on Intel Xeon Phi

Science.gov (United States)

Stoykov, S.; Atanassov, E.; Margenov, S.

2016-10-01

Many of the scientific applications involve sparse or dense matrix operations, such as solving linear systems, matrix-matrix products, eigensolvers, etc. In what concerns structural nonlinear dynamics, the computations of periodic responses and the determination of stability of the solution are of primary interest. Shooting method iswidely used for obtaining periodic responses of nonlinear systems. The method involves simultaneously operations with sparse and dense matrices. One of the computationally expensive operations in the method is multiplication of sparse by dense matrices. In the current work, a new algorithm for sparse matrix by dense matrix products is presented. The algorithm takes into account the structure of the sparse matrix, which is obtained by space discretization of the nonlinear Mindlin's plate equation of motion by the finite element method. The algorithm is developed to use the vector engine of Intel Xeon Phi coprocessors. It is compared with the standard sparse matrix by dense matrix algorithm and the one developed by Intel MKL and it is shown that by considering the properties of the sparse matrix better algorithms can be developed.

Network Coding Protocols for Smart Grid Communications

DEFF Research Database (Denmark)

Prior, Rui; Roetter, Daniel Enrique Lucani; Phulpin, Yannick

2014-01-01

We propose a robust network coding protocol for enhancing the reliability and speed of data gathering in smart grids. At the heart of our protocol lies the idea of tunable sparse network coding, which adopts the transmission of sparsely coded packets at the beginning of the transmission process b...

Individual heterogeneity generating explosive system network dynamics.

Science.gov (United States)

Manrique, Pedro D; Johnson, Neil F

2018-03-01

Individual heterogeneity is a key characteristic of many real-world systems, from organisms to humans. However, its role in determining the system's collective dynamics is not well understood. Here we study how individual heterogeneity impacts the system network dynamics by comparing linking mechanisms that favor similar or dissimilar individuals. We find that this heterogeneity-based evolution drives an unconventional form of explosive network behavior, and it dictates how a polarized population moves toward consensus. Our model shows good agreement with data from both biological and social science domains. We conclude that individual heterogeneity likely plays a key role in the collective development of real-world networks and communities, and it cannot be ignored.

Individual heterogeneity generating explosive system network dynamics

Science.gov (United States)

Manrique, Pedro D.; Johnson, Neil F.

2018-03-01

Individual heterogeneity is a key characteristic of many real-world systems, from organisms to humans. However, its role in determining the system's collective dynamics is not well understood. Here we study how individual heterogeneity impacts the system network dynamics by comparing linking mechanisms that favor similar or dissimilar individuals. We find that this heterogeneity-based evolution drives an unconventional form of explosive network behavior, and it dictates how a polarized population moves toward consensus. Our model shows good agreement with data from both biological and social science domains. We conclude that individual heterogeneity likely plays a key role in the collective development of real-world networks and communities, and it cannot be ignored.

Sync in Complex Dynamical Networks: Stability, Evolution, Control, and Application

OpenAIRE

Li, Xiang

2005-01-01

In the past few years, the discoveries of small-world and scale-free properties of many natural and artificial complex networks have stimulated significant advances in better understanding the relationship between the topology and the collective dynamics of complex networks. This paper reports recent progresses in the literature of synchronization of complex dynamical networks including stability criteria, network synchronizability and uniform synchronous criticality in different topologies, ...

The application of sparse estimation of covariance matrix to quadratic discriminant analysis.

Science.gov (United States)

Sun, Jiehuan; Zhao, Hongyu

2015-02-18

Although Linear Discriminant Analysis (LDA) is commonly used for classification, it may not be directly applied in genomics studies due to the large p, small n problem in these studies. Different versions of sparse LDA have been proposed to address this significant challenge. One implicit assumption of various LDA-based methods is that the covariance matrices are the same across different classes. However, rewiring of genetic networks (therefore different covariance matrices) across different diseases has been observed in many genomics studies, which suggests that LDA and its variations may be suboptimal for disease classifications. However, it is not clear whether considering differing genetic networks across diseases can improve classification in genomics studies. We propose a sparse version of Quadratic Discriminant Analysis (SQDA) to explicitly consider the differences of the genetic networks across diseases. Both simulation and real data analysis are performed to compare the performance of SQDA with six commonly used classification methods. SQDA provides more accurate classification results than other methods for both simulated and real data. Our method should prove useful for classification in genomics studies and other research settings, where covariances differ among classes.

Network Signaling Channel for Improving ZigBee Performance in Dynamic Cluster-Tree Networks

Directory of Open Access Journals (Sweden)

D. Hämäläinen

2008-03-01

Full Text Available ZigBee is one of the most potential standardized technologies for wireless sensor networks (WSNs. Yet, sufficient energy-efficiency for the lowest power WSNs is achieved only in rather static networks. This severely limits the applicability of ZigBee in outdoor and mobile applications, where operation environment is harsh and link failures are common. This paper proposes a network channel beaconing (NCB algorithm for improving ZigBee performance in dynamic cluster-tree networks. NCB reduces the energy consumption of passive scans by dedicating one frequency channel for network beacon transmissions and by energy optimizing their transmission rate. According to an energy analysis, the power consumption of network maintenance operations reduces by 70%–76% in dynamic networks. In static networks, energy overhead is negligible. Moreover, the service time for data routing increases up to 37%. The performance of NCB is validated by ns-2 simulations. NCB can be implemented as an extension on MAC and NWK layers and it is fully compatible with ZigBee.

Transformer fault diagnosis using continuous sparse autoencoder.

Science.gov (United States)

Wang, Lukun; Zhao, Xiaoying; Pei, Jiangnan; Tang, Gongyou

2016-01-01

This paper proposes a novel continuous sparse autoencoder (CSAE) which can be used in unsupervised feature learning. The CSAE adds Gaussian stochastic unit into activation function to extract features of nonlinear data. In this paper, CSAE is applied to solve the problem of transformer fault recognition. Firstly, based on dissolved gas analysis method, IEC three ratios are calculated by the concentrations of dissolved gases. Then IEC three ratios data is normalized to reduce data singularity and improve training speed. Secondly, deep belief network is established by two layers of CSAE and one layer of back propagation (BP) network. Thirdly, CSAE is adopted to unsupervised training and getting features. Then BP network is used for supervised training and getting transformer fault. Finally, the experimental data from IEC TC 10 dataset aims to illustrate the effectiveness of the presented approach. Comparative experiments clearly show that CSAE can extract features from the original data, and achieve a superior correct differentiation rate on transformer fault diagnosis.

Multiple instance learning tracking method with local sparse representation

KAUST Repository

Xie, Chengjun

2013-10-01

When objects undergo large pose change, illumination variation or partial occlusion, most existed visual tracking algorithms tend to drift away from targets and even fail in tracking them. To address this issue, in this study, the authors propose an online algorithm by combining multiple instance learning (MIL) and local sparse representation for tracking an object in a video system. The key idea in our method is to model the appearance of an object by local sparse codes that can be formed as training data for the MIL framework. First, local image patches of a target object are represented as sparse codes with an overcomplete dictionary, where the adaptive representation can be helpful in overcoming partial occlusion in object tracking. Then MIL learns the sparse codes by a classifier to discriminate the target from the background. Finally, results from the trained classifier are input into a particle filter framework to sequentially estimate the target state over time in visual tracking. In addition, to decrease the visual drift because of the accumulative errors when updating the dictionary and classifier, a two-step object tracking method combining a static MIL classifier with a dynamical MIL classifier is proposed. Experiments on some publicly available benchmarks of video sequences show that our proposed tracker is more robust and effective than others. © The Institution of Engineering and Technology 2013.

Noise-induced polarization switching in complex networks

Science.gov (United States)

Haerter, Jan O.; Díaz-Guilera, Albert; Serrano, M. Ángeles

2017-04-01

The combination of bistability and noise is ubiquitous in complex systems, from biology to social interactions, and has important implications for their functioning and resilience. Here we use a simple three-state dynamical process, in which nodes go from one pole to another through an intermediate state, to show that noise can induce polarization switching in bistable systems if dynamical correlations are significant. In large, fully connected networks, where dynamical correlations can be neglected, increasing noise yields a collapse of bistability to an unpolarized configuration where the three possible states of the nodes are equally likely. In contrast, increased noise induces abrupt and irreversible polarization switching in sparsely connected networks. In multiplexes, where each layer can have a different polarization tendency, one layer is dominant and progressively imposes its polarization state on the other, offsetting or promoting the ability of noise to switch its polarization. Overall, we show that the interplay of noise and dynamical correlations can yield discontinuous transitions between extremes, which cannot be explained by a simple mean-field description.

Robustness of pinning a general complex dynamical network

International Nuclear Information System (INIS)

Wang Lei; Sun Youxian

2010-01-01

This Letter studies the robustness problem of pinning a general complex dynamical network toward an assigned synchronous evolution. Several synchronization criteria are presented to guarantee the convergence of the pinning process locally and globally by construction of Lyapunov functions. In particular, if a pinning strategy has been designed for synchronization of a given complex dynamical network, then no matter what uncertainties occur among the pinned nodes, synchronization can still be guaranteed through the pinning. The analytical results show that pinning control has a certain robustness against perturbations on network architecture: adding, deleting and changing the weights of edges. Numerical simulations illustrated by scale-free complex networks verify the theoretical results above-acquired.

Enabling dynamic network analysis through visualization in TVNViewer

Directory of Open Access Journals (Sweden)

Curtis Ross E

2012-08-01

Full Text Available Abstract Background Many biological processes are context-dependent or temporally specific. As a result, relationships between molecular constituents evolve across time and environments. While cutting-edge machine learning techniques can recover these networks, exploring and interpreting the rewiring behavior is challenging. Information visualization shines in this type of exploratory analysis, motivating the development ofTVNViewer (http://sailing.cs.cmu.edu/tvnviewer, a visualization tool for dynamic network analysis. Results In this paper, we demonstrate visualization techniques for dynamic network analysis by using TVNViewer to analyze yeast cell cycle and breast cancer progression datasets. Conclusions TVNViewer is a powerful new visualization tool for the analysis of biological networks that change across time or space.

Enabling dynamic network analysis through visualization in TVNViewer

Science.gov (United States)

2012-01-01

Background Many biological processes are context-dependent or temporally specific. As a result, relationships between molecular constituents evolve across time and environments. While cutting-edge machine learning techniques can recover these networks, exploring and interpreting the rewiring behavior is challenging. Information visualization shines in this type of exploratory analysis, motivating the development ofTVNViewer (http://sailing.cs.cmu.edu/tvnviewer), a visualization tool for dynamic network analysis. Results In this paper, we demonstrate visualization techniques for dynamic network analysis by using TVNViewer to analyze yeast cell cycle and breast cancer progression datasets. Conclusions TVNViewer is a powerful new visualization tool for the analysis of biological networks that change across time or space. PMID:22897913

Workload Balancing on Heterogeneous Systems: A Case Study of Sparse Grid Interpolation

KAUST Repository

Muraraşu, Alin; Weidendorfer, Josef; Bode, Arndt

2012-01-01

load balancing is essential. This paper proposes static and dynamic solutions for load balancing in the context of an application for visualizing high-dimensional simulation data. The application relies on the sparse grid technique for data compression

Agent-based modeling and network dynamics

CERN Document Server

Namatame, Akira

2016-01-01

The book integrates agent-based modeling and network science. It is divided into three parts, namely, foundations, primary dynamics on and of social networks, and applications. The book begins with the network origin of agent-based models, known as cellular automata, and introduce a number of classic models, such as Schelling’s segregation model and Axelrod’s spatial game. The essence of the foundation part is the network-based agent-based models in which agents follow network-based decision rules. Under the influence of the substantial progress in network science in late 1990s, these models have been extended from using lattices into using small-world networks, scale-free networks, etc. The book also shows that the modern network science mainly driven by game-theorists and sociophysicists has inspired agent-based social scientists to develop alternative formation algorithms, known as agent-based social networks. The book reviews a number of pioneering and representative models in this family. Upon the gi...

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

Science.gov (United States)

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

Congested Link Inference Algorithms in Dynamic Routing IP Network

Directory of Open Access Journals (Sweden)

Yu Chen

2017-01-01

Full Text Available The performance descending of current congested link inference algorithms is obviously in dynamic routing IP network, such as the most classical algorithm CLINK. To overcome this problem, based on the assumptions of Markov property and time homogeneity, we build a kind of Variable Structure Discrete Dynamic Bayesian (VSDDB network simplified model of dynamic routing IP network. Under the simplified VSDDB model, based on the Bayesian Maximum A Posteriori (BMAP and Rest Bayesian Network Model (RBNM, we proposed an Improved CLINK (ICLINK algorithm. Considering the concurrent phenomenon of multiple link congestion usually happens, we also proposed algorithm CLILRS (Congested Link Inference algorithm based on Lagrangian Relaxation Subgradient to infer the set of congested links. We validated our results by the experiments of analogy, simulation, and actual Internet.

Network Dynamics of Innovation Processes

Science.gov (United States)

Iacopini, Iacopo; Milojević, Staša; Latora, Vito

2018-01-01

We introduce a model for the emergence of innovations, in which cognitive processes are described as random walks on the network of links among ideas or concepts, and an innovation corresponds to the first visit of a node. The transition matrix of the random walk depends on the network weights, while in turn the weight of an edge is reinforced by the passage of a walker. The presence of the network naturally accounts for the mechanism of the "adjacent possible," and the model reproduces both the rate at which novelties emerge and the correlations among them observed empirically. We show this by using synthetic networks and by studying real data sets on the growth of knowledge in different scientific disciplines. Edge-reinforced random walks on complex topologies offer a new modeling framework for the dynamics of correlated novelties and are another example of coevolution of processes and networks.

OTDM Networking for Short Range High-Capacity Highly Dynamic Networks

DEFF Research Database (Denmark)

Medhin, Ashenafi Kiros

This PhD thesis aims at investigating the possibility of designing energy-efficient high-capacity (up to Tbit/s) optical network scenarios, leveraging on the effect of collective switching of many bits simultaneously, as is inherent in high bit rate serial optical data signals. The focus...... is on short range highly dynamic networks, catering to data center needs. The investigation concerns optical network scenarios, and experimental implementations of high bit rate serial data packet generation and reception, scalable optical packet labeling, simple optical label extraction and stable ultra...

Competitive Dynamics on Complex Networks

Science.gov (United States)

Zhao, Jiuhua; Liu, Qipeng; Wang, Xiaofan

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

Active influence in dynamical models of structural balance in social networks

Science.gov (United States)

Summers, Tyler H.; Shames, Iman

2013-07-01

We consider a nonlinear dynamical system on a signed graph, which can be interpreted as a mathematical model of social networks in which the links can have both positive and negative connotations. In accordance with a concept from social psychology called structural balance, the negative links play a key role in both the structure and dynamics of the network. Recent research has shown that in a nonlinear dynamical system modeling the time evolution of “friendliness levels” in the network, two opposing factions emerge from almost any initial condition. Here we study active external influence in this dynamical model and show that any agent in the network can achieve any desired structurally balanced state from any initial condition by perturbing its own local friendliness levels. Based on this result, we also introduce a new network centrality measure for signed networks. The results are illustrated in an international-relations network using United Nations voting record data from 1946 to 2008 to estimate friendliness levels amongst various countries.

Framework based on communicability and flow to analyze complex network dynamics

Science.gov (United States)

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.

Extracting neuronal functional network dynamics via adaptive Granger causality analysis.

Science.gov (United States)

Sheikhattar, Alireza; Miran, Sina; Liu, Ji; Fritz, Jonathan B; Shamma, Shihab A; Kanold, Patrick O; Babadi, Behtash

2018-04-24

Quantifying the functional relations between the nodes in a network based on local observations is a key challenge in studying complex systems. Most existing time series analysis techniques for this purpose provide static estimates of the network properties, pertain to stationary Gaussian data, or do not take into account the ubiquitous sparsity in the underlying functional networks. When applied to spike recordings from neuronal ensembles undergoing rapid task-dependent dynamics, they thus hinder a precise statistical characterization of the dynamic neuronal functional networks underlying adaptive behavior. We develop a dynamic estimation and inference paradigm for extracting functional neuronal network dynamics in the sense of Granger, by integrating techniques from adaptive filtering, compressed sensing, point process theory, and high-dimensional statistics. We demonstrate the utility of our proposed paradigm through theoretical analysis, algorithm development, and application to synthetic and real data. Application of our techniques to two-photon Ca 2+ imaging experiments from the mouse auditory cortex reveals unique features of the functional neuronal network structures underlying spontaneous activity at unprecedented spatiotemporal resolution. Our analysis of simultaneous recordings from the ferret auditory and prefrontal cortical areas suggests evidence for the role of rapid top-down and bottom-up functional dynamics across these areas involved in robust attentive behavior.

Spatial-temporal-spectral EEG patterns of BOLD functional network connectivity dynamics

Science.gov (United States)

Lamoš, Martin; Mareček, Radek; Slavíček, Tomáš; Mikl, Michal; Rektor, Ivan; Jan, Jiří

2018-06-01

Objective. Growing interest in the examination of large-scale brain network functional connectivity dynamics is accompanied by an effort to find the electrophysiological correlates. The commonly used constraints applied to spatial and spectral domains during electroencephalogram (EEG) data analysis may leave part of the neural activity unrecognized. We propose an approach that blindly reveals multimodal EEG spectral patterns that are related to the dynamics of the BOLD functional network connectivity. Approach. The blind decomposition of EEG spectrogram by parallel factor analysis has been shown to be a useful technique for uncovering patterns of neural activity. The simultaneously acquired BOLD fMRI data were decomposed by independent component analysis. Dynamic functional connectivity was computed on the component’s time series using a sliding window correlation, and between-network connectivity states were then defined based on the values of the correlation coefficients. ANOVA tests were performed to assess the relationships between the dynamics of between-network connectivity states and the fluctuations of EEG spectral patterns. Main results. We found three patterns related to the dynamics of between-network connectivity states. The first pattern has dominant peaks in the alpha, beta, and gamma bands and is related to the dynamics between the auditory, sensorimotor, and attentional networks. The second pattern, with dominant peaks in the theta and low alpha bands, is related to the visual and default mode network. The third pattern, also with peaks in the theta and low alpha bands, is related to the auditory and frontal network. Significance. Our previous findings revealed a relationship between EEG spectral pattern fluctuations and the hemodynamics of large-scale brain networks. In this study, we suggest that the relationship also exists at the level of functional connectivity dynamics among large-scale brain networks when no standard spatial and spectral

Identifying and tracking dynamic processes in social networks

Science.gov (United States)

Chung, Wayne; Savell, Robert; Schütt, Jan-Peter; Cybenko, George

2006-05-01

The detection and tracking of embedded malicious subnets in an active social network can be computationally daunting due to the quantity of transactional data generated in the natural interaction of large numbers of actors comprising a network. In addition, detection of illicit behavior may be further complicated by evasive strategies designed to camouflage the activities of the covert subnet. In this work, we move beyond traditional static methods of social network analysis to develop a set of dynamic process models which encode various modes of behavior in active social networks. These models will serve as the basis for a new application of the Process Query System (PQS) to the identification and tracking of covert dynamic processes in social networks. We present a preliminary result from application of our technique in a real-world data stream-- the Enron email corpus.

perception of communication network fraud dynamics by network ...

African Journals Online (AJOL)

ES Obe

work fraud dynamics by network administrators and stakeholders. In considering ... cyber crime within the last two years. How- ever, two-thirds of the ... ˆ increased exposure to unpredictable fi- nancial losses ... The intentions of the customers are reflected ..... 'There is a 95% confidence that the differ- ence between the ...

Sparse structure regularized ranking

KAUST Repository

Wang, Jim Jing-Yan; Sun, Yijun; Gao, Xin

2014-01-01

Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse

Sparse structure regularized ranking

KAUST Repository

Wang, Jim Jing-Yan

2014-04-17

Learning ranking scores is critical for the multimedia database retrieval problem. In this paper, we propose a novel ranking score learning algorithm by exploring the sparse structure and using it to regularize ranking scores. To explore the sparse structure, we assume that each multimedia object could be represented as a sparse linear combination of all other objects, and combination coefficients are regarded as a similarity measure between objects and used to regularize their ranking scores. Moreover, we propose to learn the sparse combination coefficients and the ranking scores simultaneously. A unified objective function is constructed with regard to both the combination coefficients and the ranking scores, and is optimized by an iterative algorithm. Experiments on two multimedia database retrieval data sets demonstrate the significant improvements of the propose algorithm over state-of-the-art ranking score learning algorithms.

Complex networks: when random walk dynamics equals synchronization

International Nuclear Information System (INIS)

Kriener, Birgit; Anand, Lishma; Timme, Marc

2012-01-01

Synchrony prevalently emerges from the interactions of coupled dynamical units. For simple systems such as networks of phase oscillators, the asymptotic synchronization process is assumed to be equivalent to a Markov process that models standard diffusion or random walks on the same network topology. In this paper, we analytically derive the conditions for such equivalence for networks of pulse-coupled oscillators, which serve as models for neurons and pacemaker cells interacting by exchanging electric pulses or fireflies interacting via light flashes. We find that the pulse synchronization process is less simple, but there are classes of, e.g., network topologies that ensure equivalence. In particular, local dynamical operators are required to be doubly stochastic. These results provide a natural link between stochastic processes and deterministic synchronization on networks. Tools for analyzing diffusion (or, more generally, Markov processes) may now be transferred to pin down features of synchronization in networks of pulse-coupled units such as neural circuits. (paper)

Face Image Retrieval of Efficient Sparse Code words and Multiple Attribute in Binning Image

Directory of Open Access Journals (Sweden)

Suchitra S

2017-08-01

Full Text Available ABSTRACT In photography, face recognition and face retrieval play an important role in many applications such as security, criminology and image forensics. Advancements in face recognition make easier for identity matching of an individual with attributes. Latest development in computer vision technologies enables us to extract facial attributes from the input image and provide similar image results. In this paper, we propose a novel LOP and sparse codewords method to provide similar matching results with respect to input query image. To improve accuracy in image results with input image and dynamic facial attributes, Local octal pattern algorithm [LOP] and Sparse codeword applied in offline and online. The offline and online procedures in face image binning techniques apply with sparse code. Experimental results with Pubfig dataset shows that the proposed LOP along with sparse codewords able to provide matching results with increased accuracy of 90%.

Dynamical systems on networks a tutorial

CERN Document Server

Porter, Mason A

2016-01-01

This volume is a tutorial for the study of dynamical systems on networks. It discusses both methodology and models, including spreading models for social and biological contagions. The authors focus especially on “simple” situations that are analytically tractable, because they are insightful and provide useful springboards for the study of more complicated scenarios. This tutorial, which also includes key pointers to the literature, should be helpful for junior and senior undergraduate students, graduate students, and researchers from mathematics, physics, and engineering who seek to study dynamical systems on networks but who may not have prior experience with graph theory or networks. Mason A. Porter is Professor of Nonlinear and Complex Systems at the Oxford Centre for Industrial and Applied Mathematics, Mathematical Institute, University of Oxford, UK. He is also a member of the CABDyN Complexity Centre and a Tutorial Fellow of Somerville College. James P. Gleeson is Professor of Industrial and Appli...

Turbulent flows over sparse canopies

Science.gov (United States)

Sharma, Akshath; García-Mayoral, Ricardo

2018-04-01

Turbulent flows over sparse and dense canopies exerting a similar drag force on the flow are investigated using Direct Numerical Simulations. The dense canopies are modelled using a homogeneous drag force, while for the sparse canopy, the geometry of the canopy elements is represented. It is found that on using the friction velocity based on the local shear at each height, the streamwise velocity fluctuations and the Reynolds stress within the sparse canopy are similar to those from a comparable smooth-wall case. In addition, when scaled with the local friction velocity, the intensity of the off-wall peak in the streamwise vorticity for sparse canopies also recovers a value similar to a smooth-wall. This indicates that the sparse canopy does not significantly disturb the near-wall turbulence cycle, but causes its rescaling to an intensity consistent with a lower friction velocity within the canopy. In comparison, the dense canopy is found to have a higher damping effect on the turbulent fluctuations. For the case of the sparse canopy, a peak in the spectral energy density of the wall-normal velocity, and Reynolds stress is observed, which may indicate the formation of Kelvin-Helmholtz-like instabilities. It is also found that a sparse canopy is better modelled by a homogeneous drag applied on the mean flow alone, and not the turbulent fluctuations.

Rumor Diffusion in an Interests-Based Dynamic Social Network

Directory of Open Access Journals (Sweden)

Mingsheng Tang

2013-01-01

Full Text Available To research rumor diffusion in social friend network, based on interests, a dynamic friend network is proposed, which has the characteristics of clustering and community, and a diffusion model is also proposed. With this friend network and rumor diffusion model, based on the zombie-city model, some simulation experiments to analyze the characteristics of rumor diffusion in social friend networks have been conducted. The results show some interesting observations: (1 positive information may evolve to become a rumor through the diffusion process that people may modify the information by word of mouth; (2 with the same average degree, a random social network has a smaller clustering coefficient and is more beneficial for rumor diffusion than the dynamic friend network; (3 a rumor is spread more widely in a social network with a smaller global clustering coefficient than in a social network with a larger global clustering coefficient; and (4 a network with a smaller clustering coefficient has a larger efficiency.

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

Science.gov (United States)

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

State-dependent intrinsic predictability of cortical network dynamics.

Directory of Open Access Journals (Sweden)

Leila Fakhraei

Full Text Available The information encoded in cortical circuit dynamics is fleeting, changing from moment to moment as new input arrives and ongoing intracortical interactions progress. A combination of deterministic and stochastic biophysical mechanisms governs how cortical dynamics at one moment evolve from cortical dynamics in recently preceding moments. Such temporal continuity of cortical dynamics is fundamental to many aspects of cortex function but is not well understood. Here we study temporal continuity by attempting to predict cortical population dynamics (multisite local field potential based on its own recent history in somatosensory cortex of anesthetized rats and in a computational network-level model. We found that the intrinsic predictability of cortical dynamics was dependent on multiple factors including cortical state, synaptic inhibition, and how far into the future the prediction extends. By pharmacologically tuning synaptic inhibition, we obtained a continuum of cortical states with asynchronous population activity at one extreme and stronger, spatially extended synchrony at the other extreme. Intermediate between these extremes we observed evidence for a special regime of population dynamics called criticality. Predictability of the near future (10-100 ms increased as the cortical state was tuned from asynchronous to synchronous. Predictability of the more distant future (>1 s was generally poor, but, surprisingly, was higher for asynchronous states compared to synchronous states. These experimental results were confirmed in a computational network model of spiking excitatory and inhibitory neurons. Our findings demonstrate that determinism and predictability of network dynamics depend on cortical state and the time-scale of the dynamics.

Dynamic properties of epidemic spreading on finite size complex networks

Science.gov (United States)

Li, Ying; Liu, Yang; Shan, Xiu-Ming; Ren, Yong; Jiao, Jian; Qiu, Ben

2005-11-01

The Internet presents a complex topological structure, on which computer viruses can easily spread. By using theoretical analysis and computer simulation methods, the dynamic process of disease spreading on finite size networks with complex topological structure is investigated. On the finite size networks, the spreading process of SIS (susceptible-infected-susceptible) model is a finite Markov chain with an absorbing state. Two parameters, the survival probability and the conditional infecting probability, are introduced to describe the dynamic properties of disease spreading on finite size networks. Our results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks. Also, knowledge about the dynamic character of virus spreading is helpful for adopting immunity policy.

Dynamic Mobile IP routers in ad hoc networks

NARCIS (Netherlands)

Kock, B.A.; Schmidt, J.R.

2005-01-01

This paper describes a concept combining mobile IP and ad hoc routing to create a robust mobile network. In this network all nodes are mobile and globally and locally reachable under the same IP address. Essential for implementing this network are the dynamic mobile IP routers. They act as gateways

Complex and unexpected dynamics in simple genetic regulatory networks

Science.gov (United States)

Borg, Yanika; Ullner, Ekkehard; Alagha, Afnan; Alsaedi, Ahmed; Nesbeth, Darren; Zaikin, Alexey

2014-03-01

One aim of synthetic biology is to construct increasingly complex genetic networks from interconnected simpler ones to address challenges in medicine and biotechnology. However, as systems increase in size and complexity, emergent properties lead to unexpected and complex dynamics due to nonlinear and nonequilibrium properties from component interactions. We focus on four different studies of biological systems which exhibit complex and unexpected dynamics. Using simple synthetic genetic networks, small and large populations of phase-coupled quorum sensing repressilators, Goodwin oscillators, and bistable switches, we review how coupled and stochastic components can result in clustering, chaos, noise-induced coherence and speed-dependent decision making. A system of repressilators exhibits oscillations, limit cycles, steady states or chaos depending on the nature and strength of the coupling mechanism. In large repressilator networks, rich dynamics can also be exhibited, such as clustering and chaos. In populations of Goodwin oscillators, noise can induce coherent oscillations. In bistable systems, the speed with which incoming external signals reach steady state can bias the network towards particular attractors. These studies showcase the range of dynamical behavior that simple synthetic genetic networks can exhibit. In addition, they demonstrate the ability of mathematical modeling to analyze nonlinearity and inhomogeneity within these systems.

Control theory of digitally networked dynamic systems

CERN Document Server

Lunze, Jan

2013-01-01

The book gives an introduction to networked control systems and describes new modeling paradigms, analysis methods for event-driven, digitally networked systems, and design methods for distributed estimation and control. Networked model predictive control is developed as a means to tolerate time delays and packet loss brought about by the communication network. In event-based control the traditional periodic sampling is replaced by state-dependent triggering schemes. Novel methods for multi-agent systems ensure complete or clustered synchrony of agents with identical or with individual dynamic

Discriminative sparse coding on multi-manifolds

KAUST Repository

Wang, J.J.-Y.; Bensmail, H.; Yao, N.; Gao, Xin

2013-01-01

Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.

Discriminative sparse coding on multi-manifolds

KAUST Repository

Wang, J.J.-Y.

2013-09-26

Sparse coding has been popularly used as an effective data representation method in various applications, such as computer vision, medical imaging and bioinformatics. However, the conventional sparse coding algorithms and their manifold-regularized variants (graph sparse coding and Laplacian sparse coding), learn codebooks and codes in an unsupervised manner and neglect class information that is available in the training set. To address this problem, we propose a novel discriminative sparse coding method based on multi-manifolds, that learns discriminative class-conditioned codebooks and sparse codes from both data feature spaces and class labels. First, the entire training set is partitioned into multiple manifolds according to the class labels. Then, we formulate the sparse coding as a manifold-manifold matching problem and learn class-conditioned codebooks and codes to maximize the manifold margins of different classes. Lastly, we present a data sample-manifold matching-based strategy to classify the unlabeled data samples. Experimental results on somatic mutations identification and breast tumor classification based on ultrasonic images demonstrate the efficacy of the proposed data representation and classification approach. 2013 The Authors. All rights reserved.

Sparse Regression by Projection and Sparse Discriminant Analysis

KAUST Repository

Qi, Xin

2015-04-03

© 2015, © American Statistical Association, Institute of Mathematical Statistics, and Interface Foundation of North America. Recent years have seen active developments of various penalized regression methods, such as LASSO and elastic net, to analyze high-dimensional data. In these approaches, the direction and length of the regression coefficients are determined simultaneously. Due to the introduction of penalties, the length of the estimates can be far from being optimal for accurate predictions. We introduce a new framework, regression by projection, and its sparse version to analyze high-dimensional data. The unique nature of this framework is that the directions of the regression coefficients are inferred first, and the lengths and the tuning parameters are determined by a cross-validation procedure to achieve the largest prediction accuracy. We provide a theoretical result for simultaneous model selection consistency and parameter estimation consistency of our method in high dimension. This new framework is then generalized such that it can be applied to principal components analysis, partial least squares, and canonical correlation analysis. We also adapt this framework for discriminant analysis. Compared with the existing methods, where there is relatively little control of the dependency among the sparse components, our method can control the relationships among the components. We present efficient algorithms and related theory for solving the sparse regression by projection problem. Based on extensive simulations and real data analysis, we demonstrate that our method achieves good predictive performance and variable selection in the regression setting, and the ability to control relationships between the sparse components leads to more accurate classification. In supplementary materials available online, the details of the algorithms and theoretical proofs, and R codes for all simulation studies are provided.

Mathematical model for spreading dynamics of social network worms

International Nuclear Information System (INIS)

Sun, Xin; Liu, Yan-Heng; Han, Jia-Wei; Liu, Xue-Jie; Li, Bin; Li, Jin

2012-01-01

In this paper, a mathematical model for social network worm spreading is presented from the viewpoint of social engineering. This model consists of two submodels. Firstly, a human behavior model based on game theory is suggested for modeling and predicting the expected behaviors of a network user encountering malicious messages. The game situation models the actions of a user under the condition that the system may be infected at the time of opening a malicious message. Secondly, a social network accessing model is proposed to characterize the dynamics of network users, by which the number of online susceptible users can be determined at each time step. Several simulation experiments are carried out on artificial social networks. The results show that (1) the proposed mathematical model can well describe the spreading dynamics of social network worms; (2) weighted network topology greatly affects the spread of worms; (3) worms spread even faster on hybrid social networks

Cell fate reprogramming by control of intracellular network dynamics

Science.gov (United States)

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.

Arresting Strategy Based on Dynamic Criminal Networks Changing over Time

Directory of Open Access Journals (Sweden)

Junqing Yuan

2013-01-01

Full Text Available We investigate a sequence of dynamic criminal networks on a time series based on the dynamic network analysis (DNA. According to the change of networks’ structure, networks’ variation trend is analyzed to forecast its future structure. Finally, an optimal arresting time and priority list are designed based on our analysis. Better results can be expected than that based on social network analysis (SNA.

Sparse distributed memory overview

Science.gov (United States)

Raugh, Mike

1990-01-01

The Sparse Distributed Memory (SDM) project is investigating the theory and applications of massively parallel computing architecture, called sparse distributed memory, that will support the storage and retrieval of sensory and motor patterns characteristic of autonomous systems. The immediate objectives of the project are centered in studies of the memory itself and in the use of the memory to solve problems in speech, vision, and robotics. Investigation of methods for encoding sensory data is an important part of the research. Examples of NASA missions that may benefit from this work are Space Station, planetary rovers, and solar exploration. Sparse distributed memory offers promising technology for systems that must learn through experience and be capable of adapting to new circumstances, and for operating any large complex system requiring automatic monitoring and control. Sparse distributed memory is a massively parallel architecture motivated by efforts to understand how the human brain works. Sparse distributed memory is an associative memory, able to retrieve information from cues that only partially match patterns stored in the memory. It is able to store long temporal sequences derived from the behavior of a complex system, such as progressive records of the system's sensory data and correlated records of the system's motor controls.

DyNet: visualization and analysis of dynamic molecular interaction networks.

Science.gov (United States)

Goenawan, Ivan H; Bryan, Kenneth; Lynn, David J

2016-09-01

: The ability to experimentally determine molecular interactions on an almost proteome-wide scale under different conditions is enabling researchers to move from static to dynamic network analysis, uncovering new insights into how interaction networks are physically rewired in response to different stimuli and in disease. Dynamic interaction data presents a special challenge in network biology. Here, we present DyNet, a Cytoscape application that provides a range of functionalities for the visualization, real-time synchronization and analysis of large multi-state dynamic molecular interaction networks enabling users to quickly identify and analyze the most 'rewired' nodes across many network states. DyNet is available at the Cytoscape (3.2+) App Store (http://apps.cytoscape.org/apps/dynet). david.lynn@sahmri.com Supplementary data are available at Bioinformatics online. © The Author 2016. Published by Oxford University Press.

Dynamics of epidemic diseases on a growing adaptive network.

Science.gov (United States)

Demirel, Güven; Barter, Edmund; Gross, Thilo

2017-02-10

The study of epidemics on static networks has revealed important effects on disease prevalence of network topological features such as the variance of the degree distribution, i.e. the distribution of the number of neighbors of nodes, and the maximum degree. Here, we analyze an adaptive network where the degree distribution is not independent of epidemics but is shaped through disease-induced dynamics and mortality in a complex interplay. We study the dynamics of a network that grows according to a preferential attachment rule, while nodes are simultaneously removed from the network due to disease-induced mortality. We investigate the prevalence of the disease using individual-based simulations and a heterogeneous node approximation. Our results suggest that in this system in the thermodynamic limit no epidemic thresholds exist, while the interplay between network growth and epidemic spreading leads to exponential networks for any finite rate of infectiousness when the disease persists.

Agent Based Modeling on Organizational Dynamics of Terrorist Network

Directory of Open Access Journals (Sweden)

Bo Li

2015-01-01

Full Text Available Modeling organizational dynamics of terrorist network is a critical issue in computational analysis of terrorism research. The first step for effective counterterrorism and strategic intervention is to investigate how the terrorists operate with the relational network and what affects the performance. In this paper, we investigate the organizational dynamics by employing a computational experimentation methodology. The hierarchical cellular network model and the organizational dynamics model are developed for modeling the hybrid relational structure and complex operational processes, respectively. To intuitively elucidate this method, the agent based modeling is used to simulate the terrorist network and test the performance in diverse scenarios. Based on the experimental results, we show how the changes of operational environments affect the development of terrorist organization in terms of its recovery and capacity to perform future tasks. The potential strategies are also discussed, which can be used to restrain the activities of terrorists.

Topology Identification of General Dynamical Network with Distributed Time Delays

International Nuclear Information System (INIS)

Zhao-Yan, Wu; Xin-Chu, Fu

2009-01-01

General dynamical networks with distributed time delays are studied. The topology of the networks are viewed as unknown parameters, which need to be identified. Some auxiliary systems (also called the network estimators) are designed to achieve this goal. Both linear feedback control and adaptive strategy are applied in designing these network estimators. Based on linear matrix inequalities and the Lyapunov function method, the sufficient condition for the achievement of topology identification is obtained. This method can also better monitor the switching topology of dynamical networks. Illustrative examples are provided to show the effectiveness of this method. (general)

Dynamic hydro-climatic networks in pristine and regulated rivers

Science.gov (United States)

Botter, G.; Basso, S.; Lazzaro, G.; Doulatyari, B.; Biswal, B.; Schirmer, M.; Rinaldo, A.

2014-12-01

Flow patterns observed at-a-station are the dynamical byproduct of a cascade of processes involving different compartments of the hydro-climatic network (e.g., climate, rainfall, soil, vegetation) that regulates the transformation of rainfall into streamflows. In complex branching rivers, flow regimes result from the heterogeneous arrangement around the stream network of multiple hydrologic cascades that simultaneously occur within distinct contributing areas. As such, flow regimes are seen as the integrated output of a complex "network of networks", which can be properly characterized by its degree of temporal variability and spatial heterogeneity. Hydrologic networks that generate river flow regimes are dynamic in nature. In pristine rivers, the time-variance naturally emerges at multiple timescales from climate variability (namely, seasonality and inter-annual fluctuations), implying that the magnitude (and the features) of the water flow between two nodes may be highly variable across different seasons and years. Conversely, the spatial distribution of river flow regimes within pristine rivers involves scale-dependent transport features, as well as regional climatic and soil use gradients, which in small and meso-scale catchments (A guarantee quite uniform flow regimes and high spatial correlations. Human-impacted rivers, instead, constitute hybrid networks where observed spatio-temporal patterns are dominated by anthropogenic shifts, such as landscape alterations and river regulation. In regulated rivers, the magnitude and the features of water flows from node to node may change significantly through time due to damming and withdrawals. However, regulation may impact river regimes in a spatially heterogeneous manner (e.g. in localized river reaches), with a significant decrease of spatial correlations and network connectivity. Provided that the spatial and temporal dynamics of flow regimes in complex rivers may strongly impact important biotic processes

In-place sparse suffix sorting

DEFF Research Database (Denmark)

Prezza, Nicola

2018-01-01

information regarding the lexicographical order of a size-b subset of all n text suffixes is often needed. Such information can be stored space-efficiently (in b words) in the sparse suffix array (SSA). The SSA and its relative sparse LCP array (SLCP) can be used as a space-efficient substitute of the sparse...... suffix tree. Very recently, Gawrychowski and Kociumaka [11] showed that the sparse suffix tree (and therefore SSA and SLCP) can be built in asymptotically optimal O(b) space with a Monte Carlo algorithm running in O(n) time. The main reason for using the SSA and SLCP arrays in place of the sparse suffix...... tree is, however, their reduced space of b words each. This leads naturally to the quest for in-place algorithms building these arrays. Franceschini and Muthukrishnan [8] showed that the full suffix array can be built in-place and in optimal running time. On the other hand, finding sub-quadratic in...

Impact of constrained rewiring on network structure and node dynamics

Science.gov (United States)

Rattana, P.; Berthouze, L.; Kiss, I. Z.

2014-11-01

In this paper, we study an adaptive spatial network. We consider a susceptible-infected-susceptible (SIS) epidemic on the network, with a link or contact rewiring process constrained by spatial proximity. In particular, we assume that susceptible nodes break links with infected nodes independently of distance and reconnect at random to susceptible nodes available within a given radius. By systematically manipulating this radius we investigate the impact of rewiring on the structure of the network and characteristics of the epidemic. We adopt a step-by-step approach whereby we first study the impact of rewiring on the network structure in the absence of an epidemic, then with nodes assigned a disease status but without disease dynamics, and finally running network and epidemic dynamics simultaneously. In the case of no labeling and no epidemic dynamics, we provide both analytic and semianalytic formulas for the value of clustering achieved in the network. Our results also show that the rewiring radius and the network's initial structure have a pronounced effect on the endemic equilibrium, with increasingly large rewiring radiuses yielding smaller disease prevalence.

Context-dependent retrieval of information by neural-network dynamics with continuous attractors.

Science.gov (United States)

Tsuboshita, Yukihiro; Okamoto, Hiroshi

2007-08-01

Memory retrieval in neural networks has traditionally been described by dynamic systems with discrete attractors. However, recent neurophysiological findings of graded persistent activity suggest that memory retrieval in the brain is more likely to be described by dynamic systems with continuous attractors. To explore what sort of information processing is achieved by continuous-attractor dynamics, keyword extraction from documents by a network of bistable neurons, which gives robust continuous attractors, is examined. Given an associative network of terms, a continuous attractor led by propagation of neuronal activation in this network appears to represent keywords that express underlying meaning of a document encoded in the initial state of the network-activation pattern. A dominant hypothesis in cognitive psychology is that long-term memory is archived in the network structure, which resembles associative networks of terms. Our results suggest that keyword extraction by the neural-network dynamics with continuous attractors might symbolically represent context-dependent retrieval of short-term memory from long-term memory in the brain.

Discriminating lysosomal membrane protein types using dynamic neural network.

Science.gov (United States)

Tripathi, Vijay; Gupta, Dwijendra Kumar

2014-01-01

This work presents a dynamic artificial neural network methodology, which classifies the proteins into their classes from their sequences alone: the lysosomal membrane protein classes and the various other membranes protein classes. In this paper, neural networks-based lysosomal-associated membrane protein type prediction system is proposed. Different protein sequence representations are fused to extract the features of a protein sequence, which includes seven feature sets; amino acid (AA) composition, sequence length, hydrophobic group, electronic group, sum of hydrophobicity, R-group, and dipeptide composition. To reduce the dimensionality of the large feature vector, we applied the principal component analysis. The probabilistic neural network, generalized regression neural network, and Elman regression neural network (RNN) are used as classifiers and compared with layer recurrent network (LRN), a dynamic network. The dynamic networks have memory, i.e. its output depends not only on the input but the previous outputs also. Thus, the accuracy of LRN classifier among all other artificial neural networks comes out to be the highest. The overall accuracy of jackknife cross-validation is 93.2% for the data-set. These predicted results suggest that the method can be effectively applied to discriminate lysosomal associated membrane proteins from other membrane proteins (Type-I, Outer membrane proteins, GPI-Anchored) and Globular proteins, and it also indicates that the protein sequence representation can better reflect the core feature of membrane proteins than the classical AA composition.

Fragility in dynamic networks: application to neural networks in the epileptic cortex.

Science.gov (United States)

Sritharan, Duluxan; Sarma, Sridevi V

2014-10-01

Epilepsy is a network phenomenon characterized by atypical activity at the neuronal and population levels during seizures, including tonic spiking, increased heterogeneity in spiking rates, and synchronization. The etiology of epilepsy is unclear, but a common theme among proposed mechanisms is that structural connectivity between neurons is altered. It is hypothesized that epilepsy arises not from random changes in connectivity, but from specific structural changes to the most fragile nodes or neurons in the network. In this letter, the minimum energy perturbation on functional connectivity required to destabilize linear networks is derived. Perturbation results are then applied to a probabilistic nonlinear neural network model that operates at a stable fixed point. That is, if a small stimulus is applied to the network, the activation probabilities of each neuron respond transiently but eventually recover to their baseline values. When the perturbed network is destabilized, the activation probabilities shift to larger or smaller values or oscillate when a small stimulus is applied. Finally, the structural modifications to the neural network that achieve the functional perturbation are derived. Simulations of the unperturbed and perturbed networks qualitatively reflect neuronal activity observed in epilepsy patients, suggesting that the changes in network dynamics due to destabilizing perturbations, including the emergence of an unstable manifold or a stable limit cycle, may be indicative of neuronal or population dynamics during seizure. That is, the epileptic cortex is always on the brink of instability and minute changes in the synaptic weights associated with the most fragile node can suddenly destabilize the network to cause seizures. Finally, the theory developed here and its interpretation of epileptic networks enables the design of a straightforward feedback controller that first detects when the network has destabilized and then applies linear state

Greedy Sparse Approaches for Homological Coverage in Location Unaware Sensor Networks

Science.gov (United States)

2017-12-08

problems (e.g., coverage hole detection, coverage verification , hole local- ization, and so on; see Section 2 for more details). The sparse coverage...10,17,20–25 2. detection or verification of coverage (i.e., ensuring there is no coverage gap or hole),11,12,26–29 3 Approved for public release...v))) = 0 then Broadcast self as candidate for collapse to neighbors if All neighboring nodes broadcast themselves as non-candidates then v not needed

Energy-Aware Routing Optimization in Dynamic GMPLS Controlled Optical Networks

DEFF Research Database (Denmark)

Wang, Jiayuan; Ricciardi, Sergio; Fagertun, Anna Manolova

2012-01-01

In this paper, routing optimizations based on energy sources are proposed in dynamic GMPLS controlled optical networks. The influences of re-routing and load balancing factors on the algorithm are evaluated, with a focus on different re-routing thresholds. Results from dynamic network simulations...

Nonredundant sparse feature extraction using autoencoders with receptive fields clustering.

Science.gov (United States)

Ayinde, Babajide O; Zurada, Jacek M

2017-09-01

This paper proposes new techniques for data representation in the context of deep learning using agglomerative clustering. Existing autoencoder-based data representation techniques tend to produce a number of encoding and decoding receptive fields of layered autoencoders that are duplicative, thereby leading to extraction of similar features, thus resulting in filtering redundancy. We propose a way to address this problem and show that such redundancy can be eliminated. This yields smaller networks and produces unique receptive fields that extract distinct features. It is also shown that autoencoders with nonnegativity constraints on weights are capable of extracting fewer redundant features than conventional sparse autoencoders. The concept is illustrated using conventional sparse autoencoder and nonnegativity-constrained autoencoders with MNIST digits recognition, NORB normalized-uniform object data and Yale face dataset. Copyright © 2017 Elsevier Ltd. All rights reserved.

Predictive coding of dynamical variables in balanced spiking networks.

Science.gov (United States)

Boerlin, Martin; Machens, Christian K; Denève, Sophie

2013-01-01

Two observations about the cortex have puzzled neuroscientists for a long time. First, neural responses are highly variable. Second, the level of excitation and inhibition received by each neuron is tightly balanced at all times. Here, we demonstrate that both properties are necessary consequences of neural networks that represent information efficiently in their spikes. We illustrate this insight with spiking networks that represent dynamical variables. Our approach is based on two assumptions: We assume that information about dynamical variables can be read out linearly from neural spike trains, and we assume that neurons only fire a spike if that improves the representation of the dynamical variables. Based on these assumptions, we derive a network of leaky integrate-and-fire neurons that is able to implement arbitrary linear dynamical systems. We show that the membrane voltage of the neurons is equivalent to a prediction error about a common population-level signal. Among other things, our approach allows us to construct an integrator network of spiking neurons that is robust against many perturbations. Most importantly, neural variability in our networks cannot be equated to noise. Despite exhibiting the same single unit properties as widely used population code models (e.g. tuning curves, Poisson distributed spike trains), balanced networks are orders of magnitudes more reliable. Our approach suggests that spikes do matter when considering how the brain computes, and that the reliability of cortical representations could have been strongly underestimated.

Dynamics of nephron-vascular network

DEFF Research Database (Denmark)

Postnov, Dmitry; Postnov, D E; Marsh, D J

2012-01-01

The paper presents a modeling study of the spatial dynamics of a nephro-vascular network consisting of individual nephrons connected via a tree-like vascular branching structure. We focus on the effects of nonlinear mechanisms that are responsible for the formation of synchronous patterns in order...

Nonlinear identification of process dynamics using neural networks

International Nuclear Information System (INIS)

Parlos, A.G.; Atiya, A.F.; Chong, K.T.

1992-01-01

In this paper the nonlinear identification of process dynamics encountered in nuclear power plant components is addressed, in an input-output sense, using artificial neural systems. A hybrid feedforward/feedback neural network, namely, a recurrent multilayer perceptron, is used as the model structure to be identified. The feedforward portion of the network architecture provides its well-known interpolation property, while through recurrency and cross-talk, the local information feedback enables representation of temporal variations in the system nonlinearities. The standard backpropagation learning algorithm is modified, and it is used for the supervised training of the proposed hybrid network. The performance of recurrent multilayer perceptron networks in identifying process dynamics is investigated via the case study of a U-tube steam generator. The response of representative steam generator is predicted using a neural network, and it is compared to the response obtained from a sophisticated computer model based on first principles. The transient responses compare well, although further research is warranted to determine the predictive capabilities of these networks during more severe operational transients and accident scenarios

Synchronization of complex delayed dynamical networks with nonlinearly coupled nodes

International Nuclear Information System (INIS)

Liu Tao; Zhao Jun; Hill, David J.

2009-01-01

In this paper, we study the global synchronization of nonlinearly coupled complex delayed dynamical networks with both directed and undirected graphs. Via Lyapunov-Krasovskii stability theory and the network topology, we investigate the global synchronization of such networks. Under the assumption that coupling coefficients are known, a family of delay-independent decentralized nonlinear feedback controllers are designed to globally synchronize the networks. When coupling coefficients are unavailable, an adaptive mechanism is introduced to synthesize a family of delay-independent decentralized adaptive controllers which guarantee the global synchronization of the uncertain networks. Two numerical examples of directed and undirected delayed dynamical network are given, respectively, using the Lorenz system as the nodes of the networks, which demonstrate the effectiveness of proposed results.

Classification of multispectral or hyperspectral satellite imagery using clustering of sparse approximations on sparse representations in learned dictionaries obtained using efficient convolutional sparse coding

Science.gov (United States)

Moody, Daniela; Wohlberg, Brendt

2018-01-02

An approach for land cover classification, seasonal and yearly change detection and monitoring, and identification of changes in man-made features may use a clustering of sparse approximations (CoSA) on sparse representations in learned dictionaries. The learned dictionaries may be derived using efficient convolutional sparse coding to build multispectral or hyperspectral, multiresolution dictionaries that are adapted to regional satellite image data. Sparse image representations of images over the learned dictionaries may be used to perform unsupervised k-means clustering into land cover categories. The clustering process behaves as a classifier in detecting real variability. This approach may combine spectral and spatial textural characteristics to detect geologic, vegetative, hydrologic, and man-made features, as well as changes in these features over time.

Dynamic baseline detection method for power data network service

Science.gov (United States)

Chen, Wei

2017-08-01

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

Identification of Complex Dynamical Systems with Neural Networks (2/2)

CERN Multimedia

CERN. Geneva

2016-01-01

The identification and analysis of high dimensional nonlinear systems is obviously a challenging task. Neural networks have been proven to be universal approximators but this still leaves the identification task a hard one. To do it efficiently, we have to violate some of the rules of classical regression theory. Furthermore we should focus on the interpretation of the resulting model to overcome its black box character. First, we will discuss function approximation with 3 layer feedforward neural networks up to new developments in deep neural networks and deep learning. These nets are not only of interest in connection with image analysis but are a center point of the current artificial intelligence developments. Second, we will focus on the analysis of complex dynamical system in the form of state space models realized as recurrent neural networks. After the introduction of small open dynamical systems we will study dynamical systems on manifolds. Here manifold and dynamics have to be identified in parall...

Identification of Complex Dynamical Systems with Neural Networks (1/2)

CERN Multimedia

CERN. Geneva

2016-01-01

The identification and analysis of high dimensional nonlinear systems is obviously a challenging task. Neural networks have been proven to be universal approximators but this still leaves the identification task a hard one. To do it efficiently, we have to violate some of the rules of classical regression theory. Furthermore we should focus on the interpretation of the resulting model to overcome its black box character. First, we will discuss function approximation with 3 layer feedforward neural networks up to new developments in deep neural networks and deep learning. These nets are not only of interest in connection with image analysis but are a center point of the current artificial intelligence developments. Second, we will focus on the analysis of complex dynamical system in the form of state space models realized as recurrent neural networks. After the introduction of small open dynamical systems we will study dynamical systems on manifolds. Here manifold and dynamics have to be identified in parall...

Spontaneous formation of dynamical groups in an adaptive networked system

International Nuclear Information System (INIS)

Li Menghui; Guan Shuguang; Lai, C-H

2010-01-01

In this work, we investigate a model of an adaptive networked dynamical system, where the coupling strengths among phase oscillators coevolve with the phase states. It is shown that in this model the oscillators can spontaneously differentiate into two dynamical groups after a long time evolution. Within each group, the oscillators have similar phases, while oscillators in different groups have approximately opposite phases. The network gradually converts from the initial random structure with a uniform distribution of connection strengths into a modular structure that is characterized by strong intra-connections and weak inter-connections. Furthermore, the connection strengths follow a power-law distribution, which is a natural consequence of the coevolution of the network and the dynamics. Interestingly, it is found that if the inter-connections are weaker than a certain threshold, the two dynamical groups will almost decouple and evolve independently. These results are helpful in further understanding the empirical observations in many social and biological networks.

Joint reconstruction of dynamic PET activity and kinetic parametric images using total variation constrained dictionary sparse coding

Science.gov (United States)

Yu, Haiqing; Chen, Shuhang; Chen, Yunmei; Liu, Huafeng

2017-05-01

Dynamic positron emission tomography (PET) is capable of providing both spatial and temporal information of radio tracers in vivo. In this paper, we present a novel joint estimation framework to reconstruct temporal sequences of dynamic PET images and the coefficients characterizing the system impulse response function, from which the associated parametric images of the system macro parameters for tracer kinetics can be estimated. The proposed algorithm, which combines statistical data measurement and tracer kinetic models, integrates a dictionary sparse coding (DSC) into a total variational minimization based algorithm for simultaneous reconstruction of the activity distribution and parametric map from measured emission sinograms. DSC, based on the compartmental theory, provides biologically meaningful regularization, and total variation regularization is incorporated to provide edge-preserving guidance. We rely on techniques from minimization algorithms (the alternating direction method of multipliers) to first generate the estimated activity distributions with sub-optimal kinetic parameter estimates, and then recover the parametric maps given these activity estimates. These coupled iterative steps are repeated as necessary until convergence. Experiments with synthetic, Monte Carlo generated data, and real patient data have been conducted, and the results are very promising.

In-silico studies of neutral drift for functional protein interaction networks

Science.gov (United States)

Ali, Md Zulfikar; Wingreen, Ned S.; Mukhopadhyay, Ranjan

We have developed a minimal physically-motivated model of protein-protein interaction networks. Our system consists of two classes of enzymes, activators (e.g. kinases) and deactivators (e.g. phosphatases), and the enzyme-mediated activation/deactivation rates are determined by sequence-dependent binding strengths between enzymes and their targets. The network is evolved by introducing random point mutations in the binding sequences where we assume that each new mutation is either fixed or entirely lost. We apply this model to studies of neutral drift in networks that yield oscillatory dynamics, where we start, for example, with a relatively simple network and allow it to evolve by adding nodes and connections while requiring that dynamics be conserved. Our studies demonstrate both the importance of employing a sequence-based evolutionary scheme and the relative rapidity (in evolutionary time) for the redistribution of function over new nodes via neutral drift. Surprisingly, in addition to this redistribution time we discovered another much slower timescale for network evolution, reflecting hidden order in sequence space that we interpret in terms of sparsely connected domains.

Energy Efficiency Analysis for Dynamic Routing in Optical Transport Networks

DEFF Research Database (Denmark)

Vizcaíno, Jorge López; Ye, Yabin; Tafur Monroy, Idelfonso

2012-01-01

The energy efficiency in telecommunication networks is gaining more relevance as the Internet traffic is growing. The introduction of OFDM and dynamic operation opens new horizons in the operation of optical networks, improving the network flexibility and its efficiency. In this paper, we compare...... the performance in terms of energy efficiency of a flexible-grid OFDM-based solution with a fixed-grid WDM network in a dynamic scenario with time-varying connections. We highlight the benefits that the bandwidth elasticity and the flexibility of selecting different modulation formats can offer compared...

Applying differential dynamic logic to reconfigurable biological networks.

Science.gov (United States)

Figueiredo, Daniel; Martins, Manuel A; Chaves, Madalena

2017-09-01

Qualitative and quantitative modeling frameworks are widely used for analysis of biological regulatory networks, the former giving a preliminary overview of the system's global dynamics and the latter providing more detailed solutions. Another approach is to model biological regulatory networks as hybrid systems, i.e., systems which can display both continuous and discrete dynamic behaviors. Actually, the development of synthetic biology has shown that this is a suitable way to think about biological systems, which can often be constructed as networks with discrete controllers, and present hybrid behaviors. In this paper we discuss this approach as a special case of the reconfigurability paradigm, well studied in Computer Science (CS). In CS there are well developed computational tools to reason about hybrid systems. We argue that it is worth applying such tools in a biological context. One interesting tool is differential dynamic logic (dL), which has recently been developed by Platzer and applied to many case-studies. In this paper we discuss some simple examples of biological regulatory networks to illustrate how dL can be used as an alternative, or also as a complement to methods already used. Copyright © 2017 Elsevier Inc. All rights reserved.

Strategic tradeoffs in competitor dynamics on adaptive networks.

Science.gov (United States)

Hébert-Dufresne, Laurent; Allard, Antoine; Noël, Pierre-André; Young, Jean-Gabriel; Libby, Eric

2017-08-08

Recent empirical work highlights the heterogeneity of social competitions such as political campaigns: proponents of some ideologies seek debate and conversation, others create echo chambers. While symmetric and static network structure is typically used as a substrate to study such competitor dynamics, network structure can instead be interpreted as a signature of the competitor strategies, yielding competition dynamics on adaptive networks. Here we demonstrate that tradeoffs between aggressiveness and defensiveness (i.e., targeting adversaries vs. targeting like-minded individuals) creates paradoxical behaviour such as non-transitive dynamics. And while there is an optimal strategy in a two competitor system, three competitor systems have no such solution; the introduction of extreme strategies can easily affect the outcome of a competition, even if the extreme strategies have no chance of winning. Not only are these results reminiscent of classic paradoxical results from evolutionary game theory, but the structure of social networks created by our model can be mapped to particular forms of payoff matrices. Consequently, social structure can act as a measurable metric for social games which in turn allows us to provide a game theoretical perspective on online political debates.

Dynamics of domain wall networks with junctions

International Nuclear Information System (INIS)

Avelino, P. P.; Oliveira, J. C. R. E.; Martins, C. J. A. P.; Menezes, J.; Menezes, R.

2008-01-01

We use a combination of analytic tools and an extensive set of the largest and most accurate three-dimensional field theory numerical simulations to study the dynamics of domain wall networks with junctions. We build upon our previous work and consider a class of models which, in the limit of large number N of coupled scalar fields, approaches the so-called ''ideal'' model (in terms of its potential to lead to network frustration). We consider values of N between N=2 and N=20, and a range of cosmological epochs, and we also compare this class of models with other toy models used in the past. In all cases we find compelling evidence for a gradual approach to scaling, strongly supporting our no-frustration conjecture. We also discuss the various possible types of junctions (including cases where there is a hierarchy of them) and their roles in the dynamics of the network. Finally, we provide a cosmological Zel'dovich-type bound on the energy scale of this kind of defect network: it must be lower than 10 keV.

Temporal characterisation of the network of Danish cattle movements and its implication for disease control: 2000–2009

DEFF Research Database (Denmark)

Mweu, Marshal M.; Fournié, Guillaume; Hisham Beshara Halasa, Tariq

2013-01-01

-world properties in March–April 2001 as well as in 24 other months during the period October 2006 to December 2009. The network was sparsely connected with markets being the key influential holdings. Its vulnerability to removal of markets suggests that targeting highly connected holdings during epidemics should......Social network analysis provides a valuable framework for understanding the dynamics of diseases on networks as well as a means for defining effective control measures. An understanding of the underlying contact pattern for a susceptible population is advisable before embarking on any strategy...

Dynamics of the cell-cycle network under genome-rewiring perturbations

International Nuclear Information System (INIS)

Katzir, Yair; Elhanati, Yuval; Braun, Erez; Averbukh, Inna

2013-01-01

The cell-cycle progression is regulated by a specific network enabling its ordered dynamics. Recent experiments supported by computational models have shown that a core of genes ensures this robust cycle dynamics. However, much less is known about the direct interaction of the cell-cycle regulators with genes outside of the cell-cycle network, in particular those of the metabolic system. Following our recent experimental work, we present here a model focusing on the dynamics of the cell-cycle core network under rewiring perturbations. Rewiring is achieved by placing an essential metabolic gene exclusively under the regulation of a cell-cycle's promoter, forcing the cell-cycle network to function under a multitasking challenging condition; operating in parallel the cell-cycle progression and a metabolic essential gene. Our model relies on simple rate equations that capture the dynamics of the relevant protein–DNA and protein–protein interactions, while making a clear distinction between these two different types of processes. In particular, we treat the cell-cycle transcription factors as limited ‘resources’ and focus on the redistribution of resources in the network during its dynamics. This elucidates the sensitivity of its various nodes to rewiring interactions. The basic model produces the correct cycle dynamics for a wide range of parameters. The simplicity of the model enables us to study the interface between the cell-cycle regulation and other cellular processes. Rewiring a promoter of the network to regulate a foreign gene, forces a multitasking regulatory load. The higher the load on the promoter, the longer is the cell-cycle period. Moreover, in agreement with our experimental results, the model shows that different nodes of the network exhibit variable susceptibilities to the rewiring perturbations. Our model suggests that the topology of the cell-cycle core network ensures its plasticity and flexible interface with other cellular processes

Mean-field modeling approach for understanding epidemic dynamics in interconnected networks

International Nuclear Information System (INIS)

Zhu, Guanghu; Fu, Xinchu; Tang, Qinggan; Li, Kezan

2015-01-01

Modern systems (e.g., social, communicant, biological networks) are increasingly interconnected each other formed as ‘networks of networks’. Such complex systems usually possess inconsistent topologies and permit agents distributed in different subnetworks to interact directly/indirectly. Corresponding dynamics phenomena, such as the transmission of information, power, computer virus and disease, would exhibit complicated and heterogeneous tempo-spatial patterns. In this paper, we focus on the scenario of epidemic spreading in interconnected networks. We intend to provide a typical mean-field modeling framework to describe the time-evolution dynamics, and offer some mathematical skills to study the spreading threshold and the global stability of the model. Integrating the research with numerical analysis, we are able to quantify the effects of networks structure and epidemiology parameters on the transmission dynamics. Interestingly, we find that the diffusion transition in the whole network is governed by a unique threshold, which mainly depends on the most heterogenous connection patterns of network substructures. Further, the dynamics is highly sensitive to the critical values of cross infectivity with switchable phases.

Design of multi-phase dynamic chemical networks

Science.gov (United States)

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.

Discrete Sparse Coding.

Science.gov (United States)

Exarchakis, Georgios; Lücke, Jörg

2017-11-01

Sparse coding algorithms with continuous latent variables have been the subject of a large number of studies. However, discrete latent spaces for sparse coding have been largely ignored. In this work, we study sparse coding with latents described by discrete instead of continuous prior distributions. We consider the general case in which the latents (while being sparse) can take on any value of a finite set of possible values and in which we learn the prior probability of any value from data. This approach can be applied to any data generated by discrete causes, and it can be applied as an approximation of continuous causes. As the prior probabilities are learned, the approach then allows for estimating the prior shape without assuming specific functional forms. To efficiently train the parameters of our probabilistic generative model, we apply a truncated expectation-maximization approach (expectation truncation) that we modify to work with a general discrete prior. We evaluate the performance of the algorithm by applying it to a variety of tasks: (1) we use artificial data to verify that the algorithm can recover the generating parameters from a random initialization, (2) use image patches of natural images and discuss the role of the prior for the extraction of image components, (3) use extracellular recordings of neurons to present a novel method of analysis for spiking neurons that includes an intuitive discretization strategy, and (4) apply the algorithm on the task of encoding audio waveforms of human speech. The diverse set of numerical experiments presented in this letter suggests that discrete sparse coding algorithms can scale efficiently to work with realistic data sets and provide novel statistical quantities to describe the structure of the data.

Antagonistic Phenomena in Network Dynamics

Science.gov (United States)

Motter, Adilson E.; Timme, Marc

2018-03-01

Recent research on the network modeling of complex systems has led to a convenient representation of numerous natural, social, and engineered systems that are now recognized as networks of interacting parts. Such systems can exhibit a wealth of phenomena that not only cannot be anticipated from merely examining their parts, as per the textbook definition of complexity, but also challenge intuition even when considered in the context of what is now known in network science. Here, we review the recent literature on two major classes of such phenomena that have far-reaching implications: (a) antagonistic responses to changes of states or parameters and (b) coexistence of seemingly incongruous behaviors or properties - both deriving from the collective and inherently decentralized nature of the dynamics. They include effects as diverse as negative compressibility in engineered materials, rescue interactions in biological networks, negative resistance in fluid networks, and the Braess paradox occurring across transport and supply networks. They also include remote synchronization, chimera states, and the converse of symmetry breaking in brain, power-grid, and oscillator networks as well as remote control in biological and bioinspired systems. By offering a unified view of these various scenarios, we suggest that they are representative of a yet broader class of unprecedented network phenomena that ought to be revealed and explained by future research.

Dynamics on networks: the role of local dynamics and global networks on the emergence of hypersynchronous neural activity.

Directory of Open Access Journals (Sweden)

Helmut Schmidt

2014-11-01

Full Text Available Graph theory has evolved into a useful tool for studying complex brain networks inferred from a variety of measures of neural activity, including fMRI, DTI, MEG and EEG. In the study of neurological disorders, recent work has discovered differences in the structure of graphs inferred from patient and control cohorts. However, most of these studies pursue a purely observational approach; identifying correlations between properties of graphs and the cohort which they describe, without consideration of the underlying mechanisms. To move beyond this necessitates the development of computational modeling approaches to appropriately interpret network interactions and the alterations in brain dynamics they permit, which in the field of complexity sciences is known as dynamics on networks. In this study we describe the development and application of this framework using modular networks of Kuramoto oscillators. We use this framework to understand functional networks inferred from resting state EEG recordings of a cohort of 35 adults with heterogeneous idiopathic generalized epilepsies and 40 healthy adult controls. Taking emergent synchrony across the global network as a proxy for seizures, our study finds that the critical strength of coupling required to synchronize the global network is significantly decreased for the epilepsy cohort for functional networks inferred from both theta (3-6 Hz and low-alpha (6-9 Hz bands. We further identify left frontal regions as a potential driver of seizure activity within these networks. We also explore the ability of our method to identify individuals with epilepsy, observing up to 80% predictive power through use of receiver operating characteristic analysis. Collectively these findings demonstrate that a computer model based analysis of routine clinical EEG provides significant additional information beyond standard clinical interpretation, which should ultimately enable a more appropriate mechanistic

Pinning adaptive synchronization of a class of uncertain complex dynamical networks with multi-link against network deterioration

International Nuclear Information System (INIS)

Li, Lixiang; Li, Weiwei; Kurths, Jürgen; Luo, Qun; Yang, Yixian; Li, Shudong

2015-01-01

For the reason that the uncertain complex dynamic network with multi-link is quite close to various practical networks, there is superiority in the fields of research and application. In this paper, we focus upon pinning adaptive synchronization for uncertain complex dynamic networks with multi-link against network deterioration. The pinning approach can be applied to adapt uncertain coupling factors of deteriorated networks which can compensate effects of uncertainty. Several new synchronization criterions for networks with multi-link are derived, which ensure the synchronized states to be local or global stable with uncertainty and deterioration. Results of simulation are shown to demonstrate the feasibility and usefulness of our method

Dynamic Evolution of Financial Network and its Relation to Economic Crises

Science.gov (United States)

Gao, Ya-Chun; Wei, Zong-Wen; Wang, Bing-Hong

2013-02-01

The static topology properties of financial networks have been widely investigated since the work done by Mantegna, yet their dynamic evolution with time is little considered. In this paper, we comprehensively study the dynamic evolution of financial network by a sliding window technique. The vertices and edges of financial network are represented by the stocks from S&P500 components and correlations between pairs of daily returns of price fluctuation, respectively. Furthermore, the duration of stock price fluctuation, spanning from January 4, 1985 to September 14, 2009, makes us to carefully observe the relation between the dynamic topological properties and big financial crashes. The empirical results suggest that the financial network has the robust small-world property when the time evolves, and the topological structure drastically changes when the big financial crashes occur. This correspondence between the dynamic evolution of financial network and big financial crashes may provide a novel view to understand the origin of economic crisis.

Learning to read aloud: A neural network approach using sparse distributed memory

Science.gov (United States)

Joglekar, Umesh Dwarkanath

1989-01-01

An attempt to solve a problem of text-to-phoneme mapping is described which does not appear amenable to solution by use of standard algorithmic procedures. Experiments based on a model of distributed processing are also described. This model (sparse distributed memory (SDM)) can be used in an iterative supervised learning mode to solve the problem. Additional improvements aimed at obtaining better performance are suggested.

Network Unfolding Map by Vertex-Edge Dynamics Modeling.

Science.gov (United States)

Verri, Filipe Alves Neto; Urio, Paulo Roberto; Zhao, Liang

2018-02-01

The emergence of collective dynamics in neural networks is a mechanism of the animal and human brain for information processing. In this paper, we develop a computational technique using distributed processing elements in a complex network, which are called particles, to solve semisupervised learning problems. Three actions govern the particles' dynamics: generation, walking, and absorption. Labeled vertices generate new particles that compete against rival particles for edge domination. Active particles randomly walk in the network until they are absorbed by either a rival vertex or an edge currently dominated by rival particles. The result from the model evolution consists of sets of edges arranged by the label dominance. Each set tends to form a connected subnetwork to represent a data class. Although the intrinsic dynamics of the model is a stochastic one, we prove that there exists a deterministic version with largely reduced computational complexity; specifically, with linear growth. Furthermore, the edge domination process corresponds to an unfolding map in such way that edges "stretch" and "shrink" according to the vertex-edge dynamics. Consequently, the unfolding effect summarizes the relevant relationships between vertices and the uncovered data classes. The proposed model captures important details of connectivity patterns over the vertex-edge dynamics evolution, in contrast to the previous approaches, which focused on only vertex or only edge dynamics. Computer simulations reveal that the new model can identify nonlinear features in both real and artificial data, including boundaries between distinct classes and overlapping structures of data.

On the number of different dynamics in Boolean networks with deterministic update schedules.

Science.gov (United States)

Aracena, J; Demongeot, J; Fanchon, E; Montalva, M

2013-04-01

Deterministic Boolean networks are a type of discrete dynamical systems widely used in the modeling of genetic networks. The dynamics of such systems is characterized by the local activation functions and the update schedule, i.e., the order in which the nodes are updated. In this paper, we address the problem of knowing the different dynamics of a Boolean network when the update schedule is changed. We begin by proving that the problem of the existence of a pair of update schedules with different dynamics is NP-complete. However, we show that certain structural properties of the interaction diagraph are sufficient for guaranteeing distinct dynamics of a network. In [1] the authors define equivalence classes which have the property that all the update schedules of a given class yield the same dynamics. In order to determine the dynamics associated to a network, we develop an algorithm to efficiently enumerate the above equivalence classes by selecting a representative update schedule for each class with a minimum number of blocks. Finally, we run this algorithm on the well known Arabidopsis thaliana network to determine the full spectrum of its different dynamics. Copyright © 2013 Elsevier Inc. All rights reserved.

Solving Sparse Polynomial Optimization Problems with Chordal Structure Using the Sparse, Bounded-Degree Sum-of-Squares Hierarchy

NARCIS (Netherlands)

Marandi, Ahmadreza; de Klerk, Etienne; Dahl, Joachim

The sparse bounded degree sum-of-squares (sparse-BSOS) hierarchy of Weisser, Lasserre and Toh [arXiv:1607.01151,2016] constructs a sequence of lower bounds for a sparse polynomial optimization problem. Under some assumptions, it is proven by the authors that the sequence converges to the optimal

Fractional quantum mechanics on networks: Long-range dynamics and quantum transport.

Science.gov (United States)

Riascos, A P; Mateos, José L

2015-11-01

In this paper we study the quantum transport on networks with a temporal evolution governed by the fractional Schrödinger equation. We generalize the dynamics based on continuous-time quantum walks, with transitions to nearest neighbors on the network, to the fractional case that allows long-range displacements. By using the fractional Laplacian matrix of a network, we establish a formalism that combines a long-range dynamics with the quantum superposition of states; this general approach applies to any type of connected undirected networks, including regular, random, and complex networks, and can be implemented from the spectral properties of the Laplacian matrix. We study the fractional dynamics and its capacity to explore the network by means of the transition probability, the average probability of return, and global quantities that characterize the efficiency of this quantum process. As a particular case, we explore analytically these quantities for circulant networks such as rings, interacting cycles, and complete graphs.

New sparse matrix solver in the KIKO3D 3-dimensional reactor dynamics code

International Nuclear Information System (INIS)

Panka, I.; Kereszturi, A.; Hegedus, C.

2005-01-01

The goal of this paper is to present a more effective method Bi-CGSTAB for accelerating the large sparse matrix equation solution in the KIKO3D code. This equation system is obtained by using the factorization of the improved quasi static (IQS) method for the time dependent nodal kinetic equations. In the old methodology standard large sparse matrix techniques were considered, where Gauss-Seidel preconditioning and a GMRES-type solver were applied. The validation of KIKO3D using Bi-CGSTAB has been performed by solving of a VVER-1000 kinetic benchmark problem. Additionally, the convergence characteristics were investigated in given macro time steps of Control Rod Ejection transients. The results have been obtained by the old GMRES and new Bi-CGSTAB methods are compared. (author)

Practical synchronization on complex dynamical networks via optimal pinning control

Science.gov (United States)

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

2015-07-01

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

Dynamics of Moment Neuronal Networks with Intra- and Inter-Interactions

Directory of Open Access Journals (Sweden)

Xuyan Xiang

2015-01-01

Full Text Available A framework of moment neuronal networks with intra- and inter-interactions is presented. It is to show how the spontaneous activity is propagated across the homogeneous and heterogeneous network. The input-output firing relationship and the stability are first explored for a homogeneous network. For heterogeneous network without the constraint of the correlation coefficients between neurons, a more sophisticated dynamics is then explored. With random interactions, the network gets easily synchronized. However, desynchronization is produced by a lateral interaction such as Mexico hat function. It is the external intralayer input unit that offers a more sophisticated and unexpected dynamics over the predecessors. Hence, the work further opens up the possibility of carrying out a stochastic computation in neuronal networks.

Dynamic burstiness of word-occurrence and network modularity in textbook systems

Science.gov (United States)

Cui, Xue-Mei; Yoon, Chang No; Youn, Hyejin; Lee, Sang Hoon; Jung, Jean S.; Han, Seung Kee

2017-12-01

We show that the dynamic burstiness of word occurrence in textbook systems is attributed to the modularity of the word association networks. At first, a measure of dynamic burstiness is introduced to quantify burstiness of word occurrence in a textbook. The advantage of this measure is that the dynamic burstiness is decomposable into two contributions: one coming from the inter-event variance and the other from the memory effects. Comparing network structures of physics textbook systems with those of surrogate random textbooks without the memory or variance effects are absent, we show that the network modularity increases systematically with the dynamic burstiness. The intra-connectivity of individual word representing the strength of a tie with which a node is bound to a module accordingly increases with the dynamic burstiness, suggesting individual words with high burstiness are strongly bound to one module. Based on the frequency and dynamic burstiness, physics terminology is classified into four categories: fundamental words, topical words, special words, and common words. In addition, we test the correlation between the dynamic burstiness of word occurrence and network modularity using a two-state model of burst generation.

Non-homogeneous dynamic Bayesian networks for continuous data

NARCIS (Netherlands)

Grzegorczyk, Marco; Husmeier, Dirk

Classical dynamic Bayesian networks (DBNs) are based on the homogeneous Markov assumption and cannot deal with non-homogeneous temporal processes. Various approaches to relax the homogeneity assumption have recently been proposed. The present paper presents a combination of a Bayesian network with

Epidemic dynamics and endemic states in complex networks

OpenAIRE

Pastor-Satorras, Romualdo; Vespignani, Alessandro

2001-01-01

We study by analytical methods and large scale simulations a dynamical model for the spreading of epidemics in complex networks. In networks with exponentially bounded connectivity we recover the usual epidemic behavior with a threshold defining a critical point below which the infection prevalence is null. On the contrary, on a wide range of scale-free networks we observe the absence of an epidemic threshold and its associated critical behavior. This implies that scale-free networks are pron...

Dynamic photonic lightpaths in the StarPlane network

NARCIS (Netherlands)

Grosso, P.; Marchal, D.; Maassen, J.; Bernier, E.; Xu, L.; de Laat, C.

2009-01-01

The StarPlane project enables users to dynamically control network photonic paths. Applications running on the Distributed ASCI Supercomputer (DAS-3) can manipulate wavelengths in the Dutch research and education network SURFnet6. The goal is to achieve fast switching times so that when the

Information Dynamics as Foundation for Network Management

Science.gov (United States)

2014-12-04

developed to adapt to channel dynamics in a mobile network environment. We devise a low- complexity online scheduling algorithm integrated with the...has been accepted for the Journal on Network and Systems Management in 2014. - RINC programmable platform for Infrastructure -as-a-Service public... backend servers. Rather than implementing load balancing in dedicated appliances, commodity SDN switches can perform this function. We design

Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks

Directory of Open Access Journals (Sweden)

Liang Jinghang

2012-08-01

Full Text Available Abstract Background Various computational models have been of interest due to their use in the modelling of gene regulatory networks (GRNs. As a logical model, probabilistic Boolean networks (PBNs consider molecular and genetic noise, so the study of PBNs provides significant insights into the understanding of the dynamics of GRNs. This will ultimately lead to advances in developing therapeutic methods that intervene in the process of disease development and progression. The applications of PBNs, however, are hindered by the complexities involved in the computation of the state transition matrix and the steady-state distribution of a PBN. For a PBN with n genes and N Boolean networks, the complexity to compute the state transition matrix is O(nN22n or O(nN2n for a sparse matrix. Results This paper presents a novel implementation of PBNs based on the notions of stochastic logic and stochastic computation. This stochastic implementation of a PBN is referred to as a stochastic Boolean network (SBN. An SBN provides an accurate and efficient simulation of a PBN without and with random gene perturbation. The state transition matrix is computed in an SBN with a complexity of O(nL2n, where L is a factor related to the stochastic sequence length. Since the minimum sequence length required for obtaining an evaluation accuracy approximately increases in a polynomial order with the number of genes, n, and the number of Boolean networks, N, usually increases exponentially with n, L is typically smaller than N, especially in a network with a large number of genes. Hence, the computational efficiency of an SBN is primarily limited by the number of genes, but not directly by the total possible number of Boolean networks. Furthermore, a time-frame expanded SBN enables an efficient analysis of the steady-state distribution of a PBN. These findings are supported by the simulation results of a simplified p53 network, several randomly generated networks and a

Spatiotemporal neural network dynamics for the processing of dynamic facial expressions

Science.gov (United States)

Sato, Wataru; Kochiyama, Takanori; Uono, Shota

2015-01-01

The dynamic facial expressions of emotion automatically elicit multifaceted psychological activities; however, the temporal profiles and dynamic interaction patterns of brain activities remain unknown. We investigated these issues using magnetoencephalography. Participants passively observed dynamic facial expressions of fear and happiness, or dynamic mosaics. Source-reconstruction analyses utilizing functional magnetic-resonance imaging data revealed higher activation in broad regions of the bilateral occipital and temporal cortices in response to dynamic facial expressions than in response to dynamic mosaics at 150–200 ms and some later time points. The right inferior frontal gyrus exhibited higher activity for dynamic faces versus mosaics at 300–350 ms. Dynamic causal-modeling analyses revealed that dynamic faces activated the dual visual routes and visual–motor route. Superior influences of feedforward and feedback connections were identified before and after 200 ms, respectively. These results indicate that hierarchical, bidirectional neural network dynamics within a few hundred milliseconds implement the processing of dynamic facial expressions. PMID:26206708

Spatiotemporal neural network dynamics for the processing of dynamic facial expressions.

Science.gov (United States)

Sato, Wataru; Kochiyama, Takanori; Uono, Shota

2015-07-24

The dynamic facial expressions of emotion automatically elicit multifaceted psychological activities; however, the temporal profiles and dynamic interaction patterns of brain activities remain unknown. We investigated these issues using magnetoencephalography. Participants passively observed dynamic facial expressions of fear and happiness, or dynamic mosaics. Source-reconstruction analyses utilizing functional magnetic-resonance imaging data revealed higher activation in broad regions of the bilateral occipital and temporal cortices in response to dynamic facial expressions than in response to dynamic mosaics at 150-200 ms and some later time points. The right inferior frontal gyrus exhibited higher activity for dynamic faces versus mosaics at 300-350 ms. Dynamic causal-modeling analyses revealed that dynamic faces activated the dual visual routes and visual-motor route. Superior influences of feedforward and feedback connections were identified before and after 200 ms, respectively. These results indicate that hierarchical, bidirectional neural network dynamics within a few hundred milliseconds implement the processing of dynamic facial expressions.

Inferring the physical connectivity of complex networks from their functional dynamics

Directory of Open Access Journals (Sweden)

Holm Liisa

2010-05-01

Full Text Available Abstract Background Biological networks, such as protein-protein interactions, metabolic, signalling, transcription-regulatory networks and neural synapses, are representations of large-scale dynamic systems. The relationship between the network structure and functions remains one of the central problems in current multidisciplinary research. Significant progress has been made toward understanding the implication of topological features for the network dynamics and functions, especially in biological networks. Given observations of a network system's behaviours or measurements of its functional dynamics, what can we conclude of the details of physical connectivity of the underlying structure? Results We modelled the network system by employing a scale-free network of coupled phase oscillators. Pairwise phase coherence (PPC was calculated for all the pairs of oscillators to present functional dynamics induced by the system. At the regime of global incoherence, we observed a Significant pairwise synchronization only between two nodes that are physically connected. Right after the onset of global synchronization, disconnected nodes begin to oscillate in a correlated fashion and the PPC of two nodes, either connected or disconnected, depends on their degrees. Based on the observation of PPCs, we built a weighted network of synchronization (WNS, an all-to-all functionally connected network where each link is weighted by the PPC of two oscillators at the ends of the link. In the regime of strong coupling, we observed a Significant similarity in the organization of WNSs induced by systems sharing the same substrate network but different configurations of initial phases and intrinsic frequencies of oscillators. We reconstruct physical network from the WNS by choosing the links whose weights are higher than a given threshold. We observed an optimal reconstruction just before the onset of global synchronization. Finally, we correlated the topology of the

A Service-Oriented Approach for Dynamic Chaining of Virtual Network Functions over Multi-Provider Software-Defined Networks

Directory of Open Access Journals (Sweden)

Barbara Martini

2016-06-01

Full Text Available Emerging technologies such as Software-Defined Networks (SDN and Network Function Virtualization (NFV promise to address cost reduction and flexibility in network operation while enabling innovative network service delivery models. However, operational network service delivery solutions still need to be developed that actually exploit these technologies, especially at the multi-provider level. Indeed, the implementation of network functions as software running over a virtualized infrastructure and provisioned on a service basis let one envisage an ecosystem of network services that are dynamically and flexibly assembled by orchestrating Virtual Network Functions even across different provider domains, thereby coping with changeable user and service requirements and context conditions. In this paper we propose an approach that adopts Service-Oriented Architecture (SOA technology-agnostic architectural guidelines in the design of a solution for orchestrating and dynamically chaining Virtual Network Functions. We discuss how SOA, NFV, and SDN may complement each other in realizing dynamic network function chaining through service composition specification, service selection, service delivery, and placement tasks. Then, we describe the architecture of a SOA-inspired NFV orchestrator, which leverages SDN-based network control capabilities to address an effective delivery of elastic chains of Virtual Network Functions. Preliminary results of prototype implementation and testing activities are also presented. The benefits for Network Service Providers are also described that derive from the adaptive network service provisioning in a multi-provider environment through the orchestration of computing and networking services to provide end users with an enhanced service experience.

Modular networks with delayed coupling: Synchronization and frequency control

Science.gov (United States)

Maslennikov, Oleg V.; Nekorkin, Vladimir I.

2014-07-01

We study the collective dynamics of modular networks consisting of map-based neurons which generate irregular spike sequences. Three types of intramodule topology are considered: a random Erdös-Rényi network, a small-world Watts-Strogatz network, and a scale-free Barabási-Albert network. The interaction between the neurons of different modules is organized by relatively sparse connections with time delay. For all the types of the network topology considered, we found that with increasing delay two regimes of module synchronization alternate with each other: inphase and antiphase. At the same time, the average rate of collective oscillations decreases within each of the time-delay intervals corresponding to a particular synchronization regime. A dual role of the time delay is thus established: controlling a synchronization mode and degree and controlling an average network frequency. Furthermore, we investigate the influence on the modular synchronization by other parameters: the strength of intermodule coupling and the individual firing rate.

Bayesian Inference Methods for Sparse Channel Estimation

DEFF Research Database (Denmark)

Pedersen, Niels Lovmand

2013-01-01

This thesis deals with sparse Bayesian learning (SBL) with application to radio channel estimation. As opposed to the classical approach for sparse signal representation, we focus on the problem of inferring complex signals. Our investigations within SBL constitute the basis for the development...... of Bayesian inference algorithms for sparse channel estimation. Sparse inference methods aim at finding the sparse representation of a signal given in some overcomplete dictionary of basis vectors. Within this context, one of our main contributions to the field of SBL is a hierarchical representation...... analysis of the complex prior representation, where we show that the ability to induce sparse estimates of a given prior heavily depends on the inference method used and, interestingly, whether real or complex variables are inferred. We also show that the Bayesian estimators derived from the proposed...

Technical innovation in dynamic contrast-enhanced magnetic resonance imaging of musculoskeletal tumors: an MR angiographic sequence using a sparse k-space sampling strategy.

Science.gov (United States)

Fayad, Laura M; Mugera, Charles; Soldatos, Theodoros; Flammang, Aaron; del Grande, Filippo

2013-07-01

We demonstrate the clinical use of an MR angiography sequence performed with sparse k-space sampling (MRA), as a method for dynamic contrast-enhanced (DCE)-MRI, and apply it to the assessment of sarcomas for treatment response. Three subjects with sarcomas (2 with osteosarcoma, 1 with high-grade soft tissue sarcomas) underwent MRI after neoadjuvant therapy/prior to surgery, with conventional MRI (T1-weighted, fluid-sensitive, static post-contrast T1-weighted sequences) and DCE-MRI (MRA, time resolution = 7-10 s, TR/TE 2.4/0.9 ms, FOV 40 cm(2)). Images were reviewed by two observers in consensus who recorded image quality (1 = diagnostic, no significant artifacts, 2 = diagnostic, 75 % with good response, >75 % with poor response). DCE-MRI findings were concordant with histological response (arterial enhancement with poor response, no arterial enhancement with good response). Unlike conventional DCE-MRI sequences, an MRA sequence with sparse k-space sampling is easily integrated into a routine musculoskeletal tumor MRI protocol, with high diagnostic quality. In this preliminary work, tumor enhancement characteristics by DCE-MRI were used to assess treatment response.

Coupled disease-behavior dynamics on complex networks: A review

Science.gov (United States)

Wang, Zhen; Andrews, Michael A.; Wu, Zhi-Xi; Wang, Lin; Bauch, Chris T.

2015-12-01

It is increasingly recognized that a key component of successful infection control efforts is understanding the complex, two-way interaction between disease dynamics and human behavioral and social dynamics. Human behavior such as contact precautions and social distancing clearly influence disease prevalence, but disease prevalence can in turn alter human behavior, forming a coupled, nonlinear system. Moreover, in many cases, the spatial structure of the population cannot be ignored, such that social and behavioral processes and/or transmission of infection must be represented with complex networks. Research on studying coupled disease-behavior dynamics in complex networks in particular is growing rapidly, and frequently makes use of analysis methods and concepts from statistical physics. Here, we review some of the growing literature in this area. We contrast network-based approaches to homogeneous-mixing approaches, point out how their predictions differ, and describe the rich and often surprising behavior of disease-behavior dynamics on complex networks, and compare them to processes in statistical physics. We discuss how these models can capture the dynamics that characterize many real-world scenarios, thereby suggesting ways that policy makers can better design effective prevention strategies. We also describe the growing sources of digital data that are facilitating research in this area. Finally, we suggest pitfalls which might be faced by researchers in the field, and we suggest several ways in which the field could move forward in the coming years.

Learning automaton newtork and its dynamics. Gakushu automaton network to sono dynamics

Energy Technology Data Exchange (ETDEWEB)

Quan, F [Hiroshima-Denki Institute of Technology, Hiroshima (Jpaan); Unno, F; Hirata, H [Chiba Univ., Chiba (Japan)

1991-10-20

In order to construct a distributed processing system having learning automata as autonomous elements, a reinforcement learning network of the automaton is proposed and it{prime}s dynamics is investigated. In this paper, it is attempted to add another level of meaning to computational cooperativity by using a reinforcement learning network with generalized leaning automata. The collection of learning automata in the team situation acts as self-interested agents that work toward improving their performance with respect to their individual preference ordering. In the global state space of the network, the case of partially synchronous stochastic process is considered. In this case, the existence of mean field is shown and a reinforcement learning algorithm which can make the dynamics on the average reinforcement trajectory is presented. This algorithm is shown to have a high convergence speed as a result of a simple experiment. 14 refs., 9 figs.

Matrix product algorithm for stochastic dynamics on networks applied to nonequilibrium Glauber dynamics

Science.gov (United States)

Barthel, Thomas; De Bacco, Caterina; Franz, Silvio

2018-01-01

We introduce and apply an efficient method for the precise simulation of stochastic dynamical processes on locally treelike graphs. Networks with cycles are treated in the framework of the cavity method. Such models correspond, for example, to spin-glass systems, Boolean networks, neural networks, or other technological, biological, and social networks. Building upon ideas from quantum many-body theory, our approach is based on a matrix product approximation of the so-called edge messages—conditional probabilities of vertex variable trajectories. Computation costs and accuracy can be tuned by controlling the matrix dimensions of the matrix product edge messages (MPEM) in truncations. In contrast to Monte Carlo simulations, the algorithm has a better error scaling and works for both single instances as well as the thermodynamic limit. We employ it to examine prototypical nonequilibrium Glauber dynamics in the kinetic Ising model. Because of the absence of cancellation effects, observables with small expectation values can be evaluated accurately, allowing for the study of decay processes and temporal correlations.

Complete synchronization on multi-layer center dynamical networks

International Nuclear Information System (INIS)

Liu Meng; Shao Yingying; Fu Xinchu

2009-01-01

In this paper, complete synchronization of three-layer center networks is studied. By using linear stability analysis approach, several different coupling schemes of three-layer center networks with the Logistic map local dynamics are discussed, and the stability conditions for synchronization are illustrated via some examples.

Power Aware Dynamic Provisioning of HPC Networks

Energy Technology Data Exchange (ETDEWEB)

Groves, Taylor [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Grant, Ryan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

2015-10-01

Future exascale systems are under increased pressure to find power savings. The network, while it consumes a considerable amount of power is often left out of the picture when discussing total system power. Even when network power is being considered, the references are frequently a decade or older and rely on models that lack validation on modern inter- connects. In this work we explore how dynamic mechanisms of an Infiniband network save power and at what granularity we can engage these features. We explore this within the context of the host controller adapter (HCA) on the node and for the fabric, i.e. switches, using three different mechanisms of dynamic link width, frequency and disabling of links for QLogic and Mellanox systems. Our results show that while there is some potential for modest power savings, real world systems need to improved responsiveness to adjustments in order to fully leverage these savings. This page intentionally left blank.

Mean-field approximations of fixation time distributions of evolutionary game dynamics on graphs

Science.gov (United States)

Ying, Li-Min; Zhou, Jie; Tang, Ming; Guan, Shu-Guang; Zou, Yong

2018-02-01

The mean fixation time is often not accurate for describing the timescales of fixation probabilities of evolutionary games taking place on complex networks. We simulate the game dynamics on top of complex network topologies and approximate the fixation time distributions using a mean-field approach. We assume that there are two absorbing states. Numerically, we show that the mean fixation time is sufficient in characterizing the evolutionary timescales when network structures are close to the well-mixing condition. In contrast, the mean fixation time shows large inaccuracies when networks become sparse. The approximation accuracy is determined by the network structure, and hence by the suitability of the mean-field approach. The numerical results show good agreement with the theoretical predictions.

Advanced models of neural networks nonlinear dynamics and stochasticity in biological neurons

CERN Document Server

Rigatos, Gerasimos G

2015-01-01

This book provides a complete study on neural structures exhibiting nonlinear and stochastic dynamics, elaborating on neural dynamics by introducing advanced models of neural networks. It overviews the main findings in the modelling of neural dynamics in terms of electrical circuits and examines their stability properties with the use of dynamical systems theory. It is suitable for researchers and postgraduate students engaged with neural networks and dynamical systems theory.

Dynamic Relaying in 3GPP LTE-Advanced Networks

Directory of Open Access Journals (Sweden)

Van Phan Vinh

2009-01-01

Full Text Available Relaying is one of the proposed technologies for LTE-Advanced networks. In order to enable a flexible and reliable relaying support, the currently adopted architectural structure of LTE networks has to be modified. In this paper, we extend the LTE architecture to enable dynamic relaying, while maintaining backward compatibility with LTE Release 8 user equipments, and without limiting the flexibility and reliability expected from relaying. With dynamic relaying, relays can be associated with base stations on a need basis rather than in a fixed manner which is based only on initial radio planning. Proposals are also given on how to further improve a relay enhanced LTE network by enabling multiple interfaces between the relay nodes and their controlling base stations, which can possibly be based on technologies different from LTE, so that load balancing can be realized. This load balancing can be either between different base stations or even between different networks.

Dynamic thermo-hydraulic model of district cooling networks

International Nuclear Information System (INIS)

Oppelt, Thomas; Urbaneck, Thorsten; Gross, Ulrich; Platzer, Bernd

2016-01-01

Highlights: • A dynamic thermo-hydraulic model for district cooling networks is presented. • The thermal modelling is based on water segment tracking (Lagrangian approach). • Thus, numerical errors and balance inaccuracies are avoided. • Verification and validation studies proved the reliability of the model. - Abstract: In the present paper, the dynamic thermo-hydraulic model ISENA is presented which can be applied for answering different questions occurring in design and operation of district cooling networks—e.g. related to economic and energy efficiency. The network model consists of a quasistatic hydraulic model and a transient thermal model based on tracking water segments through the whole network (Lagrangian method). Applying this approach, numerical errors and balance inaccuracies can be avoided which leads to a higher quality of results compared to other network models. Verification and validation calculations are presented in order to show that ISENA provides reliable results and is suitable for practical application.

Dynamical networks with topological self-organization

Science.gov (United States)

Zak, M.

2001-01-01

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

Mapping visual stimuli to perceptual decisions via sparse decoding of mesoscopic neural activity.

Science.gov (United States)

Sajda, Paul

2010-01-01

In this talk I will describe our work investigating sparse decoding of neural activity, given a realistic mapping of the visual scene to neuronal spike trains generated by a model of primary visual cortex (V1). We use a linear decoder which imposes sparsity via an L1 norm. The decoder can be viewed as a decoding neuron (linear summation followed by a sigmoidal nonlinearity) in which there are relatively few non-zero synaptic weights. We find: (1) the best decoding performance is for a representation that is sparse in both space and time, (2) decoding of a temporal code results in better performance than a rate code and is also a better fit to the psychophysical data, (3) the number of neurons required for decoding increases monotonically as signal-to-noise in the stimulus decreases, with as little as 1% of the neurons required for decoding at the highest signal-to-noise levels, and (4) sparse decoding results in a more accurate decoding of the stimulus and is a better fit to psychophysical performance than a distributed decoding, for example one imposed by an L2 norm. We conclude that sparse coding is well-justified from a decoding perspective in that it results in a minimum number of neurons and maximum accuracy when sparse representations can be decoded from the neural dynamics.

Bistable responses in bacterial genetic networks: Designs and dynamical consequences

Science.gov (United States)

Tiwari, Abhinav; Ray, J. Christian J.; Narula, Jatin; Igoshin, Oleg A.

2011-01-01

A key property of living cells is their ability to react to stimuli with specific biochemical responses. These responses can be understood through the dynamics of underlying biochemical and genetic networks. Evolutionary design principles have been well studied in networks that display graded responses, with a continuous relationship between input signal and system output. Alternatively, biochemical networks can exhibit bistable responses so that over a range of signals the network possesses two stable steady states. In this review, we discuss several conceptual examples illustrating network designs that can result in a bistable response of the biochemical network. Next, we examine manifestations of these designs in bacterial master-regulatory genetic circuits. In particular, we discuss mechanisms and dynamic consequences of bistability in three circuits: two-component systems, sigma-factor networks, and a multistep phosphorelay. Analyzing these examples allows us to expand our knowledge of evolutionary design principles for networks with bistable responses. PMID:21385588

When sparse coding meets ranking: a joint framework for learning sparse codes and ranking scores

KAUST Repository

Wang, Jim Jing-Yan; Cui, Xuefeng; Yu, Ge; Guo, Lili; Gao, Xin

2017-01-01

Sparse coding, which represents a data point as a sparse reconstruction code with regard to a dictionary, has been a popular data representation method. Meanwhile, in database retrieval problems, learning the ranking scores from data points plays

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

Science.gov (United States)

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

Maritime piracy situation modelling with dynamic Bayesian networks

CSIR Research Space (South Africa)

Dabrowski, James M

2015-05-01

Full Text Available A generative model for modelling maritime vessel behaviour is proposed. The model is a novel variant of the dynamic Bayesian network (DBN). The proposed DBN is in the form of a switching linear dynamic system (SLDS) that has been extended into a...

The simplest problem in the collective dynamics of neural networks: is synchrony stable?

International Nuclear Information System (INIS)

Timme, Marc; Wolf, Fred

2008-01-01

For spiking neural networks we consider the stability problem of global synchrony, arguably the simplest non-trivial collective dynamics in such networks. We find that even this simplest dynamical problem—local stability of synchrony—is non-trivial to solve and requires novel methods for its solution. In particular, the discrete mode of pulsed communication together with the complicated connectivity of neural interaction networks requires a non-standard approach. The dynamics in the vicinity of the synchronous state is determined by a multitude of linear operators, in contrast to a single stability matrix in conventional linear stability theory. This unusual property qualitatively depends on network topology and may be neglected for globally coupled homogeneous networks. For generic networks, however, the number of operators increases exponentially with the size of the network. We present methods to treat this multi-operator problem exactly. First, based on the Gershgorin and Perron–Frobenius theorems, we derive bounds on the eigenvalues that provide important information about the synchronization process but are not sufficient to establish the asymptotic stability or instability of the synchronous state. We then present a complete analysis of asymptotic stability for topologically strongly connected networks using simple graph-theoretical considerations. For inhibitory interactions between dissipative (leaky) oscillatory neurons the synchronous state is stable, independent of the parameters and the network connectivity. These results indicate that pulse-like interactions play a profound role in network dynamical systems, and in particular in the dynamics of biological synchronization, unless the coupling is homogeneous and all-to-all. The concepts introduced here are expected to also facilitate the exact analysis of more complicated dynamical network states, for instance the irregular balanced activity in cortical neural networks

Modeling Networks and Dynamics in Complex Systems: from Nano-Composites to Opinion Formation

Science.gov (United States)

Shi, Feng

Complex networks are ubiquitous in systems of physical, biological, social or technological origin. Components in those systems range from as large as cities in power grids, to as small as molecules in metabolic networks. Since the dawn of network science, significant attention has focused on the implications of dynamics in establishing network structure and the impact of structural properties on dynamics on those networks. The first part of the thesis follows this direction, studying the network formed by conductive nanorods in nano-materials, and focuses on the electrical response of the composite to the structure change of the network. New scaling laws for the shear-induced anisotropic percolation are introduced and a robust exponential tail of the current distribution across the network is identified. These results are relevant especially to "active" composite materials where materials are exposed to mechanical loading and strain deformations. However, in many real-world networks the evolution of the network topology is tied to the states of the vertices and vice versa. Networks that exhibit such a feedback are called adaptive or coevolutionary networks. The second part of the thesis examines two closely related variants of a simple, abstract model for coevolution of a network and the opinions of its members. As a representative model for adaptive networks, it displays the feature of self-organization of the system into a stable configuration due to the interplay between the network topology and the dynamics on the network. This simple model yields interesting dynamics and the slight change in the rewiring strategy results in qualitatively different behaviors of the system. In conclusion, the dissertation aims to develop new network models and tools which enable insights into the structure and dynamics of various systems, and seeks to advance network algorithms which provide approaches to coherently articulated questions in real-world complex systems such as

Improved Sparse Channel Estimation for Cooperative Communication Systems

Directory of Open Access Journals (Sweden)

Guan Gui

2012-01-01

Full Text Available Accurate channel state information (CSI is necessary at receiver for coherent detection in amplify-and-forward (AF cooperative communication systems. To estimate the channel, traditional methods, that is, least squares (LS and least absolute shrinkage and selection operator (LASSO, are based on assumptions of either dense channel or global sparse channel. However, LS-based linear method neglects the inherent sparse structure information while LASSO-based sparse channel method cannot take full advantage of the prior information. Based on the partial sparse assumption of the cooperative channel model, we propose an improved channel estimation method with partial sparse constraint. At first, by using sparse decomposition theory, channel estimation is formulated as a compressive sensing problem. Secondly, the cooperative channel is reconstructed by LASSO with partial sparse constraint. Finally, numerical simulations are carried out to confirm the superiority of proposed methods over global sparse channel estimation methods.

SI infection on a dynamic partnership network : characterization of R0

NARCIS (Netherlands)

Leung, Ka Yin; Kretzschmar, MEE; Diekmann, Odo

We model the spread of an SI (Susceptible → Infectious) sexually transmitted infection on a dynamic homosexual network. The network consists of individuals with a dynamically varying number of partners. There is demographic turnover due to individuals entering the population at a constant rate and

Sparse Image Reconstruction in Computed Tomography

DEFF Research Database (Denmark)

Jørgensen, Jakob Sauer

In recent years, increased focus on the potentially harmful effects of x-ray computed tomography (CT) scans, such as radiation-induced cancer, has motivated research on new low-dose imaging techniques. Sparse image reconstruction methods, as studied for instance in the field of compressed sensing...... applications. This thesis takes a systematic approach toward establishing quantitative understanding of conditions for sparse reconstruction to work well in CT. A general framework for analyzing sparse reconstruction methods in CT is introduced and two sets of computational tools are proposed: 1...... contributions to a general set of computational characterization tools. Thus, the thesis contributions help advance sparse reconstruction methods toward routine use in...

Firing rate dynamics in recurrent spiking neural networks with intrinsic and network heterogeneity.

Science.gov (United States)

Ly, Cheng

2015-12-01

Heterogeneity of neural attributes has recently gained a lot of attention and is increasing recognized as a crucial feature in neural processing. Despite its importance, this physiological feature has traditionally been neglected in theoretical studies of cortical neural networks. Thus, there is still a lot unknown about the consequences of cellular and circuit heterogeneity in spiking neural networks. In particular, combining network or synaptic heterogeneity and intrinsic heterogeneity has yet to be considered systematically despite the fact that both are known to exist and likely have significant roles in neural network dynamics. In a canonical recurrent spiking neural network model, we study how these two forms of heterogeneity lead to different distributions of excitatory firing rates. To analytically characterize how these types of heterogeneities affect the network, we employ a dimension reduction method that relies on a combination of Monte Carlo simulations and probability density function equations. We find that the relationship between intrinsic and network heterogeneity has a strong effect on the overall level of heterogeneity of the firing rates. Specifically, this relationship can lead to amplification or attenuation of firing rate heterogeneity, and these effects depend on whether the recurrent network is firing asynchronously or rhythmically firing. These observations are captured with the aforementioned reduction method, and furthermore simpler analytic descriptions based on this dimension reduction method are developed. The final analytic descriptions provide compact and descriptive formulas for how the relationship between intrinsic and network heterogeneity determines the firing rate heterogeneity dynamics in various settings.

Sparse Regression by Projection and Sparse Discriminant Analysis

KAUST Repository

Qi, Xin; Luo, Ruiyan; Carroll, Raymond J.; Zhao, Hongyu

2015-01-01

predictions. We introduce a new framework, regression by projection, and its sparse version to analyze high-dimensional data. The unique nature of this framework is that the directions of the regression coefficients are inferred first, and the lengths

Functional clustering in hippocampal cultures: relating network structure and dynamics

International Nuclear Information System (INIS)

Feldt, S; Dzakpasu, R; Olariu, E; Żochowski, M; Wang, J X; Shtrahman, E

2010-01-01

In this work we investigate the relationship between gross anatomic structural network properties, neuronal dynamics and the resultant functional structure in dissociated rat hippocampal cultures. Specifically, we studied cultures as they developed under two conditions: the first supporting glial cell growth (high glial group), and the second one inhibiting it (low glial group). We then compared structural network properties and the spatio-temporal activity patterns of the neurons. Differences in dynamics between the two groups could be linked to the impact of the glial network on the neuronal network as the cultures developed. We also implemented a recently developed algorithm called the functional clustering algorithm (FCA) to obtain the resulting functional network structure. We show that this new algorithm is useful for capturing changes in functional network structure as the networks evolve over time. The FCA detects changes in functional structure that are consistent with expected dynamical differences due to the impact of the glial network. Cultures in the high glial group show an increase in global synchronization as the cultures age, while those in the low glial group remain locally synchronized. We additionally use the FCA to quantify the amount of synchronization present in the cultures and show that the total level of synchronization in the high glial group is stronger than in the low glial group. These results indicate an interdependence between the glial and neuronal networks present in dissociated cultures

Successive lag synchronization on dynamical networks with communication delay

International Nuclear Information System (INIS)

Zhang Xin-Jian; Wei Ai-Ju; Li Ke-Zan

2016-01-01

In this paper, successive lag synchronization (SLS) on a dynamical network with communication delay is investigated. In order to achieve SLS on the dynamical network with communication delay, we design linear feedback control and adaptive control, respectively. By using the Lyapunov function method, we obtain some sufficient conditions for global stability of SLS. To verify these results, some numerical examples are further presented. This work may find potential applications in consensus of multi-agent systems. (paper)

Dynamic Network Logistic Regression: A Logistic Choice Analysis of Inter- and Intra-Group Blog Citation Dynamics in the 2004 US Presidential Election

OpenAIRE

Almquist, Zack W.; Butts, Carter T.

2013-01-01

Methods for analysis of network dynamics have seen great progress in the past decade. This article shows how Dynamic Network Logistic Regression techniques (a special case of the Temporal Exponential Random Graph Models) can be used to implement decision theoretic models for network dynamics in a panel data context. We also provide practical heuristics for model building and assessment. We illustrate the power of these techniques by applying them to a dynamic blog network sampled during the 2...