WorldWideScience

Sample records for meets network dynamics

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

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

  3. Dynamic ad hoc networks

    CERN Document Server

    Rashvand, Habib

    2013-01-01

    Motivated by the exciting new application paradigm of using amalgamated technologies of the Internet and wireless, the next generation communication networks (also called 'ubiquitous', 'complex' and 'unstructured' networking) are changing the way we develop and apply our future systems and services at home and on local, national and global scales. Whatever the interconnection - a WiMAX enabled networked mobile vehicle, MEMS or nanotechnology enabled distributed sensor systems, Vehicular Ad hoc Networking (VANET) or Mobile Ad hoc Networking (MANET) - all can be classified under new networking s

  4. Cognitive Dynamic Optical Networks

    DEFF Research Database (Denmark)

    de Miguel, Ignacio; Duran, Ramon J.; Lorenzo, Ruben M.

    2013-01-01

    Cognitive networks are a promising solution for the control of heterogeneous optical networks. We review their fundamentals as well as a number of applications developed in the framework of the EU FP7 CHRON project.......Cognitive networks are a promising solution for the control of heterogeneous optical networks. We review their fundamentals as well as a number of applications developed in the framework of the EU FP7 CHRON project....

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

  6. Cognitive Dynamic Optical Networks

    DEFF Research Database (Denmark)

    de Miguel, Ignacio; Duran, Ramon J.; Jimenez, Tamara

    2013-01-01

    The use of cognition is a promising element for the control of heterogeneous optical networks. Not only are cognitive networks able to sense current network conditions and act according to them, but they also take into account the knowledge acquired through past experiences; that is, they include...... learning with the aim of improving performance. In this paper, we review the fundamentals of cognitive networks and focus on their application to the optical networking area. In particular, a number of cognitive network architectures proposed so far, as well as their associated supporting technologies......, are reviewed. Moreover, several applications, mainly developed in the framework of the EU FP7 Cognitive Heterogeneous Reconfigurable Optical Network (CHRON) project, are also described....

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

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

  9. Innovative Governance Strategies in Meetings Destination Networks

    DEFF Research Database (Denmark)

    Gyimóthy, Szilvia; Larson, Mia

    2013-01-01

    Innovative Governance Strategies in Meetings Destination Networks Introduction, problem statement and aims of the study Collaborative regional networks has been long considered as a must in successful tourism development (Dredge & Jenkins 2003) owing to benefits such as scale and scope economics......, as well as joint planning and coordination of supply facilities. However, the setting up and governance of destination networks is paved with managerial challenges, including, among others: the balancing of conflicting stakeholder interest (Wilkinson & March 2008), and bridging over the gap between...... the bureaucratic culture of public administration and the marketing culture adopted by private tourism firms (Palmer 1996). This regional coordinating role must be undertaken in spite of limited ownership, budget or power to control how individual firms deliver (D’Angella & Go 2007). Furthermore, various actors...

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

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

  12. Dynamic Sensor Networks

    National Research Council Canada - National Science Library

    Schott, Brian

    2004-01-01

    ...: Declarative Languages and Execution Environment includes topographical soldier interface and a sensor network simulation environment for algorithm development, deployment planning, and operational support. Finally, Task 3...

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

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

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

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

  17. Dynamic wireless sensor networks

    CERN Document Server

    Oteafy, Sharief M A

    2014-01-01

    In this title, the authors leap into a novel paradigm of scalability and cost-effectiveness, on the basis of resource reuse. In a world with much abundance of wirelessly accessible devices, WSN deployments should capitalize on the resources already available in the region of deployment, and only augment it with the components required to meet new application requirements. However, if the required resources already exist in that region, WSN deployment converges to an assignment and scheduling scheme to accommodate for the new application given the existing resources. Such resources are polled

  18. Dynamics of associating networks

    Science.gov (United States)

    Tang, Shengchang; Habicht, Axel; Wang, Muzhou; Li, Shuaili; Seiffert, Sebastian; Olsen, Bradley

    Associating polymers offer important technological solutions to renewable and self-healing materials, conducting electrolytes for energy storage and transport, and vehicles for cell and protein deliveries. The interplay between polymer topologies and association chemistries warrants new interesting physics from associating networks, yet poses significant challenges to study these systems over a wide range of time and length scales. In a series of studies, we explored self-diffusion mechanisms of associating polymers above the percolation threshold, by combining experimental measurements using forced Rayleigh scattering and analytical insights from a two-state model. Despite the differences in molecular structures, a universal super-diffusion phenomenon is observed when diffusion of molecular species is hindered by dissociation kinetics. The molecular dissociation rate can be used to renormalize shear rheology data, which yields an unprecedented time-temperature-concentration superposition. The obtained shear rheology master curves provide experimental evidence of the relaxation hierarchy in associating networks.

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

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

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

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

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

  4. Anomaly Detection in Dynamic Networks

    Energy Technology Data Exchange (ETDEWEB)

    Turcotte, Melissa [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2014-10-14

    Anomaly detection in dynamic communication networks has many important security applications. These networks can be extremely large and so detecting any changes in their structure can be computationally challenging; hence, computationally fast, parallelisable methods for monitoring the network are paramount. For this reason the methods presented here use independent node and edge based models to detect locally anomalous substructures within communication networks. As a first stage, the aim is to detect changes in the data streams arising from node or edge communications. Throughout the thesis simple, conjugate Bayesian models for counting processes are used to model these data streams. A second stage of analysis can then be performed on a much reduced subset of the network comprising nodes and edges which have been identified as potentially anomalous in the first stage. The first method assumes communications in a network arise from an inhomogeneous Poisson process with piecewise constant intensity. Anomaly detection is then treated as a changepoint problem on the intensities. The changepoint model is extended to incorporate seasonal behavior inherent in communication networks. This seasonal behavior is also viewed as a changepoint problem acting on a piecewise constant Poisson process. In a static time frame, inference is made on this extended model via a Gibbs sampling strategy. In a sequential time frame, where the data arrive as a stream, a novel, fast Sequential Monte Carlo (SMC) algorithm is introduced to sample from the sequence of posterior distributions of the change points over time. A second method is considered for monitoring communications in a large scale computer network. The usage patterns in these types of networks are very bursty in nature and don’t fit a Poisson process model. For tractable inference, discrete time models are considered, where the data are aggregated into discrete time periods and probability models are fitted to the

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

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

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

  8. 4th IEA International CCS Regulatory Network Meeting

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    2012-07-01

    On 9 and 10 May 2012, the IEA International CCS Regulatory Network (Network), launched in Paris in May 2008 to provide a neutral forum for CCS regulators, policy makers and stakeholders to share updates and views on CCS regulatory developments, held its fourth meeting at the International Energy Agency (IEA) offices in Paris, France. The aim of the meeting was to: provide an update on government efforts to develop and implement carbon capture and storage (CCS) legal and regulatory frameworks; and consider ways in which governments are dealing with some of the more difficult or complex aspects of CCS regulation. This report summarises the proceedings of the meeting.

  9. Airborne Network Optimization with Dynamic Network Update

    Science.gov (United States)

    2015-03-26

    source si and a target ti . For each commodity (si, ki) the commodity specifies a non- negative demand di [5]. The objective of the multi-commodity...queue predictions, and network con- gestion [15]. The implementation of the DRQC uses the Kalman filter to predict the state of the network and optimize

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

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

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

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

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

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

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

  17. Annual Meeting of International Neural Network Society

    Science.gov (United States)

    1990-07-31

    Merrill, John and Port, Robert India;ia University Towards A Connectionist Model of Italian Morphology Arbitrio, Aiessandro Istituto Psicologia CNR & AI Lab...Connectionist Network Nolfi Stefano Fondazione Sigma Tau Parisi, Domenico Instituto di Psicologia C.N.R., Roma Decision Rules for Perception of Species

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

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

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

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

  2. International Code Centres Network. Summary Report of the Technical Meeting

    International Nuclear Information System (INIS)

    Chung, H-K.

    2011-01-01

    Fifteen international experts on computational aspects of atomic, molecular and particle surface interaction data for fusion energy research participated in the 2nd technical meeting of the International Code Centres Network. Participants reported their research on data production and computational capabilities at their institutions. Experts in the field of plasma modeling of magnetic fusion research joined this meeting to present the data needs and bring the perspective of data users. The interaction and discussion among data producers and data users in this two-day meeting led to an agreement that the scope and function of Code Centres Network should be reformulated to serve the needs of fusion community in more effective way. (author)

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

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

  5. Dynamics on Networks of Manifolds

    Science.gov (United States)

    DeVille, Lee; Lerman, Eugene

    2015-03-01

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

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

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

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

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

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

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

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

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

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

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

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

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

  18. Dynamic Protection of Optical Networks

    DEFF Research Database (Denmark)

    Ruepp, Sarah Renée

    2008-01-01

    This thesis deals with making optical networks resilient to failures. The recovery performance of path, segment and span restoration is evaluated in a network with limited wavelength conversion capability using both standard and enhanced wavelength assignment schemes. The enhanced wavelength...... stubs at the failure adjacent nodes. Both modifcations have a positive influence on the recovery percentage. The recovery enhancements are applicable in both single and multi-domain network environments. Stub release, where the still working parts of a failure affected connection are released prior...... of the modularity of capacity units is investigated for resilient network design. Different span upgrading strategies and algorithms for finding restoration paths are evaluated. Furthermore, the capacity effciency of constraining restoration requests for the same destination node to the same restoration path...

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

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

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

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

  3. Cardiac fluid dynamics meets deformation imaging.

    Science.gov (United States)

    Dal Ferro, Matteo; Stolfo, Davide; De Paris, Valerio; Lesizza, Pierluigi; Korcova, Renata; Collia, Dario; Tonti, Giovanni; Sinagra, Gianfranco; Pedrizzetti, Gianni

    2018-02-20

    Cardiac function is about creating and sustaining blood in motion. This is achieved through a proper sequence of myocardial deformation whose final goal is that of creating flow. Deformation imaging provided valuable contributions to understanding cardiac mechanics; more recently, several studies evidenced the existence of an intimate relationship between cardiac function and intra-ventricular fluid dynamics. This paper summarizes the recent advances in cardiac flow evaluations, highlighting its relationship with heart wall mechanics assessed through the newest techniques of deformation imaging and finally providing an opinion of the most promising clinical perspectives of this emerging field. It will be shown how fluid dynamics can integrate volumetric and deformation assessments to provide a further level of knowledge of cardiac mechanics.

  4. Traffic Dynamics of Computer Networks

    Science.gov (United States)

    Fekete, Attila

    2008-10-01

    Two important aspects of the Internet, namely the properties of its topology and the characteristics of its data traffic, have attracted growing attention of the physics community. My thesis has considered problems of both aspects. First I studied the stochastic behavior of TCP, the primary algorithm governing traffic in the current Internet, in an elementary network scenario consisting of a standalone infinite-sized buffer and an access link. The effect of the fast recovery and fast retransmission (FR/FR) algorithms is also considered. I showed that my model can be extended further to involve the effect of link propagation delay, characteristic of WAN. I continued my thesis with the investigation of finite-sized semi-bottleneck buffers, where packets can be dropped not only at the link, but also at the buffer. I demonstrated that the behavior of the system depends only on a certain combination of the parameters. Moreover, an analytic formula was derived that gives the ratio of packet loss rate at the buffer to the total packet loss rate. This formula makes it possible to treat buffer-losses as if they were link-losses. Finally, I studied computer networks from a structural perspective. I demonstrated through fluid simulations that the distribution of resources, specifically the link bandwidth, has a serious impact on the global performance of the network. Then I analyzed the distribution of edge betweenness in a growing scale-free tree under the condition that a local property, the in-degree of the "younger" node of an arbitrary edge, is known in order to find an optimum distribution of link capacity. The derived formula is exact even for finite-sized networks. I also calculated the conditional expectation of edge betweenness, rescaled for infinite networks.

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

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

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

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

  9. Hydrogen application dynamics and networks

    Energy Technology Data Exchange (ETDEWEB)

    Schmidt, E. [Air Liquide Large Industries, Champigny-sur-Marne (France)

    2010-12-30

    The Chemical Industry consumes large volumes of hydrogen as raw material for the manufacture of numerous products (e.g. polyamides and polyurethanes account for 60% of hydrogen demand). The hydrogen demand was in the recent past and will continue to be driven by the polyurethane family. China will host about 60% of new hydrogen needs over the period 2010-2015 becoming the first hydrogen market next year and reaching 25% of market share by 2015 (vs. only 4% in 2001). Air Liquide supplies large volumes of Hydrogen (and other Industrial Gases) to customers by on-site plants and through pipeline networks which offer significant benefits such as higher safety, reliability and flexibility of supply. Thanks to its long term strategy and heavy investment in large units and pipeline networks, Air Liquide is the Industrial Gas leader in most of the world class Petrochemical basins (Rotterdam, Antwerp, US Gulf Coast, Yosu, Caojing,..) (orig.)

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

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

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

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

  14. 77 FR 1779 - Meeting and Webinar on Integrated Dynamic Transit Operations; Notice of Public Meeting

    Science.gov (United States)

    2012-01-11

    ... of Public Meeting AGENCY: Research and Innovative Technology Administration, U.S. Department of... on concepts, opportunities, and needs for the Integrated Dynamic Transit Operations (IDTO) operational concept on January 26, 2012 from 1:30-4:30 p.m. and January 27, 2012 from 8:30 a.m. to 12:30 p.m...

  15. Meeting the memory challenges of brain-scale network simulation

    Directory of Open Access Journals (Sweden)

    Susanne eKunkel

    2012-01-01

    Full Text Available The development of high-performance simulation software is crucial for studying the brain connectome. Using connectome data to generate neurocomputational models requires software capable of coping with models on a variety of scales: from the microscale, investigating plasticity and dynamics of circuits in local networks, to the macroscale, investigating the interactions between distinct brain regions. Prior to any serious dynamical investigation, the first task of network simulations is to check the consistency of data integrated in the connectome and constrain ranges for yet unknown parameters. Thanks to distributed computing techniques, it is possible today to routinely simulate local cortical networks of around 10^5 neurons with up to 10^9 synapses on clusters and multi-processor shared-memory machines. However, brain-scale networks are one or two orders of magnitude larger than such local networks, in terms of numbers of neurons and synapses as well as in terms of computational load. Such networks have been studied in individual studies, but the underlying simulation technologies have neither been described in sufficient detail to be reproducible nor made publicly available. Here, we discover that as the network model sizes approach the regime of meso- and macroscale simulations, memory consumption on individual compute nodes becomes a critical bottleneck. This is especially relevant on modern supercomputers such as the Bluegene/P architecture where the available working memory per CPU core is rather limited. We develop a simple linear model to analyze the memory consumption of the constituent components of a neuronal simulator as a function of network size and the number of cores used. This approach has multiple benefits. The model enables identification of key contributing components to memory saturation and prediction of the effects of potential improvements to code before any implementation takes place.

  16. Spreading dynamics in complex networks

    Science.gov (United States)

    Pei, Sen; Makse, Hernán A.

    2013-12-01

    Searching for influential spreaders in complex networks is an issue of great significance for applications across various domains, ranging from epidemic control, innovation diffusion, viral marketing, and social movement to idea propagation. In this paper, we first display some of the most important theoretical models that describe spreading processes, and then discuss the problem of locating both the individual and multiple influential spreaders respectively. Recent approaches in these two topics are presented. For the identification of privileged single spreaders, we summarize several widely used centralities, such as degree, betweenness centrality, PageRank, k-shell, etc. We investigate the empirical diffusion data in a large scale online social community—LiveJournal. With this extensive dataset, we find that various measures can convey very distinct information of nodes. Of all the users in the LiveJournal social network, only a small fraction of them are involved in spreading. For the spreading processes in LiveJournal, while degree can locate nodes participating in information diffusion with higher probability, k-shell is more effective in finding nodes with a large influence. Our results should provide useful information for designing efficient spreading strategies in reality.

  17. Spreading dynamics in complex networks

    International Nuclear Information System (INIS)

    Pei, Sen; Makse, Hernán A

    2013-01-01

    Searching for influential spreaders in complex networks is an issue of great significance for applications across various domains, ranging from epidemic control, innovation diffusion, viral marketing, and social movement to idea propagation. In this paper, we first display some of the most important theoretical models that describe spreading processes, and then discuss the problem of locating both the individual and multiple influential spreaders respectively. Recent approaches in these two topics are presented. For the identification of privileged single spreaders, we summarize several widely used centralities, such as degree, betweenness centrality, PageRank, k-shell, etc. We investigate the empirical diffusion data in a large scale online social community—LiveJournal. With this extensive dataset, we find that various measures can convey very distinct information of nodes. Of all the users in the LiveJournal social network, only a small fraction of them are involved in spreading. For the spreading processes in LiveJournal, while degree can locate nodes participating in information diffusion with higher probability, k-shell is more effective in finding nodes with a large influence. Our results should provide useful information for designing efficient spreading strategies in reality. (paper)

  18. Synchronization of coupled chaotic dynamics on networks

    Indian Academy of Sciences (India)

    We review some recent work on the synchronization of coupled dynamical systems on a variety of networks. When nodes show synchronized behaviour, two interesting phenomena can be observed. First, there are some nodes of the floating type that show intermittent behaviour between getting attached to some clusters ...

  19. Modular networks with hierarchical organization: The dynamical ...

    Indian Academy of Sciences (India)

    Most of the complex systems seen in real life also have associated dynamics [10], and the ... another example, this time a hierarchical structure, viz., the Cayley tree with b ..... natural constraints operating on networks in real life, such as the ...

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

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

  2. Discerning connectivity from dynamics in climate networks

    Czech Academy of Sciences Publication Activity Database

    Paluš, Milan; Hartman, David; Hlinka, Jaroslav; Vejmelka, Martin

    2011-01-01

    Roč. 18, č. 5 (2011), s. 751-763 ISSN 1023-5809 R&D Projects: GA ČR GCP103/11/J068 Institutional research plan: CEZ:AV0Z10300504 Keywords : complex networks * climate dynamics * connectivity * North Atlantic Oscillation * solar activity Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 1.597, year: 2011

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

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

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

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

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

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

  9. Innovation networking between stability and political dynamics

    DEFF Research Database (Denmark)

    Koch, Christian

    2004-01-01

    of the contribution is to challenge and transcend these notions and develop an understanding of innovation networks as an interplay between stable and dynamic elements, where political processes in innovation are much more than a disruptive and even a counterproductive feature. It reviews the growing number...... of studies that highlight the political aspect of innovation. The paper reports on a study of innovation processes conducted within the EU—TSER-programme and a study made under the banner of management of technology. Intensive field studies in two constellations of enterprises were carried out. One......This contribution views innovation as a social activity of building networks, using software product development in multicompany alliances and networks as example. Innovation networks are frequently understood as quite stable arrangements characterised by high trust among the participants. The aim...

  10. Nonparametric inference of network structure and dynamics

    Science.gov (United States)

    Peixoto, Tiago P.

    The network structure of complex systems determine their function and serve as evidence for the evolutionary mechanisms that lie behind them. Despite considerable effort in recent years, it remains an open challenge to formulate general descriptions of the large-scale structure of network systems, and how to reliably extract such information from data. Although many approaches have been proposed, few methods attempt to gauge the statistical significance of the uncovered structures, and hence the majority cannot reliably separate actual structure from stochastic fluctuations. Due to the sheer size and high-dimensionality of many networks, this represents a major limitation that prevents meaningful interpretations of the results obtained with such nonstatistical methods. In this talk, I will show how these issues can be tackled in a principled and efficient fashion by formulating appropriate generative models of network structure that can have their parameters inferred from data. By employing a Bayesian description of such models, the inference can be performed in a nonparametric fashion, that does not require any a priori knowledge or ad hoc assumptions about the data. I will show how this approach can be used to perform model comparison, and how hierarchical models yield the most appropriate trade-off between model complexity and quality of fit based on the statistical evidence present in the data. I will also show how this general approach can be elegantly extended to networks with edge attributes, that are embedded in latent spaces, and that change in time. The latter is obtained via a fully dynamic generative network model, based on arbitrary-order Markov chains, that can also be inferred in a nonparametric fashion. Throughout the talk I will illustrate the application of the methods with many empirical networks such as the internet at the autonomous systems level, the global airport network, the network of actors and films, social networks, citations among

  11. Volunteerism: Social Network Dynamics and Education

    Science.gov (United States)

    Ajrouch, Kristine J.; Antonucci, Toni C.; Webster, Noah J.

    2016-01-01

    Objectives . We examine how changes in social networks influence volunteerism through bridging (diversity) and bonding (spending time) mechanisms. We further investigate whether social network change substitutes or amplifies the effects of education on volunteerism. Methods . Data (n = 543) are drawn from a two-wave survey of Social Relations and Health over the Life Course (SRHLC). Zero-inflated negative binomial regressions were conducted to test competing hypotheses about how changes in social network characteristics alone and in conjunction with education level predict likelihood and frequency of volunteering. Results . Changes in social networks were associated with volunteerism: as the proportion of family members decreased and the average number of network members living within a one-hour drive increased over time, participants reported higher odds of volunteering. The substitution hypothesis was supported: social networks that exhibited more geographic proximity and greater contact frequency over-time compensated for lower levels of education to predict volunteering more hours. Discussion . The dynamic role of social networks and the ways in which they may work through bridging and bonding to influence both likelihood and frequency of volunteering are discussed. The potential benefits of volunteerism in light of longer life expectancies and smaller families are also considered. PMID:25512570

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

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

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

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

  16. Mean field methods for cortical network dynamics

    DEFF Research Database (Denmark)

    Hertz, J.; Lerchner, Alexander; Ahmadi, M.

    2004-01-01

    We review the use of mean field theory for describing the dynamics of dense, randomly connected cortical circuits. For a simple network of excitatory and inhibitory leaky integrate- and-fire neurons, we can show how the firing irregularity, as measured by the Fano factor, increases...... with the strength of the synapses in the network and with the value to which the membrane potential is reset after a spike. Generalizing the model to include conductance-based synapses gives insight into the connection between the firing statistics and the high- conductance state observed experimentally in visual...

  17. MONOMIALS AND BASIN CYLINDERS FOR NETWORK DYNAMICS.

    Science.gov (United States)

    Austin, Daniel; Dinwoodie, Ian H

    We describe methods to identify cylinder sets inside a basin of attraction for Boolean dynamics of biological networks. Such sets are used for designing regulatory interventions that make the system evolve towards a chosen attractor, for example initiating apoptosis in a cancer cell. We describe two algebraic methods for identifying cylinders inside a basin of attraction, one based on the Groebner fan that finds monomials that define cylinders and the other on primary decomposition. Both methods are applied to current examples of gene networks.

  18. 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…

  19. Network dynamics: The World Wide Web

    Science.gov (United States)

    Adamic, Lada Ariana

    Despite its rapidly growing and dynamic nature, the Web displays a number of strong regularities which can be understood by drawing on methods of statistical physics. This thesis finds power-law distributions in website sizes, traffic, and links, and more importantly, develops a stochastic theory which explains them. Power-law link distributions are shown to lead to network characteristics which are especially suitable for scalable localized search. It is also demonstrated that the Web is a "small world": to reach one site from any other takes an average of only 4 hops, while most related sites cluster together. Additional dynamical properties of the Web graph are extracted from diffusion processes.

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

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

  2. System crash as dynamics of complex networks.

    Science.gov (United States)

    Yu, Yi; Xiao, Gaoxi; Zhou, Jie; Wang, Yubo; Wang, Zhen; Kurths, Jürgen; Schellnhuber, Hans Joachim

    2016-10-18

    Complex systems, from animal herds to human nations, sometimes crash drastically. Although the growth and evolution of systems have been extensively studied, our understanding of how systems crash is still limited. It remains rather puzzling why some systems, appearing to be doomed to fail, manage to survive for a long time whereas some other systems, which seem to be too big or too strong to fail, crash rapidly. In this contribution, we propose a network-based system dynamics model, where individual actions based on the local information accessible in their respective system structures may lead to the "peculiar" dynamics of system crash mentioned above. Extensive simulations are carried out on synthetic and real-life networks, which further reveal the interesting system evolution leading to the final crash. Applications and possible extensions of the proposed model are discussed.

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

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

  5. Dynamics of the ethanolamine glycerophospholipid remodeling network.

    Directory of Open Access Journals (Sweden)

    Lu Zhang

    Full Text Available Acyl chain remodeling in lipids is a critical biochemical process that plays a central role in disease. However, remodeling remains poorly understood, despite massive increases in lipidomic data. In this work, we determine the dynamic network of ethanolamine glycerophospholipid (PE remodeling, using data from pulse-chase experiments and a novel bioinformatic network inference approach. The model uses a set of ordinary differential equations based on the assumptions that (1 sn1 and sn2 acyl positions are independently remodeled; (2 remodeling reaction rates are constant over time; and (3 acyl donor concentrations are constant. We use a novel fast and accurate two-step algorithm to automatically infer model parameters and their values. This is the first such method applicable to dynamic phospholipid lipidomic data. Our inference procedure closely fits experimental measurements and shows strong cross-validation across six independent experiments with distinct deuterium-labeled PE precursors, demonstrating the validity of our assumptions. In contrast, fits of randomized data or fits using random model parameters are worse. A key outcome is that we are able to robustly distinguish deacylation and reacylation kinetics of individual acyl chain types at the sn1 and sn2 positions, explaining the established prevalence of saturated and unsaturated chains in the respective positions. The present study thus demonstrates that dynamic acyl chain remodeling processes can be reliably determined from dynamic lipidomic data.

  6. Network structure shapes spontaneous functional connectivity dynamics.

    Science.gov (United States)

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

    2015-04-08

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

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

  8. Report on the IAEA Technical Meeting of the International Network of Nuclear Reaction Data Centres

    International Nuclear Information System (INIS)

    Forrest, R.; Dunaeva, S.; Otsuka, N.

    2010-07-01

    This report summarizes the IAEA Technical Meeting of the International Network of Nuclear Reaction Data Centres (biennial Data Centre Heads Meeting), held at the Japan Nuclear Reaction Data Centre, Hokkaido University, Sapporo, Japan, from 20 - 23 April 2010. The meeting was attended by 27 participants from 12 cooperating data centres of seven Member States and two International Organizations. The report contains a summary of the meeting, the conclusions and actions, the lists of working papers and presentations presented at the meeting. This report summarizes the IAEA Technical Meeting of the International Network of Nuclear Reaction Data Centres (biennial Data Centre Heads Meeting), held at the Japan Nuclear Reaction Data Centre, Hokkaido University, Sapporo, Japan, from 20 - 23 April 2010. The meeting was attended by 27 participants from 12 cooperating data centres of seven Member States and two International Organizations. The report contains a summary of the meeting, the conclusions and actions, the lists of working papers and presentations presented at the meeting. (author)

  9. Discrete Opinion Dynamics on Online Social Networks

    Science.gov (United States)

    Hu, Yan-Li; Bai, Liang; Zhang, Wei-Ming

    2013-01-01

    This paper focuses on the dynamics of binary opinions {+1, -1} on online social networks consisting of heterogeneous actors. In our model, actors update their opinions under the interplay of social influence and self- affirmation, which leads to rich dynamical behaviors on online social networks. We find that the opinion leading to the consensus features an advantage of the initially weighted fraction based on actors' strength over the other, instead of the population. For the role of specific actors, the consensus converges towards the opinion that a small fraction of high-strength actors hold, and individual diversity of self-affirmation slows down the ordering process of consensus. These indicate that high-strength actors play an essential role in opinion formation with strong social influence as well as high persistence. Further investigations show that the initial fraction of high-strength actors to dominate the evolution depends on the heterogeneity of the strength distribution, and less high-strength actors are needed in the case of a smaller exponent of power-law distribution of actors' strength. Our study provides deep insights into the role of social influence and self-affirmation on opinion formation on online social networks.

  10. Discrete Opinion Dynamics on Online Social Networks

    International Nuclear Information System (INIS)

    Hu Yan-Li; Bai Liang; Zhang Wei-Ming

    2013-01-01

    This paper focuses on the dynamics of binary opinions {+1, −1} on online social networks consisting of heterogeneous actors. In our model, actors update their opinions under the interplay of social influence and self- affirmation, which leads to rich dynamical behaviors on online social networks. We find that the opinion leading to the consensus features an advantage of the initially weighted fraction based on actors' strength over the other, instead of the population. For the role of specific actors, the consensus converges towards the opinion that a small fraction of high-strength actors hold, and individual diversity of self-affirmation slows down the ordering process of consensus. These indicate that high-strength actors play an essential role in opinion formation with strong social influence as well as high persistence. Further investigations show that the initial fraction of high-strength actors to dominate the evolution depends on the heterogeneity of the strength distribution, and less high-strength actors are needed in the case of a smaller exponent of power-law distribution of actors' strength. Our study provides deep insights into the role of social influence and self-affirmation on opinion formation on online social networks. (general)

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

  12. Pushing the network harder `Dynamic Ratings`

    Energy Technology Data Exchange (ETDEWEB)

    Liondas, V.; Howatt, C.; Norrie, P. [Prospect Electricity, Blacktown, NSW (Australia)

    1995-12-31

    The demand for electricity in the area serviced by Prospect Electricity, is increasing, necessitating an increase in power transfer through the distribution system. Satisfying this demand generally requires more electrical infrastructure, but this is becoming less feasible due to economic constraints and environmental considerations. This paper discusses an approach to the dynamic (or real time) rating of different network elements. Dynamic rating is taken to mean that rating which is determined essentially in real time using known temperature constraints for the relevant elements, together with the prevailing ambient or environmental conditions. The purpose of dynamic rating is to achieve greater system utilization, thus allowing significant economic benefits, particularly from deferment of capital expenditure and greater operational flexibility. A number of technologies are being developed to do this for overhead lines, underground cables and transformers. The dynamic rating of cables has proved to be the most intractable part of the dynamic rating project. Work done to date, however, using finite element techniques together with the proposals to further develop point and distributed temperature sensing using fibre optic methods gives some confidence to the future success of this development. (author). 2 tabs., 4 figs., 4 refs.

  13. Opinion dynamics on an adaptive random network

    Science.gov (United States)

    Benczik, I. J.; Benczik, S. Z.; Schmittmann, B.; Zia, R. K. P.

    2009-04-01

    We revisit the classical model for voter dynamics in a two-party system with two basic modifications. In contrast to the original voter model studied in regular lattices, we implement the opinion formation process in a random network of agents in which interactions are no longer restricted by geographical distance. In addition, we incorporate the rapidly changing nature of the interpersonal relations in the model. At each time step, agents can update their relationships. This update is determined by their own opinion, and by their preference to make connections with individuals sharing the same opinion, or rather with opponents. In this way, the network is built in an adaptive manner, in the sense that its structure is correlated and evolves with the dynamics of the agents. The simplicity of the model allows us to examine several issues analytically. We establish criteria to determine whether consensus or polarization will be the outcome of the dynamics and on what time scales these states will be reached. In finite systems consensus is typical, while in infinite systems a disordered metastable state can emerge and persist for infinitely long time before consensus is reached.

  14. Collective Dynamics in Physical and Social Networks

    Science.gov (United States)

    Isakov, Alexander

    We study four systems where individual units come together to display a range of collective behavior. First, we consider a physical system of phase oscillators on a network that expands the Kuramoto model to include oscillator-network interactions and the presence of noise: using a Hebbian-like learning rule, oscillators that synchronize in turn strengthen their connections to each other. We find that the average degree of connectivity strongly affects rates of flipping between aligned and anti-aligned states, and that this result persists to the case of complex networks. Turning to a fully multi-player, multi-strategy evolutionary dynamics model of cooperating bacteria that change who they give resources to and take resources from, we find several regimes that give rise to high levels of collective structure in the resulting networks. In this setting, we also explore the conditions in which an intervention that affects cooperation itself (e.g. "seeding the network with defectors") can lead to wiping out an infection. We find a non-monotonic connection between the percent of disabled cooperation and cure rate, suggesting that in some regimes a limited perturbation can lead to total population collapse. At a larger scale, we study how the locomotor system recovers after amputation in fruit flies. Through experiment and a theoretical model of multi-legged motion controlled by neural oscillators, we find that proprioception plays a role in the ability of flies to control leg forces appropriately to recover from a large initial turning bias induced by the injury. Finally, at the human scale, we consider a social network in a traditional society in Africa to understand how social ties lead to group formation for collective action (stealth raids). We identify critical and distinct roles for both leadership (important for catalyzing a group) and friendship (important for final composition). We conclude with prospects for future work.

  15. Dynamics of neural networks with continuous attractors

    Science.gov (United States)

    Fung, C. C. Alan; Wong, K. Y. Michael; Wu, Si

    2008-10-01

    We investigate the dynamics of continuous attractor neural networks (CANNs). Due to the translational invariance of their neuronal interactions, CANNs can hold a continuous family of stationary states. We systematically explore how their neutral stability facilitates the tracking performance of a CANN, which is believed to have wide applications in brain functions. We develop a perturbative approach that utilizes the dominant movement of the network stationary states in the state space. We quantify the distortions of the bump shape during tracking, and study their effects on the tracking performance. Results are obtained on the maximum speed for a moving stimulus to be trackable, and the reaction time to catch up an abrupt change in stimulus.

  16. Multinephron dynamics on the renal vascular network

    DEFF Research Database (Denmark)

    Marsh, Donald J; Wexler, Anthony S; Brazhe, Alexey

    2012-01-01

    Tubuloglomerular feedback (TGF) and the myogenic mechanism combine in each nephron to regulate blood flow and glomerular filtration rate. Both mechanisms are non-linear, generate self-sustained oscillations, and interact as their signals converge on arteriolar smooth muscle, forming a regulatory...... clusters. In-phase synchronization predominated among nephrons separated by 1 or 3 vascular nodes, and anti-phase synchronization for 5 or 7 nodes of separation. Nephron dynamics were irregular and contained low frequency fluctuations. Results are consistent with simultaneous blood flow measurements...... of both mechanisms in the regulatory ensemble, to examine the effects of network structure on nephron synchronization. Symmetry, as a property of a network, facilitates synchronization. Nephrons received blood from a symmetric electrically conductive vascular tree. Symmetry was created by using identical...

  17. A class of convergent neural network dynamics

    Science.gov (United States)

    Fiedler, Bernold; Gedeon, Tomáš

    1998-01-01

    We consider a class of systems of differential equations in Rn which exhibits convergent dynamics. We find a Lyapunov function and show that every bounded trajectory converges to the set of equilibria. Our result generalizes the results of Cohen and Grossberg (1983) for convergent neural networks. It replaces the symmetry assumption on the matrix of weights by the assumption on the structure of the connections in the neural network. We prove the convergence result also for a large class of Lotka-Volterra systems. These are naturally defined on the closed positive orthant. We show that there are no heteroclinic cycles on the boundary of the positive orthant for the systems in this class.

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

  19. Content Dynamics Over the Network Cloud

    Science.gov (United States)

    2015-11-04

    AFRL-AFOSR-CL-TR-2015-0003 Content dynamics over the network cloud Fernando Paganini UNIVERSIDAD ORT URUGUAY CUAREIM 1451 MONTEVIDEO, 11100 UY 11/04...approved for public release. FINAL PERFORMANCE REPORT: 7-15-2012 to 7-14-2015 AFOSR GRANT NUMBER: FA9550-12-1-0398 PI: Fernando Paganini Universidad ORT...349-362, Apr 2014. 7. M. Zubeldía, “From resource allocation to neighbor selection in peer-to-peer networks”, MS Thesis, Universidad ORT Uruguay

  20. Reliable dynamics in Boolean and continuous networks

    International Nuclear Information System (INIS)

    Ackermann, Eva; Drossel, Barbara; Peixoto, Tiago P

    2012-01-01

    We investigate the dynamical behavior of a model of robust gene regulatory networks which possess ‘entirely reliable’ trajectories. In a Boolean representation, these trajectories are characterized by being insensitive to the order in which the nodes are updated, i.e. they always go through the same sequence of states. The Boolean model for gene activity is compared with a continuous description in terms of differential equations for the concentrations of mRNA and proteins. We found that entirely reliable Boolean trajectories can be reproduced perfectly in the continuous model when realistic Hill coefficients are used. We investigate to what extent this high correspondence between Boolean and continuous trajectories depends on the extent of reliability of the Boolean trajectories, and we identify simple criteria that enable the faithful reproduction of the Boolean dynamics in the continuous description. (paper)

  1. Two-photon imaging and analysis of neural network dynamics

    International Nuclear Information System (INIS)

    Luetcke, Henry; Helmchen, Fritjof

    2011-01-01

    The glow of a starry night sky, the smell of a freshly brewed cup of coffee or the sound of ocean waves breaking on the beach are representations of the physical world that have been created by the dynamic interactions of thousands of neurons in our brains. How the brain mediates perceptions, creates thoughts, stores memories and initiates actions remains one of the most profound puzzles in biology, if not all of science. A key to a mechanistic understanding of how the nervous system works is the ability to measure and analyze the dynamics of neuronal networks in the living organism in the context of sensory stimulation and behavior. Dynamic brain properties have been fairly well characterized on the microscopic level of individual neurons and on the macroscopic level of whole brain areas largely with the help of various electrophysiological techniques. However, our understanding of the mesoscopic level comprising local populations of hundreds to thousands of neurons (so-called 'microcircuits') remains comparably poor. Predominantly, this has been due to the technical difficulties involved in recording from large networks of neurons with single-cell spatial resolution and near-millisecond temporal resolution in the brain of living animals. In recent years, two-photon microscopy has emerged as a technique which meets many of these requirements and thus has become the method of choice for the interrogation of local neural circuits. Here, we review the state-of-research in the field of two-photon imaging of neuronal populations, covering the topics of microscope technology, suitable fluorescent indicator dyes, staining techniques, and in particular analysis techniques for extracting relevant information from the fluorescence data. We expect that functional analysis of neural networks using two-photon imaging will help to decipher fundamental operational principles of neural microcircuits.

  2. Two-photon imaging and analysis of neural network dynamics

    Science.gov (United States)

    Lütcke, Henry; Helmchen, Fritjof

    2011-08-01

    The glow of a starry night sky, the smell of a freshly brewed cup of coffee or the sound of ocean waves breaking on the beach are representations of the physical world that have been created by the dynamic interactions of thousands of neurons in our brains. How the brain mediates perceptions, creates thoughts, stores memories and initiates actions remains one of the most profound puzzles in biology, if not all of science. A key to a mechanistic understanding of how the nervous system works is the ability to measure and analyze the dynamics of neuronal networks in the living organism in the context of sensory stimulation and behavior. Dynamic brain properties have been fairly well characterized on the microscopic level of individual neurons and on the macroscopic level of whole brain areas largely with the help of various electrophysiological techniques. However, our understanding of the mesoscopic level comprising local populations of hundreds to thousands of neurons (so-called 'microcircuits') remains comparably poor. Predominantly, this has been due to the technical difficulties involved in recording from large networks of neurons with single-cell spatial resolution and near-millisecond temporal resolution in the brain of living animals. In recent years, two-photon microscopy has emerged as a technique which meets many of these requirements and thus has become the method of choice for the interrogation of local neural circuits. Here, we review the state-of-research in the field of two-photon imaging of neuronal populations, covering the topics of microscope technology, suitable fluorescent indicator dyes, staining techniques, and in particular analysis techniques for extracting relevant information from the fluorescence data. We expect that functional analysis of neural networks using two-photon imaging will help to decipher fundamental operational principles of neural microcircuits.

  3. Two-photon imaging and analysis of neural network dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Luetcke, Henry; Helmchen, Fritjof [Brain Research Institute, University of Zurich, Winterthurerstrasse 190, CH-8057 Zurich (Switzerland)

    2011-08-15

    The glow of a starry night sky, the smell of a freshly brewed cup of coffee or the sound of ocean waves breaking on the beach are representations of the physical world that have been created by the dynamic interactions of thousands of neurons in our brains. How the brain mediates perceptions, creates thoughts, stores memories and initiates actions remains one of the most profound puzzles in biology, if not all of science. A key to a mechanistic understanding of how the nervous system works is the ability to measure and analyze the dynamics of neuronal networks in the living organism in the context of sensory stimulation and behavior. Dynamic brain properties have been fairly well characterized on the microscopic level of individual neurons and on the macroscopic level of whole brain areas largely with the help of various electrophysiological techniques. However, our understanding of the mesoscopic level comprising local populations of hundreds to thousands of neurons (so-called 'microcircuits') remains comparably poor. Predominantly, this has been due to the technical difficulties involved in recording from large networks of neurons with single-cell spatial resolution and near-millisecond temporal resolution in the brain of living animals. In recent years, two-photon microscopy has emerged as a technique which meets many of these requirements and thus has become the method of choice for the interrogation of local neural circuits. Here, we review the state-of-research in the field of two-photon imaging of neuronal populations, covering the topics of microscope technology, suitable fluorescent indicator dyes, staining techniques, and in particular analysis techniques for extracting relevant information from the fluorescence data. We expect that functional analysis of neural networks using two-photon imaging will help to decipher fundamental operational principles of neural microcircuits.

  4. Summary report on [IAEA] technical meeting of the International Network of Nuclear Reaction Data Centres

    International Nuclear Information System (INIS)

    Dunaeva, S.; Otsuka, N.; Schwerer, O.

    2009-08-01

    An IAEA Technical Meeting of the International Network of Nuclear Reaction Data Centres was held at the IAEA Headquarters in Vienna from 25 to 26 May 2009. The meeting was attended by 23 participants from 13 cooperating data centres. A summary of the meeting is given in this report, along with the conclusions, actions, and status report of the participating data centres. (author)

  5. Imaging complex nutrient dynamics in mycelial networks.

    Science.gov (United States)

    Fricker, M D; Lee, J A; Bebber, D P; Tlalka, M; Hynes, J; Darrah, P R; Watkinson, S C; Boddy, L

    2008-08-01

    techniques shows that as the colony forms, it self-organizes into well demarcated domains that are identifiable by differences in the phase relationship of the pulses. On the centimetre to metre scale, we have begun to use techniques borrowed from graph theory to characterize the development and dynamics of the network, and used these abstracted network models to predict the transport characteristics, resilience, and cost of the network.

  6. Network Randomization and Dynamic Defense for Critical Infrastructure Systems

    Energy Technology Data Exchange (ETDEWEB)

    Chavez, Adrian R. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Martin, Mitchell Tyler [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Hamlet, Jason [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Stout, William M.S. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lee, Erik [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2015-04-01

    Critical Infrastructure control systems continue to foster predictable communication paths, static configurations, and unpatched systems that allow easy access to our nation's most critical assets. This makes them attractive targets for cyber intrusion. We seek to address these attack vectors by automatically randomizing network settings, randomizing applications on the end devices themselves, and dynamically defending these systems against active attacks. Applying these protective measures will convert control systems into moving targets that proactively defend themselves against attack. Sandia National Laboratories has led this effort by gathering operational and technical requirements from Tennessee Valley Authority (TVA) and performing research and development to create a proof-of-concept solution. Our proof-of-concept has been tested in a laboratory environment with over 300 nodes. The vision of this project is to enhance control system security by converting existing control systems into moving targets and building these security measures into future systems while meeting the unique constraints that control systems face.

  7. Stochastic dynamics of genetic broadcasting networks

    Science.gov (United States)

    Potoyan, Davit A.; Wolynes, Peter G.

    2017-11-01

    The complex genetic programs of eukaryotic cells are often regulated by key transcription factors occupying or clearing out of a large number of genomic locations. Orchestrating the residence times of these factors is therefore important for the well organized functioning of a large network. The classic models of genetic switches sidestep this timing issue by assuming the binding of transcription factors to be governed entirely by thermodynamic protein-DNA affinities. Here we show that relying on passive thermodynamics and random release times can lead to a "time-scale crisis" for master genes that broadcast their signals to a large number of binding sites. We demonstrate that this time-scale crisis for clearance in a large broadcasting network can be resolved by actively regulating residence times through molecular stripping. We illustrate these ideas by studying a model of the stochastic dynamics of the genetic network of the central eukaryotic master regulator NFκ B which broadcasts its signals to many downstream genes that regulate immune response, apoptosis, etc.

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

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

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

  11. Google matrix, dynamical attractors, and Ulam networks.

    Science.gov (United States)

    Shepelyansky, D L; Zhirov, O V

    2010-03-01

    We study the properties of the Google matrix generated by a coarse-grained Perron-Frobenius operator of the Chirikov typical map with dissipation. The finite-size matrix approximant of this operator is constructed by the Ulam method. This method applied to the simple dynamical model generates directed Ulam networks with approximate scale-free scaling and characteristics being in certain features similar to those of the world wide web with approximate scale-free degree distributions as well as two characteristics similar to the web: a power-law decay in PageRank that mirrors the decay of PageRank on the world wide web and a sensitivity to the value alpha in PageRank. The simple dynamical attractors play here the role of popular websites with a strong concentration of PageRank. A variation in the Google parameter alpha or other parameters of the dynamical map can drive the PageRank of the Google matrix to a delocalized phase with a strange attractor where the Google search becomes inefficient.

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

  13. Report on the IAEA technical meeting on network of nuclear reaction data centres

    Energy Technology Data Exchange (ETDEWEB)

    Schwerer, O [IAEA Nuclear Data Section, Vienna (Austria)

    2006-12-15

    An IAEA Technical Meeting on the Network of Nuclear Reaction Data Centres (biennial Data Centre Heads Meeting) was held at IAEA Headquarters, Vienna, Austria, from 25 to 28 September 2006. The meeting was attended by 19 participants from 10 cooperating data centres of six Member States and two international organizations. A summary of the meeting is given in this report, along with the conclusions, actions, and status reports of the participating data centres. (author)

  14. Report on the IAEA technical meeting on network of nuclear reaction data centres

    International Nuclear Information System (INIS)

    Pronyaev, V.G.; Schwerer, O.; Nichols, A.L.

    2002-08-01

    An IAEA Technical Meeting on the Network of Nuclear Reaction Data Centres (and the biennial Data Centre Heads' Meeting) was held at the OECD Nuclear Energy Agency, Issy-les-Moulineaux (near Paris), France, from 27 to 30 May 2002. The meeting was attended by 21 participants from 12 co-operating data centres of six Member States and two international organizations. This report contains the meeting summary, conclusions and actions, status reports of the participating data centres, and working papers considered. (author)

  15. Report on the IAEA technical meeting on network of nuclear reaction data centres

    International Nuclear Information System (INIS)

    Schwerer, O.

    2006-12-01

    An IAEA Technical Meeting on the Network of Nuclear Reaction Data Centres (biennial Data Centre Heads Meeting) was held at IAEA Headquarters, Vienna, Austria, from 25 to 28 September 2006. The meeting was attended by 19 participants from 10 cooperating data centres of six Member States and two international organizations. A summary of the meeting is given in this report, along with the conclusions, actions, and status reports of the participating data centres. (author)

  16. Report on the IAEA advisory group meeting on network of nuclear reaction data centres

    Energy Technology Data Exchange (ETDEWEB)

    Pronyaev, V G; Schwerer, O [International Atomic Energy Agency, Nuclear Data Section, Vienna (Austria)

    2000-08-01

    This report summarizes the IAEA Advisory Group Meeting (AGM) on Network of Nuclear Reaction Data Centres, hold at the Institute of Physics and Power Engineering, Obninsk, Russia, 15 to 19 May 2000. The meeting was attended by 28 participants from 13 co-operating data centres from seven Member States and two International Organizations. The report contains a meeting summary, the conclusions and actions, progress and status reports of the participating data centres and working papers considered at the meeting. (author)

  17. Summary Report on IAEA Technical Meeting on the International Network of Nuclear Reaction Data Centres

    International Nuclear Information System (INIS)

    Otsuka, Naohiko

    2011-07-01

    This report summarizes the IAEA Technical Meeting of the International Network of Nuclear Reaction Data Centres, held at the IAEA Headquarters in Vienna, Austria from 23 - 24 May 2011. The meeting was attended by 25 participants from 13 cooperating data centres of nine Member States and two International Organizations. The report contains a summary of the meeting, the conclusions and actions, the lists of working papers and presentations presented at the meeting. (author)

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

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

  20. Magnetoencephalography from signals to dynamic cortical networks

    CERN Document Server

    Aine, Cheryl

    2014-01-01

    "Magnetoencephalography (MEG) provides a time-accurate view into human brain function. The concerted action of neurons generates minute magnetic fields that can be detected---totally noninvasively---by sensitive multichannel magnetometers. The obtained millisecond accuracycomplements information obtained by other modern brain-imaging tools. Accurate timing is quintessential in normal brain function, often distorted in brain disorders. The noninvasiveness and time-sensitivityof MEG are great assets to developmental studies, as well. This multiauthored book covers an ambitiously wide range of MEG research from introductory to advanced level, from sensors to signals, and from focal sources to the dynamics of cortical networks. Written by active practioners of this multidisciplinary field, the book contains tutorials for newcomers and chapters of new challenging methods and emerging technologies to advanced MEG users. The reader will obtain a firm grasp of the possibilities of MEG in the study of audition, vision...

  1. Attractor dynamics in local neuronal networks

    Directory of Open Access Journals (Sweden)

    Jean-Philippe eThivierge

    2014-03-01

    Full Text Available Patterns of synaptic connectivity in various regions of the brain are characterized by the presence of synaptic motifs, defined as unidirectional and bidirectional synaptic contacts that follow a particular configuration and link together small groups of neurons. Recent computational work proposes that a relay network (two populations communicating via a third, relay population of neurons can generate precise patterns of neural synchronization. Here, we employ two distinct models of neuronal dynamics and show that simulated neural circuits designed in this way are caught in a global attractor of activity that prevents neurons from modulating their response on the basis of incoming stimuli. To circumvent the emergence of a fixed global attractor, we propose a mechanism of selective gain inhibition that promotes flexible responses to external stimuli. We suggest that local neuronal circuits may employ this mechanism to generate precise patterns of neural synchronization whose transient nature delimits the occurrence of a brief stimulus.

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

  3. The stochastic network dynamics underlying perceptual discrimination

    Directory of Open Access Journals (Sweden)

    Genis Prat-Ortega

    2015-04-01

    Full Text Available The brain is able to interpret streams of high-dimensional ambiguous information and yield coherent percepts. The mechanisms governing sensory integration have been extensively characterized using time-varying visual stimuli (Britten et al. 1996; Roitman and Shadlen 2002, but some of the basic principles regarding the network dynamics underlying this process remain largely unknown. We captured the basic features of a neural integrator using three canonical one-dimensional models: (1 the Drift Diffusion Model (DDM, (2 the Perfect Integrator (PI which is a particular case of the DDM where the bounds are set to infinity and (3 the double-well potential (DW which captures the dynamics of the attractor networks (Wang 2002; Roxin and Ledberg 2008. Although these models has been widely studied (Bogacz et al. 2006; Roxin and Ledberg 2008; Gold and Shadlen 2002, it has been difficult to experimentally discriminate among them because most of the observables measured are only quantitatively different among these models (e.g. psychometric curves. Here we aim to find experimentally measurable quantities that can yield qualitatively different behaviors depending on the nature of the underlying network dynamics. We examined the categorization dynamics of these models in response to fluctuating stimuli of different duration (T. On each time step, stimuli are drawn from a Gaussian distribution N(μ, σ and the two stimulus categories are defined by μ > 0 and μ < 0. Psychometric curves can therefore be obtained by quantifying the probability of the integrator to yield one category versus μ . We find however that varying σ can reveal more clearly the differences among the different integrators. In the small σ regime, both the DW and the DDM perform transient integration and exhibit a decaying stimulus reverse correlation kernel revealing a primacy effect (Nienborg and Cumming 2009; Wimmer et al. 2015 . In the large σ regime, the integration in the DDM

  4. The Dynamics of Initiative in Communication Networks.

    Directory of Open Access Journals (Sweden)

    Anders Mollgaard

    Full Text Available Human social interaction is often intermittent. Two acquainted persons can have extended periods without social interaction punctuated by periods of repeated interaction. In this case, the repeated interaction can be characterized by a seed initiative by either of the persons and a number of follow-up interactions. The tendency to initiate social interaction plays an important role in the formation of social networks and is in general not symmetric between persons. In this paper, we study the dynamics of initiative by analysing and modeling a detailed call and text message network sampled from a group of 700 individuals. We show that in an average relationship between two individuals, one part is almost twice as likely to initiate communication compared to the other part. The asymmetry has social consequences and ultimately might lead to the discontinuation of a relationship. We explain the observed asymmetry by a positive feedback mechanism where individuals already taking initiative are more likely to take initiative in the future. In general, people with many initiatives receive attention from a broader spectrum of friends than people with few initiatives. Lastly, we compare the likelihood of taking initiative with the basic personality traits of the five factor model.

  5. Choice Shift in Opinion Network Dynamics

    Science.gov (United States)

    Gabbay, Michael

    Choice shift is a phenomenon associated with small group dynamics whereby group discussion causes group members to shift their opinions in a more extreme direction so that the mean post-discussion opinion exceeds the mean pre-discussion opinion. Also known as group polarization, choice shift is a robust experimental phenomenon and has been well-studied within social psychology. In opinion network models, shifts toward extremism are typically produced by the presence of stubborn agents at the extremes of the opinion axis, whose opinions are much more resistant to change than moderate agents. However, we present a model in which choice shift can arise without the assumption of stubborn agents; the model evolves member opinions and uncertainties using coupled nonlinear differential equations. In addition, we briefly describe the results of a recent experiment conducted involving online group discussion concerning the outcome of National Football League games are described. The model predictions concerning the effects of network structure, disagreement level, and team choice (favorite or underdog) are in accord with the experimental results. This research was funded by the Office of Naval Research and the Defense Threat Reduction Agency.

  6. Filtering in Hybrid Dynamic Bayesian Networks

    Science.gov (United States)

    Andersen, Morten Nonboe; Andersen, Rasmus Orum; Wheeler, Kevin

    2000-01-01

    We implement a 2-time slice dynamic Bayesian network (2T-DBN) framework and make a 1-D state estimation simulation, an extension of the experiment in (v.d. Merwe et al., 2000) and compare different filtering techniques. Furthermore, we demonstrate experimentally that inference in a complex hybrid DBN is possible by simulating fault detection in a watertank system, an extension of the experiment in (Koller & Lerner, 2000) using a hybrid 2T-DBN. In both experiments, we perform approximate inference using standard filtering techniques, Monte Carlo methods and combinations of these. In the watertank simulation, we also demonstrate the use of 'non-strict' Rao-Blackwellisation. We show that the unscented Kalman filter (UKF) and UKF in a particle filtering framework outperform the generic particle filter, the extended Kalman filter (EKF) and EKF in a particle filtering framework with respect to accuracy in terms of estimation RMSE and sensitivity with respect to choice of network structure. Especially we demonstrate the superiority of UKF in a PF framework when our beliefs of how data was generated are wrong. Furthermore, we investigate the influence of data noise in the watertank simulation using UKF and PFUKD and show that the algorithms are more sensitive to changes in the measurement noise level that the process noise level. Theory and implementation is based on (v.d. Merwe et al., 2000).

  7. Report on the IAEA technical meeting on network of nuclear reaction data centres

    Energy Technology Data Exchange (ETDEWEB)

    Schwerer, O [International Atomic Energy Agency, Nuclear Data Section, Vienna (Austria); Henriksson, H [NEA Data Bank, Issy-les-Moulineaux (France)

    2005-01-15

    This report summarizes the IAEA Technical Meeting on the Network of Nuclear Reaction Data Centres (biennial Data Centre Heads Meeting), held at the Brookhaven National Laboratory, Upton, NY, USA from 4-7 October 2004. The meeting was attended by 20 participants from 11 co-operating data centres of six Member States and two International Organizations. The report contains a summary of the meeting, the conclusions and actions, status reports of the participating data centres, and a revised technical protocol for the cooperation of the network. (author)

  8. Report on the IAEA technical meeting on network of nuclear reaction data centres

    International Nuclear Information System (INIS)

    Schwerer, O.; Henriksson, H.

    2005-01-01

    This report summarizes the IAEA Technical Meeting on the Network of Nuclear Reaction Data Centres (biennial Data Centre Heads Meeting), held at the Brookhaven National Laboratory, Upton, NY, USA from 4-7 October 2004. The meeting was attended by 20 participants from 11 co-operating data centres of six Member States and two International Organizations. The report contains a summary of the meeting, the conclusions and actions, status reports of the participating data centres, and a revised technical protocol for the cooperation of the network. (author)

  9. Sparse dynamical Boltzmann machine for reconstructing complex networks with binary dynamics

    Science.gov (United States)

    Chen, Yu-Zhong; Lai, Ying-Cheng

    2018-03-01

    Revealing the structure and dynamics of complex networked systems from observed data is a problem of current interest. Is it possible to develop a completely data-driven framework to decipher the network structure and different types of dynamical processes on complex networks? We develop a model named sparse dynamical Boltzmann machine (SDBM) as a structural estimator for complex networks that host binary dynamical processes. The SDBM attains its topology according to that of the original system and is capable of simulating the original binary dynamical process. We develop a fully automated method based on compressive sensing and a clustering algorithm to construct the SDBM. We demonstrate, for a variety of representative dynamical processes on model and real world complex networks, that the equivalent SDBM can recover the network structure of the original system and simulates its dynamical behavior with high precision.

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

  11. Technical Meeting on Establishing Networks for Countries Introducing Nuclear Power. Presentations

    International Nuclear Information System (INIS)

    2013-01-01

    The objectives of the meeting were to: • Learn about existing networking opportunities that may be of interest for embarking countries; • Discuss common challenges among Member States that could be addressed through better networking opportunities; • Determine appropriate sub-networks, such as future owner/operator organizations, heads of nuclear energy programme implementing organizations (NEPIOs), embarking countries and countries with current civil nuclear programmes; and • Discuss effective strategies for creating networks using existing social media platforms

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

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

  14. Gender, Friendship Networks, and Delinquency: A Dynamic Network Approach.

    Science.gov (United States)

    Haynie, Dana L; Doogan, Nathan J; Soller, Brian

    2014-11-01

    Researchers have examined selection and influence processes in shaping delinquency similarity among friends, but little is known about the role of gender in moderating these relationships. Our objective is to examine differences between adolescent boys and girls regarding delinquency-based selection and influence processes. Using longitudinal network data from adolescents attending two large schools in AddHealth ( N = 1,857) and stochastic actor-oriented models, we evaluate whether girls are influenced to a greater degree by friends' violence or delinquency than boys (influence hypothesis) and whether girls are more likely to select friends based on violent or delinquent behavior than boys (selection hypothesis). The results indicate that girls are more likely than boys to be influenced by their friends' involvement in violence. Although a similar pattern emerges for nonviolent delinquency, the gender differences are not significant. Some evidence shows that boys are influenced toward increasing their violence or delinquency when exposed to more delinquent or violent friends but are immune to reducing their violence or delinquency when associating with less violent or delinquent friends. In terms of selection dynamics, although both boys and girls have a tendency to select friends based on friends' behavior, girls have a stronger tendency to do so, suggesting that among girls, friends' involvement in violence or delinquency is an especially decisive factor for determining friendship ties.

  15. Gender, Friendship Networks, and Delinquency: A Dynamic Network Approach**

    Science.gov (United States)

    Haynie, Dana L.; Doogan, Nathan J.; Soller, Brian

    2014-01-01

    Researchers have examined selection and influence processes in shaping delinquency similarity among friends, but little is known about the role of gender in moderating these relationships. Our objective is to examine differences between adolescent boys and girls regarding delinquency-based selection and influence processes. Using longitudinal network data from adolescents attending two large schools in AddHealth (N = 1,857) and stochastic actor-oriented models, we evaluate whether girls are influenced to a greater degree by friends' violence or delinquency than boys (influence hypothesis) and whether girls are more likely to select friends based on violent or delinquent behavior than boys (selection hypothesis). The results indicate that girls are more likely than boys to be influenced by their friends' involvement in violence. Although a similar pattern emerges for nonviolent delinquency, the gender differences are not significant. Some evidence shows that boys are influenced toward increasing their violence or delinquency when exposed to more delinquent or violent friends but are immune to reducing their violence or delinquency when associating with less violent or delinquent friends. In terms of selection dynamics, although both boys and girls have a tendency to select friends based on friends' behavior, girls have a stronger tendency to do so, suggesting that among girls, friends' involvement in violence or delinquency is an especially decisive factor for determining friendship ties. PMID:26097241

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

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

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

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

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

  1. Transport on river networks: A dynamical approach

    OpenAIRE

    Zaliapin, I; Foufoula-Georgiou, E; Ghil, M

    2017-01-01

    This study is motivated by problems related to environmental transport on river networks. We establish statistical properties of a flow along a directed branching network and suggest its compact parameterization. The downstream network transport is treated as a particular case of nearest-neighbor hierarchical aggregation with respect to the metric induced by the branching structure of the river network. We describe the static geometric structure of a drainage network by a tree, referred to as...

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

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

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

  5. Report on the IAEA technical meeting of the International Network of Nuclear Reaction Data Centres

    Energy Technology Data Exchange (ETDEWEB)

    Schwerer, O; Dunaeva, S [International Atomic Energy Agency, Nuclear Data Section, Vienna (Austria); org, S Dunaeva@iaea [eds.

    2007-11-15

    An IAEA Technical Meeting of the International Network of Nuclear Reaction Data Centres was held at IAEA Headquarters, Vienna, Austria, from 8 to 10 October 2007. The meeting was attended by 19 participants from 11 cooperating data centres of six Member States and two international organizations. A summary of the meeting is given in this report, along with the conclusions, actions, and status reports of the participating data centres. (author)

  6. Summary Report of the Technical Meeting on International Network of Nuclear Reaction Data Centres

    International Nuclear Information System (INIS)

    Otsuka, Naohiko

    2012-06-01

    This report summarizes the IAEA Technical Meeting on the International Network of Nuclear Reaction Data Centres, held at the OECD Nuclear Energy Agency (NEA) in Issy-les-Moulineaux, France from 16 to 19 April 2012. The meeting was attended by twenty-three participants representing thirteen cooperative centres from eight Member States and two International Organisations. A summary of the meeting is given in this report along with the conclusions and actions. (author)

  7. Report on the IAEA technical meeting on the network of nuclear reaction data centres

    Energy Technology Data Exchange (ETDEWEB)

    Schwerer, O [International Atomic Energy Agency, Nuclear Data Section, Vienna (Austria)

    2006-02-15

    Results of the IAEA Technical meeting on the Network of Nuclear Reaction Data Centres held at the IAEA Headquarters, Vienna, Austria, 12 to 14 October 2005, are summarized in this report. The meeting was attended by 16 participants from 11 co-operating data centres of six Member States and two International Organizations. The report contains a summary of the meeting, the conclusions and actions, and status reports of the participating data centres. (author)

  8. Report on the IAEA technical meeting on the network of nuclear reaction data centres

    International Nuclear Information System (INIS)

    Schwerer, O.

    2006-02-01

    Results of the IAEA Technical meeting on the Network of Nuclear Reaction Data Centres held at the IAEA Headquarters, Vienna, Austria, 12 to 14 October 2005, are summarized in this report. The meeting was attended by 16 participants from 11 co-operating data centres of six Member States and two International Organizations. The report contains a summary of the meeting, the conclusions and actions, and status reports of the participating data centres. (author)

  9. Report on the IAEA technical meeting of the International Network of Nuclear Reaction Data Centres

    International Nuclear Information System (INIS)

    Schwerer, O.; Dunaeva, S.; S.Dunaeva@iaea.org

    2007-11-01

    An IAEA Technical Meeting of the International Network of Nuclear Reaction Data Centres was held at IAEA Headquarters, Vienna, Austria, from 8 to 10 October 2007. The meeting was attended by 19 participants from 11 cooperating data centres of six Member States and two international organizations. A summary of the meeting is given in this report, along with the conclusions, actions, and status reports of the participating data centres. (author)

  10. Summary Report of the Technical Meeting on International Network of Nuclear Reaction Data Centres

    International Nuclear Information System (INIS)

    Otsuka, Naohiko

    2013-07-01

    This report summarizes the IAEA Technical Meeting on the International Network of Nuclear Reaction Data Centres, held at the IAEA Headquarters in Vienna, Austria from 23 to 25 April 2013. The meeting was attended by 24 participants representing 13 cooperative centres from 8 Member States and 2 International Organisations. A summary of the meeting is given in this report along with the conclusions and actions. (author)

  11. International Code Centres Network. Summary Report of the 3rd Biennial Technical Meeting

    International Nuclear Information System (INIS)

    Chung, Hyun-Kyung

    2013-07-01

    This report summarizes the proceedings of the third Technical Meeting of the International Code Centres Network held on 6-8 May in 2013. Ten experts from seven member states and four IAEA staff members attended the three-day meeting held at the IAEA Headquarters in Vienna to discuss issues on uncertainty estimates of theoretical atomic and molecular data. The report includes discussions on data issues, meeting conclusions and recommendations for the IAEA Atomic and Molecular Data Unit. (author)

  12. Technical Aspects of Atomic and Molecular Data Processing and Exchange, 22nd Meeting of the A+M Data Centres Network. Summary Report of an IAEA Technical Meeting

    International Nuclear Information System (INIS)

    Chung, Hyun-Kyung

    2013-12-01

    This report summarizes the proceedings of the IAEA Technical Meeting on ''Technical Aspects of Atomic and Molecular Data Processing and Exchange'' (22nd Meeting of the A+M Data Centres Network) on 4-6 September 2013. Twelve participants from 8 data centres of 6 Member States attended the three-day meeting held at the IAEA Headquarters in Vienna. The report includes discussions on the data issues, meeting conclusions and recommendations and the abstracts of presentations presented in the meeting. (author)

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

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

  15. Opinion dynamics in activity-driven networks

    Science.gov (United States)

    Li, Dandan; Han, Dun; Ma, Jing; Sun, Mei; Tian, Lixin; Khouw, Timothy; Stanley, H. Eugene

    2017-10-01

    Social interaction between individuals constantly affects the development of their personal opinions. Previous models such as the Deffuant model and the Hegselmann-Krause (HK) model have assumed that individuals only update their opinions after interacting with neighbors whose opinions are similar to their own. However, people are capable of communicating widely with all of their neighbors to gather their ideas and opinions, even if they encounter a number of opposing attitudes. We propose a model in which agents listen to the opinions of all their neighbors. Continuous opinion dynamics are investigated in activity-driven networks with a tolerance threshold. We study how the initial opinion distribution, tolerance threshold, opinion-updating speed, and activity rate affect the evolution of opinion. We find that when the initial fraction of positive opinion is small, all opinions become negative by the end of the simulation. As the initial fraction of positive opinions rises above a certain value —about 0.45— the final fraction of positive opinions sharply increases and eventually equals 1. Increased tolerance threshold δ is found to lead to a more varied final opinion distribution. We also find that if the negative opinion has an initial advantage, the final fraction of negative opinion increases and reaches its peak as the updating speed λ approaches 0.5. Finally we show that the lower the activity rate of individuals, the greater the fluctuation range of their opinions.

  16. SDN-Enabled Dynamic Feedback Control and Sensing in Agile Optical Networks

    Science.gov (United States)

    Lin, Likun

    monitoring sensors. In order to maintain signal quality while optimizing network resources, we find that it is essential to model and update estimates of the physical link impairments in real-time. In this thesis, we consider the key elements required to enable an agile optical network, with contributions as follows: • Control Framework: extended the SDN concept to include the optical transport network through extensions to the OpenFlow (OF) protocol. A unified SDN control plane is built to facilitate control and management capability across the electrical/packet-switched and optical/circuit-switched portions of the network seamlessly. The SDN control plane serves as a platform to abstract the resources of multilayer/multivendor networks. Through this platform, applications can dynamically request the network resources to meet their service requirements. • Use of In-situ Monitors: enabled real-time physical impairment sensing in the control plane using in-situ Optical Performance Monitoring (OPM) and bit error rate (BER) analyzers. OPM and BER values are used as quantitative indicators of the link status and are fed to the control plane through a high-speed data collection interface to form a closed-loop feedback system to enable adaptive resource allocation. • Predictive Network Model: used a network model embedded in the control layer to study the link status. The estimated results of network status is fed into the control decisions to precompute the network resources. The performance of the network model can be enhanced by the sensing results. • Real-Time Control Algorithms: investigated various dynamic resource allocation mechanisms supporting an agile optical network. Intelligent routing and wavelength switching for recovering from traffic impairments is achieved experimentally in the agile optical network within one second. A distance-adaptive spectrum allocation scheme to address transmission impairments caused by cascaded Wavelength Selective Switches (WSS

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

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

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

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

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

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

  3. 78 FR 57621 - First Responder Network Authority Board Meeting

    Science.gov (United States)

    2013-09-19

    ..., close a portion of the meeting as necessary to preserve the confidentiality of commercial or financial... affecting FirstNet, including pending or potential litigation. See 47 U.S.C. 1424(e)(2). Matters To Be...

  4. A User Driven Dynamic Circuit Network Implementation

    Energy Technology Data Exchange (ETDEWEB)

    Guok, Chin; Robertson, David; Chaniotakis, Evangelos; Thompson, Mary; Johnston, William; Tierney, Brian

    2008-10-01

    The requirements for network predictability are becoming increasingly critical to the DoE science community where resources are widely distributed and collaborations are world-wide. To accommodate these emerging requirements, the Energy Sciences Network has established a Science Data Network to provide user driven guaranteed bandwidth allocations. In this paper we outline the design, implementation, and secure coordinated use of such a network, as well as some lessons learned.

  5. Network rewiring dynamics with convergence towards a star network.

    Science.gov (United States)

    Whigham, P A; Dick, G; Parry, M

    2016-10-01

    Network rewiring as a method for producing a range of structures was first introduced in 1998 by Watts & Strogatz ( Nature 393 , 440-442. (doi:10.1038/30918)). This approach allowed a transition from regular through small-world to a random network. The subsequent interest in scale-free networks motivated a number of methods for developing rewiring approaches that converged to scale-free networks. This paper presents a rewiring algorithm (RtoS) for undirected, non-degenerate, fixed size networks that transitions from regular, through small-world and scale-free to star-like networks. Applications of the approach to models for the spread of infectious disease and fixation time for a simple genetics model are used to demonstrate the efficacy and application of the approach.

  6. Report: Information Meeting / Awareness of Actors on the Chemical Information Exchange Network (CIEN)

    International Nuclear Information System (INIS)

    Senghor, Cheikh

    2015-01-01

    As part of the implementation of the Stockholm Convention, Senegal has established a Chemical Information Exchange Network. The overall objective of this meeting was to identify the various actors involved in the management of chemicals information and to study the modalities for the implementation of the chemical information exchange network in Senegal.

  7. Traffic Policing in Dynamic Military Networks Using Software Defined Networking

    OpenAIRE

    Skappel, Hans Fredrik

    2016-01-01

    This thesis looks at how Software Defined Networking (SDN) can be used to provide traffic engineering and to police traffic in an Operational Military Network (OMN). SDN is a concept where the control plane is separated from the forwarding plane, and the control plane is capable of controlling forwarding plane elements located on multiple network nodes using the OpenFlow protocol. Specifically, we have discussed the problems in OMNs, and possible SDN approaches to mitigate the challenges. Bas...

  8. Summary of the first meeting of ASEAN Network of Regulatory Bodies on Atomic Energy (ASEANTOM)

    International Nuclear Information System (INIS)

    Siriratana Biramontri, Pantip Ampornrat

    2013-01-01

    The 1st Meeting of ASEAN Network of Regulatory Bodies on Atomic Energy (ASEANTOM) was organized in Phuket, Thailand on 3 - 4 September, 2013. The meeting was held on annually basis following the Meeting to Finalize the Term of Reference (TOR) in Bangkok, Thailand on 29 August, 2012. The objective of the meeting is to review and finalize TOR, and to set up the action plan of ASEANTOM. The action plan is an expected outcome of the meeting. The Meeting consisted of 41 participants from IAEA and ASEAN Member States (AMS), namely, Cambodia, Laos, Singapore, Indonesia, Malaysia, Myanmar, Philippines, Vietnam and Thailand. Only Brunei Darussalam could not attend the Meeting. Participant's organizations were regulatory body or relevant authorities, and Ministry of Foreign Affairs.

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

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

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

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

  13. Perception of Communication Network Fraud Dynamics by Network ...

    African Journals Online (AJOL)

    In considering the implications of the varied nature of the potential targets, the paper identifies the view to develop effective intelligence analysis methodologies for network fraud detection and prevention by network administrators and stakeholders. The paper further notes that organizations are fighting an increasingly ...

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

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

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

  17. ANCS: Achieving QoS through Dynamic Allocation of Network Resources in Virtualized Clouds

    Directory of Open Access Journals (Sweden)

    Cheol-Ho Hong

    2016-01-01

    Full Text Available To meet the various requirements of cloud computing users, research on guaranteeing Quality of Service (QoS is gaining widespread attention in the field of cloud computing. However, as cloud computing platforms adopt virtualization as an enabling technology, it becomes challenging to distribute system resources to each user according to the diverse requirements. Although ample research has been conducted in order to meet QoS requirements, the proposed solutions lack simultaneous support for multiple policies, degrade the aggregated throughput of network resources, and incur CPU overhead. In this paper, we propose a new mechanism, called ANCS (Advanced Network Credit Scheduler, to guarantee QoS through dynamic allocation of network resources in virtualization. To meet the various network demands of cloud users, ANCS aims to concurrently provide multiple performance policies; these include weight-based proportional sharing, minimum bandwidth reservation, and maximum bandwidth limitation. In addition, ANCS develops an efficient work-conserving scheduling method for maximizing network resource utilization. Finally, ANCS can achieve low CPU overhead via its lightweight design, which is important for practical deployment.

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

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

  20. Global network reorganization during dynamic adaptations of Bacillus subtilis metabolism

    DEFF Research Database (Denmark)

    Buescher, Joerg Martin; Liebermeister, Wolfram; Jules, Matthieu

    2012-01-01

    Adaptation of cells to environmental changes requires dynamic interactions between metabolic and regulatory networks, but studies typically address only one or a few layers of regulation. For nutritional shifts between two preferred carbon sources of Bacillus subtilis, we combined statistical...

  1. Wavelength converter placement in optical networks with dynamic traffic

    DEFF Research Database (Denmark)

    Buron, Jakob Due; Ruepp, Sarah Renée; Wessing, Henrik

    2008-01-01

    We evaluate the connection provisioning performance of GMPLS-controlled wavelength routed networks under dynamic traffic load and using three different wavelength converter placement heuristics. Results show that a simple uniform placement heuristic matches the performance of complex heuristics...

  2. PREFACE: Fourth Meeting on Constrained Dynamics and Quantum Gravity

    Science.gov (United States)

    Cadoni, Mariano; Cavaglia, Marco; Nelson, Jeanette E.

    2006-04-01

    The formulation of a quantum theory of gravity seems to be the unavoidable endpoint of modern theoretical physics. Yet the quantum description of the gravitational field remains elusive. The year 2005 marks the tenth anniversary of the First Meeting on Constrained Dynamics and Quantum Gravity, held in Dubna (Russia) due to the efforts of Alexandre T. Filippov (JINR, Dubna) and Vittorio de Alfaro (University of Torino, Italy). At the heart of this initiative was the desire for an international forum where the status and perspectives of research in quantum gravity could be discussed from the broader viewpoint of modern gauge field theories. Since the Dubna meeting, an increasing number of scientists has joined this quest. Progress was reported in two other conferences in this series: in Santa Margherita Ligure (Italy) in 1996 and in Villasimius (Sardinia, Italy) in 1999. After a few years of ``working silence'' the time was now mature for a new gathering. The Fourth Meeting on Constrained Dynamics and Quantum Gravity (QG05) was held in Cala Gonone (Sardinia, Italy) from Monday 12th to Friday 16th September 2005. Surrounded by beautiful scenery, 100 scientists from 23 countries working in field theory, general relativity and related areas discussed the latest developments in the quantum treatment of gravitational systems. The QG05 edition covered many of the issues that had been addressed in the previous meetings and new interesting developments in the field, such as brane world models, large extra dimensions, analogue models of gravity, non-commutative techniques etc. The format of the meeting was similar to the previous ones. The programme consisted of invited plenary talks and parallel sessions on cosmology, quantum gravity, strings and phenomenology, gauge theories and quantisation and black holes. A major goal was to bring together senior scientists and younger people at the beginning of their scientific career. We were able to give financial support to both

  3. Epidemic dynamics and endemic states in complex networks

    Science.gov (United States)

    Pastor-Satorras, Romualdo; Vespignani, Alessandro

    2001-06-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 that 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 prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks.

  4. Epidemic dynamics and endemic states in complex networks

    International Nuclear Information System (INIS)

    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 that 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 prone to the spreading and the persistence of infections whatever spreading rate the epidemic agents might possess. These results can help understanding computer virus epidemics and other spreading phenomena on communication and social networks

  5. Characterization of Static/Dynamic Topological Routing For Grid Networks

    DEFF Research Database (Denmark)

    Gutierrez Lopez, Jose Manuel; Cuevas, Ruben; Riaz, M. Tahir

    2009-01-01

    Grid or 2D Mesh structures are becoming one of the most attractive network topologies to study. They can be used in many different fields raging from future broadband networks to multiprocessors structures. In addition, the high requirements of future services and applications demand more flexible...... and adaptive networks. Topological routing in grid networks is a simple and efficient alternative to traditional routing techniques, e.g. routing tables, and the paper extends this kind of routing providing a "Dynamic" attribute. This new property attempts to improve the overall network performance for future...

  6. Dynamical Encoding by Networks of Competing Neuron Groups: Winnerless Competition

    International Nuclear Information System (INIS)

    Rabinovich, M.; Volkovskii, A.; Lecanda, P.; Huerta, R.; Abarbanel, H. D. I.; Laurent, G.

    2001-01-01

    Following studies of olfactory processing in insects and fish, we investigate neural networks whose dynamics in phase space is represented by orbits near the heteroclinic connections between saddle regions (fixed points or limit cycles). These networks encode input information as trajectories along the heteroclinic connections. If there are N neurons in the network, the capacity is approximately e(N-1) ! , i.e., much larger than that of most traditional network structures. We show that a small winnerless competition network composed of FitzHugh-Nagumo spiking neurons efficiently transforms input information into a spatiotemporal output

  7. The Graph Laplacian and the Dynamics of Complex Networks

    Energy Technology Data Exchange (ETDEWEB)

    Thulasidasan, Sunil [Los Alamos National Laboratory

    2012-06-11

    In this talk, we explore the structure of networks from a spectral graph-theoretic perspective by analyzing the properties of the Laplacian matrix associated with the graph induced by a network. We will see how the eigenvalues of the graph Laplacian relate to the underlying network structure and dynamics and provides insight into a phenomenon frequently observed in real world networks - the emergence of collective behavior from purely local interactions seen in the coordinated motion of animals and phase transitions in biological networks, to name a few.

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

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

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

  11. 78 FR 38014 - First Responder Network Authority Board Special Meeting

    Science.gov (United States)

    2013-06-25

    ... toll-free 1 (888) 469-3306 and using passcode ``FirstNet.'' Due to the limited number of ports...., Washington, DC 20230: telephone (202) 482-0016; email [email protected] . Please direct media inquiries to... and time of the Special Meeting, members of the public may call toll-free 1 (888) 469-3306 and use...

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

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

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

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

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

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

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

  19. Collaborative Recurrent Neural Networks forDynamic Recommender Systems

    Science.gov (United States)

    2016-11-22

    JMLR: Workshop and Conference Proceedings 63:366–381, 2016 ACML 2016 Collaborative Recurrent Neural Networks for Dynamic Recommender Systems Young...an unprece- dented scale. Although such activity logs are abundantly available, most approaches to recommender systems are based on the rating...Recurrent Neural Network, Recommender System , Neural Language Model, Collaborative Filtering 1. Introduction As ever larger parts of the population

  20. Popularity and Adolescent Friendship Networks : Selection and Influence Dynamics

    NARCIS (Netherlands)

    Dijkstra, Jan Kornelis; Cillessen, Antonius H. N.; Borch, Casey

    This study examined the dynamics of popularity in adolescent friendship networks across 3 years in middle school. Longitudinal social network modeling was used to identify selection and influence in the similarity of popularity among friends. It was argued that lower status adolescents strive to

  1. Popularity and Adolescent Friendship Networks: Selection and Influence Dynamics

    NARCIS (Netherlands)

    Dijkstra, J.K.; Cillessen, A.H.N.; Borch, C.

    2013-01-01

    This study examined the dynamics of popularity in adolescent friendship networks across 3 years in middle school. Longitudinal social network modeling was used to identify selection and influence in the similarity of popularity among friends. It was argued that lower status adolescents strive to

  2. Popularity and Adolescent Friendship Networks: Selection and Influence Dynamics

    Science.gov (United States)

    Dijkstra, Jan Kornelis; Cillessen, Antonius H. N.; Borch, Casey

    2013-01-01

    This study examined the dynamics of popularity in adolescent friendship networks across 3 years in middle school. Longitudinal social network modeling was used to identify selection and influence in the similarity of popularity among friends. It was argued that lower status adolescents strive to enhance their status through befriending higher…

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

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

  5. Developing a dynamic control system for mine compressed air networks

    OpenAIRE

    Van Heerden, S.W.; Pelzer, R.; Marais, J.H.

    2014-01-01

    Mines in general, make use of compressed air systems for daily operational activities. Compressed air on mines is traditionally distributed via compressed air ring networks where multiple shafts are supplied with compressed air from an integral system. These compressed air networks make use of a number of compressors feeding the ring from various locations in the network. While these mines have sophisticated control systems to control these compressors, they are not dynamic systems. Compresso...

  6. Kowledge-based dynamic network safety calculations. Wissensbasierte dynamische Netzsicherheitsberechnungen

    Energy Technology Data Exchange (ETDEWEB)

    Kulicke, B [Inst. fuer Hochspannungstechnik und Starkstromanlagen, Berlin (Germany); Schlegel, S [Inst. fuer Hochspannungstechnik und Starkstromanlagen, Berlin (Germany)

    1993-06-28

    An important part of network operation management is the estimation and maintenance of the security of supply. So far the control personnel has only been supported by static network analyses and safety calculations. The authors describe an expert system, which is coupled to a real time simulation program on a transputer basis, for dynamic network safety calculations. They also introduce the system concept and the most important functions of the expert system. (orig.)

  7. Traffic dynamics on coupled spatial networks

    International Nuclear Information System (INIS)

    Du, Wen-Bo; Zhou, Xing-Lian; Chen, Zhen; Cai, Kai-Quan; Cao, Xian-Bin

    2014-01-01

    With the rapid development of modern traffic, various means of transportation systems make it more convenient and diversified for passengers to travel out. In this paper, we establish a two-layered spatial network model where the low-speed lower layer is a regular lattice and the high-speed upper layer is a scale-free network embedded in the lattice. Passengers will travel along the path with the minimal travel time, and they can transfer from one layer to the other, which will induce extra transfer cost. We extensively investigate the traffic process on these coupled spatial networks and focus on the effect of the parameter α, the speed ratio between two networks. It is found that, as α grows, the network capacity of the coupled networks increases in the early stage and then decreases, indicating that cooperation between the coupled networks will induce the highest network capacity at an optimal α. We then provide an explanation for this non-monotonous dependence from a micro-scope point of view. The travel time reliability is also examined. Both in free-flow state and congestion state, the travel time is linearly related to the Euclidean distance. However, the variance of travel time in the congestion state is remarkably larger than that in the free-flow state, namely, people have to set aside more redundant time in an unreliable traffic system

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

  9. Vaccination intervention on epidemic dynamics in networks

    Science.gov (United States)

    Peng, Xiao-Long; Xu, Xin-Jian; Fu, Xinchu; Zhou, Tao

    2013-02-01

    Vaccination is an important measure available for preventing or reducing the spread of infectious diseases. In this paper, an epidemic model including susceptible, infected, and imperfectly vaccinated compartments is studied on Watts-Strogatz small-world, Barabási-Albert scale-free, and random scale-free networks. The epidemic threshold and prevalence are analyzed. For small-world networks, the effective vaccination intervention is suggested and its influence on the threshold and prevalence is analyzed. For scale-free networks, the threshold is found to be strongly dependent both on the effective vaccination rate and on the connectivity distribution. Moreover, so long as vaccination is effective, it can linearly decrease the epidemic prevalence in small-world networks, whereas for scale-free networks it acts exponentially. These results can help in adopting pragmatic treatment upon diseases in structured populations.

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

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

  12. Fractional Hopfield Neural Networks: Fractional Dynamic Associative Recurrent Neural Networks.

    Science.gov (United States)

    Pu, Yi-Fei; Yi, Zhang; Zhou, Ji-Liu

    2017-10-01

    This paper mainly discusses a novel conceptual framework: fractional Hopfield neural networks (FHNN). As is commonly known, fractional calculus has been incorporated into artificial neural networks, mainly because of its long-term memory and nonlocality. Some researchers have made interesting attempts at fractional neural networks and gained competitive advantages over integer-order neural networks. Therefore, it is naturally makes one ponder how to generalize the first-order Hopfield neural networks to the fractional-order ones, and how to implement FHNN by means of fractional calculus. We propose to introduce a novel mathematical method: fractional calculus to implement FHNN. First, we implement fractor in the form of an analog circuit. Second, we implement FHNN by utilizing fractor and the fractional steepest descent approach, construct its Lyapunov function, and further analyze its attractors. Third, we perform experiments to analyze the stability and convergence of FHNN, and further discuss its applications to the defense against chip cloning attacks for anticounterfeiting. The main contribution of our work is to propose FHNN in the form of an analog circuit by utilizing a fractor and the fractional steepest descent approach, construct its Lyapunov function, prove its Lyapunov stability, analyze its attractors, and apply FHNN to the defense against chip cloning attacks for anticounterfeiting. A significant advantage of FHNN is that its attractors essentially relate to the neuron's fractional order. FHNN possesses the fractional-order-stability and fractional-order-sensitivity characteristics.

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

  14. Stochastic Online Learning in Dynamic Networks under Unknown Models

    Science.gov (United States)

    2016-08-02

    The key is to develop online learning strategies at each individual node. Specifically, through local information exchange with its neighbors, each...infinitely repeated game with incomplete information and developed a dynamic pricing strategy referred to as Competitive and Cooperative Demand Learning...Stochastic Online Learning in Dynamic Networks under Unknown Models This research aims to develop fundamental theories and practical algorithms for

  15. The Dynamics of network and dyad level supply management

    DEFF Research Database (Denmark)

    Ellegaard, Chris

    -supplier relation and its immediate network context, are presented. In analysing the data, the dynamic interdependency between management of one level and management of the other, will be demonstrated. The analysis reveals a need for an alternating approach to supply management, which takes the dynamic complexity...

  16. Classification of networks of automata by dynamical mean field theory

    International Nuclear Information System (INIS)

    Burda, Z.; Jurkiewicz, J.; Flyvbjerg, H.

    1990-01-01

    Dynamical mean field theory is used to classify the 2 24 =65,536 different networks of binary automata on a square lattice with nearest neighbour interactions. Application of mean field theory gives 700 different mean field classes, which fall in seven classes of different asymptotic dynamics characterized by fixed points and two-cycles. (orig.)

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

  18. Spatial price dynamics: From complex network perspective

    Science.gov (United States)

    Li, Y. L.; Bi, J. T.; Sun, H. J.

    2008-10-01

    The spatial price problem means that if the supply price plus the transportation cost is less than the demand price, there exists a trade. Thus, after an amount of exchange, the demand price will decrease. This process is continuous until an equilibrium state is obtained. However, how the trade network structure affects this process has received little attention. In this paper, we give a evolving model to describe the levels of spatial price on different complex network structures. The simulation results show that the network with shorter path length is sensitive to the variation of prices.

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

  20. Scalable Approaches to Control Network Dynamics: Prospects for City Networks

    Science.gov (United States)

    Motter, Adilson E.; Gray, Kimberly A.

    2014-07-01

    A city is a complex, emergent system and as such can be conveniently represented as a network of interacting components. A fundamental aspect of networks is that the systemic properties can depend as much on the interactions as they depend on the properties of the individual components themselves. Another fundamental aspect is that changes to one component can affect other components, in a process that may cause the entire or a substantial part of the system to change behavior. Over the past 2 decades, much research has been done on the modeling of large and complex networks involved in communication and transportation, disease propagation, and supply chains, as well as emergent phenomena, robustness and optimization in such systems...

  1. Networks in contexts : How meeting opportunities affect personal relationships

    NARCIS (Netherlands)

    Mollenhorst, G.W.|info:eu-repo/dai/nl/304835153

    2009-01-01

    From a sociological perspective, this study challenges the idea that personal relationships and networks are a simple result of an individual’s preferences for certain types of associates. The social contexts we enter in our daily lives, such as the work place, the family, the neighborhood, clubs

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

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

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

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

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

  7. Dynamic Virtual LANs for Adaptive Network Security

    National Research Council Canada - National Science Library

    Merani, Diego; Berni, Alessandro; Leonard, Michel

    2004-01-01

    The development of Network-Enabled capabilities in support of undersea research requires architectures for the interconnection and data sharing that are flexible, scalable, and built on open standards...

  8. Value network dynamics and industry evolution

    NARCIS (Netherlands)

    Vermeulen, B.

    2012-01-01

    Machines, appliances, and consumption goods are developed and produced in value networks populated by firms ranging from final assemblers, component suppliers, complement providers, the suppliers’ suppliers, all the way upstream to firms that extrude raw material. Evolutionary models of industry

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

  10. Network Reconstruction of Dynamic Biological Systems

    OpenAIRE

    Asadi, Behrang

    2013-01-01

    Inference of network topology from experimental data is a central endeavor in biology, since knowledge of the underlying signaling mechanisms a requirement for understanding biological phenomena. As one of the most important tools in bioinformatics area, development of methods to reconstruct biological networks has attracted remarkable attention in the current decade. Integration of different data types can lead to remarkable improvements in our ability to identify the connectivity of differe...

  11. Connectivity, topology and dynamics in climate networks

    Czech Academy of Sciences Publication Activity Database

    Paluš, Milan; Hartman, David; Hlinka, Jaroslav; Vejmelka, Martin

    2012-01-01

    Roč. 14, - (2012), s. 8397 ISSN 1607-7962. [European Geosciences Union General Assembly 2012. 22.04.2012-27.04.2012, Vienna] R&D Projects: GA ČR GCP103/11/J068 Institutional support: RVO:67985807 Keywords : complex networks * climate network * connectivity * entropy rate * El Nino Southern Oscillation * North Atlantic Oscillation Subject RIV: BB - Applied Statistics, Operational Research

  12. Dynamic Aggregation Protocol for Wireless Sensor Networks

    OpenAIRE

    Mounir Said , Adel; William Ibrahim , Ashraf; Soua , Ahmed; Afifi , Hossam

    2013-01-01

    International audience; Sensor networks suffer from limited capabilities such as bandwidth, low processing power, and memory size. There is therefore a need for protocols that deliver sensor data in an energy-efficient way to the sink. One of those techniques, it gathers sensors' data in a small size packet suitable for transmission. In this paper, we propose a new Effective Data Aggregation Protocol (DAP) to reduce the energy consumption in Wireless Sensor Networks (WSNs), which prolongs the...

  13. Analysing Stagecoach Network Problem Using Dynamic ...

    African Journals Online (AJOL)

    In this paper we present a recursive dynamic programming algorithm for solving the stagecoach problem. The algorithm is computationally more efficient than the first method as it obtains its minimum total cost using the suboptimal policies of the different stages without computing the cost of all the routes. By the dynamic ...

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

  15. A Scalable Distribution Network Risk Evaluation Framework via Symbolic Dynamics

    Science.gov (United States)

    Yuan, Kai; Liu, Jian; Liu, Kaipei; Tan, Tianyuan

    2015-01-01

    Background Evaluations of electric power distribution network risks must address the problems of incomplete information and changing dynamics. A risk evaluation framework should be adaptable to a specific situation and an evolving understanding of risk. Methods This study investigates the use of symbolic dynamics to abstract raw data. After introducing symbolic dynamics operators, Kolmogorov-Sinai entropy and Kullback-Leibler relative entropy are used to quantitatively evaluate relationships between risk sub-factors and main factors. For layered risk indicators, where the factors are categorized into four main factors – device, structure, load and special operation – a merging algorithm using operators to calculate the risk factors is discussed. Finally, an example from the Sanya Power Company is given to demonstrate the feasibility of the proposed method. Conclusion Distribution networks are exposed and can be affected by many things. The topology and the operating mode of a distribution network are dynamic, so the faults and their consequences are probabilistic. PMID:25789859

  16. Cytoskeleton dynamics: Fluctuations within the network

    International Nuclear Information System (INIS)

    Bursac, Predrag; Fabry, Ben; Trepat, Xavier; Lenormand, Guillaume; Butler, James P.; Wang, Ning; Fredberg, Jeffrey J.; An, Steven S.

    2007-01-01

    Out-of-equilibrium systems, such as the dynamics of a living cytoskeleton (CSK), are inherently noisy with fluctuations arising from the stochastic nature of the underlying biochemical and molecular events. Recently, such fluctuations within the cell were characterized by observing spontaneous nano-scale motions of an RGD-coated microbead bound to the cell surface [Bursac et al., Nat. Mater. 4 (2005) 557-561]. While these reported anomalous bead motions represent a molecular level reorganization (remodeling) of microstructures in contact with the bead, a precise nature of these cytoskeletal constituents and forces that drive their remodeling dynamics are largely unclear. Here, we focused upon spontaneous motions of an RGD-coated bead and, in particular, assessed to what extent these motions are attributable to (i) bulk cell movement (cell crawling), (ii) dynamics of focal adhesions, (iii) dynamics of lipid membrane, and/or (iv) dynamics of the underlying actin CSK driven by myosin motors

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

  18. The US nuclear reaction data network. Summary of the first meeting, March 13 ampersand 14 1996

    International Nuclear Information System (INIS)

    1996-03-01

    The first meeting of the US Nuclear Reaction Data Network (USNRDN) was held at the Colorado School of Mines, March 13-14, 1996 chaired by F. Edward Cecil. The Agenda of the meeting is attached. The Network, its mission, products and services; related nuclear data and data networks, members, and organization are described in Attachment 1. The following progress reports from the members of the USNRDN were distributed prior to the meeting and are given as Attachment 2. (1) Measurements and Development of Analytic Techniques for Basic Nuclear Physics and Nuclear Applications; (2) Nuclear Reaction Data Activities at the National Nuclear Data Center; (3) Studies of nuclear reactions at very low energies; (4) Nuclear Reaction Data Activities, Nuclear Data Group; (5) Progress in Neutron Physics at Los Alamos - Experiments; (6) Nuclear Reaction Data Activities in Group T2; (7) Progress Report for the US Nuclear Reaction Data Network Meeting; (8) Nuclear Astrophysics Research Group (ORNL); (9) Progress Report from Ohio University; (10) Exciton Model Phenomenology; and (11) Progress Report for Coordination Meeting USNRDN

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

  20. Announced document collection of the 3rd information exchange meeting on radioactive waste disposal research network

    International Nuclear Information System (INIS)

    2008-03-01

    The 3rd meeting on 'Radioactive Waste Disposal Research Network' was held at the Ricotti techno community square of JAEA on September 3 and 4, 2007. The 'Radioactive Waste Disposal Research Network' was established in Interorganization Atomic Energy Research Program under academic collaborative agreement between Japan Atomic Energy Agency and the University of Tokyo. The objective is to bring both research infrastructures and human expertise in Japan to an adequate performance level, thereby contributing to the development of the fundamental research area in the field of radioactive waste disposal. This lecture material is a collection of presentations and discussions during the information exchange meeting. (author)

  1. Summary Report of the Technical Meeting on International Network of Nuclear Reaction Data Centres

    International Nuclear Information System (INIS)

    Otuka, Naohiko; Herman, Michal

    2016-07-01

    This report summarizes the IAEA Technical Meeting on the International Network of Nuclear Reaction Data Centres held at the China Hall of Science and Technology in Beijing, China from 7 to 10 June 2016. The meeting was attended by 23 participants representing 13 cooperative Centres from 8 Member States (China, Hungary, India, Japan, Korea, Russia, Ukraine and USA) and 2 International Organisations (NEA, IAEA) as well as two participants from Kazakhstan. A summary of the meeting is given in this report along with the conclusions and actions. (author)

  2. Mapping dynamic social networks in real life using participants' own smartphones

    Directory of Open Access Journals (Sweden)

    Tjeerd W. Boonstra

    2015-11-01

    Full Text Available Interpersonal relationships are vital for our daily functioning and wellbeing. Social networks may form the primary means by which environmental influences determine individual traits. Several studies have shown the influence of social networks on decision-making, behaviors and wellbeing. Smartphones have great potential for measuring social networks in a real world setting. Here we tested the feasibility of using people's own smartphones as a data collection platform for face-to-face interactions. We developed an application for iOS and Android to collect Bluetooth data and acquired one week of data from 14 participants in our organization. The Bluetooth scanning statistics were used to quantify the time-resolved connection strength between participants and define the weights of a dynamic social network. We used network metrics to quantify changes in network topology over time and non-negative matrix factorization to identify cliques or subgroups that reoccurred during the week. The scanning rate varied considerably between smartphones running Android and iOS and egocentric networks metrics were correlated with the scanning rate. The time courses of two identified subgroups matched with two meetings that took place that week. These findings demonstrate the feasibility of using participants' own smartphones to map social network, whilst identifying current limitations of using generic smartphones. The bias introduced by variations in scanning rate and missing data is an important limitation that needs to be addressed in future studies.

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

    Directory of Open Access Journals (Sweden)

    Francisco eAboitiz

    2014-03-01

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

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

  5. Employing Deceptive Dynamic Network Topology Through Software-Defined Networking

    Science.gov (United States)

    2014-03-01

    actions. From [64] . . . . . 37 xi THIS PAGE INTENTIONALLY LEFT BLANK xii List of Acronyms and Abbreviations ACL Access Control List API Application...can be extremely useful in topology mapping through various latency-based geolocation methods [35], [36], [37]. PING 1 7 2 . 2 0 . 5 . 2 ( 1 7 2 . 2 0...defined northbound Applica- tion Programming Interfaces ( APIs ). Figure 3.1: Software-Defined Network Architecture. From [8] 29 3.3 SDN OpenFlow

  6. Recruitment dynamics in adaptive social networks

    International Nuclear Information System (INIS)

    Shkarayev, Maxim S; Shaw, Leah B; Schwartz, Ira B

    2013-01-01

    We model recruitment in adaptive social networks in the presence of birth and death processes. Recruitment is characterized by nodes changing their status to that of the recruiting class as a result of contact with recruiting nodes. Only a susceptible subset of nodes can be recruited. The recruiting individuals may adapt their connections in order to improve recruitment capabilities, thus changing the network structure adaptively. We derive a mean-field theory to predict the dependence of the growth threshold of the recruiting class on the adaptation parameter. Furthermore, we investigate the effect of adaptation on the recruitment level, as well as on network topology. The theoretical predictions are compared with direct simulations of the full system. We identify two parameter regimes with qualitatively different bifurcation diagrams depending on whether nodes become susceptible frequently (multiple times in their lifetime) or rarely (much less than once per lifetime). (paper)

  7. Recruitment dynamics in adaptive social networks

    Science.gov (United States)

    Shkarayev, Maxim S.; Schwartz, Ira B.; Shaw, Leah B.

    2013-06-01

    We model recruitment in adaptive social networks in the presence of birth and death processes. Recruitment is characterized by nodes changing their status to that of the recruiting class as a result of contact with recruiting nodes. Only a susceptible subset of nodes can be recruited. The recruiting individuals may adapt their connections in order to improve recruitment capabilities, thus changing the network structure adaptively. We derive a mean-field theory to predict the dependence of the growth threshold of the recruiting class on the adaptation parameter. Furthermore, we investigate the effect of adaptation on the recruitment level, as well as on network topology. The theoretical predictions are compared with direct simulations of the full system. We identify two parameter regimes with qualitatively different bifurcation diagrams depending on whether nodes become susceptible frequently (multiple times in their lifetime) or rarely (much less than once per lifetime).

  8. Dynamic artificial neural networks with affective systems.

    Directory of Open Access Journals (Sweden)

    Catherine D Schuman

    Full Text Available Artificial neural networks (ANNs are processors that are trained to perform particular tasks. We couple a computational ANN with a simulated affective system in order to explore the interaction between the two. In particular, we design a simple affective system that adjusts the threshold values in the neurons of our ANN. The aim of this paper is to demonstrate that this simple affective system can control the firing rate of the ensemble of neurons in the ANN, as well as to explore the coupling between the affective system and the processes of long term potentiation (LTP and long term depression (LTD, and the effect of the parameters of the affective system on its performance. We apply our networks with affective systems to a simple pole balancing example and briefly discuss the effect of affective systems on network performance.

  9. Cortical electrophysiological network dynamics of feedback learning

    NARCIS (Netherlands)

    Cohen, M.X.; Wilmes, K.A.; van de Vijver, I.

    2011-01-01

    Understanding the neurophysiological mechanisms of learning is important for both fundamental and clinical neuroscience. We present a neurophysiologically inspired framework for understanding cortical mechanisms of feedback-guided learning. This framework is based on dynamic changes in systems-level

  10. The topology and dynamics of complex networks

    Science.gov (United States)

    Dezso, Zoltan

    We start with a brief introduction about the topological properties of real networks. Most real networks are scale-free, being characterized by a power-law degree distribution. The scale-free nature of real networks leads to unexpected properties such as the vanishing epidemic threshold. Traditional methods aiming to reduce the spreading rate of viruses cannot succeed on eradicating the epidemic on a scale-free network. We demonstrate that policies that discriminate between the nodes, curing mostly the highly connected nodes, can restore a finite epidemic threshold and potentially eradicate the virus. We find that the more biased a policy is towards the hubs, the more chance it has to bring the epidemic threshold above the virus' spreading rate. We continue by studying a large Web portal as a model system for a rapidly evolving network. We find that the visitation pattern of a news document decays as a power law, in contrast with the exponential prediction provided by simple models of site visitation. This is rooted in the inhomogeneous nature of the browsing pattern characterizing individual users: the time interval between consecutive visits by the same user to the site follows a power law distribution, in contrast with the exponential expected for Poisson processes. We show that the exponent characterizing the individual user's browsing patterns determines the power-law decay in a document's visitation. Finally, we turn our attention to biological networks and demonstrate quantitatively that protein complexes in the yeast, Saccharomyces cerevisiae, are comprised of a core in which subunits are highly coexpressed, display the same deletion phenotype (essential or non-essential) and share identical functional classification and cellular localization. The results allow us to define the deletion phenotype and cellular task of most known complexes, and to identify with high confidence the biochemical role of hundreds of proteins with yet unassigned functionality.

  11. Reliability-based Dynamic Network Design with Stochastic Networks

    NARCIS (Netherlands)

    Li, H.

    2009-01-01

    Transportation systems are stochastic and dynamic systems. The road capacities and the travel demand are fluctuating from time to time within a day and at the same time from day to day. For road users, the travel time and travel costs experienced over time and space are stochastic, thus desire

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

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

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

  15. SSC Tenant Meeting: NASA Near Earth Network (NEN) Overview

    Science.gov (United States)

    Carter, David; Larsen, David; Baldwin, Philip; Wilson, Cristy; Ruley, LaMont

    2018-01-01

    The Near Earth Network (NEN) consists of globally distributed tracking stations that are strategically located throughout the world which provide Telemetry, Tracking, and Commanding (TTC) services support to a variety of orbital and suborbital flight missions, including Low Earth Orbit (LEO), Geosynchronous Earth Orbit (GEO), highly elliptical, and lunar orbits. Swedish Space Corporation (SSC), which is one of the NEN Commercial Service Provider, has provided the NEN with TTC services support from its Alaska, Hawaii, Chile and Sweden. The presentation will give an overview of the NEN and its support from SSC.

  16. Maths Meets Myths: Network Investigations of Ancient Narratives

    Science.gov (United States)

    Kenna, Ralph; Mac Carron, Pádraig

    2016-02-01

    Three years ago, we initiated a programme of research in which ideas and tools from statistical physics and network theory were applied to the field of comparative mythology. The eclecticism of the work, together with the perspectives it delivered, led to widespread media coverage and academic discussion. Here we review some aspects of the project, contextualised with a brief history of the long relationship between science and the humanities. We focus in particular on an Irish epic, summarising some of the outcomes of our quantitative investigation. We also describe the emergence of a new sub-discipline and our hopes for its future.

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

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

  19. Robust adaptive synchronization of general dynamical networks ...

    Indian Academy of Sciences (India)

    Home; Journals; Pramana – Journal of Physics; Volume 86; Issue 6. Robust ... A robust adaptive synchronization scheme for these general complex networks with multiple delays and uncertainties is established and raised by employing the robust adaptive control principle and the Lyapunov stability theory. We choose ...

  20. Dynamic Optical Networks for Future Internet Environments

    Science.gov (United States)

    Matera, Francesco

    2014-05-01

    This article reports an overview on the evolution of the optical network scenario taking into account the exponential growth of connected devices, big data, and cloud computing that is driving a concrete transformation impacting the information and communication technology world. This hyper-connected scenario is deeply affecting relationships between individuals, enterprises, citizens, and public administrations, fostering innovative use cases in practically any environment and market, and introducing new opportunities and new challenges. The successful realization of this hyper-connected scenario depends on different elements of the ecosystem. In particular, it builds on connectivity and functionalities allowed by converged next-generation networks and their capacity to support and integrate with the Internet of Things, machine-to-machine, and cloud computing. This article aims at providing some hints of this scenario to contribute to analyze impacts on optical system and network issues and requirements. In particular, the role of the software-defined network is investigated by taking into account all scenarios regarding data centers, cloud computing, and machine-to-machine and trying to illustrate all the advantages that could be introduced by advanced optical communications.

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

    Science.gov (United States)

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

    2017-05-01

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

  2. Supporting Dynamic Adaptive Streaming over HTTP in Wireless Meshed Networks using Random Linear Network Coding

    DEFF Research Database (Denmark)

    Hundebøll, Martin; Pedersen, Morten Videbæk; Roetter, Daniel Enrique Lucani

    2014-01-01

    This work studies the potential and impact of the FRANC network coding protocol for delivering high quality Dynamic Adaptive Streaming over HTTP (DASH) in wireless networks. Although DASH aims to tailor the video quality rate based on the available throughput to the destination, it relies...

  3. Dynamic Network Security Control Using Software Defined Networking

    Science.gov (United States)

    2016-03-24

    technologies such as Open vSwitch (OVS) [26], OpenFlow [22], Cisco Nexus 5000V [27], and IBM 5000V [28]. 2.2.4 OpenFlow. The Open Networking Foundation...companies with more than 64 OpenFlow products on the market . Since 2009, ONF released four major revisions to OpenFlow and the latest proposed...2015 from http://www.openvswitch.org, 2014. 27. Cisco Systems. Cisco Nexus 5000 Series Architecture. Retrieved 9 Oc- tober, 2015 from http

  4. Technical Aspects of Atomic and Molecular Data Processing and Exchange, 21. Meeting of the A+M Data Centres Network. Summary Report of an IAEA Technical Meeting

    International Nuclear Information System (INIS)

    Chung, H.-K.

    2011-11-01

    This report summarizes the proceedings of the IAEA Technical Meeting on 'Technical Aspects of Atomic and Molecular Data Processing and Exchange' (21st Meeting of the A+M Data Centres Network) on 7-9 September 2011. Fourteen participants from 12 data centres of 7 Member States and 2 International Organizations attended the three-day meeting held at the IAEA Headquarters in Vienna. The report includes discussions on the data issues, meeting conclusions and recommendations and the abstracts of presentations presented in the meeting. (author)

  5. Technical Aspects of Atomic and Molecular Data Processing and Exchange, 21. Meeting of the A+M Data Centres Network. Summary Report of an IAEA Technical Meeting

    Energy Technology Data Exchange (ETDEWEB)

    Chung, H.-K., E-mail: H.Chung@iaea.org [IAEA, Atomic and Molecular Data Unit, Vienna (Austria)

    2011-11-15

    This report summarizes the proceedings of the IAEA Technical Meeting on 'Technical Aspects of Atomic and Molecular Data Processing and Exchange' (21st Meeting of the A+M Data Centres Network) on 7-9 September 2011. Fourteen participants from 12 data centres of 7 Member States and 2 International Organizations attended the three-day meeting held at the IAEA Headquarters in Vienna. The report includes discussions on the data issues, meeting conclusions and recommendations and the abstracts of presentations presented in the meeting. (author)

  6. Exploring the evolution of node neighborhoods in Dynamic Networks

    Science.gov (United States)

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

    2017-09-01

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

  7. A mathematical programming approach for sequential clustering of dynamic networks

    Science.gov (United States)

    Silva, Jonathan C.; Bennett, Laura; Papageorgiou, Lazaros G.; Tsoka, Sophia

    2016-02-01

    A common analysis performed on dynamic networks is community structure detection, a challenging problem that aims to track the temporal evolution of network modules. An emerging area in this field is evolutionary clustering, where the community structure of a network snapshot is identified by taking into account both its current state as well as previous time points. Based on this concept, we have developed a mixed integer non-linear programming (MINLP) model, SeqMod, that sequentially clusters each snapshot of a dynamic network. The modularity metric is used to determine the quality of community structure of the current snapshot and the historical cost is accounted for by optimising the number of node pairs co-clustered at the previous time point that remain so in the current snapshot partition. Our method is tested on social networks of interactions among high school students, college students and members of the Brazilian Congress. We show that, for an adequate parameter setting, our algorithm detects the classes that these students belong more accurately than partitioning each time step individually or by partitioning the aggregated snapshots. Our method also detects drastic discontinuities in interaction patterns across network snapshots. Finally, we present comparative results with similar community detection methods for time-dependent networks from the literature. Overall, we illustrate the applicability of mathematical programming as a flexible, adaptable and systematic approach for these community detection problems. Contribution to the Topical Issue "Temporal Network Theory and Applications", edited by Petter Holme.

  8. Distributed dynamic simulations of networked control and building performance applications.

    Science.gov (United States)

    Yahiaoui, Azzedine

    2018-02-01

    The use of computer-based automation and control systems for smart sustainable buildings, often so-called Automated Buildings (ABs), has become an effective way to automatically control, optimize, and supervise a wide range of building performance applications over a network while achieving the minimum energy consumption possible, and in doing so generally refers to Building Automation and Control Systems (BACS) architecture. Instead of costly and time-consuming experiments, this paper focuses on using distributed dynamic simulations to analyze the real-time performance of network-based building control systems in ABs and improve the functions of the BACS technology. The paper also presents the development and design of a distributed dynamic simulation environment with the capability of representing the BACS architecture in simulation by run-time coupling two or more different software tools over a network. The application and capability of this new dynamic simulation environment are demonstrated by an experimental design in this paper.

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

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

  11. Node-Dependence-Based Dynamic Incentive Algorithm in Opportunistic Networks

    Directory of Open Access Journals (Sweden)

    Ruiyun Yu

    2014-01-01

    Full Text Available Opportunistic networks lack end-to-end paths between source nodes and destination nodes, so the communications are mainly carried out by the “store-carry-forward” strategy. Selfish behaviors of rejecting packet relay requests will severely worsen the network performance. Incentive is an efficient way to reduce selfish behaviors and hence improves the reliability and robustness of the networks. In this paper, we propose the node-dependence-based dynamic gaming incentive (NDI algorithm, which exploits the dynamic repeated gaming to motivate nodes relaying packets for other nodes. The NDI algorithm presents a mechanism of tolerating selfish behaviors of nodes. Reward and punishment methods are also designed based on the node dependence degree. Simulation results show that the NDI algorithm is effective in increasing the delivery ratio and decreasing average latency when there are a lot of selfish nodes in the opportunistic networks.

  12. Triadic closure dynamics drives scaling laws in social multiplex networks

    International Nuclear Information System (INIS)

    Klimek, Peter; Thurner, Stefan

    2013-01-01

    Social networks exhibit scaling laws for several structural characteristics, such as degree distribution, scaling of the attachment kernel and clustering coefficients as a function of node degree. A detailed understanding if and how these scaling laws are inter-related is missing so far, let alone whether they can be understood through a common, dynamical principle. We propose a simple model for stationary network formation and show that the three mentioned scaling relations follow as natural consequences of triadic closure. The validity of the model is tested on multiplex data from a well-studied massive multiplayer online game. We find that the three scaling exponents observed in the multiplex data for the friendship, communication and trading networks can simultaneously be explained by the model. These results suggest that triadic closure could be identified as one of the fundamental dynamical principles in social multiplex network formation. (paper)

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

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

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

  16. Fostering participation in learning networks by using reward systems and face-to-face meetings

    NARCIS (Netherlands)

    Hummel, Hans; Tattersall, Colin; Burgos, Daniel; Brouns, Francis; Koper, Rob

    2006-01-01

    Hummel, H. G. K., Tattersall, C., Burgos, D., Brouns, F. M. R., & Koper, E. J. R. (Submitted). Fostering participation in learning networks by using reward systems and face-to-face meetings. In Proceedings of ICALT 2006 Conference. July 5-7, Kerkrade, The Netherlands

  17. Capacity planning of link restorable optical networks under dynamic change of traffic

    Science.gov (United States)

    Ho, Kwok Shing; Cheung, Kwok Wai

    2005-11-01

    Future backbone networks shall require full-survivability and support dynamic changes of traffic demands. The Generalized Survivable Networks (GSN) was proposed to meet these challenges. GSN is fully-survivable under dynamic traffic demand changes, so it offers a practical and guaranteed characterization framework for ASTN / ASON survivable network planning and bandwidth-on-demand resource allocation 4. The basic idea of GSN is to incorporate the non-blocking network concept into the survivable network models. In GSN, each network node must specify its I/O capacity bound which is taken as constraints for any allowable traffic demand matrix. In this paper, we consider the following generic GSN network design problem: Given the I/O bounds of each network node, find a routing scheme (and the corresponding rerouting scheme under failure) and the link capacity assignment (both working and spare) which minimize the cost, such that any traffic matrix consistent with the given I/O bounds can be feasibly routed and it is single-fault tolerant under the link restoration scheme. We first show how the initial, infeasible formal mixed integer programming formulation can be transformed into a more feasible problem using the duality transformation of the linear program. Then we show how the problem can be simplified using the Lagrangian Relaxation approach. Previous work has outlined a two-phase approach for solving this problem where the first phase optimizes the working capacity assignment and the second phase optimizes the spare capacity assignment. In this paper, we present a jointly optimized framework for dimensioning the survivable optical network with the GSN model. Experiment results show that the jointly optimized GSN can bring about on average of 3.8% cost savings when compared with the separate, two-phase approach. Finally, we perform a cost comparison and show that GSN can be deployed with a reasonable cost.

  18. Dynamics of macro- and microscopic neural networks

    DEFF Research Database (Denmark)

    Mikkelsen, Kaare

    2014-01-01

    that the method continues to find use, of which examples are presented. In the second part of the thesis, numerical simulations of networks of neurons are described. To simplify the analysis, a relatively simpled neuron model - Leaky Integrate and Fire - is chosen. The strengths of the connections between...... shown that the syncronizing effect of the plasticity disappears when the strengths of the connections are frozen in time. Subsequently, the so-called ``Sisyphus'' mechanism is discussed, which is shown to cause slow fluctuations in the both the network synchronization and the strengths...... in groups of high internal syncronization. It is demonstrated that these states are exceedingly robust towards additive noise. Studies of simulations such as these are important, in that simple models grant us an efficient way to investigat...

  19. An Efficient Dynamic Trust Evaluation Model for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Zhengwang Ye

    2017-01-01

    Full Text Available Trust evaluation is an effective method to detect malicious nodes and ensure security in wireless sensor networks (WSNs. In this paper, an efficient dynamic trust evaluation model (DTEM for WSNs is proposed, which implements accurate, efficient, and dynamic trust evaluation by dynamically adjusting the weights of direct trust and indirect trust and the parameters of the update mechanism. To achieve accurate trust evaluation, the direct trust is calculated considering multitrust including communication trust, data trust, and energy trust with the punishment factor and regulating function. The indirect trust is evaluated conditionally by the trusted recommendations from a third party. Moreover, the integrated trust is measured by assigning dynamic weights for direct trust and indirect trust and combining them. Finally, we propose an update mechanism by a sliding window based on induced ordered weighted averaging operator to enhance flexibility. We can dynamically adapt the parameters and the interactive history windows number according to the actual needs of the network to realize dynamic update of direct trust value. Simulation results indicate that the proposed dynamic trust model is an efficient dynamic and attack-resistant trust evaluation model. Compared with existing approaches, the proposed dynamic trust model performs better in defending multiple malicious attacks.

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

  1. Dynamics in a delayed-neural network

    International Nuclear Information System (INIS)

    Yuan Yuan

    2007-01-01

    In this paper, we consider a neural network of four identical neurons with time-delayed connections. Some parameter regions are given for global, local stability and synchronization using the theory of functional differential equations. The root distributions in the corresponding characteristic transcendental equation are analyzed, Pitchfork bifurcation, Hopf and equivariant Hopf bifurcations are investigated by revealing the center manifolds and normal forms. Numerical simulations are shown the agreements with the theoretical results

  2. Dynamic queuing transmission model for dynamic network loading

    DEFF Research Database (Denmark)

    Raovic, Nevena; Nielsen, Otto Anker; Prato, Carlo Giacomo

    2017-01-01

    and allowing for the representation of multiple vehicle classes, queue spillbacks and shock waves. The model assumes that a link is split into a moving part plus a queuing part, and p that traffic dynamics are given by a triangular fundamental diagram. A case-study is investigated and the DQTM is compared...

  3. Spatiotemporal Dynamics and Reliable Computations in Recurrent Spiking Neural Networks

    Science.gov (United States)

    Pyle, Ryan; Rosenbaum, Robert

    2017-01-01

    Randomly connected networks of excitatory and inhibitory spiking neurons provide a parsimonious model of neural variability, but are notoriously unreliable for performing computations. We show that this difficulty is overcome by incorporating the well-documented dependence of connection probability on distance. Spatially extended spiking networks exhibit symmetry-breaking bifurcations and generate spatiotemporal patterns that can be trained to perform dynamical computations under a reservoir computing framework.

  4. Spatiotemporal Dynamics and Reliable Computations in Recurrent Spiking Neural Networks.

    Science.gov (United States)

    Pyle, Ryan; Rosenbaum, Robert

    2017-01-06

    Randomly connected networks of excitatory and inhibitory spiking neurons provide a parsimonious model of neural variability, but are notoriously unreliable for performing computations. We show that this difficulty is overcome by incorporating the well-documented dependence of connection probability on distance. Spatially extended spiking networks exhibit symmetry-breaking bifurcations and generate spatiotemporal patterns that can be trained to perform dynamical computations under a reservoir computing framework.

  5. SEWER NETWORK DISCHARGE OPTIMIZATION USING THE DYNAMIC PROGRAMMING

    Directory of Open Access Journals (Sweden)

    Viorel MINZU

    2015-12-01

    Full Text Available It is necessary to adopt an optimal control that allows an efficient usage of the existing sewer networks, in order to avoid the building of new retention facilities. The main objective of the control action is to minimize the overflow volume of a sewer network. This paper proposes a method to apply a solution obtained by discrete dynamic programming through a realistic closed loop system.

  6. Feasibility of solid oxide fuel cell dynamic hydrogen coproduction to meet building demand

    Science.gov (United States)

    Shaffer, Brendan; Brouwer, Jacob

    2014-02-01

    A dynamic internal reforming-solid oxide fuel cell system model is developed and used to simulate the coproduction of electricity and hydrogen while meeting the measured dynamic load of a typical southern California commercial building. The simulated direct internal reforming-solid oxide fuel cell (DIR-SOFC) system is controlled to become an electrical load following device that well follows the measured building load data (3-s resolution). The feasibility of the DIR-SOFC system to meet the dynamic building demand while co-producing hydrogen is demonstrated. The resulting thermal responses of the system to the electrical load dynamics as well as those dynamics associated with the filling of a hydrogen collection tank are investigated. The DIR-SOFC system model also allows for resolution of the fuel cell species and temperature distributions during these dynamics since thermal gradients are a concern for DIR-SOFC.

  7. Stochastic population dynamic models as probability networks

    Science.gov (United States)

    M.E. and D.C. Lee. Borsuk

    2009-01-01

    The dynamics of a population and its response to environmental change depend on the balance of birth, death and age-at-maturity, and there have been many attempts to mathematically model populations based on these characteristics. Historically, most of these models were deterministic, meaning that the results were strictly determined by the equations of the model and...

  8. Catalysis and communication in dynamic molecular networks

    NARCIS (Netherlands)

    Fanlo Virgos, Hugo

    2015-01-01

    The interactions of a Dynamic Combinatorial Library (DCL) of molecules with specific targets leads to composition changes of the library which can reveal potential guests and / or catalysts. In this thesis some chemical systems have been proposed to achieve a certain level of molecular complexity

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

  10. Deciphering the imprint of topology on nonlinear dynamical network stability

    International Nuclear Information System (INIS)

    Nitzbon, J; Schultz, P; Heitzig, J; Kurths, J; Hellmann, F

    2017-01-01

    Coupled oscillator networks show complex interrelations between topological characteristics of the network and the nonlinear stability of single nodes with respect to large but realistic perturbations. We extend previous results on these relations by incorporating sampling-based measures of the transient behaviour of the system, its survivability, as well as its asymptotic behaviour, its basin stability. By combining basin stability and survivability we uncover novel, previously unknown asymptotic states with solitary, desynchronized oscillators which are rotating with a frequency different from their natural one. They occur almost exclusively after perturbations at nodes with specific topological properties. More generally we confirm and significantly refine the results on the distinguished role tree-shaped appendices play for nonlinear stability. We find a topological classification scheme for nodes located in such appendices, that exactly separates them according to their stability properties, thus establishing a strong link between topology and dynamics. Hence, the results can be used for the identification of vulnerable nodes in power grids or other coupled oscillator networks. From this classification we can derive general design principles for resilient power grids. We find that striving for homogeneous network topologies facilitates a better performance in terms of nonlinear dynamical network stability. While the employed second-order Kuramoto-like model is parametrised to be representative for power grids, we expect these insights to transfer to other critical infrastructure systems or complex network dynamics appearing in various other fields. (paper)

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

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

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

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

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

  16. Synchronization in Complex Networks of Nonlinear Dynamical Systems

    CERN Document Server

    Wu, Chai Wah

    2007-01-01

    This book brings together two emerging research areas: synchronization in coupled nonlinear systems and complex networks, and study conditions under which a complex network of dynamical systems synchronizes. While there are many texts that study synchronization in chaotic systems or properties of complex networks, there are few texts that consider the intersection of these two very active and interdisciplinary research areas. The main theme of this book is that synchronization conditions can be related to graph theoretical properties of the underlying coupling topology. The book introduces ide

  17. Phase multistability in a dynamical small world network

    Energy Technology Data Exchange (ETDEWEB)

    Shabunin, A. V., E-mail: shabuninav@info.sgu.ru [Radiophysics and Nonlinear Dynamics Department, Saratov State University, Saratov (Russian Federation)

    2015-01-15

    The effect of phase multistability is explored in a small world network of periodic oscillators with diffusive couplings. The structure of the network represents a ring with additional non-local links, which spontaneously arise and vanish between arbitrary nodes. The dynamics of random couplings is modeled by “birth” and “death” stochastic processes by means of the cellular automate approach. The evolution of the network under gradual increasing of the number of random couplings goes through stages of phases fluctuations and spatial cluster formation. Finally, in the presence of non-local couplings the phase multistability “dies” and only the in-phase regime survives.

  18. On the dynamics of a gene regulatory network

    International Nuclear Information System (INIS)

    Grammaticos, B; Carstea, A S; Ramani, A

    2006-01-01

    We examine the dynamics of a network of genes focusing on a periodic chain of genes, of arbitrary length. We show that within a given class of sigmoids representing the equilibrium probability of the binding of the RNA polymerase to the core promoter, the system possesses a single stable fixed point. By slightly modifying the sigmoid, introducing 'stiffer' forms, we show that it is possible to find network configurations exhibiting bistable behaviour. Our results do not depend crucially on the length of the chain considered: calculations with finite chains lead to similar results. However, a realistic study of regulatory genetic networks would require the consideration of more complex topologies and interactions

  19. Complex Dynamics of Delay-Coupled Neural Networks

    Science.gov (United States)

    Mao, Xiaochen

    2016-09-01

    This paper reveals the complicated dynamics of a delay-coupled system that consists of a pair of sub-networks and multiple bidirectional couplings. Time delays are introduced into the internal connections and network-couplings, respectively. The stability and instability of the coupled network are discussed. The sufficient conditions for the existence of oscillations are given. Case studies of numerical simulations are given to validate the analytical results. Interesting and complicated neuronal activities are observed numerically, such as rest states, periodic oscillations, multiple switches of rest states and oscillations, and the coexistence of different types of oscillations.

  20. An Improved Dynamic Programming Decomposition Approach for Network Revenue Management

    OpenAIRE

    Dan Zhang

    2011-01-01

    We consider a nonlinear nonseparable functional approximation to the value function of a dynamic programming formulation for the network revenue management (RM) problem with customer choice. We propose a simultaneous dynamic programming approach to solve the resulting problem, which is a nonlinear optimization problem with nonlinear constraints. We show that our approximation leads to a tighter upper bound on optimal expected revenue than some known bounds in the literature. Our approach can ...

  1. Dynamical Interplay between Awareness and Epidemic Spreading in Multiplex Networks

    Science.gov (United States)

    Granell, Clara; Gómez, Sergio; Arenas, Alex

    2013-09-01

    We present the analysis of the interrelation between two processes accounting for the spreading of an epidemic, and the information awareness to prevent its infection, on top of multiplex networks. This scenario is representative of an epidemic process spreading on a network of persistent real contacts, and a cyclic information awareness process diffusing in the network of virtual social contacts between the same individuals. The topology corresponds to a multiplex network where two diffusive processes are interacting affecting each other. The analysis using a microscopic Markov chain approach reveals the phase diagram of the incidence of the epidemics and allows us to capture the evolution of the epidemic threshold depending on the topological structure of the multiplex and the interrelation with the awareness process. Interestingly, the critical point for the onset of the epidemics has a critical value (metacritical point) defined by the awareness dynamics and the topology of the virtual network, from which the onset increases and the epidemics incidence decreases.

  2. Dynamical interplay between awareness and epidemic spreading in multiplex networks.

    Science.gov (United States)

    Granell, Clara; Gómez, Sergio; Arenas, Alex

    2013-09-20

    We present the analysis of the interrelation between two processes accounting for the spreading of an epidemic, and the information awareness to prevent its infection, on top of multiplex networks. This scenario is representative of an epidemic process spreading on a network of persistent real contacts, and a cyclic information awareness process diffusing in the network of virtual social contacts between the same individuals. The topology corresponds to a multiplex network where two diffusive processes are interacting affecting each other. The analysis using a microscopic Markov chain approach reveals the phase diagram of the incidence of the epidemics and allows us to capture the evolution of the epidemic threshold depending on the topological structure of the multiplex and the interrelation with the awareness process. Interestingly, the critical point for the onset of the epidemics has a critical value (metacritical point) defined by the awareness dynamics and the topology of the virtual network, from which the onset increases and the epidemics incidence decreases.

  3. A paradox for traffic dynamics in complex networks with ATIS

    International Nuclear Information System (INIS)

    Zheng Jianfeng; Gao Ziyou

    2008-01-01

    In this work, we study the statistical properties of traffic (e.g., vehicles) dynamics in complex networks, by introducing advanced transportation information systems (ATIS). The ATIS can provide the information of traffic flow pattern throughout the network and have an obvious effect on path routing strategy for such vehicles equipped with ATIS. The ATIS can be described by the understanding of link cost functions. Different indices such as efficiency and system total cost are discussed in depth. It is found that, for random networks (scale-free networks), the efficiency is effectively improved (decreased) if ATIS is properly equipped; however the system total cost is largely increased (decreased). It indicates that there exists a paradox between the efficiency and system total cost in complex networks. Furthermore, we report the simulation results by considering different kinds of link cost functions, and the paradox is recovered. Finally, we extend our traffic model, and also find the existence of the paradox

  4. Controllability of Weighted and Directed Networks with Nonidentical Node Dynamics

    Directory of Open Access Journals (Sweden)

    Linying Xiang

    2013-01-01

    Full Text Available The concept of controllability from control theory is applied to weighted and directed networks with heterogenous linear or linearized node dynamics subject to exogenous inputs, where the nodes are grouped into leaders and followers. Under this framework, the controllability of the controlled network can be decomposed into two independent problems: the controllability of the isolated leader subsystem and the controllability of the extended follower subsystem. Some necessary and/or sufficient conditions for the controllability of the leader-follower network are derived based on matrix theory and graph theory. In particular, it is shown that a single-leader network is controllable if it is a directed path or cycle, but it is uncontrollable for a complete digraph or a star digraph in general. Furthermore, some approaches to improving the controllability of a heterogenous network are presented. Some simulation examples are given for illustration and verification.

  5. A network-based dynamical ranking system for competitive sports

    Science.gov (United States)

    Motegi, Shun; Masuda, Naoki

    2012-12-01

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

  6. Dynamics of functional failures and recovery in complex road networks

    Science.gov (United States)

    Zhan, Xianyuan; Ukkusuri, Satish V.; Rao, P. Suresh C.

    2017-11-01

    We propose a new framework for modeling the evolution of functional failures and recoveries in complex networks, with traffic congestion on road networks as the case study. Differently from conventional approaches, we transform the evolution of functional states into an equivalent dynamic structural process: dual-vertex splitting and coalescing embedded within the original network structure. The proposed model successfully explains traffic congestion and recovery patterns at the city scale based on high-resolution data from two megacities. Numerical analysis shows that certain network structural attributes can amplify or suppress cascading functional failures. Our approach represents a new general framework to model functional failures and recoveries in flow-based networks and allows understanding of the interplay between structure and function for flow-induced failure propagation and recovery.

  7. Dynamic Task Allocation in Multi-Hop Multimedia Wireless Sensor Networks with Low Mobility

    Directory of Open Access Journals (Sweden)

    Klaus Moessner

    2013-10-01

    Full Text Available This paper presents a task allocation-oriented framework to enable efficient in-network processing and cost-effective multi-hop resource sharing for dynamic multi-hop multimedia wireless sensor networks with low node mobility, e.g., pedestrian speeds. The proposed system incorporates a fast task reallocation algorithm to quickly recover from possible network service disruptions, such as node or link failures. An evolutional self-learning mechanism based on a genetic algorithm continuously adapts the system parameters in order to meet the desired application delay requirements, while also achieving a sufficiently long network lifetime. Since the algorithm runtime incurs considerable time delay while updating task assignments, we introduce an adaptive window size to limit the delay periods and ensure an up-to-date solution based on node mobility patterns and device processing capabilities. To the best of our knowledge, this is the first study that yields multi-objective task allocation in a mobile multi-hop wireless environment under dynamic conditions. Simulations are performed in various settings, and the results show considerable performance improvement in extending network lifetime compared to heuristic mechanisms. Furthermore, the proposed framework provides noticeable reduction in the frequency of missing application deadlines.

  8. Network Physics anounces first product to provide business-level management of the most complex and dynamic networks

    CERN Multimedia

    2003-01-01

    Network Physics, provider of business-level, traffic flow-based network management solutions, today announced the introduction of the Network Physics NP/BizFlow-1000. With the NP/BizFlow-1000, Fortune 1000 companies with complex and dynamic networks can analyze the flows that link business groups, critical applications, and network software and hardware (1 page).

  9. Dynamic facades, the smart way of meeting the energy requirements

    DEFF Research Database (Denmark)

    Johnsen, Kjeld; Winther, Frederik Vilbrad

    2015-01-01

    The paper describes an innovative dynamic façade system, developed in cooperation between two industrial companies, the Danish Building Research Institute and Aalborg University, Den¬mark. The system, named Energy Frames, is a newly developed industrially produced façade system based on the exper...... climate conditions. The dynamic façades play an important role in this development as it optimizes the interaction with the external environment in close correlation with the demand from the building and the users.......The paper describes an innovative dynamic façade system, developed in cooperation between two industrial companies, the Danish Building Research Institute and Aalborg University, Den¬mark. The system, named Energy Frames, is a newly developed industrially produced façade system based...

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

  11. Complex human mobility dynamics on a network

    International Nuclear Information System (INIS)

    Szell, M.

    2010-01-01

    Massive multiplayer online games provide a fascinating new way of observing hundreds of thousands of simultaneously interacting individuals engaged in virtual socio-economic activities. We have compiled a data set consisting of practically all actions of all players over a period of four years from an online game played by over 350,000 people. The universe of this online world is a lattice-like network on which players move in order to interact with other players. We focus on the mobility of human players on this network over a time-period of 500 days. We take a number of mobility measurements and compare them with measures of simulated random walkers on the same topology. Mobility of players is sub-diffusive - the mean squared displacement follows a power law with exponent 0.4 - and significantly deviates from mobility patterns of random walkers. Mean first passage times and transition counts relate via a power-law with slope -1/3. We compare our results with studies where human mobility was measured via mobile phone data and find striking similarities. (author)

  12. Popularity and Novelty Dynamics in Evolving Networks.

    Science.gov (United States)

    Abbas, Khushnood; Shang, Mingsheng; Abbasi, Alireza; Luo, Xin; Xu, Jian Jun; Zhang, Yu-Xia

    2018-04-20

    Network science plays a big role in the representation of real-world phenomena such as user-item bipartite networks presented in e-commerce or social media platforms. It provides researchers with tools and techniques to solve complex real-world problems. Identifying and predicting future popularity and importance of items in e-commerce or social media platform is a challenging task. Some items gain popularity repeatedly over time while some become popular and novel only once. This work aims to identify the key-factors: popularity and novelty. To do so, we consider two types of novelty predictions: items appearing in the popular ranking list for the first time; and items which were not in the popular list in the past time window, but might have been popular before the recent past time window. In order to identify the popular items, a careful consideration of macro-level analysis is needed. In this work we propose a model, which exploits item level information over a span of time to rank the importance of the item. We considered ageing or decay effect along with the recent link-gain of the items. We test our proposed model on four various real-world datasets using four information retrieval based metrics.

  13. Energy Efficient, Cross-Layer Enabled, Dynamic Aggregation Networks for Next Generation Internet

    Science.gov (United States)

    Wang, Michael S.

    Today, the Internet traffic is growing at a near exponential rate, driven predominately by data center-based applications and Internet-of-Things services. This fast-paced growth in Internet traffic calls into question the ability of the existing optical network infrastructure to support this continued growth. The overall optical networking equipment efficiency has not been able to keep up with the traffic growth, creating a energy gap that makes energy and cost expenditures scale linearly with the traffic growth. The implication of this energy gap is that it is infeasible to continue using existing networking equipment to meet the growing bandwidth demand. A redesign of the optical networking platform is needed. The focus of this dissertation is on the design and implementation of energy efficient, cross-layer enabled, dynamic optical networking platforms, which is a promising approach to address the exponentially growing Internet bandwidth demand. Chapter 1 explains the motivation for this work by detailing the huge Internet traffic growth and the unsustainable energy growth of today's networking equipment. Chapter 2 describes the challenges and objectives of enabling agile, dynamic optical networking platforms and the vision of the Center for Integrated Access Networks (CIAN) to realize these objectives; the research objectives of this dissertation and the large body of related work in this field is also summarized. Chapter 3 details the design and implementation of dynamic networking platforms that support wavelength switching granularity. The main contribution of this work involves the experimental validation of deep cross-layer communication across the optical performance monitoring (OPM), data, and control planes. The first experiment shows QoS-aware video streaming over a metro-scale test-bed through optical power monitoring of the transmission wavelength and cross-layer feedback control of the power level. The second experiment extends the performance

  14. Metagenomics meets time series analysis: unraveling microbial community dynamics

    NARCIS (Netherlands)

    Faust, K.; Lahti, L.M.; Gonze, D.; Vos, de W.M.; Raes, J.

    2015-01-01

    The recent increase in the number of microbial time series studies offers new insights into the stability and dynamics of microbial communities, from the world's oceans to human microbiota. Dedicated time series analysis tools allow taking full advantage of these data. Such tools can reveal periodic

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

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

  17. Chain networking revealed by molecular dynamics simulation

    Science.gov (United States)

    Zheng, Yexin; Tsige, Mesfin; Wang, Shi-Qing

    Based on Kremer-Grest model for entangled polymer melts, we demonstrate how the response of a polymer glass depends critically on the chain length. After quenching two melts of very different chain lengths (350 beads per chain and 30 beads per chain) into deeply glassy states, we subject them to uniaxial extension. Our MD simulations show that the glass of long chains undergoes stable necking after yielding whereas the system of short chains is unable to neck and breaks up after strain localization. During ductile extension of the polymer glass made of long chain significant chain tension builds up in the load-bearing strands (LBSs). Further analysis is expected to reveal evidence of activation of the primary structure during post-yield extension. These results lend support to the recent molecular model 1 and are the simulations to demonstrate the role of chain networking. This work is supported, in part, by a NSF Grant (DMR-EAGER-1444859)

  18. Network dynamics of human face perception.

    Directory of Open Access Journals (Sweden)

    Cihan Mehmet Kadipasaoglu

    Full Text Available Prevailing theories suggests that cortical regions responsible for face perception operate in a serial, feed-forward fashion. Here, we utilize invasive human electrophysiology to evaluate serial models of face-processing via measurements of cortical activation, functional connectivity, and cortico-cortical evoked potentials. We find that task-dependent changes in functional connectivity between face-selective regions in the inferior occipital (f-IOG and fusiform gyrus (f-FG are bidirectional, not feed-forward, and emerge following feed-forward input from early visual cortex (EVC to both of these regions. Cortico-cortical evoked potentials similarly reveal independent signal propagations between EVC and both f-IOG and f-FG. These findings are incompatible with serial models, and support a parallel, distributed network underpinning face perception in humans.

  19. Filtering in hybrid dynamic Bayesian networks

    DEFF Research Database (Denmark)

    Andersen, Morten Nonboe; Andersen, Rasmus Ørum; Wheeler, Kevin

    2004-01-01

    for inference. We extend the experiment and perform approximate inference using The Extended Kalman Filter (EKF) and the Unscented Kalman Filter (UKF). Furthermore, we combine these techniques in a 'non-strict' Rao-Blackwellisation framework and apply it to the watertank system. We show that UKF and UKF in a PF...... framework outperform the generic PF, EKF and EKF in a PF framework with respect to accuracy and robustness in terms of estimation RMSE (root-mean-square error). Especially we demonstrate the superiority of UKF in a PF framework when our beliefs of how data was generated are wrong. We also show...... that the choice of network structure is very important for the performance of the generic PF and the EKF algorithms, but not for the UKF algorithms. Furthermore, we investigate the influence of data noise in the watertank simulation. Theory and implementation is based on the theory presented in (v.d. Merwe et al...

  20. Age structure and cooperation in coevolutionary games on dynamic network

    Science.gov (United States)

    Qin, Zilong; Hu, Zhenhua; Zhou, Xiaoping; Yi, Jingzhang

    2015-04-01

    Our proposed model imitates the growth of a population and describes the age structure and the level of cooperation in games on dynamic network with continuous changes of structure and topology. The removal of nodes and links caused by age-dependent attack, together with the nodes addition standing for the newborns of population, badly ruins Matthew effect in this coevolutionary process. Though the network is generated by growth and preferential attachment, it degenerates into random network and it is no longer heterogeneous. When the removal of nodes and links is equal to the addition of nodes and links, the size of dynamic network is maintained in steady-state, so is the low level of cooperation. Severe structure variation, homogeneous topology and continuous invasion of new defection jointly make dynamic network unsuitable for the survival of cooperator even when the probability with which the newborn players initially adopt the strategy cooperation is high, while things change slightly when the connections of newborn players are restricted. Fortunately, moderate interactions in a generation trigger an optimal recovering process to encourage cooperation. The model developed in this paper outlines an explanation of the cohesion changes in the development process of an organization. Some suggestions for cooperative behavior improvement are given in the end.

  1. Adaptive spectrum decision framework for heterogeneous dynamic spectrum access networks

    CSIR Research Space (South Africa)

    Masonta, M

    2015-09-01

    Full Text Available Spectrum decision is the ability of a cognitive radio (CR) system to select the best available spectrum band to satisfy dynamic spectrum access network (DSAN) users¿ quality of service (QoS) requirements without causing harmful interference...

  2. Network evolution induced by the dynamical rules of two populations

    International Nuclear Information System (INIS)

    Platini, Thierry; Zia, R K P

    2010-01-01

    We study the dynamical properties of a finite dynamical network composed of two interacting populations, namely extrovert (a) and introvert (b). In our model, each group is characterized by its size (N a and N b ) and preferred degree (κ a and κ b a ). The network dynamics is governed by the competing microscopic rules of each population that consist of the creation and destruction of links. Starting from an unconnected network, we give a detailed analysis of the mean field approach which is compared to Monte Carlo simulation data. The time evolution of the restricted degrees (k bb ) and (k ab ) presents three time regimes and a non-monotonic behavior well captured by our theory. Surprisingly, when the population sizes are equal N a = N b , the ratio of the restricted degree θ 0 = (k ab )/(k bb ) appears to be an integer in the asymptotic limits of the three time regimes. For early times (defined by t 1 = κ b ) the total number of links presents a linear evolution, where the two populations are indistinguishable and where θ 0 = 1. Interestingly, in the intermediate time regime (defined for t 1 2 ∝κ a and for which θ 0 = 5), the system reaches a transient stationary state, where the number of contacts among introverts remains constant while the number of connections increases linearly in the extrovert population. Finally, due to the competing dynamics, the network presents a frustrated stationary state characterized by a ratio θ 0 = 3

  3. Gossips and prejudices: ergodic randomized dynamics in social networks

    NARCIS (Netherlands)

    Frasca, Paolo; Ravazzi, Chiara; Tempo, Roberto; Ishii, Hideaki

    In this paper we study a new model of opinion dynamics in social networks, which has two main features. First, agents asynchronously interact in pairs, and these pairs are chosen according to a random process: following recent literature, we refer to this communication model as “gossiping‿. Second,

  4. Dynamic state estimation for distribution networks with renewable energy integration

    NARCIS (Netherlands)

    Nguyen, P.H.; Venayagamoorthy, G.K.; Kling, W.L.; Ribeiro, P.F.

    2013-01-01

    The massive integration of variable and unpredictable Renewable Energy Sources (RES) and new types of load consumptions increases the dynamic and uncertain nature of the electricity grid. Emerging interests have focused on improving the monitoring capabilities of network operators so that they can

  5. Adaptive dynamic capacity borrowing in road-covering mobile networks

    NARCIS (Netherlands)

    Ule, A.; Boucherie, Richardus J.; Li, W.; Pan, Y.

    2006-01-01

    This paper introduces adaptive dynamic capacity borrowing strategies for wireless networks covering a road. In a F/TDMA-based model, road traffic prediction models are used to characterise the movement of hot spots, such as traffic jams, and subsequently to predict the teletraffic load offered to

  6. Dynamic Adaptive Neural Network Arrays: A Neuromorphic Architecture

    Energy Technology Data Exchange (ETDEWEB)

    Disney, Adam [University of Tennessee (UT); Reynolds, John [University of Tennessee (UT)

    2015-01-01

    Dynamic Adaptive Neural Network Array (DANNA) is a neuromorphic hardware implementation. It differs from most other neuromorphic projects in that it allows for programmability of structure, and it is trained or designed using evolutionary optimization. This paper describes the DANNA structure, how DANNA is trained using evolutionary optimization, and an application of DANNA to a very simple classification task.

  7. Network evolution induced by the dynamical rules of two populations

    Science.gov (United States)

    Platini, Thierry; Zia, R. K. P.

    2010-10-01

    We study the dynamical properties of a finite dynamical network composed of two interacting populations, namely extrovert (a) and introvert (b). In our model, each group is characterized by its size (Na and Nb) and preferred degree (κa and \\kappa_b\\ll \\kappa_a ). The network dynamics is governed by the competing microscopic rules of each population that consist of the creation and destruction of links. Starting from an unconnected network, we give a detailed analysis of the mean field approach which is compared to Monte Carlo simulation data. The time evolution of the restricted degrees langkbbrang and langkabrang presents three time regimes and a non-monotonic behavior well captured by our theory. Surprisingly, when the population sizes are equal Na = Nb, the ratio of the restricted degree θ0 = langkabrang/langkbbrang appears to be an integer in the asymptotic limits of the three time regimes. For early times (defined by t introverts remains constant while the number of connections increases linearly in the extrovert population. Finally, due to the competing dynamics, the network presents a frustrated stationary state characterized by a ratio θ0 = 3.

  8. RD2: Resilient Dynamic Desynchronization for TDMA over Lossy Networks

    DEFF Research Database (Denmark)

    Hinterhofer, Thomas; Schwefel, Hans-Peter; Tomic, Slobodanka

    2012-01-01

    We present a distributed TDMA negotiation approach for single-hop ad-hoc network communication. It is distributed, resilient to arbitrary transient packet loss and defines a non-overlapping TDMA schedule without the need of global time synchronization. A participating node can dynamically request...

  9. Dynamics of user networks in on-line electronic auctions

    Czech Academy of Sciences Publication Activity Database

    Slanina, František

    2014-01-01

    Roč. 17, č. 1 (2014), "1450002-1"-"1450002-14" ISSN 0219-5259 R&D Projects: GA MŠk OC09078 Institutional support: RVO:68378271 Keywords : networks * random graphs * dynamics Subject RIV: BE - Theoretical Physics Impact factor: 0.968, year: 2014

  10. Chaotic expression dynamics implies pluripotency: when theory and experiment meet

    Directory of Open Access Journals (Sweden)

    Furusawa Chikara

    2009-05-01

    Full Text Available Abstract Background During normal development, cells undergo a unidirectional course of differentiation that progressively decreases the number of cell types they can potentially become. Pluripotent stem cells can differentiate into several types of cells, but terminally differentiated cells cannot differentiate any further. A fundamental problem in stem cell biology is the characterization of the difference in cellular states, e.g., gene expression profiles, between pluripotent stem cells and terminally differentiated cells. Presentation of the hypothesis To address the problem, we developed a dynamical systems model of cells with intracellular protein expression dynamics and interactions with each other. According to extensive simulations, cells with irregular (chaotic oscillations in gene expression dynamics have the potential to differentiate into other cell types. During development, such complex oscillations are lost successively, leading to a loss of pluripotency. These simulation results, together with recent single-cell-level measurements in stem cells, led us to the following hypothesis regarding pluripotency: Chaotic oscillation in the expression of some genes leads to cell pluripotency and affords cellular state heterogeneity, which is supported by itinerancy over quasi-stable states. Differentiation stabilizes these states, leading to a loss of pluripotency. Testing the hypothesis To test the hypothesis, it is crucial to measure the time course of gene expression levels at the single-cell level by fluorescence microscopy and fluorescence-activated cell sorting (FACS analysis. By analyzing the time series of single-cell-level expression data, one can distinguish whether the variation in protein expression level over time is due only to stochasticity in expression dynamics or originates from the chaotic dynamics inherent to cells, as our hypothesis predicts. By further analyzing the expression in differentiated cell types, one can

  11. Robustness and Vulnerability of Networks with Dynamical Dependency Groups.

    Science.gov (United States)

    Bai, Ya-Nan; Huang, Ning; Wang, Lei; Wu, Zhi-Xi

    2016-11-28

    The dependency property and self-recovery of failure nodes both have great effects on the robustness of networks during the cascading process. Existing investigations focused mainly on the failure mechanism of static dependency groups without considering the time-dependency of interdependent nodes and the recovery mechanism in reality. In this study, we present an evolving network model consisting of failure mechanisms and a recovery mechanism to explore network robustness, where the dependency relations among nodes vary over time. Based on generating function techniques, we provide an analytical framework for random networks with arbitrary degree distribution. In particular, we theoretically find that an abrupt percolation transition exists corresponding to the dynamical dependency groups for a wide range of topologies after initial random removal. Moreover, when the abrupt transition point is above the failure threshold of dependency groups, the evolving network with the larger dependency groups is more vulnerable; when below it, the larger dependency groups make the network more robust. Numerical simulations employing the Erdős-Rényi network and Barabási-Albert scale free network are performed to validate our theoretical results.

  12. Dynamic Session-Key Generation for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Chen Chin-Ling

    2008-01-01

    Full Text Available Abstract Recently, wireless sensor networks have been used extensively in different domains. For example, if the wireless sensor node of a wireless sensor network is distributed in an insecure area, a secret key must be used to protect the transmission between the sensor nodes. Most of the existing methods consist of preselecting keys from a key pool and forming a key chain. Then, the sensor nodes make use of the key chain to encrypt the data. However, while the secret key is being transmitted, it can easily be exposed during transmission. We propose a dynamic key management protocol, which can improve the security of the key juxtaposed to existing methods. Additionally, the dynamic update of the key can lower the probability of the key to being guessed correctly. In addition, with the new protocol, attacks on the wireless sensor network can be avoided.

  13. Dynamic Relaying in 3GPP LTE-Advanced Networks

    DEFF Research Database (Denmark)

    Teyeb, Oumer Mohammed; Van Phan, Vinh; Redana, Simone

    2009-01-01

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

  14. Dynamic Session-Key Generation for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Cheng-Ta Li

    2008-09-01

    Full Text Available Recently, wireless sensor networks have been used extensively in different domains. For example, if the wireless sensor node of a wireless sensor network is distributed in an insecure area, a secret key must be used to protect the transmission between the sensor nodes. Most of the existing methods consist of preselecting m keys from a key pool and forming a key chain. Then, the sensor nodes make use of the key chain to encrypt the data. However, while the secret key is being transmitted, it can easily be exposed during transmission. We propose a dynamic key management protocol, which can improve the security of the key juxtaposed to existing methods. Additionally, the dynamic update of the key can lower the probability of the key to being guessed correctly. In addition, with the new protocol, attacks on the wireless sensor network can be avoided.

  15. Dynamic Business Networks: A Headache for Sustainable Systems Interoperability

    Science.gov (United States)

    Agostinho, Carlos; Jardim-Goncalves, Ricardo

    Collaborative networked environments emerged with the spread of the internet, contributing to overcome past communication barriers, and identifying interoperability as an essential property. When achieved seamlessly, efficiency is increased in the entire product life cycle. Nowadays, most organizations try to attain interoperability by establishing peer-to-peer mappings with the different partners, or in optimized networks, by using international standard models as the core for information exchange. In current industrial practice, mappings are only defined once, and the morphisms that represent them, are hardcoded in the enterprise systems. This solution has been effective for static environments, where enterprise and product models are valid for decades. However, with an increasingly complex and dynamic global market, models change frequently to answer new customer requirements. This paper draws concepts from the complex systems science and proposes a framework for sustainable systems interoperability in dynamic networks, enabling different organizations to evolve at their own rate.

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

  17. How mutation alters the evolutionary dynamics of cooperation on networks

    Science.gov (United States)

    Ichinose, Genki; Satotani, Yoshiki; Sayama, Hiroki

    2018-05-01

    Cooperation is ubiquitous at every level of living organisms. It is known that spatial (network) structure is a viable mechanism for cooperation to evolve. A recently proposed numerical metric, average gradient of selection (AGoS), a useful tool for interpreting and visualizing evolutionary dynamics on networks, allows simulation results to be visualized on a one-dimensional phase space. However, stochastic mutation of strategies was not considered in the analysis of AGoS. Here we extend AGoS so that it can analyze the evolution of cooperation where mutation may alter strategies of individuals on networks. We show that our extended AGoS correctly visualizes the final states of cooperation with mutation in the individual-based simulations. Our analyses revealed that mutation always has a negative effect on the evolution of cooperation regardless of the payoff functions, fraction of cooperators, and network structures. Moreover, we found that scale-free networks are the most vulnerable to mutation and thus the dynamics of cooperation are altered from bistability to coexistence on those networks, undergoing an imperfect pitchfork bifurcation.

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

  19. Spreading dynamics on complex networks: a general stochastic approach.

    Science.gov (United States)

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

    2014-12-01

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

  20. Asymmetrically interacting spreading dynamics on complex layered networks.

    Science.gov (United States)

    Wang, Wei; Tang, Ming; Yang, Hui; Younghae Do; Lai, Ying-Cheng; Lee, GyuWon

    2014-05-29

    The spread of disease through a physical-contact network and the spread of information about the disease on a communication network are two intimately related dynamical processes. We investigate the asymmetrical interplay between the two types of spreading dynamics, each occurring on its own layer, by focusing on the two fundamental quantities underlying any spreading process: epidemic threshold and the final infection ratio. We find that an epidemic outbreak on the contact layer can induce an outbreak on the communication layer, and information spreading can effectively raise the epidemic threshold. When structural correlation exists between the two layers, the information threshold remains unchanged but the epidemic threshold can be enhanced, making the contact layer more resilient to epidemic outbreak. We develop a physical theory to understand the intricate interplay between the two types of spreading dynamics.

  1. Pollution source localization in an urban water supply network based on dynamic water demand.

    Science.gov (United States)

    Yan, Xuesong; Zhu, Zhixin; Li, Tian

    2017-10-27

    Urban water supply networks are susceptible to intentional, accidental chemical, and biological pollution, which pose a threat to the health of consumers. In recent years, drinking-water pollution incidents have occurred frequently, seriously endangering social stability and security. The real-time monitoring for water quality can be effectively implemented by placing sensors in the water supply network. However, locating the source of pollution through the data detection obtained by water quality sensors is a challenging problem. The difficulty lies in the limited number of sensors, large number of water supply network nodes, and dynamic user demand for water, which leads the pollution source localization problem to an uncertainty, large-scale, and dynamic optimization problem. In this paper, we mainly study the dynamics of the pollution source localization problem. Previous studies of pollution source localization assume that hydraulic inputs (e.g., water demand of consumers) are known. However, because of the inherent variability of urban water demand, the problem is essentially a fluctuating dynamic problem of consumer's water demand. In this paper, the water demand is considered to be stochastic in nature and can be described using Gaussian model or autoregressive model. On this basis, an optimization algorithm is proposed based on these two dynamic water demand change models to locate the pollution source. The objective of the proposed algorithm is to find the locations and concentrations of pollution sources that meet the minimum between the analogue and detection values of the sensor. Simulation experiments were conducted using two different sizes of urban water supply network data, and the experimental results were compared with those of the standard genetic algorithm.

  2. Opinion Dynamics on Complex Networks with Communities

    International Nuclear Information System (INIS)

    Ru, Wang; Li-Ping, Chi

    2008-01-01

    The Ising or Potts models of ferromagnetism have been widely used to describe locally interacting social or economic systems. We consider a related model, introduced by Sznajd to describe the evolution of consensus in the scale-free networks with the tunable strength (noted by Q) of community structure. In the Sznajd model, the opinion or state of any spins can only be changed by the influence of neighbouring pairs of similar connection spins. Such pairs can polarize their neighbours. Using asynchronous updating, it is found that the smaller the community strength Q, the larger the slope of the exponential relaxation time distribution. Then the effect of the initial up- spin concentration p as a function of the final all up probability E is investigated by taking different initialization strategies, the random node-chosen initialization strategy has no difference under different community strengths, while the strategies of community node-chosen initialization and hub node-chosen initialization are different in final probability under different Q, and the latter one is more effective in reaching final state

  3. Threshold Learning Dynamics in Social Networks

    Science.gov (United States)

    González-Avella, Juan Carlos; Eguíluz, Victor M.; Marsili, Matteo; Vega-Redondo, Fernado; San Miguel, Maxi

    2011-01-01

    Social learning is defined as the ability of a population to aggregate information, a process which must crucially depend on the mechanisms of social interaction. Consumers choosing which product to buy, or voters deciding which option to take with respect to an important issue, typically confront external signals to the information gathered from their contacts. Economic models typically predict that correct social learning occurs in large populations unless some individuals display unbounded influence. We challenge this conclusion by showing that an intuitive threshold process of individual adjustment does not always lead to such social learning. We find, specifically, that three generic regimes exist separated by sharp discontinuous transitions. And only in one of them, where the threshold is within a suitable intermediate range, the population learns the correct information. In the other two, where the threshold is either too high or too low, the system either freezes or enters into persistent flux, respectively. These regimes are generally observed in different social networks (both complex or regular), but limited interaction is found to promote correct learning by enlarging the parameter region where it occurs. PMID:21637714

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

  5. The Dynamics of Protest Recruitment through an Online Network

    Science.gov (United States)

    González-Bailón, Sandra; Borge-Holthoefer, Javier; Rivero, Alejandro; Moreno, Yamir

    2011-12-01

    The recent wave of mobilizations in the Arab world and across Western countries has generated much discussion on how digital media is connected to the diffusion of protests. We examine that connection using data from the surge of mobilizations that took place in Spain in May 2011. We study recruitment patterns in the Twitter network and find evidence of social influence and complex contagion. We identify the network position of early participants (i.e. the leaders of the recruitment process) and of the users who acted as seeds of message cascades (i.e. the spreaders of information). We find that early participants cannot be characterized by a typical topological position but spreaders tend to be more central in the network. These findings shed light on the connection between online networks, social contagion, and collective dynamics, and offer an empirical test to the recruitment mechanisms theorized in formal models of collective action.

  6. Direct Adaptive Aircraft Control Using Dynamic Cell Structure Neural Networks

    Science.gov (United States)

    Jorgensen, Charles C.

    1997-01-01

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

  7. Cooperative Dynamics in Lattice-Embedded Scale-Free Networks

    International Nuclear Information System (INIS)

    Shang Lihui; Zhang Mingji; Yang Yanqing

    2009-01-01

    We investigate cooperative behaviors of lattice-embedded scale-free networking agents in the prisoner's dilemma game model by employing two initial strategy distribution mechanisms, which are specific distribution to the most connected sites (hubs) and random distribution. Our study indicates that the game dynamics crucially depends on the underlying spatial network structure with different strategy distribution mechanism. The cooperators' specific distribution contributes to an enhanced level of cooperation in the system compared with random one, and cooperation is robust to cooperators' specific distribution but fragile to defectors' specific distribution. Especially, unlike the specific case, increasing heterogeneity of network does not always favor the emergence of cooperation under random mechanism. Furthermore, we study the geographical effects and find that the graphically constrained network structure tends to improve the evolution of cooperation in random case and in specific one for a large temptation to defect.

  8. Submodularity in dynamics and control of networked systems

    CERN Document Server

    Clark, Andrew; Bushnell, Linda; Poovendran, Radha

    2016-01-01

    This book presents a framework for the control of networked systems utilizing submodular optimization techniques. The main focus is on selecting input nodes for the control of networked systems, an inherently discrete optimization problem with applications in power system stability, social influence dynamics, and the control of vehicle formations. The first part of the book is devoted to background information on submodular functions, matroids, and submodular optimization, and presents algorithms for distributed submodular optimization that are scalable to large networked systems. In turn, the second part develops a unifying submodular optimization approach to controlling networked systems based on multiple performance and controllability criteria. Techniques are introduced for selecting input nodes to ensure smooth convergence, synchronization, and robustness to environmental and adversarial noise. Submodular optimization is the first unifying approach towards guaranteeing both performance and controllabilit...

  9. Perception of similarity: a model for social network dynamics

    International Nuclear Information System (INIS)

    Javarone, Marco Alberto; Armano, Giuliano

    2013-01-01

    Some properties of social networks (e.g., the mixing patterns and the community structure) appear deeply influenced by the individual perception of people. In this work we map behaviors by considering similarity and popularity of people, also assuming that each person has his/her proper perception and interpretation of similarity. Although investigated in different ways (depending on the specific scientific framework), from a computational perspective similarity is typically calculated as a distance measure. In accordance with this view, to represent social network dynamics we developed an agent-based model on top of a hyperbolic space on which individual distance measures are calculated. Simulations, performed in accordance with the proposed model, generate small-world networks that exhibit a community structure. We deem this model to be valuable for analyzing the relevant properties of real social networks. (paper)

  10. Changes in dynamic resting state network connectivity following aphasia therapy.

    Science.gov (United States)

    Duncan, E Susan; Small, Steven L

    2017-10-24

    Resting state magnetic resonance imaging (rsfMRI) permits observation of intrinsic neural networks produced by task-independent correlations in low frequency brain activity. Various resting state networks have been described, with each thought to reflect common engagement in some shared function. There has been limited investigation of the plasticity in these network relationships after stroke or induced by therapy. Twelve individuals with language disorders after stroke (aphasia) were imaged at multiple time points before (baseline) and after an imitation-based aphasia therapy. Language assessment using a narrative production task was performed at the same time points. Group independent component analysis (ICA) was performed on the rsfMRI data to identify resting state networks. A sliding window approach was then applied to assess the dynamic nature of the correlations among these networks. Network correlations during each 30-second window were used to cluster the data into ten states for each window at each time point for each subject. Correlation was performed between changes in time spent in each state and therapeutic gains on the narrative task. The amount of time spent in a single one of the (ten overall) dynamic states was positively associated with behavioral improvement on the narrative task at the 6-week post-therapy maintenance interval, when compared with either baseline or assessment immediately following therapy. This particular state was characterized by minimal correlation among the task-independent resting state networks. Increased functional independence and segregation of resting state networks underlies improvement on a narrative production task following imitation-based aphasia treatment. This has important clinical implications for the targeting of noninvasive brain stimulation in post-stroke remediation.

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

  12. Competitive dynamics of lexical innovations in multi-layer networks

    Science.gov (United States)

    Javarone, Marco Alberto

    2014-04-01

    We study the introduction of lexical innovations into a community of language users. Lexical innovations, i.e. new term added to people's vocabulary, plays an important role in the process of language evolution. Nowadays, information is spread through a variety of networks, including, among others, online and offline social networks and the World Wide Web. The entire system, comprising networks of different nature, can be represented as a multi-layer network. In this context, lexical innovations diffusion occurs in a peculiar fashion. In particular, a lexical innovation can undergo three different processes: its original meaning is accepted; its meaning can be changed or misunderstood (e.g. when not properly explained), hence more than one meaning can emerge in the population. Lastly, in the case of a loan word, it can be translated into the population language (i.e. defining a new lexical innovation or using a synonym) or into a dialect spoken by part of the population. Therefore, lexical innovations cannot be considered simply as information. We develop a model for analyzing this scenario using a multi-layer network comprising a social network and a media network. The latter represents the set of all information systems of a society, e.g. television, the World Wide Web and radio. Furthermore, we identify temporal directed edges between the nodes of these two networks. In particular, at each time-step, nodes of the media network can be connected to randomly chosen nodes of the social network and vice versa. In doing so, information spreads through the whole system and people can share a lexical innovation with their neighbors or, in the event they work as reporters, by using media nodes. Lastly, we use the concept of "linguistic sign" to model lexical innovations, showing its fundamental role in the study of these dynamics. Many numerical simulations have been performed to analyze the proposed model and its outcomes.

  13. Unveiling protein functions through the dynamics of the interaction network.

    Directory of Open Access Journals (Sweden)

    Irene Sendiña-Nadal

    Full Text Available Protein interaction networks have become a tool to study biological processes, either for predicting molecular functions or for designing proper new drugs to regulate the main biological interactions. Furthermore, such networks are known to be organized in sub-networks of proteins contributing to the same cellular function. However, the protein function prediction is not accurate and each protein has traditionally been assigned to only one function by the network formalism. By considering the network of the physical interactions between proteins of the yeast together with a manual and single functional classification scheme, we introduce a method able to reveal important information on protein function, at both micro- and macro-scale. In particular, the inspection of the properties of oscillatory dynamics on top of the protein interaction network leads to the identification of misclassification problems in protein function assignments, as well as to unveil correct identification of protein functions. We also demonstrate that our approach can give a network representation of the meta-organization of biological processes by unraveling the interactions between different functional classes.

  14. Epidemic dynamics on a risk-based evolving social network

    Science.gov (United States)

    Antwi, Shadrack; Shaw, Leah

    2013-03-01

    Social network models have been used to study how behavior affects the dynamics of an infection in a population. Motivated by HIV, we consider how a trade-off between benefits and risks of sexual connections determine network structure and disease prevalence. We define a stochastic network model with formation and breaking of links as changes in sexual contacts. Each node has an intrinsic benefit its neighbors derive from connecting to it. Nodes' infection status is not apparent to others, but nodes with more connections (higher degree) are assumed more likely to be infected. The probability to form and break links is determined by a payoff computed from the benefit and degree-dependent risk. The disease is represented by a SI (susceptible-infected) model. We study network and epidemic evolution via Monte Carlo simulation and analytically predict the behavior with a heterogeneous mean field approach. The dependence of network connectivity and infection threshold on parameters is determined, and steady state degree distribution and epidemic levels are obtained. We also study a situation where system-wide infection levels alter perception of risk and cause nodes to adjust their behavior. This is a case of an adaptive network, where node status feeds back to change network geometry.

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

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

  17. Analyzing, Modeling, and Simulation for Human Dynamics in Social Network

    Directory of Open Access Journals (Sweden)

    Yunpeng Xiao

    2012-01-01

    Full Text Available This paper studies the human behavior in the top-one social network system in China (Sina Microblog system. By analyzing real-life data at a large scale, we find that the message releasing interval (intermessage time obeys power law distribution both at individual level and at group level. Statistical analysis also reveals that human behavior in social network is mainly driven by four basic elements: social pressure, social identity, social participation, and social relation between individuals. Empirical results present the four elements' impact on the human behavior and the relation between these elements. To further understand the mechanism of such dynamic phenomena, a hybrid human dynamic model which combines “interest” of individual and “interaction” among people is introduced, incorporating the four elements simultaneously. To provide a solid evaluation, we simulate both two-agent and multiagent interactions with real-life social network topology. We achieve the consistent results between empirical studies and the simulations. The model can provide a good understanding of human dynamics in social network.

  18. Report on the September 2011 Meeting of the Next Generation Safegaurds Professional Network

    Energy Technology Data Exchange (ETDEWEB)

    Gitau, Ernest TN; Benz, Jacob M.

    2011-12-19

    The Next Generation Safeguards Professional Network (NGSPN) was established in 2009 by Oak Ridge National Laboratory targeted towards the engagement of young professionals employed in safeguards across the many national laboratories. NGSPN focuses on providing a mechanism for young safeguards professionals to connect and foster professional relationships, facilitating knowledge transfer between current safeguards experts and the next generation of experts, and acting as an entity to represent the interests of the international community of young and mid-career safeguards professionals. This is accomplished in part with a yearly meeting held at a national laboratory site. In 2011, this meeting was held at Pacific Northwest National Laboratory. This report documents the events and results of that meeting.

  19. Establishment of A+M Computer Code Network. Summary report of IAEA technical meeting

    International Nuclear Information System (INIS)

    Clark, R.E.H.

    2006-01-01

    Eleven international experts on computational aspects of atomic and molecular data for fusion energy research participated in a technical meeting arranged to discuss the establishment of an A and M Computer Code Network, and held at IAEA Headquarters on 23-25 May 2005. Each participant reviewed the current status of their own speciality and current lines of research, as well as anticipated needs in new data for nuclear fusion energy research. A preliminary method for making these valuable resources more readily available was outlined, and implementation will proceed. Several of the computational tools presented are already available through Internet connections. All the goals of the meeting were achieved, and every participant indicated a desire to see more collaboration and cooperation in fulfilling the A and M data needs for fusion. The discussions, conclusions and recommendations of the meeting are briefly described in this report. (author)

  20. Dynamical Response of Networks Under External Perturbations: Exact Results

    Science.gov (United States)

    Chinellato, David D.; Epstein, Irving R.; Braha, Dan; Bar-Yam, Yaneer; de Aguiar, Marcus A. M.

    2015-04-01

    We give exact statistical distributions for the dynamic response of influence networks subjected to external perturbations. We consider networks whose nodes have two internal states labeled 0 and 1. We let nodes be frozen in state 0, in state 1, and the remaining nodes change by adopting the state of a connected node with a fixed probability per time step. The frozen nodes can be interpreted as external perturbations to the subnetwork of free nodes. Analytically extending and to be smaller than 1 enables modeling the case of weak coupling. We solve the dynamical equations exactly for fully connected networks, obtaining the equilibrium distribution, transition probabilities between any two states and the characteristic time to equilibration. Our exact results are excellent approximations for other topologies, including random, regular lattice, scale-free and small world networks, when the numbers of fixed nodes are adjusted to take account of the effect of topology on coupling to the environment. This model can describe a variety of complex systems, from magnetic spins to social networks to population genetics, and was recently applied as a framework for early warning signals for real-world self-organized economic market crises.

  1. The geometry of chaotic dynamics — a complex network perspective

    Science.gov (United States)

    Donner, R. V.; Heitzig, J.; Donges, J. F.; Zou, Y.; Marwan, N.; Kurths, J.

    2011-12-01

    Recently, several complex network approaches to time series analysis have been developed and applied to study a wide range of model systems as well as real-world data, e.g., geophysical or financial time series. Among these techniques, recurrence-based concepts and prominently ɛ-recurrence networks, most faithfully represent the geometrical fine structure of the attractors underlying chaotic (and less interestingly non-chaotic) time series. In this paper we demonstrate that the well known graph theoretical properties local clustering coefficient and global (network) transitivity can meaningfully be exploited to define two new local and two new global measures of dimension in phase space: local upper and lower clustering dimension as well as global upper and lower transitivity dimension. Rigorous analytical as well as numerical results for self-similar sets and simple chaotic model systems suggest that these measures are well-behaved in most non-pathological situations and that they can be estimated reasonably well using ɛ-recurrence networks constructed from relatively short time series. Moreover, we study the relationship between clustering and transitivity dimensions on the one hand, and traditional measures like pointwise dimension or local Lyapunov dimension on the other hand. We also provide further evidence that the local clustering coefficients, or equivalently the local clustering dimensions, are useful for identifying unstable periodic orbits and other dynamically invariant objects from time series. Our results demonstrate that ɛ-recurrence networks exhibit an important link between dynamical systems and graph theory.

  2. Dynamic Resource Allocation in Hybrid Access Femtocell Network

    Directory of Open Access Journals (Sweden)

    Afaz Uddin Ahmed

    2014-01-01

    Full Text Available Intercell interference is one of the most challenging issues in femtocell deployment under the coverage of existing macrocell. Allocation of resources between femtocell and macrocell is essential to counter the effects of interference in dense femtocell networks. Advances in resource management strategies have improved the control mechanism for interference reduction at lower node density, but most of them are ineffective at higher node density. In this paper, a dynamic resource allocation management algorithm (DRAMA for spectrum shared hybrid access OFDMA femtocell network is proposed. To reduce the macro-femto-tier interference and to improve the quality of service, the proposed algorithm features a dynamic resource allocation scheme by controlling them both centrally and locally. The proposed scheme focuses on Femtocell Access Point (FAP owners’ satisfaction and allows maximum utilization of available resources based on congestion in the network. A simulation environment is developed to study the quantitative performance of DRAMA in hybrid access-control femtocell network and compare it to closed and open access mechanisms. The performance analysis shows that higher number of random users gets connected to the FAP without compromising FAP owners’ satisfaction allowing the macrocell to offload a large number of users in a dense heterogeneous network.

  3. Empirical Modeling of the Plasmasphere Dynamics Using Neural Networks

    Science.gov (United States)

    Zhelavskaya, I. S.; Shprits, Y.; Spasojevic, M.

    2017-12-01

    We present a new empirical model for reconstructing the global dynamics of the cold plasma density distribution based only on solar wind data and geomagnetic indices. Utilizing the density database obtained using the NURD (Neural-network-based Upper hybrid Resonance Determination) algorithm for the period of October 1, 2012 - July 1, 2016, in conjunction with solar wind data and geomagnetic indices, we develop a neural network model that is capable of globally reconstructing the dynamics of the cold plasma density distribution for 2 ≤ L ≤ 6 and all local times. We validate and test the model by measuring its performance on independent datasets withheld from the training set and by comparing the model predicted global evolution with global images of He+ distribution in the Earth's plasmasphere from the IMAGE Extreme UltraViolet (EUV) instrument. We identify the parameters that best quantify the plasmasphere dynamics by training and comparing multiple neural networks with different combinations of input parameters (geomagnetic indices, solar wind data, and different durations of their time history). We demonstrate results of both local and global plasma density reconstruction. This study illustrates how global dynamics can be reconstructed from local in-situ observations by using machine learning techniques.

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

  5. Oscillations during observations: Dynamic oscillatory networks serving visuospatial attention.

    Science.gov (United States)

    Wiesman, Alex I; Heinrichs-Graham, Elizabeth; Proskovec, Amy L; McDermott, Timothy J; Wilson, Tony W

    2017-10-01

    The dynamic allocation of neural resources to discrete features within a visual scene enables us to react quickly and accurately to salient environmental circumstances. A network of bilateral cortical regions is known to subserve such visuospatial attention functions; however the oscillatory and functional connectivity dynamics of information coding within this network are not fully understood. Particularly, the coding of information within prototypical attention-network hubs and the subsecond functional connections formed between these hubs have not been adequately characterized. Herein, we use the precise temporal resolution of magnetoencephalography (MEG) to define spectrally specific functional nodes and connections that underlie the deployment of attention in visual space. Twenty-three healthy young adults completed a visuospatial discrimination task designed to elicit multispectral activity in visual cortex during MEG, and the resulting data were preprocessed and reconstructed in the time-frequency domain. Oscillatory responses were projected to the cortical surface using a beamformer, and time series were extracted from peak voxels to examine their temporal evolution. Dynamic functional connectivity was then computed between nodes within each frequency band of interest. We find that visual attention network nodes are defined functionally by oscillatory frequency, that the allocation of attention to the visual space dynamically modulates functional connectivity between these regions on a millisecond timescale, and that these modulations significantly correlate with performance on a spatial discrimination task. We conclude that functional hubs underlying visuospatial attention are segregated not only anatomically but also by oscillatory frequency, and importantly that these oscillatory signatures promote dynamic communication between these hubs. Hum Brain Mapp 38:5128-5140, 2017. © 2017 Wiley Periodicals, Inc. © 2017 Wiley Periodicals, Inc.

  6. Network Traffic Monitoring Using Poisson Dynamic Linear Models

    Energy Technology Data Exchange (ETDEWEB)

    Merl, D. M. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2011-05-09

    In this article, we discuss an approach for network forensics using a class of nonstationary Poisson processes with embedded dynamic linear models. As a modeling strategy, the Poisson DLM (PoDLM) provides a very flexible framework for specifying structured effects that may influence the evolution of the underlying Poisson rate parameter, including diurnal and weekly usage patterns. We develop a novel particle learning algorithm for online smoothing and prediction for the PoDLM, and demonstrate the suitability of the approach to real-time deployment settings via a new application to computer network traffic monitoring.

  7. Fast Distributed Dynamics of Semantic Networks via Social Media

    Directory of Open Access Journals (Sweden)

    Facundo Carrillo

    2015-01-01

    Full Text Available We investigate the dynamics of semantic organization using social media, a collective expression of human thought. We propose a novel, time-dependent semantic similarity measure (TSS, based on the social network Twitter. We show that TSS is consistent with static measures of similarity but provides high temporal resolution for the identification of real-world events and induced changes in the distributed structure of semantic relationships across the entire lexicon. Using TSS, we measured the evolution of a concept and its movement along the semantic neighborhood, driven by specific news/events. Finally, we showed that particular events may trigger a temporary reorganization of elements in the semantic network.

  8. Role of network dynamics in shaping spike timing reliability

    International Nuclear Information System (INIS)

    Bazhenov, Maxim; Rulkov, Nikolai F.; Fellous, Jean-Marc; Timofeev, Igor

    2005-01-01

    We study the reliability of cortical neuron responses to periodically modulated synaptic stimuli. Simple map-based models of two different types of cortical neurons are constructed to replicate the intrinsic resonances of reliability found in experimental data and to explore the effects of those resonance properties on collective behavior in a cortical network model containing excitatory and inhibitory cells. We show that network interactions can enhance the frequency range of reliable responses and that the latter can be controlled by the strength of synaptic connections. The underlying dynamical mechanisms of reliability enhancement are discussed

  9. Dynamic Pricing in Electronic Commerce Using Neural Network

    Science.gov (United States)

    Ghose, Tapu Kumar; Tran, Thomas T.

    In this paper, we propose an approach where feed-forward neural network is used for dynamically calculating a competitive price of a product in order to maximize sellers’ revenue. In the approach we considered that along with product price other attributes such as product quality, delivery time, after sales service and seller’s reputation contribute in consumers purchase decision. We showed that once the sellers, by using their limited prior knowledge, set an initial price of a product our model adjusts the price automatically with the help of neural network so that sellers’ revenue is maximized.

  10. Network robustness assessed within a dual connectivity framework: joint dynamics of the Active and Idle Networks.

    Science.gov (United States)

    Tejedor, Alejandro; Longjas, Anthony; Zaliapin, Ilya; Ambroj, Samuel; Foufoula-Georgiou, Efi

    2017-08-17

    Network robustness against attacks has been widely studied in fields as diverse as the Internet, power grids and human societies. But current definition of robustness is only accounting for half of the story: the connectivity of the nodes unaffected by the attack. Here we propose a new framework to assess network robustness, wherein the connectivity of the affected nodes is also taken into consideration, acknowledging that it plays a crucial role in properly evaluating the overall network robustness in terms of its future recovery from the attack. Specifically, we propose a dual perspective approach wherein at any instant in the network evolution under attack, two distinct networks are defined: (i) the Active Network (AN) composed of the unaffected nodes and (ii) the Idle Network (IN) composed of the affected nodes. The proposed robustness metric considers both the efficiency of destroying the AN and that of building-up the IN. We show, via analysis of well-known prototype networks and real world data, that trade-offs between the efficiency of Active and Idle Network dynamics give rise to surprising robustness crossovers and re-rankings, which can have significant implications for decision making.

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

    Science.gov (United States)

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

    2017-10-06

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

  12. Networks dynamics in the case of emerging technologies

    Energy Technology Data Exchange (ETDEWEB)

    Rotolo, D

    2016-07-01

    This research in progress aims at increasing our understanding of how collaborative networks form, evolve and are configured in the case of emerging technologies. The architecture of the relationships among the variety of organisational actors involved in the emergence process exerts a significant influence in shaping technological change in certain directions rather than others, especially in the early stage of emergence. As a result, socially optimal or desirable technological trajectories may be ‘opportunistically’ rejected. Our empirical analysis is based on a case-study of an emerging medical technology, namely ‘microneedles’. On the basis of co-authorship data reported in 1,943 publications on the topic from 1990 to 2014, longitudinal collaboration (co-authorship) networks were built at two levels: affiliation and author. We examined the dynamics of co-authorship networks by building on recent methodological advancements in network analysis, i.e. Exponential Random Graph Models (ERGMs). These models enable us to make statistical inferences about on the extent to which a network configuration occurs more than could be expected by chance and to identify which social mechanisms may be shaping the network in certain configurations. The findings of the statistical analyses (currently in progress) combined with the qualitative understanding of the case will increase our understanding of which mechanisms are more likely to drive the network dynamics in the case of emerging technologies. These include evidence of the extent to which the likelihood of forming, maintaining, or terminating ties among actors (authors or affiliations) is affected by actors’ covariates such as types of organisations, diversity/specialisation of the research undertaken, and status. These findings have potential to provide important inputs for policymaking process in the case of emerging technologies. (Author)

  13. Networks dynamics in the case of emerging technologies

    International Nuclear Information System (INIS)

    Rotolo, D

    2016-01-01

    This research in progress aims at increasing our understanding of how collaborative networks form, evolve and are configured in the case of emerging technologies. The architecture of the relationships among the variety of organisational actors involved in the emergence process exerts a significant influence in shaping technological change in certain directions rather than others, especially in the early stage of emergence. As a result, socially optimal or desirable technological trajectories may be ‘opportunistically’ rejected. Our empirical analysis is based on a case-study of an emerging medical technology, namely ‘microneedles’. On the basis of co-authorship data reported in 1,943 publications on the topic from 1990 to 2014, longitudinal collaboration (co-authorship) networks were built at two levels: affiliation and author. We examined the dynamics of co-authorship networks by building on recent methodological advancements in network analysis, i.e. Exponential Random Graph Models (ERGMs). These models enable us to make statistical inferences about on the extent to which a network configuration occurs more than could be expected by chance and to identify which social mechanisms may be shaping the network in certain configurations. The findings of the statistical analyses (currently in progress) combined with the qualitative understanding of the case will increase our understanding of which mechanisms are more likely to drive the network dynamics in the case of emerging technologies. These include evidence of the extent to which the likelihood of forming, maintaining, or terminating ties among actors (authors or affiliations) is affected by actors’ covariates such as types of organisations, diversity/specialisation of the research undertaken, and status. These findings have potential to provide important inputs for policymaking process in the case of emerging technologies. (Author)

  14. Effects of Neuromodulation on Excitatory-Inhibitory Neural Network Dynamics Depend on Network Connectivity Structure

    Science.gov (United States)

    Rich, Scott; Zochowski, Michal; Booth, Victoria

    2018-01-01

    Acetylcholine (ACh), one of the brain's most potent neuromodulators, can affect intrinsic neuron properties through blockade of an M-type potassium current. The effect of ACh on excitatory and inhibitory cells with this potassium channel modulates their membrane excitability, which in turn affects their tendency to synchronize in networks. Here, we study the resulting changes in dynamics in networks with inter-connected excitatory and inhibitory populations (E-I networks), which are ubiquitous in the brain. Utilizing biophysical models of E-I networks, we analyze how the network connectivity structure in terms of synaptic connectivity alters the influence of ACh on the generation of synchronous excitatory bursting. We investigate networks containing all combinations of excitatory and inhibitory cells with high (Type I properties) or low (Type II properties) modulatory tone. To vary network connectivity structure, we focus on the effects of the strengths of inter-connections between excitatory and inhibitory cells (E-I synapses and I-E synapses), and the strengths of intra-connections among excitatory cells (E-E synapses) and among inhibitory cells (I-I synapses). We show that the presence of ACh may or may not affect the generation of network synchrony depending on the network connectivity. Specifically, strong network inter-connectivity induces synchronous excitatory bursting regardless of the cellular propensity for synchronization, which aligns with predictions of the PING model. However, when a network's intra-connectivity dominates its inter-connectivity, the propensity for synchrony of either inhibitory or excitatory cells can determine the generation of network-wide bursting.

  15. Some dynamic resource allocation problems in wireless networks

    Science.gov (United States)

    Berry, Randall

    2001-07-01

    We consider dynamic resource allocation problems that arise in wireless networking. Specifically transmission scheduling problems are studied in cases where a user can dynamically allocate communication resources such as transmission rate and power based on current channel knowledge as well as traffic variations. We assume that arriving data is stored in a transmission buffer, and investigate the trade-off between average transmission power and average buffer delay. A general characterization of this trade-off is given and the behavior of this trade-off in the regime of asymptotically large buffer delays is explored. An extension to a more general utility based quality of service definition is also discussed.

  16. Dynamic Power Tariff for Congestion Management in Distribution Networks

    DEFF Research Database (Denmark)

    Huang, Shaojun; Wu, Qiuwei; Shahidehpour, Mohammad

    2018-01-01

    This paper proposes dynamic power tariff (DPT), a new concept for congestion management in distribution networks with high penetration of electric vehicles (EVs), and heat pumps (HPs). The DPT concept is proposed to overcome a drawback of the dynamic tariff (DT) method, i.e., DPT can replace...... the price sensitivity parameter in the DT method, which is relatively unrealistic in practice. Based on the control theory, a control model with two control loops, i.e., the power flow control and voltage control, is established to analyze the congestion management process by the DPT method. Furthermore...

  17. Data Driven Broiler Weight Forecasting using Dynamic Neural Network Models

    DEFF Research Database (Denmark)

    Johansen, Simon Vestergaard; Bendtsen, Jan Dimon; Riisgaard-Jensen, Martin

    2017-01-01

    In this article, the dynamic influence of environmental broiler house conditions and broiler growth is investigated. Dynamic neural network forecasting models have been trained on farm-scale broiler batch production data from 12 batches from the same house. The model forecasts future broiler weight...... and uses environmental conditions such as heating, ventilation, and temperature along with broiler behavior such as feed and water consumption. Training data and forecasting data is analyzed to explain when the model might fail at generalizing. We present ensemble broiler weight forecasts to day 7, 14, 21...

  18. Global value chains: Building blocks and network dynamics

    Science.gov (United States)

    Tsekeris, Theodore

    2017-12-01

    The paper employs measures and tools from complex network analysis to enhance the understanding and interpretation of structural characteristics pertaining to the Global Value Chains (GVCs) during the period 1995-2011. The analysis involves the country, sector and country-sector value chain networks to identify main drivers of structural change. The results indicate significant intertemporal changes, mirroring the increased globalization in terms of network size, strength and connectivity. They also demonstrate higher clustering and increased concentration of the most influential countries and country-sectors relative to all others in the GVC network, with the geographical dimension to prevail over the sectoral dimension in the formation of value chains. The regionalization and less hierarchical organization drive country-sector production sharing, while the sectoral value chain network has become more integrated and more competitive over time. The findings suggest that the impact of country-sector policies and/or shocks may vary with the own-group and network-wide influence of each country, take place in multiple geographical scales, as GVCs have a block structure, and involve time dynamics.

  19. Neural network modeling of chaotic dynamics in nuclear reactor flows

    International Nuclear Information System (INIS)

    Welstead, S.T.

    1992-01-01

    Neural networks have many scientific applications in areas such as pattern classification and time series prediction. The universal approximation property of these networks, however, can also be exploited to provide researchers with tool for modeling observed nonlinear phenomena. It has been shown that multilayer feed forward networks can capture important global nonlinear properties, such as chaotic dynamics, merely by training the network on a finite set of observed data. The network itself then provides a model of the process that generated the data. Characterizations such as the existence and general shape of a strange attractor and the sign of the largest Lyapunov exponent can then be extracted from the neural network model. In this paper, the author applies this idea to data generated from a nonlinear process that is representative of convective flows that can arise in nuclear reactor applications. Such flows play a role in forced convection heat removal from pressurized water reactors and boiling water reactors, and decay heat removal from liquid-metal-cooled reactors, either by natural convection or by thermosyphons

  20. Local dynamics of gap-junction-coupled interneuron networks

    International Nuclear Information System (INIS)

    Lau, Troy; Zochowski, Michal; Gage, Gregory J; Berke, Joshua D

    2010-01-01

    Interneurons coupled by both electrical gap-junctions (GJs) and chemical GABAergic synapses are major components of forebrain networks. However, their contributions to the generation of specific activity patterns, and their overall contributions to network function, remain poorly understood. Here we demonstrate, using computational methods, that the topological properties of interneuron networks can elicit a wide range of activity dynamics, and either prevent or permit local pattern formation. We systematically varied the topology of GJ and inhibitory chemical synapses within simulated networks, by changing connection types from local to random, and changing the total number of connections. As previously observed we found that randomly coupled GJs lead to globally synchronous activity. In contrast, we found that local GJ connectivity may govern the formation of highly spatially heterogeneous activity states. These states are inherently temporally unstable when the input is uniformly random, but can rapidly stabilize when the network detects correlations or asymmetries in the inputs. We show a correspondence between this feature of network activity and experimental observations of transient stabilization of striatal fast-spiking interneurons (FSIs), in electrophysiological recordings from rats performing a simple decision-making task. We suggest that local GJ coupling enables an active search-and-select function of striatal FSIs, which contributes to the overall role of cortical-basal ganglia circuits in decision-making

  1. A Dynamic Reputation Management System for Mobile Ad Hoc Networks

    Directory of Open Access Journals (Sweden)

    Eric Chiejina

    2015-04-01

    Full Text Available Nodes in mobile ad hoc networks (MANETs are mandated to utilize their limited energy resources in forwarding routing control and data packets for other nodes. Since a MANET lacks a centralized administration and control, a node may decide to act selfishly, either by refusing to respond to route requests from other nodes or deceitfully by responding to some route requests, but dropping the corresponding data packets that are presented for forwarding. A significant increase in the presence of these misbehaving nodes in a MANET can subsequently degrade network performance. In this paper, we propose a dynamic reputation management system for detecting and isolating misbehaving nodes in MANETs. Our model employs a novel direct monitoring technique to evaluate the reputation of a node in the network, which ensures that nodes that expend their energy in transmitting data and routing control packets for others are allowed to carry out their network activities while the misbehaving nodes are detected and isolated from the network. Simulation results show that our model is effective at curbing and mitigating the effects of misbehaving nodes in the network.

  2. Architecture and dynamics of overlapped RNA regulatory networks.

    Science.gov (United States)

    Lapointe, Christopher P; Preston, Melanie A; Wilinski, Daniel; Saunders, Harriet A J; Campbell, Zachary T; Wickens, Marvin

    2017-11-01

    A single protein can bind and regulate many mRNAs. Multiple proteins with similar specificities often bind and control overlapping sets of mRNAs. Yet little is known about the architecture or dynamics of overlapped networks. We focused on three proteins with similar structures and related RNA-binding specificities-Puf3p, Puf4p, and Puf5p of S. cerevisiae Using RNA Tagging, we identified a "super-network" comprised of four subnetworks: Puf3p, Puf4p, and Puf5p subnetworks, and one controlled by both Puf4p and Puf5p. The architecture of individual subnetworks, and thus the super-network, is determined by competition among particular PUF proteins to bind mRNAs, their affinities for binding elements, and the abundances of the proteins. The super-network responds dramatically: The remaining network can either expand or contract. These strikingly opposite outcomes are determined by an interplay between the relative abundance of the RNAs and proteins, and their affinities for one another. The diverse interplay between overlapping RNA-protein networks provides versatile opportunities for regulation and evolution. © 2017 Lapointe et al.; Published by Cold Spring Harbor Laboratory Press for the RNA Society.

  3. Prediction-based Dynamic Energy Management in Wireless Sensor Networks

    Science.gov (United States)

    Wang, Xue; Ma, Jun-Jie; Wang, Sheng; Bi, Dao-Wei

    2007-01-01

    Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.

  4. Sign Inference for Dynamic Signed Networks via Dictionary Learning

    Directory of Open Access Journals (Sweden)

    Yi Cen

    2013-01-01

    Full Text Available Mobile online social network (mOSN is a burgeoning research area. However, most existing works referring to mOSNs deal with static network structures and simply encode whether relationships among entities exist or not. In contrast, relationships in signed mOSNs can be positive or negative and may be changed with time and locations. Applying certain global characteristics of social balance, in this paper, we aim to infer the unknown relationships in dynamic signed mOSNs and formulate this sign inference problem as a low-rank matrix estimation problem. Specifically, motivated by the Singular Value Thresholding (SVT algorithm, a compact dictionary is selected from the observed dataset. Based on this compact dictionary, the relationships in the dynamic signed mOSNs are estimated via solving the formulated problem. Furthermore, the estimation accuracy is improved by employing a dictionary self-updating mechanism.

  5. A dynamic allocation mechanism of delivering capacity in coupled networks

    International Nuclear Information System (INIS)

    Du, Wen-Bo; Zhou, Xing-Lian; Zhu, Yan-Bo; Zheng, Zheng

    2015-01-01

    Traffic process is ubiquitous in many critical infrastructures. In this paper, we introduce a mechanism to dynamically allocate the delivering capacity into the data-packet traffic model on the coupled Internet autonomous-system-level network of South Korea and Japan, and focus on its effect on the transport efficiency. In this mechanism, the total delivering capacity is constant and the lowest-load node will give one unit delivering capacity to the highest-load node at each time step. It is found that the delivering capacity of busy nodes and non-busy nodes can be well balanced and the effective betweenness of busy nodes with interconnections is significantly reduced. Consequently, the transport efficiency such as average traveling time and packet arrival rate is remarkably improved. Our work may shed some light on the traffic dynamics in coupled networks.

  6. Prediction-based Dynamic Energy Management in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Dao-Wei Bi

    2007-03-01

    Full Text Available Energy consumption is a critical constraint in wireless sensor networks. Focusing on the energy efficiency problem of wireless sensor networks, this paper proposes a method of prediction-based dynamic energy management. A particle filter was introduced to predict a target state, which was adopted to awaken wireless sensor nodes so that their sleep time was prolonged. With the distributed computing capability of nodes, an optimization approach of distributed genetic algorithm and simulated annealing was proposed to minimize the energy consumption of measurement. Considering the application of target tracking, we implemented target position prediction, node sleep scheduling and optimal sensing node selection. Moreover, a routing scheme of forwarding nodes was presented to achieve extra energy conservation. Experimental results of target tracking verified that energy-efficiency is enhanced by prediction-based dynamic energy management.

  7. Distance learning, problem based learning and dynamic knowledge networks.

    Science.gov (United States)

    Giani, U; Martone, P

    1998-06-01

    This paper is an attempt to develop a distance learning model grounded upon a strict integration of problem based learning (PBL), dynamic knowledge networks (DKN) and web tools, such as hypermedia documents, synchronous and asynchronous communication facilities, etc. The main objective is to develop a theory of distance learning based upon the idea that learning is a highly dynamic cognitive process aimed at connecting different concepts in a network of mutually supporting concepts. Moreover, this process is supposed to be the result of a social interaction that has to be facilitated by the web. The model was tested by creating a virtual classroom of medical and nursing students and activating a learning session on the concept of knowledge representation in health sciences.

  8. Dynamics, stability, and statistics on lattices and networks

    International Nuclear Information System (INIS)

    Livi, Roberto

    2014-01-01

    These lectures aim at surveying some dynamical models that have been widely explored in the recent scientific literature as case studies of complex dynamical evolution, emerging from the spatio-temporal organization of several coupled dynamical variables. The first message is that a suitable mathematical description of such models needs tools and concepts borrowed from the general theory of dynamical systems and from out-of-equilibrium statistical mechanics. The second message is that the overall scenario is definitely reacher than the standard problems in these fields. For instance, systems exhibiting complex unpredictable evolution do not necessarily exhibit deterministic chaotic behavior (i.e., Lyapunov chaos) as it happens for dynamical models made of a few degrees of freedom. In fact, a very large number of spatially organized dynamical variables may yield unpredictable evolution even in the absence of Lyapunov instability. Such a mechanism may emerge from the combination of spatial extension and nonlinearity. Moreover, spatial extension allows one to introduce naturally disorder, or heterogeneity of the interactions as important ingredients for complex evolution. It is worth to point out that the models discussed in these lectures share such features, despite they have been inspired by quite different physical and biological problems. Along these lectures we describe also some of the technical tools employed for the study of such models, e.g., Lyapunov stability analysis, unpredictability indicators for “stable chaos,” hydrodynamic description of transport in low spatial dimension, spectral decomposition of stochastic dynamics on directed networks, etc

  9. Unconventional computing using evolution-in-nanomaterio: neural networks meet nanoparticle networks

    NARCIS (Netherlands)

    Greff, Klaus; van Damme, Rudolf M.J.; Koutnik, Jan; Broersma, Haitze J.; Mikhal, Julia Olegivna; Lawrence, Celestine Preetham; van der Wiel, Wilfred Gerard; Schmidhuber, Jürgen

    2016-01-01

    Recently published experimental work on evolution-in-materio applied to nanoscale materials shows promising results for future reconfigurable devices. These experiments were performed on disordered nano-particle networks that have no predefined design. The material has been treated as a blackbox,

  10. IAEA consultants' meeting: 9th meeting of atomic and molecular data centres and ALADDIN network, Vienna, September 20 and 21, 1990

    International Nuclear Information System (INIS)

    Janev, R.K.

    1990-11-01

    This Summary Report contains the proceedings and the conclusions of the IAEA Consultants' Meeting: 9th Meeting of Atomic and Molecular Data Centres and ALADDIN Network, convened on September 20 and 21, 1990, at the IAEA Headquarters in Vienna. The Progress Reports of national atomic data centres and reports on the ALADDIN status and developments are also included as appendices to the present Report. (author). Refs, figs and tabs

  11. Adaptive contact networks change effective disease infectiousness and dynamics.

    Science.gov (United States)

    Van Segbroeck, Sven; Santos, Francisco C; Pacheco, Jorge M

    2010-08-19

    Human societies are organized in complex webs that are constantly reshaped by a social dynamic which is influenced by the information individuals have about others. Similarly, epidemic spreading may be affected by local information that makes individuals aware of the health status of their social contacts, allowing them to avoid contact with those infected and to remain in touch with the healthy. Here we study disease dynamics in finite populations in which infection occurs along the links of a dynamical contact network whose reshaping may be biased based on each individual's health status. We adopt some of the most widely used epidemiological models, investigating the impact of the reshaping of the contact network on the disease dynamics. We derive analytical results in the limit where network reshaping occurs much faster than disease spreading and demonstrate numerically that this limit extends to a much wider range of time scales than one might anticipate. Specifically, we show that from a population-level description, disease propagation in a quickly adapting network can be formulated equivalently as disease spreading on a well-mixed population but with a rescaled infectiousness. We find that for all models studied here--SI, SIS and SIR--the effective infectiousness of a disease depends on the population size, the number of infected in the population, and the capacity of healthy individuals to sever contacts with the infected. Importantly, we indicate how the use of available information hinders disease progression, either by reducing the average time required to eradicate a disease (in case recovery is possible), or by increasing the average time needed for a disease to spread to the entire population (in case recovery or immunity is impossible).

  12. Dynamic simulation of a steam generator by neural networks

    International Nuclear Information System (INIS)

    Masini, R.; Padovani, E.; Ricotti, M.E.; Zio, E.

    1999-01-01

    Numerical simulation by computers of the dynamic evolution of complex systems and components is a fundamental phase of any modern engineering design activity. This is of particular importance for risk-based design projects which require that the system behavior be analyzed under several and often extreme conditions. The traditional methods of simulation typically entail long, iterative, processes which lead to large simulation times, often exceeding the transients real time. Artificial neural networks (ANNs) may be exploited in this context, their advantages residing mainly in the speed of computation, in the capability of generalizing from few examples, in the robustness to noisy and partially incomplete data and in the capability of performing empirical input-output mapping without complete knowledge of the underlying physics. In this paper we present a novel approach to dynamic simulation by ANNs based on a superposition scheme in which a set of networks are individually trained, each one to respond to a different input forcing function. The dynamic simulation of a steam generator is considered as an example to show the potentialities of this tool and to point out the difficulties and crucial issues which typically arise when attempting to establish an efficient neural network simulator. The structure of the networks system is such to feedback, at each time step, a portion of the past evolution of the transient and this allows a good reproduction of also non-linear dynamic behaviors. A nice characteristic of the approach is that the modularization of the training reduces substantially its burden and gives this neural simulation tool a nice feature of transportability. (orig.)

  13. On the dynamic analysis of piecewise-linear networks

    OpenAIRE

    Heemels, W.P.M.H.; Camlibel, M.K.; Schumacher, J.M.

    2002-01-01

    Piecewise-linear (PL) modeling is often used to approximate the behavior of nonlinear circuits. One of the possible PL modeling methodologies is based on the linear complementarity problem, and this approach has already been used extensively in the circuits and systems community for static networks. In this paper, the object of study will be dynamic electrical circuits that can be recast as linear complementarity systems, i.e., as interconnections of linear time-invariant differential equatio...

  14. Dynamic Trust Models between Users over Social Networks

    Science.gov (United States)

    2016-03-30

    SUPPLEMENTARY NOTES 14. ABSTRACT In this project, by focusing on a number of word -of- mouth communication websites, we attempted to...analyzed evolution of trust networks in social media sites from a perspective of mediators. To this end, we proposed two stochastic models that...focusing on a number of word -of- mouth communication websites, we first attempt to construct dynamic trust models between users that enable to explain trust

  15. Complexity and network dynamics in physiological adaptation: An integrated view

    OpenAIRE

    Baffy, Gyorgy; Loscalzo, Joseph

    2014-01-01

    Living organisms constantly interact with their surroundings and sustain internal stability against perturbations. This dynamic process follows three fundamental strategies (restore, explore, and abandon) articulated in historical concepts of physiological adaptation such as homeostasis, allostasis, and the general adaptation syndrome. These strategies correspond to elementary forms of behavior (ordered, chaotic, and static) in complex adaptive systems and invite a network-based analysis of t...

  16. The Dynamics of Networks of Identical Theta Neurons.

    Science.gov (United States)

    Laing, Carlo R

    2018-02-05

    We consider finite and infinite all-to-all coupled networks of identical theta neurons. Two types of synaptic interactions are investigated: instantaneous and delayed (via first-order synaptic processing). Extensive use is made of the Watanabe/Strogatz (WS) ansatz for reducing the dimension of networks of identical sinusoidally-coupled oscillators. As well as the degeneracy associated with the constants of motion of the WS ansatz, we also find continuous families of solutions for instantaneously coupled neurons, resulting from the reversibility of the reduced model and the form of the synaptic input. We also investigate a number of similar related models. We conclude that the dynamics of networks of all-to-all coupled identical neurons can be surprisingly complicated.

  17. DYNAMIC LIGHTING CONTROL INSIDE OF BUILDINGS OVER THE PROFIBUSDP NETWORK

    Directory of Open Access Journals (Sweden)

    Cemal YILMAZ

    2007-01-01

    Full Text Available In this study, dynamic lighting control inside of buildings has been implemented over the Profibus-DP network. Automatically adjustable luminaries were used to adjust lighting level to desired values. The data received from sensors measuring illuminance levels inside building are transferred to central control unit over the Profibus-DP network. These data are evaluated in the control unit and then control signals related to evaluation results are sent to the luminaries over the Profibus-DP network. As a reason of this design, optimum energy usage has been supplied by controlling the lighting remotely. Moreover, a healthy lighting environment has been obtained by means of adjusting the illuminance level related to lighting variations occurred in the various hours of a day.

  18. Amplitude chimeras and chimera death in dynamical networks

    International Nuclear Information System (INIS)

    Zakharova, Anna; Kapeller, Marie; Schöll, Eckehard

    2016-01-01

    We find chimera states with respect to amplitude dynamics in a network of Stuart- Landau oscillators. These partially coherent and partially incoherent spatio-temporal patterns appear due to the interplay of nonlocal network topology and symmetry-breaking coupling. As the coupling range is increased, the oscillations are quenched, amplitude chimeras disappear and the network enters a symmetry-breaking stationary state. This particular regime is a novel pattern which we call chimera death. It is characterized by the coexistence of spatially coherent and incoherent inhomogeneous steady states and therefore combines the features of chimera state and oscillation death. Additionally, we show two different transition scenarios from amplitude chimera to chimera death. Moreover, for amplitude chimeras we uncover the mechanism of transition towards in-phase synchronized regime and discuss the role of initial conditions. (paper)

  19. Dynamic Subsidy Method for Congestion Management in Distribution Networks

    DEFF Research Database (Denmark)

    Huang, Shaojun; Wu, Qiuwei

    2016-01-01

    Dynamic subsidy (DS) is a locational price paid by the distribution system operator (DSO) to its customers in order to shift energy consumption to designated hours and nodes. It is promising for demand side management and congestion management. This paper proposes a new DS method for congestion...... management in distribution networks, including the market mechanism, the mathematical formulation through a two-level optimization, and the method solving the optimization by tightening the constraints and linearization. Case studies were conducted with a one node system and the Bus 4 distribution network...... of the Roy Billinton Test System (RBTS) with high penetration of electric vehicles (EVs) and heat pumps (HPs). The case studies demonstrate the efficacy of the DS method for congestion management in distribution networks. Studies in this paper show that the DS method offers the customers a fair opportunity...

  20. A High-Resolution Sensor Network for Monitoring Glacier Dynamics

    Science.gov (United States)

    Edwards, S.; Murray, T.; O'Farrell, T.; Rutt, I. C.; Loskot, P.; Martin, I.; Selmes, N.; Aspey, R.; James, T.; Bevan, S. L.; Baugé, T.

    2013-12-01

    Changes in Greenland and Antarctic ice sheets due to ice flow/ice-berg calving are a major uncertainty affecting sea-level rise forecasts. Latterly GNSS (Global Navigation Satellite Systems) have been employed extensively to monitor such glacier dynamics. Until recently however, the favoured methodology has been to deploy sensors onto the glacier surface, collect data for a period of time, then retrieve and download the sensors. This approach works well in less dynamic environments where the risk of sensor loss is low. In more extreme environments e.g. approaching the glacial calving front, the risk of sensor loss and hence data loss increases dramatically. In order to provide glaciologists with new insights into flow dynamics and calving processes we have developed a novel sensor network to increase the robustness of data capture. We present details of the technological requirements for an in-situ Zigbee wireless streaming network infrastructure supporting instantaneous data acquisition from high resolution GNSS sensors thereby increasing data capture robustness. The data obtained offers new opportunities to investigate the interdependence of mass flow, uplift, velocity and geometry and the network architecture has been specifically designed for deployment by helicopter close to the calving front to yield unprecedented detailed information. Following successful field trials of a pilot three node network during 2012, a larger 20 node network was deployed on the fast-flowing Helheim glacier, south-east Greenland over the summer months of 2013. The utilisation of dual wireless transceivers in each glacier node, multiple frequencies and four ';collector' stations located on the valley sides creates overlapping networks providing enhanced capacity, diversity and redundancy of data 'back-haul', even close to ';floor' RSSI (Received Signal Strength Indication) levels around -100 dBm. Data loss through radio packet collisions within sub-networks are avoided through the

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

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

  3. Evaluating complementary networks of restoration plantings for landscape-scale occurrence of temporally dynamic species.

    Science.gov (United States)

    Ikin, Karen; Tulloch, Ayesha; Gibbons, Philip; Ansell, Dean; Seddon, Julian; Lindenmayer, David

    2016-10-01

    Multibillion dollar investments in land restoration make it critical that conservation goals are achieved cost-effectively. Approaches developed for systematic conservation planning offer opportunities to evaluate landscape-scale, temporally dynamic biodiversity outcomes from restoration and improve on traditional approaches that focus on the most species-rich plantings. We investigated whether it is possible to apply a complementarity-based approach to evaluate the extent to which an existing network of restoration plantings meets representation targets. Using a case study of woodland birds of conservation concern in southeastern Australia, we compared complementarity-based selections of plantings based on temporally dynamic species occurrences with selections based on static species occurrences and selections based on ranking plantings by species richness. The dynamic complementarity approach, which incorporated species occurrences over 5 years, resulted in higher species occurrences and proportion of targets met compared with the static complementarity approach, in which species occurrences were taken at a single point in time. For equivalent cost, the dynamic complementarity approach also always resulted in higher average minimum percent occurrence of species maintained through time and a higher proportion of the bird community meeting representation targets compared with the species-richness approach. Plantings selected under the complementarity approaches represented the full range of planting attributes, whereas those selected under the species-richness approach were larger in size. Our results suggest that future restoration policy should not attempt to achieve all conservation goals within individual plantings, but should instead capitalize on restoration opportunities as they arise to achieve collective value of multiple plantings across the landscape. Networks of restoration plantings with complementary attributes of age, size, vegetation structure, and

  4. Core reactivity estimation in space reactors using recurrent dynamic networks

    Science.gov (United States)

    Parlos, Alexander G.; Tsai, Wei K.

    1991-01-01

    A recurrent multilayer perceptron network topology is used in the identification of nonlinear dynamic systems from only the input/output measurements. The identification is performed in the discrete time domain, with the learning algorithm being a modified form of the back propagation (BP) rule. The recurrent dynamic network (RDN) developed is applied for the total core reactivity prediction of a spacecraft reactor from only neutronic power level measurements. Results indicate that the RDN can reproduce the nonlinear response of the reactor while keeping the number of nodes roughly equal to the relative order of the system. As accuracy requirements are increased, the number of required nodes also increases, however, the order of the RDN necessary to obtain such results is still in the same order of magnitude as the order of the mathematical model of the system. It is believed that use of the recurrent MLP structure with a variety of different learning algorithms may prove useful in utilizing artificial neural networks for recognition, classification, and prediction of dynamic systems.

  5. Evolution properties of the community members for dynamic networks

    Science.gov (United States)

    Yang, Kai; Guo, Qiang; Li, Sheng-Nan; Han, Jing-Ti; Liu, Jian-Guo

    2017-03-01

    The collective behaviors of community members for dynamic social networks are significant for understanding evolution features of communities. In this Letter, we empirically investigate the evolution properties of the new community members for dynamic networks. Firstly, we separate data sets into different slices, and analyze the statistical properties of new members as well as communities they joined in for these data sets. Then we introduce a parameter φ to describe community evolution between different slices and investigate the dynamic community properties of the new community members. The empirical analyses for the Facebook, APS, Enron and Wiki data sets indicate that both the number of new members and joint communities increase, the ratio declines rapidly and then becomes stable over time, and most of the new members will join in the small size communities that is s ≤ 10. Furthermore, the proportion of new members in existed communities decreases firstly and then becomes stable and relatively small for these data sets. Our work may be helpful for deeply understanding the evolution properties of community members for social networks.

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

  7. Information dynamics of brain–heart physiological networks during sleep

    International Nuclear Information System (INIS)

    Faes, L; Nollo, G; Jurysta, F; Marinazzo, D

    2014-01-01

    This study proposes an integrated approach, framed in the emerging fields of network physiology and information dynamics, for the quantitative analysis of brain–heart interaction networks during sleep. With this approach, the time series of cardiac vagal autonomic activity and brain wave activities measured respectively as the normalized high frequency component of heart rate variability and the EEG power in the δ, θ, α, σ, and β bands, are considered as realizations of the stochastic processes describing the dynamics of the heart system and of different brain sub-systems. Entropy-based measures are exploited to quantify the predictive information carried by each (sub)system, and to dissect this information into a part actively stored in the system and a part transferred to it from the other connected systems. The application of this approach to polysomnographic recordings of ten healthy subjects led us to identify a structured network of sleep brain–brain and brain–heart interactions, with the node described by the β EEG power acting as a hub which conveys the largest amount of information flowing between the heart and brain nodes. This network was found to be sustained mostly by the transitions across different sleep stages, as the information transfer was weaker during specific stages than during the whole night, and vanished progressively when moving from light sleep to deep sleep and to REM sleep. (paper)

  8. A natural experiment of social network formation and dynamics.

    Science.gov (United States)

    Phan, Tuan Q; Airoldi, Edoardo M

    2015-05-26

    Social networks affect many aspects of life, including the spread of diseases, the diffusion of information, the workers' productivity, and consumers' behavior. Little is known, however, about how these networks form and change. Estimating causal effects and mechanisms that drive social network formation and dynamics is challenging because of the complexity of engineering social relations in a controlled environment, endogeneity between network structure and individual characteristics, and the lack of time-resolved data about individuals' behavior. We leverage data from a sample of 1.5 million college students on Facebook, who wrote more than 630 million messages and 590 million posts over 4 years, to design a long-term natural experiment of friendship formation and social dynamics in the aftermath of a natural disaster. The analysis shows that affected individuals are more likely to strengthen interactions, while maintaining the same number of friends as unaffected individuals. Our findings suggest that the formation of social relationships may serve as a coping mechanism to deal with high-stress situations and build resilience in communities.

  9. Information dynamics of brain-heart physiological networks during sleep

    Science.gov (United States)

    Faes, L.; Nollo, G.; Jurysta, F.; Marinazzo, D.

    2014-10-01

    This study proposes an integrated approach, framed in the emerging fields of network physiology and information dynamics, for the quantitative analysis of brain-heart interaction networks during sleep. With this approach, the time series of cardiac vagal autonomic activity and brain wave activities measured respectively as the normalized high frequency component of heart rate variability and the EEG power in the δ, θ, α, σ, and β bands, are considered as realizations of the stochastic processes describing the dynamics of the heart system and of different brain sub-systems. Entropy-based measures are exploited to quantify the predictive information carried by each (sub)system, and to dissect this information into a part actively stored in the system and a part transferred to it from the other connected systems. The application of this approach to polysomnographic recordings of ten healthy subjects led us to identify a structured network of sleep brain-brain and brain-heart interactions, with the node described by the β EEG power acting as a hub which conveys the largest amount of information flowing between the heart and brain nodes. This network was found to be sustained mostly by the transitions across different sleep stages, as the information transfer was weaker during specific stages than during the whole night, and vanished progressively when moving from light sleep to deep sleep and to REM sleep.

  10. Dynamical networks of influence in small group discussions.

    Science.gov (United States)

    Moussaïd, Mehdi; Noriega Campero, Alejandro; Almaatouq, Abdullah

    2018-01-01

    In many domains of life, business and management, numerous problems are addressed by small groups of individuals engaged in face-to-face discussions. While research in social psychology has a long history of studying the determinants of small group performances, the internal dynamics that govern a group discussion are not yet well understood. Here, we rely on computational methods based on network analyses and opinion dynamics to describe how individuals influence each other during a group discussion. We consider the situation in which a small group of three individuals engages in a discussion to solve an estimation task. We propose a model describing how group members gradually influence each other and revise their judgments over the course of the discussion. The main component of the model is an influence network-a weighted, directed graph that determines the extent to which individuals influence each other during the discussion. In simulations, we first study the optimal structure of the influence network that yields the best group performances. Then, we implement a social learning process by which individuals adapt to the past performance of their peers, thereby affecting the structure of the influence network in the long run. We explore the mechanisms underlying the emergence of efficient or maladaptive networks and show that the influence network can converge towards the optimal one, but only when individuals exhibit a social discounting bias by downgrading the relative performances of their peers. Finally, we find a late-speaker effect, whereby individuals who speak later in the discussion are perceived more positively in the long run and are thus more influential. The numerous predictions of the model can serve as a basis for future experiments, and this work opens research on small group discussion to computational social sciences.

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

  12. Meeting

    Indian Academy of Sciences (India)

    July 1989 No.19 Newsletter of the Indian Academy of Sciences. 55th Annual. Meeting ... in the world, keeping alive atthe same time his research interests, abreast .... theory made a comeback with many new ideas and with the success of the ...

  13. Multiplex visibility graphs to investigate recurrent neural network dynamics

    Science.gov (United States)

    Bianchi, Filippo Maria; Livi, Lorenzo; Alippi, Cesare; Jenssen, Robert

    2017-03-01

    A recurrent neural network (RNN) is a universal approximator of dynamical systems, whose performance often depends on sensitive hyperparameters. Tuning them properly may be difficult and, typically, based on a trial-and-error approach. In this work, we adopt a graph-based framework to interpret and characterize internal dynamics of a class of RNNs called echo state networks (ESNs). We design principled unsupervised methods to derive hyperparameters configurations yielding maximal ESN performance, expressed in terms of prediction error and memory capacity. In particular, we propose to model time series generated by each neuron activations with a horizontal visibility graph, whose topological properties have been shown to be related to the underlying system dynamics. Successively, horizontal visibility graphs associated with all neurons become layers of a larger structure called a multiplex. We show that topological properties of such a multiplex reflect important features of ESN dynamics that can be used to guide the tuning of its hyperparamers. Results obtained on several benchmarks and a real-world dataset of telephone call data records show the effectiveness of the proposed methods.

  14. Dynamical processes and epidemic threshold on nonlinear coupled multiplex networks

    Science.gov (United States)

    Gao, Chao; Tang, Shaoting; Li, Weihua; Yang, Yaqian; Zheng, Zhiming

    2018-04-01

    Recently, the interplay between epidemic spreading and awareness diffusion has aroused the interest of many researchers, who have studied models mainly based on linear coupling relations between information and epidemic layers. However, in real-world networks the relation between two layers may be closely correlated with the property of individual nodes and exhibits nonlinear dynamical features. Here we propose a nonlinear coupled information-epidemic model (I-E model) and present a comprehensive analysis in a more generalized scenario where the upload rate differs from node to node, deletion rate varies between susceptible and infected states, and infection rate changes between unaware and aware states. In particular, we develop a theoretical framework of the intra- and inter-layer dynamical processes with a microscopic Markov chain approach (MMCA), and derive an analytic epidemic threshold. Our results suggest that the change of upload and deletion rate has little effect on the diffusion dynamics in the epidemic layer.

  15. Introduction to modern dynamics chaos, networks, space and time

    CERN Document Server

    Nolte, David D

    2015-01-01

    The best parts of physics are the last topics that our students ever see. These are the exciting new frontiers of nonlinear and complex systems that are at the forefront of university research and are the basis of many high-tech businesses. Topics such as traffic on the World Wide Web, the spread of epidemics through globally-mobile populations, or the synchronization of global economies are governed by universal principles just as profound as Newton's laws. Nonetheless, the conventional university physics curriculum reserves most of these topics for advanced graduate study. Two justifications are given for this situation: first, that the mathematical tools needed to understand these topics are beyond the skill set of undergraduate students, and second, that these are speciality topics with no common theme and little overlap. Introduction to Modern Dynamics dispels these myths. The structure of this book combines the three main topics of modern dynamics - chaos theory, dynamics on complex networks, and gener...

  16. Discrete opinion dynamics on networks based on social influence

    International Nuclear Information System (INIS)

    Hu Haibo; Wang Xiaofan

    2009-01-01

    A model of opinion dynamics based on social influence on networks was studied. The opinion of each agent can have integer values i = 1, 2, ..., I and opinion exchanges are restricted to connected agents. It was found that for any I ≥ 2 and self-confidence parameter 0 ≤ u i ) of the population that hold a given opinion i is a martingale, and the fraction q i of opinion i will gradually converge to (q i ). The tendency can slow down with the increase of degree assortativity of networks. When u is degree dependent, (q i ) does not possess the martingale property, however q i still converges to it. In both cases for a finite network the states of all agents will finally reach consensus. Further if there exist stubborn persons in the population whose opinions do not change over time, it was found that for degree-independent constant u, both q i and (q i ) will converge to fixed proportions which only depend on the distribution of initial obstinate persons, and naturally the final equilibrium state will be the coexistence of diverse opinions held by the stubborn people. The analytical results were verified by numerical simulations on Barabasi-Albert (BA) networks. The model highlights the influence of high-degree agents on the final consensus or coexistence state and captures some realistic features of the diffusion of opinions in social networks

  17. Network Firewall Dynamics and the Subsaturation Stabilization of HIV.

    Science.gov (United States)

    Khan, Bilal; Dombrowski, Kirk; Saad, Mohamed; McLean, Katherine; Friedman, Samuel

    2013-01-01

    In 2001, Friedman et al. conjectured the existence of a "firewall effect" in which individuals who are infected with HIV, but remain in a state of low infectiousness, serve to prevent the virus from spreading. To evaluate this historical conjecture, we develop a new graph-theoretic measure that quantifies the extent to which Friedman's firewall hypothesis(FH)holds in a risk network. We compute this new measure across simulated trajectories of a stochastic discrete dynamical system that models a social network of 25,000 individuals engaging in risk acts over a period of 15 years. The model's parameters are based on analyses of data collected in prior studies of the real-world risk networks of people who inject drugs (PWID) in New York City. Analysis of system trajectories reveals the structural mechanisms by which individuals with mature HIV infections tend to partition the network into homogeneous clusters (with respect to infection status) and how uninfected clusters remain relatively stable (with respect to infection status) over long stretches of time. We confirm the spontaneous emergence of network firewalls in the system and reveal their structural role in the nonspreading of HIV.

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

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

  20. Energy Efficient Caching in Backhaul-Aware Cellular Networks with Dynamic Content Popularity

    Directory of Open Access Journals (Sweden)

    Jiequ Ji

    2018-01-01

    Full Text Available Caching popular contents at base stations (BSs has been regarded as an effective approach to alleviate the backhaul load and to improve the quality of service. To meet the explosive data traffic demand and to save energy consumption, energy efficiency (EE has become an extremely important performance index for the 5th generation (5G cellular networks. In general, there are two ways for improving the EE for caching, that is, improving the cache-hit rate and optimizing the cache size. In this work, we investigate the energy efficient caching problem in backhaul-aware cellular networks jointly considering these two approaches. Note that most existing works are based on the assumption that the content catalog and popularity are static. However, in practice, content popularity is dynamic. To timely estimate the dynamic content popularity, we propose a method based on shot noise model (SNM. Then we propose a distributed caching policy to improve the cache-hit rate in such a dynamic environment. Furthermore, we analyze the tradeoff between energy efficiency and cache capacity for which an optimization is formulated. We prove its convexity and derive a closed-form optimal cache capacity for maximizing the EE. Simulation results validate the proposed scheme and show that EE can be improved with appropriate choice of cache capacity.

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

    Science.gov (United States)

    Gao, Zilin; Wang, Yinhe; Zhang, Lili

    2018-02-01

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

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

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

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

  5. Report on the second ALMERA network coordination meeting and the ALMERA soil sampling intercomparison exercise IAEA/SIE/01

    International Nuclear Information System (INIS)

    2006-05-01

    The overall aim of the meeting was to evaluate the current status of the ALMERA network laboratories and to help to improve their technical competence through harmonization of sampling, monitoring and measurement protocols and staff training. The meeting was also addressed to defining the structure of the ALMERA network and future proficiency tests and intercomparison trials to be organized by the IAEA to help the laboratories to maintain and improve the quality of their analytical measurements. 45 participants from 29 different institutions attended the meeting

  6. Dynamical Structure of a Traditional Amazonian Social Network

    Directory of Open Access Journals (Sweden)

    Paul L. Hooper

    2013-11-01

    Full Text Available Reciprocity is a vital feature of social networks, but relatively little is known about its temporal structure or the mechanisms underlying its persistence in real world behavior. In pursuit of these two questions, we study the stationary and dynamical signals of reciprocity in a network of manioc beer (Spanish: chicha; Tsimane’: shocdye’ drinking events in a Tsimane’ village in lowland Bolivia. At the stationary level, our analysis reveals that social exchange within the community is heterogeneously patterned according to kinship and spatial proximity. A positive relationship between the frequencies at which two families host each other, controlling for kinship and proximity, provides evidence for stationary reciprocity. Our analysis of the dynamical structure of this network presents a novel method for the study of conditional, or non-stationary, reciprocity effects. We find evidence that short-timescale reciprocity (within three days is present among non- and distant-kin pairs; conversely, we find that levels of cooperation among close kin can be accounted for on the stationary hypothesis alone.

  7. Modelling animal group fission using social network dynamics.

    Directory of Open Access Journals (Sweden)

    Cédric Sueur

    Full Text Available Group life involves both advantages and disadvantages, meaning that individuals have to compromise between their nutritional needs and their social links. When a compromise is impossible, the group splits in order to reduce conflict of interests and favour positive social interactions between its members. In this study we built a dynamic model of social networks to represent a succession of temporary fissions involving a change in social relations that could potentially lead to irreversible group fission (i.e. no more group fusion. This is the first study that assesses how a social network changes according to group fission-fusion dynamics. We built a model that was based on different parameters: the group size, the influence of nutritional needs compared to social needs, and the changes in the social network after a temporary fission. The results obtained from this theoretical data indicate how the percentage of social relation transfer, the number of individuals and the relative importance of nutritional requirements and social links influence the average number of days before irreversible fission occurs. The greater the nutritional needs and the higher the transfer of social relations during temporary fission, the fewer days will be observed before an irreversible fission. It is crucial to bridge the gap between the individual and the population level if we hope to understand how simple, local interactions may drive ecological systems.

  8. A Reinforcement Learning Framework for Spiking Networks with Dynamic Synapses

    Directory of Open Access Journals (Sweden)

    Karim El-Laithy

    2011-01-01

    Full Text Available An integration of both the Hebbian-based and reinforcement learning (RL rules is presented for dynamic synapses. The proposed framework permits the Hebbian rule to update the hidden synaptic model parameters regulating the synaptic response rather than the synaptic weights. This is performed using both the value and the sign of the temporal difference in the reward signal after each trial. Applying this framework, a spiking network with spike-timing-dependent synapses is tested to learn the exclusive-OR computation on a temporally coded basis. Reward values are calculated with the distance between the output spike train of the network and a reference target one. Results show that the network is able to capture the required dynamics and that the proposed framework can reveal indeed an integrated version of Hebbian and RL. The proposed framework is tractable and less computationally expensive. The framework is applicable to a wide class of synaptic models and is not restricted to the used neural representation. This generality, along with the reported results, supports adopting the introduced approach to benefit from the biologically plausible synaptic models in a wide range of intuitive signal processing.

  9. Dynamics of Research Team Formation in Complex Networks

    Science.gov (United States)

    Sun, Caihong; Wan, Yuzi; Chen, Yu

    Most organizations encourage the formation of teams to accomplish complicated tasks, and vice verse, effective teams could bring lots benefits and profits for organizations. Network structure plays an important role in forming teams. In this paper, we specifically study the dynamics of team formation in large research communities in which knowledge of individuals plays an important role on team performance and individual utility. An agent-based model is proposed, in which heterogeneous agents from research communities are described and empirically tested. Each agent has a knowledge endowment and a preference for both income and leisure. Agents provide a variable input (‘effort’) and their knowledge endowments to production. They could learn from others in their team and those who are not in their team but have private connections in community to adjust their own knowledge endowment. They are allowed to join other teams or work alone when it is welfare maximizing to do so. Various simulation experiments are conducted to examine the impacts of network topology, knowledge diffusion among community network, and team output sharing mechanisms on the dynamics of team formation.

  10. 77 FR 3544 - Meeting and Webinar on the Active Traffic and Demand Management and Intelligent Network Flow...

    Science.gov (United States)

    2012-01-24

    ... Intelligent Network Flow Optimization Operational Concepts; Notice of Public Meeting AGENCY: Research and... Demand Management (ADTM) and Intelligent Network Flow Optimization (INFLO) operational concepts. The ADTM... infrastructure. The vision for ATDM research is to allow transportation agencies to increase traffic flow...

  11. Meeting

    Indian Academy of Sciences (India)

    welcomed the delegates to the historic city of. Ahmedabad with its many ... in the development of ISRO satellites". The second .... case of weakly coupled layers was considered. A possible ... rather than discrete neural networks, in solving this problem at ... Pune. for his studies in bio-organic chemistry .... this region. At lower ...

  12. Proceedings of the first topical meeting on Asian network for accelerator-driven systems and nuclear transmutation technology

    International Nuclear Information System (INIS)

    Sasa, Toshinobu

    2016-03-01

    The first topical meeting on Asian Network for Accelerator-driven System (ADS) and Nuclear Transmutation Technology (NTT) was held on 26-27 October 2015 at the J-PARC Center, Japan Atomic Energy Agency, Japan. The topical meeting was an optional one in-between the regular meeting, which is held in every two years. Instead of the regular meetings, which cover all research fields for ADS and NTT, such as accelerator, spallation target, subcritical reactor, fuel, and material, the topical meeting is focused on a specific topic to make technical discussions more deeply. In this meeting, the technology for lead-bismuth eutectic alloy was selected, as it was one of the hot issues in the world, and the topic was deeply discussed by specialists in Asian countries. This report summarizes all presentation materials discussed in the meeting. (author)

  13. Studies on the population dynamics of a rumor-spreading model in online social networks

    Science.gov (United States)

    Dong, Suyalatu; Fan, Feng-Hua; Huang, Yong-Chang

    2018-02-01

    This paper sets up a rumor spreading model in online social networks based on the European fox rabies SIR model. The model considers the impact of changing number of online social network users, combines the transmission dynamics to set up a population dynamics of rumor spreading model in online social networks. Simulation is carried out on online social network, and results show that the new rumor spreading model is in accordance with the real propagation characteristics in online social networks.

  14. Energy Efficient Routing Algorithms in Dynamic Optical Core Networks with Dual Energy Sources

    DEFF Research Database (Denmark)

    Wang, Jiayuan; Fagertun, Anna Manolova; Ruepp, Sarah Renée

    2013-01-01

    This paper proposes new energy efficient routing algorithms in optical core networks, with the application of solar energy sources and bundled links. A comprehensive solar energy model is described in the proposed network scenarios. Network performance in energy savings, connection blocking...... probability, resource utilization and bundled link usage are evaluated with dynamic network simulations. Results show that algorithms proposed aiming for reducing the dynamic part of the energy consumption of the network may raise the fixed part of the energy consumption meanwhile....

  15. Dynamic Control of Synchronous Activity in Networks of Spiking Neurons.

    Directory of Open Access Journals (Sweden)

    Axel Hutt

    Full Text Available Oscillatory brain activity is believed to play a central role in neural coding. Accumulating evidence shows that features of these oscillations are highly dynamic: power, frequency and phase fluctuate alongside changes in behavior and task demands. The role and mechanism supporting this variability is however poorly understood. We here analyze a network of recurrently connected spiking neurons with time delay displaying stable synchronous dynamics. Using mean-field and stability analyses, we investigate the influence of dynamic inputs on the frequency of firing rate oscillations. We show that afferent noise, mimicking inputs to the neurons, causes smoothing of the system's response function, displacing equilibria and altering the stability of oscillatory states. Our analysis further shows that these noise-induced changes cause a shift of the peak frequency of synchronous oscillations that scales with input intensity, leading the network towards critical states. We lastly discuss the extension of these principles to periodic stimulation, in which externally applied driving signals can trigger analogous phenomena. Our results reveal one possible mechanism involved in shaping oscillatory activity in the brain and associated control principles.

  16. Dynamic Control of Synchronous Activity in Networks of Spiking Neurons.

    Science.gov (United States)

    Hutt, Axel; Mierau, Andreas; Lefebvre, Jérémie

    Oscillatory brain activity is believed to play a central role in neural coding. Accumulating evidence shows that features of these oscillations are highly dynamic: power, frequency and phase fluctuate alongside changes in behavior and task demands. The role and mechanism supporting this variability is however poorly understood. We here analyze a network of recurrently connected spiking neurons with time delay displaying stable synchronous dynamics. Using mean-field and stability analyses, we investigate the influence of dynamic inputs on the frequency of firing rate oscillations. We show that afferent noise, mimicking inputs to the neurons, causes smoothing of the system's response function, displacing equilibria and altering the stability of oscillatory states. Our analysis further shows that these noise-induced changes cause a shift of the peak frequency of synchronous oscillations that scales with input intensity, leading the network towards critical states. We lastly discuss the extension of these principles to periodic stimulation, in which externally applied driving signals can trigger analogous phenomena. Our results reveal one possible mechanism involved in shaping oscillatory activity in the brain and associated control principles.

  17. Forecasting financial asset processes: stochastic dynamics via learning neural networks.

    Science.gov (United States)

    Giebel, S; Rainer, M

    2010-01-01

    Models for financial asset dynamics usually take into account their inherent unpredictable nature by including a suitable stochastic component into their process. Unknown (forward) values of financial assets (at a given time in the future) are usually estimated as expectations of the stochastic asset under a suitable risk-neutral measure. This estimation requires the stochastic model to be calibrated to some history of sufficient length in the past. Apart from inherent limitations, due to the stochastic nature of the process, the predictive power is also limited by the simplifying assumptions of the common calibration methods, such as maximum likelihood estimation and regression methods, performed often without weights on the historic time series, or with static weights only. Here we propose a novel method of "intelligent" calibration, using learning neural networks in order to dynamically adapt the parameters of the stochastic model. Hence we have a stochastic process with time dependent parameters, the dynamics of the parameters being themselves learned continuously by a neural network. The back propagation in training the previous weights is limited to a certain memory length (in the examples we consider 10 previous business days), which is similar to the maximal time lag of autoregressive processes. We demonstrate the learning efficiency of the new algorithm by tracking the next-day forecasts for the EURTRY and EUR-HUF exchange rates each.

  18. Predicting physical time series using dynamic ridge polynomial neural networks.

    Directory of Open Access Journals (Sweden)

    Dhiya Al-Jumeily

    Full Text Available Forecasting naturally occurring phenomena is a common problem in many domains of science, and this has been addressed and investigated by many scientists. The importance of time series prediction stems from the fact that it has wide range of applications, including control systems, engineering processes, environmental systems and economics. From the knowledge of some aspects of the previous behaviour of the system, the aim of the prediction process is to determine or predict its future behaviour. In this paper, we consider a novel application of a higher order polynomial neural network architecture called Dynamic Ridge Polynomial Neural Network that combines the properties of higher order and recurrent neural networks for the prediction of physical time series. In this study, four types of signals have been used, which are; The Lorenz attractor, mean value of the AE index, sunspot number, and heat wave temperature. The simulation results showed good improvements in terms of the signal to noise ratio in comparison to a number of higher order and feedforward neural networks in comparison to the benchmarked techniques.

  19. Resolution enhancement in neural networks with dynamical synapses

    Directory of Open Access Journals (Sweden)

    C. C. Alan Fung

    2013-06-01

    Full Text Available Conventionally, information is represented by spike rates in the neural system. Here, we consider the ability of temporally modulated activities in neuronal networks to carry information extra to spike rates. These temporal modulations, commonly known as population spikes, are due to the presence of synaptic depression in a neuronal network model. We discuss its relevance to an experiment on transparent motions in macaque monkeys by Treue et al. in 2000. They found that if the moving directions of objects are too close, the firing rate profile will be very similar to that with one direction. As the difference in the moving directions of objects is large enough, the neuronal system would respond in such a way that the network enhances the resolution in the moving directions of the objects. In this paper, we propose that this behavior can be reproduced by neural networks with dynamical synapses when there are multiple external inputs. We will demonstrate how resolution enhancement can be achieved, and discuss the conditions under which temporally modulated activities are able to enhance information processing performances in general.

  20. Dynamic interactions of the cortical networks during thought suppression.

    Science.gov (United States)

    Aso, Toshihiko; Nishimura, Kazuo; Kiyonaka, Takashi; Aoki, Takaaki; Inagawa, Michiyo; Matsuhashi, Masao; Tobinaga, Yoshikazu; Fukuyama, Hidenao

    2016-08-01

    Thought suppression has spurred extensive research in clinical and preclinical fields, particularly with regard to the paradoxical aspects of this behavior. However, the involvement of the brain's inhibitory system in the dynamics underlying the continuous effort to suppress thoughts has yet to be clarified. This study aims to provide a unified perspective for the volitional suppression of internal events incorporating the current understanding of the brain's inhibitory system. Twenty healthy volunteers underwent functional magnetic resonance imaging while they performed thought suppression blocks alternating with visual imagery blocks. The whole dataset was decomposed by group-independent component analysis into 30 components. After discarding noise components, the 20 valid components were subjected to further analysis of their temporal properties including task-relatedness and between-component residual correlation. Combining a long task period and a data-driven approach, we observed a right-side-dominant, lateral frontoparietal network to be strongly suppression related. This network exhibited increased fluctuation during suppression, which is compatible with the well-known difficulty of suppression maintenance. Between-network correlation provided further insight into the coordinated engagement of the executive control and dorsal attention networks, as well as the reciprocal activation of imagery-related components, thus revealing neural substrates associated with the rivalry between intrusive thoughts and the suppression process.

  1. Network dynamics of social influence in the wisdom of crowds.

    Science.gov (United States)

    Becker, Joshua; Brackbill, Devon; Centola, Damon

    2017-06-27

    A longstanding problem in the social, biological, and computational sciences is to determine how groups of distributed individuals can form intelligent collective judgments. Since Galton's discovery of the "wisdom of crowds" [Galton F (1907) Nature 75:450-451], theories of collective intelligence have suggested that the accuracy of group judgments requires individuals to be either independent, with uncorrelated beliefs, or diverse, with negatively correlated beliefs [Page S (2008) The Difference: How the Power of Diversity Creates Better Groups, Firms, Schools, and Societies ]. Previous experimental studies have supported this view by arguing that social influence undermines the wisdom of crowds. These results showed that individuals' estimates became more similar when subjects observed each other's beliefs, thereby reducing diversity without a corresponding increase in group accuracy [Lorenz J, Rauhut H, Schweitzer F, Helbing D (2011) Proc Natl Acad Sci USA 108:9020-9025]. By contrast, we show general network conditions under which social influence improves the accuracy of group estimates, even as individual beliefs become more similar. We present theoretical predictions and experimental results showing that, in decentralized communication networks, group estimates become reliably more accurate as a result of information exchange. We further show that the dynamics of group accuracy change with network structure. In centralized networks, where the influence of central individuals dominates the collective estimation process, group estimates become more likely to increase in error.

  2. Phase resetting reveals network dynamics underlying a bacterial cell cycle.

    Science.gov (United States)

    Lin, Yihan; Li, Ying; Crosson, Sean; Dinner, Aaron R; Scherer, Norbert F

    2012-01-01

    Genomic and proteomic methods yield networks of biological regulatory interactions but do not provide direct insight into how those interactions are organized into functional modules, or how information flows from one module to another. In this work we introduce an approach that provides this complementary information and apply it to the bacterium Caulobacter crescentus, a paradigm for cell-cycle control. Operationally, we use an inducible promoter to express the essential transcriptional regulatory gene ctrA in a periodic, pulsed fashion. This chemical perturbation causes the population of cells to divide synchronously, and we use the resulting advance or delay of the division times of single cells to construct a phase resetting curve. We find that delay is strongly favored over advance. This finding is surprising since it does not follow from the temporal expression profile of CtrA and, in turn, simulations of existing network models. We propose a phenomenological model that suggests that the cell-cycle network comprises two distinct functional modules that oscillate autonomously and couple in a highly asymmetric fashion. These features collectively provide a new mechanism for tight temporal control of the cell cycle in C. crescentus. We discuss how the procedure can serve as the basis for a general approach for probing network dynamics, which we term chemical perturbation spectroscopy (CPS).

  3. Dynamic optical resource allocation for mobile core networks with software defined elastic optical networking.

    Science.gov (United States)

    Zhao, Yongli; Chen, Zhendong; Zhang, Jie; Wang, Xinbo

    2016-07-25

    Driven by the forthcoming of 5G mobile communications, the all-IP architecture of mobile core networks, i.e. evolved packet core (EPC) proposed by 3GPP, has been greatly challenged by the users' demands for higher data rate and more reliable end-to-end connection, as well as operators' demands for low operational cost. These challenges can be potentially met by software defined optical networking (SDON), which enables dynamic resource allocation according to the users' requirement. In this article, a novel network architecture for mobile core network is proposed based on SDON. A software defined network (SDN) controller is designed to realize the coordinated control over different entities in EPC networks. We analyze the requirement of EPC-lightpath (EPCL) in data plane and propose an optical switch load balancing (OSLB) algorithm for resource allocation in optical layer. The procedure of establishment and adjustment of EPCLs is demonstrated on a SDON-based EPC testbed with extended OpenFlow protocol. We also evaluate the OSLB algorithm through simulation in terms of bandwidth blocking ratio, traffic load distribution, and resource utilization ratio compared with link-based load balancing (LLB) and MinHops algorithms.

  4. Connectivity effects in the dynamic model of neural networks

    International Nuclear Information System (INIS)

    Choi, J; Choi, M Y; Yoon, B-G

    2009-01-01

    We study, via extensive Monte Carlo calculations, the effects of connectivity in the dynamic model of neural networks, to observe that the Mattis-state order parameter increases with the number of coupled neurons. Such effects appear more pronounced when the average number of connections is increased by introducing shortcuts in the network. In particular, the power spectra of the order parameter at stationarity are found to exhibit power-law behavior, depending on how the average number of connections is increased. The cluster size distribution of the 'memory-unmatched' sites also follows a power law and possesses strong correlations with the power spectra. It is further observed that the distribution of waiting times for neuron firing fits roughly to a power law, again depending on how neuronal connections are increased

  5. Slow, bursty dynamics as a consequence of quenched network topologies

    Science.gov (United States)

    Ådor, Géza

    2014-04-01

    Bursty dynamics of agents is shown to appear at criticality or in extended Griffiths phases, even in case of Poisson processes. I provide numerical evidence for a power-law type of intercommunication time distributions by simulating the contact process and the susceptible-infected-susceptible model. This observation suggests that in the case of nonstationary bursty systems, the observed non-Poissonian behavior can emerge as a consequence of an underlying hidden Poissonian network process, which is either critical or exhibits strong rare-region effects. On the contrary, in time-varying networks, rare-region effects do not cause deviation from the mean-field behavior, and heterogeneity-induced burstyness is absent.

  6. Slow, bursty dynamics as a consequence of quenched network topologies.

    Science.gov (United States)

    Ódor, Géza

    2014-04-01

    Bursty dynamics of agents is shown to appear at criticality or in extended Griffiths phases, even in case of Poisson processes. I provide numerical evidence for a power-law type of intercommunication time distributions by simulating the contact process and the susceptible-infected-susceptible model. This observation suggests that in the case of nonstationary bursty systems, the observed non-Poissonian behavior can emerge as a consequence of an underlying hidden Poissonian network process, which is either critical or exhibits strong rare-region effects. On the contrary, in time-varying networks, rare-region effects do not cause deviation from the mean-field behavior, and heterogeneity-induced burstyness is absent.

  7. Semi-empirical neural network models of controlled dynamical systems

    Directory of Open Access Journals (Sweden)

    Mihail V. Egorchev

    2017-12-01

    Full Text Available A simulation approach is discussed for maneuverable aircraft motion as nonlinear controlled dynamical system under multiple and diverse uncertainties including knowledge imperfection concerning simulated plant and its environment exposure. The suggested approach is based on a merging of theoretical knowledge for the plant with training tools of artificial neural network field. The efficiency of this approach is demonstrated using the example of motion modeling and the identification of the aerodynamic characteristics of a maneuverable aircraft. A semi-empirical recurrent neural network based model learning algorithm is proposed for multi-step ahead prediction problem. This algorithm sequentially states and solves numerical optimization subproblems of increasing complexity, using each solution as initial guess for subsequent subproblem. We also consider a procedure for representative training set acquisition that utilizes multisine control signals.

  8. Dynamic reliability networks with self-healing units

    International Nuclear Information System (INIS)

    Jenab, K.; Seyed Hosseini, S.M.; Dhillon, B.S.

    2008-01-01

    This paper presents an analytical approach for dynamic reliability networks used for the failure limit strategy in maintenance optimization. The proposed approach utilizes the moment generating function (MGF) and the flow-graph concept to depict the functional and reliability diagrams of the system comprised of series, parallel or mix configuration of self-healing units. The self-healing unit is featured by the embedded failure detection and recovery mechanisms presented by self-loop in flow-graph networks. The newly developed analytical approach provides the probability of the system failure and time-to-failure data i.e., mean and standard deviation time-to-failure used for maintenance optimization

  9. Complexity and network dynamics in physiological adaptation: an integrated view.

    Science.gov (United States)

    Baffy, György; Loscalzo, Joseph

    2014-05-28

    Living organisms constantly interact with their surroundings and sustain internal stability against perturbations. This dynamic process follows three fundamental strategies (restore, explore, and abandon) articulated in historical concepts of physiological adaptation such as homeostasis, allostasis, and the general adaptation syndrome. These strategies correspond to elementary forms of behavior (ordered, chaotic, and static) in complex adaptive systems and invite a network-based analysis of the operational characteristics, allowing us to propose an integrated framework of physiological adaptation from a complex network perspective. Applicability of this concept is illustrated by analyzing molecular and cellular mechanisms of adaptation in response to the pervasive challenge of obesity, a chronic condition resulting from sustained nutrient excess that prompts chaotic exploration for system stability associated with tradeoffs and a risk of adverse outcomes such as diabetes, cardiovascular disease, and cancer. Deconstruction of this complexity holds the promise of gaining novel insights into physiological adaptation in health and disease. Published by Elsevier Inc.

  10. A system of recurrent neural networks for modularising, parameterising and dynamic analysis of cell signalling networks.

    Science.gov (United States)

    Samarasinghe, S; Ling, H

    In this paper, we show how to extend our previously proposed novel continuous time Recurrent Neural Networks (RNN) approach that retains the advantage of continuous dynamics offered by Ordinary Differential Equations (ODE) while enabling parameter estimation through adaptation, to larger signalling networks using a modular approach. Specifically, the signalling network is decomposed into several sub-models based on important temporal events in the network. Each sub-model is represented by the proposed RNN and trained using data generated from the corresponding ODE model. Trained sub-models are assembled into a whole system RNN which is then subjected to systems dynamics and sensitivity analyses. The concept is illustrated by application to G1/S transition in cell cycle using Iwamoto et al. (2008) ODE model. We decomposed the G1/S network into 3 sub-models: (i) E2F transcription factor release; (ii) E2F and CycE positive feedback loop for elevating cyclin levels; and (iii) E2F and CycA negative feedback to degrade E2F. The trained sub-models accurately represented system dynamics and parameters were in good agreement with the ODE model. The whole system RNN however revealed couple of parameters contributing to compounding errors due to feedback and required refinement to sub-model 2. These related to the reversible reaction between CycE/CDK2 and p27, its inhibitor. The revised whole system RNN model very accurately matched dynamics of the ODE system. Local sensitivity analysis of the whole system model further revealed the most dominant influence of the above two parameters in perturbing G1/S transition, giving support to a recent hypothesis that the release of inhibitor p27 from Cyc/CDK complex triggers cell cycle stage transition. To make the model useful in a practical setting, we modified each RNN sub-model with a time relay switch to facilitate larger interval input data (≈20min) (original model used data for 30s or less) and retrained them that produced

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

  12. Integrating atomistic molecular dynamics simulations, experiments and network analysis to study protein dynamics: strength in unity

    Directory of Open Access Journals (Sweden)

    Elena ePapaleo

    2015-05-01

    Full Text Available In the last years, we have been observing remarkable improvements in the field of protein dynamics. Indeed, we can now study protein dynamics in atomistic details over several timescales with a rich portfolio of experimental and computational techniques. On one side, this provides us with the possibility to validate simulation methods and physical models against a broad range of experimental observables. On the other side, it also allows a complementary and comprehensive view on protein structure and dynamics. What is needed now is a better understanding of the link between the dynamic properties that we observe and the functional properties of these important cellular machines. To make progresses in this direction, we need to improve the physical models used to describe proteins and solvent in molecular dynamics, as well as to strengthen the integration of experiments and simulations to overcome their own limitations. Moreover, now that we have the means to study protein dynamics in great details, we need new tools to understand the information embedded in the protein ensembles and in their dynamic signature. With this aim in mind, we should enrich the current tools for analysis of biomolecular simulations with attention to the effects that can be propagated over long distances and are often associated to important biological functions. In this context, approaches inspired by network analysis can make an important contribution to the analysis of molecular dynamics simulations.

  13. Report on the IAEA technical meeting on co-ordination of the network of nuclear reaction data centres

    International Nuclear Information System (INIS)

    Schwerer, O.

    2003-08-01

    Results of the IAEA Technical Meeting on the Co-ordination of the Network of Nuclear Reaction Data Centres held at the IAEA Headquarters, Vienna, Austria, 17 to 19 June 2003, are summarised in this report. The meeting was attended by 14 participants from 9 cooperating data centres of five member states and two International Organizations. A meeting summary, the conclusions and actions, progress and status reports of the participating data centres, and working papers considered at the meeting, are given in the relevant sections. (author)

  14. Theorising big IT programmes in healthcare: strong structuration theory meets actor-network theory.

    Science.gov (United States)

    Greenhalgh, Trisha; Stones, Rob

    2010-05-01

    The UK National Health Service is grappling with various large and controversial IT programmes. We sought to develop a sharper theoretical perspective on the question "What happens - at macro-, meso- and micro-level - when government tries to modernise a health service with the help of big IT?" Using examples from data fragments at the micro-level of clinical work, we considered how structuration theory and actor-network theory (ANT) might be combined to inform empirical investigation. Giddens (1984) argued that social structures and human agency are recursively linked and co-evolve. ANT studies the relationships that link people and technologies in dynamic networks. It considers how discourses become inscribed in data structures and decision models of software, making certain network relations irreversible. Stones' (2005) strong structuration theory (SST) is a refinement of Giddens' work, systematically concerned with empirical research. It views human agents as linked in dynamic networks of position-practices. A quadripartite approcach considers [a] external social structures (conditions for action); [b] internal social structures (agents' capabilities and what they 'know' about the social world); [c] active agency and actions and [d] outcomes as they feed back on the position-practice network. In contrast to early structuration theory and ANT, SST insists on disciplined conceptual methodology and linking this with empirical evidence. In this paper, we adapt SST for the study of technology programmes, integrating elements from material interactionism and ANT. We argue, for example, that the position-practice network can be a socio-technical one in which technologies in conjunction with humans can be studied as 'actants'. Human agents, with their complex socio-cultural frames, are required to instantiate technology in social practices. Structurally relevant properties inscribed and embedded in technological artefacts constrain and enable human agency. The fortunes

  15. The dynamics of social networks among female Asian elephants

    Directory of Open Access Journals (Sweden)

    de Silva Shermin

    2011-07-01

    Full Text Available Abstract Background Patterns in the association of individuals can shed light on the underlying conditions and processes that shape societies. Here we characterize patterns of association in a population of wild Asian Elephants at Uda Walawe National Park in Sri Lanka. We observed 286 individually-identified adult female elephants over 20 months and examined their social dynamics at three levels of organization: pairs of individuals (dyads, small sets of direct companions (ego-networks, and the population level (complete networks. Results Corroborating previous studies of this and other Asian elephant populations, we find that the sizes of elephant groups observed in the field on any particular day are typically small and that rates of association are low. In contrast to earlier studies, our longitudinal observations reveal that individuals form larger social units that can be remarkably stable across years while associations among such units change across seasons. Association rates tend to peak in dry seasons as opposed to wet seasons, with some cyclicity at the level of dyads. In addition, we find that individuals vary substantially in their fidelity to companions. At the ego-network level, we find that despite these fluctuations, individuals associate with a pool of long-term companions. At the population level, social networks do not exhibit any clear seasonal structure or hierarchical stratification. Conclusions This detailed longitudinal study reveals different social dynamics at different levels of organization. Taken together, these results demonstrate that low association rates, seemingly small group sizes, and fission-fusion grouping behavior mask hidden stability in the extensive and fluid social affiliations in this population of Asian elephants.

  16. Dynamics of Symmetric Conserved Mass Aggregation Model on Complex Networks

    Institute of Scientific and Technical Information of China (English)

    HUA Da-Yin

    2009-01-01

    We investigate the dynamical behaviour of the aggregation process in the symmetric conserved mass aggregation model under three different topological structures. The dispersion σ(t, L) = (∑i(mi - ρ0)2/L)1/2 is defined to describe the dynamical behaviour where ρ0 is the density of particle and mi is the particle number on a site. It is found numerically that for a regular lattice and a scale-free network, σ(t, L) follows a power-law scaling σ(t, L) ~ tδ1 and σ(t, L) ~ tδ4 from a random initial condition to the stationary states, respectively. However, for a small-world network, there are two power-law scaling regimes, σ(t, L) ~ tδ2 when t<T and a(t, L) ~ tδ3 when tT. Moreover, it is found numerically that δ2 is near to δ1 for small rewiring probability q, and δ3 hardly changes with varying q and it is almost the same as δ4. We speculate that the aggregation of the connection degree accelerates the mass aggregation in the initial relaxation stage and the existence of the long-distance interactions in the complex networks results in the acceleration of the mass aggregation when tT for the small-world networks. We also show that the relaxation time T follows a power-law scaling τ Lz and σ(t, L) in the stationary state follows a power-law σs(L) ~ Lσ for three different structures.

  17. Quantum Processes and Dynamic Networks in Physical and Biological Systems.

    Science.gov (United States)

    Dudziak, Martin Joseph

    Quantum theory since its earliest formulations in the Copenhagen Interpretation has been difficult to integrate with general relativity and with classical Newtonian physics. There has been traditionally a regard for quantum phenomena as being a limiting case for a natural order that is fundamentally classical except for microscopic extrema where quantum mechanics must be applied, more as a mathematical reconciliation rather than as a description and explanation. Macroscopic sciences including the study of biological neural networks, cellular energy transports and the broad field of non-linear and chaotic systems point to a quantum dimension extending across all scales of measurement and encompassing all of Nature as a fundamentally quantum universe. Theory and observation lead to a number of hypotheses all of which point to dynamic, evolving networks of fundamental or elementary processes as the underlying logico-physical structure (manifestation) in Nature and a strongly quantized dimension to macroscalar processes such as are found in biological, ecological and social systems. The fundamental thesis advanced and presented herein is that quantum phenomena may be the direct consequence of a universe built not from objects and substance but from interacting, interdependent processes collectively operating as sets and networks, giving rise to systems that on microcosmic or macroscopic scales function wholistically and organically, exhibiting non-locality and other non -classical phenomena. The argument is made that such effects as non-locality are not aberrations or departures from the norm but ordinary consequences of the process-network dynamics of Nature. Quantum processes are taken to be the fundamental action-events within Nature; rather than being the exception quantum theory is the rule. The argument is also presented that the study of quantum physics could benefit from the study of selective higher-scale complex systems, such as neural processes in the brain

  18. Display techniques for dynamic network data in transportation GIS

    Energy Technology Data Exchange (ETDEWEB)

    Ganter, J.H.; Cashwell, J.W.

    1994-05-01

    Interest in the characteristics of urban street networks is increasing at the same time new monitoring technologies are delivering detailed traffic data. These emerging streams of data may lead to the dilemma that airborne remote sensing has faced: how to select and access the data, and what meaning is hidden in them? computer-assisted visualization techniques are needed to portray these dynamic data. Of equal importance are controls that let the user filter, symbolize, and replay the data to reveal patterns and trends over varying time spans. We discuss a prototype software system that addresses these requirements.

  19. Topological dynamics of vortex-line networks in hexagonal manganites

    Science.gov (United States)

    Xue, Fei; Wang, Nan; Wang, Xueyun; Ji, Yanzhou; Cheong, Sang-Wook; Chen, Long-Qing

    2018-01-01

    The two-dimensional X Y model is the first well-studied system with topological point defects. On the other hand, although topological line defects are common in three-dimensional systems, the evolution mechanism of line defects is not fully understood. The six domains in hexagonal manganites converge to vortex lines in three dimensions. Using phase-field simulations, we predicted that during the domain coarsening process, the vortex-line network undergoes three types of basic topological changes, i.e., vortex-line loop shrinking, coalescence, and splitting. It is shown that the vortex-antivortex annihilation controls the scaling dynamics.

  20. A dynamic ventilation model for gravity sewer networks.

    Science.gov (United States)

    Wang, Y C; Nobi, N; Nguyen, T; Vorreiter, L

    2012-01-01

    To implement any effective odour and corrosion control technology in the sewer network, it is imperative that the airflow through gravity sewer airspaces be quantified. This paper presents a full dynamic airflow model for gravity sewer systems. The model, which is developed using the finite element method, is a compressible air transport model. The model has been applied to the North Head Sewerage Ocean Outfall System (NSOOS) and calibrated using the air pressure and airflow data collected during October 2008. Although the calibration is focused on forced ventilation, the model can be applied to natural ventilation as well.

  1. Dynamical networks: Finding, measuring, and tracking neural population activity using network science

    Directory of Open Access Journals (Sweden)

    Mark D. Humphries

    2017-12-01

    Full Text Available Systems neuroscience is in a headlong rush to record from as many neurons at the same time as possible. As the brain computes and codes using neuron populations, it is hoped these data will uncover the fundamentals of neural computation. But with hundreds, thousands, or more simultaneously recorded neurons come the inescapable problems of visualizing, describing, and quantifying their interactions. Here I argue that network science provides a set of scalable, analytical tools that already solve these problems. By treating neurons as nodes and their interactions as links, a single network can visualize and describe an arbitrarily large recording. I show that with this description we can quantify the effects of manipulating a neural circuit, track changes in population dynamics over time, and quantitatively define theoretical concepts of neural populations such as cell assemblies. Using network science as a core part of analyzing population recordings will thus provide both qualitative and quantitative advances to our understanding of neural computation.

  2. Analysis and control of complex dynamical systems robust bifurcation, dynamic attractors, and network complexity

    CERN Document Server

    Imura, Jun-ichi; Ueta, Tetsushi

    2015-01-01

    This book is the first to report on theoretical breakthroughs on control of complex dynamical systems developed by collaborative researchers in the two fields of dynamical systems theory and control theory. As well, its basic point of view is of three kinds of complexity: bifurcation phenomena subject to model uncertainty, complex behavior including periodic/quasi-periodic orbits as well as chaotic orbits, and network complexity emerging from dynamical interactions between subsystems. Analysis and Control of Complex Dynamical Systems offers a valuable resource for mathematicians, physicists, and biophysicists, as well as for researchers in nonlinear science and control engineering, allowing them to develop a better fundamental understanding of the analysis and control synthesis of such complex systems.

  3. Integrating atomistic molecular dynamics simulations, experiments, and network analysis to study protein dynamics

    DEFF Research Database (Denmark)

    Papaleo, Elena

    2015-01-01

    that we observe and the functional properties of these important cellular machines. To make progresses in this direction, we need to improve the physical models used to describe proteins and solvent in molecular dynamics, as well as to strengthen the integration of experiments and simulations to overcome...... with the possibility to validate simulation methods and physical models against a broad range of experimental observables. On the other side, it also allows a complementary and comprehensive view on protein structure and dynamics. What is needed now is a better understanding of the link between the dynamic properties...... simulations with attention to the effects that can be propagated over long distances and are often associated to important biological functions. In this context, approaches inspired by network analysis can make an important contribution to the analysis of molecular dynamics simulations....

  4. Hash function construction using weighted complex dynamical networks

    International Nuclear Information System (INIS)

    Song Yu-Rong; Jiang Guo-Ping

    2013-01-01

    A novel scheme to construct a hash function based on a weighted complex dynamical network (WCDN) generated from an original message is proposed in this paper. First, the original message is divided into blocks. Then, each block is divided into components, and the nodes and weighted edges are well defined from these components and their relations. Namely, the WCDN closely related to the original message is established. Furthermore, the node dynamics of the WCDN are chosen as a chaotic map. After chaotic iterations, quantization and exclusive-or operations, the fixed-length hash value is obtained. This scheme has the property that any tiny change in message can be diffused rapidly through the WCDN, leading to very different hash values. Analysis and simulation show that the scheme possesses good statistical properties, excellent confusion and diffusion, strong collision resistance and high efficiency. (general)

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

  6. Cell dynamic morphology classification using deep convolutional neural networks.

    Science.gov (United States)

    Li, Heng; Pang, Fengqian; Shi, Yonggang; Liu, Zhiwen

    2018-05-15

    Cell morphology is often used as a proxy measurement of cell status to understand cell physiology. Hence, interpretation of cell dynamic morphology is a meaningful task in biomedical research. Inspired by the recent success of deep learning, we here explore the application of convolutional neural networks (CNNs) to cell dynamic morphology classification. An innovative strategy for the implementation of CNNs is introduced in this study. Mouse lymphocytes were collected to observe the dynamic morphology, and two datasets were thus set up to investigate the performances of CNNs. Considering the installation of deep learning, the classification problem was simplified from video data to image data, and was then solved by CNNs in a self-taught manner with the generated image data. CNNs were separately performed in three installation scenarios and compared with existing methods. Experimental results demonstrated the potential of CNNs in cell dynamic morphology classification, and validated the effectiveness of the proposed strategy. CNNs were successfully applied to the classification problem, and outperformed the existing methods in the classification accuracy. For the installation of CNNs, transfer learning was proved to be a promising scheme. © 2018 International Society for Advancement of Cytometry. © 2018 International Society for Advancement of Cytometry.

  7. Potential of dynamic spectrum allocation in LTE macro networks

    Science.gov (United States)

    Hoffmann, H.; Ramachandra, P.; Kovács, I. Z.; Jorguseski, L.; Gunnarsson, F.; Kürner, T.

    2015-11-01

    In recent years Mobile Network Operators (MNOs) worldwide are extensively deploying LTE networks in different spectrum bands and utilising different bandwidth configurations. Initially, the deployment is coverage oriented with macro cells using the lower LTE spectrum bands. As the offered traffic (i.e. the requested traffic from the users) increases the LTE deployment evolves with macro cells expanded with additional capacity boosting LTE carriers in higher frequency bands complemented with micro or small cells in traffic hotspot areas. For MNOs it is crucial to use the LTE spectrum assets, as well as the installed network infrastructure, in the most cost efficient way. The dynamic spectrum allocation (DSA) aims at (de)activating the available LTE frequency carriers according to the temporal and spatial traffic variations in order to increase the overall LTE system performance in terms of total network capacity by reducing the interference. This paper evaluates the DSA potential of achieving the envisaged performance improvement and identifying in which system and traffic conditions the DSA should be deployed. A self-optimised network (SON) DSA algorithm is also proposed and evaluated. The evaluations have been carried out in a hexagonal and a realistic site-specific urban macro layout assuming a central traffic hotspot area surrounded with an area of lower traffic with a total size of approximately 8 × 8 km2. The results show that up to 47 % and up to 40 % possible DSA gains are achievable with regards to the carried system load (i.e. used resources) for homogenous traffic distribution with hexagonal layout and for realistic site-specific urban macro layout, respectively. The SON DSA algorithm evaluation in a realistic site-specific urban macro cell deployment scenario including realistic non-uniform spatial traffic distribution shows insignificant cell throughput (i.e. served traffic) performance gains. Nevertheless, in the SON DSA investigations, a gain of up

  8. Discrete opinion dynamics on networks based on social influence

    Energy Technology Data Exchange (ETDEWEB)

    Hu Haibo; Wang Xiaofan [Complex Networks and Control Lab, Shanghai Jiao Tong University, Shanghai 200240 (China)

    2009-06-05

    A model of opinion dynamics based on social influence on networks was studied. The opinion of each agent can have integer values i = 1, 2, ..., I and opinion exchanges are restricted to connected agents. It was found that for any I {>=} 2 and self-confidence parameter 0 {<=} u < 1, when u is a degree-independent constant, the weighted proportion (q{sub i}) of the population that hold a given opinion i is a martingale, and the fraction q{sub i} of opinion i will gradually converge to (q{sub i}). The tendency can slow down with the increase of degree assortativity of networks. When u is degree dependent, (q{sub i}) does not possess the martingale property, however q{sub i} still converges to it. In both cases for a finite network the states of all agents will finally reach consensus. Further if there exist stubborn persons in the population whose opinions do not change over time, it was found that for degree-independent constant u, both q{sub i} and (q{sub i}) will converge to fixed proportions which only depend on the distribution of initial obstinate persons, and naturally the final equilibrium state will be the coexistence of diverse opinions held by the stubborn people. The analytical results were verified by numerical simulations on Barabasi-Albert (BA) networks. The model highlights the influence of high-degree agents on the final consensus or coexistence state and captures some realistic features of the diffusion of opinions in social networks.

  9. From cognitive networks to seizures: Stimulus evoked dynamics in a coupled cortical network

    Science.gov (United States)

    Lee, Jaejin; Ermentrout, Bard; Bodner, Mark

    2013-12-01

    Epilepsy is one of the most common neuropathologies worldwide. Seizures arising in epilepsy or in seizure disorders are characterized generally by uncontrolled spread of excitation and electrical activity to a limited region or even over the entire cortex. While it is generally accepted that abnormal excessive firing and synchronization of neuron populations lead to seizures, little is known about the precise mechanisms underlying human epileptic seizures, the mechanisms of transitions from normal to paroxysmal activity, or about how seizures spread. Further complication arises in that seizures do not occur with a single type of dynamics but as many different phenotypes and genotypes with a range of patterns, synchronous oscillations, and time courses. The concept of preventing, terminating, or modulating seizures and/or paroxysmal activity through stimulation of brain has also received considerable attention. The ability of such stimulation to prevent or modulate such pathological activity may depend on identifiable parameters. In this work, firing rate networks with inhibitory and excitatory populations were modeled. Network parameters were chosen to model normal working memory behaviors. Two different models of cognitive activity were developed. The first model consists of a single network corresponding to a local area of the brain. The second incorporates two networks connected through sparser recurrent excitatory connectivity with transmission delays ranging from approximately 3 ms within local populations to 15 ms between populations residing in different cortical areas. The effect of excitatory stimulation to activate working memory behavior through selective persistent activation of populations is examined in the models, and the conditions and transition mechanisms through which that selective activation breaks down producing spreading paroxysmal activity and seizure states are characterized. Specifically, we determine critical parameters and architectural

  10. Dynamic quality of service model for improving performance of multimedia real-time transmission in industrial networks.

    Science.gov (United States)

    Gopalakrishnan, Ravichandran C; Karunakaran, Manivannan

    2014-01-01

    Nowadays, quality of service (QoS) is very popular in various research areas like distributed systems, multimedia real-time applications and networking. The requirements of these systems are to satisfy reliability, uptime, security constraints and throughput as well as application specific requirements. The real-time multimedia applications are commonly distributed over the network and meet various time constraints across networks without creating any intervention over control flows. In particular, video compressors make variable bit-rate streams that mismatch the constant-bit-rate channels typically provided by classical real-time protocols, severely reducing the efficiency of network utilization. Thus, it is necessary to enlarge the communication bandwidth to transfer the compressed multimedia streams using Flexible Time Triggered- Enhanced Switched Ethernet (FTT-ESE) protocol. FTT-ESE provides automation to calculate the compression level and change the bandwidth of the stream. This paper focuses on low-latency multimedia transmission over Ethernet with dynamic quality-of-service (QoS) management. This proposed framework deals with a dynamic QoS for multimedia transmission over Ethernet with FTT-ESE protocol. This paper also presents distinct QoS metrics based both on the image quality and network features. Some experiments with recorded and live video streams show the advantages of the proposed framework. To validate the solution we have designed and implemented a simulator based on the Matlab/Simulink, which is a tool to evaluate different network architecture using Simulink blocks.

  11. A Uniform Energy Consumption Algorithm for Wireless Sensor and Actuator Networks Based on Dynamic Polling Point Selection

    Science.gov (United States)

    Li, Shuo; Peng, Jun; Liu, Weirong; Zhu, Zhengfa; Lin, Kuo-Chi

    2014-01-01

    Recent research has indicated that using the mobility of the actuator in wireless sensor and actuator networks (WSANs) to achieve mobile data collection can greatly increase the sensor network lifetime. However, mobile data collection may result in unacceptable collection delays in the network if the path of the actuator is too long. Because real-time network applications require meeting data collection delay constraints, planning the path of the actuator is a very important issue to balance the prolongation of the network lifetime and the reduction of the data collection delay. In this paper, a multi-hop routing mobile data collection algorithm is proposed based on dynamic polling point selection with delay constraints to address this issue. The algorithm can actively update the selection of the actuator's polling points according to the sensor nodes' residual energies and their locations while also considering the collection delay constraint. It also dynamically constructs the multi-hop routing trees rooted by these polling points to balance the sensor node energy consumption and the extension of the network lifetime. The effectiveness of the algorithm is validated by simulation. PMID:24451455

  12. Unstable dynamics, nonequilibrium phases, and criticality in networked excitable media

    International Nuclear Information System (INIS)

    Franciscis, S. de; Torres, J. J.; Marro, J.

    2010-01-01

    Excitable systems are of great theoretical and practical interest in mathematics, physics, chemistry, and biology. Here, we numerically study models of excitable media, namely, networks whose nodes may occasionally be dormant and the connection weights are allowed to vary with the system activity on a short-time scale, which is a convenient and realistic representation. The resulting global activity is quite sensitive to stimuli and eventually becomes unstable also in the absence of any stimuli. Outstanding consequences of such unstable dynamics are the spontaneous occurrence of various nonequilibrium phases--including associative-memory phases and one in which the global activity wanders irregularly, e.g., chaotically among all or part of the dynamic attractors--and 1/f noise as the system is driven into the phase region corresponding to the most irregular behavior. A net result is resilience which results in an efficient search in the model attractor space that can explain the origin of some observed behavior in neural, genetic, and ill-condensed matter systems. By extensive computer simulation we also address a previously conjectured relation between observed power-law distributions and the possible occurrence of a ''critical state'' during functionality of, e.g., cortical networks, and describe the precise nature of such criticality in the model which may serve to guide future experiments.

  13. Duplicate retention in signalling proteins and constraints from network dynamics.

    Science.gov (United States)

    Soyer, O S; Creevey, C J

    2010-11-01

    Duplications are a major driving force behind evolution. Most duplicates are believed to fix through genetic drift, but it is not clear whether this process affects all duplications equally or whether there are certain gene families that are expected to show neutral expansions under certain circumstances. Here, we analyse the neutrality of duplications in different functional classes of signalling proteins based on their effects on response dynamics. We find that duplications involving intermediary proteins in a signalling network are neutral more often than those involving receptors. Although the fraction of neutral duplications in all functional classes increase with decreasing population size and selective pressure on dynamics, this effect is most pronounced for receptors, indicating a possible expansion of receptors in species with small population size. In line with such an expectation, we found a statistically significant increase in the number of receptors as a fraction of genome size in eukaryotes compared with prokaryotes. Although not confirmative, these results indicate that neutral processes can be a significant factor in shaping signalling networks and affect proteins from different functional classes differently. © 2010 The Authors. Journal Compilation © 2010 European Society For Evolutionary Biology.

  14. Pluripotency gene network dynamics: System views from parametric analysis.

    Science.gov (United States)

    Akberdin, Ilya R; Omelyanchuk, Nadezda A; Fadeev, Stanislav I; Leskova, Natalya E; Oschepkova, Evgeniya A; Kazantsev, Fedor V; Matushkin, Yury G; Afonnikov, Dmitry A; Kolchanov, Nikolay A

    2018-01-01

    Multiple experimental data demonstrated that the core gene network orchestrating self-renewal and differentiation of mouse embryonic stem cells involves activity of Oct4, Sox2 and Nanog genes by means of a number of positive feedback loops among them. However, recent studies indicated that the architecture of the core gene network should also incorporate negative Nanog autoregulation and might not include positive feedbacks from Nanog to Oct4 and Sox2. Thorough parametric analysis of the mathematical model based on this revisited core regulatory circuit identified that there are substantial changes in model dynamics occurred depending on the strength of Oct4 and Sox2 activation and molecular complexity of Nanog autorepression. The analysis showed the existence of four dynamical domains with different numbers of stable and unstable steady states. We hypothesize that these domains can constitute the checkpoints in a developmental progression from naïve to primed pluripotency and vice versa. During this transition, parametric conditions exist, which generate an oscillatory behavior of the system explaining heterogeneity in expression of pluripotent and differentiation factors in serum ESC cultures. Eventually, simulations showed that addition of positive feedbacks from Nanog to Oct4 and Sox2 leads mainly to increase of the parametric space for the naïve ESC state, in which pluripotency factors are strongly expressed while differentiation ones are repressed.

  15. Towards a proof of the Kahn principle for linear dynamic networks

    NARCIS (Netherlands)

    A. de Bruin (Arie); S-H. Nienhuys-Cheng (Shan-Hwei)

    1994-01-01

    textabstractWe consider dynamic Kahn-like data flow networks, i.e. networks consisting of deterministic processes each of which is able to expand into a subnetwork. The Kahn principle states that such networks are deterministic, i.e. that for each network we have that each execution provided with

  16. Opinion formation models in static and dynamic social networks

    Science.gov (United States)

    Singh, Pramesh

    We study models of opinion formation on static as well as dynamic networks where interaction among individuals is governed by widely accepted social theories. In particular, three models of competing opinions based on distinct interaction mechanisms are studied. A common feature in all of these models is the existence of a tipping point in terms of a model parameter beyond which a rapid consensus is reached. In the first model that we study on a static network, a node adopts a particular state (opinion) if a threshold fraction of its neighbors are already in that state. We introduce a few initiator nodes which are in state '1' in a population where every node is in state '0'. Thus, opinion '1' spreads through the population until no further influence is possible. Size of the spread is greatly affected by how these initiator nodes are selected. We find that there exists a critical fraction of initiators pc that is needed to trigger global cascades for a given threshold phi. We also study heuristic strategies for selecting a set of initiator nodes in order to maximize the cascade size. The structural properties of networks also play an important role in the spreading process. We study how the dynamics is affected by changing the clustering in a network. It turns out that local clustering is helpful in spreading. Next, we studied a model where the network is dynamic and interactions are homophilic. We find that homophily-driven rewiring impedes the reaching of consensus and in the absence of committed nodes (nodes that are not influenceable on their opinion), consensus time Tc diverges exponentially with network size N . As we introduce a fraction of committed nodes, beyond a critical value, the scaling of Tc becomes logarithmic in N. We also find that slight change in the interaction rule can produce strikingly different scaling behaviors of T c . However, introducing committed agents in the system drastically improves the scaling of the consensus time regardless of

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

  18. Dynamic pricing of network goods with boundedly rational consumers.

    Science.gov (United States)

    Radner, Roy; Radunskaya, Ami; Sundararajan, Arun

    2014-01-07

    We present a model of dynamic monopoly pricing for a good that displays network effects. In contrast with the standard notion of a rational-expectations equilibrium, we model consumers as boundedly rational and unable either to pay immediate attention to each price change or to make accurate forecasts of the adoption of the network good. Our analysis shows that the seller's optimal price trajectory has the following structure: The price is low when the user base is below a target level, is high when the user base is above the target, and is set to keep the user base stationary once the target level has been attained. We show that this pricing policy is robust to a number of extensions, which include the product's user base evolving over time and consumers basing their choices on a mixture of a myopic and a "stubborn" expectation of adoption. Our results differ significantly from those that would be predicted by a model based on rational-expectations equilibrium and are more consistent with the pricing of network goods observed in practice.

  19. Systemic risk in dynamical networks with stochastic failure criterion

    Science.gov (United States)

    Podobnik, B.; Horvatic, D.; Bertella, M. A.; Feng, L.; Huang, X.; Li, B.

    2014-06-01

    Complex non-linear interactions between banks and assets we model by two time-dependent Erdős-Renyi network models where each node, representing a bank, can invest either to a single asset (model I) or multiple assets (model II). We use a dynamical network approach to evaluate the collective financial failure —systemic risk— quantified by the fraction of active nodes. The systemic risk can be calculated over any future time period, divided into sub-periods, where within each sub-period banks may contiguously fail due to links to either i) assets or ii) other banks, controlled by two parameters, probability of internal failure p and threshold Th (“solvency” parameter). The systemic risk decreases with the average network degree faster when all assets are equally distributed across banks than if assets are randomly distributed. The more inactive banks each bank can sustain (smaller Th), the smaller the systemic risk —for some Th values in I we report a discontinuity in systemic risk. When contiguous spreading becomes stochastic ii) controlled by probability p2 —a condition for the bank to be solvent (active) is stochastic— the systemic risk decreases with decreasing p2. We analyse the asset allocation for the U.S. banks.

  20. Infraslow Electroencephalographic and Dynamic Resting State Network Activity.

    Science.gov (United States)

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

    2017-06-01

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