Approximating Attractors of Boolean Networks by Iterative CTL Model Checking.
Klarner, Hannes; Siebert, Heike
2015-01-01
This paper introduces the notion of approximating asynchronous attractors of Boolean networks by minimal trap spaces. We define three criteria for determining the quality of an approximation: "faithfulness" which requires that the oscillating variables of all attractors in a trap space correspond to their dimensions, "univocality" which requires that there is a unique attractor in each trap space, and "completeness" which requires that there are no attractors outside of a given set of trap spaces. Each is a reachability property for which we give equivalent model checking queries. Whereas faithfulness and univocality can be decided by model checking the corresponding subnetworks, the naive query for completeness must be evaluated on the full state space. Our main result is an alternative approach which is based on the iterative refinement of an initially poor approximation. The algorithm detects so-called autonomous sets in the interaction graph, variables that contain all their regulators, and considers their intersection and extension in order to perform model checking on the smallest possible state spaces. A benchmark, in which we apply the algorithm to 18 published Boolean networks, is given. In each case, the minimal trap spaces are faithful, univocal, and complete, which suggests that they are in general good approximations for the asymptotics of Boolean networks.
Li, X Y; Yang, G W; Zheng, D S; Guo, W S; Hung, W N N
2015-04-28
Genetic regulatory networks are the key to understanding biochemical systems. One condition of the genetic regulatory network under different living environments can be modeled as a synchronous Boolean network. The attractors of these Boolean networks will help biologists to identify determinant and stable factors. Existing methods identify attractors based on a random initial state or the entire state simultaneously. They cannot identify the fixed length attractors directly. The complexity of including time increases exponentially with respect to the attractor number and length of attractors. This study used the bounded model checking to quickly locate fixed length attractors. Based on the SAT solver, we propose a new algorithm for efficiently computing the fixed length attractors, which is more suitable for large Boolean networks and numerous attractors' networks. After comparison using the tool BooleNet, empirical experiments involving biochemical systems demonstrated the feasibility and efficiency of our approach.
Attractors: architects of network organization?
Mpitsos, G J
2000-05-01
An attractor is defined here informally as a state of activity toward which a system settles. The settling or relaxation process dissipates the effects produced by external perturbations. In neural systems the relaxation process occurs temporally in the responses of each neuron and spatially across the network such that the activity settles into a subset of the available connections. Within limits, the set of neurons toward which the coordinated neural firing settles can be different from one time to another, and a given set of neurons can generate different types of attractor activity, depending on how the input environment activates the network. Findings such as these indicate that though information resides in the details of neuroanatomic structure, the expression of this information is in the dynamics of attractors. As such, attractors are sources of information that can be used not only in adaptive behavior, but also to effect the neural architecture that generates the attractor. The discussion here focuses on the latter possibility. A conjecture is offered to show that the relaxation dynamic of an attractor may 'guide' activity-dependent learning processes in such a way that synaptic strengths, firing thresholds, the physical connections between neurons, and the size of the network are automatically set in an optimal, interrelated fashion. This inter-relatedness among network parameters would not be expected from more classical, 'switchboard' approaches to neural integration. The ideas are discussed within the context of 'pulse-propagated networks' or equivalently as 'spike-activated networks' in which the specific order in time intervals between action potentials carries important information for cooperative activity to emerge among neurons in a network. Though the proposed ideas are forward-looking, being based on preliminary work in biological and artificial networks, they are testable in biological neural networks reconstructed from identified neurons in
Attractor for a Reaction-Diffusion System Modeling Cancer Network
Directory of Open Access Journals (Sweden)
Xueyong Chen
2014-01-01
Full Text Available A reaction-diffusion cancer network regulated by microRNA is considered in this paper. We study the asymptotic behavior of solution and show the existence of global uniformly bounded solution to the system in a bounded domain Ω⊂Rn. Some estimates and asymptotic compactness of the solutions are proved. As a result, we establish the existence of the global attractor in L2(Ω×L2(Ω and prove that the solution converges to stable steady states. These results can help to understand the dynamical character of cancer network and propose a new insight to study the mechanism of cancer. In the end, the numerical simulation shows that the analytical results agree with numerical simulation.
De la Fuente, Ildefonso M; Cortes, Jesus M; Pelta, David A; Veguillas, Juan
2013-01-01
The experimental observations and numerical studies with dissipative metabolic networks have shown that cellular enzymatic activity self-organizes spontaneously leading to the emergence of a Systemic Metabolic Structure in the cell, characterized by a set of different enzymatic reactions always locked into active states (metabolic core) while the rest of the catalytic processes are only intermittently active. This global metabolic structure was verified for Escherichia coli, Helicobacter pylori and Saccharomyces cerevisiae, and it seems to be a common key feature to all cellular organisms. In concordance with these observations, the cell can be considered a complex metabolic network which mainly integrates a large ensemble of self-organized multienzymatic complexes interconnected by substrate fluxes and regulatory signals, where multiple autonomous oscillatory and quasi-stationary catalytic patterns simultaneously emerge. The network adjusts the internal metabolic activities to the external change by means of flux plasticity and structural plasticity. In order to research the systemic mechanisms involved in the regulation of the cellular enzymatic activity we have studied different catalytic activities of a dissipative metabolic network under different external stimuli. The emergent biochemical data have been analysed using statistical mechanic tools, studying some macroscopic properties such as the global information and the energy of the system. We have also obtained an equivalent Hopfield network using a Boltzmann machine. Our main result shows that the dissipative metabolic network can behave as an attractor metabolic network. We have found that the systemic enzymatic activities are governed by attractors with capacity to store functional metabolic patterns which can be correctly recovered from specific input stimuli. The network attractors regulate the catalytic patterns, modify the efficiency in the connection between the multienzymatic complexes, and stably
Directory of Open Access Journals (Sweden)
Ildefonso M De la Fuente
Full Text Available BACKGROUND: The experimental observations and numerical studies with dissipative metabolic networks have shown that cellular enzymatic activity self-organizes spontaneously leading to the emergence of a Systemic Metabolic Structure in the cell, characterized by a set of different enzymatic reactions always locked into active states (metabolic core while the rest of the catalytic processes are only intermittently active. This global metabolic structure was verified for Escherichia coli, Helicobacter pylori and Saccharomyces cerevisiae, and it seems to be a common key feature to all cellular organisms. In concordance with these observations, the cell can be considered a complex metabolic network which mainly integrates a large ensemble of self-organized multienzymatic complexes interconnected by substrate fluxes and regulatory signals, where multiple autonomous oscillatory and quasi-stationary catalytic patterns simultaneously emerge. The network adjusts the internal metabolic activities to the external change by means of flux plasticity and structural plasticity. METHODOLOGY/PRINCIPAL FINDINGS: In order to research the systemic mechanisms involved in the regulation of the cellular enzymatic activity we have studied different catalytic activities of a dissipative metabolic network under different external stimuli. The emergent biochemical data have been analysed using statistical mechanic tools, studying some macroscopic properties such as the global information and the energy of the system. We have also obtained an equivalent Hopfield network using a Boltzmann machine. Our main result shows that the dissipative metabolic network can behave as an attractor metabolic network. CONCLUSIONS/SIGNIFICANCE: We have found that the systemic enzymatic activities are governed by attractors with capacity to store functional metabolic patterns which can be correctly recovered from specific input stimuli. The network attractors regulate the catalytic patterns
Decision-making neural circuits mediating social behaviors : An attractor network model.
Hurtado-López, Julián; Ramirez-Moreno, David F; Sejnowski, Terrence J
2017-06-29
We propose a mathematical model of a continuous attractor network that controls social behaviors. The model is examined with bifurcation analysis and computer simulations. The results show that the model exhibits stable steady states and thresholds for steady state transitions corresponding to some experimentally observed behaviors, such as aggression control. The performance of the model and the relation with experimental evidence are discussed.
Path integration and cognitive mapping in a continuous attractor neural network model.
Samsonovich, A; McNaughton, B L
1997-08-01
A minimal synaptic architecture is proposed for how the brain might perform path integration by computing the next internal representation of self-location from the current representation and from the perceived velocity of motion. In the model, a place-cell assembly called a "chart" contains a two-dimensional attractor set called an "attractor map" that can be used to represent coordinates in any arbitrary environment, once associative binding has occurred between chart locations and sensory inputs. In hippocampus, there are different spatial relations among place fields in different environments and behavioral contexts. Thus, the same units may participate in many charts, and it is shown that the number of uncorrelated charts that can be encoded in the same recurrent network is potentially quite large. According to this theory, the firing of a given place cell is primarily a cooperative effect of the activity of its neighbors on the currently active chart. Therefore, it is not particularly useful to think of place cells as encoding any particular external object or event. Because of its recurrent connections, hippocampal field CA3 is proposed as a possible location for this "multichart" architecture; however, other implementations in anatomy would not invalidate the main concepts. The model is implemented numerically both as a network of integrate-and-fire units and as a "macroscopic" (with respect to the space of states) description of the system, based on a continuous approximation defined by a system of stochastic differential equations. It provides an explanation for a number of hitherto perplexing observations on hippocampal place fields, including doubling, vanishing, reshaping in distorted environments, acquiring directionality in a two-goal shuttling task, rapid formation in a novel environment, and slow rotation after disorientation. The model makes several new predictions about the expected properties of hippocampal place cells and other cells of the
A mismatch-based model for memory reconsolidation and extinction in attractor networks.
Directory of Open Access Journals (Sweden)
Remus Osan
Full Text Available The processes of memory reconsolidation and extinction have received increasing attention in recent experimental research, as their potential clinical applications begin to be uncovered. A number of studies suggest that amnestic drugs injected after reexposure to a learning context can disrupt either of the two processes, depending on the behavioral protocol employed. Hypothesizing that reconsolidation represents updating of a memory trace in the hippocampus, while extinction represents formation of a new trace, we have built a neural network model in which either simple retrieval, reconsolidation or extinction of a stored attractor can occur upon contextual reexposure, depending on the similarity between the representations of the original learning and reexposure sessions. This is achieved by assuming that independent mechanisms mediate Hebbian-like synaptic strengthening and mismatch-driven labilization of synaptic changes, with protein synthesis inhibition preferentially affecting the former. Our framework provides a unified mechanistic explanation for experimental data showing (a the effect of reexposure duration on the occurrence of reconsolidation or extinction and (b the requirement of memory updating during reexposure to drive reconsolidation.
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.
Algorithms for Finding Small Attractors in Boolean Networks
Directory of Open Access Journals (Sweden)
Hayashida Morihiro
2007-01-01
Full Text Available A Boolean network is a model used to study the interactions between different genes in genetic regulatory networks. In this paper, we present several algorithms using gene ordering and feedback vertex sets to identify singleton attractors and small attractors in Boolean networks. We analyze the average case time complexities of some of the proposed algorithms. For instance, it is shown that the outdegree-based ordering algorithm for finding singleton attractors works in time for , which is much faster than the naive time algorithm, where is the number of genes and is the maximum indegree. We performed extensive computational experiments on these algorithms, which resulted in good agreement with theoretical results. In contrast, we give a simple and complete proof for showing that finding an attractor with the shortest period is NP-hard.
Google matrix, dynamical attractors, and Ulam networks.
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.
Memory dynamics in attractor networks with saliency weights.
Tang, Huajin; Li, Haizhou; Yan, Rui
2010-07-01
Memory is a fundamental part of computational systems like the human brain. Theoretical models identify memories as attractors of neural network activity patterns based on the theory that attractor (recurrent) neural networks are able to capture some crucial characteristics of memory, such as encoding, storage, retrieval, and long-term and working memory. In such networks, long-term storage of the memory patterns is enabled by synaptic strengths that are adjusted according to some activity-dependent plasticity mechanisms (of which the most widely recognized is the Hebbian rule) such that the attractors of the network dynamics represent the stored memories. Most of previous studies on associative memory are focused on Hopfield-like binary networks, and the learned patterns are often assumed to be uncorrelated in a way that minimal interactions between memories are facilitated. In this letter, we restrict our attention to a more biological plausible attractor network model and study the neuronal representations of correlated patterns. We have examined the role of saliency weights in memory dynamics. Our results demonstrate that the retrieval process of the memorized patterns is characterized by the saliency distribution, which affects the landscape of the attractors. We have established the conditions that the network state converges to unique memory and multiple memories. The analytical result also holds for other cases for variable coding levels and nonbinary levels, indicating a general property emerging from correlated memories. Our results confirmed the advantage of computing with graded-response neurons over binary neurons (i.e., reducing of spurious states). It was also found that the nonuniform saliency distribution can contribute to disappearance of spurious states when they exit.
Strong Attractors in Stochastic Adaptive Networks: Emergence and Characterization
Santos, Augusto Almeida; Krishnan, Ramayya; Moura, José M F
2016-01-01
We propose a family of models to study the evolution of ties in a network of interacting agents by reinforcement and penalization of their connections according to certain local laws of interaction. The family of stochastic dynamical systems, on the edges of a graph, exhibits \\emph{good} convergence properties, in particular, we prove a strong-stability result: a subset of binary matrices or graphs -- characterized by certain compatibility properties -- is a global almost sure attractor of the family of stochastic dynamical systems. To illustrate finer properties of the corresponding strong attractor, we present some simulation results that capture, e.g., the conspicuous phenomenon of emergence and downfall of leaders in social networks.
Reactivation in Working Memory: An Attractor Network Model of Free Recall
Lansner, Anders; Marklund, Petter; Sikström, Sverker; Nilsson, Lars-Göran
2013-01-01
The dynamic nature of human working memory, the general-purpose system for processing continuous input, while keeping no longer externally available information active in the background, is well captured in immediate free recall of supraspan word-lists. Free recall tasks produce several benchmark memory phenomena, like the U-shaped serial position curve, reflecting enhanced memory for early and late list items. To account for empirical data, including primacy and recency as well as contiguity effects, we propose here a neurobiologically based neural network model that unifies short- and long-term forms of memory and challenges both the standard view of working memory as persistent activity and dual-store accounts of free recall. Rapidly expressed and volatile synaptic plasticity, modulated intrinsic excitability, and spike-frequency adaptation are suggested as key cellular mechanisms underlying working memory encoding, reactivation and recall. Recent findings on the synaptic and molecular mechanisms behind early LTP and on spiking activity during delayed-match-to-sample tasks support this view. PMID:24023690
Reactivation in working memory: an attractor network model of free recall.
Lansner, Anders; Marklund, Petter; Sikström, Sverker; Nilsson, Lars-Göran
2013-01-01
The dynamic nature of human working memory, the general-purpose system for processing continuous input, while keeping no longer externally available information active in the background, is well captured in immediate free recall of supraspan word-lists. Free recall tasks produce several benchmark memory phenomena, like the U-shaped serial position curve, reflecting enhanced memory for early and late list items. To account for empirical data, including primacy and recency as well as contiguity effects, we propose here a neurobiologically based neural network model that unifies short- and long-term forms of memory and challenges both the standard view of working memory as persistent activity and dual-store accounts of free recall. Rapidly expressed and volatile synaptic plasticity, modulated intrinsic excitability, and spike-frequency adaptation are suggested as key cellular mechanisms underlying working memory encoding, reactivation and recall. Recent findings on the synaptic and molecular mechanisms behind early LTP and on spiking activity during delayed-match-to-sample tasks support this view.
Robustness and information propagation in attractors of Random Boolean Networks.
Lloyd-Price, Jason; Gupta, Abhishekh; Ribeiro, Andre S
2012-01-01
Attractors represent the long-term behaviors of Random Boolean Networks. We study how the amount of information propagated between the nodes when on an attractor, as quantified by the average pairwise mutual information (I(A)), relates to the robustness of the attractor to perturbations (R(A)). We find that the dynamical regime of the network affects the relationship between I(A) and R(A). In the ordered and chaotic regimes, I(A) is anti-correlated with R(A), implying that attractors that are highly robust to perturbations have necessarily limited information propagation. Between order and chaos (for so-called "critical" networks) these quantities are uncorrelated. Finite size effects cause this behavior to be visible for a range of networks, from having a sensitivity of 1 to the point where I(A) is maximized. In this region, the two quantities are weakly correlated and attractors can be almost arbitrarily robust to perturbations without restricting the propagation of information in the network.
Competition between synaptic depression and facilitation in attractor neural networks.
Torres, J.J.; Cortes, J.M.; Marro, J.; Kappen, H.J.
2007-01-01
We study the effect of competition between short-term synaptic depression and facilitation on the dynamic properties of attractor neural networks, using Monte Carlo simulation and a mean-field analysis. Depending on the balance of depression, facilitation, and the underlying noise, the network
Partially unstable attractors in networks of forced integrate-and-fire oscillators
Zou, Hai-Lin; Deng, Zi-Chen; Hu, Wei-Peng; Aihara, Kazuyuki; Lai, Ying-Cheng
2017-01-01
The asymptotic attractors of a nonlinear dynamical system play a key role in the long-term physically observable behaviors of the system. The study of attractors and the search for distinct types of attractor have been a central task in nonlinear dynamics. In smooth dynamical systems, an attractor is often enclosed completely in its basin of attraction with a finite distance from the basin boundary. Recent works have uncovered that, in neuronal networks, unstable attractors with a remote basi...
Lerner, Itamar; Bentin, Shlomo; Shriki, Oren
2012-01-01
Localist models of spreading activation (SA) and models assuming distributed representations offer very different takes on semantic priming, a widely investigated paradigm in word recognition and semantic memory research. In this study, we implemented SA in an attractor neural network model with distributed representations and created a unified…
A SAT-based algorithm for finding attractors in synchronous Boolean networks.
Dubrova, Elena; Teslenko, Maxim
2011-01-01
This paper addresses the problem of finding attractors in synchronous Boolean networks. The existing Boolean decision diagram-based algorithms have limited capacity due to the excessive memory requirements of decision diagrams. The simulation-based algorithms can be applied to larger networks, however, they are incomplete. We present an algorithm, which uses a SAT-based bounded model checking to find all attractors in a Boolean network. The efficiency of the presented algorithm is evaluated by analyzing seven networks models of real biological processes, as well as 150,000 randomly generated Boolean networks of sizes between 100 and 7,000. The results show that our approach has a potential to handle an order of magnitude larger models than currently possible.
Existence of global attractor for the Trojan Y Chromosome model
Directory of Open Access Journals (Sweden)
Xiaopeng Zhao
2012-04-01
Full Text Available This paper is concerned with the long time behavior of solution for the equation derived by the Trojan Y Chromosome (TYC model with spatial spread. Based on the regularity estimates for the semigroups and the classical existence theorem of global attractors, we prove that this equations possesses a global attractor in $H^k(\\Omega^4$ $(k\\geq 0$ space.
An Attractor-Based Complexity Measurement for Boolean Recurrent Neural Networks
Cabessa, Jérémie; Villa, Alessandro E. P.
2014-01-01
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of -automata, and then translating the most refined classification of -automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits. PMID:24727866
An attractor-based complexity measurement for Boolean recurrent neural networks.
Cabessa, Jérémie; Villa, Alessandro E P
2014-01-01
We provide a novel refined attractor-based complexity measurement for Boolean recurrent neural networks that represents an assessment of their computational power in terms of the significance of their attractor dynamics. This complexity measurement is achieved by first proving a computational equivalence between Boolean recurrent neural networks and some specific class of ω-automata, and then translating the most refined classification of ω-automata to the Boolean neural network context. As a result, a hierarchical classification of Boolean neural networks based on their attractive dynamics is obtained, thus providing a novel refined attractor-based complexity measurement for Boolean recurrent neural networks. These results provide new theoretical insights to the computational and dynamical capabilities of neural networks according to their attractive potentialities. An application of our findings is illustrated by the analysis of the dynamics of a simplified model of the basal ganglia-thalamocortical network simulated by a Boolean recurrent neural network. This example shows the significance of measuring network complexity, and how our results bear new founding elements for the understanding of the complexity of real brain circuits.
Navigating cancer network attractors for tumor-specific therapy
DEFF Research Database (Denmark)
Creixell, Pau; Schoof, Erwin; Erler, Janine Terra
2012-01-01
Cells employ highly dynamic signaling networks to drive biological decision processes. Perturbations to these signaling networks may attract cells to new malignant signaling and phenotypic states, termed cancer network attractors, that result in cancer development. As different cancer cells reach...... these malignant states by accumulating different molecular alterations, uncovering these mechanisms represents a grand challenge in cancer biology. Addressing this challenge will require new systems-based strategies that capture the intrinsic properties of cancer signaling networks and provide deeper...... understanding of the processes by which genetic lesions perturb these networks and lead to disease phenotypes. Network biology will help circumvent fundamental obstacles in cancer treatment, such as drug resistance and metastasis, empowering personalized and tumor-specific cancer therapies....
Learning chaotic attractors by neural networks
Bakker, R; Schouten, JC; Giles, CL; Takens, F; van den Bleek, CM
2000-01-01
An algorithm is introduced that trains a neural network to identify chaotic dynamics from a single measured time series. During training, the algorithm learns to short-term predict the time series. At the same time a criterion, developed by Diks, van Zwet, Takens, and de Goede (1996) is monitored
Hyperbolic Plykin attractor can exist in neuron models
DEFF Research Database (Denmark)
Belykh, V.; Belykh, I.; Mosekilde, Erik
2005-01-01
Strange hyperbolic attractors are hard to find in real physical systems. This paper provides the first example of a realistic system, a canonical three-dimensional (3D) model of bursting neurons, that is likely to have a strange hyperbolic attractor. Using a geometrical approach to the study...... of the neuron model, we derive a flow-defined Poincare map giving ail accurate account of the system's dynamics. In a parameter region where the neuron system undergoes bifurcations causing transitions between tonic spiking and bursting, this two-dimensional map becomes a map of a disk with several periodic...... holes. A particular case is the map of a disk with three holes, matching the Plykin example of a planar hyperbolic attractor. The corresponding attractor of the 3D neuron model appears to be hyperbolic (this property is not verified in the present paper) and arises as a result of a two-loop (secondary...
An efficient algorithm for computing attractors of synchronous and asynchronous Boolean networks.
Zheng, Desheng; Yang, Guowu; Li, Xiaoyu; Wang, Zhicai; Liu, Feng; He, Lei
2013-01-01
Biological networks, such as genetic regulatory networks, often contain positive and negative feedback loops that settle down to dynamically stable patterns. Identifying these patterns, the so-called attractors, can provide important insights for biologists to understand the molecular mechanisms underlying many coordinated cellular processes such as cellular division, differentiation, and homeostasis. Both synchronous and asynchronous Boolean networks have been used to simulate genetic regulatory networks and identify their attractors. The common methods of computing attractors are that start with a randomly selected initial state and finish with exhaustive search of the state space of a network. However, the time complexity of these methods grows exponentially with respect to the number and length of attractors. Here, we build two algorithms to achieve the computation of attractors in synchronous and asynchronous Boolean networks. For the synchronous scenario, combing with iterative methods and reduced order binary decision diagrams (ROBDD), we propose an improved algorithm to compute attractors. For another algorithm, the attractors of synchronous Boolean networks are utilized in asynchronous Boolean translation functions to derive attractors of asynchronous scenario. The proposed algorithms are implemented in a procedure called geneFAtt. Compared to existing tools such as genYsis, geneFAtt is significantly [Formula: see text] faster in computing attractors for empirical experimental systems. The software package is available at https://sites.google.com/site/desheng619/download.
Hedrick, Kathryn R; Zhang, Kechen
2016-08-01
The problem of how the hippocampus encodes both spatial and nonspatial information at the cellular network level remains largely unresolved. Spatial memory is widely modeled through the theoretical framework of attractor networks, but standard computational models can only represent spaces that are much smaller than the natural habitat of an animal. We propose that hippocampal networks are built on a basic unit called a "megamap," or a cognitive attractor map in which place cells are flexibly recombined to represent a large space. Its inherent flexibility gives the megamap a huge representational capacity and enables the hippocampus to simultaneously represent multiple learned memories and naturally carry nonspatial information at no additional cost. On the other hand, the megamap is dynamically stable, because the underlying network of place cells robustly encodes any location in a large environment given a weak or incomplete input signal from the upstream entorhinal cortex. Our results suggest a general computational strategy by which a hippocampal network enjoys the stability of attractor dynamics without sacrificing the flexibility needed to represent a complex, changing world. Copyright © 2016 the American Physiological Society.
Directory of Open Access Journals (Sweden)
Mark Niedringhaus
Full Text Available Collective rhythmic dynamics from neurons is vital for cognitive functions such as memory formation but how neurons self-organize to produce such activity is not well understood. Attractor-based computational models have been successfully implemented as a theoretical framework for memory storage in networks of neurons. Additionally, activity-dependent modification of synaptic transmission is thought to be the physiological basis of learning and memory. The goal of this study is to demonstrate that using a pharmacological treatment that has been shown to increase synaptic strength within in vitro networks of hippocampal neurons follows the dynamical postulates theorized by attractor models. We use a grid of extracellular electrodes to study changes in network activity after this perturbation and show that there is a persistent increase in overall spiking and bursting activity after treatment. This increase in activity appears to recruit more "errant" spikes into bursts. Phase plots indicate a conserved activity pattern suggesting that a synaptic potentiation perturbation to the attractor leaves it unchanged. Lastly, we construct a computational model to demonstrate that these synaptic perturbations can account for the dynamical changes seen within the network.
Non-Equlibrium Driven Dynamics of Continuous Attractors in Place Cell Networks
Zhong, Weishun; Kim, Hyun Jin; Schwab, David; Murugan, Arvind
Attractors have found much use in neuroscience as a means of information processing and decision making. Examples include associative memory with point and continuous attractors, spatial navigation and planning using place cell networks, dynamic pattern recognition among others. The functional use of such attractors requires the action of spatially and temporally varying external driving signals and yet, most theoretical work on attractors has been in the limit of small or no drive. We take steps towards understanding the non-equilibrium driven dynamics of continuous attractors in place cell networks. We establish an `equivalence principle' that relates fluctuations under a time-dependent external force to equilibrium fluctuations in a `co-moving' frame with only static forces, much like in Newtonian physics. Consequently, we analytically derive a network's capacity to encode multiple attractors as a function of the driving signal size and rate of change.
Strange nonchaotic attractors in quasiperiodically driven Izhikevich neuron models
Kim, Jae Seok; Kim, Youngtae
2012-02-01
Evidence for the existence of a strange nonchaotic attractor (SNA) in a two-frequency quasiperiodically driven Izhikevich neuron model is presented. In this study, we found that the SNA is formed by a Heagy-Hammel mechanism because the SNA arises as Poincare sections of a period-doubled torus attractor collides with its unstable parent. Analyses of the fractal dimension, autocorrelation function, power spectral density, power spectral distribution function and interspike interval distribution function also support the existence of the SNA.
A cortical attractor network with Martinotti cells driven by facilitating synapses.
Directory of Open Access Journals (Sweden)
Pradeep Krishnamurthy
Full Text Available The population of pyramidal cells significantly outnumbers the inhibitory interneurons in the neocortex, while at the same time the diversity of interneuron types is much more pronounced. One acknowledged key role of inhibition is to control the rate and patterning of pyramidal cell firing via negative feedback, but most likely the diversity of inhibitory pathways is matched by a corresponding diversity of functional roles. An important distinguishing feature of cortical interneurons is the variability of the short-term plasticity properties of synapses received from pyramidal cells. The Martinotti cell type has recently come under scrutiny due to the distinctly facilitating nature of the synapses they receive from pyramidal cells. This distinguishes these neurons from basket cells and other inhibitory interneurons typically targeted by depressing synapses. A key aspect of the work reported here has been to pinpoint the role of this variability. We first set out to reproduce quantitatively based on in vitro data the di-synaptic inhibitory microcircuit connecting two pyramidal cells via one or a few Martinotti cells. In a second step, we embedded this microcircuit in a previously developed attractor memory network model of neocortical layers 2/3. This model network demonstrated that basket cells with their characteristic depressing synapses are the first to discharge when the network enters an attractor state and that Martinotti cells respond with a delay, thereby shifting the excitation-inhibition balance and acting to terminate the attractor state. A parameter sensitivity analysis suggested that Martinotti cells might, in fact, play a dominant role in setting the attractor dwell time and thus cortical speed of processing, with cellular adaptation and synaptic depression having a less prominent role than previously thought.
Effect of synapse dilution on the memory retrieval in structured attractor neural networks
Brunel, N.
1993-08-01
We investigate a simple model of structured attractor neural network (ANN). In this network a module codes for the category of the stored information, while another group of neurons codes for the remaining information. The probability distribution of stabilities of the patterns and the prototypes of the categories are calculated, for two different synaptic structures. The stability of the prototypes is shown to increase when the fraction of neurons coding for the category goes down. Then the effect of synapse destruction on the retrieval is studied in two opposite situations : first analytically in sparsely connected networks, then numerically in completely connected ones. In both cases the behaviour of the structured network and that of the usual homogeneous networks are compared. When lesions increase, two transitions are shown to appear in the behaviour of the structured network when one of the patterns is presented to the network. After the first transition the network recognizes the category of the pattern but not the individual pattern. After the second transition the network recognizes nothing. These effects are similar to syndromes caused by lesions in the central visual system, namely prosopagnosia and agnosia. In both types of networks (structured or homogeneous) the stability of the prototype is greater than the stability of individual patterns, however the first transition, for completely connected networks, occurs only when the network is structured.
Unstable periodic orbits and attractor of the barotropic ocean model
Directory of Open Access Journals (Sweden)
E. Kazantsev
1998-01-01
Full Text Available A numerical method for detection of unstable periodic orbits on attractors of nonlinear models is proposed. The method requires similar techniques to data assimilation. This fact facilitates its implementation for geophysical models. This method was used to find numerically several low-period orbits for the barotropic ocean model in a square. Some numerical particularities of application of this method are discussed. Knowledge of periodic orbits of the model helps to explain some of these features like bimodality of probability density functions (PDF of principal parameters. These PDFs have been reconstructed as weighted averages of periodic orbits with weights proportional to the period of the orbit and inversely proportional to the sum of positive Lyapunov exponents. The fraction of time spent in the vicinity of each periodic orbit has been compared with its instability characteristics. The relationship between these values shows the 93% correlation. The attractor dimension of the model has also been approximated as a weighted average of local attractor dimensions in vicinities of periodic orbits.
Exotic Attractors of the Nonequilibrium Rabi-Hubbard Model.
Schiró, M; Joshi, C; Bordyuh, M; Fazio, R; Keeling, J; Türeci, H E
2016-04-08
We explore the phase diagram of the dissipative Rabi-Hubbard model, as could be realized by a Raman-pumping scheme applied to a coupled cavity array. There exist various exotic attractors, including ferroelectric, antiferroelectric, and incommensurate fixed points, as well as regions of persistent oscillations. Many of these features can be understood analytically by truncating to the two lowest lying states of the Rabi model on each site. We also show that these features survive beyond mean field, using matrix product operator simulations.
Attractor and Boundedness of Switched Stochastic Cohen-Grossberg Neural Networks
Directory of Open Access Journals (Sweden)
Chuangxia Huang
2016-01-01
Full Text Available We address the problem of stochastic attractor and boundedness of a class of switched Cohen-Grossberg neural networks (CGNN with discrete and infinitely distributed delays. With the help of stochastic analysis technology, the Lyapunov-Krasovskii functional method, linear matrix inequalities technique (LMI, and the average dwell time approach (ADT, some novel sufficient conditions regarding the issues of mean-square uniformly ultimate boundedness, the existence of a stochastic attractor, and the mean-square exponential stability for the switched Cohen-Grossberg neural networks are established. Finally, illustrative examples and their simulations are provided to illustrate the effectiveness of the proposed results.
Unraveling chaotic attractors by complex networks and measurements of stock market complexity.
Cao, Hongduo; Li, Ying
2014-03-01
We present a novel method for measuring the complexity of a time series by unraveling a chaotic attractor modeled on complex networks. The complexity index R, which can potentially be exploited for prediction, has a similar meaning to the Kolmogorov complexity (calculated from the Lempel-Ziv complexity), and is an appropriate measure of a series' complexity. The proposed method is used to research the complexity of the world's major capital markets. None of these markets are completely random, and they have different degrees of complexity, both over the entire length of their time series and at a level of detail. However, developing markets differ significantly from mature markets. Specifically, the complexity of mature stock markets is stronger and more stable over time, whereas developing markets exhibit relatively low and unstable complexity over certain time periods, implying a stronger long-term price memory process.
Directory of Open Access Journals (Sweden)
Laura Dempere-Marco
Full Text Available The study of working memory capacity is of outmost importance in cognitive psychology as working memory is at the basis of general cognitive function. Although the working memory capacity limit has been thoroughly studied, its origin still remains a matter of strong debate. Only recently has the role of visual saliency in modulating working memory storage capacity been assessed experimentally and proved to provide valuable insights into working memory function. In the computational arena, attractor networks have successfully accounted for psychophysical and neurophysiological data in numerous working memory tasks given their ability to produce a sustained elevated firing rate during a delay period. Here we investigate the mechanisms underlying working memory capacity by means of a biophysically-realistic attractor network with spiking neurons while accounting for two recent experimental observations: 1 the presence of a visually salient item reduces the number of items that can be held in working memory, and 2 visually salient items are commonly kept in memory at the cost of not keeping as many non-salient items. Our model suggests that working memory capacity is determined by two fundamental processes: encoding of visual items into working memory and maintenance of the encoded items upon their removal from the visual display. While maintenance critically depends on the constraints that lateral inhibition imposes to the mnemonic activity, encoding is limited by the ability of the stimulated neural assemblies to reach a sufficiently high level of excitation, a process governed by the dynamics of competition and cooperation among neuronal pools. Encoding is therefore contingent upon the visual working memory task and has led us to introduce the concept of effective working memory capacity (eWMC in contrast to the maximal upper capacity limit only reached under ideal conditions.
Dempere-Marco, Laura; Melcher, David P.; Deco, Gustavo
2012-01-01
The study of working memory capacity is of outmost importance in cognitive psychology as working memory is at the basis of general cognitive function. Although the working memory capacity limit has been thoroughly studied, its origin still remains a matter of strong debate. Only recently has the role of visual saliency in modulating working memory storage capacity been assessed experimentally and proved to provide valuable insights into working memory function. In the computational arena, attractor networks have successfully accounted for psychophysical and neurophysiological data in numerous working memory tasks given their ability to produce a sustained elevated firing rate during a delay period. Here we investigate the mechanisms underlying working memory capacity by means of a biophysically-realistic attractor network with spiking neurons while accounting for two recent experimental observations: 1) the presence of a visually salient item reduces the number of items that can be held in working memory, and 2) visually salient items are commonly kept in memory at the cost of not keeping as many non-salient items. Our model suggests that working memory capacity is determined by two fundamental processes: encoding of visual items into working memory and maintenance of the encoded items upon their removal from the visual display. While maintenance critically depends on the constraints that lateral inhibition imposes to the mnemonic activity, encoding is limited by the ability of the stimulated neural assemblies to reach a sufficiently high level of excitation, a process governed by the dynamics of competition and cooperation among neuronal pools. Encoding is therefore contingent upon the visual working memory task and has led us to introduce the concept of effective working memory capacity (eWMC) in contrast to the maximal upper capacity limit only reached under ideal conditions. PMID:22952608
Dempere-Marco, Laura; Melcher, David P; Deco, Gustavo
2012-01-01
The study of working memory capacity is of outmost importance in cognitive psychology as working memory is at the basis of general cognitive function. Although the working memory capacity limit has been thoroughly studied, its origin still remains a matter of strong debate. Only recently has the role of visual saliency in modulating working memory storage capacity been assessed experimentally and proved to provide valuable insights into working memory function. In the computational arena, attractor networks have successfully accounted for psychophysical and neurophysiological data in numerous working memory tasks given their ability to produce a sustained elevated firing rate during a delay period. Here we investigate the mechanisms underlying working memory capacity by means of a biophysically-realistic attractor network with spiking neurons while accounting for two recent experimental observations: 1) the presence of a visually salient item reduces the number of items that can be held in working memory, and 2) visually salient items are commonly kept in memory at the cost of not keeping as many non-salient items. Our model suggests that working memory capacity is determined by two fundamental processes: encoding of visual items into working memory and maintenance of the encoded items upon their removal from the visual display. While maintenance critically depends on the constraints that lateral inhibition imposes to the mnemonic activity, encoding is limited by the ability of the stimulated neural assemblies to reach a sufficiently high level of excitation, a process governed by the dynamics of competition and cooperation among neuronal pools. Encoding is therefore contingent upon the visual working memory task and has led us to introduce the concept of effective working memory capacity (eWMC) in contrast to the maximal upper capacity limit only reached under ideal conditions.
Directory of Open Access Journals (Sweden)
Paul eMiller
2013-05-01
Full Text Available Randomly connected recurrent networks of excitatory groups of neurons can possess a multitude of attractor states. When the internal excitatory synapses of these networks are depressing, the attractor states can be destabilized with increasing input. This leads to an itinerancy, where with either repeated transient stimuli, or increasing duration of a single stimulus, the network activity advances through sequences of attractor states. We find that the resulting network state, which persists beyond stimulus offset, can encode the number of stimuli presented via a distributed representation of neural activity with non-monotonic tuning curves for most neurons. Increased duration of a single stimulus is encoded via different distributed representations, so unlike an integrator, the network distinguishes separate successive presentations of a short stimulus from a single presentation of a longer stimulus with equal total duration. Moreover, different amplitudes of stimulus cause new, distinct activity patterns, such that changes in stimulus number, duration and amplitude can be distinguished from each other. These properties of the network depend on dynamic depressing synapses, as they disappear if synapses are static. Thus short-term synaptic depression allows a network to store separately the different dynamic properties of a spatially constant stimulus.
Infinite-Scroll Attractor Generated by the Complex Pendulum Model
Directory of Open Access Journals (Sweden)
Sachin Bhalekar
2013-01-01
Full Text Available We report the finding of the simple nonlinear autonomous system exhibiting infinite-scroll attractor. The system is generated from the pendulum equation with complex-valued function. The proposed system is having infinitely many saddle points of index two which are responsible for the infinite-scroll attractor.
Solanka, Lukas; van Rossum, Mark CW; Nolan, Matthew F
2015-01-01
Neural computations underlying cognitive functions require calibration of the strength of excitatory and inhibitory synaptic connections and are associated with modulation of gamma frequency oscillations in network activity. However, principles relating gamma oscillations, synaptic strength and circuit computations are unclear. We address this in attractor network models that account for grid firing and theta-nested gamma oscillations in the medial entorhinal cortex. We show that moderate intrinsic noise massively increases the range of synaptic strengths supporting gamma oscillations and grid computation. With moderate noise, variation in excitatory or inhibitory synaptic strength tunes the amplitude and frequency of gamma activity without disrupting grid firing. This beneficial role for noise results from disruption of epileptic-like network states. Thus, moderate noise promotes independent control of multiplexed firing rate- and gamma-based computational mechanisms. Our results have implications for tuning of normal circuit function and for disorders associated with changes in gamma oscillations and synaptic strength. DOI: http://dx.doi.org/10.7554/eLife.06444.001 PMID:26146940
A Bayesian Attractor Model for Perceptual Decision Making.
Bitzer, Sebastian; Bruineberg, Jelle; Kiebel, Stefan J
2015-08-01
Even for simple perceptual decisions, the mechanisms that the brain employs are still under debate. Although current consensus states that the brain accumulates evidence extracted from noisy sensory information, open questions remain about how this simple model relates to other perceptual phenomena such as flexibility in decisions, decision-dependent modulation of sensory gain, or confidence about a decision. We propose a novel approach of how perceptual decisions are made by combining two influential formalisms into a new model. Specifically, we embed an attractor model of decision making into a probabilistic framework that models decision making as Bayesian inference. We show that the new model can explain decision making behaviour by fitting it to experimental data. In addition, the new model combines for the first time three important features: First, the model can update decisions in response to switches in the underlying stimulus. Second, the probabilistic formulation accounts for top-down effects that may explain recent experimental findings of decision-related gain modulation of sensory neurons. Finally, the model computes an explicit measure of confidence which we relate to recent experimental evidence for confidence computations in perceptual decision tasks.
Energy Technology Data Exchange (ETDEWEB)
Llibre, Jaume, E-mail: jllibre@mat.uab.cat [Universitat Autònoma de Barcelona, Departament de Matemàtiques (Spain); Valls, Claudia, E-mail: cvalls@math.ist.utl.pt [Universidade de Lisboa, Departamento de Matemática, Instituto Superior Técnico (Portugal)
2017-06-15
For a dynamical system described by a set of autonomous differential equations, an attractor can be either a point, or a periodic orbit, or even a strange attractor. Recently a new chaotic system with only one parameter has been presented where besides a point attractor and a chaotic attractor, it also has a coexisting attractor limit cycle which makes evident the complexity of such a system. We study using analytic tools the dynamics of such system. We describe its global dynamics near the infinity, and prove that it has no Darboux first integrals.
Coupled flare attractors – a discrete prototype for economic modelling
Directory of Open Access Journals (Sweden)
Georg C. Hartmann
1999-01-01
Full Text Available A chaotic environment can give rise to “flares” if an autocatalytic variable responds in a multiplicative, threshold-type fashion to the environmental forcing. An “economic unit” similarly depends in its growth behavior on the unpredictable (chaotic? buying habits of its customers, say. It turns out that coupled flare attractors are surprisingly robust in the sense that the resulting “economy” is largely independent of the extent of diffusive coupling used. Some simulations are presented.
Study of the attractor structure of an agent-based sociological model
Timpanaro, André M.; Prado, Carmen P. C.
2011-03-01
The Sznajd model is a sociophysics model that is based in the Potts model, and used for describing opinion propagation in a society. It employs an agent-based approach and interaction rules favouring pairs of agreeing agents. It has been successfully employed in modeling some properties and scale features of both proportional and majority elections (see for instance the works of A. T. Bernardes and R. N. Costa Filho), but its stationary states are always consensus states. In order to explain more complicated behaviours, we have modified the bounded confidence idea (introduced before in other opinion models, like the Deffuant model), with the introduction of prejudices and biases (we called this modification confidence rules), and have adapted it to the discrete Sznajd model. This generalized Sznajd model is able to reproduce almost all of the previous versions of the Sznajd model, by using appropriate choices of parameters. We solved the attractor structure of the resulting model in a mean-field approach and made Monte Carlo simulations in a Barabási-Albert network. These simulations show great similarities with the mean-field, for the tested cases of 3 and 4 opinions. The dynamical systems approach that we devised allows for a deeper understanding of the potential of the Sznajd model as an opinion propagation model and can be easily extended to other models, like the voter model. Our modification of the bounded confidence rule can also be readily applied to other opinion propagation models.
Directory of Open Access Journals (Sweden)
Jose eDavila-Velderrain
2015-04-01
Full Text Available Robust temporal and spatial patterns of cell types emerge in the course of normal development in multicellular organisms. The onset of degenerative diseases may result from altered cell fate decisions that give rise to pathological phenotypes. Complex networks of genetic and non-genetic components underlie such normal and altered morphogenetic patterns. Here we focus on the networks of regulatory interactions involved in cell-fate decisions. Such networks modeled as dynamical non-linear systems attain particular stable configurations on gene activity that have been interpreted as cell-fate states. The network structure also restricts the most probable transition patterns among such states. The so-called Epigenetic Landscape (EL, originally proposed by C.H. Waddington, was an early attempt to conceptually explain the emergence of developmental choices as the result of intrinsic constraints (regulatory interactions shaped during evolution. Thanks to the wealth of molecular genetic and genomic studies, we are now able to postulate gene regulatory networks (GRN grounded on experimental data, and to derive EL models for specific cases. This, in turn, has motivated several mathematical and computational modeling approaches inspired by the EL concept, that may be useful tools to understand and predict cell-fate decisions and emerging patterns. In order to distinguish between the classical metaphorical EL proposal of Waddington, we refer to the Epigenetic Attractors Landscape (EAL, a proposal that is formally framed in the context of GRNs and dynamical systems theory. In this review we discuss recent EAL modeling strategies, their conceptual basis and their application in studying the emergence of both normal and pathological developmental processes. In addition, we discuss how model predictions can shed light into rational strategies for cell fate regulation, and we point to challenges ahead.
Directory of Open Access Journals (Sweden)
Bocheng Bao
2017-08-01
Full Text Available A new hyperbolic-type memristor emulator is presented and its frequency-dependent pinched hysteresis loops are analyzed by numerical simulations and confirmed by hardware experiments. Based on the emulator, a novel hyperbolic-type memristor based 3-neuron Hopfield neural network (HNN is proposed, which is achieved through substituting one coupling-connection weight with a memristive synaptic weight. It is numerically shown that the memristive HNN has a dynamical transition from chaotic, to periodic, and further to stable point behaviors with the variations of the memristor inner parameter, implying the stabilization effect of the hyperbolic-type memristor on the chaotic HNN. Of particular interest, it should be highly stressed that for different memristor inner parameters, different coexisting behaviors of asymmetric attractors are emerged under different initial conditions, leading to the existence of multistable oscillation states in the memristive HNN. Furthermore, by using commercial discrete components, a nonlinear circuit is designed and PSPICE circuit simulations and hardware experiments are performed. The results simulated and captured from the realization circuit are consistent with numerical simulations, which well verify the facticity of coexisting asymmetric attractors' behaviors.
Lorenz, HW; Nusse, HE
Goodwin's nonlinear accelerator model with periodic investment outlays is reconsidered and used as an economic example of the emergence of complex motion in nonlinear dynamical systems. In addition to chaotic attractors, the model can possess coexisting attracting periodic orbits or simple
Cusps enable line attractors for neural computation
Xiao, Zhuocheng; Zhang, Jiwei; Sornborger, Andrew T.; Tao, Louis
2017-11-01
Line attractors in neuronal networks have been suggested to be the basis of many brain functions, such as working memory, oculomotor control, head movement, locomotion, and sensory processing. In this paper, we make the connection between line attractors and pulse gating in feed-forward neuronal networks. In this context, because of their neutral stability along a one-dimensional manifold, line attractors are associated with a time-translational invariance that allows graded information to be propagated from one neuronal population to the next. To understand how pulse-gating manifests itself in a high-dimensional, nonlinear, feedforward integrate-and-fire network, we use a Fokker-Planck approach to analyze system dynamics. We make a connection between pulse-gated propagation in the Fokker-Planck and population-averaged mean-field (firing rate) models, and then identify an approximate line attractor in state space as the essential structure underlying graded information propagation. An analysis of the line attractor shows that it consists of three fixed points: a central saddle with an unstable manifold along the line and stable manifolds orthogonal to the line, which is surrounded on either side by stable fixed points. Along the manifold defined by the fixed points, slow dynamics give rise to a ghost. We show that this line attractor arises at a cusp catastrophe, where a fold bifurcation develops as a function of synaptic noise; and that the ghost dynamics near the fold of the cusp underly the robustness of the line attractor. Understanding the dynamical aspects of this cusp catastrophe allows us to show how line attractors can persist in biologically realistic neuronal networks and how the interplay of pulse gating, synaptic coupling, and neuronal stochasticity can be used to enable attracting one-dimensional manifolds and, thus, dynamically control the processing of graded information.
A Cayley Tree Immune Network Model with Antibody Dynamics
Anderson, R W; Perelson, A S; Anderson, Russell W.; Neumann, Avidan U.; Perelson, Alan S.
1993-01-01
Abstract: A Cayley tree model of idiotypic networks that includes both B cell and antibody dynamics is formulated and analyzed. As in models with B cells only, localized states exist in the network with limited numbers of activated clones surrounded by virgin or near-virgin clones. The existence and stability of these localized network states are explored as a function of model parameters. As in previous models that have included antibody, the stability of immune and tolerant localized states are shown to depend on the ratio of antibody to B cell lifetimes as well as the rate of antibody complex removal. As model parameters are varied, localized steady-states can break down via two routes: dynamically, into chaotic attractors, or structurally into percolation attractors. For a given set of parameters, percolation and chaotic attractors can coexist with localized attractors, and thus there do not exist clear cut boundaries in parameter space that separate regions of localized attractors from regions of percola...
Vestibular and Attractor Network Basis of the Head Direction Cell Signal in Subcortical Circuits
Directory of Open Access Journals (Sweden)
Benjamin J Clark
2012-03-01
Full Text Available Accurate navigation depends on a network of neural systems that encode the moment-to-moment changes in an animal’s directional orientation and location in space. Within this navigation system are head direction (HD cells, which fire persistently when an animal’s head is pointed in a particular direction (Sharp et al., 2001a; Taube, 2007. HD cells are widely thought to underlie an animal’s sense of spatial orientation, and research over the last 25+ years has revealed that this robust spatial signal is widely distributed across subcortical and cortical limbic areas. Much of this work has been directed at understanding the functional organization of the HD cell circuitry, and precisely how this signal is generated from sensory and motor systems. The purpose of the present review is to summarize some of the recent studies arguing that the HD cell circuit is largely processed in a hierarchical fashion, following a pathway involving the dorsal tegmental nuclei → lateral mammillary nuclei → anterior thalamus → parahippocampal and retrosplenial cortical regions. We also review recent work identifying bursting cellular activity in the HD cell circuit after lesions of the vestibular system, and relate these observations to the long held view that attractor network mechanisms underlie HD signal generation. Finally, we summarize the work to date suggesting that this network architecture may reside within the tegmento-mammillary circuit.
Noise in attractor networks in the brain produced by graded firing rate representations.
Directory of Open Access Journals (Sweden)
Tristan J Webb
Full Text Available Representations in the cortex are often distributed with graded firing rates in the neuronal populations. The firing rate probability distribution of each neuron to a set of stimuli is often exponential or gamma. In processes in the brain, such as decision-making, that are influenced by the noise produced by the close to random spike timings of each neuron for a given mean rate, the noise with this graded type of representation may be larger than with the binary firing rate distribution that is usually investigated. In integrate-and-fire simulations of an attractor decision-making network, we show that the noise is indeed greater for a given sparseness of the representation for graded, exponential, than for binary firing rate distributions. The greater noise was measured by faster escaping times from the spontaneous firing rate state when the decision cues are applied, and this corresponds to faster decision or reaction times. The greater noise was also evident as less stability of the spontaneous firing state before the decision cues are applied. The implication is that spiking-related noise will continue to be a factor that influences processes such as decision-making, signal detection, short-term memory, and memory recall even with the quite large networks found in the cerebral cortex. In these networks there are several thousand recurrent collateral synapses onto each neuron. The greater noise with graded firing rate distributions has the advantage that it can increase the speed of operation of cortical circuitry.
Compact attractors for time-periodic age-structured population models
Directory of Open Access Journals (Sweden)
Pierre Magal
2001-10-01
Full Text Available In this paper we investigate the existence of compact attractors for time-periodic age-structured models. So doing we investigate the eventual compactness of a class of abstract non-autonomous semiflow (non necessarily periodic. We apply this result to non-autonomous age-structured models. In the time periodic case, we obtain the existence of a periodic family of compact subsets that is invariant by the semiflow, and attract the solutions of the system.
Modeling Multi-Agent Self-Organization through the Lens of Higher Order Attractor Dynamics.
Butner, Jonathan E; Wiltshire, Travis J; Munion, A K
2017-01-01
Social interaction occurs across many time scales and varying numbers of agents; from one-on-one to large-scale coordination in organizations, crowds, cities, and colonies. These contexts, are characterized by emergent self-organization that implies higher order coordinated patterns occurring over time that are not due to the actions of any particular agents, but rather due to the collective ordering that occurs from the interactions of the agents. Extant research to understand these social coordination dynamics (SCD) has primarily examined dyadic contexts performing rhythmic tasks. To advance this area of study, we elaborate on attractor dynamics, our ability to depict them visually, and quantitatively model them. Primarily, we combine difference/differential equation modeling with mixture modeling as a way to infer the underlying topological features of the data, which can be described in terms of attractor dynamic patterns. The advantage of this approach is that we are able to quantify the self-organized dynamics that agents exhibit, link these dynamics back to activity from individual agents, and relate it to other variables central to understanding the coordinative functionality of a system's behavior. We present four examples that differ in the number of variables used to depict the attractor dynamics (1, 2, and 6) and range from simulated to non-simulated data sources. We demonstrate that this is a flexible method that advances scientific study of SCD in a variety of multi-agent systems.
Hypercrater Bifurcations, Attractor Coexistence, and Unfolding in a 5D Model of Economic Dynamics
Directory of Open Access Journals (Sweden)
Toichiro Asada
2011-01-01
Full Text Available Complex dynamical features are explored in a discrete interregional macrodynamic model proposed by Asada et al., using numerical methods. The model is five-dimensional with four parameters. The results demonstrate patterns of dynamical behaviour, such as bifurcation processes and coexistence of attractors, generated by high-dimensional discrete systems. In three cases of two-dimensional parameter subspaces the stability of equilibrium region is determined and its boundaries, the flip and Neimark-Hopf bifurcation curves, are identified by means of necessary coefficient criteria. In the first case closed invariant curves (CICs are found to occur through 5D-crater-type bifurcations, and for certain ranges of parameter values a stable equilibrium coexists with an unstable CIC associated with the subcritical bifurcation, as well as with an outer stable CIC. A remarkable feature of the second case is the coexistence of two attracting CICs outside the stability region. In both these cases the related hysteresis effects are illustrated by numerical simulations. In the third case a remarkable feature is the apparent unfolding of an attracting CIC before it evolves to a chaotic attractor. Examples of CICs and chaotic attractors are given in subspaces of phase space.
Noise-driven attractor switching device
Asakawa, Naoki; Hotta, Yasushi; Kanki, Teruo; Kawai, Tomoji; Tabata, Hitoshi
2009-02-01
Problems with artificial neural networks originate from their deterministic nature and inevitable prior learnings, resulting in inadequate adaptability against unpredictable, abrupt environmental change. Here we show that a stochastically excitable threshold unit can be utilized by these systems to partially overcome the environmental change. Using an excitable threshold system, attractors were created that represent quasiequilibrium states into which a system settles until disrupted by environmental change. Furthermore, noise-driven attractor stabilization and switching were embodied by inhibitory connections. Noise works as a power source to stabilize and switch attractors, and endows the system with hysteresis behavior that resembles that of stereopsis and binocular rivalry in the human visual cortex. A canonical model of the ring network with inhibitory connections composed of class 1 neurons also shows properties that are similar to the simple threshold system.
Huang, S.; Ingber, D. E.
2000-01-01
Development of characteristic tissue patterns requires that individual cells be switched locally between different phenotypes or "fates;" while one cell may proliferate, its neighbors may differentiate or die. Recent studies have revealed that local switching between these different gene programs is controlled through interplay between soluble growth factors, insoluble extracellular matrix molecules, and mechanical forces which produce cell shape distortion. Although the precise molecular basis remains unknown, shape-dependent control of cell growth and function appears to be mediated by tension-dependent changes in the actin cytoskeleton. However, the question remains: how can a generalized physical stimulus, such as cell distortion, activate the same set of genes and signaling proteins that are triggered by molecules which bind to specific cell surface receptors. In this article, we use computer simulations based on dynamic Boolean networks to show that the different cell fates that a particular cell can exhibit may represent a preprogrammed set of common end programs or "attractors" which self-organize within the cell's regulatory networks. In this type of dynamic network model of information processing, generalized stimuli (e.g., mechanical forces) and specific molecular cues elicit signals which follow different trajectories, but eventually converge onto one of a small set of common end programs (growth, quiescence, differentiation, apoptosis, etc.). In other words, if cells use this type of information processing system, then control of cell function would involve selection of preexisting (latent) behavioral modes of the cell, rather than instruction by specific binding molecules. Importantly, the results of the computer simulation closely mimic experimental data obtained with living endothelial cells. The major implication of this finding is that current methods used for analysis of cell function that rely on characterization of linear signaling pathways or
Huang, Sui; Ingber, Donald E
It is commonly assumed that somatic evolution drives the multi-step process that produces metastatic cancer. But it is difficult to reconcile the inexorable progression towards metastasis in virtually all carcinomas and the associated complex change of cancer cell phenotype, characterized by an epithelial-to-mesenchymal transition, with the random nature of gene mutations. Given their irreversible nature, it is also difficult to explain why certain metastatic carcinomas can reform normal tissue boundaries and remain dormant for years at distant sites. Here we propose an encompassing conceptual framework based on system-level dynamics of gene regulatory networks that may help reconcile these inconsistencies. The concepts of gene expression state space and attractors are introduced which provide a mathematical and molecular basis for an "epigenetic landscape". We then describe how cancer cells are trapped in "embryonic attractors" because of distortions of this landscape caused by mutational rewiring of the regulatory network. The implications of this concept for a new integrative understanding of tumor formation and metastatic progression are discussed. This formal framework of cancer progression unites mainstream genetic determinism with alternative ideas that emphasize non-genetic influences, including chronic growth stimulation,extracellular matrix remodeling, alteration of cell mechanics and disruption of tissue architecture.
Energy Technology Data Exchange (ETDEWEB)
Rajpoot, Subhash [California State University, Long Beach, CA (United States); Vacaru, Sergiu I. [Quantum Gravity Research, Topanga, CA (United States); University ' ' Al.I. Cuza' ' , Project IDEI, Iasi (Romania)
2017-05-15
Applying the anholonomic frame deformation method, we construct various classes of cosmological solutions for effective Einstein-Yang-Mills-Higgs, and two measure theories. The types of models considered are Freedman-Lemaitre-Robertson-Walker, Bianchi, Kasner and models with attractor configurations. The various regimes pertaining to plateau-type inflation, quadratic inflation, Starobinsky type and Higgs type inflation are presented. (orig.)
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.
Ferrara, S; Morales, J F; Samtleben, H
2009-01-01
We apply the entropy formalism to the study of the near-horizon geometry of extremal black p-brane intersections in D>5 dimensional supergravities. The scalar flow towards the horizon is described in terms an effective potential given by the superposition of the kinetic energies of all the forms under which the brane is charged. At the horizon active scalars get fixed to the minima of the effective potential and the entropy function is given in terms of U-duality invariants built entirely out of the black p-brane charges. The resulting entropy function reproduces the central charges of the dual boundary CFT and gives rise to a Bekenstein-Hawking like area law. The results are illustrated in the case of black holes and black string intersections in D=6, 7, 8 supergravities where the effective potentials, attractor equations, moduli spaces and entropy/central charges are worked out in full detail.
Attractor switching in neuron networks and Spatiotemporal filters for motion processing
Subramanian, Easwara Naga
2008-01-01
From a broader perspective, we address two important questions, viz., (a) what kind of mechanism would enable a neuronal network to switch between various tasks or stored patterns? (b) what are the properties of neurons that are used by the visual system in early motion detection? To address (a) we
Modeling and controlling the two-phase dynamics of the p53 network: a Boolean network approach
Lin, Guo-Qiang; Ao, Bin; Chen, Jia-Wei; Wang, Wen-Xu; Di, Zeng-Ru
2014-12-01
Although much empirical evidence has demonstrated that p53 plays a key role in tumor suppression, the dynamics and function of the regulatory network centered on p53 have not yet been fully understood. Here, we develop a Boolean network model to reproduce the two-phase dynamics of the p53 network in response to DNA damage. In particular, we map the fates of cells into two types of Boolean attractors, and we find that the apoptosis attractor does not exist for minor DNA damage, reflecting that the cell is reparable. As the amount of DNA damage increases, the basin of the repair attractor shrinks, accompanied by the rising of the apoptosis attractor and the expansion of its basin, indicating that the cell becomes more irreparable with more DNA damage. For severe DNA damage, the repair attractor vanishes, and the apoptosis attractor dominates the state space, accounting for the exclusive fate of death. Based on the Boolean network model, we explore the significance of links, in terms of the sensitivity of the two-phase dynamics, to perturbing the weights of links and removing them. We find that the links are either critical or ordinary, rather than redundant. This implies that the p53 network is irreducible, but tolerant of small mutations at some ordinary links, and this can be interpreted with evolutionary theory. We further devised practical control schemes for steering the system into the apoptosis attractor in the presence of DNA damage by pinning the state of a single node or perturbing the weight of a single link. Our approach offers insights into understanding and controlling the p53 network, which is of paramount importance for medical treatment and genetic engineering.
Cosmological attractors in massive gravity
Dubovsky, S; Tkachev, I I
2005-01-01
We study Lorentz-violating models of massive gravity which preserve rotations and are invariant under time-dependent shifts of the spatial coordinates. In the linear approximation the Newtonian potential in these models has an extra ``confining'' term proportional to the distance from the source. We argue that during cosmological expansion the Universe may be driven to an attractor point with larger symmetry which includes particular simultaneous dilatations of time and space coordinates. The confining term in the potential vanishes as one approaches the attractor. In the vicinity of the attractor the extra contribution is present in the Friedmann equation which, in a certain range of parameters, gives rise to the cosmic acceleration.
Cortical computations via transient attractors.
Directory of Open Access Journals (Sweden)
Oliver L C Rourke
Full Text Available The ability of sensory networks to transiently store information on the scale of seconds can confer many advantages in processing time-varying stimuli. How a network could store information on such intermediate time scales, between typical neurophysiological time scales and those of long-term memory, is typically attributed to persistent neural activity. An alternative mechanism which might allow for such information storage is through temporary modifications to the neural connectivity which decay on the same second-long time scale as the underlying memories. Earlier work that has explored this method has done so by emphasizing one attractor from a limited, pre-defined set. Here, we describe an alternative, a Transient Attractor network, which can learn any pattern presented to it, store several simultaneously, and robustly recall them on demand using targeted probes in a manner reminiscent of Hopfield networks. We hypothesize that such functionality could be usefully embedded within sensory cortex, and allow for a flexibly-gated short-term memory, as well as conferring the ability of the network to perform automatic de-noising, and separation of input signals into distinct perceptual objects. We demonstrate that the stored information can be refreshed to extend storage time, is not sensitive to noise in the system, and can be turned on or off by simple neuromodulation. The diverse capabilities of transient attractors, as well as their resemblance to many features observed in sensory cortex, suggest the possibility that their actions might underlie neural processing in many sensory areas.
Global attractor alphabet of neural firing modes.
Baram, Yoram
2013-08-01
The elementary set, or alphabet, of neural firing modes is derived from the widely accepted conductance-based rectified firing-rate model. The firing dynamics of interacting neurons are shown to be governed by a multidimensional bilinear threshold discrete iteration map. The parameter-dependent global attractors of the map morph into 12 attractor types. Consistent with the dynamic modes observed in biological neuronal firing, the global attractor alphabet is highly visual and intuitive in the scalar, single-neuron case. As synapse permeability varies from high depression to high potentiation, the global attractor type varies from chaotic to multiplexed, oscillatory, fixed, and saturated. As membrane permeability decreases, the global attractor transforms from active to passive state. Under the same activation, learning and retrieval end at the same global attractor. The bilinear threshold structure of the multidimensional map associated with interacting neurons generalizes the global attractor alphabet of neuronal firing modes to multineuron systems. Selective positive or negative activation and neural interaction yield combinatorial revelation and concealment of stored neuronal global attractors.
A signature of attractor dynamics in the CA3 region of the hippocampus.
Directory of Open Access Journals (Sweden)
César Rennó-Costa
2014-05-01
Full Text Available The notion of attractor networks is the leading hypothesis for how associative memories are stored and recalled. A defining anatomical feature of such networks is excitatory recurrent connections. These "attract" the firing pattern of the network to a stored pattern, even when the external input is incomplete (pattern completion. The CA3 region of the hippocampus has been postulated to be such an attractor network; however, the experimental evidence has been ambiguous, leading to the suggestion that CA3 is not an attractor network. In order to resolve this controversy and to better understand how CA3 functions, we simulated CA3 and its input structures. In our simulation, we could reproduce critical experimental results and establish the criteria for identifying attractor properties. Notably, under conditions in which there is continuous input, the output should be "attracted" to a stored pattern. However, contrary to previous expectations, as a pattern is gradually "morphed" from one stored pattern to another, a sharp transition between output patterns is not expected. The observed firing patterns of CA3 meet these criteria and can be quantitatively accounted for by our model. Notably, as morphing proceeds, the activity pattern in the dentate gyrus changes; in contrast, the activity pattern in the downstream CA3 network is attracted to a stored pattern and thus undergoes little change. We furthermore show that other aspects of the observed firing patterns can be explained by learning that occurs during behavioral testing. The CA3 thus displays both the learning and recall signatures of an attractor network. These observations, taken together with existing anatomical and behavioral evidence, make the strong case that CA3 constructs associative memories based on attractor dynamics.
The 3-Attractor Water Model: Monte-Carlo Simulations with a New, Effective 2-Body Potential (BMW
Directory of Open Access Journals (Sweden)
Francis Muguet
2003-02-01
Full Text Available According to the precepts of the 3-attractor (3-A water model, effective 2-body water potentials should feature as local minima the bifurcated and inverted water dimers in addition to the well-known linear water dimer global minimum. In order to test the 3-A model, a new pair wise effective intermolecular rigid water potential has been designed. The new potential is part of new class of potentials called BMW (Bushuev-Muguet-Water which is built by modifying existing empirical potentials. This version (BMW v. 0.1 has been designed by modifying the SPC/E empirical water potential. It is a preliminary version well suited for exploratory Monte-Carlo simulations. The shape of the potential energy surface (PES around each local minima has been approximated with the help of Gaussian functions. Classical Monte Carlo simulations have been carried out for liquid water in the NPT ensemble for a very wide range of state parameters up to the supercritical water regime. Thermodynamic properties are reported. The radial distributions functions (RDFs have been computed and are compared with the RDFs obtained from Neutron Scattering experimental data. Our preliminary Monte-Carlo simulations show that the seemingly unconventional hypotheses of the 3-A model are most plausible. The simulation has also uncovered a totally new role for 2-fold H-bonds.
Black-Hole Attractors in N=1 Supergravity
Andrianopoli, L; Ferrara, Sergio; Trigiante, M; Andrianopoli, Laura; Auria, Riccardo D'; Ferrara, Sergio; Trigiante, Mario
2007-01-01
We study the attractor mechanism for N=1 supergravity coupled to vector and chiral multiplets and compute the attractor equations of these theories. These equations may have solutions depending on the choice of the holomorphic symmetric matrix f_{\\Lambda\\Sigma} which appears in the kinetic lagrangian of the vector sector. Models with non trivial electric-magnetic duality group which have or have not attractor behavior are exhibited. For a particular class of models, based on an N=1 reduction of homogeneous special geometries, the attractor equations are related to the theory of pure spinors.
Ferrara, Sergio; Ferrara, Sergio; Kallosh, Renata
1996-01-01
We find a general principle which allows one to compute the area of the horizon of N=2 extremal black holes as an extremum of the central charge. One considers the ADM mass equal to the central charge as a function of electric and magnetic charges and moduli and extremizes this function in the moduli space (a minimum corresponds to a fixed point of attraction). The extremal value of the square of the central charge provides the area of the horizon, which depends only on electric and magnetic charges. The doubling of unbroken supersymmetry at the fixed point of attraction for N=2 black holes near the horizon is derived via conformal flatness of the Bertotti-Robinson-type geometry. These results provide an explicit model independent expression for the macroscopic Bekenstein-Hawking entropy of N=2 black holes which is manifestly duality invariant. The presence of hypermultiplets in the solution does not affect the area formula. Various examples of the general formula are displayed. We outline the attractor mecha...
Pierini, Stefano; Ghil, Michael; Chekroun, Mickael D.
2017-04-01
A low-order quasigeostrophic model captures several key features of intrinsic low-frequency variability of the oceans' wind-driven circulation. This double-gyre model is used here as a prototype of an unstable and nonlinear dynamical system with time-dependent forcing to explore basic features of climate change in the presence of natural variability [1,2]. The studies rely on the theoretical framework of nonautonomous dynamical systems and of their pullback attractors (PBAs), namely the time-dependent invariant sets that attract all trajectories initialized in the remote past. Ensemble simulations help us explore these PBAs. The chaotic PBAs of the periodically forced model [1] are found to be cyclo-stationary and cyclo-ergodic. Two parameters are then introduced to analyze the topological structure of the PBAs as a function of the forcing period; their joint use allows one to identify four distinct forms of sensitivity to initial state that correspond to distinct system behaviors. The model's response to periodic forcing turns out to be, in most cases, very sensitive to the initial state. The system is then forced by a synthetic aperiodic forcing [2]. The existence of a global PBA is rigorously demonstrated. We then assess the convergence of trajectories to this PBA by computing the probability density function (PDF) of trajectory localization in the model's phase space. A sensitivity analysis with respect to forcing amplitude shows that the global PBA experiences large modifications if the underlying autonomous system is dominated by small-amplitude limit cycles, while the changes are less dramatic in a regime characterized by large-amplitude relaxation oscillations. The dependence of the attracting sets on the choice of the ensemble of initial states is then analyzed. Two types of basins of attraction coexist for certain parameter ranges; they contain chaotic and nonchaotic trajectories, respectively. The statistics of the former does not depend on the initial
Directory of Open Access Journals (Sweden)
Francis F. Muguet
2005-04-01
Full Text Available MC simulations of a set of zigzag ((9,0-(14,0 and armchair ((6,6-(10,10carbon nanotubes immersed in water have been carried out in an NpT-ensemble (512 watermolecules, p=1 bar, T=298 K. Intermolecular interactions were described by BMWpotential according to which, besides the well-known linear water dimer bifurcated andinverted water dimers are metastable. In all cases, it was found that there are large periodicfluctuations of water occupancy inside the nanotubes. Decrease in the size of the nanotubediameter leads to a significant destruction of the H-bond network, and to a bifucarted dimerpopulation increase. Inverted dimer concentration relationship with the nanotube diameter ismore complicated. Population maximum for inverted dimers occurs for diameters of 10-11 ÃƒÂ¥. Water features different intermolecular structures not only inside carbon nanotubesbut also in the outer first hydration shells. The amount of bifurcated and inverted dimers issignificantly more important in the first hydration shell than in bulk water.
Bellucci, S; Marrani, A
2008-01-01
We review recent results in the study of attractor horizon geometries (with non-vanishing Bekenstein-Hawking entropy) of dyonic extremal d=4 black holes in supergravity. We focus on N=2, d=4 ungauged supergravity coupled to a number n_{V} of Abelian vector multiplets, outlining the fundamentals of the special Kaehler geometry of the vector multiplets' scalar manifold (of complex dimension n_{V}), and studying the 1/2-BPS attractors, as well as the non-BPS (non-supersymmetric) ones with non-vanishing central charge. For symmetric special Kaehler geometries, we present the complete classification of the orbits in the symplectic representation of the classical U-duality group (spanned by the black hole charge configuration supporting the attractors), as well as of the moduli spaces of non-BPS attractors (spanned by the scalars which are not stabilized at the black hole event horizon). Finally, we report on an analogous classification for N>2-extended, d=4 ungauged supergravities, in which also the 1/N-BPS attrac...
Fermions, wigs, and attractors
Energy Technology Data Exchange (ETDEWEB)
Gentile, L.G.C., E-mail: lgentile@pd.infn.it [DISIT, Università del Piemonte Orientale, via T. Michel, 11, Alessandria 15120 (Italy); Dipartimento di Fisica “Galileo Galilei”, Università di Padova, via Marzolo 8, 35131 Padova (Italy); INFN, Sezione di Padova, via Marzolo 8, 35131 Padova (Italy); Grassi, P.A., E-mail: pgrassi@mfn.unipmn.it [DISIT, Università del Piemonte Orientale, via T. Michel, 11, Alessandria 15120 (Italy); INFN, Gruppo Collegato di Alessandria, Sezione di Torino (Italy); Marrani, A., E-mail: alessio.marrani@fys.kuleuven.be [ITF KU Leuven, Celestijnenlaan 200D, 3001 Leuven (Belgium); Mezzalira, A., E-mail: andrea.mezzalira@ulb.ac.be [Physique Théorique et Mathématique Université Libre de Bruxelles, C.P. 231, 1050 Bruxelles (Belgium)
2014-05-01
We compute the modifications to the attractor mechanism due to fermionic corrections. In N=2,D=4 supergravity, at the fourth order, we find terms giving rise to new contributions to the horizon values of the scalar fields of the vector multiplets.
Recurrent motifs as resonant attractor states in the narrative field: a testable model of archetype.
Goodwyn, Erik
2013-06-01
At the most basic level, archetypes represented Jung's attempt to explain the phenomenon of recurrent myths and folktale motifs (Jung 1956, 1959, para. 99). But the archetype remains controversial as an explanation of recurrent motifs, as the existence of recurrent motifs does not prove that archetypes exist. Thus, the challenge for contemporary archetype theory is not merely to demonstrate that recurrent motifs exist, since that is not disputed, but to demonstrate that archetypes exist and cause recurrent motifs. The present paper proposes a new model which is unlike others in that it postulates how the archetype creates resonant motifs. This model necessarily clarifies and adapts some of Jung's seminal ideas on archetype in order to provide a working framework grounded in contemporary practice and methodologies. For the first time, a model of archetype is proposed that can be validated on empirical, rather than theoretical grounds. This is achieved by linking the archetype to the hard data of recurrent motifs rather than academic trends in other fields. © 2013, The Society of Analytical Psychology.
Symmetron and de Sitter attractor in a teleparallel model of cosmology
Sadjadi, H Mohseni
2016-01-01
In the teleparallel framework of cosmology, a quintessence with non-minimal couplings to the scalar torsion and a boundary term is considered. A conformal coupling to matter density is also taken into account. It is shown that the model can describe onset of cosmic acceleration after an epoch of matter dominated era, where dark energy is negligible, via $Z_2$ symmetry breaking. While the conformal coupling holds the Universe in a vacuum with zero dark energy density in the early epoch, the non-minimal couplings lead the Universe to a stable state with de Sitter expansion at late time.
Collaborative networks: Reference modeling
Camarinha-Matos, L.M.; Afsarmanesh, H.
2008-01-01
Collaborative Networks: Reference Modeling works to establish a theoretical foundation for Collaborative Networks. Particular emphasis is put on modeling multiple facets of collaborative networks and establishing a comprehensive modeling framework that captures and structures diverse perspectives of
Attractors under discretisation
Han, Xiaoying
2017-01-01
This work focuses on the preservation of attractors and saddle points of ordinary differential equations under discretisation. In the 1980s, key results for autonomous ordinary differential equations were obtained – by Beyn for saddle points and by Kloeden & Lorenz for attractors. One-step numerical schemes with a constant step size were considered, so the resulting discrete time dynamical system was also autonomous. One of the aims of this book is to present new findings on the discretisation of dissipative nonautonomous dynamical systems that have been obtained in recent years, and in particular to examine the properties of nonautonomous omega limit sets and their approximations by numerical schemes – results that are also of importance for autonomous systems approximated by a numerical scheme with variable time steps, thus by a discrete time nonautonomous dynamical system.
Is attentional blink a byproduct of neocortical attractors?
Directory of Open Access Journals (Sweden)
David N Silverstein
2011-05-01
Full Text Available This study proposes a computational model for attentional blink or blink of the mind, a phenomenon where a human subject misses perception of a later expected visual pattern as two expected visual patterns are presented less than 500 ms apart. A neocortical patch modeled as an attractor network is stimulated with a sequence of 14 patterns 100 ms apart, two of which are expected targets. Patterns that become active attractors are considered recognized. A neocortical patch is represented as a square matrix of hypercolumns, each containing a set of minicolumns with synaptic connections within and across both minicolumns and hypercolumns. Each minicolumn consists of locally connected layer 2/3 pyramidal cells with interacting basket cells and layer 4 pyramidal cells for input stimulation. All neurons are implemented using the Hodgkin-Huxley multi-compartmental cell formalism and include calcium dynamics, and they interact via saturating and depressing AMPA / NMDA and GABAA synapses. Stored patterns are encoded with global connectivity of minicolumns across hypercolumns and active patterns compete as the result of lateral inhibition in the network. Stored patterns were stimulated over time intervals to create attractor interference measurable with synthetic spike traces. This setup corresponds with item presentations in human visual attentional blink studies. Stored target patterns were depolarized while distractor patterns where hyperpolarized to represent expectation of items in working memory. Additionally, studies on the inhibitory effect of benzodiazopines on attentional blink in human subjects were compared with neocortical simulations where the GABAA receptor conductance and decay time were increased. Simulations showed increases in the attentional blink duration, agreeing with observations in human studies.
The problem of colliding networks and its relation to cell fusion and cancer.
Koulakov, Alexei A; Lazebnik, Yuri
2012-11-07
Cell fusion, a process that merges two or more cells into one, is required for normal development and has been explored as a tool for stem cell therapy. It has also been proposed that cell fusion causes cancer and contributes to its progression. These functions rely on a poorly understood ability of cell fusion to create new cell types. We suggest that this ability can be understood by considering cells as attractor networks whose basic property is to adopt a set of distinct, stable, self-maintaining states called attractors. According to this view, fusion of two cell types is a collision of two networks that have adopted distinct attractors. To learn how these networks reach a consensus, we model cell fusion computationally. To do so, we simulate patterns of gene activities using a formalism developed to simulate patterns of memory in neural networks. We find that the hybrid networks can assume attractors that are unrelated to parental attractors, implying that cell fusion can create new cell types by nearly instantaneously moving cells between attractors. We also show that hybrid networks are prone to assume spurious attractors, which are emergent and sporadic network states. This finding means that cell fusion can produce abnormal cell types, including cancerous types, by placing cells into normally inaccessible spurious states. Finally, we suggest that the problem of colliding networks has general significance in many processes represented by attractor networks, including biological, social, and political phenomena. Copyright © 2012 Biophysical Society. Published by Elsevier Inc. All rights reserved.
Krawiecki, A.
A multi-agent spin model for changes of prices in the stock market based on the Ising-like cellular automaton with interactions between traders randomly varying in time is investigated by means of Monte Carlo simulations. The structure of interactions has topology of a small-world network obtained from regular two-dimensional square lattices with various coordination numbers by randomly cutting and rewiring edges. Simulations of the model on regular lattices do not yield time series of logarithmic price returns with statistical properties comparable with the empirical ones. In contrast, in the case of networks with a certain degree of randomness for a wide range of parameters the time series of the logarithmic price returns exhibit intermittent bursting typical of volatility clustering. Also the tails of distributions of returns obey a power scaling law with exponents comparable to those obtained from the empirical data.
Reverse engineering cellular decisions for hybrid reconfigurable network modeling
Blair, Howard A.; Saranak, Jureepan; Foster, Kenneth W.
2011-06-01
Cells as microorganisms and within multicellular organisms make robust decisions. Knowing how these complex cells make decisions is essential to explain, predict or mimic their behavior. The discovery of multi-layer multiple feedback loops in the signaling pathways of these modular hybrid systems suggests their decision making is sophisticated. Hybrid systems coordinate and integrate signals of various kinds: discrete on/off signals, continuous sensory signals, and stochastic and continuous fluctuations to regulate chemical concentrations. Such signaling networks can form reconfigurable networks of attractors and repellors giving them an extra level of organization that has resilient decision making built in. Work on generic attractor and repellor networks and on the already identified feedback networks and dynamic reconfigurable regulatory topologies in biological cells suggests that biological systems probably exploit such dynamic capabilities. We present a simple behavior of the swimming unicellular alga Chlamydomonas that involves interdependent discrete and continuous signals in feedback loops. We show how to rigorously verify a hybrid dynamical model of a biological system with respect to a declarative description of a cell's behavior. The hybrid dynamical systems we use are based on a unification of discrete structures and continuous topologies developed in prior work on convergence spaces. They involve variables of discrete and continuous types, in the sense of type theory in mathematical logic. A unification such as afforded by convergence spaces is necessary if one wants to take account of the affect of the structural relationships within each type on the dynamics of the system.
Gravitational waves in $\\alpha-$attractors
Kumar, K Sravan; Moniz, Paulo Vargas; Das, Suratna
2015-01-01
We study inflation in the $\\alpha-$attractor model under a non-slow-roll dynamics with an ansatz proposed by Gong \\& Sasaki \\cite{Gong:2015ypa} of assuming $N=N\\left(\\phi\\right)$. Under this approach, we construct a class of local shapes of inflaton potential that are different from the T-models. We find this type of inflationary scenario predicts an attractor at $n_{s}\\sim0.967$ and $r\\sim0.00055$. In our approach, the non-slow-roll inflaton dynamics are related to the $\\alpha-$parameter which is the curvature of K\\"ahler geometry in the SUGRA embedding of this model.
Logical Modeling and Dynamical Analysis of Cellular Networks.
Abou-Jaoudé, Wassim; Traynard, Pauline; Monteiro, Pedro T; Saez-Rodriguez, Julio; Helikar, Tomáš; Thieffry, Denis; Chaouiya, Claudine
2016-01-01
The logical (or logic) formalism is increasingly used to model regulatory and signaling networks. Complementing these applications, several groups contributed various methods and tools to support the definition and analysis of logical models. After an introduction to the logical modeling framework and to several of its variants, we review here a number of recent methodological advances to ease the analysis of large and intricate networks. In particular, we survey approaches to determine model attractors and their reachability properties, to assess the dynamical impact of variations of external signals, and to consistently reduce large models. To illustrate these developments, we further consider several published logical models for two important biological processes, namely the differentiation of T helper cells and the control of mammalian cell cycle.
Sneutrino Inflation with $\\alpha$-attractors
Kallosh, Renata; Roest, Diederik; Wrase, Timm
2016-11-22
Sneutrino inflation employs the fermionic partners of the inflaton and stabilizer field as right-handed neutrinos to realize the seesaw mechanism for light neutrino masses. A crucial ingredient in existing constructions for sneutrino (multi-)natural inflation is an unbroken discrete shift symmetry. We demonstrate that a similar construction applies to $\\alpha$-attractor models. In this case the hyperbolic geometry protects the neutrino Yukawa couplings to the inflaton field, and the masses of leptons and Higgs fields, from blowing up when the inflaton is super-Planckian. We find that the predictions for $n_s$ and $r$ for $\\alpha$-attractor cosmological models, compatible with the current cosmological data, are preserved in the presence of the neutrino sector.
Classification of attractors for systems of identical coupled Kuramoto oscillators
Energy Technology Data Exchange (ETDEWEB)
Engelbrecht, Jan R. [Department of Physics, Boston College, Chestnut Hill, Massachusetts 02467 (United States); Mirollo, Renato [Department of Mathematics, Boston College, Chestnut Hill, Massachusetts 02467 (United States)
2014-03-15
We present a complete classification of attractors for networks of coupled identical Kuramoto oscillators. In such networks, each oscillator is driven by the same first-order trigonometric function, with coefficients given by symmetric functions of the entire oscillator ensemble. For N≠3 oscillators, there are four possible types of attractors: completely synchronized fixed points or limit cycles, and fixed points or limit cycles where all but one of the oscillators are synchronized. The case N = 3 is exceptional; systems of three identical Kuramoto oscillators can also posses attracting fixed points or limit cycles with all three oscillators out of sync, as well as chaotic attractors. Our results rely heavily on the invariance of the flow for such systems under the action of the three-dimensional group of Möbius transformations, which preserve the unit disc, and the analysis of the possible limiting configurations for this group action.
Modeling the citation network by network cosmology.
Xie, Zheng; Ouyang, Zhenzheng; Zhang, Pengyuan; Yi, Dongyun; Kong, Dexing
2015-01-01
Citation between papers can be treated as a causal relationship. In addition, some citation networks have a number of similarities to the causal networks in network cosmology, e.g., the similar in-and out-degree distributions. Hence, it is possible to model the citation network using network cosmology. The casual network models built on homogenous spacetimes have some restrictions when describing some phenomena in citation networks, e.g., the hot papers receive more citations than other simultaneously published papers. We propose an inhomogenous causal network model to model the citation network, the connection mechanism of which well expresses some features of citation. The node growth trend and degree distributions of the generated networks also fit those of some citation networks well.
Modeling the citation network by network cosmology.
Directory of Open Access Journals (Sweden)
Zheng Xie
Full Text Available Citation between papers can be treated as a causal relationship. In addition, some citation networks have a number of similarities to the causal networks in network cosmology, e.g., the similar in-and out-degree distributions. Hence, it is possible to model the citation network using network cosmology. The casual network models built on homogenous spacetimes have some restrictions when describing some phenomena in citation networks, e.g., the hot papers receive more citations than other simultaneously published papers. We propose an inhomogenous causal network model to model the citation network, the connection mechanism of which well expresses some features of citation. The node growth trend and degree distributions of the generated networks also fit those of some citation networks well.
DEFF Research Database (Denmark)
Andersen, Kasper Winther
Three main topics are presented in this thesis. The first and largest topic concerns network modelling of functional Magnetic Resonance Imaging (fMRI) and Diffusion Weighted Imaging (DWI). In particular nonparametric Bayesian methods are used to model brain networks derived from resting state f...... for their ability to reproduce node clustering and predict unseen data. Comparing the models on whole brain networks, BCD and IRM showed better reproducibility and predictability than IDM, suggesting that resting state networks exhibit community structure. This also points to the importance of using models, which...... allow for complex interactions between all pairs of clusters. In addition, it is demonstrated how the IRM can be used for segmenting brain structures into functionally coherent clusters. A new nonparametric Bayesian network model is presented. The model builds upon the IRM and can be used to infer...
Artificial neural network modelling
Samarasinghe, Sandhya
2016-01-01
This book covers theoretical aspects as well as recent innovative applications of Artificial Neural networks (ANNs) in natural, environmental, biological, social, industrial and automated systems. It presents recent results of ANNs in modelling small, large and complex systems under three categories, namely, 1) Networks, Structure Optimisation, Robustness and Stochasticity 2) Advances in Modelling Biological and Environmental Systems and 3) Advances in Modelling Social and Economic Systems. The book aims at serving undergraduates, postgraduates and researchers in ANN computational modelling. .
Chaotic Simulated Annealing by A Neural Network Model with Transient Chaos
Chen, L; Chen, Luonan; Aihara, Kazuyuki
1997-01-01
We propose a neural network model with transient chaos, or a transiently chaotic neural network (TCNN) as an approximation method for combinatorial optimization problem, by introducing transiently chaotic dynamics into neural networks. Unlike conventional neural networks only with point attractors, the proposed neural network has richer and more flexible dynamics, so that it can be expected to have higher ability of searching for globally optimal or near-optimal solutions. A significant property of this model is that the chaotic neurodynamics is temporarily generated for searching and self-organizing, and eventually vanishes with autonomous decreasing of a bifurcation parameter corresponding to the "temperature" in usual annealing process. Therefore, the neural network gradually approaches, through the transient chaos, to dynamical structure similar to such conventional models as the Hopfield neural network which converges to a stable equilibrium point. Since the optimization process of the transiently chaoti...
A dynamic network model of the similia principle.
Bellavite, Paolo; Olioso, Debora; Marzotto, Marta; Moratti, Elisabetta; Conforti, Anita
2013-12-01
The use of drugs in high dilutions and the principle of similarity (or "similia") are two basic tenets of homeopathy. However, the plausibility of both is a subject of debate. Although several models have been proposed to explain the similia principle, it can be best understood and appreciated in the framework of complexity science and dynamic systems theory. This work applies a five-node Boolean network to show how self-organization and adaptation are relevant to rationalizing this traditional medical principle. Simulating the trajectories and attractors of the network system in the energy state-space provides a rudimentary and qualitative illustration of how targeted external perturbations can have pathological effects, leading to permanent, self-sustaining alterations. Similarly, changes that conversely enable the system to find its way back to the original state can induce therapeutic effects, by causing specific shifts in attractors when suitable conditions are satisfied. Extrapolating these mechanisms to homeopathy, we can envisage how major changes in the evolution of homeodynamic systems (and, eventually, healing of the entire body) can be achieved through carefully selected remedies that reproduce the whole symptom pattern of the ill state. Copyright © 2013 Elsevier Ltd. All rights reserved.
Algebraic model checking for Boolean gene regulatory networks.
Tran, Quoc-Nam
2011-01-01
We present a computational method in which modular and Groebner bases (GB) computation in Boolean rings are used for solving problems in Boolean gene regulatory networks (BN). In contrast to other known algebraic approaches, the degree of intermediate polynomials during the calculation of Groebner bases using our method will never grow resulting in a significant improvement in running time and memory space consumption. We also show how calculation in temporal logic for model checking can be done by means of our direct and efficient Groebner basis computation in Boolean rings. We present our experimental results in finding attractors and control strategies of Boolean networks to illustrate our theoretical arguments. The results are promising. Our algebraic approach is more efficient than the state-of-the-art model checker NuSMV on BNs. More importantly, our approach finds all solutions for the BN problems.
Moduli Backreaction on Inflationary Attractors
Roest, Diederik; Werkman, Pelle
2016-01-01
We investigate the interplay between moduli dynamics and inflation, focusing on the KKLT-scenario and cosmological $\\alpha$-attractors. General couplings between these sectors can induce a significant backreaction and potentially destroy the inflationary regime; however, we demonstrate that this generically does not happen for $\\alpha$-attractors. Depending on the details of the superpotential, the volume modulus can either be stable during the entire inflationary trajectory, or become tachyonic at some point and act as a waterfall field, resulting in a sudden end of inflation. In the latter case there is a universal supersymmetric minimum where the scalars end up, preventing the decompactification scenario. The observational predictions conform to the universal value of attractors, fully compatible with the Planck data, with possibly a capped number of e-folds due to the interplay with moduli.
Modeling network technology deployment rates with different network models
Chung, Yoo
2011-01-01
To understand the factors that encourage the deployment of a new networking technology, we must be able to model how such technology gets deployed. We investigate how network structure influences deployment with a simple deployment model and different network models through computer simulations. The results indicate that a realistic model of networking technology deployment should take network structure into account.
Boolean network model predicts cell cycle sequence of fission yeast.
Directory of Open Access Journals (Sweden)
Maria I Davidich
Full Text Available A Boolean network model of the cell-cycle regulatory network of fission yeast (Schizosaccharomyces Pombe is constructed solely on the basis of the known biochemical interaction topology. Simulating the model in the computer faithfully reproduces the known activity sequence of regulatory proteins along the cell cycle of the living cell. Contrary to existing differential equation models, no parameters enter the model except the structure of the regulatory circuitry. The dynamical properties of the model indicate that the biological dynamical sequence is robustly implemented in the regulatory network, with the biological stationary state G1 corresponding to the dominant attractor in state space, and with the biological regulatory sequence being a strongly attractive trajectory. Comparing the fission yeast cell-cycle model to a similar model of the corresponding network in S. cerevisiae, a remarkable difference in circuitry, as well as dynamics is observed. While the latter operates in a strongly damped mode, driven by external excitation, the S. pombe network represents an auto-excited system with external damping.
A Bio-Inspired QoS-Oriented Handover Model in Heterogeneous Wireless Networks
Directory of Open Access Journals (Sweden)
Daxin Tian
2014-01-01
Full Text Available We propose a bio-inspired model for making handover decision in heterogeneous wireless networks. It is based on an extended attractor selection model, which is biologically inspired by the self-adaptability and robustness of cellular response to the changes in dynamic environments. The goal of the proposed model is to guarantee multiple terminals’ satisfaction by meeting the QoS requirements of those terminals’ applications, and this model also attempts to ensure the fairness of network resources allocation, in the meanwhile, to enable the QoS-oriented handover decision adaptive to dynamic wireless environments. Some numerical simulations are preformed to validate our proposed bio-inspired model in terms of adaptive attractor selection in different noisy environments. And the results of some other simulations prove that the proposed handover scheme can adapt terminals’ network selection to the varying wireless environment and benefits the QoS of multiple terminal applications simultaneously and automatically. Furthermore, the comparative analysis also shows that the bio-inspired model outperforms the utility function based handover decision scheme in terms of ensuring a better QoS satisfaction and a better fairness of network resources allocation in dynamic heterogeneous wireless networks.
Approximating hidden chaotic attractors via parameter switching
Danca, Marius-F.; Kuznetsov, Nikolay V.; Chen, Guanrong
2018-01-01
In this paper, the problem of approximating hidden chaotic attractors of a general class of nonlinear systems is investigated. The parameter switching (PS) algorithm is utilized, which switches the control parameter within a given set of values with the initial value problem numerically solved. The PS-generated attractor approximates the attractor obtained by averaging the control parameter with the switched values, which represents the hidden chaotic attractor. The hidden chaotic attractors of a generalized Lorenz system and the Rabinovich-Fabrikant system are simulated for illustration.
Modeling Epidemic Network Failures
DEFF Research Database (Denmark)
Ruepp, Sarah Renée; Fagertun, Anna Manolova
2013-01-01
This paper presents the implementation of a failure propagation model for transport networks when multiple failures occur resulting in an epidemic. We model the Susceptible Infected Disabled (SID) epidemic model and validate it by comparing it to analytical solutions. Furthermore, we evaluate...
Generation and control of multi-scroll chaotic attractors in fractional order systems
Energy Technology Data Exchange (ETDEWEB)
Ahmad, Wajdi M. [Department of Electrical and Computer Engineering, University of Sharjah, P.O. Box 27272, Sharjah (United Arab Emirates)] e-mail: wajdi@sharjah.ac.ae
2005-08-01
The objective of this paper is twofold: on one hand we demonstrate the generation of multi-scroll attractors in fractional order chaotic systems. Then, we design state feedback controllers to eliminate chaos from the system trajectories. It is demonstrated that modifying the underlying nonlinearity of the fractional chaotic system results in the birth of multiple chaotic attractors, thus forming the so called multi-scroll attractors. The presence of chaotic behavior is evidenced by a positive largest Lyapunov exponent computed for the output time series. We investigate generation and control of multi-scroll attractors in two different models, both of which are fractional order and chaotic: an electronic oscillator, and a mechanical 'jerk' model. The current findings extend previously reported results on generation of n-scroll attractors from the domain of integer order to the domain of fractional order chaotic systems, and addresses the issue of controlling such chaotic behaviors. Our investigations are validated through numerical simulations.
Huang, Sui
2006-03-01
During development of multicellular organisms, multipotent stem and progenitor cells undergo a series of hierarchically organized ``somatic speciation'' processes consisting of binary branching events to achieve the diversity of discretely distinct differentiated cell types in the body. Current paradigms of genetic regulation of development do not explain this discreteness, nor the time-irreversibility of differentiation. Each cell contains the same genome with the same N (˜ 25,000) genes and each cell type k is characterized by a distinct stable gene activation pattern, expressed as the cell state vector Sk(t) = xk1(t) ,.. xki(t),.. xkN(t), where xki is the activation state of gene i in cell type k. Because genes are engaged in a network of mutual regulatory interactions, the movement of Sk(t) in the N-dimensional state space is highly constrained and the organism can only realize a tiny fraction of all possible configurations Sk. Then, the trajectories of Sk reflect the diversifying developmental paths and the mature cell types are high-dimensional attractor states. Experimental results based on gene expression profile measurements during blood cell differentiation using DNA microarrays are presented that support the old idea that cell types are attractors. This basic notion is extended to treat binary fate decisions as bifurcations in the dynamics of networks circuits. Specifically, during cell fate decision, the metastable progenitor attractor is destabilized, poising the cell on a `watershed state' so that it can stochastically or in response to deterministic perturbations enter either one of two alternative fates. Overall, the model and supporting experimental data provide an overarching conceptual framework that helps explain how the specifics of gene network architecture produces discreteness and robustness of cell types, allows for both stochastic and deterministic cell fate decision and ensures directionality of organismal development.
Ceresole, A; Gnecchi, A; Marrani, A
2009-01-01
We examine few simple extremal black hole configurations of N=8, d=4 supergravity. We first elucidate the relation between the BPS Reissner-Nordstrom black hole and the non-BPS Kaluza-Klein dyonic black hole. Their classical entropy, given by the Bekenstein-Hawking formula, can be reproduced via the attractor mechanism by suitable choices of symplectic frame. Then, we display the embedding of the axion-dilaton black hole into N=8 supergravity.
N. V., Kuznetsov; G. A., Leonov; M. V., Yuldashev; R. V., Yuldashev
2017-10-01
During recent years it has been shown that hidden oscillations, whose basin of attraction does not overlap with small neighborhoods of equilibria, may significantly complicate simulation of dynamical models, lead to unreliable results and wrong conclusions, and cause serious damage in drilling systems, aircrafts control systems, electromechanical systems, and other applications. This article provides a survey of various phase-locked loop based circuits (used in satellite navigation systems, optical, and digital communication), where such difficulties take place in MATLAB and SPICE. Considered examples can be used for testing other phase-locked loop based circuits and simulation tools, and motivate the development and application of rigorous analytical methods for the global analysis of phase-locked loop based circuits.
Generalized Attractor Points in Gauged Supergravity
Energy Technology Data Exchange (ETDEWEB)
Kachru, Shamit; /Stanford U., Phys. Dept. /SLAC; Kallosh, Renata; /Stanford U., Phys. Dept.; Shmakova, Marina; /KIPAC, Menlo Park /SLAC /Stanford U., Phys. Dept.
2011-08-15
The attractor mechanism governs the near-horizon geometry of extremal black holes in ungauged 4D N=2 supergravity theories and in Calabi-Yau compactifications of string theory. In this paper, we study a natural generalization of this mechanism to solutions of arbitrary 4D N=2 gauged supergravities. We define generalized attractor points as solutions of an ansatz which reduces the Einstein, gauge field, and scalar equations of motion to algebraic equations. The simplest generalized attractor geometries are characterized by non-vanishing constant anholonomy coefficients in an orthonormal frame. Basic examples include Lifshitz and Schroedinger solutions, as well as AdS and dS vacua. There is a generalized attractor potential whose critical points are the attractor points, and its extremization explains the algebraic nature of the equations governing both supersymmetric and non-supersymmetric attractors.
Place Cells, Grid Cells, Attractors, and Remapping
Directory of Open Access Journals (Sweden)
Kathryn J. Jeffery
2011-01-01
Full Text Available Place and grid cells are thought to use a mixture of external sensory information and internal attractor dynamics to organize their activity. Attractor dynamics may explain both why neurons react coherently following sufficiently large changes to the environment (discrete attractors and how firing patterns move smoothly from one representation to the next as an animal moves through space (continuous attractors. However, some features of place cell behavior, such as the sometimes independent responsiveness of place cells to environmental change (called “remapping”, seem hard to reconcile with attractor dynamics. This paper suggests that the explanation may be found in an anatomical separation of the two attractor systems coupled with a dynamic contextual modulation of the connection matrix between the two systems, with new learning being back-propagated into the matrix. Such a scheme could explain how place cells sometimes behave coherently and sometimes independently.
Models of educational institutions' networking
Shilova Olga Nikolaevna
2015-01-01
The importance of educational institutions' networking in modern sociocultural conditions and a definition of networking in education are presented in the article. The results of research levels, methods and models of educational institutions' networking are presented and substantially disclosed.
Multistability and hidden attractors in a relay system with hysteresis
DEFF Research Database (Denmark)
Zhusubaliyev, Zhanybai T.; Mosekilde, Erik; Rubanov, Vasily G.
2015-01-01
of the supply voltage. By investigating a four-dimensional model of the experimental relay system we finally show how a variety of hidden periodic, quasiperiodic and chaotic attractors arise, transform and disappear through different bifurcations. (C) 2015 Elsevier B.V. All rights reserved....
Attractor mechanism as a distillation procedure
Lévay, Péter; Szalay, Szilárd
2010-07-01
In a recent paper it was shown that for double extremal static spherical symmetric BPS black hole solutions in the STU model the well-known process of moduli stabilization at the horizon can be recast in a form of a distillation procedure of a three-qubit entangled state of a Greenberger-Horne-Zeilinger type. By studying the full flow in moduli space in this paper we investigate this distillation procedure in more detail. We introduce a three-qubit state with amplitudes depending on the conserved charges, the warp factor, and the moduli. We show that for the recently discovered non-BPS solutions it is possible to see how the distillation procedure unfolds itself as we approach the horizon. For the non-BPS seed solutions at the asymptotically Minkowski region we are starting with a three-qubit state having seven nonequal nonvanishing amplitudes and finally at the horizon we get a Greenberger-Horne-Zeilinger state with merely four nonvanishing ones with equal magnitudes. The magnitude of the surviving nonvanishing amplitudes is proportional to the macroscopic black hole entropy. A systematic study of such attractor states shows that their properties reflect the structure of the fake superpotential. We also demonstrate that when starting with the very special values for the moduli corresponding to flat directions the uniform structure at the horizon deteriorates due to errors generalizing the usual bit flips acting on the qubits of the attractor states.
Topological classification of scattered IFS-attractors
Nowak, Magdalena
2012-01-01
We study countable compact spaces as potential attractors of iterated function systems. We give an example of a convergent sequence in the real line which is not an IFS-attractor and for each countable ordinal $\\delta$ we show that a countable compact space of height $\\delta+1$ can be embedded in the real line so that it becomes the attractor of an IFS. On the other hand, we show that a scattered compact metric space of limit height is never an IFS-attractor.
Techniques for Modelling Network Security
Lech Gulbinovič
2012-01-01
The article compares modelling techniques for network security, including the theory of probability, Markov processes, Petri networks and application of stochastic activity networks. The paper introduces the advantages and disadvantages of the above proposed methods and accepts the method of modelling the network of stochastic activity as one of the most relevant. The stochastic activity network allows modelling the behaviour of the dynamic system where the theory of probability is inappropri...
Energy Technology Data Exchange (ETDEWEB)
Emenheiser, Jeffrey [Complexity Sciences Center, University of California, Davis, California 95616 (United States); Department of Physics, University of California, Davis, California 95616 (United States); Chapman, Airlie; Mesbahi, Mehran [William E. Boeing Department of Aeronautics and Astronautics, University of Washington, Seattle, Washington 98195 (United States); Pósfai, Márton [Complexity Sciences Center, University of California, Davis, California 95616 (United States); Department of Computer Science, University of California, Davis, California 95616 (United States); Crutchfield, James P. [Complexity Sciences Center, University of California, Davis, California 95616 (United States); Department of Physics, University of California, Davis, California 95616 (United States); Department of Computer Science, University of California, Davis, California 95616 (United States); Santa Fe Institute, Santa Fe, New Mexico 87501 (United States); D' Souza, Raissa M. [Complexity Sciences Center, University of California, Davis, California 95616 (United States); Department of Computer Science, University of California, Davis, California 95616 (United States); Santa Fe Institute, Santa Fe, New Mexico 87501 (United States); Department of Mechanical and Aerospace Engineering, University of California, Davis, California 95616 (United States)
2016-09-15
Following the long-lived qualitative-dynamics tradition of explaining behavior in complex systems via the architecture of their attractors and basins, we investigate the patterns of switching between distinct trajectories in a network of synchronized oscillators. Our system, consisting of nonlinear amplitude-phase oscillators arranged in a ring topology with reactive nearest-neighbor coupling, is simple and connects directly to experimental realizations. We seek to understand how the multiple stable synchronized states connect to each other in state space by applying Gaussian white noise to each of the oscillators' phases. To do this, we first analytically identify a set of locally stable limit cycles at any given coupling strength. For each of these attracting states, we analyze the effect of weak noise via the covariance matrix of deviations around those attractors. We then explore the noise-induced attractor switching behavior via numerical investigations. For a ring of three oscillators, we find that an attractor-switching event is always accompanied by the crossing of two adjacent oscillators' phases. For larger numbers of oscillators, we find that the distribution of times required to stochastically leave a given state falls off exponentially, and we build an attractor switching network out of the destination states as a coarse-grained description of the high-dimensional attractor-basin architecture.
Multi-field conformal cosmological attractors
Kallosh, Renata; Linde, Andrei
2013-12-01
We describe a broad class of multi-field inflationary models with spontaneously broken conformal invariance. It generalizes the recently discovered class of cosmological attractors with a single inflaton field [1]. In the new multi-field theories, just as in the single-field models of [1], the moduli space has a boundary (Kähler cone) in terms of the original homogeneous conformal variables. Upon spontaneous breaking of the conformal invariance and switching to the Einstein frame, this boundary moves to infinity in terms of the canonically normalized inflaton field. This results in the exponential stretching and flattening of scalar potentials in the vicinity of the boundary of the moduli space, which makes even very steep potentials perfectly suitable for the slow-roll inflation. These theories, just like their single-field versions, typically lead to inflationary perturbations with ns = 1-2/N and r = 12/N2, where N is the number of e-foldings.
Conductivities from attractors
Energy Technology Data Exchange (ETDEWEB)
Erdmenger, Johanna [Max-Planck-Institut für Physik (Werner-Heisenberg-Institut), Föhringer Ring 6, D-80805 Munich (Germany); Institut für Theoretische Physik und Astrophysik, Julius-Maximilians-Universität Würzburg, Am Hubland, 97074 Würzburg (Germany); Fernández, Daniel [Max-Planck-Institut für Physik (Werner-Heisenberg-Institut), Föhringer Ring 6, D-80805 Munich (Germany); Science Institute, University of Iceland, Dunhaga 3, 107 Reykjavík (Iceland); Goulart, Prieslei [Max-Planck-Institut für Physik (Werner-Heisenberg-Institut), Föhringer Ring 6, D-80805 Munich (Germany); Instituto de Física Teórica, UNESP-Universidade Estadual Paulista,R. Dr. Bento T. Ferraz 271, Bl. II, São Paulo 01140-070, SP (Brazil); Witkowski, Piotr [Max-Planck-Institut für Physik (Werner-Heisenberg-Institut), Föhringer Ring 6, D-80805 Munich (Germany)
2017-03-28
In the context of applications of the AdS/CFT correspondence to condensed matter physics, we compute conductivities for field theory duals of dyonic planar black holes in 3+1-dimensional Einstein-Maxwell-dilaton theories at zero temperature. We combine the near-horizon data obtained via Sen’s entropy function formalism with known expressions for conductivities. In this way we express the conductivities in terms of the extremal black hole charges. We apply our approach to three different examples for dilaton theories for which the background geometry is not known explicitly. For a constant scalar potential, the thermoelectric conductivity explicitly scales as α{sub xy}∼N{sup 3/2}, as expected. For the same model, our approach yields a finite result for the heat conductivity κ/T∝N{sup 3/2} even for T→0.
Modeling Network Interdiction Tasks
2015-09-17
allow professionals and families to stay in touch through voice or video calls. Power grids provide electricity to homes , offices, and recreational...instances using IBMr ILOGr CPLEXr Optimization Studio V12.6. For each instance, two solutions are deter- mined. First, the MNDP-a model is solved with no...three values: 0.25, 0.50, or 0.75. The DMP-a model is solved for the various random network instances using IBMr ILOGr CPLEXr Optimization Studio V12.6
Black Hole Attractors in Extended Supergravity
Ferrara, Sergio
2007-01-01
We review some aspects of the attractor mechanism for extremal black holes of (not necessarily supersymmetric) theories coupling Einstein gravity to scalars and Maxwell vector fields. Thence, we consider N=2 and N=8, d=4 supergravities, reporting some recent advances on the moduli spaces associated to BPS and non-BPS attractor solutions supported by charge orbits with non-compact stabilizers.
Attractors and basins of dynamical systems
Directory of Open Access Journals (Sweden)
Attila Dénes
2011-03-01
Full Text Available There are several programs for studying dynamical systems, but none of them is very useful for investigating basins and attractors of higher dimensional systems. Our goal in this paper is to show a new algorithm for finding even chaotic attractors and their basins for these systems. We present an implementation and examples for the use of this program.
Coevolutionary modeling in network formation
Al-Shyoukh, Ibrahim
2014-12-03
Network coevolution, the process of network topology evolution in feedback with dynamical processes over the network nodes, is a common feature of many engineered and natural networks. In such settings, the change in network topology occurs at a comparable time scale to nodal dynamics. Coevolutionary modeling offers the possibility to better understand how and why network structures emerge. For example, social networks can exhibit a variety of structures, ranging from almost uniform to scale-free degree distributions. While current models of network formation can reproduce these structures, coevolutionary modeling can offer a better understanding of the underlying dynamics. This paper presents an overview of recent work on coevolutionary models of network formation, with an emphasis on the following three settings: (i) dynamic flow of benefits and costs, (ii) transient link establishment costs, and (iii) latent preferential attachment.
Strange Attractor in Immunology of Tumor Growth
Voitikova, M
1997-01-01
The time delayed cytotoxic T-lymphocyte response on the tumor growth has been developed on the basis of discrete approximation (2-dimensional map). The growth kinetic has been described by logistic law with growth rate being the bifurcation parameter. Increase in the growth rate results in instability of the tumor state and causes period-doubling bifurcations in the immune+tumor system. For larger values of tumor growth rate a strange attractor has been observed. The model proposed is able to describe the metastable-state production when time series data of the immune state and the number of tumor cells are irregular and unpredictable. This metastatic disease may be caused not by exterior (medical) factors, but interior density dependent ones.
Do Network Models Just Model Networks? On The Applicability of Network-Oriented Modeling
Treur, J.; Shmueli, Erez
2017-01-01
In this paper for a Network-Oriented Modelling perspective based on temporal-causal networks it is analysed how generic and applicable it is as a general modelling approach and as a computational paradigm. This results in an answer to the question in the title different from: network models just
COSMOS-e{sup '}-soft Higgsotic attractors
Energy Technology Data Exchange (ETDEWEB)
Choudhury, Sayantan [Tata Institute of Fundamental Research, Department of Theoretical Physics, Mumbai (India)
2017-07-15
In this work, we have developed an elegant algorithm to study the cosmological consequences from a huge class of quantum field theories (i.e. superstring theory, supergravity, extra dimensional theory, modified gravity, etc.), which are equivalently described by soft attractors in the effective field theory framework. In this description we have restricted our analysis for two scalar fields - dilaton and Higgsotic fields minimally coupled with Einstein gravity, which can be generalized for any arbitrary number of scalar field contents with generalized non-canonical and non-minimal interactions. We have explicitly used R{sup 2} gravity, from which we have studied the attractor and non-attractor phases by exactly computing two point, three point and four point correlation functions from scalar fluctuations using the In-In (Schwinger-Keldysh) and the δN formalisms. We have also presented theoretical bounds on the amplitude, tilt and running of the primordial power spectrum, various shapes (equilateral, squeezed, folded kite or counter-collinear) of the amplitude as obtained from three and four point scalar functions, which are consistent with observed data. Also the results from two point tensor fluctuations and the field excursion formula are explicitly presented for the attractor and non-attractor phase. Further, reheating constraints, scale dependent behavior of the couplings and the dynamical solution for the dilaton and Higgsotic fields are also presented. New sets of consistency relations between two, three and four point observables are also presented, which shows significant deviation from canonical slow-roll models. Additionally, three possible theoretical proposals have presented to overcome the tachyonic instability at the time of late time acceleration. Finally, we have also provided the bulk interpretation from the three and four point scalar correlation functions for completeness. (orig.)
Pedicini, Marco; Barrenäs, Fredrik; Clancy, Trevor; Castiglione, Filippo; Hovig, Eivind; Kanduri, Kartiek; Santoni, Daniele; Benson, Mikael
2010-12-16
Two T helper (Th) cell subsets, namely Th1 and Th2 cells, play an important role in inflammatory diseases. The two subsets are thought to counter-regulate each other, and alterations in their balance result in different diseases. This paradigm has been challenged by recent clinical and experimental data. Because of the large number of genes involved in regulating Th1 and Th2 cells, assessment of this paradigm by modeling or experiments is difficult. Novel algorithms based on formal methods now permit the analysis of large gene regulatory networks. By combining these algorithms with in silico knockouts and gene expression microarray data from human T cells, we examined if the results were compatible with a counter-regulatory role of Th1 and Th2 cells. We constructed a directed network model of genes regulating Th1 and Th2 cells through text mining and manual curation. We identified four attractors in the network, three of which included genes that corresponded to Th0, Th1 and Th2 cells. The fourth attractor contained a mixture of Th1 and Th2 genes. We found that neither in silico knockouts of the Th1 and Th2 attractor genes nor gene expression microarray data from patients with immunological disorders and healthy subjects supported a counter-regulatory role of Th1 and Th2 cells. By combining network modeling with transcriptomic data analysis and in silico knockouts, we have devised a practical way to help unravel complex regulatory network topology and to increase our understanding of how network actions may differ in health and disease.
Dynamical modeling and analysis of large cellular regulatory networks
Bérenguier, D.; Chaouiya, C.; Monteiro, P. T.; Naldi, A.; Remy, E.; Thieffry, D.; Tichit, L.
2013-06-01
The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.
Dynamical modeling and analysis of large cellular regulatory networks.
Bérenguier, D; Chaouiya, C; Monteiro, P T; Naldi, A; Remy, E; Thieffry, D; Tichit, L
2013-06-01
The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.
Inflationary α -attractor cosmology: A global dynamical systems perspective
Alho, Artur; Uggla, Claes
2017-04-01
We study flat Friedmann-Lemaître-Robertson-Walker α -attractor E- and T-models by introducing a dynamical systems framework that yields regularized unconstrained field equations on two-dimensional compact state spaces. This results in both illustrative figures and a complete description of the entire solution spaces of these models, including asymptotics. In particular, it is shown that observational viability, which requires a sufficient number of e -folds, is associated with a particular solution given by a one-dimensional center manifold of a past asymptotic de Sitter state, where the center manifold structure also explains why nearby solutions are attracted to this "inflationary attractor solution." A center manifold expansion yields a description of the inflationary regime with arbitrary analytic accuracy, where the slow-roll approximation asymptotically describes the tangency condition of the center manifold at the asymptotic de Sitter state.
Linear response function for coupled hyperbolic attractors
Jiang, M
2004-01-01
We prove that when we take the thermodynamic limit in the context of coupled hyperbolic attractors, Ruelle's derivative formula of the SRB measure with respect to the underlying dynamical system remains true if one of the terms is interpreted appropriately.
Prototypes of attractors in four dimensions
DEFF Research Database (Denmark)
Baier, G.; Thomsen, Jesper Skovhus
1993-01-01
We study an extension of Duffing's equation to three variables with external forcing. Starting from a phase-space preserving chaos, three prototypes of chaotic attractors with a dimension larger than 3 can be derived. We provide examples of hyperchaos and a ''bifractal'' in a four-dimensional how....... The second-order Poincare cross section of hyperchaotic how is qualitatively equivalent to the first-order cross section of Ueda's attractor with the same forcing....
Modeling semiflexible polymer networks
Broedersz, Chase P.; MacKintosh, Fred C.
2014-01-01
Here, we provide an overview of theoretical approaches to semiflexible polymers and their networks. Such semiflexible polymers have large bending rigidities that can compete with the entropic tendency of a chain to crumple up into a random coil. Many studies on semiflexible polymers and their assemblies have been motivated by their importance in biology. Indeed, crosslinked networks of semiflexible polymers form a major structural component of tissue and living cells. Reconstituted networks o...
Quintessential inflation with α-attractors
Dimopoulos, Konstantinos; Owen, Charlotte
2017-06-01
A novel approach to quintessential inflation model building is studied, within the framework of α-attractors, motivated by supergravity theories. Inflationary observables are in excellent agreement with the latest CMB observations, while quintessence explains the dark energy observations without any fine-tuning. The model is kept intentionally minimal, avoiding the introduction of many degrees of freedom, couplings and mass scales. In stark contrast to ΛCDM, for natural values of the parameters, the model attains transient accelerated expansion, which avoids the future horizon problem, while it maintains the field displacement mildly sub-Planckian such that the flatness of the quintessential tail is not lifted by radiative corrections and violations of the equivalence principle (fifth force) are under control. In particular, the required value of the cosmological constant is near the eletroweak scale. Attention is paid to the reheating of the Universe, which avoids gravitino overproduction and respects nucleosynthesis constraints. Kination is treated in a model independent way. A spike in gravitational waves, due to kination, is found not to disturb nucleosynthesis as well.
Complex Networks in Psychological Models
Wedemann, R. S.; Carvalho, L. S. A. V. D.; Donangelo, R.
We develop schematic, self-organizing, neural-network models to describe mechanisms associated with mental processes, by a neurocomputational substrate. These models are examples of real world complex networks with interesting general topological structures. Considering dopaminergic signal-to-noise neuronal modulation in the central nervous system, we propose neural network models to explain development of cortical map structure and dynamics of memory access, and unify different mental processes into a single neurocomputational substrate. Based on our neural network models, neurotic behavior may be understood as an associative memory process in the brain, and the linguistic, symbolic associative process involved in psychoanalytic working-through can be mapped onto a corresponding process of reconfiguration of the neural network. The models are illustrated through computer simulations, where we varied dopaminergic modulation and observed the self-organizing emergent patterns at the resulting semantic map, interpreting them as different manifestations of mental functioning, from psychotic through to normal and neurotic behavior, and creativity.
Alternative Attractors of Shallow Lakes
Directory of Open Access Journals (Sweden)
Marten Scheffer
2001-01-01
Full Text Available Ponds and shallow lakes can be very clear with abundant submerged plants, or very turbid due to a high concentration of phytoplankton and suspended sediment particles. These strongly contrasting ecosystem states have been found to represent alternative attractors with distinct stabilizing feedback mechanisms. In the turbid state, the development of submerged vegetation is prevented by low underwater light levels. The unprotected sediment frequently is resuspended by wave action and by fish searching for food causing a further decrease of transparency. Since there are no plants that could serve as refuges, zooplankton is grazed down by fish to densities insufficient to control algal blooms. In contrast, the clear state in eutrophic shallow lakes is dominated by aquatic macrophytes. The submerged macrophytes prevent sediment resuspension, take up nutrients from the water, and provide a refuge for zooplankton against fish predation. These processes buffer the impacts of increased nutrient loads until they become too high. Consequently, the response of shallow lakes to eutrophication tends to be catastrophic rather than smooth, and various lakes switch back and forth abruptly between a clear and a turbid state repeatedly without obvious external forcing. Importantly, a switch from a turbid to a stable clear state often can be invoked by means of biomanipulation in the form of a temporary reduction of the fish stock.
Developing Personal Network Business Models
DEFF Research Database (Denmark)
Saugstrup, Dan; Henten, Anders
2006-01-01
on the 'state of the art' in the field of business modeling. Furthermore, the paper suggests three generic business models for PNs: a service oriented model, a self-organized model, and a combination model. Finally, examples of relevant services and applications in relation to three different cases......The aim of the paper is to examine the issue of business modeling in relation to personal networks, PNs. The paper builds on research performed on business models in the EU 1ST MAGNET1 project (My personal Adaptive Global NET). The paper presents the Personal Network concept and briefly reports...... are presented and analyzed in light of business modeling of PN....
A model of coauthorship networks
Zhou, Guochang; Li, Jianping; Xie, Zonglin
2017-10-01
A natural way of representing the coauthorship of authors is to use a generalization of graphs known as hypergraphs. A random geometric hypergraph model is proposed here to model coauthorship networks, which is generated by placing nodes on a region of Euclidean space randomly and uniformly, and connecting some nodes if the nodes satisfy particular geometric conditions. Two kinds of geometric conditions are designed to model the collaboration patterns of academic authorities and basic researches respectively. The conditions give geometric expressions of two causes of coauthorship: the authority and similarity of authors. By simulation and calculus, we show that the forepart of the degree distribution of the network generated by the model is mixture Poissonian, and the tail is power-law, which are similar to these of some coauthorship networks. Further, we show more similarities between the generated network and real coauthorship networks: the distribution of cardinalities of hyperedges, high clustering coefficient, assortativity, and small-world property
2016-11-09
standpoint remains more of an art than a science . Even when well executed, the ongoing evolution of the network may violate initial, security-critical design...from a security standpoint remains more of an art than a science . Even when well executed, the ongoing evolution of the network may violate initial...is outside the scope of this paper. As such, we focus on event probabilities. The output of the network porosity model is a stream of timestamped
Telecommunications network modelling, planning and design
Evans, Sharon
2003-01-01
Telecommunication Network Modelling, Planning and Design addresses sophisticated modelling techniques from the perspective of the communications industry and covers some of the major issues facing telecommunications network engineers and managers today. Topics covered include network planning for transmission systems, modelling of SDH transport network structures and telecommunications network design and performance modelling, as well as network costs and ROI modelling and QoS in 3G networks.
Campus network security model study
Zhang, Yong-ku; Song, Li-ren
2011-12-01
Campus network security is growing importance, Design a very effective defense hacker attacks, viruses, data theft, and internal defense system, is the focus of the study in this paper. This paper compared the firewall; IDS based on the integrated, then design of a campus network security model, and detail the specific implementation principle.
Udyavar, Akshata R; Wooten, David J; Hoeksema, Megan; Bansal, Mukesh; Califano, Andrea; Estrada, Lourdes; Schnell, Santiago; Irish, Jonathan M; Massion, Pierre P; Quaranta, Vito
2017-03-01
Small cell lung cancer (SCLC) is a devastating disease due to its propensity for early invasion and refractory relapse after initial treatment response. Although these aggressive traits have been associated with phenotypic heterogeneity, our understanding of this association remains incomplete. To fill this knowledge gap, we inferred a set of 33 transcription factors (TF) associated with gene signatures of the known neuroendocrine/epithelial (NE) and non-neuroendocrine/mesenchymal-like (ML) SCLC phenotypes. The topology of this SCLC TF network was derived from prior knowledge and was simulated using Boolean modeling. These simulations predicted that the network settles into attractors, or TF expression patterns, that correlate with NE or ML phenotypes, suggesting that TF network dynamics underlie the emergence of heterogeneous SCLC phenotypes. However, several cell lines and patient tumor specimens failed to correlate with either the NE or ML attractors. By flow cytometry, single cells within these cell lines simultaneously expressed surface markers of both NE and ML differentiation, confirming the existence of a "hybrid" phenotype. Upon exposure to standard-of-care cytotoxic drugs or epigenetic modifiers, NE and ML cell populations converged toward the hybrid state, suggesting possible escape from treatment. Our findings indicate that SCLC phenotypic heterogeneity can be specified dynamically by attractor states of a master regulatory TF network. Thus, SCLC heterogeneity may be best understood as states within an epigenetic landscape. Understanding phenotypic transitions within this landscape may provide insights to clinical applications. Cancer Res; 77(5); 1063-74. ©2016 AACR. ©2016 American Association for Cancer Research.
Guyon, Hervé; Falissard, Bruno; Kop, Jean-Luc
2017-01-01
Network Analysis is considered as a new method that challenges Latent Variable models in inferring psychological attributes. With Network Analysis, psychological attributes are derived from a complex system of components without the need to call on any latent variables. But the ontological status of psychological attributes is not adequately defined with Network Analysis, because a psychological attribute is both a complex system and a property emerging from this complex system. The aim of this article is to reappraise the legitimacy of latent variable models by engaging in an ontological and epistemological discussion on psychological attributes. Psychological attributes relate to the mental equilibrium of individuals embedded in their social interactions, as robust attractors within complex dynamic processes with emergent properties, distinct from physical entities located in precise areas of the brain. Latent variables thus possess legitimacy, because the emergent properties can be conceptualized and analyzed on the sole basis of their manifestations, without exploring the upstream complex system. However, in opposition with the usual Latent Variable models, this article is in favor of the integration of a dynamic system of manifestations. Latent Variables models and Network Analysis thus appear as complementary approaches. New approaches combining Latent Network Models and Network Residuals are certainly a promising new way to infer psychological attributes, placing psychological attributes in an inter-subjective dynamic approach. Pragmatism-realism appears as the epistemological framework required if we are to use latent variables as representations of psychological attributes.
Norman, Cameron D; Charnaw-Burger, Jill; Yip, Andrea L; Saad, Sam; Lombardo, Charlotte
2010-10-01
Complex problems require strategies to engage diverse perspectives in a focused, flexible manner, yet few options exist that fit with the current health care and public health system constraints. The Complex Network Electronic Knowledge Translation Research model (CoNEKTR) brings together complexity science, design thinking, social learning theories, systems thinking and eHealth technologies together to support a sustained engagement strategy for social innovation support and enhancing knowledge integration. The CoNEKTR model adapts elements of other face-to-face social organizing methods and combines it with social media and electronic networking tools to create a strategy for idea generation, refinement and social action. Drawing on complexity science, a series of networking and dialogue-enhancing activities are employed to bring diverse groups together, facilitate dialogue and create networks of networks. Ten steps and five core processes informed by complexity science have been developed through this model. Concepts such as emergence, attractors and feedback play an important role in facilitating networking among participants in the model. Using a constrained, focused approach informed by complexity science and using information technology, the CoNEKTR model holds promise as a means to enhance system capacity for knowledge generation, learning and action while working within the limitations faced by busy health professionals. © 2010 Blackwell Publishing Ltd.
Neural network modeling of emotion
Levine, Daniel S.
2007-03-01
This article reviews the history and development of computational neural network modeling of cognitive and behavioral processes that involve emotion. The exposition starts with models of classical conditioning dating from the early 1970s. Then it proceeds toward models of interactions between emotion and attention. Then models of emotional influences on decision making are reviewed, including some speculative (not and not yet simulated) models of the evolution of decision rules. Through the late 1980s, the neural networks developed to model emotional processes were mainly embodiments of significant functional principles motivated by psychological data. In the last two decades, network models of these processes have become much more detailed in their incorporation of known physiological properties of specific brain regions, while preserving many of the psychological principles from the earlier models. Most network models of emotional processes so far have dealt with positive and negative emotion in general, rather than specific emotions such as fear, joy, sadness, and anger. But a later section of this article reviews a few models relevant to specific emotions: one family of models of auditory fear conditioning in rats, and one model of induced pleasure enhancing creativity in humans. Then models of emotional disorders are reviewed. The article concludes with philosophical statements about the essential contributions of emotion to intelligent behavior and the importance of quantitative theories and models to the interdisciplinary enterprise of understanding the interactions of emotion, cognition, and behavior.
Black Hole Attractors and Pure Spinors
Energy Technology Data Exchange (ETDEWEB)
Hsu, Jonathan P.; Maloney, Alexander; Tomasiello, Alessandro
2006-02-21
We construct black hole attractor solutions for a wide class of N = 2 compactifications. The analysis is carried out in ten dimensions and makes crucial use of pure spinor techniques. This formalism can accommodate non-Kaehler manifolds as well as compactifications with flux, in addition to the usual Calabi-Yau case. At the attractor point, the charges fix the moduli according to {Sigma}f{sub k} = Im(C{Phi}), where {Phi} is a pure spinor of odd (even) chirality in IIB (A). For IIB on a Calabi-Yau, {Phi} = {Omega} and the equation reduces to the usual one. Methods in generalized complex geometry can be used to study solutions to the attractor equation.
Modeling semiflexible polymer networks
Broedersz, C.P.; MacKintosh, F.C.
2014-01-01
This is an overview of theoretical approaches to semiflexible polymers and their networks. Such semiflexible polymers have large bending rigidities that can compete with the entropic tendency of a chain to crumple up into a random coil. Many studies on semiflexible polymers and their assemblies have
Erice Lectures on Black Holes and Attractors
Ferrara, Sergio; Marrani, A
2008-01-01
These lectures give an elementary introduction to the subject of four dimensional black holes (BHs) in supergravity and the Attractor Mechanism in the extremal case. Some thermodynamical properties are discussed and some relevant formulae for the critical points of the BH effective potential are given. The case of Maxwell-Einstein-axion-dilaton (super)gravity is discussed in detail. Analogies among BH entropy and multipartite entanglement of qubits in quantum information theory, as well moduli spaces of extremal BH attractors, are also discussed.
Mobility Model for Tactical Networks
Rollo, Milan; Komenda, Antonín
In this paper a synthetic mobility model which represents behavior and movement pattern of heterogeneous units in disaster relief and battlefield scenarios is proposed. These operations usually take place in environment without preexisting communication infrastructure and units thus have to be connected by wireless communication network. Units cooperate to fulfill common tasks and communication network has to serve high amount of communication requests, especially data, voice and video stream transmissions. To verify features of topology control, routing and interaction protocols software simulations are usually used, because of their scalability, repeatability and speed. Behavior of all these protocols relies on the mobility model of the network nodes, which has to resemble real-life movement pattern. Proposed mobility model is goal-driven and provides support for various types of units, group mobility and realistic environment model with obstacles. Basic characteristics of the mobility model like node spatial distribution and average node degree were analyzed.
Pusuluri, Sai Teja
Energy landscapes are often used as metaphors for phenomena in biology, social sciences and finance. Different methods have been implemented in the past for the construction of energy landscapes. Neural network models based on spin glass physics provide an excellent mathematical framework for the construction of energy landscapes. This framework uses a minimal number of parameters and constructs the landscape using data from the actual phenomena. In the past neural network models were used to mimic the storage and retrieval process of memories (patterns) in the brain. With advances in the field now, these models are being used in machine learning, deep learning and modeling of complex phenomena. Most of the past literature focuses on increasing the storage capacity and stability of stored patterns in the network but does not study these models from a modeling perspective or an energy landscape perspective. This dissertation focuses on neural network models both from a modeling perspective and from an energy landscape perspective. I firstly show how the cellular interconversion phenomenon can be modeled as a transition between attractor states on an epigenetic landscape constructed using neural network models. The model allows the identification of a reaction coordinate of cellular interconversion by analyzing experimental and simulation time course data. Monte Carlo simulations of the model show that the initial phase of cellular interconversion is a Poisson process and the later phase of cellular interconversion is a deterministic process. Secondly, I explore the static features of landscapes generated using neural network models, such as sizes of basins of attraction and densities of metastable states. The simulation results show that the static landscape features are strongly dependent on the correlation strength and correlation structure between patterns. Using different hierarchical structures of the correlation between patterns affects the landscape features
Modelling freeway networks by hybrid stochastic models
Boel, R.; Mihaylova, L.
2004-01-01
Traffic flow on freeways is a nonlinear, many-particle phenomenon, with complex interactions between the vehicles. This paper presents a stochastic hybrid model of freeway traffic at a time scale and at a level of detail suitable for on-line flow estimation, for routing and ramp metering control. The model describes the evolution of continuous and discrete state variables. The freeway is considered as a network of components, each component representing a different section of the network. The...
Network model of security system
Directory of Open Access Journals (Sweden)
Adamczyk Piotr
2016-01-01
Full Text Available The article presents the concept of building a network security model and its application in the process of risk analysis. It indicates the possibility of a new definition of the role of the network models in the safety analysis. Special attention was paid to the development of the use of an algorithm describing the process of identifying the assets, vulnerability and threats in a given context. The aim of the article is to present how this algorithm reduced the complexity of the problem by eliminating from the base model these components that have no links with others component and as a result and it was possible to build a real network model corresponding to reality.
Attractor switching by neural control of chaotic neurodynamics.
Pasemann, F; Stollenwerk, N
1998-11-01
Chaotic attractors of discrete-time neural networks include infinitely many unstable periodic orbits, which can be stabilized by small parameter changes in a feedback control. Here we explore the control of unstable periodic orbits in a chaotic neural network with only two neurons. Analytically, a local control algorithm is derived on the basis of least squares minimization of the future deviations between actual system states and the desired orbit. This delayed control allows a consistent neural implementation, i.e. the same types of neurons are used for chaotic and controlling modules. The control signal is realized with one layer of neurons, allowing selective switching between different stabilized periodic orbits. For chaotic modules with noise, random switching between different periodic orbits is observed.
A Multilayer Model of Computer Networks
Shchurov, Andrey A.
2015-01-01
The fundamental concept of applying the system methodology to network analysis declares that network architecture should take into account services and applications which this network provides and supports. This work introduces a formal model of computer networks on the basis of the hierarchical multilayer networks. In turn, individual layers are represented as multiplex networks. The concept of layered networks provides conditions of top-down consistency of the model. Next, we determined the...
Using a Projector to Control BZ Drops: Attractor Selection by Pattern Entrainment
Tompkins, Nathan; Gonzalez Ochoa, Hector; Epstein, Irving; Fraden, Seth
2011-03-01
An emulsion consisting of drops in the 100 μ m diameter range containing the Belousov-Zhabotinsky (BZ) oscillatory chemicals can interact via diffusive inhibition and can be thought of as coupled phase oscillators. For weak coupling, a 2-D hexagonal lattice of these drops naturally develop regions of attractor states of sequential oscillations with phase differences of plus/minus 2 π / 3 much like the 2D anti-ferromagnetic Heisenberg spin model. An untrained system of these oscillators will develop unstable regions of both attractors that grow and compete. We use photo-initiated inhibition to optically entrain the system with a projected + 2 π / 3 pattern in an attempt to force the system into the + 2 π / 3 attractor state. However, both the left and right handed variants of the 2 π / 3 attractor are present in the entrained system. Defining an order parameter e i 3 ϕ allows for a quantitation of the purity of the 2 π / 3 attractor state in the final system.
Inflationary α-attractors and F(R)-gravity
Kuiroukidis, A.
2017-09-01
We consider a generic class of the so-called inflationary α-attractor models and compute the cosmological observables in the Einstein and Jordan frames of the corresponding F(R)-gravity theory. We find that the two sets coincide (to within errors from the use of the slow-roll approximation) for moderate and large values of the number of e-foldings N, which is the novel result of this paper, generalizing previous results on the subject (see e.g. Ref. 24). We briefly comment on the possible generalizations of these results.
Data modeling of network dynamics
Jaenisch, Holger M.; Handley, James W.; Faucheux, Jeffery P.; Harris, Brad
2004-01-01
This paper highlights Data Modeling theory and its use for text data mining as a graphical network search engine. Data Modeling is then used to create a real-time filter capable of monitoring network traffic down to the port level for unusual dynamics and changes in business as usual. This is accomplished in an unsupervised fashion without a priori knowledge of abnormal characteristics. Two novel methods for converting streaming binary data into a form amenable to graphics based search and change detection are introduced. These techniques are then successfully applied to 1999 KDD Cup network attack data log-on sessions to demonstrate that Data Modeling can detect attacks without prior training on any form of attack behavior. Finally, two new methods for data encryption using these ideas are proposed.
Thermal Network Modelling Handbook
1972-01-01
Thermal mathematical modelling is discussed in detail. A three-fold purpose was established: (1) to acquaint the new user with the terminology and concepts used in thermal mathematical modelling, (2) to present the more experienced and occasional user with quick formulas and methods for solving everyday problems, coupled with study cases which lend insight into the relationships that exist among the various solution techniques and parameters, and (3) to begin to catalog in an orderly fashion the common formulas which may be applied to automated conversational language techniques.
Directory of Open Access Journals (Sweden)
Zhonglin Wang
2014-01-01
Full Text Available A permanent magnet synchronous motor (PMSM model with smooth air gap and an exogenous periodic input is introduced and analyzed in this paper. With a simple mathematical transformation, a new nonautonomous Lorenz-like system is derived from this PMSM model, and this new three-dimensional system can display the complicated dynamics such as the chaotic attractor and the multiperiodic orbits by adjusting the frequency and amplitude of the exogenous periodic inputs. Moreover, this new system shows a double-deck chaotic attractor that is completely different from the four-wing chaotic attractors on topological structures, although the phase portrait shapes of the new attractor and the four-wing chaotic attractors are similar. The exotic phenomenon has been well demonstrated and investigated by numerical simulations, bifurcation analysis, and electronic circuit implementation.
Different routes to chaos via strange nonchaotic attractor in a quasiperiodically forced system
Venkatesan, A
1998-01-01
This paper focusses attention on the strange nonchaotic attractors (SNA) of a quasiperiodically forced dynamical system. Several routes, including the standard ones by which the appearance of strange nonchaotic attractors takes place, are shown to be realizable in the same model over a two parameters ($f-\\epsilon$) domain of the system. In particular, the transition through torus doubling to chaos via SNA, torus breaking to chaos via SNA and period doubling bifurcations of fractal torus are demonstrated with the aid of the two parameter ($f-\\epsilon$) phase diagram. More interestingly, in order to approach the strange nonchaotic attractor, the existence of several new bifurcations on the torus corresponding to the novel phenomenon of torus bubbling are described. Particularly, we point out the new routes to chaos, namely, (1) two frequency quasiperiodicity $\\to$ torus doubling $\\to$ torus merging followed by the gradual fractalization of torus to chaos, (2) two frequency quasiperiodicity $\\to$ torus doubling ...
Non-BPS Attractors in 5d and 6d Extended Supergravity
Andrianopoli, L.; Marrani, A.; Trigiante, M.
2008-01-01
We connect the attractor equations of a certain class of N=2, d=5 supergravities with their (1,0), d=6 counterparts, by relating the moduli space of non-BPS d=5 black hole/black string attractors to the moduli space of extremal dyonic black string d=6 non-BPS attractors. For d = 5 real special symmetric spaces and for N = 4,6,8 theories, we explicitly compute the flat directions of the black object potential corresponding to vanishing eigenvalues of its Hessian matrix. In the case N = 4, we study the relation to the (2,0), d=6 theory. We finally describe the embedding of the N=2, d=5 magic models in N=8, d=5 supergravity as well as the interconnection among the corresponding charge orbits.
Network Models of Mechanical Assemblies
Whitney, Daniel E.
Recent network research has sought to characterize complex systems with a number of statistical metrics, such as power law exponent (if any), clustering coefficient, community behavior, and degree correlation. Use of such metrics represents a choice of level of abstraction, a balance of generality and detailed accuracy. It has been noted that "social networks" consistently display clustering coefficients that are higher than those of random or generalized random networks, that they have small world properties such as short path lengths, and that they have positive degree correlations (assortative mixing). "Technological" or "non-social" networks display many of these characteristics except that they generally have negative degree correlations (disassortative mixing). [Newman 2003i] In this paper we examine network models of mechanical assemblies. Such systems are well understood functionally. We show that there is a cap on their average nodal degree and that they have negative degree correlations (disassortative mixing). We identify specific constraints arising from first principles, their structural patterns, and engineering practice that suggest why they have these properties. In addition, we note that their main "motif" is closed loops (as it is for electric and electronic circuits), a pattern that conventional network analysis does not detect but which is used by software intended to aid in the design of such systems.
Service entity network virtualization architecture and model
Jin, Xue-Guang; Shou, Guo-Chu; Hu, Yi-Hong; Guo, Zhi-Gang
2017-07-01
Communication network can be treated as a complex network carrying a variety of services and service can be treated as a network composed of functional entities. There are growing interests in multiplex service entities where individual entity and link can be used for different services simultaneously. Entities and their relationships constitute a service entity network. In this paper, we introduced a service entity network virtualization architecture including service entity network hierarchical model, service entity network model, service implementation and deployment of service entity networks. Service entity network oriented multiplex planning model were also studied and many of these multiplex models were characterized by a significant multiplex of the links or entities in different service entity network. Service entity networks were mapped onto shared physical resources by dynamic resource allocation controller. The efficiency of the proposed architecture was illustrated in a simulation environment that allows for comparative performance evaluation. The results show that, compared to traditional networking architecture, this architecture has a better performance.
Polymer networks: Modeling and applications
Masoud, Hassan
Polymer networks are an important class of materials that are ubiquitously found in natural, biological, and man-made systems. The complex mesoscale structure of these soft materials has made it difficult for researchers to fully explore their properties. In this dissertation, we introduce a coarse-grained computational model for permanently cross-linked polymer networks than can properly capture common properties of these materials. We use this model to study several practical problems involving dry and solvated networks. Specifically, we analyze the permeability and diffusivity of polymer networks under mechanical deformations, we examine the release of encapsulated solutes from microgel capsules during volume transitions, and we explore the complex tribological behavior of elastomers. Our simulations reveal that the network transport properties are defined by the network porosity and by the degree of network anisotropy due to mechanical deformations. In particular, the permeability of mechanically deformed networks can be predicted based on the alignment of network filaments that is characterized by a second order orientation tensor. Moreover, our numerical calculations demonstrate that responsive microcapsules can be effectively utilized for steady and pulsatile release of encapsulated solutes. We show that swollen gel capsules allow steady, diffusive release of nanoparticles and polymer chains, whereas gel deswelling causes burst-like discharge of solutes driven by an outward flow of the solvent initially enclosed within a shrinking capsule. We further demonstrate that this hydrodynamic release can be regulated by introducing rigid microscopic rods in the capsule interior. We also probe the effects of velocity, temperature, and normal load on the sliding of elastomers on smooth and corrugated substrates. Our friction simulations predict a bell-shaped curve for the dependence of the friction coefficient on the sliding velocity. Our simulations also illustrate
Target-Centric Network Modeling
DEFF Research Database (Denmark)
Mitchell, Dr. William L.; Clark, Dr. Robert M.
In Target-Centric Network Modeling: Case Studies in Analyzing Complex Intelligence Issues, authors Robert Clark and William Mitchell take an entirely new approach to teaching intelligence analysis. Unlike any other book on the market, it offers case study scenarios using actual intelligence......, and collaborative sharing in the process of creating a high-quality, actionable intelligence product. The case studies reflect the complexity of twenty-first century intelligence issues by dealing with multi-layered target networks that cut across political, economic, social, technological, and military issues....... Working through these cases, students will learn to manage and evaluate realistic intelligence accounts....
On some properties of the attractor equations
Energy Technology Data Exchange (ETDEWEB)
Bellucci, Stefano [INFN, Laboratori Nazionali di Frascati, Via Enrico Fermi 40, I-00044 Frascati (Italy)]. E-mail: stefano.bellucci@lnf.infn.it; Ferrara, Sergio [INFN, Laboratori Nazionali di Frascati, Via Enrico Fermi 40, I-00044 Frascati (Italy) and Physics Department, Theory Unit, CERN, CH-1211 Geneva 23 (Switzerland)]. E-mail: sergio.ferrara@cern.ch; Marrani, Alessio [INFN, Laboratori Nazionali di Frascati, Via Enrico Fermi 40, I-00044 Frascati (Italy) and Museo Storico della Fisica e Centro Studi e Ricerche ' Enrico Fermi' , Via Panisperna 89A, Compendio Viminale, I-00184 Rome (Italy)]. E-mail: marrani@lnf.infn.it
2006-04-06
We discuss the attractor equations of N=2, d=4 supergravity in an extremal black hole background with arbitrary electric and magnetic fluxes (charges) for field-strength two-forms. The effective one-dimensional Lagrangian in the radial (evolution) variable exhibits features of a spontaneously broken supergravity theory. Indeed, non-BPS attractor solutions correspond to the vanishing determinant of a (fermionic) gaugino mass matrix. The stability of these solutions is controlled by the data of the underlying special Kahler geometry of the vector multiplets' moduli space. Finally, after analyzing the 1-modulus case more in detail, we briefly comment on the choice of the Kahler gauge and its relevance for the recently discussed entropic functional.
CNEM: Cluster Based Network Evolution Model
Directory of Open Access Journals (Sweden)
Sarwat Nizamani
2015-01-01
Full Text Available This paper presents a network evolution model, which is based on the clustering approach. The proposed approach depicts the network evolution, which demonstrates the network formation from individual nodes to fully evolved network. An agglomerative hierarchical clustering method is applied for the evolution of network. In the paper, we present three case studies which show the evolution of the networks from the scratch. These case studies include: terrorist network of 9/11 incidents, terrorist network of WMD (Weapons Mass Destruction plot against France and a network of tweets discussing a topic. The network of 9/11 is also used for evaluation, using other social network analysis methods which show that the clusters created using the proposed model of network evolution are of good quality, thus the proposed method can be used by law enforcement agencies in order to further investigate the criminal networks
Terminal Attractor Optical Associative Memory for Pattern Recognition
Lin, Xin; Mori, Masahiko; Ohtsubo, Junji; Watanabe, Masanobu
2000-02-01
Optical associative memory with terminal attractor (TA) is proposed for pattern recognition. With numerical simulations, the optimal control parameter in the TA model associative memory is determined. The optimal control parameter is also used in an optical experiment. The capacity of TA model associative memory is also investigated based on the consistency between the stored pattern and the obtained equilibrium state in statistical thermodynamics. The results of numerical simulations indicate that the memory rate of the TA associative memory is greater than 0.35. We also compare TA model with the conventional Hopfield model, and show that the TA model can eliminate spurious states in the Hopfield model and increase recalling ability and memory capacity.
Biological transportation networks: Modeling and simulation
Albi, Giacomo
2015-09-15
We present a model for biological network formation originally introduced by Cai and Hu [Adaptation and optimization of biological transport networks, Phys. Rev. Lett. 111 (2013) 138701]. The modeling of fluid transportation (e.g., leaf venation and angiogenesis) and ion transportation networks (e.g., neural networks) is explained in detail and basic analytical features like the gradient flow structure of the fluid transportation network model and the impact of the model parameters on the geometry and topology of network formation are analyzed. We also present a numerical finite-element based discretization scheme and discuss sample cases of network formation simulations.
Supersymmetry of Bianchi attractors in gauged supergravity
Chakrabarty, Bidisha; Inbasekar, Karthik; Samanta, Rickmoy
2017-09-01
Bianchi attractors are near horizon geometries with homogeneous symmetries in spatial directions. We construct supersymmetric Bianchi attractors in N =2 ,d =4 , 5 gauged supergravity. In d =4 , we consider gauged supergravity coupled to vector and hypermultiplets. In d =5 , we consider gauged supergravity coupled to vector multiplets with a generic gauging of symmetries of the scalar manifold and the U (1 )R gauging of the R -symmetry. Analyzing the gaugino conditions, we show that when the fermionic shifts do not vanish, there are no supersymmetric Bianchi attractors. This is analogous to the known condition that for maximally supersymmetric solutions, all of the fermionic shifts must vanish. When the central charge satisfies an extremization condition, some of the fermionic shifts vanish and supersymmetry requires that the symmetries of the scalar manifold are not gauged. This allows supersymmetric Bianchi attractors sourced by massless gauge fields and a cosmological constant. In five dimensions in the Bianchi I class, we show that the anisotropic AdS3×R2 solution is 1 /2 BPS (Bogomol'nyi-Prasad-Sommerfield). We also construct a new class of 1 /2 BPS Bianchi III geometries labeled by the central charge. When the central charge takes a special value, the Bianchi III geometry reduces to the known AdS3×H2 solution. For the Bianchi V and VII classes, the radial spinor breaks all of supersymmetry. We briefly discuss the conditions for possible massive supersymmetric Bianchi solutions by generalizing the matter content to include tensor, hypermultiplets, and a generic gauging on the R -symmetry.
Energy landscapes of resting-state brain networks
Directory of Open Access Journals (Sweden)
Takamitsu eWatanabe
2014-02-01
Full Text Available During rest, the human brain performs essential functions such as memory maintenance, which are associated with resting-state brain networks (RSNs including the default-mode network (DMN and frontoparietal network (FPN. Previous studies based on spiking-neuron network models and their reduced models, as well as those based on imaging data, suggest that resting-state network activity can be captured as attractor dynamics, i.e., dynamics of the brain state toward an attractive state and transitions between different attractors. Here, we analyze the energy landscapes of the RSNs by applying the maximum entropy model, or equivalently the Ising spin model, to human RSN data. We use the previously estimated parameter values to define the energy landscape, and the disconnectivity graph method to estimate the number of local energy minima (equivalent to attractors in attractor dynamics, the basin size, and hierarchical relationships among the different local minima. In both of the DMN and FPN, low-energy local minima tended to have large basins. A majority of the network states belonged to a basin of one of a few local minima. Therefore, a small number of local minima constituted the backbone of each RSN. In the DMN, the energy landscape consisted of two groups of low-energy local minima that are separated by a relatively high energy barrier. Within each group, the activity patterns of the local minima were similar, and different minima were connected by relatively low energy barriers. In the FPN, all dominant energy were separated by relatively low energy barriers such that they formed a single coarse-grained global minimum. Our results indicate that multistable attractor dynamics may underlie the DMN, but not the FPN, and assist memory maintenance with different memory states.
d=4 attractors, effective horizon radius, and fake supergravity
Ferrara, Sergio; Gnecchi, Alessandra; Marrani, Alessio
2008-09-01
We consider extremal black hole attractors [both Bogomol’nyi-Prasad-Sommerfield (BPS) and non-BPS] for N=3 and N=5 supergravity in d=4 space-time dimensions. Attractors for matter-coupled N=3 theory are similar to attractors in N=2 supergravity minimally coupled to Abelian vector multiplets. On the other hand, N=5 attractors are similar to attractors in N=4 pure supergravity, and in such theories only (1)/(N)-BPS nondegenerate solutions exist. All the above-mentioned theories have a simple interpretation in the first order (fake supergravity) formalism. Furthermore, such theories do not have a d=5 uplift. Finally we comment on the duality relations among the attractor solutions of N≥2 supergravities sharing the same full bosonic sector.
d=4 Attractors, Effective Horizon Radius and Fake Supergravity
Ferrara, Sergio; Marrani, A
2008-01-01
We consider extremal black hole attractors (both BPS and non-BPS) for N=3 and N=5 supergravity in d=4 space-time dimensions. Attractors for matter-coupled N=3 theory are similar to attractors in N=2 supergravity minimally coupled to Abelian vector multiplets. On the other hand, N=5 attractors are similar to attractors in N=4 pure supergravity, and in such theories only 1\\N-BPS non-degenerate solutions exist. All the above mentioned theories have a simple interpretation in the first order (fake supergravity) formalism. Furthermore, such theories do not have a d=5 uplift. Finally we comment on the ``duality'' relations among the attractor solutions of N\\geq2 supergravities sharing the same full bosonic sector.
Mathematical Modelling Plant Signalling Networks
Muraro, D.
2013-01-01
During the last two decades, molecular genetic studies and the completion of the sequencing of the Arabidopsis thaliana genome have increased knowledge of hormonal regulation in plants. These signal transduction pathways act in concert through gene regulatory and signalling networks whose main components have begun to be elucidated. Our understanding of the resulting cellular processes is hindered by the complex, and sometimes counter-intuitive, dynamics of the networks, which may be interconnected through feedback controls and cross-regulation. Mathematical modelling provides a valuable tool to investigate such dynamics and to perform in silico experiments that may not be easily carried out in a laboratory. In this article, we firstly review general methods for modelling gene and signalling networks and their application in plants. We then describe specific models of hormonal perception and cross-talk in plants. This mathematical analysis of sub-cellular molecular mechanisms paves the way for more comprehensive modelling studies of hormonal transport and signalling in a multi-scale setting. © EDP Sciences, 2013.
Energy modelling in sensor networks
Directory of Open Access Journals (Sweden)
D. Schmidt
2007-06-01
Full Text Available Wireless sensor networks are one of the key enabling technologies for the vision of ambient intelligence. Energy resources for sensor nodes are very scarce. A key challenge is the design of energy efficient communication protocols. Models of the energy consumption are needed to accurately simulate the efficiency of a protocol or application design, and can also be used for automatic energy optimizations in a model driven design process. We propose a novel methodology to create models for sensor nodes based on few simple measurements. In a case study the methodology was used to create models for MICAz nodes. The models were integrated in a simulation environment as well as in a SDL runtime framework of a model driven design process. Measurements on a test application that was created automatically from an SDL specification showed an 80% reduction in energy consumption compared to an implementation without power saving strategies.
Split Attractor Flow in N=2 Minimally Coupled Supergravity
Ferrara, Sergio; Orazi, Emanuele
2011-01-01
We classify the stability region, marginal stability walls (MS) and split attractor flows for two-center extremal black holes in four-dimensional N=2 supergravity minimally coupled to n vector multiplets. It is found that two-center (continuous) charge orbits, classified by four duality invariants, either support a stability region ending on a MS wall or on an anti-marginal stability (AMS) wall, but not both. Therefore, the scalar manifold never contains both walls. Moreover, the BPS mass of the black hole composite (in its stability region) never vanishes in the scalar manifold. For these reasons, the "bound state transformation walls" phenomenon does not necessarily occur in these theories. The entropy of the flow trees also satisfies an inequality which forbids "entropy enigma" decays in these models. Finally, the non-BPS case, due to the existence of a "fake" superpotential satisfying a triangle inequality, can be treated as well, and it can be shown to exhibit a split attractor flow dynamics which, at le...
A new five-term simple chaotic attractor
Energy Technology Data Exchange (ETDEWEB)
Munmuangsaen, Buncha [Sirindhorn International Institute of Technology, Thammasat University, 131 M.5, Tivanont Road, Bangkadi, Muang, Pathum-Thani, 12000 (Thailand); Srisuchinwong, Banlue, E-mail: banlue@siit.tu.ac.t [Sirindhorn International Institute of Technology, Thammasat University, 131 M.5, Tivanont Road, Bangkadi, Muang, Pathum-Thani, 12000 (Thailand)
2009-10-26
A new chaotic attractor is presented with only five terms in three simple differential equations having fewer terms and simpler than those of existing seven-term or six-term chaotic attractors. Basic dynamical properties of the new attractor are demonstrated in terms of equilibria, Jacobian matrices, non-generalized Lorenz systems, Lyapunov exponents, a dissipative system, a chaotic waveform in time domain, a continuous frequency spectrum, Poincare maps, bifurcations and forming mechanisms of its compound structures.
Probabilistic logic modeling of network reliability for hybrid network architectures
Energy Technology Data Exchange (ETDEWEB)
Wyss, G.D.; Schriner, H.K.; Gaylor, T.R.
1996-10-01
Sandia National Laboratories has found that the reliability and failure modes of current-generation network technologies can be effectively modeled using fault tree-based probabilistic logic modeling (PLM) techniques. We have developed fault tree models that include various hierarchical networking technologies and classes of components interconnected in a wide variety of typical and atypical configurations. In this paper we discuss the types of results that can be obtained from PLMs and why these results are of great practical value to network designers and analysts. After providing some mathematical background, we describe the `plug-and-play` fault tree analysis methodology that we have developed for modeling connectivity and the provision of network services in several current- generation network architectures. Finally, we demonstrate the flexibility of the method by modeling the reliability of a hybrid example network that contains several interconnected ethernet, FDDI, and token ring segments. 11 refs., 3 figs., 1 tab.
Generalization performance of regularized neural network models
DEFF Research Database (Denmark)
Larsen, Jan; Hansen, Lars Kai
1994-01-01
Architecture optimization is a fundamental problem of neural network modeling. The optimal architecture is defined as the one which minimizes the generalization error. This paper addresses estimation of the generalization performance of regularized, complete neural network models. Regularization...
Plant Growth Models Using Artificial Neural Networks
Bubenheim, David
1997-01-01
In this paper, we descrive our motivation and approach to devloping models and the neural network architecture. Initial use of the artificial neural network for modeling the single plant process of transpiration is presented.
Introducing Synchronisation in Deterministic Network Models
DEFF Research Database (Denmark)
Schiøler, Henrik; Jessen, Jan Jakob; Nielsen, Jens Frederik D.
2006-01-01
The paper addresses performance analysis for distributed real time systems through deterministic network modelling. Its main contribution is the introduction and analysis of models for synchronisation between tasks and/or network elements. Typical patterns of synchronisation are presented leading...
Unity of Cosmological Inflation Attractors
Galante, Mario; Kallosh, Renata; Linde, Andrei; Roest, Diederik
2015-01-01
Recently, several broad classes of inflationary models have been discovered whose cosmological predictions, in excellent agreement with Planck, are stable with respect to significant modifications of the inflaton potential. Some classes of models are based on a nonminimal coupling to gravity. These
Modeling the Dynamics of Compromised Networks
Energy Technology Data Exchange (ETDEWEB)
Soper, B; Merl, D M
2011-09-12
Accurate predictive models of compromised networks would contribute greatly to improving the effectiveness and efficiency of the detection and control of network attacks. Compartmental epidemiological models have been applied to modeling attack vectors such as viruses and worms. We extend the application of these models to capture a wider class of dynamics applicable to cyber security. By making basic assumptions regarding network topology we use multi-group epidemiological models and reaction rate kinetics to model the stochastic evolution of a compromised network. The Gillespie Algorithm is used to run simulations under a worst case scenario in which the intruder follows the basic connection rates of network traffic as a method of obfuscation.
RMBNToolbox: random models for biochemical networks
Directory of Open Access Journals (Sweden)
Niemi Jari
2007-05-01
Full Text Available Abstract Background There is an increasing interest to model biochemical and cell biological networks, as well as to the computational analysis of these models. The development of analysis methodologies and related software is rapid in the field. However, the number of available models is still relatively small and the model sizes remain limited. The lack of kinetic information is usually the limiting factor for the construction of detailed simulation models. Results We present a computational toolbox for generating random biochemical network models which mimic real biochemical networks. The toolbox is called Random Models for Biochemical Networks. The toolbox works in the Matlab environment, and it makes it possible to generate various network structures, stoichiometries, kinetic laws for reactions, and parameters therein. The generation can be based on statistical rules and distributions, and more detailed information of real biochemical networks can be used in situations where it is known. The toolbox can be easily extended. The resulting network models can be exported in the format of Systems Biology Markup Language. Conclusion While more information is accumulating on biochemical networks, random networks can be used as an intermediate step towards their better understanding. Random networks make it possible to study the effects of various network characteristics to the overall behavior of the network. Moreover, the construction of artificial network models provides the ground truth data needed in the validation of various computational methods in the fields of parameter estimation and data analysis.
Network Bandwidth Utilization Forecast Model on High Bandwidth Network
Energy Technology Data Exchange (ETDEWEB)
Yoo, Wucherl; Sim, Alex
2014-07-07
With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2percent. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.
Network bandwidth utilization forecast model on high bandwidth networks
Energy Technology Data Exchange (ETDEWEB)
Yoo, Wuchert (William) [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States); Sim, Alex [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)
2015-03-30
With the increasing number of geographically distributed scientific collaborations and the scale of the data size growth, it has become more challenging for users to achieve the best possible network performance on a shared network. We have developed a forecast model to predict expected bandwidth utilization for high-bandwidth wide area network. The forecast model can improve the efficiency of resource utilization and scheduling data movements on high-bandwidth network to accommodate ever increasing data volume for large-scale scientific data applications. Univariate model is developed with STL and ARIMA on SNMP path utilization data. Compared with traditional approach such as Box-Jenkins methodology, our forecast model reduces computation time by 83.2%. It also shows resilience against abrupt network usage change. The accuracy of the forecast model is within the standard deviation of the monitored measurements.
3rd School on Attractor Mechanism
SAM 2007; The Attractor Mechanism: Proceedings of the INFN-Laboratori Nazionali di Frascati School 2007
2010-01-01
This book is based upon lectures presented in June 2007 at the INFN-Laboratori Nazionali di Frascati School on Attractor Mechanism, directed by Stefano Bellucci. The symposium included such prestigious lecturers as S. Ferrara, M. Gunaydin, P. Levay, and T. Mohaupt. All lectures were given at a pedagogical, introductory level, which is reflected in the specific "flavor" of this volume. The book also benefits from extensive discussions about, and related reworking of, the various contributions. In addition, this volume contains contributions originating from short presentations of rece
Free Energy, Value, and Attractors
Directory of Open Access Journals (Sweden)
Karl Friston
2012-01-01
Full Text Available It has been suggested recently that action and perception can be understood as minimising the free energy of sensory samples. This ensures that agents sample the environment to maximise the evidence for their model of the world, such that exchanges with the environment are predictable and adaptive. However, the free energy account does not invoke reward or cost-functions from reinforcement-learning and optimal control theory. We therefore ask whether reward is necessary to explain adaptive behaviour. The free energy formulation uses ideas from statistical physics to explain action in terms of minimising sensory surprise. Conversely, reinforcement-learning has its roots in behaviourism and engineering and assumes that agents optimise a policy to maximise future reward. This paper tries to connect the two formulations and concludes that optimal policies correspond to empirical priors on the trajectories of hidden environmental states, which compel agents to seek out the (valuable states they expect to encounter.
An acoustical model based monitoring network
Wessels, P.W.; Basten, T.G.H.; Eerden, F.J.M. van der
2010-01-01
In this paper the approach for an acoustical model based monitoring network is demonstrated. This network is capable of reconstructing a noise map, based on the combination of measured sound levels and an acoustic model of the area. By pre-calculating the sound attenuation within the network the
Novel Principles and Methods for Computing with Attractors
Directory of Open Access Journals (Sweden)
Horia-Nicolai Teodorescu
2001-08-01
Full Text Available We briefly analyze several issues related to the "computing with attractors" domain. We present a point of view on the topic and several new concepts, methods, and techniques for computing with attractors. We discuss applications where this method may prove useful. We answer several questions related to the usefulness of this computing paradigm.
An adaptive complex network model for brain functional networks.
Directory of Open Access Journals (Sweden)
Ignacio J Gomez Portillo
Full Text Available Brain functional networks are graph representations of activity in the brain, where the vertices represent anatomical regions and the edges their functional connectivity. These networks present a robust small world topological structure, characterized by highly integrated modules connected sparsely by long range links. Recent studies showed that other topological properties such as the degree distribution and the presence (or absence of a hierarchical structure are not robust, and show different intriguing behaviors. In order to understand the basic ingredients necessary for the emergence of these complex network structures we present an adaptive complex network model for human brain functional networks. The microscopic units of the model are dynamical nodes that represent active regions of the brain, whose interaction gives rise to complex network structures. The links between the nodes are chosen following an adaptive algorithm that establishes connections between dynamical elements with similar internal states. We show that the model is able to describe topological characteristics of human brain networks obtained from functional magnetic resonance imaging studies. In particular, when the dynamical rules of the model allow for integrated processing over the entire network scale-free non-hierarchical networks with well defined communities emerge. On the other hand, when the dynamical rules restrict the information to a local neighborhood, communities cluster together into larger ones, giving rise to a hierarchical structure, with a truncated power law degree distribution.
Modeling gene regulatory networks: A network simplification algorithm
Ferreira, Luiz Henrique O.; de Castro, Maria Clicia S.; da Silva, Fabricio A. B.
2016-12-01
Boolean networks have been used for some time to model Gene Regulatory Networks (GRNs), which describe cell functions. Those models can help biologists to make predictions, prognosis and even specialized treatment when some disturb on the GRN lead to a sick condition. However, the amount of information related to a GRN can be huge, making the task of inferring its boolean network representation quite a challenge. The method shown here takes into account information about the interactome to build a network, where each node represents a protein, and uses the entropy of each node as a key to reduce the size of the network, allowing the further inferring process to focus only on the main protein hubs, the ones with most potential to interfere in overall network behavior.
Antimonotonicity, Chaos and Multiple Attractors in a Novel Autonomous Jerk Circuit
Kengne, J.; Negou, A. Nguomkam; Njitacke, Z. T.
2017-06-01
We perform a systematic analysis of a system consisting of a novel jerk circuit obtained by replacing the single semiconductor diode of the original jerk circuit described in [Sprott, 2011a] with a pair of semiconductor diodes connected in antiparallel. The model is described by a continuous time three-dimensional autonomous system with hyperbolic sine nonlinearity, and may be viewed as a control system with nonlinear velocity feedback. The stability of the (unique) fixed point, the local bifurcations, and the discrete symmetries of the model equations are discussed. The complex behavior of the system is categorized in terms of its parameters by using bifurcation diagrams, Lyapunov exponents, time series, Poincaré sections, and basins of attraction. Antimonotonicity, period doubling bifurcation, symmetry restoring crises, chaos, and coexisting bifurcations are reported. More interestingly, one of the key contributions of this work is the finding of various regions in the parameters’ space in which the proposed (“elegant”) jerk circuit experiences the unusual phenomenon of multiple competing attractors (i.e. coexistence of four disconnected periodic and chaotic attractors). The basins of attraction of various coexisting attractors display complexity (i.e. fractal basins boundaries), thus suggesting possible jumps between coexisting attractors in experiment. Results of theoretical analyses are perfectly traced by laboratory experimental measurements. To the best of the authors’ knowledge, the jerk circuit/system introduced in this work represents the simplest electrical circuit (only a quadruple op amplifier chip without any analog multiplier chip) reported to date capable of four disconnected periodic and chaotic attractors for the same parameters setting.
The model of social crypto-network
Directory of Open Access Journals (Sweden)
Марк Миколайович Орел
2015-06-01
Full Text Available The article presents the theoretical model of social network with the enhanced mechanism of privacy policy. It covers the problems arising in the process of implementing the mentioned type of network. There are presented the methods of solving problems arising in the process of building the social network with privacy policy. It was built a theoretical model of social networks with enhanced information protection methods based on information and communication blocks
Entropy Characterization of Random Network Models
Directory of Open Access Journals (Sweden)
Pedro J. Zufiria
2017-06-01
Full Text Available This paper elaborates on the Random Network Model (RNM as a mathematical framework for modelling and analyzing the generation of complex networks. Such framework allows the analysis of the relationship between several network characterizing features (link density, clustering coefficient, degree distribution, connectivity, etc. and entropy-based complexity measures, providing new insight on the generation and characterization of random networks. Some theoretical and computational results illustrate the utility of the proposed framework.
The model of social crypto-network
Марк Миколайович Орел
2015-01-01
The article presents the theoretical model of social network with the enhanced mechanism of privacy policy. It covers the problems arising in the process of implementing the mentioned type of network. There are presented the methods of solving problems arising in the process of building the social network with privacy policy. It was built a theoretical model of social networks with enhanced information protection methods based on information and communication blocks
Extremal Black Hole and Flux Vacua Attractors
Bellucci, S; Kallosh, R; Marrani, A
2007-01-01
These lectures provide a pedagogical, introductory review of the so-called Attractor Mechanism (AM) at work in two different 4-dimensional frameworks: extremal black holes in N=2 supergravity and N=1 flux compactifications. In the first case, AM determines the stabilization of scalars at the black hole event horizon purely in terms of the electric and magnetic charges, whereas in the second context the AM is responsible for the stabilization of the universal axion-dilaton and of the (complex structure) moduli purely in terms of the RR and NSNS fluxes. Two equivalent approaches to AM, namely the so-called ``criticality conditions'' and ``New Attractor'' ones, are analyzed in detail in both frameworks, whose analogies and differences are discussed. Also a stringy analysis of both frameworks (relying on Hodge-decomposition techniques) is performed, respectively considering Type IIB compactified on $CY_{3}$ and its orientifolded version, associated with $\\frac{CY_{3}\\times T^{2}}{\\mathbb{Z}_{2}}$. Finally, recent...
Modeling Diagnostic Assessments with Bayesian Networks
Almond, Russell G.; DiBello, Louis V.; Moulder, Brad; Zapata-Rivera, Juan-Diego
2007-01-01
This paper defines Bayesian network models and examines their applications to IRT-based cognitive diagnostic modeling. These models are especially suited to building inference engines designed to be synchronous with the finer grained student models that arise in skills diagnostic assessment. Aspects of the theory and use of Bayesian network models…
Bayesian Network Webserver: a comprehensive tool for biological network modeling.
Ziebarth, Jesse D; Bhattacharya, Anindya; Cui, Yan
2013-11-01
The Bayesian Network Webserver (BNW) is a platform for comprehensive network modeling of systems genetics and other biological datasets. It allows users to quickly and seamlessly upload a dataset, learn the structure of the network model that best explains the data and use the model to understand relationships between network variables. Many datasets, including those used to create genetic network models, contain both discrete (e.g. genotype) and continuous (e.g. gene expression traits) variables, and BNW allows for modeling hybrid datasets. Users of BNW can incorporate prior knowledge during structure learning through an easy-to-use structural constraint interface. After structure learning, users are immediately presented with an interactive network model, which can be used to make testable hypotheses about network relationships. BNW, including a downloadable structure learning package, is available at http://compbio.uthsc.edu/BNW. (The BNW interface for adding structural constraints uses HTML5 features that are not supported by current version of Internet Explorer. We suggest using other browsers (e.g. Google Chrome or Mozilla Firefox) when accessing BNW). ycui2@uthsc.edu. Supplementary data are available at Bioinformatics online.
Symmetric Encryption Model Based on Chaotic Attractors
Directory of Open Access Journals (Sweden)
Edilma Isabel Amaya Barrera
2016-10-01
Conclusions: the algorithm is presented as an alternative to traditional algorithms demonstrating greater efficiency in the management of computing resources and raises the groundwork for continuing their study on the interested academic community due to the variety of dynamical systems nonlinear.
Woodward, Alexander; Froese, Tom; Ikegami, Takashi
2015-02-01
The state space of a conventional Hopfield network typically exhibits many different attractors of which only a small subset satisfies constraints between neurons in a globally optimal fashion. It has recently been demonstrated that combining Hebbian learning with occasional alterations of normal neural states avoids this problem by means of self-organized enlargement of the best basins of attraction. However, so far it is not clear to what extent this process of self-optimization is also operative in real brains. Here we demonstrate that it can be transferred to more biologically plausible neural networks by implementing a self-optimizing spiking neural network model. In addition, by using this spiking neural network to emulate a Hopfield network with Hebbian learning, we attempt to make a connection between rate-based and temporal coding based neural systems. Although further work is required to make this model more realistic, it already suggests that the efficacy of the self-optimizing process is independent from the simplifying assumptions of a conventional Hopfield network. We also discuss natural and cultural processes that could be responsible for occasional alteration of neural firing patterns in actual brains. Copyright © 2014 Elsevier Ltd. All rights reserved.
Aggregation algorithm towards large-scale Boolean network analysis
Zhao, Y.; Kim, J.; Filippone, M.
2013-01-01
The analysis of large-scale Boolean network dynamics is of great importance in understanding complex phenomena where systems are characterized by a large number of components. The computational cost to reveal the number of attractors and the period of each attractor increases exponentially as the number of nodes in the networks increases. This paper presents an efficient algorithm to find attractors for medium to large-scale networks. This is achieved by analyzing subnetworks within the netwo...
Object Oriented Modeling Of Social Networks
Zeggelink, Evelien P.H.; Oosten, Reinier van; Stokman, Frans N.
1996-01-01
The aim of this paper is to explain principles of object oriented modeling in the scope of modeling dynamic social networks. As such, the approach of object oriented modeling is advocated within the field of organizational research that focuses on networks. We provide a brief introduction into the
Bayesian estimation of the network autocorrelation model
Dittrich, D.; Leenders, R.T.A.J.; Mulder, J.
2017-01-01
The network autocorrelation model has been extensively used by researchers interested modeling social influence effects in social networks. The most common inferential method in the model is classical maximum likelihood estimation. This approach, however, has known problems such as negative bias of
Agent-based modeling and network dynamics
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...
Low-dimensional attractor for neural activity from local field potentials in optogenetic mice.
Oprisan, Sorinel A; Lynn, Patrick E; Tompa, Tamas; Lavin, Antonieta
2015-01-01
We used optogenetic mice to investigate possible nonlinear responses of the medial prefrontal cortex (mPFC) local network to light stimuli delivered by a 473 nm laser through a fiber optics. Every 2 s, a brief 10 ms light pulse was applied and the local field potentials (LFPs) were recorded with a 10 kHz sampling rate. The experiment was repeated 100 times and we only retained and analyzed data from six animals that showed stable and repeatable response to optical stimulations. The presence of nonlinearity in our data was checked using the null hypothesis that the data were linearly correlated in the temporal domain, but were random otherwise. For each trail, 100 surrogate data sets were generated and both time reversal asymmetry and false nearest neighbor (FNN) were used as discriminating statistics for the null hypothesis. We found that nonlinearity is present in all LFP data. The first 0.5 s of each 2 s LFP recording were dominated by the transient response of the networks. For each trial, we used the last 1.5 s of steady activity to measure the phase resetting induced by the brief 10 ms light stimulus. After correcting the LFPs for the effect of phase resetting, additional preprocessing was carried out using dendrograms to identify "similar" groups among LFP trials. We found that the steady dynamics of mPFC in response to light stimuli could be reconstructed in a three-dimensional phase space with topologically similar "8"-shaped attractors across different animals. Our results also open the possibility of designing a low-dimensional model for optical stimulation of the mPFC local network.
Using cell fate attractors to uncover transcriptional regulation of HL60 neutrophil differentiation
Directory of Open Access Journals (Sweden)
Kauffman Stuart A
2009-02-01
Full Text Available Abstract Background The process of cellular differentiation is governed by complex dynamical biomolecular networks consisting of a multitude of genes and their products acting in concert to determine a particular cell fate. Thus, a systems level view is necessary for understanding how a cell coordinates this process and for developing effective therapeutic strategies to treat diseases, such as cancer, in which differentiation plays a significant role. Theoretical considerations and recent experimental evidence support the view that cell fates are high dimensional attractor states of the underlying molecular networks. The temporal behavior of the network states progressing toward different cell fate attractors has the potential to elucidate the underlying molecular mechanisms governing differentiation. Results Using the HL60 multipotent promyelocytic leukemia cell line, we performed experiments that ultimately led to two different cell fate attractors by two treatments of varying dosage and duration of the differentiation agent all-trans-retinoic acid (ATRA. The dosage and duration combinations of the two treatments were chosen by means of flow cytometric measurements of CD11b, a well-known early differentiation marker, such that they generated two intermediate populations that were poised at the apparently same stage of differentiation. However, the population of one treatment proceeded toward the terminally differentiated neutrophil attractor while that of the other treatment reverted back toward the undifferentiated promyelocytic attractor. We monitored the gene expression changes in the two populations after their respective treatments over a period of five days and identified a set of genes that diverged in their expression, a subset of which promotes neutrophil differentiation while the other represses cell cycle progression. By employing promoter based transcription factor binding site analysis, we found enrichment in the set of divergent
Modeling data throughput on communication networks
Energy Technology Data Exchange (ETDEWEB)
Eldridge, J.M.
1993-11-01
New challenges in high performance computing and communications are driving the need for fast, geographically distributed networks. Applications such as modeling physical phenomena, interactive visualization, large data set transfers, and distributed supercomputing require high performance networking [St89][Ra92][Ca92]. One measure of a communication network`s performance is the time it takes to complete a task -- such as transferring a data file or displaying a graphics image on a remote monitor. Throughput, defined as the ratio of the number of useful data bits transmitted per the time required to transmit those bits, is a useful gauge of how well a communication system meets this performance measure. This paper develops and describes an analytical model of throughput. The model is a tool network designers can use to predict network throughput. It also provides insight into those parts of the network that act as a performance bottleneck.
A Chaotic Attractor in Delayed Memristive System
Directory of Open Access Journals (Sweden)
Lidan Wang
2012-01-01
Full Text Available Over the last three decades, theoretical design and circuitry implementation of various chaotic generators by simple electronic circuits have been a key subject of nonlinear science. In 2008, the successful development of memristor brings new activity for this research. Memristor is a new nanometre-scale passive circuit element, which possesses memory and nonlinear characteristics. This makes it have a unique charm to attract many researchers’ interests. In this paper, memristor, for the first time, is introduced in a delayed system to design a signal generator to produce chaotic behaviour. By replacing the nonlinear function with memristors in parallel, the memristor oscillator exhibits a chaotic attractor. The simulated results demonstrate that the performance is well predicted by the mathematical analysis and supports the viability of the design.
An infinite 3-D quasiperiodic lattice of chaotic attractors
Li, Chunbiao; Sprott, Julien Clinton
2018-02-01
A new dynamical system based on Thomas' system is described with infinitely many strange attractors on a 3-D spatial lattice. The mechanism for this multistability is associated with the disturbed offset boosting of sinusoidal functions with different spatial periods. Therefore, the initial condition for offset boosting can trigger a bifurcation, and consequently infinitely many attractors emerge simultaneously. One parameter of the sinusoidal nonlinearity can increase the frequency of the second order derivative of the variables rather than the first order and therefore increase the Lyapunov exponents accordingly. We show examples where the lattice is periodic and where it is quasiperiodic, that latter of which has an infinite variety of attractor types.
No fermionic wigs for BPS attractors in 5 dimensions
Energy Technology Data Exchange (ETDEWEB)
Gentile, Lorenzo G.C., E-mail: lgentile@pd.infn.it [DISIT, Università del Piemonte Orientale, via T. Michel, 11, Alessandria I-15120 (Italy); Dipartimento di Fisica “Galileo Galilei”, Università di Padova, via Marzolo 8, I-35131 Padova (Italy); INFN, Sezione di Padova, via Marzolo 8, I-35131 Padova (Italy); Grassi, Pietro A., E-mail: pgrassi@mfn.unipmn.it [DISIT, Università del Piemonte Orientale, via T. Michel, 11, Alessandria I-15120 (Italy); INFN – Gruppo Collegato di Alessandria – Sezione di Torino (Italy); Marrani, Alessio, E-mail: alessio.marrani@fys.kuleuven.be [Instituut voor Theoretische Fysica, KU Leuven, Celestijnenlaan 200D, B-3001 Leuven (Belgium); Mezzalira, Andrea, E-mail: andrea.mezzalira@ulb.ac.be [Physique Théorique et Mathématique, Université Libre de Bruxelles, C.P. 231, B-1050 Bruxelles (Belgium); Sabra, Wafic A., E-mail: ws00@aub.edu.lb [Centre for Advanced Mathematical Sciences and Physics Department, American University of Beirut (Lebanon)
2014-07-30
We analyze the fermionic wigging of 1/2-BPS (electric) extremal black hole attractors in N=2, D=5 ungauged Maxwell–Einstein supergravity theories, by exploiting anti-Killing spinors supersymmetry transformations. Regardless of the specific data of the real special geometry of the manifold defining the scalars of the vector multiplets, and differently from the D=4 case, we find that there are no corrections for the near-horizon attractor value of the scalar fields; an analogous result also holds for 1/2-BPS (magnetic) extremal black string. Thus, the attractor mechanism receives no fermionic corrections in D=5 (at least in the BPS sector)
Attractor dynamics in the hippocampal representation of the local environment.
Wills, Tom J; Lever, Colin; Cacucci, Francesca; Burgess, Neil; O'Keefe, John
2005-05-06
Memories are thought to be attractor states of neuronal representations, with the hippocampus a likely substrate for context-dependent episodic memories. However, such states have not been directly observed. For example, the hippocampal place cell representation of location was previously found to respond continuously to changes in environmental shape alone. We report that exposure to novel square and circular environments made of different materials creates attractor representations for both shapes: Place cells abruptly and simultaneously switch between representations as environmental shape changes incrementally. This enables study of attractor dynamics in a cognitive representation and may correspond to the formation of distinct contexts in context-dependent memory.
Breeding novel solutions in the brain: a model of Darwinian neurodynamics.
Szilágyi, András; Zachar, István; Fedor, Anna; de Vladar, Harold P; Szathmáry, Eörs
2016-01-01
Background: The fact that surplus connections and neurons are pruned during development is well established. We complement this selectionist picture by a proof-of-principle model of evolutionary search in the brain, that accounts for new variations in theory space. We present a model for Darwinian evolutionary search for candidate solutions in the brain. Methods: We combine known components of the brain - recurrent neural networks (acting as attractors), the action selection loop and implicit working memory - to provide the appropriate Darwinian architecture. We employ a population of attractor networks with palimpsest memory. The action selection loop is employed with winners-share-all dynamics to select for candidate solutions that are transiently stored in implicit working memory. Results: We document two processes: selection of stored solutions and evolutionary search for novel solutions. During the replication of candidate solutions attractor networks occasionally produce recombinant patterns, increasing variation on which selection can act. Combinatorial search acts on multiplying units (activity patterns) with hereditary variation and novel variants appear due to (i) noisy recall of patterns from the attractor networks, (ii) noise during transmission of candidate solutions as messages between networks, and, (iii) spontaneously generated, untrained patterns in spurious attractors. Conclusions: Attractor dynamics of recurrent neural networks can be used to model Darwinian search. The proposed architecture can be used for fast search among stored solutions (by selection) and for evolutionary search when novel candidate solutions are generated in successive iterations. Since all the suggested components are present in advanced nervous systems, we hypothesize that the brain could implement a truly evolutionary combinatorial search system, capable of generating novel variants.
Settings in Social Networks : a Measurement Model
Schweinberger, Michael; Snijders, Tom A.B.
2003-01-01
A class of statistical models is proposed that aims to recover latent settings structures in social networks. Settings may be regarded as clusters of vertices. The measurement model is based on two assumptions. (1) The observed network is generated by hierarchically nested latent transitive
Settings in social networks : A measurement model
Schweinberger, M; Snijders, TAB
2003-01-01
A class of statistical models is proposed that aims to recover latent settings structures in social networks. Settings may be regarded as clusters of vertices. The measurement model is based on two assumptions. (1) The observed network is generated by hierarchically nested latent transitive
Spinal Cord Injury Model System Information Network
... the UAB-SCIMS Contact the UAB-SCIMS UAB Spinal Cord Injury Model System Newly Injured Health Daily Living Consumer ... Information Network The University of Alabama at Birmingham Spinal Cord Injury Model System (UAB-SCIMS) maintains this Information Network ...
Radio Channel Modeling in Body Area Networks
An, L.; Bentum, Marinus Jan; Meijerink, Arjan; Scanlon, W.G.
2009-01-01
A body area network (BAN) is a network of bodyworn or implanted electronic devices, including wireless sensors which can monitor body parameters or to de- tect movements. One of the big challenges in BANs is the propagation channel modeling. Channel models can be used to understand wave propagation
Radio channel modeling in body area networks
An, L.; Bentum, Marinus Jan; Meijerink, Arjan; Scanlon, W.G.
2010-01-01
A body area network (BAN) is a network of bodyworn or implanted electronic devices, including wireless sensors which can monitor body parameters or to detect movements. One of the big challenges in BANs is the propagation channel modeling. Channel models can be used to understand wave propagation in
Network interconnections: an architectural reference model
Butscher, B.; Lenzini, L.; Morling, R.; Vissers, C.A.; Popescu-Zeletin, R.; van Sinderen, Marten J.; Heger, D.; Krueger, G.; Spaniol, O.; Zorn, W.
1985-01-01
One of the major problems in understanding the different approaches in interconnecting networks of different technologies is the lack of reference to a general model. The paper develops the rationales for a reference model of network interconnection and focuses on the architectural implications for
Performance modeling of network data services
Energy Technology Data Exchange (ETDEWEB)
Haynes, R.A.; Pierson, L.G.
1997-01-01
Networks at major computational organizations are becoming increasingly complex. The introduction of large massively parallel computers and supercomputers with gigabyte memories are requiring greater and greater bandwidth for network data transfers to widely dispersed clients. For networks to provide adequate data transfer services to high performance computers and remote users connected to them, the networking components must be optimized from a combination of internal and external performance criteria. This paper describes research done at Sandia National Laboratories to model network data services and to visualize the flow of data from source to sink when using the data services.
Learning Bayesian Network Model Structure from Data
National Research Council Canada - National Science Library
Margaritis, Dimitris
2003-01-01
In this thesis I address the important problem of the determination of the structure of directed statistical models, with the widely used class of Bayesian network models as a concrete vehicle of my ideas...
NC truck network model development research.
2008-09-01
This research develops a validated prototype truck traffic network model for North Carolina. The model : includes all counties and metropolitan areas of North Carolina and major economic areas throughout the : U.S. Geographic boundaries, population a...
Network models in economics and finance
Pardalos, Panos; Rassias, Themistocles
2014-01-01
Using network models to investigate the interconnectivity in modern economic systems allows researchers to better understand and explain some economic phenomena. This volume presents contributions by known experts and active researchers in economic and financial network modeling. Readers are provided with an understanding of the latest advances in network analysis as applied to economics, finance, corporate governance, and investments. Moreover, recent advances in market network analysis that focus on influential techniques for market graph analysis are also examined. Young researchers will find this volume particularly useful in facilitating their introduction to this new and fascinating field. Professionals in economics, financial management, various technologies, and network analysis, will find the network models presented in this book beneficial in analyzing the interconnectivity in modern economic systems.
Modelling the structure of complex networks
DEFF Research Database (Denmark)
Herlau, Tue
networks has been independently studied as mathematical objects in their own right. As such, there has been both an increased demand for statistical methods for complex networks as well as a quickly growing mathematical literature on the subject. In this dissertation we explore aspects of modelling complex......A complex network is a systems in which a discrete set of units interact in a quantifiable manner. Representing systems as complex networks have become increasingly popular in a variety of scientific fields including biology, social sciences and economics. Parallel to this development complex....... The next chapters will treat some of the various symmetries, representer theorems and probabilistic structures often deployed in the modelling complex networks, the construction of sampling methods and various network models. The introductory chapters will serve to provide context for the included written...
A Network Formation Model Based on Subgraphs
Chandrasekhar, Arun
2016-01-01
We develop a new class of random-graph models for the statistical estimation of network formation that allow for substantial correlation in links. Various subgraphs (e.g., links, triangles, cliques, stars) are generated and their union results in a network. We provide estimation techniques for recovering the rates at which the underlying subgraphs were formed. We illustrate the models via a series of applications including testing for incentives to form cross-caste relationships in rural India, testing to see whether network structure is used to enforce risk-sharing, testing as to whether networks change in response to a community's exposure to microcredit, and show that these models significantly outperform stochastic block models in matching observed network characteristics. We also establish asymptotic properties of the models and various estimators, which requires proving a new Central Limit Theorem for correlated random variables.
Attractors for stochastic strongly damped plate equations with additive noise
Directory of Open Access Journals (Sweden)
Wenjun Ma
2013-04-01
Full Text Available We study the asymptotic behavior of stochastic plate equations with homogeneous Neumann boundary conditions. We show the existence of an attractor for the random dynamical system associated with the equation.
Gossip spread in social network Models
Johansson, Tobias
2017-04-01
Gossip almost inevitably arises in real social networks. In this article we investigate the relationship between the number of friends of a person and limits on how far gossip about that person can spread in the network. How far gossip travels in a network depends on two sets of factors: (a) factors determining gossip transmission from one person to the next and (b) factors determining network topology. For a simple model where gossip is spread among people who know the victim it is known that a standard scale-free network model produces a non-monotonic relationship between number of friends and expected relative spread of gossip, a pattern that is also observed in real networks (Lind et al., 2007). Here, we study gossip spread in two social network models (Toivonen et al., 2006; Vázquez, 2003) by exploring the parameter space of both models and fitting them to a real Facebook data set. Both models can produce the non-monotonic relationship of real networks more accurately than a standard scale-free model while also exhibiting more realistic variability in gossip spread. Of the two models, the one given in Vázquez (2003) best captures both the expected values and variability of gossip spread.
Synergistic effects in threshold models on networks
Juul, Jonas S.; Porter, Mason A.
2018-01-01
Network structure can have a significant impact on the propagation of diseases, memes, and information on social networks. Different types of spreading processes (and other dynamical processes) are affected by network architecture in different ways, and it is important to develop tractable models of spreading processes on networks to explore such issues. In this paper, we incorporate the idea of synergy into a two-state ("active" or "passive") threshold model of social influence on networks. Our model's update rule is deterministic, and the influence of each meme-carrying (i.e., active) neighbor can—depending on a parameter—either be enhanced or inhibited by an amount that depends on the number of active neighbors of a node. Such a synergistic system models social behavior in which the willingness to adopt either accelerates or saturates in a way that depends on the number of neighbors who have adopted that behavior. We illustrate that our model's synergy parameter has a crucial effect on system dynamics, as it determines whether degree-k nodes are possible or impossible to activate. We simulate synergistic meme spreading on both random-graph models and networks constructed from empirical data. Using a heterogeneous mean-field approximation, which we derive under the assumption that a network is locally tree-like, we are able to determine which synergy-parameter values allow degree-k nodes to be activated for many networks and for a broad family of synergistic models.
Optimized null model for protein structure networks.
Milenković, Tijana; Filippis, Ioannis; Lappe, Michael; Przulj, Natasa
2009-06-26
Much attention has recently been given to the statistical significance of topological features observed in biological networks. Here, we consider residue interaction graphs (RIGs) as network representations of protein structures with residues as nodes and inter-residue interactions as edges. Degree-preserving randomized models have been widely used for this purpose in biomolecular networks. However, such a single summary statistic of a network may not be detailed enough to capture the complex topological characteristics of protein structures and their network counterparts. Here, we investigate a variety of topological properties of RIGs to find a well fitting network null model for them. The RIGs are derived from a structurally diverse protein data set at various distance cut-offs and for different groups of interacting atoms. We compare the network structure of RIGs to several random graph models. We show that 3-dimensional geometric random graphs, that model spatial relationships between objects, provide the best fit to RIGs. We investigate the relationship between the strength of the fit and various protein structural features. We show that the fit depends on protein size, structural class, and thermostability, but not on quaternary structure. We apply our model to the identification of significantly over-represented structural building blocks, i.e., network motifs, in protein structure networks. As expected, choosing geometric graphs as a null model results in the most specific identification of motifs. Our geometric random graph model may facilitate further graph-based studies of protein conformation space and have important implications for protein structure comparison and prediction. The choice of a well-fitting null model is crucial for finding structural motifs that play an important role in protein folding, stability and function. To our knowledge, this is the first study that addresses the challenge of finding an optimized null model for RIGs, by
Optimized null model for protein structure networks.
Directory of Open Access Journals (Sweden)
Tijana Milenković
Full Text Available Much attention has recently been given to the statistical significance of topological features observed in biological networks. Here, we consider residue interaction graphs (RIGs as network representations of protein structures with residues as nodes and inter-residue interactions as edges. Degree-preserving randomized models have been widely used for this purpose in biomolecular networks. However, such a single summary statistic of a network may not be detailed enough to capture the complex topological characteristics of protein structures and their network counterparts. Here, we investigate a variety of topological properties of RIGs to find a well fitting network null model for them. The RIGs are derived from a structurally diverse protein data set at various distance cut-offs and for different groups of interacting atoms. We compare the network structure of RIGs to several random graph models. We show that 3-dimensional geometric random graphs, that model spatial relationships between objects, provide the best fit to RIGs. We investigate the relationship between the strength of the fit and various protein structural features. We show that the fit depends on protein size, structural class, and thermostability, but not on quaternary structure. We apply our model to the identification of significantly over-represented structural building blocks, i.e., network motifs, in protein structure networks. As expected, choosing geometric graphs as a null model results in the most specific identification of motifs. Our geometric random graph model may facilitate further graph-based studies of protein conformation space and have important implications for protein structure comparison and prediction. The choice of a well-fitting null model is crucial for finding structural motifs that play an important role in protein folding, stability and function. To our knowledge, this is the first study that addresses the challenge of finding an optimized null model
Black-Scholes theory for an underlying with multiple attractors
Herzberg, Frederik
2008-01-01
A valuation theory for derivatives on an underlying that is subject to multiple attractors is proposed, the economic justification being attraction-adjusted hedging. In non-critical regions -- outside the boundaries of the attractor regions -- a European option price can be viewed as a derivative on an underlying with a mean-reverting law, such as a commodity price, however with a different payoff function.
Structure of attractors and estimates of their fractal dimension
Matheus Cheque Bortolan
2013-01-01
This work is dedicated to the study of the structure of attractors of dynamical systems with the objective of estimating their fractal dimension. First we study the case of exponential global attractors of some generalized gradient-like semigroups in a general Banach space, and estimate their fractal dimension in terms of themaximumof the dimension of the local unstablemanifolds of the isolated invariant sets, Lipschitz properties of the semigroup and rate of exponential attraction. We also g...
Towards Reproducible Descriptions of Neuronal Network Models
Nordlie, Eilen; Gewaltig, Marc-Oliver; Plesser, Hans Ekkehard
2009-01-01
Progress in science depends on the effective exchange of ideas among scientists. New ideas can be assessed and criticized in a meaningful manner only if they are formulated precisely. This applies to simulation studies as well as to experiments and theories. But after more than 50 years of neuronal network simulations, we still lack a clear and common understanding of the role of computational models in neuroscience as well as established practices for describing network models in publications. This hinders the critical evaluation of network models as well as their re-use. We analyze here 14 research papers proposing neuronal network models of different complexity and find widely varying approaches to model descriptions, with regard to both the means of description and the ordering and placement of material. We further observe great variation in the graphical representation of networks and the notation used in equations. Based on our observations, we propose a good model description practice, composed of guidelines for the organization of publications, a checklist for model descriptions, templates for tables presenting model structure, and guidelines for diagrams of networks. The main purpose of this good practice is to trigger a debate about the communication of neuronal network models in a manner comprehensible to humans, as opposed to machine-readable model description languages. We believe that the good model description practice proposed here, together with a number of other recent initiatives on data-, model-, and software-sharing, may lead to a deeper and more fruitful exchange of ideas among computational neuroscientists in years to come. We further hope that work on standardized ways of describing—and thinking about—complex neuronal networks will lead the scientific community to a clearer understanding of high-level concepts in network dynamics, and will thus lead to deeper insights into the function of the brain. PMID:19662159
Towards reproducible descriptions of neuronal network models.
Directory of Open Access Journals (Sweden)
Eilen Nordlie
2009-08-01
Full Text Available Progress in science depends on the effective exchange of ideas among scientists. New ideas can be assessed and criticized in a meaningful manner only if they are formulated precisely. This applies to simulation studies as well as to experiments and theories. But after more than 50 years of neuronal network simulations, we still lack a clear and common understanding of the role of computational models in neuroscience as well as established practices for describing network models in publications. This hinders the critical evaluation of network models as well as their re-use. We analyze here 14 research papers proposing neuronal network models of different complexity and find widely varying approaches to model descriptions, with regard to both the means of description and the ordering and placement of material. We further observe great variation in the graphical representation of networks and the notation used in equations. Based on our observations, we propose a good model description practice, composed of guidelines for the organization of publications, a checklist for model descriptions, templates for tables presenting model structure, and guidelines for diagrams of networks. The main purpose of this good practice is to trigger a debate about the communication of neuronal network models in a manner comprehensible to humans, as opposed to machine-readable model description languages. We believe that the good model description practice proposed here, together with a number of other recent initiatives on data-, model-, and software-sharing, may lead to a deeper and more fruitful exchange of ideas among computational neuroscientists in years to come. We further hope that work on standardized ways of describing--and thinking about--complex neuronal networks will lead the scientific community to a clearer understanding of high-level concepts in network dynamics, and will thus lead to deeper insights into the function of the brain.
Characterization and Modeling of Network Traffic
DEFF Research Database (Denmark)
Shawky, Ahmed; Bergheim, Hans; Ragnarsson, Olafur
2011-01-01
This paper attempts to characterize and model backbone network traffic, using a small number of statistics. In order to reduce cost and processing power associated with traffic analysis. The parameters affecting the behaviour of network traffic are investigated and the choice is that inter......-arrival time, IP addresses, port numbers and transport protocol are the only necessary parameters to model network traffic behaviour. In order to recreate this behaviour, a complex model is needed which is able to recreate traffic behaviour based on a set of statistics calculated from the parameters values....... The model investigates the traffic generation mechanisms, and grouping traffic into flows and applications....
Modeling, Optimization & Control of Hydraulic Networks
DEFF Research Database (Denmark)
Tahavori, Maryamsadat
2014-01-01
in water network is pressure management. By reducing the pressure in the water network, the leakage can be reduced significantly. Also it reduces the amount of energy consumption in water networks. The primary purpose of this work is to develop control algorithms for pressure control in water supply....... The nonlinear network model is derived based on the circuit theory. A suitable projection is used to reduce the state vector and to express the model in standard state-space form. Then, the controllability of nonlinear nonaffine hydraulic networks is studied. The Lie algebra-based controllability matrix is used...... to solve nonlinear optimal control problems. In the water supply system model, the hydraulic resistance of the valve is estimated by real data and it is considered to be a disturbance. The disturbance in our system is updated every 24 hours based on the amount of water usage by consumers every day. Model...
How Anatomy Shapes Dynamics: A Semi-Analytical Study of the Brain at Rest by a Simple Spin Model
Directory of Open Access Journals (Sweden)
Gustavo eDeco
2012-09-01
Full Text Available Resting state networks show a surprisingly coherent and robust spatiotemporal organization. Previous theoretical studies demonstrated that these patterns can be understood as emergent on the basis of the underlying neuroanatomical connectivity skeleton. Integrating the biologically realistic DTI/DSI based neuroanatomical connectivity into a brain model of Ising spin dynamics, we found the presence of latent ghost multi-stable attractors, which can be studied analytically. The multistable attractor landscape defines a functionally meaningful dynamic repertoire of the brain network that is inherently present in the neuroanatomical connectivity. We demonstrate that the more entropy of attractors exists, the richer is the dynamical repertoire and consequently the brain network displays more capabilities of computation. We hypothesize therefore that human brain connectivity developed a scale free type of architecture in order to be able to store a large number of different and flexibly accessible brain functions
How anatomy shapes dynamics: a semi-analytical study of the brain at rest by a simple spin model.
Deco, Gustavo; Senden, Mario; Jirsa, Viktor
2012-01-01
Resting state networks (RSNs) show a surprisingly coherent and robust spatiotemporal organization. Previous theoretical studies demonstrated that these patterns can be understood as emergent on the basis of the underlying neuroanatomical connectivity skeleton. Integrating the biologically realistic DTI/DSI-(Diffusion Tensor Imaging/Diffusion Spectrum Imaging)based neuroanatomical connectivity into a brain model of Ising spin dynamics, we found a system with multiple attractors, which can be studied analytically. The multistable attractor landscape thus defines a functionally meaningful dynamic repertoire of the brain network that is inherently present in the neuroanatomical connectivity. We demonstrate that the more entropy of attractors exists, the richer is the dynamical repertoire and consequently the brain network displays more capabilities of computation. We hypothesize therefore that human brain connectivity developed a scale free type of architecture in order to be able to store a large number of different and flexibly accessible brain functions.
Directory of Open Access Journals (Sweden)
András Szilágyi
2016-09-01
Full Text Available Background: The fact that surplus connections and neurons are pruned during development is well established. We complement this selectionist picture by a proof-of-principle model of evolutionary search in the brain, that accounts for new variations in theory space. We present a model for Darwinian evolutionary search for candidate solutions in the brain. Methods: We combine known components of the brain – recurrent neural networks (acting as attractors, the action selection loop and implicit working memory – to provide the appropriate Darwinian architecture. We employ a population of attractor networks with palimpsest memory. The action selection loop is employed with winners-share-all dynamics to select for candidate solutions that are transiently stored in implicit working memory. Results: We document two processes: selection of stored solutions and evolutionary search for novel solutions. During the replication of candidate solutions attractor networks occasionally produce recombinant patterns, increasing variation on which selection can act. Combinatorial search acts on multiplying units (activity patterns with hereditary variation and novel variants appear due to (i noisy recall of patterns from the attractor networks, (ii noise during transmission of candidate solutions as messages between networks, and, (iii spontaneously generated, untrained patterns in spurious attractors. Conclusions: Attractor dynamics of recurrent neural networks can be used to model Darwinian search. The proposed architecture can be used for fast search among stored solutions (by selection and for evolutionary search when novel candidate solutions are generated in successive iterations. Since all the suggested components are present in advanced nervous systems, we hypothesize that the brain could implement a truly evolutionary combinatorial search system, capable of generating novel variants.
Directory of Open Access Journals (Sweden)
András Szilágyi
2017-06-01
Full Text Available Background: The fact that surplus connections and neurons are pruned during development is well established. We complement this selectionist picture by a proof-of-principle model of evolutionary search in the brain, that accounts for new variations in theory space. We present a model for Darwinian evolutionary search for candidate solutions in the brain. Methods: We combine known components of the brain – recurrent neural networks (acting as attractors, the action selection loop and implicit working memory – to provide the appropriate Darwinian architecture. We employ a population of attractor networks with palimpsest memory. The action selection loop is employed with winners-share-all dynamics to select for candidate solutions that are transiently stored in implicit working memory. Results: We document two processes: selection of stored solutions and evolutionary search for novel solutions. During the replication of candidate solutions attractor networks occasionally produce recombinant patterns, increasing variation on which selection can act. Combinatorial search acts on multiplying units (activity patterns with hereditary variation and novel variants appear due to (i noisy recall of patterns from the attractor networks, (ii noise during transmission of candidate solutions as messages between networks, and, (iii spontaneously generated, untrained patterns in spurious attractors. Conclusions: Attractor dynamics of recurrent neural networks can be used to model Darwinian search. The proposed architecture can be used for fast search among stored solutions (by selection and for evolutionary search when novel candidate solutions are generated in successive iterations. Since all the suggested components are present in advanced nervous systems, we hypothesize that the brain could implement a truly evolutionary combinatorial search system, capable of generating novel variants.
Periodicity, chaos, and multiple attractors in a memristor-based Shinriki's circuit
Energy Technology Data Exchange (ETDEWEB)
Kengne, J. [Laboratory of Automation and Applied Computer (LAIA), Department of Electrical Engineering, IUT-FV Bandjoun, University of Dschang, Dschang (Cameroon); Njitacke Tabekoueng, Z.; Kamdoum Tamba, V.; Nguomkam Negou, A. [Laboratory of Automation and Applied Computer (LAIA), Department of Electrical Engineering, IUT-FV Bandjoun, University of Dschang, Dschang (Cameroon); Department of Physics, Laboratory of Electronics and Signal Processing (LETS), Faculty of Science, University of Dschang, Dschang (Cameroon)
2015-10-15
In this contribution, a novel memristor-based oscillator, obtained from Shinriki's circuit by substituting the nonlinear positive conductance with a first order memristive diode bridge, is introduced. The model is described by a continuous time four-dimensional autonomous system with smooth nonlinearities. The basic dynamical properties of the system are investigated including equilibria and stability, phase portraits, frequency spectra, bifurcation diagrams, and Lyapunov exponents' spectrum. It is found that in addition to the classical period-doubling and symmetry restoring crisis scenarios reported in the original circuit, the memristor-based oscillator experiences the unusual and striking feature of multiple attractors (i.e., coexistence of a pair of asymmetric periodic attractors with a pair of asymmetric chaotic ones) over a broad range of circuit parameters. Results of theoretical analyses are verified by laboratory experimental measurements.
A network model of the interbank market
Li, Shouwei; He, Jianmin; Zhuang, Yaming
2010-12-01
This work introduces a network model of an interbank market based on interbank credit lending relationships. It generates some network features identified through empirical analysis. The critical issue to construct an interbank network is to decide the edges among banks, which is realized in this paper based on the interbank’s degree of trust. Through simulation analysis of the interbank network model, some typical structural features are identified in our interbank network, which are also proved to exist in real interbank networks. They are namely, a low clustering coefficient and a relatively short average path length, community structures, and a two-power-law distribution of out-degree and in-degree.
Model for Microcirculation Transportation Network Design
Directory of Open Access Journals (Sweden)
Qun Chen
2012-01-01
Full Text Available The idea of microcirculation transportation was proposed to shunt heavy traffic on arterial roads through branch roads. The optimization model for designing micro-circulation transportation network was developed to pick out branch roads as traffic-shunting channels and determine their required capacity, trying to minimize the total reconstruction expense and land occupancy subject to saturation and reconstruction space constraints, while accounting for the route choice behaviour of network users. Since micro-circulation transportation network design problem includes both discrete and continuous variables, a discretization method was developed to convert two groups of variables (discrete variables and continuous variables into one group of new discrete variables, transforming the mixed network design problem into a new kind of discrete network design problem with multiple values. The genetic algorithm was proposed to solve the new discrete network design problem. Finally a numerical example demonstrated the efficiency of the model and algorithm.
Modelling of virtual production networks
Directory of Open Access Journals (Sweden)
2011-03-01
Full Text Available Nowadays many companies, especially small and medium-sized enterprises (SMEs, specialize in a limited field of production. It requires forming virtual production networks of cooperating enterprises to manufacture better, faster and cheaper. Apart from that, some production orders cannot be realized, because there is not a company of sufficient production potential. In this case the virtual production networks of cooperating companies can realize these production orders. These networks have larger production capacity and many different resources. Therefore it can realize many more production orders together than each of them separately. Such organization allows for executing high quality product. The maintenance costs of production capacity and used resources are not so high. In this paper a methodology of rapid prototyping of virtual production networks is proposed. It allows to execute production orders on time considered existing logistic constraints.
Modeling Epidemics Spreading on Social Contact Networks.
Zhang, Zhaoyang; Wang, Honggang; Wang, Chonggang; Fang, Hua
2015-09-01
Social contact networks and the way people interact with each other are the key factors that impact on epidemics spreading. However, it is challenging to model the behavior of epidemics based on social contact networks due to their high dynamics. Traditional models such as susceptible-infected-recovered (SIR) model ignore the crowding or protection effect and thus has some unrealistic assumption. In this paper, we consider the crowding or protection effect and develop a novel model called improved SIR model. Then, we use both deterministic and stochastic models to characterize the dynamics of epidemics on social contact networks. The results from both simulations and real data set conclude that the epidemics are more likely to outbreak on social contact networks with higher average degree. We also present some potential immunization strategies, such as random set immunization, dominating set immunization, and high degree set immunization to further prove the conclusion.
Random graph models for dynamic networks
Zhang, Xiao; Moore, Cristopher; Newman, Mark E. J.
2017-10-01
Recent theoretical work on the modeling of network structure has focused primarily on networks that are static and unchanging, but many real-world networks change their structure over time. There exist natural generalizations to the dynamic case of many static network models, including the classic random graph, the configuration model, and the stochastic block model, where one assumes that the appearance and disappearance of edges are governed by continuous-time Markov processes with rate parameters that can depend on properties of the nodes. Here we give an introduction to this class of models, showing for instance how one can compute their equilibrium properties. We also demonstrate their use in data analysis and statistical inference, giving efficient algorithms for fitting them to observed network data using the method of maximum likelihood. This allows us, for example, to estimate the time constants of network evolution or infer community structure from temporal network data using cues embedded both in the probabilities over time that node pairs are connected by edges and in the characteristic dynamics of edge appearance and disappearance. We illustrate these methods with a selection of applications, both to computer-generated test networks and real-world examples.
Modeling the interdependent network based on two-mode networks
An, Feng; Gao, Xiangyun; Guan, Jianhe; Huang, Shupei; Liu, Qian
2017-10-01
Among heterogeneous networks, there exist obviously and closely interdependent linkages. Unlike existing research primarily focus on the theoretical research of physical interdependent network model. We propose a two-layer interdependent network model based on two-mode networks to explore the interdependent features in the reality. Specifically, we construct a two-layer interdependent loan network and develop several dependent features indices. The model is verified to enable us to capture the loan dependent features of listed companies based on loan behaviors and shared shareholders. Taking Chinese debit and credit market as case study, the main conclusions are: (1) only few listed companies shoulder the main capital transmission (20% listed companies occupy almost 70% dependent degree). (2) The control of these key listed companies will be more effective of avoiding the spreading of financial risks. (3) Identifying the companies with high betweenness centrality and controlling them could be helpful to monitor the financial risk spreading. (4) The capital transmission channel among Chinese financial listed companies and Chinese non-financial listed companies are relatively strong. However, under greater pressure of demand of capital transmission (70% edges failed), the transmission channel, which constructed by debit and credit behavior, will eventually collapse.
Baird, Bill
1986-08-01
A neural network model describing pattern recognition in the rabbit olfactory bulb is analysed to explain the changes in neural activity observed experimentally during classical Pavlovian conditioning. EEG activity recorded from an 8×8 arry of 64 electrodes directly on the surface on the bulb shows distinct spatial patterns of oscillation that correspond to the animal's recognition of different conditioned odors and change with conditioning to new odors. The model may be considered a variant of Hopfield's model of continuous analog neural dynamics. Excitatory and inhibitory cell types in the bulb and the anatomical architecture of their connection requires a nonsymmetric coupling matrix. As the mean input level rises during each breath of the animal, the system bifurcates from homogenous equilibrium to a spatially patterned oscillation. The theory of multiple Hopf bifurcations is employed to find coupled equations for the amplitudes of these unstable oscillatory modes independent of frequency. This allows a view of stored periodic attractors as fixed points of a gradient vector field and thereby recovers the more familiar dynamical systems picture of associative memory.
An endogenous model of the credit network
He, Jianmin; Sui, Xin; Li, Shouwei
2016-01-01
In this paper, an endogenous credit network model of firm-bank agents is constructed. The model describes the endogenous formation of firm-firm, firm-bank and bank-bank credit relationships. By means of simulations, the model is capable of showing some obvious similarities with empirical evidence found by other scholars: the upper-tail of firm size distribution can be well fitted with a power-law; the bank size distribution can be lognormally distributed with a power-law tail; the bank in-degrees of the interbank credit network as well as the firm-bank credit network fall into two-power-law distributions.
Tensor network models of multiboundary wormholes
Peach, Alex; Ross, Simon F.
2017-05-01
We study the entanglement structure of states dual to multiboundary wormhole geometries using tensor network models. Perfect and random tensor networks tiling the hyperbolic plane have been shown to provide good models of the entanglement structure in holography. We extend this by quotienting the plane by discrete isometries to obtain models of the multiboundary states. We show that there are networks where the entanglement structure is purely bipartite, extending results obtained in the large temperature limit. We analyse the entanglement structure in a range of examples.
Stochastic discrete model of karstic networks
Jaquet, O.; Siegel, P.; Klubertanz, G.; Benabderrhamane, H.
Karst aquifers are characterised by an extreme spatial heterogeneity that strongly influences their hydraulic behaviour and the transport of pollutants. These aquifers are particularly vulnerable to contamination because of their highly permeable networks of conduits. A stochastic model is proposed for the simulation of the geometry of karstic networks at a regional scale. The model integrates the relevant physical processes governing the formation of karstic networks. The discrete simulation of karstic networks is performed with a modified lattice-gas cellular automaton for a representative description of the karstic aquifer geometry. Consequently, more reliable modelling results can be obtained for the management and the protection of karst aquifers. The stochastic model was applied jointly with groundwater modelling techniques to a regional karst aquifer in France for the purpose of resolving surface pollution issues.
Designing Network-based Business Model Ontology
DEFF Research Database (Denmark)
Hashemi Nekoo, Ali Reza; Ashourizadeh, Shayegheh; Zarei, Behrouz
2015-01-01
Survival on dynamic environment is not achieved without a map. Scanning and monitoring of the market show business models as a fruitful tool. But scholars believe that old-fashioned business models are dead; as they are not included the effect of internet and network in themselves. This paper...... is going to propose e-business model ontology from the network point of view and its application in real world. The suggested ontology for network-based businesses is composed of individuals` characteristics and what kind of resources they own. also, their connections and pre-conceptions of connections...... such as shared-mental model and trust. However, it mostly covers previous business model elements. To confirm the applicability of this ontology, it has been implemented in business angel network and showed how it works....
Queueing Models for Mobile Ad Hoc Networks
de Haan, Roland
2009-01-01
This thesis presents models for the performance analysis of a recent communication paradigm: \\emph{mobile ad hoc networking}. The objective of mobile ad hoc networking is to provide wireless connectivity between stations in a highly dynamic environment. These dynamics are driven by the mobility of
Modelling traffic congestion using queuing networks
Indian Academy of Sciences (India)
Traffic Flow-Density diagrams are obtained using simple Jackson queuing network analysis. Such simple analytical models can be used to capture the effect of non- homogenous traffic. Keywords. Flow-density curves; uninterrupted traffic; Jackson networks. 1. Introduction. Traffic management has become very essential in ...
Diffusion of intrinsic localized modes by attractor hopping
Energy Technology Data Exchange (ETDEWEB)
Meister, Matthias [Dpto FIsica de la Materia Condensada, Facultad de Ciencias, Universidad de Zaragoza, 50009 Zaragoza (Spain); Instituto de Biocomputacion y FIsica de Sistemas Complejos, Universidad de Zaragoza, 50009 Zaragoza (Spain); Vazquez, Luis [Dpto Matematica Aplicada, Facultad de Informatica, Universidad Complutense de Madrid, 28040 Madrid (Spain); Centro de AstrobiologIa (CSIC-INTA), 28850 Torrejon de Ardoz (Spain)
2003-11-28
Propagating intrinsic localized modes exist in the damped-driven discrete sine-Gordon chain as attractors of the dynamics. The equations of motion of the system are augmented with Gaussian white noise in order to model the effects of temperature on the system. The noise induces random transitions between attracting configurations corresponding to opposite signs of the propagation velocity of the mode, which leads to a diffusive motion of the excitation. The Heun method is used to numerically generate the stochastic time-evolution of the configuration. We also present a theoretical model for the diffusion which contains two parameters, a transition probability {theta} and a delay time {tau}{sub A}. The mean value and the variance of the position of the intrinsic localized mode, obtained from simulations, can be fitted well with the predictions of our model, {theta} and {tau}{sub A} being used as parameters in the fit. After a transition period following the switching on of the noise, the variance shows a linear behaviour as a function of time and the mean value remains constant. An increase in the strength of the noise lowers the variance, leads to an increase in {theta}, a decrease in {tau}{sub A} and reduces the average distance a mode travels during the transition period.
Mathematical model of highways network optimization
Sakhapov, R. L.; Nikolaeva, R. V.; Gatiyatullin, M. H.; Makhmutov, M. M.
2017-12-01
The article deals with the issue of highways network design. Studies show that the main requirement from road transport for the road network is to ensure the realization of all the transport links served by it, with the least possible cost. The goal of optimizing the network of highways is to increase the efficiency of transport. It is necessary to take into account a large number of factors that make it difficult to quantify and qualify their impact on the road network. In this paper, we propose building an optimal variant for locating the road network on the basis of a mathematical model. The article defines the criteria for optimality and objective functions that reflect the requirements for the road network. The most fully satisfying condition for optimality is the minimization of road and transport costs. We adopted this indicator as a criterion of optimality in the economic-mathematical model of a network of highways. Studies have shown that each offset point in the optimal binding road network is associated with all other corresponding points in the directions providing the least financial costs necessary to move passengers and cargo from this point to the other corresponding points. The article presents general principles for constructing an optimal network of roads.
Modeling trust context in networks
Adali, Sibel
2013-01-01
We make complex decisions every day, requiring trust in many different entities for different reasons. These decisions are not made by combining many isolated trust evaluations. Many interlocking factors play a role, each dynamically impacting the others.? In this brief, 'trust context' is defined as the system level description of how the trust evaluation process unfolds.Networks today are part of almost all human activity, supporting and shaping it. Applications increasingly incorporate new interdependencies and new trust contexts. Social networks connect people and organizations throughout
Model-based control of networked systems
Garcia, Eloy; Montestruque, Luis A
2014-01-01
This monograph introduces a class of networked control systems (NCS) called model-based networked control systems (MB-NCS) and presents various architectures and control strategies designed to improve the performance of NCS. The overall performance of NCS considers the appropriate use of network resources, particularly network bandwidth, in conjunction with the desired response of the system being controlled. The book begins with a detailed description of the basic MB-NCS architecture that provides stability conditions in terms of state feedback updates . It also covers typical problems in NCS such as network delays, network scheduling, and data quantization, as well as more general control problems such as output feedback control, nonlinear systems stabilization, and tracking control. Key features and topics include: Time-triggered and event-triggered feedback updates Stabilization of uncertain systems subject to time delays, quantization, and extended absence of feedback Optimal control analysis and ...
Complex networks repair strategies: Dynamic models
Fu, Chaoqi; Wang, Ying; Gao, Yangjun; Wang, Xiaoyang
2017-09-01
Network repair strategies are tactical methods that restore the efficiency of damaged networks; however, unreasonable repair strategies not only waste resources, they are also ineffective for network recovery. Most extant research on network repair focuses on static networks, but results and findings on static networks cannot be applied to evolutionary dynamic networks because, in dynamic models, complex network repair has completely different characteristics. For instance, repaired nodes face more severe challenges, and require strategic repair methods in order to have a significant effect. In this study, we propose the Shell Repair Strategy (SRS) to minimize the risk of secondary node failures due to the cascading effect. Our proposed method includes the identification of a set of vital nodes that have a significant impact on network repair and defense. Our identification of these vital nodes reduces the number of switching nodes that face the risk of secondary failures during the dynamic repair process. This is positively correlated with the size of the average degree 〈 k 〉 and enhances network invulnerability.
Alombah, N. Henry; Fotsin, Hilaire; Romanic, Kengne
In this paper, some complex nonlinear behaviors in a four-dimensional multiscroll autonomous memristor based chaotic system are investigated. This system is derived from the three-dimensional autonomous charge-controlled Muthuswamy-Chua simplest chaotic circuit. The system can generate four different coexisting attractors for a fixed set of parameters and different initial conditions. This phenomenon is relatively rare given that we have four different attractors namely: an equilibrium point, a stable limit cycle, a 16-peak limit cycle and a strange attractor that coexist in the system within a wide range of parameters. The nonlinear phenomenon of transient chaos is studied and revealed numerically in Matlab and Pspice environments. The complex transient dynamics of this memristive system under different initial states shows that the transient time depends strongly on the initial conditions. Moreover, this model displays spiking and bursting oscillations. The bursting behavior is classified according to the dynamics of separated slow and fast subsystems. It is shown to be of the fold-Hopf type. These complex dynamical behaviors of this system are investigated by means of numerical simulations and via Pspice circuit simulations. The use of bifurcation diagrams, Lyapunov exponents diagrams, power spectrums, phase portraits, time series, isospike diagram, basin of attraction, clearly shows these complex phenomena.
Modeling Network Traffic in Wavelet Domain
Directory of Open Access Journals (Sweden)
Sheng Ma
2004-12-01
Full Text Available This work discovers that although network traffic has the complicated short- and long-range temporal dependence, the corresponding wavelet coefficients are no longer long-range dependent. Therefore, a "short-range" dependent process can be used to model network traffic in the wavelet domain. Both independent and Markov models are investigated. Theoretical analysis shows that the independent wavelet model is sufficiently accurate in terms of the buffer overflow probability for Fractional Gaussian Noise traffic. Any model, which captures additional correlations in the wavelet domain, only improves the performance marginally. The independent wavelet model is then used as a unified approach to model network traffic including VBR MPEG video and Ethernet data. The computational complexity is O(N for developing such wavelet models and generating synthesized traffic of length N, which is among the lowest attained.
Gene Regulation Networks for Modeling Drosophila Development
Mjolsness, E.
1999-01-01
This chapter will very briefly introduce and review some computational experiments in using trainable gene regulation network models to simulate and understand selected episodes in the development of the fruit fly, Drosophila Melanogaster.
Graphical Model Theory for Wireless Sensor Networks
Energy Technology Data Exchange (ETDEWEB)
Davis, William B.
2002-12-08
Information processing in sensor networks, with many small processors, demands a theory of computation that allows the minimization of processing effort, and the distribution of this effort throughout the network. Graphical model theory provides a probabilistic theory of computation that explicitly addresses complexity and decentralization for optimizing network computation. The junction tree algorithm, for decentralized inference on graphical probability models, can be instantiated in a variety of applications useful for wireless sensor networks, including: sensor validation and fusion; data compression and channel coding; expert systems, with decentralized data structures, and efficient local queries; pattern classification, and machine learning. Graphical models for these applications are sketched, and a model of dynamic sensor validation and fusion is presented in more depth, to illustrate the junction tree algorithm.
Mitigating risk during strategic supply network modeling
Müssigmann, Nikolaus
2006-01-01
Mitigating risk during strategic supply network modeling. - In: Managing risks in supply chains / ed. by Wolfgang Kersten ... - Berlin : Schmidt, 2006. - S. 213-226. - (Operations and technology management ; 1)
Noninvertibility and resonance in discrete-time neural networks for time-series processing
Gicquel, N.; Anderson, J. S.; Kevrekidis, I. G.
1998-01-01
We present a computer-assisted study emphasizing certain elements of the dynamics of artificial neural networks (ANNs) used for discrete time-series processing and nonlinear system identification. The structure of the network gives rise to the possibility of multiple inverses of a phase point backward in time; this is not possible for the continuous-time system from which the time series are obtained. Using a two-dimensional illustrative model in an oscillatory regime, we study here the interaction of attractors predicted by the discrete-time ANN model (invariant circles and periodic points locked on them) with critical curves. These curves constitute a generalization of critical points for maps of the interval (in the sense of Julia-Fatou); their interaction with the model-predicted attractors plays a crucial role in the organization of the bifurcation structure and ultimately in determining the dynamic behavior predicted by the neural network.
Road maintenance planning using network flow modelling
Yang, Chao; Remenyte-Prescott, Rasa; Andrews, John
2015-01-01
This paper presents a road maintenance planning model that can be used to balance out maintenance cost and road user cost, since performing road maintenance at night can be convenient for road users but costly for highway agency. Based on the platform of the network traffic flow modelling, the traffic through the worksite and its adjacent road links is evaluated. Thus, maintenance arrangements at a worksite can be optimized considering the overall network performance. In addition, genetic alg...
Posterior Predictive Model Checking in Bayesian Networks
Crawford, Aaron
2014-01-01
This simulation study compared the utility of various discrepancy measures within a posterior predictive model checking (PPMC) framework for detecting different types of data-model misfit in multidimensional Bayesian network (BN) models. The investigated conditions were motivated by an applied research program utilizing an operational complex…
A simple model for studying interacting networks
Liu, Wenjia; Jolad, Shivakumar; Schmittmann, Beate; Zia, R. K. P.
2011-03-01
Many specific physical networks (e.g., internet, power grid, interstates), have been characterized in considerable detail, but in isolation from each other. Yet, each of these networks supports the functions of the others, and so far, little is known about how their interactions affect their structure and functionality. To address this issue, we consider two coupled model networks. Each network is relatively simple, with a fixed set of nodes, but dynamically generated set of links which has a preferred degree, κ . In the stationary state, the degree distribution has exponential tails (far from κ), an attribute which we can explain. Next, we consider two such networks with different κ 's, reminiscent of two social groups, e.g., extroverts and introverts. Finally, we let these networks interact by establishing a controllable fraction of cross links. The resulting distribution of links, both within and across the two model networks, is investigated and discussed, along with some potential consequences for real networks. Supported in part by NSF-DMR-0705152 and 1005417.
Attractors and soak times in artisanal fi shing with traps
Directory of Open Access Journals (Sweden)
Evandro Figueiredo Sebastiani
2009-12-01
Full Text Available Traps are used by artisanal fishers as fishing gear in places where other fishing modalities are impeded or limited. The advantage of this type of fishing modality is the possibility of keeping fish alive and in the case of capturing species of low commercial value or size below the permitted minimum this fishing gear allows the release of such specimens back to nature, resulting in a sustainability aspect to the use of this fishing gear. This study aims to evaluate the effects of different attractors and times of submersion on the efficiency of the traps used. Sardines, shrimps and trash fish were employed as attractors. To evaluate the soak time, two periods were tested: 24 and 96 hours. The sardines, used as the attractor, resulted in a production of 1,296.4 ± 397.4g, significantly superior (p <0.05 to other attractors. In relation to the soak time, the period of 24 hours resulted in an average production of 1,719.2 ± 866.0g, significantly (p <0.05 superior to the period of 96 hours. The results led to the conclusion that to optimize this capture by fishing gear, sardines should be used as the attractor, together with a soak time of 24 hours.
Modeling gene regulatory network motifs using Statecharts.
Fioravanti, Fabio; Helmer-Citterich, Manuela; Nardelli, Enrico
2012-03-28
Gene regulatory networks are widely used by biologists to describe the interactions among genes, proteins and other components at the intra-cellular level. Recently, a great effort has been devoted to give gene regulatory networks a formal semantics based on existing computational frameworks.For this purpose, we consider Statecharts, which are a modular, hierarchical and executable formal model widely used to represent software systems. We use Statecharts for modeling small and recurring patterns of interactions in gene regulatory networks, called motifs. We present an improved method for modeling gene regulatory network motifs using Statecharts and we describe the successful modeling of several motifs, including those which could not be modeled or whose models could not be distinguished using the method of a previous proposal.We model motifs in an easy and intuitive way by taking advantage of the visual features of Statecharts. Our modeling approach is able to simulate some interesting temporal properties of gene regulatory network motifs: the delay in the activation and the deactivation of the "output" gene in the coherent type-1 feedforward loop, the pulse in the incoherent type-1 feedforward loop, the bistability nature of double positive and double negative feedback loops, the oscillatory behavior of the negative feedback loop, and the "lock-in" effect of positive autoregulation. We present a Statecharts-based approach for the modeling of gene regulatory network motifs in biological systems. The basic motifs used to build more complex networks (that is, simple regulation, reciprocal regulation, feedback loop, feedforward loop, and autoregulation) can be faithfully described and their temporal dynamics can be analyzed.
Neural network approaches for noisy language modeling.
Li, Jun; Ouazzane, Karim; Kazemian, Hassan B; Afzal, Muhammad Sajid
2013-11-01
Text entry from people is not only grammatical and distinct, but also noisy. For example, a user's typing stream contains all the information about the user's interaction with computer using a QWERTY keyboard, which may include the user's typing mistakes as well as specific vocabulary, typing habit, and typing performance. In particular, these features are obvious in disabled users' typing streams. This paper proposes a new concept called noisy language modeling by further developing information theory and applies neural networks to one of its specific application-typing stream. This paper experimentally uses a neural network approach to analyze the disabled users' typing streams both in general and specific ways to identify their typing behaviors and subsequently, to make typing predictions and typing corrections. In this paper, a focused time-delay neural network (FTDNN) language model, a time gap model, a prediction model based on time gap, and a probabilistic neural network model (PNN) are developed. A 38% first hitting rate (HR) and a 53% first three HR in symbol prediction are obtained based on the analysis of a user's typing history through the FTDNN language modeling, while the modeling results using the time gap prediction model and the PNN model demonstrate that the correction rates lie predominantly in between 65% and 90% with the current testing samples, and 70% of all test scores above basic correction rates, respectively. The modeling process demonstrates that a neural network is a suitable and robust language modeling tool to analyze the noisy language stream. The research also paves the way for practical application development in areas such as informational analysis, text prediction, and error correction by providing a theoretical basis of neural network approaches for noisy language modeling.
A quantum-implementable neural network model
Chen, Jialin; Wang, Lingli; Charbon, Edoardo
2017-10-01
A quantum-implementable neural network, namely quantum probability neural network (QPNN) model, is proposed in this paper. QPNN can use quantum parallelism to trace all possible network states to improve the result. Due to its unique quantum nature, this model is robust to several quantum noises under certain conditions, which can be efficiently implemented by the qubus quantum computer. Another advantage is that QPNN can be used as memory to retrieve the most relevant data and even to generate new data. The MATLAB experimental results of Iris data classification and MNIST handwriting recognition show that much less neuron resources are required in QPNN to obtain a good result than the classical feedforward neural network. The proposed QPNN model indicates that quantum effects are useful for real-life classification tasks.
Telestroke network business model strategies.
Fanale, Christopher V; Demaerschalk, Bart M
2012-10-01
Our objective is to summarize the evidence that supports the reliability of telemedicine for diagnosis and efficacy in acute stroke treatment, identify strategies for funding the development of a telestroke network, and to present issues with respect to economic sustainability, cost effectiveness, and the status of reimbursement for telestroke. Copyright © 2012 National Stroke Association. Published by Elsevier Inc. All rights reserved.
Discrete Logic Modelling Optimization to Contextualize Prior Knowledge Networks Using PRUNET.
Rodriguez, Ana; Crespo, Isaac; Androsova, Ganna; del Sol, Antonio
2015-01-01
High-throughput technologies have led to the generation of an increasing amount of data in different areas of biology. Datasets capturing the cell's response to its intra- and extra-cellular microenvironment allows such data to be incorporated as signed and directed graphs or influence networks. These prior knowledge networks (PKNs) represent our current knowledge of the causality of cellular signal transduction. New signalling data is often examined and interpreted in conjunction with PKNs. However, different biological contexts, such as cell type or disease states, may have distinct variants of signalling pathways, resulting in the misinterpretation of new data. The identification of inconsistencies between measured data and signalling topologies, as well as the training of PKNs using context specific datasets (PKN contextualization), are necessary conditions to construct reliable, predictive models, which are current challenges in the systems biology of cell signalling. Here we present PRUNET, a user-friendly software tool designed to address the contextualization of a PKNs to specific experimental conditions. As the input, the algorithm takes a PKN and the expression profile of two given stable steady states or cellular phenotypes. The PKN is iteratively pruned using an evolutionary algorithm to perform an optimization process. This optimization rests in a match between predicted attractors in a discrete logic model (Boolean) and a Booleanized representation of the phenotypes, within a population of alternative subnetworks that evolves iteratively. We validated the algorithm applying PRUNET to four biological examples and using the resulting contextualized networks to predict missing expression values and to simulate well-characterized perturbations. PRUNET constitutes a tool for the automatic curation of a PKN to make it suitable for describing biological processes under particular experimental conditions. The general applicability of the implemented algorithm
Complex networks under dynamic repair model
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.
Markov State Models of gene regulatory networks.
Chu, Brian K; Tse, Margaret J; Sato, Royce R; Read, Elizabeth L
2017-02-06
Gene regulatory networks with dynamics characterized by multiple stable states underlie cell fate-decisions. Quantitative models that can link molecular-level knowledge of gene regulation to a global understanding of network dynamics have the potential to guide cell-reprogramming strategies. Networks are often modeled by the stochastic Chemical Master Equation, but methods for systematic identification of key properties of the global dynamics are currently lacking. The method identifies the number, phenotypes, and lifetimes of long-lived states for a set of common gene regulatory network models. Application of transition path theory to the constructed Markov State Model decomposes global dynamics into a set of dominant transition paths and associated relative probabilities for stochastic state-switching. In this proof-of-concept study, we found that the Markov State Model provides a general framework for analyzing and visualizing stochastic multistability and state-transitions in gene networks. Our results suggest that this framework-adopted from the field of atomistic Molecular Dynamics-can be a useful tool for quantitative Systems Biology at the network scale.
Performance modeling, stochastic networks, and statistical multiplexing
Mazumdar, Ravi R
2013-01-01
This monograph presents a concise mathematical approach for modeling and analyzing the performance of communication networks with the aim of introducing an appropriate mathematical framework for modeling and analysis as well as understanding the phenomenon of statistical multiplexing. The models, techniques, and results presented form the core of traffic engineering methods used to design, control and allocate resources in communication networks.The novelty of the monograph is the fresh approach and insights provided by a sample-path methodology for queueing models that highlights the importan
Modeling acquaintance networks based on balance theory
Directory of Open Access Journals (Sweden)
Vukašinović Vida
2014-09-01
Full Text Available An acquaintance network is a social structure made up of a set of actors and the ties between them. These ties change dynamically as a consequence of incessant interactions between the actors. In this paper we introduce a social network model called the Interaction-Based (IB model that involves well-known sociological principles. The connections between the actors and the strength of the connections are influenced by the continuous positive and negative interactions between the actors and, vice versa, the future interactions are more likely to happen between the actors that are connected with stronger ties. The model is also inspired by the social behavior of animal species, particularly that of ants in their colony. A model evaluation showed that the IB model turned out to be sparse. The model has a small diameter and an average path length that grows in proportion to the logarithm of the number of vertices. The clustering coefficient is relatively high, and its value stabilizes in larger networks. The degree distributions are slightly right-skewed. In the mature phase of the IB model, i.e., when the number of edges does not change significantly, most of the network properties do not change significantly either. The IB model was found to be the best of all the compared models in simulating the e-mail URV (University Rovira i Virgili of Tarragona network because the properties of the IB model more closely matched those of the e-mail URV network than the other models
Flood routing modelling with Artificial Neural Networks
Directory of Open Access Journals (Sweden)
R. Peters
2006-01-01
Full Text Available For the modelling of the flood routing in the lower reaches of the Freiberger Mulde river and its tributaries the one-dimensional hydrodynamic modelling system HEC-RAS has been applied. Furthermore, this model was used to generate a database to train multilayer feedforward networks. To guarantee numerical stability for the hydrodynamic modelling of some 60 km of streamcourse an adequate resolution in space requires very small calculation time steps, which are some two orders of magnitude smaller than the input data resolution. This leads to quite high computation requirements seriously restricting the application – especially when dealing with real time operations such as online flood forecasting. In order to solve this problem we tested the application of Artificial Neural Networks (ANN. First studies show the ability of adequately trained multilayer feedforward networks (MLFN to reproduce the model performance.
Optimal transportation networks models and theory
Bernot, Marc; Morel, Jean-Michel
2009-01-01
The transportation problem can be formalized as the problem of finding the optimal way to transport a given measure into another with the same mass. In contrast to the Monge-Kantorovitch problem, recent approaches model the branched structure of such supply networks as minima of an energy functional whose essential feature is to favour wide roads. Such a branched structure is observable in ground transportation networks, in draining and irrigation systems, in electrical power supply systems and in natural counterparts such as blood vessels or the branches of trees. These lectures provide mathematical proof of several existence, structure and regularity properties empirically observed in transportation networks. The link with previous discrete physical models of irrigation and erosion models in geomorphology and with discrete telecommunication and transportation models is discussed. It will be mathematically proven that the majority fit in the simple model sketched in this volume.
Discontinuous attractor dimension at the synchronization transition of time-delayed chaotic systems.
Zeeb, Steffen; Dahms, Thomas; Flunkert, Valentin; Schöll, Eckehard; Kanter, Ido; Kinzel, Wolfgang
2013-04-01
The attractor dimension at the transition to complete synchronization in a network of chaotic units with time-delayed couplings is investigated. In particular, we determine the Kaplan-Yorke dimension from the spectrum of Lyapunov exponents for iterated maps and for two coupled semiconductor lasers. We argue that the Kaplan-Yorke dimension must be discontinuous at the transition and compare it to the correlation dimension. For a system of Bernoulli maps, we indeed find a jump in the correlation dimension. The magnitude of the discontinuity in the Kaplan-Yorke dimension is calculated for networks of Bernoulli units as a function of the network size. Furthermore, the scaling of the Kaplan-Yorke dimension as well as of the Kolmogorov entropy with system size and time delay is investigated.
Upper Semicontinuity of Attractors for a Non-Newtonian Fluid under Small Random Perturbations
Directory of Open Access Journals (Sweden)
Jianxin Luo
2014-01-01
Full Text Available This paper investigates the limiting behavior of attractors for a two-dimensional incompressible non-Newtonian fluid under small random perturbations. Under certain conditions, the upper semicontinuity of the attractors for diminishing perturbations is shown.
A Transfer Learning Approach for Network Modeling
Huang, Shuai; Li, Jing; Chen, Kewei; Wu, Teresa; Ye, Jieping; Wu, Xia; Yao, Li
2012-01-01
Networks models have been widely used in many domains to characterize the interacting relationship between physical entities. A typical problem faced is to identify the networks of multiple related tasks that share some similarities. In this case, a transfer learning approach that can leverage the knowledge gained during the modeling of one task to help better model another task is highly desirable. In this paper, we propose a transfer learning approach, which adopts a Bayesian hierarchical model framework to characterize task relatedness and additionally uses the L1-regularization to ensure robust learning of the networks with limited sample sizes. A method based on the Expectation-Maximization (EM) algorithm is further developed to learn the networks from data. Simulation studies are performed, which demonstrate the superiority of the proposed transfer learning approach over single task learning that learns the network of each task in isolation. The proposed approach is also applied to identification of brain connectivity networks of Alzheimer’s disease (AD) from functional magnetic resonance image (fMRI) data. The findings are consistent with the AD literature. PMID:24526804
PyBoolNet: a python package for the generation, analysis and visualization of boolean networks.
Klarner, Hannes; Streck, Adam; Siebert, Heike
2017-03-01
The goal of this project is to provide a simple interface to working with Boolean networks. Emphasis is put on easy access to a large number of common tasks including the generation and manipulation of networks, attractor and basin computation, model checking and trap space computation, execution of established graph algorithms as well as graph drawing and layouts. P y B ool N et is a Python package for working with Boolean networks that supports simple access to model checking via N u SMV, standard graph algorithms via N etwork X and visualization via dot . In addition, state of the art attractor computation exploiting P otassco ASP is implemented. The package is function-based and uses only native Python and N etwork X data types. https://github.com/hklarner/PyBoolNet. hannes.klarner@fu-berlin.de.
Separation of attractors in 1-modulus quantum corrected special geometry
Bellucci, S; Marrani, A; Shcherbakov, A
2008-01-01
We study the solutions to the N=2, d=4 Attractor Equations in a dyonic, extremal, static, spherically symmetric and asymptotically flat black hole background, in the simplest case of perturbative quantum corrected cubic Special Kahler geometry consistent with continuous axion-shift symmetry, namely in the 1-modulus Special Kahler geometry described (in a suitable special symplectic coordinate) by the holomorphic Kahler gauge-invariant prepotential F=t^3+i*lambda, with lambda real. By performing computations in the ``magnetic'' charge configuration, we find evidence for interesting phenomena (absent in the classical limit of vanishing lambda). Namely, for a certain range of the quantum parameter lambda we find a ``splitting'' of attractors, i.e. the existence of multiple solutions to the Attractor Equations for fixed supporting charge configuration. This corresponds to the existence of ``area codes'' in the radial evolution of the scalar t, determined by the various disconnected regions of the moduli space, wh...
Topological and metric properties of Henon-type strange attractors
Cvitanovic, Predrag; Gunaratne, Gemunu H.; Procaccia, Itamar
1988-08-01
A set of all periodic points of Henon-type mappings is used to develop a theory of the topological and metric properties of their attractors. The topology of a Henon-type attractor is conveniently represented by a two-dimensional symbol plane, with the allowed and disallowed orbits cleanly separated by the 'pruning front'. The pruning front is a function discontinuous on every binary rational number, but for maps with finite dissipation less than 1, it is well approximated by a few steps, or, in the symbolic dynamics language, by a finite grammar. Thus equipped with the complete list of allowed periodic points, the physical attractor is reconstructed by piecing together the linearized neighborhoods of all periodic points of cycle length n. This representation is used to compute the singularity spectrum f(alpha).
On the hydrodynamic attractor of Yang-Mills plasma
Spaliński, Michał
2018-01-01
There is mounting evidence suggesting that relativistic hydrodynamics becomes relevant for the physics of quark-gluon plasma as the result of nonhydrodynamic modes decaying to an attractor apparent even when the system is far from local equilibrium. Here we determine this attractor for Bjorken flow in N = 4 supersymmetric Yang-Mills theory (SYM) using Borel summation of the gradient expansion of the expectation value of the energy momentum tensor. By comparing the result to numerical simulations of the flow based on the AdS/CFT correspondence we show that it provides an accurate and unambiguous approximation of the hydrodynamic attractor in this system. This development has important implications for the formulation of effective theories of hydrodynamics.
Generating multi-scroll chaotic attractors by thresholding
Energy Technology Data Exchange (ETDEWEB)
Lue Jinhu [Institute of Systems Science, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100080 (China)], E-mail: jhlu@iss.ac.cn; Murali, K. [Department of Physics, Anna University, Chennai 600 025 (India)], E-mail: kmurali@annauniv.edu; Sinha, Sudeshna [Institute of Mathematical Sciences, Taramani, Chennai 600 113 (India)], E-mail: sudeshna@imsc.res.in; Leung, Henry [Department of Electrical and Computer Engineering, University of Calgary, Calgary, T2N 1N4 (Canada); Aziz-Alaoui, M.A. [Applied Mathematics Laboratory, University of Le Havre, BP 540, 76058 Le Havre Cedex (France)
2008-04-28
This Letter proposes a novel thresholding approach for creating multi-scroll chaotic attractors. The general jerk circuit and Chua's circuit with sine nonlinearity are then used as two representative examples to show the working principle of this method. The controlled jerk circuit can generate various limit cycles and multi-scroll chaotic attractors by tuning the thresholds and the width of inner threshold plateau. The dynamic mechanism of threshold control is further explored by analyzing the system dynamical behaviors. In particular, this approach is effective and easy to be implemented since we only need to monitor the threshold variables or their functions and then reset them if they exceed the desired thresholds. Furthermore, two simple block circuit diagrams with threshold controllers are designed for the implementations of 1, 2, 3-scroll chaotic attractors. It indicates the potential engineering applications for various chaos-based information systems.
Generating multi-scroll chaotic attractors by thresholding
Lü, Jinhu; Murali, K.; Sinha, Sudeshna; Leung, Henry; Aziz-Alaoui, M. A.
2008-04-01
This Letter proposes a novel thresholding approach for creating multi-scroll chaotic attractors. The general jerk circuit and Chua's circuit with sine nonlinearity are then used as two representative examples to show the working principle of this method. The controlled jerk circuit can generate various limit cycles and multi-scroll chaotic attractors by tuning the thresholds and the width of inner threshold plateau. The dynamic mechanism of threshold control is further explored by analyzing the system dynamical behaviors. In particular, this approach is effective and easy to be implemented since we only need to monitor the threshold variables or their functions and then reset them if they exceed the desired thresholds. Furthermore, two simple block circuit diagrams with threshold controllers are designed for the implementations of 1, 2, 3-scroll chaotic attractors. It indicates the potential engineering applications for various chaos-based information systems.
Directory of Open Access Journals (Sweden)
A. Weissblut
2012-03-01
Full Text Available This article – introduction to the structural theory of general view dynamical systems, based on construction of dynamic quantum models (DQM, offered by the author. This model is simply connected with traditional model of quantum mechanics (i.e. with the Schrodinger equation. At the same time obtained thus non – Hamiltonian quantum dynamics is easier than classical one: it allow building the clear structural theory and effective algorithms of research for concrete systems. This article is devoted mainly to such task. The algorithm of search for DQM attractors, based on this approach, is offered here.
CMB constraints on the inflaton couplings and reheating temperature in α-attractor inflation
Drewes, Marco; Kang, Jin U.; Mun, Ui Ri
2017-11-01
We study reheating in α-attractor models of inflation in which the inflaton couples to other scalars or fermions. We show that the parameter space contains viable regions in which the inflaton couplings to radiation can be determined from the properties of CMB temperature fluctuations, in particular the spectral index. This may be the only way to measure these fundamental microphysical parameters, which shaped the universe by setting the initial temperature of the hot big bang and contain important information about the embedding of a given model of inflation into a more fundamental theory of physics. The method can be applied to other models of single field inflation.
Wei, Ziqiang; Wang, Xiao-Jing; Wang, Da-Hui
2012-08-15
Recent behavioral studies have given rise to two contrasting models for limited working memory capacity: a "discrete-slot" model in which memory items are stored in a limited number of slots, and a "shared-resource" model in which the neural representation of items is distributed across a limited pool of resources. To elucidate the underlying neural processes, we investigated a continuous network model for working memory of an analog feature. Our model network fundamentally operates with a shared resource mechanism, and stimuli in cue arrays are encoded by a distributed neural population. On the other hand, the network dynamics and performance are also consistent with the discrete-slot model, because multiple objects are maintained by distinct localized population persistent activity patterns (bump attractors). We identified two phenomena of recurrent circuit dynamics that give rise to limited working memory capacity. As the working memory load increases, a localized persistent activity bump may either fade out (so the memory of the corresponding item is lost) or merge with another nearby bump (hence the resolution of mnemonic representation for the merged items becomes blurred). We identified specific dependences of these two phenomena on the strength and tuning of recurrent synaptic excitation, as well as network normalization: the overall population activity is invariant to set size and delay duration; therefore, a constant neural resource is shared by and dynamically allocated to the memorized items. We demonstrate that the model reproduces salient observations predicted by both discrete-slot and shared-resource models, and propose testable predictions of the merging phenomenon.
Modelling complex networks by random hierarchical graphs
Directory of Open Access Journals (Sweden)
M.Wróbel
2008-06-01
Full Text Available Numerous complex networks contain special patterns, called network motifs. These are specific subgraphs, which occur oftener than in randomized networks of Erdős-Rényi type. We choose one of them, the triangle, and build a family of random hierarchical graphs, being Sierpiński gasket-based graphs with random "decorations". We calculate the important characteristics of these graphs - average degree, average shortest path length, small-world graph family characteristics. They depend on probability of decorations. We analyze the Ising model on our graphs and describe its critical properties using a renormalization-group technique.
A Network Model of Credit Risk Contagion
Directory of Open Access Journals (Sweden)
Ting-Qiang Chen
2012-01-01
Full Text Available A network model of credit risk contagion is presented, in which the effect of behaviors of credit risk holders and the financial market regulators and the network structure are considered. By introducing the stochastic dominance theory, we discussed, respectively, the effect mechanisms of the degree of individual relationship, individual attitude to credit risk contagion, the individual ability to resist credit risk contagion, the monitoring strength of the financial market regulators, and the network structure on credit risk contagion. Then some derived and proofed propositions were verified through numerical simulations.
Deep space network software cost estimation model
Tausworthe, R. C.
1981-01-01
A parametric software cost estimation model prepared for Jet PRopulsion Laboratory (JPL) Deep Space Network (DSN) Data System implementation tasks is described. The resource estimation mdel modifies and combines a number of existing models. The model calibrates the task magnitude and difficulty, development environment, and software technology effects through prompted responses to a set of approximately 50 questions. Parameters in the model are adjusted to fit JPL software life-cycle statistics.
Continuum Modeling of Biological Network Formation
Albi, Giacomo
2017-04-10
We present an overview of recent analytical and numerical results for the elliptic–parabolic system of partial differential equations proposed by Hu and Cai, which models the formation of biological transportation networks. The model describes the pressure field using a Darcy type equation and the dynamics of the conductance network under pressure force effects. Randomness in the material structure is represented by a linear diffusion term and conductance relaxation by an algebraic decay term. We first introduce micro- and mesoscopic models and show how they are connected to the macroscopic PDE system. Then, we provide an overview of analytical results for the PDE model, focusing mainly on the existence of weak and mild solutions and analysis of the steady states. The analytical part is complemented by extensive numerical simulations. We propose a discretization based on finite elements and study the qualitative properties of network structures for various parameter values.
Stochastic modeling and analysis of telecoms networks
Decreusefond, Laurent
2012-01-01
This book addresses the stochastic modeling of telecommunication networks, introducing the main mathematical tools for that purpose, such as Markov processes, real and spatial point processes and stochastic recursions, and presenting a wide list of results on stability, performances and comparison of systems.The authors propose a comprehensive mathematical construction of the foundations of stochastic network theory: Markov chains, continuous time Markov chains are extensively studied using an original martingale-based approach. A complete presentation of stochastic recursions from an
Neural networks as models of psychopathology.
Aakerlund, L; Hemmingsen, R
1998-04-01
Neural network modeling is situated between neurobiology, cognitive science, and neuropsychology. The structural and functional resemblance with biological computation has made artificial neural networks (ANN) useful for exploring the relationship between neurobiology and computational performance, i.e., cognition and behavior. This review provides an introduction to the theory of ANN and how they have linked theories from neurobiology and psychopathology in schizophrenia, affective disorders, and dementia.
Decomposed Implicit Models of Piecewise - Linear Networks
Directory of Open Access Journals (Sweden)
J. Brzobohaty
1992-05-01
Full Text Available The general matrix form of the implicit description of a piecewise-linear (PWL network and the symbolic block diagram of the corresponding circuit model are proposed. Their decomposed forms enable us to determine quite separately the existence of the individual breakpoints of the resultant PWL characteristic and their coordinates using independent network parameters. For the two-diode and three-diode cases all the attainable types of the PWL characteristic are introduced.
Green Network Planning Model for Optical Backbones
DEFF Research Database (Denmark)
Gutierrez Lopez, Jose Manuel; Riaz, M. Tahir; Jensen, Michael
2010-01-01
on the environment in general. In network planning there are existing planning models focused on QoS provisioning, investment minimization or combinations of both and other parameters. But there is a lack of a model for designing green optical backbones. This paper presents novel ideas to be able to define...
Empirical generalization assessment of neural network models
DEFF Research Database (Denmark)
Larsen, Jan; Hansen, Lars Kai
1995-01-01
This paper addresses the assessment of generalization performance of neural network models by use of empirical techniques. We suggest to use the cross-validation scheme combined with a resampling technique to obtain an estimate of the generalization performance distribution of a specific model...
Evaluation of EOR Processes Using Network Models
DEFF Research Database (Denmark)
Larsen, Jens Kjell; Krogsbøll, Anette
1998-01-01
The report consists of the following parts: 1) Studies of wetting properties of model fluids and fluid mixtures aimed at an optimal selection of candidates for micromodel experiments. 2) Experimental studies of multiphase transport properties using physical models of porous networks (micromodels...
Phenomenological network models: Lessons for epilepsy surgery.
Hebbink, Jurgen; Meijer, Hil; Huiskamp, Geertjan; van Gils, Stephan; Leijten, Frans
2017-10-01
The current opinion in epilepsy surgery is that successful surgery is about removing pathological cortex in the anatomic sense. This contrasts with recent developments in epilepsy research, where epilepsy is seen as a network disease. Computational models offer a framework to investigate the influence of networks, as well as local tissue properties, and to explore alternative resection strategies. Here we study, using such a model, the influence of connections on seizures and how this might change our traditional views of epilepsy surgery. We use a simple network model consisting of four interconnected neuronal populations. One of these populations can be made hyperexcitable, modeling a pathological region of cortex. Using model simulations, the effect of surgery on the seizure rate is studied. We find that removal of the hyperexcitable population is, in most cases, not the best approach to reduce the seizure rate. Removal of normal populations located at a crucial spot in the network, the "driver," is typically more effective in reducing seizure rate. This work strengthens the idea that network structure and connections may be more important than localizing the pathological node. This can explain why lesionectomy may not always be sufficient. © 2017 The Authors. Epilepsia published by Wiley Periodicals, Inc. on behalf of International League Against Epilepsy.
Directory of Open Access Journals (Sweden)
Richard Eleftherios Boyatzis
2015-05-01
Full Text Available Personal and shared vision have a long history in management and organizational practices yet only recently have we begun to build a systematic body of empirical knowledge about the role of personal and shared vision in organizations. As the introductory paper for this special topic in Frontiers in Psychology, we present a theoretical argument as to the existence and critical role of two states in which a person, dyad, team, or organization may find themselves when engaging in the creation of a personal or shared vision: the positive emotional attractor (PEA and the negative emotional attractor (NEA. These two primary states are strange attractors, each characterized by three dimensions: (1 positive versus negative emotional arousal; (2 endocrine arousal of the parasympathetic nervous system versus sympathetic nervous system; and (3 neurological activation of the default mode network versus the task positive network. We argue that arousing the PEA is critical when creating or affirming a personal vision (i.e., sense of one’s purpose and ideal self. We begin our paper by reviewing the underpinnings of our PEA-NEA theory, briefly review each of the papers in this special issue, and conclude by discussing the practical implications of the theory.
Boyatzis, Richard E; Rochford, Kylie; Taylor, Scott N
2015-01-01
Personal and shared vision have a long history in management and organizational practices yet only recently have we begun to build a systematic body of empirical knowledge about the role of personal and shared vision in organizations. As the introductory paper for this special topic in Frontiers in Psychology, we present a theoretical argument as to the existence and critical role of two states in which a person, dyad, team, or organization may find themselves when engaging in the creation of a personal or shared vision: the positive emotional attractor (PEA) and the negative emotional attractor (NEA). These two primary states are strange attractors, each characterized by three dimensions: (1) positive versus negative emotional arousal; (2) endocrine arousal of the parasympathetic nervous system versus sympathetic nervous system; and (3) neurological activation of the default mode network versus the task positive network. We argue that arousing the PEA is critical when creating or affirming a personal vision (i.e., sense of one's purpose and ideal self). We begin our paper by reviewing the underpinnings of our PEA-NEA theory, briefly review each of the papers in this special issue, and conclude by discussing the practical implications of the theory.
Boyatzis, Richard E.; Rochford, Kylie; Taylor, Scott N.
2015-01-01
Personal and shared vision have a long history in management and organizational practices yet only recently have we begun to build a systematic body of empirical knowledge about the role of personal and shared vision in organizations. As the introductory paper for this special topic in Frontiers in Psychology, we present a theoretical argument as to the existence and critical role of two states in which a person, dyad, team, or organization may find themselves when engaging in the creation of a personal or shared vision: the positive emotional attractor (PEA) and the negative emotional attractor (NEA). These two primary states are strange attractors, each characterized by three dimensions: (1) positive versus negative emotional arousal; (2) endocrine arousal of the parasympathetic nervous system versus sympathetic nervous system; and (3) neurological activation of the default mode network versus the task positive network. We argue that arousing the PEA is critical when creating or affirming a personal vision (i.e., sense of one’s purpose and ideal self). We begin our paper by reviewing the underpinnings of our PEA–NEA theory, briefly review each of the papers in this special issue, and conclude by discussing the practical implications of the theory. PMID:26052300
Co-existing hidden attractors in a radio-physical oscillator system
DEFF Research Database (Denmark)
Kuznetsov, A. P.; Kuznetsov, S. P.; Mosekilde, Erik
2015-01-01
, this paper describes the formation of several different coexisting sets of hidden attractors, including the simultaneous presence of a pair of coinciding quasiperiodic attractors and of two mutually symmetric chaotic attractors. We follow the dynamics of the system as a function of the basic oscillator...
Models of network reliability analysis, combinatorics, and Monte Carlo
Gertsbakh, Ilya B
2009-01-01
Unique in its approach, Models of Network Reliability: Analysis, Combinatorics, and Monte Carlo provides a brief introduction to Monte Carlo methods along with a concise exposition of reliability theory ideas. From there, the text investigates a collection of principal network reliability models, such as terminal connectivity for networks with unreliable edges and/or nodes, network lifetime distribution in the process of its destruction, network stationary behavior for renewable components, importance measures of network elements, reliability gradient, and network optimal reliability synthesis
Delay and Disruption Tolerant Networking MACHETE Model
Segui, John S.; Jennings, Esther H.; Gao, Jay L.
2011-01-01
To verify satisfaction of communication requirements imposed by unique missions, as early as 2000, the Communications Networking Group at the Jet Propulsion Laboratory (JPL) saw the need for an environment to support interplanetary communication protocol design, validation, and characterization. JPL's Multi-mission Advanced Communications Hybrid Environment for Test and Evaluation (MACHETE), described in Simulator of Space Communication Networks (NPO-41373) NASA Tech Briefs, Vol. 29, No. 8 (August 2005), p. 44, combines various commercial, non-commercial, and in-house custom tools for simulation and performance analysis of space networks. The MACHETE environment supports orbital analysis, link budget analysis, communications network simulations, and hardware-in-the-loop testing. As NASA is expanding its Space Communications and Navigation (SCaN) capabilities to support planned and future missions, building infrastructure to maintain services and developing enabling technologies, an important and broader role is seen for MACHETE in design-phase evaluation of future SCaN architectures. To support evaluation of the developing Delay Tolerant Networking (DTN) field and its applicability for space networks, JPL developed MACHETE models for DTN Bundle Protocol (BP) and Licklider/Long-haul Transmission Protocol (LTP). DTN is an Internet Research Task Force (IRTF) architecture providing communication in and/or through highly stressed networking environments such as space exploration and battlefield networks. Stressed networking environments include those with intermittent (predictable and unknown) connectivity, large and/or variable delays, and high bit error rates. To provide its services over existing domain specific protocols, the DTN protocols reside at the application layer of the TCP/IP stack, forming a store-and-forward overlay network. The key capabilities of the Bundle Protocol include custody-based reliability, the ability to cope with intermittent connectivity
A comprehensive Network Security Risk Model for process control networks.
Henry, Matthew H; Haimes, Yacov Y
2009-02-01
The risk of cyber attacks on process control networks (PCN) is receiving significant attention due to the potentially catastrophic extent to which PCN failures can damage the infrastructures and commodity flows that they support. Risk management addresses the coupled problems of (1) reducing the likelihood that cyber attacks would succeed in disrupting PCN operation and (2) reducing the severity of consequences in the event of PCN failure or manipulation. The Network Security Risk Model (NSRM) developed in this article provides a means of evaluating the efficacy of candidate risk management policies by modeling the baseline risk and assessing expectations of risk after the implementation of candidate measures. Where existing risk models fall short of providing adequate insight into the efficacy of candidate risk management policies due to shortcomings in their structure or formulation, the NSRM provides model structure and an associated modeling methodology that captures the relevant dynamics of cyber attacks on PCN for risk analysis. This article develops the NSRM in detail in the context of an illustrative example.
Personalized Learning Network Teaching Model
Feng, Zhou
Adaptive learning system on the salient features, expounded personalized learning is adaptive learning system adaptive to learners key to learning. From the perspective of design theory, put forward an adaptive learning system to learn design thinking individual model, and using data mining techniques, the initial establishment of personalized adaptive systems model of learning.
Volatility Clustering and Scaling for Financial Time Series due to Attractor Bubbling
Krawiecki, A.; Hołyst, J. A.; Helbing, D.
2002-09-01
A microscopic model of financial markets is considered, consisting of many interacting agents (spins) with global coupling and discrete-time heat bath dynamics, similar to random Ising systems. The interactions between agents change randomly in time. In the thermodynamic limit, the obtained time series of price returns show chaotic bursts resulting from the emergence of attractor bubbling or on-off intermittency, resembling the empirical financial time series with volatility clustering. For a proper choice of the model parameters, the probability distributions of returns exhibit power-law tails with scaling exponents close to the empirical ones.
Modelling Users` Trust in Online Social Networks
Directory of Open Access Journals (Sweden)
Iacob Cătoiu
2014-02-01
Full Text Available Previous studies (McKnight, Lankton and Tripp, 2011; Liao, Lui and Chen, 2011 have shown the crucial role of trust when choosing to disclose sensitive information online. This is the case of online social networks users, who must disclose a certain amount of personal data in order to gain access to these online services. Taking into account privacy calculus model and the risk/benefit ratio, we propose a model of users’ trust in online social networks with four variables. We have adapted metrics for the purpose of our study and we have assessed their reliability and validity. We use a Partial Least Squares (PLS based structural equation modelling analysis, which validated all our initial assumptions, indicating that our three predictors (privacy concerns, perceived benefits and perceived risks explain 48% of the variation of users’ trust in online social networks, the resulting variable of our study. We also discuss the implications and further research opportunities of our study.
Model Microvascular Networks Can Have Many Equilibria.
Karst, Nathaniel J; Geddes, John B; Carr, Russell T
2017-03-01
We show that large microvascular networks with realistic topologies, geometries, boundary conditions, and constitutive laws can exhibit many steady-state flow configurations. This is in direct contrast to most previous studies which have assumed, implicitly or explicitly, that a given network can only possess one equilibrium state. While our techniques are general and can be applied to any network, we focus on two distinct network types that model human tissues: perturbed honeycomb networks and random networks generated from Voronoi diagrams. We demonstrate that the disparity between observed and predicted flow directions reported in previous studies might be attributable to the presence of multiple equilibria. We show that the pathway effect, in which hematocrit is steadily increased along a series of diverging junctions, has important implications for equilibrium discovery, and that our estimates of the number of equilibria supported by these networks are conservative. If a more complete description of the plasma skimming effect that captures red blood cell allocation at junctions with high feed hematocrit were to be obtained empirically, then the number of equilibria found by our approach would at worst remain the same and would in all likelihood increase significantly.
PREDIKSI FOREX MENGGUNAKAN MODEL NEURAL NETWORK
Directory of Open Access Journals (Sweden)
R. Hadapiningradja Kusumodestoni
2015-11-01
Full Text Available ABSTRAK Prediksi adalah salah satu teknik yang paling penting dalam menjalankan bisnis forex. Keputusan dalam memprediksi adalah sangatlah penting, karena dengan prediksi dapat membantu mengetahui nilai forex di waktu tertentu kedepan sehingga dapat mengurangi resiko kerugian. Tujuan dari penelitian ini dimaksudkan memprediksi bisnis fores menggunakan model neural network dengan data time series per 1 menit untuk mengetahui nilai akurasi prediksi sehingga dapat mengurangi resiko dalam menjalankan bisnis forex. Metode penelitian pada penelitian ini meliputi metode pengumpulan data kemudian dilanjutkan ke metode training, learning, testing menggunakan neural network. Setelah di evaluasi hasil penelitian ini menunjukan bahwa penerapan algoritma Neural Network mampu untuk memprediksi forex dengan tingkat akurasi prediksi 0.431 +/- 0.096 sehingga dengan prediksi ini dapat membantu mengurangi resiko dalam menjalankan bisnis forex. Kata kunci: prediksi, forex, neural network.
Artificial neural network cardiopulmonary modeling and diagnosis
Kangas, Lars J.; Keller, Paul E.
1997-01-01
The present invention is a method of diagnosing a cardiopulmonary condition in an individual by comparing data from a progressive multi-stage test for the individual to a non-linear multi-variate model, preferably a recurrent artificial neural network having sensor fusion. The present invention relies on a cardiovascular model developed from physiological measurements of an individual. Any differences between the modeled parameters and the parameters of an individual at a given time are used for diagnosis.
Hopfield's Model of Patterns Recognition and Laws of Artistic Perception
Yevin, Igor; Koblyakov, Alexander
The model of patterns recognition or attractor network model of associative memory, offered by J.Hopfield 1982, is the most known model in theoretical neuroscience. This paper aims to show, that such well-known laws of art perception as the Wundt curve, perception of visual ambiguity in art, and also the model perception of musical tonalities are nothing else than special cases of the Hopfield’s model of patterns recognition.
Spiking modular neural networks: A neural network modeling approach for hydrological processes
National Research Council Canada - National Science Library
Kamban Parasuraman; Amin Elshorbagy; Sean K. Carey
2006-01-01
.... In this study, a novel neural network model called the spiking modular neural networks (SMNNs) is proposed. An SMNN consists of an input layer, a spiking layer, and an associator neural network layer...
PROJECT ACTIVITY ANALYSIS WITHOUT THE NETWORK MODEL
Directory of Open Access Journals (Sweden)
S. Munapo
2012-01-01
Full Text Available
ENGLISH ABSTRACT: This paper presents a new procedure for analysing and managing activity sequences in projects. The new procedure determines critical activities, critical path, start times, free floats, crash limits, and other useful information without the use of the network model. Even though network models have been successfully used in project management so far, there are weaknesses associated with the use. A network is not easy to generate, and dummies that are usually associated with it make the network diagram complex – and dummy activities have no meaning in the original project management problem. The network model for projects can be avoided while still obtaining all the useful information that is required for project management. What are required are the activities, their accurate durations, and their predecessors.
AFRIKAANSE OPSOMMING: Die navorsing beskryf ’n nuwerwetse metode vir die ontleding en bestuur van die sekwensiële aktiwiteite van projekte. Die voorgestelde metode bepaal kritiese aktiwiteite, die kritieke pad, aanvangstye, speling, verhasing, en ander groothede sonder die gebruik van ’n netwerkmodel. Die metode funksioneer bevredigend in die praktyk, en omseil die administratiewe rompslomp van die tradisionele netwerkmodelle.
Algebraic Statistics for Network Models
2014-02-19
use algebra, combinatorics and Markov bases to give a constructing way of answering this question for ERGMs of interest. Question 2: How do we model...for every function. 06/06/13 Petrović. Manuscripts 8, 10. Invited lecture at the Scientific Session on Commutative Algebra and Combinatorics at the
Network Modeling and Simulation (NEMSE)
2013-07-01
Prioritized Packet Fragmentation", IEEE Trans. Multimedia , Oct. 2012. [13 SYSENG] . Defense Acquisition Guidebook, Chapter 4 System Engineering, and...2012 IEEE High Performance Extreme Computing Conference (HPEC) poster session [1 Ross]. Motivation Air Force Research Lab needs o Capability...is virtual. These eight virtualizations were: System-in-the-Loop (SITL) using OPNET Modeler, COPE, Field Programmable Gate Array ( FPGA Physical
Security Modeling on the Supply Chain Networks
Directory of Open Access Journals (Sweden)
Marn-Ling Shing
2007-10-01
Full Text Available In order to keep the price down, a purchaser sends out the request for quotation to a group of suppliers in a supply chain network. The purchaser will then choose a supplier with the best combination of price and quality. A potential supplier will try to collect the related information about other suppliers so he/she can offer the best bid to the purchaser. Therefore, confidentiality becomes an important consideration for the design of a supply chain network. Chen et al. have proposed the application of the Bell-LaPadula model in the design of a secured supply chain network. In the Bell-LaPadula model, a subject can be in one of different security clearances and an object can be in one of various security classifications. All the possible combinations of (Security Clearance, Classification pair in the Bell-LaPadula model can be thought as different states in the Markov Chain model. This paper extends the work done by Chen et al., provides more details on the Markov Chain model and illustrates how to use it to monitor the security state transition in the supply chain network.
An evolving model of online bipartite networks
Zhang, Chu-Xu; Zhang, Zi-Ke; Liu, Chuang
2013-12-01
Understanding the structure and evolution of online bipartite networks is a significant task since they play a crucial role in various e-commerce services nowadays. Recently, various attempts have been tried to propose different models, resulting in either power-law or exponential degree distributions. However, many empirical results show that the user degree distribution actually follows a shifted power-law distribution, the so-called Mandelbrot’s law, which cannot be fully described by previous models. In this paper, we propose an evolving model, considering two different user behaviors: random and preferential attachment. Extensive empirical results on two real bipartite networks, Delicious and CiteULike, show that the theoretical model can well characterize the structure of real networks for both user and object degree distributions. In addition, we introduce a structural parameter p, to demonstrate that the hybrid user behavior leads to the shifted power-law degree distribution, and the region of power-law tail will increase with the increment of p. The proposed model might shed some lights in understanding the underlying laws governing the structure of real online bipartite networks.
Attractor for a Viscous Coupled Camassa-Holm Equation
Directory of Open Access Journals (Sweden)
Tian Lixin
2010-01-01
Full Text Available The global existence of solution to a viscous coupled Camassa-Holm equation with the periodic boundary condition is investigated. We obtain the compact and bounded absorbing set and the existence of the global attractor for the viscous coupled Camassa-Holm equation in by uniform prior estimate.
Exploring Strange Nonchaotic Attractors through Jacobian Elliptic Functions
Garcia-Hoz, A. Martinez; Chacon, R.
2011-01-01
We demonstrate the effectiveness of Jacobian elliptic functions (JEFs) for inquiring into the reshaping effect of quasiperiodic forces in nonlinear nonautonomous systems exhibiting strange nonchaotic attractors (SNAs). Specifically, we characterize analytically and numerically some reshaping-induced transitions starting from SNAs in the context of…
MAXIMUM-LIKELIHOOD-ESTIMATION OF THE ENTROPY OF AN ATTRACTOR
SCHOUTEN, JC; TAKENS, F; VANDENBLEEK, CM
In this paper, a maximum-likelihood estimate of the (Kolmogorov) entropy of an attractor is proposed that can be obtained directly from a time series. Also, the relative standard deviation of the entropy estimate is derived; it is dependent on the entropy and on the number of samples used in the
On the importance of the convergence to climate attractors
Drótos, Gábor; Bódai, Tamás; Tél, Tamás
2017-06-01
Ensemble approaches are becoming widely used in climate research. In contrast to weather forecast, however, in the climatic context one is interested in long-time properties, those arising on the scale of several decades. The well-known strong internal variability of the climate system implies the existence of a related dynamical attractor with chaotic properties. Under the condition of climate change this should be a snapshot attractor, naturally arising in an ensemble-based framework. Although ensemble averages can be evaluated at any instant of time, results obtained during the process of convergence of the ensemble towards the attractor are not relevant from the point of view of climate. In simulations, therefore, attention should be paid to whether the convergence to the attractor has taken place. We point out that this convergence is of exponential character, therefore, in a finite amount of time after initialization relevant results can be obtained. The role of the time scale separation due to the presence of the deep ocean is discussed from the point of view of ensemble simulations.
Attractor horizons in six-dimensional type IIB supergravity
Energy Technology Data Exchange (ETDEWEB)
Astefanesei, Dumitru, E-mail: dumitru.astefanesei@ucv.cl [Instituto de Fisica, Pontificia Universidad Catolica de Valparaiso, Casilla 4059, Valparaiso (Chile); Miskovic, Olivera, E-mail: olivera.miskovic@ucv.cl [Instituto de Fisica, Pontificia Universidad Catolica de Valparaiso, Casilla 4059, Valparaiso (Chile); Olea, Rodrigo, E-mail: rodrigo.olea@unab.cl [Universidad Andres Bello, Departamento de Ciencias Fisicas, Republica 220, Santiago (Chile)
2012-08-14
We consider near horizon geometries of extremal black holes in six-dimensional type IIB supergravity. In particular, we use the entropy function formalism to compute the charges and thermodynamic entropy of these solutions. We also comment on the role of attractor mechanism in understanding the entropy of the Hopf T-dual solutions in type IIA supergravity.
Recurrence quantification analysis in Liu's attractor
Energy Technology Data Exchange (ETDEWEB)
Balibrea, Francisco [Universidad de Murcia, Departamento de Matematicas, Campus de Espinardo, 30100 Murcia (Spain)], E-mail: balibrea@um.es; Caballero, M. Victoria [Universidad de Murcia, Departamento de Metodos Cuantitativos para la Economia, Campus de Espinardo, 30100 Murcia (Spain)], E-mail: mvictori@um.es; Molera, Lourdes [Universidad de Murcia, Departamento de Metodos Cuantitativos para la Economia, Campus de Espinardo, 30100 Murcia (Spain)
2008-05-15
Recurrence Quantification Analysis is used to detect transitions chaos to periodical states or chaos to chaos in a new dynamical system proposed by Liu et al. This system contains a control parameter in the second equation and was originally introduced to investigate the forming mechanism of the compound structure of the chaotic attractor which exists when the control parameter is zero.
Estimation of dynamic properties of attractors observed in hollow ...
Indian Academy of Sciences (India)
an infinite dimensional process, may corrupt the true data in phase space for very large value of DIM, resulting incorrect computation of λ1. Therefore, DIM should be kept as minimum as possible but higher than the minimum required one for correct computation. If the dimension of the attractor is not known beforehand, ...
Lan Liu; Ryan K. L. Ko; Guangming Ren; Xiaoping Xu
2017-01-01
As the adoption of Software Defined Networks (SDNs) grows, the security of SDN still has several unaddressed limitations. A key network security research area is in the study of malware propagation across the SDN-enabled networks. To analyze the spreading processes of network malware (e.g., viruses) in SDN, we propose a dynamic model with a time-varying community network, inspired by research models on the spread of epidemics in complex networks across communities. We assume subnets of the ne...
An autocatalytic network model for stock markets
Caetano, Marco Antonio Leonel; Yoneyama, Takashi
2015-02-01
The stock prices of companies with businesses that are closely related within a specific sector of economy might exhibit movement patterns and correlations in their dynamics. The idea in this work is to use the concept of autocatalytic network to model such correlations and patterns in the trends exhibited by the expected returns. The trends are expressed in terms of positive or negative returns within each fixed time interval. The time series derived from these trends is then used to represent the movement patterns by a probabilistic boolean network with transitions modeled as an autocatalytic network. The proposed method might be of value in short term forecasting and identification of dependencies. The method is illustrated with a case study based on four stocks of companies in the field of natural resource and technology.
Marupaka, Nagendra; Iyer, Laxmi R; Minai, Ali A
2012-08-01
Understanding cognition has been a central focus for psychologists, neuroscientists and philosophers for thousands of years, but many of its most fundamental processes remain very poorly understood. Chief among these is the process of thought itself: the spontaneous emergence of specific ideas within the stream of consciousness. It is widely accepted that ideas, both familiar and novel, arise from the combination of existing concepts. From this perspective, thought is an emergent attribute of memory, arising from the intrinsic dynamics of the neural substrate in which information is embedded. An important issue in any understanding of this process is the relationship between the emergence of conceptual combinations and the dynamics of the underlying neural networks. Virtually all theories of ideation hypothesize that ideas arise during the thought process through association, each one triggering the next through some type of linkage, e.g., structural analogy, semantic similarity, polysemy, etc. In particular, it has been suggested that the creativity of ideation in individuals reflects the qualitative structure of conceptual associations in their minds. Interestingly, psycholinguistic studies have shown that semantic networks across many languages have a particular type of structure with small-world, scale free connectivity. So far, however, these related insights have not been brought together, in part because there has been no explicitly neural model for the dynamics of spontaneous thought. Recently, we have developed such a model. Though simplistic and abstract, this model attempts to capture the most basic aspects of the process hypothesized by theoretical models within a neurodynamical framework. It represents semantic memory as a recurrent semantic neural network with itinerant dynamics. Conceptual combinations arise through this dynamics as co-active groups of neural units, and either dissolve quickly or persist for a time as emergent metastable attractors
DeCross, Matthew P.; Kaiser, David I.; Prabhu, Anirudh; Prescod-Weinstein, Chanda; Sfakianakis, Evangelos I.
2018-01-01
This is the first of a three-part series of papers, in which we study the preheating phase for multifield models of inflation involving nonminimal couplings. In this paper, we study the single-field attractor behavior that these models exhibit during inflation and quantify its strength and parameter dependence. We further demonstrate that the strong single-field attractor behavior persists after the end of inflation. Preheating in such models therefore generically avoids the "dephasing" that typically affects multifield models with minimally coupled fields, allowing efficient transfer of energy from the oscillating inflaton condensate(s) to coupled perturbations across large portions of parameter space. We develop a doubly covariant formalism for studying the preheating phase in such models and identify several features specific to multifield models with nonminimal couplings, including effects that arise from the nontrivial field-space manifold. In papers II and III, we apply this formalism to study how the amplification of adiabatic and isocurvature perturbations varies with parameters, highlighting several distinct regimes depending on the magnitude of the nonminimal couplings ξI.
Keystone Business Models for Network Security Processors
Directory of Open Access Journals (Sweden)
Arthur Low
2013-07-01
Full Text Available Network security processors are critical components of high-performance systems built for cybersecurity. Development of a network security processor requires multi-domain experience in semiconductors and complex software security applications, and multiple iterations of both software and hardware implementations. Limited by the business models in use today, such an arduous task can be undertaken only by large incumbent companies and government organizations. Neither the “fabless semiconductor” models nor the silicon intellectual-property licensing (“IP-licensing” models allow small technology companies to successfully compete. This article describes an alternative approach that produces an ongoing stream of novel network security processors for niche markets through continuous innovation by both large and small companies. This approach, referred to here as the "business ecosystem model for network security processors", includes a flexible and reconfigurable technology platform, a “keystone” business model for the company that maintains the platform architecture, and an extended ecosystem of companies that both contribute and share in the value created by innovation. New opportunities for business model innovation by participating companies are made possible by the ecosystem model. This ecosystem model builds on: i the lessons learned from the experience of the first author as a senior integrated circuit architect for providers of public-key cryptography solutions and as the owner of a semiconductor startup, and ii the latest scholarly research on technology entrepreneurship, business models, platforms, and business ecosystems. This article will be of interest to all technology entrepreneurs, but it will be of particular interest to owners of small companies that provide security solutions and to specialized security professionals seeking to launch their own companies.
A Model of Mental State Transition Network
Xiang, Hua; Jiang, Peilin; Xiao, Shuang; Ren, Fuji; Kuroiwa, Shingo
Emotion is one of the most essential and basic attributes of human intelligence. Current AI (Artificial Intelligence) research is concentrating on physical components of emotion, rarely is it carried out from the view of psychology directly(1). Study on the model of artificial psychology is the first step in the development of human-computer interaction. As affective computing remains unpredictable, creating a reasonable mental model becomes the primary task for building a hybrid system. A pragmatic mental model is also the fundament of some key topics such as recognition and synthesis of emotions. In this paper a Mental State Transition Network Model(2) is proposed to detect human emotions. By a series of psychological experiments, we present a new way to predict coming human's emotions depending on the various current emotional states under various stimuli. Besides, people in different genders and characters are taken into consideration in our investigation. According to the psychological experiments data derived from 200 questionnaires, a Mental State Transition Network Model for describing the transitions in distribution among the emotions and relationships between internal mental situations and external are concluded. Further more the coefficients of the mental transition network model were achieved. Comparing seven relative evaluating experiments, an average precision rate of 0.843 is achieved using a set of samples for the proposed model.
UAV Trajectory Modeling Using Neural Networks
Xue, Min
2017-01-01
Massive small unmanned aerial vehicles are envisioned to operate in the near future. While there are lots of research problems need to be addressed before dense operations can happen, trajectory modeling remains as one of the keys to understand and develop policies, regulations, and requirements for safe and efficient unmanned aerial vehicle operations. The fidelity requirement of a small unmanned vehicle trajectory model is high because these vehicles are sensitive to winds due to their small size and low operational altitude. Both vehicle control systems and dynamic models are needed for trajectory modeling, which makes the modeling a great challenge, especially considering the fact that manufactures are not willing to share their control systems. This work proposed to use a neural network approach for modelling small unmanned vehicle's trajectory without knowing its control system and bypassing exhaustive efforts for aerodynamic parameter identification. As a proof of concept, instead of collecting data from flight tests, this work used the trajectory data generated by a mathematical vehicle model for training and testing the neural network. The results showed great promise because the trained neural network can predict 4D trajectories accurately, and prediction errors were less than 2:0 meters in both temporal and spatial dimensions.
Propagation models for computing biochemical reaction networks
Henzinger, Thomas A; Mateescu, Maria
2011-01-01
We introduce propagation models, a formalism designed to support general and efficient data structures for the transient analysis of biochemical reaction networks. We give two use cases for propagation abstract data types: the uniformization method and numerical integration. We also sketch an implementation of a propagation abstract data type, which uses abstraction to approximate states.
Modelling crime linkage with Bayesian networks
de Zoete, J.; Sjerps, M.; Lagnado, D.; Fenton, N.
2015-01-01
When two or more crimes show specific similarities, such as a very distinct modus operandi, the probability that they were committed by the same offender becomes of interest. This probability depends on the degree of similarity and distinctiveness. We show how Bayesian networks can be used to model
Lagrangian modeling of switching electrical networks
Scherpen, Jacquelien M.A.; Jeltsema, Dimitri; Klaassens, J. Ben
2003-01-01
In this paper, a general and systematic method is presented to model topologically complete electrical networks, with or without multiple or single switches, within the Euler–Lagrange framework. Apart from the physical insight that can be obtained in this way, the framework has proven to be useful
Computational Modeling of Complex Protein Activity Networks
Schivo, Stefano; Leijten, Jeroen; Karperien, Marcel; Post, Janine N.; Prignet, Claude
2017-01-01
Because of the numerous entities interacting, the complexity of the networks that regulate cell fate makes it impossible to analyze and understand them using the human brain alone. Computational modeling is a powerful method to unravel complex systems. We recently described the development of a
Modeling Network Transition Constraints with Hypergraphs
DEFF Research Database (Denmark)
Harrod, Steven
2011-01-01
values. A directed hypergraph formulation is derived to address railway network sequencing constraints, and an experimental problem sample solved to estimate the magnitude of objective inflation when interaction effects are ignored. The model is used to demonstrate the value of advance scheduling...
A neural network model for texture discrimination.
Xing, J; Gerstein, G L
1993-01-01
A model of texture discrimination in visual cortex was built using a feedforward network with lateral interactions among relatively realistic spiking neural elements. The elements have various membrane currents, equilibrium potentials and time constants, with action potentials and synapses. The model is derived from the modified programs of MacGregor (1987). Gabor-like filters are applied to overlapping regions in the original image; the neural network with lateral excitatory and inhibitory interactions then compares and adjusts the Gabor amplitudes in order to produce the actual texture discrimination. Finally, a combination layer selects and groups various representations in the output of the network to form the final transformed image material. We show that both texture segmentation and detection of texture boundaries can be represented in the firing activity of such a network for a wide variety of synthetic to natural images. Performance details depend most strongly on the global balance of strengths of the excitatory and inhibitory lateral interconnections. The spatial distribution of lateral connective strengths has relatively little effect. Detailed temporal firing activities of single elements in the lateral connected network were examined under various stimulus conditions. Results show (as in area 17 of cortex) that a single element's response to image features local to its receptive field can be altered by changes in the global context.
Detection of strong attractors in social media networks
National Research Council Canada - National Science Library
Qasem, Ziyaad; Jansen, Marc; Hecking, Tobias; Hoppe, H Ulrich
2016-01-01
Detection of influential actors in social media such as Twitter or Facebook plays an important role for improving the quality and efficiency of work and services in many fields such as education and marketing...
Propagating semantic information in biochemical network models
Directory of Open Access Journals (Sweden)
Schulz Marvin
2012-01-01
Full Text Available Abstract Background To enable automatic searches, alignments, and model combination, the elements of systems biology models need to be compared and matched across models. Elements can be identified by machine-readable biological annotations, but assigning such annotations and matching non-annotated elements is tedious work and calls for automation. Results A new method called "semantic propagation" allows the comparison of model elements based not only on their own annotations, but also on annotations of surrounding elements in the network. One may either propagate feature vectors, describing the annotations of individual elements, or quantitative similarities between elements from different models. Based on semantic propagation, we align partially annotated models and find annotations for non-annotated model elements. Conclusions Semantic propagation and model alignment are included in the open-source library semanticSBML, available on sourceforge. Online services for model alignment and for annotation prediction can be used at http://www.semanticsbml.org.
Distributed Bayesian Networks for User Modeling
DEFF Research Database (Denmark)
Tedesco, Roberto; Dolog, Peter; Nejdl, Wolfgang
2006-01-01
The World Wide Web is a popular platform for providing eLearning applications to a wide spectrum of users. However – as users differ in their preferences, background, requirements, and goals – applications should provide personalization mechanisms. In the Web context, user models used...... of Web-based eLearning platforms. The scenario we are tackling assumes learners who use several systems over time, which are able to create partial Bayesian Networks for user models based on the local system context. In particular, we focus on how to merge these partial user models. Our merge mechanism...... efficiently combines distributed learner models without the need to exchange internal structure of local Bayesian networks, nor local evidence between the involved platforms....
Network traffic model using GIPP and GIBP
Lee, Yong Duk; Van de Liefvoort, Appie; Wallace, Victor L.
1998-10-01
In telecommunication networks, the correlated nature of teletraffic patterns can have significant impact on queuing measures such as queue length, blocking and delay. There is, however, not yet a good general analytical description which can easily incorporate the correlation effect of the traffic, while at the same time maintaining the ease of modeling. The authors have shown elsewhere, that the covariance structures of the generalized Interrupted Poisson Process (GIPP) and the generalized Interrupted Bernoulli Process (GIBP) have an invariance property which makes them reasonably general, yet algebraically manageable, models for representing correlated network traffic. The GIPP and GIBP have a surprisingly rich sets of parameters, yet these invariance properties enable us to easily incorporate the covariance function as well as the interarrival time distribution into the model to better matchobservations. In this paper, we show an application of GIPP and GIBP for matching an analytical model to observed or experimental data.
Model Predictive Control of Sewer Networks
DEFF Research Database (Denmark)
Pedersen, Einar B.; Herbertsson, Hannes R.; Niemann, Henrik
2016-01-01
The developments in solutions for management of urban drainage are of vital importance, as the amount of sewer water from urban areas continues to increase due to the increase of the world’s population and the change in the climate conditions. How a sewer network is structured, monitored and cont...... benchmark model. Due to the inherent constraints the applied approach is based on Model Predictive Control....
Modeling Multistandard Wireless Networks in OPNET
DEFF Research Database (Denmark)
Zakrzewska, Anna; Berger, Michael Stübert; Ruepp, Sarah Renée
2011-01-01
Future wireless communication is emerging towards one heterogeneous platform. In this new environment wireless access will be provided by multiple radio technologies that are cooperating and complementing one another. The paper investigates the possibilities of developing such a multistandard...... system using OPNET Modeler. A network model consisting of LTE interworking with WLAN and WiMAX is considered from the radio resource management perspective. In particular, implementing a joint packet scheduler across multiple systems is discussed more in detail....
Modelling dendritic ecological networks in space: anintegrated network perspective
Peterson, Erin E.; Ver Hoef, Jay M.; Isaak, Dan J.; Falke, Jeffrey A.; Fortin, Marie-Josée; Jordon, Chris E.; McNyset, Kristina; Monestiez, Pascal; Ruesch, Aaron S.; Sengupta, Aritra; Som, Nicholas; Steel, E. Ashley; Theobald, David M.; Torgersen, Christian E.; Wenger, Seth J.
2013-01-01
Dendritic ecological networks (DENs) are a unique form of ecological networks that exhibit a dendritic network topology (e.g. stream and cave networks or plant architecture). DENs have a dual spatial representation; as points within the network and as points in geographical space. Consequently, some analytical methods used to quantify relationships in other types of ecological networks, or in 2-D space, may be inadequate for studying the influence of structure and connectivity on ecological processes within DENs. We propose a conceptual taxonomy of network analysis methods that account for DEN characteristics to varying degrees and provide a synthesis of the different approaches within
Cocaine-Induced Changes in Low-Dimensional Attractors of Local Field Potentials in Optogenetic Mice
Directory of Open Access Journals (Sweden)
Sorinel A. Oprisan
2018-01-01
Full Text Available Optogenetically evoked local field potential (LFP recorded from the medial prefrontal cortex (mPFC of mice during basal conditions and following a systemic cocaine administration were analyzed. Blue light stimuli were delivered to mPFC through a fiber optic every 2 s and each trial was repeated 100 times. As in the previous study, we used a surrogate data method to check that nonlinearity was present in the experimental LFPs and only used the last 1.5 s of steady activity to measure the LFPs phase resetting induced by the brief 10 ms light stimulus. We found that the steady dynamics of the mPFC in response to light stimuli could be reconstructed in a three-dimensional phase space with topologically similar “8”-shaped attractors across different animals. Therefore, cocaine did not change the complexity of the recorded nonlinear data compared to the control case. The phase space of the reconstructed attractor is determined by the LFP time series and its temporally shifted versions by a multiple of some lag time. We also compared the change in the attractor shape between cocaine-injected and control using (1 dendrogram clustering and (2 Frechet distance. We found about 20% overlap between control and cocaine trials when classified using dendrogram method, which suggest that it may be possible to describe mathematically both data sets with the same model and slightly different model parameters. We also found that the lag times are about three times shorter for cocaine trials compared to control. As a result, although the phase space trajectories for control and cocaine may look similar, their dynamics is significantly different.
Spatial Models and Networks of Living Systems
DEFF Research Database (Denmark)
Juul, Jeppe Søgaard
When studying the dynamics of living systems, insight can often be gained by developing a mathematical model that can predict future behaviour of the system or help classify system characteristics. However, in living cells, organisms, and especially groups of interacting individuals, a large number....... Such systems are known to be stabilized by spatial structure. Finally, I analyse data from a large mobile phone network and show that people who are topologically close in the network have similar communication patterns. This main part of the thesis is based on six different articles, which I have co...
On traffic modelling in GPRS networks
DEFF Research Database (Denmark)
Madsen, Tatiana Kozlova; Schwefel, Hans-Peter; Prasad, Ramjee
2005-01-01
Optimal design and dimensioning of wireless data networks, such as GPRS, requires the knowledge of traffic characteristics of different data services. This paper presents an in-detail analysis of an IP-level traffic measurements taken in an operational GPRS network. The data measurements reported...... here are done at the Gi interface. The aim of this paper is to reveal some key statistics of GPRS data applications and to validate if the existing traffic models can adequately describe traffic volume and inter-arrival time distribution for different services. Additionally, we present a method of user...
Neural Network Model of memory retrieval
Directory of Open Access Journals (Sweden)
Stefano eRecanatesi
2015-12-01
Full Text Available Human memory can store large amount of information. Nevertheless, recalling is often achallenging task. In a classical free recall paradigm, where participants are asked to repeat abriefly presented list of words, people make mistakes for lists as short as 5 words. We present amodel for memory retrieval based on a Hopfield neural network where transition between itemsare determined by similarities in their long-term memory representations. Meanfield analysis ofthe model reveals stable states of the network corresponding (1 to single memory representationsand (2 intersection between memory representations. We show that oscillating feedback inhibitionin the presence of noise induces transitions between these states triggering the retrieval ofdifferent memories. The network dynamics qualitatively predicts the distribution of time intervalsrequired to recall new memory items observed in experiments. It shows that items having largernumber of neurons in their representation are statistically easier to recall and reveals possiblebottlenecks in our ability of retrieving memories. Overall, we propose a neural network model ofinformation retrieval broadly compatible with experimental observations and is consistent with ourrecent graphical model (Romani et al., 2013.
A improved Network Security Situation Awareness Model
Directory of Open Access Journals (Sweden)
Li Fangwei
2015-08-01
Full Text Available In order to reflect the situation of network security assessment performance fully and accurately, a new network security situation awareness model based on information fusion was proposed. Network security situation is the result of fusion three aspects evaluation. In terms of attack, to improve the accuracy of evaluation, a situation assessment method of DDoS attack based on the information of data packet was proposed. In terms of vulnerability, a improved Common Vulnerability Scoring System (CVSS was raised and maked the assessment more comprehensive. In terms of node weights, the method of calculating the combined weights and optimizing the result by Sequence Quadratic Program (SQP algorithm which reduced the uncertainty of fusion was raised. To verify the validity and necessity of the method, a testing platform was built and used to test through evaluating 2000 DAPRA data sets. Experiments show that the method can improve the accuracy of evaluation results.
AHaH Computing–From Metastable Switches to Attractors to Machine Learning
Nugent, Michael Alexander; Molter, Timothy Wesley
2014-01-01
Modern computing architecture based on the separation of memory and processing leads to a well known problem called the von Neumann bottleneck, a restrictive limit on the data bandwidth between CPU and RAM. This paper introduces a new approach to computing we call AHaH computing where memory and processing are combined. The idea is based on the attractor dynamics of volatile dissipative electronics inspired by biological systems, presenting an attractive alternative architecture that is able to adapt, self-repair, and learn from interactions with the environment. We envision that both von Neumann and AHaH computing architectures will operate together on the same machine, but that the AHaH computing processor may reduce the power consumption and processing time for certain adaptive learning tasks by orders of magnitude. The paper begins by drawing a connection between the properties of volatility, thermodynamics, and Anti-Hebbian and Hebbian (AHaH) plasticity. We show how AHaH synaptic plasticity leads to attractor states that extract the independent components of applied data streams and how they form a computationally complete set of logic functions. After introducing a general memristive device model based on collections of metastable switches, we show how adaptive synaptic weights can be formed from differential pairs of incremental memristors. We also disclose how arrays of synaptic weights can be used to build a neural node circuit operating AHaH plasticity. By configuring the attractor states of the AHaH node in different ways, high level machine learning functions are demonstrated. This includes unsupervised clustering, supervised and unsupervised classification, complex signal prediction, unsupervised robotic actuation and combinatorial optimization of procedures–all key capabilities of biological nervous systems and modern machine learning algorithms with real world application. PMID:24520315
AHaH computing-from metastable switches to attractors to machine learning.
Directory of Open Access Journals (Sweden)
Michael Alexander Nugent
Full Text Available Modern computing architecture based on the separation of memory and processing leads to a well known problem called the von Neumann bottleneck, a restrictive limit on the data bandwidth between CPU and RAM. This paper introduces a new approach to computing we call AHaH computing where memory and processing are combined. The idea is based on the attractor dynamics of volatile dissipative electronics inspired by biological systems, presenting an attractive alternative architecture that is able to adapt, self-repair, and learn from interactions with the environment. We envision that both von Neumann and AHaH computing architectures will operate together on the same machine, but that the AHaH computing processor may reduce the power consumption and processing time for certain adaptive learning tasks by orders of magnitude. The paper begins by drawing a connection between the properties of volatility, thermodynamics, and Anti-Hebbian and Hebbian (AHaH plasticity. We show how AHaH synaptic plasticity leads to attractor states that extract the independent components of applied data streams and how they form a computationally complete set of logic functions. After introducing a general memristive device model based on collections of metastable switches, we show how adaptive synaptic weights can be formed from differential pairs of incremental memristors. We also disclose how arrays of synaptic weights can be used to build a neural node circuit operating AHaH plasticity. By configuring the attractor states of the AHaH node in different ways, high level machine learning functions are demonstrated. This includes unsupervised clustering, supervised and unsupervised classification, complex signal prediction, unsupervised robotic actuation and combinatorial optimization of procedures-all key capabilities of biological nervous systems and modern machine learning algorithms with real world application.
Performance modeling, loss networks, and statistical multiplexing
Mazumdar, Ravi
2009-01-01
This monograph presents a concise mathematical approach for modeling and analyzing the performance of communication networks with the aim of understanding the phenomenon of statistical multiplexing. The novelty of the monograph is the fresh approach and insights provided by a sample-path methodology for queueing models that highlights the important ideas of Palm distributions associated with traffic models and their role in performance measures. Also presented are recent ideas of large buffer, and many sources asymptotics that play an important role in understanding statistical multiplexing. I
Artificial Neural Network Model for Predicting Compressive
Directory of Open Access Journals (Sweden)
Salim T. Yousif
2013-05-01
Full Text Available Compressive strength of concrete is a commonly used criterion in evaluating concrete. Although testing of the compressive strength of concrete specimens is done routinely, it is performed on the 28th day after concrete placement. Therefore, strength estimation of concrete at early time is highly desirable. This study presents the effort in applying neural network-based system identification techniques to predict the compressive strength of concrete based on concrete mix proportions, maximum aggregate size (MAS, and slump of fresh concrete. Back-propagation neural networks model is successively developed, trained, and tested using actual data sets of concrete mix proportions gathered from literature. The test of the model by un-used data within the range of input parameters shows that the maximum absolute error for model is about 20% and 88% of the output results has absolute errors less than 10%. The parametric study shows that water/cement ratio (w/c is the most significant factor affecting the output of the model. The results showed that neural networks has strong potential as a feasible tool for predicting compressive strength of concrete.
UAV Trajectory Modeling Using Neural Networks
Xue, Min
2017-01-01
Large amount of small Unmanned Aerial Vehicles (sUAVs) are projected to operate in the near future. Potential sUAV applications include, but not limited to, search and rescue, inspection and surveillance, aerial photography and video, precision agriculture, and parcel delivery. sUAVs are expected to operate in the uncontrolled Class G airspace, which is at or below 500 feet above ground level (AGL), where many static and dynamic constraints exist, such as ground properties and terrains, restricted areas, various winds, manned helicopters, and conflict avoidance among sUAVs. How to enable safe, efficient, and massive sUAV operations at the low altitude airspace remains a great challenge. NASA's Unmanned aircraft system Traffic Management (UTM) research initiative works on establishing infrastructure and developing policies, requirement, and rules to enable safe and efficient sUAVs' operations. To achieve this goal, it is important to gain insights of future UTM traffic operations through simulations, where the accurate trajectory model plays an extremely important role. On the other hand, like what happens in current aviation development, trajectory modeling should also serve as the foundation for any advanced concepts and tools in UTM. Accurate models of sUAV dynamics and control systems are very important considering the requirement of the meter level precision in UTM operations. The vehicle dynamics are relatively easy to derive and model, however, vehicle control systems remain unknown as they are usually kept by manufactures as a part of intellectual properties. That brings challenges to trajectory modeling for sUAVs. How to model the vehicle's trajectories with unknown control system? This work proposes to use a neural network to model a vehicle's trajectory. The neural network is first trained to learn the vehicle's responses at numerous conditions. Once being fully trained, given current vehicle states, winds, and desired future trajectory, the neural
Kinematic Structural Modelling in Bayesian Networks
Schaaf, Alexander; de la Varga, Miguel; Florian Wellmann, J.
2017-04-01
We commonly capture our knowledge about the spatial distribution of distinct geological lithologies in the form of 3-D geological models. Several methods exist to create these models, each with its own strengths and limitations. We present here an approach to combine the functionalities of two modeling approaches - implicit interpolation and kinematic modelling methods - into one framework, while explicitly considering parameter uncertainties and thus model uncertainty. In recent work, we proposed an approach to implement implicit modelling algorithms into Bayesian networks. This was done to address the issues of input data uncertainty and integration of geological information from varying sources in the form of geological likelihood functions. However, one general shortcoming of implicit methods is that they usually do not take any physical constraints into consideration, which can result in unrealistic model outcomes and artifacts. On the other hand, kinematic structural modelling intends to reconstruct the history of a geological system based on physically driven kinematic events. This type of modelling incorporates simplified, physical laws into the model, at the cost of a substantial increment of usable uncertain parameters. In the work presented here, we show an integration of these two different modelling methodologies, taking advantage of the strengths of both of them. First, we treat the two types of models separately, capturing the information contained in the kinematic models and their specific parameters in the form of likelihood functions, in order to use them in the implicit modelling scheme. We then go further and combine the two modelling approaches into one single Bayesian network. This enables the direct flow of information between the parameters of the kinematic modelling step and the implicit modelling step and links the exclusive input data and likelihoods of the two different modelling algorithms into one probabilistic inference framework. In
Systems biology of plant molecular networks: from networks to models
Valentim, F.L.
2015-01-01
Developmental processes are controlled by regulatory networks (GRNs), which are tightly coordinated networks of transcription factors (TFs) that activate and repress gene expression within a spatial and temporal context. In Arabidopsis thaliana, the key components and network structures of the GRNs
Advances in dynamic network modeling in complex transportation systems
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.
A NEURAL OSCILLATOR-NETWORK MODEL OF TEMPORAL PATTERN GENERATION
Schomaker, Lambert
Most contemporary neural network models deal with essentially static, perceptual problems of classification and transformation. Models such as multi-layer feedforward perceptrons generally do not incorporate time as an essential dimension, whereas biological neural networks are inherently temporal
Stability and Multiscroll Attractors of Control Systems via the Abscissa
Directory of Open Access Journals (Sweden)
Edgar-Cristian Díaz-González
2017-01-01
Full Text Available We present an approach to generate multiscroll attractors via destabilization of piecewise linear systems based on Hurwitz matrix in this paper. First we present some results about the abscissa of stability of characteristic polynomials from linear differential equations systems; that is, we consider Hurwitz polynomials. The starting point is the Gauss–Lucas theorem, we provide lower bounds for Hurwitz polynomials, and by successively decreasing the order of the derivative of the Hurwitz polynomial one obtains a sequence of lower bounds. The results are extended in a straightforward way to interval polynomials; then we apply the abscissa as a measure to destabilize Hurwitz polynomial for the generation of a family of multiscroll attractors based on a class of unstable dissipative systems (UDS of affine linear type.
Evolution of Multispecificity in an Immune Network
Harada, K
1999-01-01
Divergence in antigen response of the immune network is discussed, based on shape-space modelling. The present model extends the shape-space model by introducing the evolution of specificity of idiotypes. When the amount of external antigen increases, stability of the immune network changes and the network responds to the antigen. It is shown that specific and non-specific responses emerge as a function of antigen levels. A specific response is observed with a fixed point attractor, and a non-specific response is observed with a long-lived chaotic transient state of the lymphocyte population dynamics. The network topology also changes between these two states. The relevance of such a long-lived transient state is discussed with respect to immune function.
Model of Opinion Spreading in Social Networks
Kanovsky, Igor
2011-01-01
We proposed a new model, which capture the main difference between information and opinion spreading. In information spreading additional exposure to certain information has a small effect. Contrary, when an actor is exposed to 2 opinioned actors the probability to adopt the opinion is significant higher than in the case of contact with one such actor (called by J. Kleinberg "the 0-1-2 effect"). In each time step if an actor does not have an opinion, we randomly choose 2 his network neighbors. If one of them has an opinion, the actor adopts opinion with some low probability, if two - with a higher probability. Opinion spreading was simulated on different real world social networks and similar random scale-free networks. The results show that small world structure has a crucial impact on tipping point time. The "0-1-2" effect causes a significant difference between ability of the actors to start opinion spreading. Actor is an influencer according to his topological position in the network.
Torus-doubling process via strange nonchaotic attractors
Mitsui, Takahito; Uenohara, Seiji; Morie, Takashi; Horio, Yoshihiko; Aihara, Kazuyuki
2012-05-01
Torus-doubling bifurcations typically occur only a finite number of times. It has been assumed that torus-doubling bifurcations in quasiperiodically forced systems are interrupted by the appearance of strange nonchaotic attractors (SNAs). In the present Letter, we study a quasiperiodically forced noninvertible map and report the occurrence of a torus-doubling process via SNAs. The mechanism of this process is numerically clarified. Furthermore, this process is experimentally demonstrated in a switched-capacitor integrated circuit.
Alexandrov, Natalia (Technical Monitor); Kuby, Michael; Tierney, Sean; Roberts, Tyler; Upchurch, Christopher
2005-01-01
This report reviews six classes of models that are used for studying transportation network topologies. The report is motivated by two main questions. First, what can the "new science" of complex networks (scale-free, small-world networks) contribute to our understanding of transport network structure, compared to more traditional methods? Second, how can geographic information systems (GIS) contribute to studying transport networks? The report defines terms that can be used to classify different kinds of models by their function, composition, mechanism, spatial and temporal dimensions, certainty, linearity, and resolution. Six broad classes of models for analyzing transport network topologies are then explored: GIS; static graph theory; complex networks; mathematical programming; simulation; and agent-based modeling. Each class of models is defined and classified according to the attributes introduced earlier. The paper identifies some typical types of research questions about network structure that have been addressed by each class of model in the literature.
Mathematical model for spreading dynamics of social network worms
Sun, Xin; Liu, Yan-Heng; Li, Bin; Li, Jin; Han, Jia-Wei; Liu, Xue-Jie
2012-04-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.
Modeling regulatory networks with weight matrices
DEFF Research Database (Denmark)
Weaver, D.C.; Workman, Christopher; Stormo, Gary D.
1999-01-01
Systematic gene expression analyses provide comprehensive information about the transcriptional responseto different environmental and developmental conditions. With enough gene expression data points,computational biologists may eventually generate predictive computer models of transcription...... regulation.Such models will require computational methodologies consistent with the behavior of known biologicalsystems that remain tractable. We represent regulatory relationships between genes as linear coefficients orweights, with the "net" regulation influence on a gene's expression being...... the mathematical summation of theindependent regulatory inputs. Test regulatory networks generated with this approach display stable andcyclically stable gene expression levels, consistent with known biological systems. We include variables tomodel the effect of environmental conditions on transcription regulation...
Artificial Neural Network Modeling of an Inverse Fluidized Bed ...
African Journals Online (AJOL)
The application of neural networks to model a laboratory scale inverse fluidized bed reactor has been studied. A Radial Basis Function neural network has been successfully employed for the modeling of the inverse fluidized bed reactor. In the proposed model, the trained neural network represents the kinetics of biological ...
Modeling social influence through network autocorrelation : constructing the weight matrix
Leenders, Roger Th. A. J.
Many physical and social phenomena are embedded within networks of interdependencies, the so-called 'context' of these phenomena. In network analysis, this type of process is typically modeled as a network autocorrelation model. Parameter estimates and inferences based on autocorrelation models,
High-dimensional chaotic and attractor systems a comprehensive introduction
Ivancevic, Vladimir G
2007-01-01
This is a graduate–level monographic textbook devoted to understanding, prediction and control of high–dimensional chaotic and attractor systems of real life. The objective of the book is to provide the serious reader with a serious scientific tool that will enable the actual performance of competitive research in high–dimensional chaotic and attractor dynamics. The book has nine Chapters. The first Chapter gives a textbook-like introduction into the low-dimensional attractors and chaos. This Chapter has an inspirational character, similar to other books on nonlinear dynamics and deterministic chaos. The second Chapter deals with Smale’s topological transformations of stretching, squeezing and folding (of the system’s phase–space), developed for the purpose of chaos theory. The third Chapter is devoted to Poincaré's 3-body problem and basic techniques of chaos control, mostly of Ott-Grebogi-Yorke type. The fourth Chapter is a review of both Landau’s and topological phase transition theory, as w...
Hsieh, Chih-Sheng; Lee, Lung fei
2017-01-01
In this paper, we model network formation and network interactions under a unified framework. The key feature of our model is to allow individuals to respond to incentives stemming from interaction benefits on certain activities when they choose friends (network links), while capturing homophily in terms of unobserved characteristic variables in network formation and activities. There are two advantages of this modeling approach: first, one can evaluate whether incentives from certain interac...
Challenges on Probabilistic Modeling for Evolving Networks
Ding, Jianguo; Bouvry, Pascal
2013-01-01
With the emerging of new networks, such as wireless sensor networks, vehicle networks, P2P networks, cloud computing, mobile Internet, or social networks, the network dynamics and complexity expands from system design, hardware, software, protocols, structures, integration, evolution, application, even to business goals. Thus the dynamics and uncertainty are unavoidable characteristics, which come from the regular network evolution and unexpected hardware defects, unavoidable software errors,...
Dynamics at infinity and a Hopf bifurcation arising in a quadratic system with coexisting attractors
Wang, Zhen; Moroz, Irene; Wei, Zhouchao; Ren, Haipeng
2018-01-01
Dynamics at infinity and a Hopf bifurcation for a Sprott E system with a very small perturbation constant are studied in this paper. By using Poincaré compactification of polynomial vector fields in R^3, the dynamics near infinity of the singularities is obtained. Furthermore, in accordance with the centre manifold theorem, the subcritical Hopf bifurcation is analysed and obtained. Numerical simulations demonstrate the correctness of the dynamical and bifurcation analyses. Moreover, by choosing appropriate parameters, this perturbed system can exhibit chaotic, quasiperiodic and periodic dynamics, as well as some coexisting attractors, such as a chaotic attractor coexisting with a periodic attractor for a>0, and a chaotic attractor coexisting with a quasiperiodic attractor for a=0. Coexisting attractors are not associated with an unstable equilibrium and thus often go undiscovered because they may occur in a small region of parameter space, with a small basin of attraction in the space of initial conditions.
Aeronautical telecommunications network advances, challenges, and modeling
Musa, Sarhan M
2015-01-01
Addresses the Challenges of Modern-Day Air Traffic Air traffic control (ATC) directs aircraft in the sky and on the ground to safety, while the Aeronautical Telecommunications Network (ATN) comprises all systems and phases that assist in aircraft departure and landing. The Aeronautical Telecommunications Network: Advances, Challenges, and Modeling focuses on the development of ATN and examines the role of the various systems that link aircraft with the ground. The book places special emphasis on ATC-introducing the modern ATC system from the perspective of the user and the developer-and provides a thorough understanding of the operating mechanism of the ATC system. It discusses the evolution of ATC, explaining its structure and how it works; includes design examples; and describes all subsystems of the ATC system. In addition, the book covers relevant tools, techniques, protocols, and architectures in ATN, including MIPv6, air traffic control (ATC), security of air traffic management (ATM), very-high-frequenc...
Neural Network Program Package for Prosody Modeling
Directory of Open Access Journals (Sweden)
J. Santarius
2004-04-01
Full Text Available This contribution describes the programme for one part of theautomatic Text-to-Speech (TTS synthesis. Some experiments (for example[14] documented the considerable improvement of the naturalness ofsynthetic speech, but this approach requires completing the inputfeature values by hand. This completing takes a lot of time for bigfiles. We need to improve the prosody by other approaches which useonly automatically classified features (input parameters. Theartificial neural network (ANN approach is used for the modeling ofprosody parameters. The program package contains all modules necessaryfor the text and speech signal pre-processing, neural network training,sensitivity analysis, result processing and a module for the creationof the input data protocol for Czech speech synthesizer ARTIC [1].
Towards an evolutionary model of transcription networks.
Directory of Open Access Journals (Sweden)
Dan Xie
2011-06-01
Full Text Available DNA evolution models made invaluable contributions to comparative genomics, although it seemed formidable to include non-genomic features into these models. In order to build an evolutionary model of transcription networks (TNs, we had to forfeit the substitution model used in DNA evolution and to start from modeling the evolution of the regulatory relationships. We present a quantitative evolutionary model of TNs, subjecting the phylogenetic distance and the evolutionary changes of cis-regulatory sequence, gene expression and network structure to one probabilistic framework. Using the genome sequences and gene expression data from multiple species, this model can predict regulatory relationships between a transcription factor (TF and its target genes in all species, and thus identify TN re-wiring events. Applying this model to analyze the pre-implantation development of three mammalian species, we identified the conserved and re-wired components of the TNs downstream to a set of TFs including Oct4, Gata3/4/6, cMyc and nMyc. Evolutionary events on the DNA sequence that led to turnover of TF binding sites were identified, including a birth of an Oct4 binding site by a 2nt deletion. In contrast to recent reports of large interspecies differences of TF binding sites and gene expression patterns, the interspecies difference in TF-target relationship is much smaller. The data showed increasing conservation levels from genomic sequences to TF-DNA interaction, gene expression, TN, and finally to morphology, suggesting that evolutionary changes are larger at molecular levels and smaller at functional levels. The data also showed that evolutionarily older TFs are more likely to have conserved target genes, whereas younger TFs tend to have larger re-wiring rates.
Contributions and challenges for network models in cognitive neuroscience.
Sporns, Olaf
2014-05-01
The confluence of new approaches in recording patterns of brain connectivity and quantitative analytic tools from network science has opened new avenues toward understanding the organization and function of brain networks. Descriptive network models of brain structural and functional connectivity have made several important contributions; for example, in the mapping of putative network hubs and network communities. Building on the importance of anatomical and functional interactions, network models have provided insight into the basic structures and mechanisms that enable integrative neural processes. Network models have also been instrumental in understanding the role of structural brain networks in generating spatially and temporally organized brain activity. Despite these contributions, network models are subject to limitations in methodology and interpretation, and they face many challenges as brain connectivity data sets continue to increase in detail and complexity.
Modeling of regional warehouse network generation
Directory of Open Access Journals (Sweden)
Popov Pavel Vladimirovich
2016-08-01
Full Text Available One of the factors that has a significant impact on the socio-economic development of the Russian Federation’s regions is the logistics infrastructure. It provides integrated transportation and distribution service of material flows. One of the main elements of logistics infrastructure is a storage infrastructure, which includes distribution center, distribution-and-sortout and sortout warehouses. It is the most expedient to place distribution center in the vicinity of the regional center. One of the tasks of the distribution network creation within the regions of the Russian Federation is to determine the location, capacity and number of stores. When determining regional network location of general purpose warehouses methodological approaches to solving the problems of location of production and non-production can be used which depend on various economic factors. The mathematical models for solving relevant problems are the deployment models. However, the existing models focus on the dimensionless power storage. The purpose of the given work is to develop a model to determine the optimal location of general-purpose warehouses on the Russian Federation area. At the first stage of the work, the authors assess the main economic indicators influencing the choice of the location of general purpose warehouses. An algorithm for solving the first stage, based on ABC, discriminant and cluster analysis were proposed by the authors in earlier papers. At the second stage the specific locations of general purpose warehouses and their power is chosen to provide the cost minimization for the construction and subsequent maintenance of warehouses and transportation heterogeneous products. In order to solve this problem the authors developed a mathematical model that takes into account the possibility of delivery in heterogeneous goods from suppliers and manufacturers in the distribution and storage sorting with specified set of capacities. The model allows
Higher derivative corrections to BPS black hole attractors in 4d gauged supergravity
Energy Technology Data Exchange (ETDEWEB)
Hristov, Kiril [Institute for Nuclear Research and Nuclear Energy, Bulgarian Academy of Sciences, Tsarigradsko Chaussee 72, 1784 Sofia (Bulgaria); Katmadas, Stefanos [Dipartimento di Fisica, Università di Milano-Bicocca,I-20126 Milano (Italy); INFN, Sezione di Milano-Bicocca,I-20126 Milano (Italy); Lodato, Ivano [Department of Physics, IISER Pune,Homi Bhaba Road, Pashan, Pune (India)
2016-05-30
We analyze BPS black hole attractors in 4d gauged supergravity in the presence of higher derivative supersymmetric terms, including a Weyl-squared-type action, and determine the resulting corrections to the Bekenstein-Hawking entropy. The near-horizon geometry AdS{sub 2}×S{sup 2} (or other Riemann surface) preserves half of the supercharges in N=2 supergravity with Fayet-Iliopoulos gauging. We derive a relation between the entropy and the black hole charges that suggests via AdS/CFT how subleading corrections contribute to the supersymmetric index in the dual microscopic picture. Depending on the model, the attractors are part of full black hole solutions with different asymptotics, such as Minkowski, AdS{sub 4}, and hvLif{sub 4}. We give explicit examples for each of the asymptotic cases and comment on the implications. Among other results, we find that the Weyl-squared terms spoil the exact two-derivative relation to non-BPS asymptotically flat black holes in ungauged supergravity.
Bayesian Recurrent Neural Network for Language Modeling.
Chien, Jen-Tzung; Ku, Yuan-Chu
2016-02-01
A language model (LM) is calculated as the probability of a word sequence that provides the solution to word prediction for a variety of information systems. A recurrent neural network (RNN) is powerful to learn the large-span dynamics of a word sequence in the continuous space. However, the training of the RNN-LM is an ill-posed problem because of too many parameters from a large dictionary size and a high-dimensional hidden layer. This paper presents a Bayesian approach to regularize the RNN-LM and apply it for continuous speech recognition. We aim to penalize the too complicated RNN-LM by compensating for the uncertainty of the estimated model parameters, which is represented by a Gaussian prior. The objective function in a Bayesian classification network is formed as the regularized cross-entropy error function. The regularized model is constructed not only by calculating the regularized parameters according to the maximum a posteriori criterion but also by estimating the Gaussian hyperparameter by maximizing the marginal likelihood. A rapid approximation to a Hessian matrix is developed to implement the Bayesian RNN-LM (BRNN-LM) by selecting a small set of salient outer-products. The proposed BRNN-LM achieves a sparser model than the RNN-LM. Experiments on different corpora show the robustness of system performance by applying the rapid BRNN-LM under different conditions.
Optimizing neural network models: motivation and case studies
Harp, S A; T. Samad
2012-01-01
Practical successes have been achieved with neural network models in a variety of domains, including energy-related industry. The large, complex design space presented by neural networks is only minimally explored in current practice. The satisfactory results that nevertheless have been obtained testify that neural networks are a robust modeling technology; at the same time, however, the lack of a systematic design approach implies that the best neural network models generally rem...
A Complex Network Approach to Distributional Semantic Models.
Directory of Open Access Journals (Sweden)
Akira Utsumi
Full Text Available A number of studies on network analysis have focused on language networks based on free word association, which reflects human lexical knowledge, and have demonstrated the small-world and scale-free properties in the word association network. Nevertheless, there have been very few attempts at applying network analysis to distributional semantic models, despite the fact that these models have been studied extensively as computational or cognitive models of human lexical knowledge. In this paper, we analyze three network properties, namely, small-world, scale-free, and hierarchical properties, of semantic networks created by distributional semantic models. We demonstrate that the created networks generally exhibit the same properties as word association networks. In particular, we show that the distribution of the number of connections in these networks follows the truncated power law, which is also observed in an association network. This indicates that distributional semantic models can provide a plausible model of lexical knowledge. Additionally, the observed differences in the network properties of various implementations of distributional semantic models are consistently explained or predicted by considering the intrinsic semantic features of a word-context matrix and the functions of matrix weighting and smoothing. Furthermore, to simulate a semantic network with the observed network properties, we propose a new growing network model based on the model of Steyvers and Tenenbaum. The idea underlying the proposed model is that both preferential and random attachments are required to reflect different types of semantic relations in network growth process. We demonstrate that this model provides a better explanation of network behaviors generated by distributional semantic models.
Inferring gene regression networks with model trees
Directory of Open Access Journals (Sweden)
Aguilar-Ruiz Jesus S
2010-10-01
Full Text Available Abstract Background Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to find direct regulatory relationships between genes building the so-called gene co-expression networks. They are typically generated using correlation statistics as pairwise similarity measures. Correlation-based methods are very useful in order to determine whether two genes have a strong global similarity but do not detect local similarities. Results We propose model trees as a method to identify gene interaction networks. While correlation-based methods analyze each pair of genes, in our approach we generate a single regression tree for each gene from the remaining genes. Finally, a graph from all the relationships among output and input genes is built taking into account whether the pair of genes is statistically significant. For this reason we apply a statistical procedure to control the false discovery rate. The performance of our approach, named REGNET, is experimentally tested on two well-known data sets: Saccharomyces Cerevisiae and E.coli data set. First, the biological coherence of the results are tested. Second the E.coli transcriptional network (in the Regulon database is used as control to compare the results to that of a correlation-based method. This experiment shows that REGNET performs more accurately at detecting true gene associations than the Pearson and Spearman zeroth and first-order correlation-based methods. Conclusions REGNET generates gene association networks from gene expression data, and differs from correlation-based methods in that the relationship between one gene and others is calculated simultaneously. Model trees are very useful techniques to estimate the numerical values for the target genes by linear regression functions. They are very often more precise than linear regression models because they can add just different linear
Two stage neural network modelling for robust model predictive control.
Patan, Krzysztof
2017-11-02
The paper proposes a novel robust model predictive control scheme realized by means of artificial neural networks. The neural networks are used twofold: to design the so-called fundamental model of a plant and to catch uncertainty associated with the plant model. In order to simplify the optimization process carried out within the framework of predictive control an instantaneous linearization is applied which renders it possible to define the optimization problem in the form of constrained quadratic programming. Stability of the proposed control system is also investigated by showing that a cost function is monotonically decreasing with respect to time. Derived robust model predictive control is tested and validated on the example of a pneumatic servomechanism working at different operating regimes. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.
Toward pole inflation and attractors in supergravity: Chiral matter field inflation
Kobayashi, T.; Seto, O.; Tatsuishi, T. H.
2017-12-01
In string-inspired supergravity theory, the Kähler metric of chiral matter fields often has a pole. Such a Kähler metric is interesting from the viewpoint of the framework of the pole inflation, where the scalar potential can be stretched out to be flat around the pole for a canonically normalized field and inflation can be realized. However, when the Kähler metric has a pole, the scalar potential can also have a pole at the same point in supergravity theory. We study such supergravity models with a pole, and provide numerical analysis of inflationary dynamics and resultant density perturbation. In contrast with the usual pole inflation models, inflation in this supergravity-based model occurs not on the pole but in a region apart from the pole. We show that the existence of the pole in the scalar potential is crucial nevertheless. We also examine attractor behavior of our model.
On the Moduli Space of non-BPS Attractors for N=2 Symmetric Manifolds
Ferrara, Sergio
2007-01-01
We study the ``flat'' directions of non-BPS extremal black hole attractors for N=2, d=4 supergravities whose vector multiplets' scalar manifold is endowed with homogeneous symmetric special Kahler geometry. The non-BPS attractors with non-vanishing central charge have a moduli space described by real special geometry (and thus related to the d=5 parent theory), whereas the moduli spaces of non-BPS attractors with vanishing central charge are certain Kahler homogeneous symmetric manifolds. The moduli spaces of the non-BPS attractors of the corresponding N=2, d=5 theories are also indicated, and shown to be rank-1 homogeneous symmetric manifolds.
Intermittency induced by attractor-merging crisis in the Kuramoto-Sivashinsky equation.
Rempel, Erico L; Chian, Abraham C-L
2005-01-01
We characterize an attractor-merging crisis in a spatially extended system exemplified by the Kuramoto-Sivashinsky equation. The simultaneous collision of two coexisting chaotic attractors with an unstable periodic orbit and its associated stable manifold occurs in the high-dimensional phase space of the system, giving rise to a single merged chaotic attractor. The time series of the post-crisis regime displays intermittent behavior. The origin of this crisis-induced intermittency is elucidated in terms of alternate switching between two chaotic saddles embedded in the merged chaotic attractor.
Marsman, M; Borsboom, D; Kruis, J; Epskamp, S; van Bork, R; Waldorp, L J; Maas, H L J van der; Maris, G
2017-11-07
In recent years, network models have been proposed as an alternative representation of psychometric constructs such as depression. In such models, the covariance between observables (e.g., symptoms like depressed mood, feelings of worthlessness, and guilt) is explained in terms of a pattern of causal interactions between these observables, which contrasts with classical interpretations in which the observables are conceptualized as the effects of a reflective latent variable. However, few investigations have been directed at the question how these different models relate to each other. To shed light on this issue, the current paper explores the relation between one of the most important network models-the Ising model from physics-and one of the most important latent variable models-the Item Response Theory (IRT) model from psychometrics. The Ising model describes the interaction between states of particles that are connected in a network, whereas the IRT model describes the probability distribution associated with item responses in a psychometric test as a function of a latent variable. Despite the divergent backgrounds of the models, we show a broad equivalence between them and also illustrate several opportunities that arise from this connection.
Social network models predict movement and connectivity in ecological landscapes
Fletcher, Robert J.; Acevedo, M.A.; Reichert, Brian E.; Pias, Kyle E.; Kitchens, Wiley M.
2011-01-01
Network analysis is on the rise across scientific disciplines because of its ability to reveal complex, and often emergent, patterns and dynamics. Nonetheless, a growing concern in network analysis is the use of limited data for constructing networks. This concern is strikingly relevant to ecology and conservation biology, where network analysis is used to infer connectivity across landscapes. In this context, movement among patches is the crucial parameter for interpreting connectivity but because of the difficulty of collecting reliable movement data, most network analysis proceeds with only indirect information on movement across landscapes rather than using observed movement to construct networks. Statistical models developed for social networks provide promising alternatives for landscape network construction because they can leverage limited movement information to predict linkages. Using two mark-recapture datasets on individual movement and connectivity across landscapes, we test whether commonly used network constructions for interpreting connectivity can predict actual linkages and network structure, and we contrast these approaches to social network models. We find that currently applied network constructions for assessing connectivity consistently, and substantially, overpredict actual connectivity, resulting in considerable overestimation of metapopulation lifetime. Furthermore, social network models provide accurate predictions of network structure, and can do so with remarkably limited data on movement. Social network models offer a flexible and powerful way for not only understanding the factors influencing connectivity but also for providing more reliable estimates of connectivity and metapopulation persistence in the face of limited data.
Neural Networks For Electrohydrodynamic Effect Modelling
Directory of Open Access Journals (Sweden)
Wiesław Wajs
2004-01-01
Full Text Available This paper presents currently achieved results concerning methods of electrohydrodynamiceffect used in geophysics simulated with feedforward networks trained with backpropagation algorithm, radial basis function networks and generalized regression networks.
A network-oriented business modeling environment
Bisconti, Cristian; Storelli, Davide; Totaro, Salvatore; Arigliano, Francesco; Savarino, Vincenzo; Vicari, Claudia
The development of formal models related to the organizational aspects of an enterprise is fundamental when these aspects must be re-engineered and digitalized, especially when the enterprise is involved in the dynamics and value flows of a business network. Business modeling provides an opportunity to synthesize and make business processes, business rules and the structural aspects of an organization explicit, allowing business managers to control their complexity and guide an enterprise through effective decisional and strategic activities. This chapter discusses the main results of the TEKNE project in terms of software components that enable enterprises to configure, store, search and share models of any aspects of their business while leveraging standard and business-oriented technologies and languages to bridge the gap between the world of business people and IT experts and to foster effective business-to-business collaborations.
Compartmentalization analysis using discrete fracture network models
Energy Technology Data Exchange (ETDEWEB)
La Pointe, P.R.; Eiben, T.; Dershowitz, W. [Golder Associates, Redmond, VA (United States); Wadleigh, E. [Marathon Oil Co., Midland, TX (United States)
1997-08-01
This paper illustrates how Discrete Fracture Network (DFN) technology can serve as a basis for the calculation of reservoir engineering parameters for the development of fractured reservoirs. It describes the development of quantitative techniques for defining the geometry and volume of structurally controlled compartments. These techniques are based on a combination of stochastic geometry, computational geometry, and graph the theory. The parameters addressed are compartment size, matrix block size and tributary drainage volume. The concept of DFN models is explained and methodologies to compute these parameters are demonstrated.
Some queuing network models of computer systems
Herndon, E. S.
1980-01-01
Queuing network models of a computer system operating with a single workload type are presented. Program algorithms are adapted for use on the Texas Instruments SR-52 programmable calculator. By slightly altering the algorithm to process the G and H matrices row by row instead of column by column, six devices and an unlimited job/terminal population could be handled on the SR-52. Techniques are also introduced for handling a simple load dependent server and for studying interactive systems with fixed multiprogramming limits.
Networks model of the East Turkistan terrorism
Li, Ben-xian; Zhu, Jun-fang; Wang, Shun-guo
2015-02-01
The presence of the East Turkistan terrorist network in China can be traced back to the rebellions on the BAREN region in Xinjiang in April 1990. This article intends to research the East Turkistan networks in China and offer a panoramic view. The events, terrorists and their relationship are described using matrices. Then social network analysis is adopted to reveal the network type and the network structure characteristics. We also find the crucial terrorist leader. Ultimately, some results show that the East Turkistan network has big hub nodes and small shortest path, and that the network follows a pattern of small world network with hierarchical structure.
Fundamentals of complex networks models, structures and dynamics
Chen, Guanrong; Li, Xiang
2014-01-01
Complex networks such as the Internet, WWW, transportationnetworks, power grids, biological neural networks, and scientificcooperation networks of all kinds provide challenges for futuretechnological development. In particular, advanced societies havebecome dependent on large infrastructural networks to an extentbeyond our capability to plan (modeling) and to operate (control).The recent spate of collapses in power grids and ongoing virusattacks on the Internet illustrate the need for knowledge aboutmodeling, analysis of behaviors, optimized planning and performancecontrol in such networks. F
Stochastic simulation of HIV population dynamics through complex network modelling
Sloot, P. M. A.; Ivanov, S. V.; Boukhanovsky, A. V.; van de Vijver, D. A. M. C.; Boucher, C. A. B.
We propose a new way to model HIV infection spreading through the use of dynamic complex networks. The heterogeneous population of HIV exposure groups is described through a unique network degree probability distribution. The time evolution of the network nodes is modelled by a Markov process and
A Search Model with a Quasi-Network
DEFF Research Database (Denmark)
Ejarque, Joao Miguel
This paper adds a quasi-network to a search model of the labor market. Fitting the model to an average unemployment rate and to other moments in the data implies the presence of the network is not noticeable in the basic properties of the unemployment and job finding rates. However, the network c...
Stochastic simulation of HIV population dynamics through complex network modelling
Sloot, P.M.A.; Ivanov, S.V.; Boukhanovsky, A.V.; van de Vijver, D.A.M.C.; Boucher, C.A.B.
2008-01-01
We propose a new way to model HIV infection spreading through the use of dynamic complex networks. The heterogeneous population of HIV exposure groups is described through a unique network degree probability distribution. The time evolution of the network nodes is modelled by a Markov process and
QSAR modelling using combined simple competitive learning networks and RBF neural networks.
Sheikhpour, R; Sarram, M A; Rezaeian, M; Sheikhpour, E
2018-04-01
The aim of this study was to propose a QSAR modelling approach based on the combination of simple competitive learning (SCL) networks with radial basis function (RBF) neural networks for predicting the biological activity of chemical compounds. The proposed QSAR method consisted of two phases. In the first phase, an SCL network was applied to determine the centres of an RBF neural network. In the second phase, the RBF neural network was used to predict the biological activity of various phenols and Rho kinase (ROCK) inhibitors. The predictive ability of the proposed QSAR models was evaluated and compared with other QSAR models using external validation. The results of this study showed that the proposed QSAR modelling approach leads to better performances than other models in predicting the biological activity of chemical compounds. This indicated the efficiency of simple competitive learning networks in determining the centres of RBF neural networks.
Cosmological attractor inflation from the RG-improved Higgs sector of finite gauge theory
Elizalde, E; Pozdeeva, E O; Vernov, S Yu
2015-01-01
The possibility to construct an inflationary scenario for renormalization-group improved potentials corresponding to the Higgs sector of finite gauge models is investigated. Taking into account quantum corrections to the renormalization-group potential which sums all leading logs of perturbation theory is essential for a successful realization of the inflationary scenario, with very reasonable parameters values. The inflationary models thus obtained are seen to be in good agreement with the most recent and accurate observational data. More specifically, the values of the relevant inflationary parameters, $n_s$ and $r$, are close to the corresponding ones in the $R^2$ and Higgs-driven inflation scenarios. It is shown that the model here constructed and Higgs-driven inflation belong to the same class of cosmological attractors.
Cosmological attractor inflation from the RG-improved Higgs sector of finite gauge theory
Energy Technology Data Exchange (ETDEWEB)
Elizalde, Emilio; Odintsov, Sergei D. [Instituto de Ciencias del Espacio (ICE/CSIC) and Institut d' Estudis Espacials de Catalunya (IEEC), Campus UAB, Carrer de Can Magrans, s/n, Cerdanyola del Vallès, Barcelona, 08193 Spain (Spain); Pozdeeva, Ekaterina O.; Vernov, Sergey Yu., E-mail: elizalde@ieec.uab.es, E-mail: odintsov@ieec.uab.es, E-mail: pozdeeva@www-hep.sinp.msu.ru, E-mail: svernov@theory.sinp.msu.ru [Skobeltsyn Institute of Nuclear Physics, Lomonosov Moscow State University, Leninskie Gory 1, Moscow, 119991 (Russian Federation)
2016-02-01
The possibility to construct an inflationary scenario for renormalization-group improved potentials corresponding to the Higgs sector of finite gauge models is investigated. Taking into account quantum corrections to the renormalization-group potential which sums all leading logs of perturbation theory is essential for a successful realization of the inflationary scenario, with very reasonable parameter values. The inflationary models thus obtained are seen to be in good agreement with the most recent and accurate observational data. More specifically, the values of the relevant inflationary parameters, n{sub s} and r, are close to the corresponding ones in the R{sup 2} and Higgs-driven inflation scenarios. It is shown that the model here constructed and Higgs-driven inflation belong to the same class of cosmological attractors.
DEFF Research Database (Denmark)
Isaeva, Olga B.; Kuznetsov, Sergey P.; Mosekilde, Erik
2011-01-01
model corresponds to the situation of equality of natural frequencies of the partial oscillators, and another to a nonresonant ratio of the oscillation frequencies relating to each of the two pairs. Dynamics of all models are illustrated with diagrams indicating the transformation of the angular......The paper proposes an approach to constructing feasible examples of dynamical systems with hyperbolic chaotic attractors based on the successive transfer of excitation between two pairs of self-oscillators that are alternately active. An angular variable that measures the relations of the current...... amplitudes for the two oscillators of each pair undergoes a transformation in accordance with the expanding circle map during each cycle of the process. We start with equations describing the dynamics in terms of complex or real amplitudes and then examine two models based on van der Pol oscillators. One...
VEPCO network model reconciliation of LANL and MZA model data
Energy Technology Data Exchange (ETDEWEB)
NONE
1992-12-15
The LANL DC load flow model of the VEPCO transmission network shows 210 more substations than the AC load flow model produced by MZA utility Consultants. MZA was requested to determine the source of the difference. The AC load flow model used for this study utilizes 2 standard network algorithms (Decoupled or Newton). The solution time of each is affected by the number of substations. The more substations included, the longer the model will take to solve. In addition, the ability of the algorithms to converge to a solution is affected by line loadings and characteristics. Convergence is inhibited by numerous lightly loaded and electrically short lines. The MZA model reduces the total substations to 343 by creating equivalent loads and generation. Most of the omitted substations are lightly loaded and rated at 115 kV. The MZA model includes 16 substations not included in the LANL model. These represent new generation including Non-Utility Generator (NUG) sites, additional substations and an intertie (Wake, to CP and L). This report also contains data from the Italian State AC power flow model and the Duke Power Company AC flow model.
A Model of Genetic Variation in Human Social Networks
Fowler, James H; Christakis, Nicholas A
2008-01-01
Social networks influence the evolution of cooperation and they exhibit strikingly systematic patterns across a wide range of human contexts. Both of these facts suggest that variation in the topological attributes of human social networks might have a genetic basis. While genetic variation accounts for a significant portion of the variation in many complex social behaviors, the heritability of egocentric social network attributes is unknown. Here we show that three of these attributes (in-degree, transitivity, and centrality) are heritable. We then develop a "mirror network" method to test extant network models and show that none accounts for observed genetic variation in human social networks. We propose an alternative "attract and introduce" model that generates significant heritability as well as other important network features, and we show that this model with two simple forms of heterogeneity is well suited to the modeling of real social networks in humans. These results suggest that natural selection ...
Frank, Laurence Emmanuelle
2006-01-01
Feature Network Models (FNM) are graphical structures that represent proximity data in a discrete space with the use of features. A statistical inference theory is introduced, based on the additivity properties of networks and the linear regression framework. Considering features as predictor
PageRank model of opinion formation on Ulam networks
Chakhmakhchyan, L.; Shepelyansky, D.
2013-12-01
We consider a PageRank model of opinion formation on Ulam networks, generated by the intermittency map and the typical Chirikov map. The Ulam networks generated by these maps have certain similarities with such scale-free networks as the World Wide Web (WWW), showing an algebraic decay of the PageRank probability. We find that the opinion formation process on Ulam networks has certain similarities but also distinct features comparing to the WWW. We attribute these distinctions to internal differences in network structure of the Ulam and WWW networks. We also analyze the process of opinion formation in the frame of generalized Sznajd model which protects opinion of small communities.
A scale-free neural network for modelling neurogenesis
Perotti, Juan I.; Tamarit, Francisco A.; Cannas, Sergio A.
2006-11-01
In this work we introduce a neural network model for associative memory based on a diluted Hopfield model, which grows through a neurogenesis algorithm that guarantees that the final network is a small-world and scale-free one. We also analyze the storage capacity of the network and prove that its performance is larger than that measured in a randomly dilute network with the same connectivity.
A graph model for opportunistic network coding
Sorour, Sameh
2015-08-12
© 2015 IEEE. Recent advancements in graph-based analysis and solutions of instantly decodable network coding (IDNC) trigger the interest to extend them to more complicated opportunistic network coding (ONC) scenarios, with limited increase in complexity. In this paper, we design a simple IDNC-like graph model for a specific subclass of ONC, by introducing a more generalized definition of its vertices and the notion of vertex aggregation in order to represent the storage of non-instantly-decodable packets in ONC. Based on this representation, we determine the set of pairwise vertex adjacency conditions that can populate this graph with edges so as to guarantee decodability or aggregation for the vertices of each clique in this graph. We then develop the algorithmic procedures that can be applied on the designed graph model to optimize any performance metric for this ONC subclass. A case study on reducing the completion time shows that the proposed framework improves on the performance of IDNC and gets very close to the optimal performance.
Marketing communications model for innovation networks
Directory of Open Access Journals (Sweden)
Tiago João Freitas Correia
2015-10-01
Full Text Available Innovation is an increasingly relevant concept for the success of any organization, but it also represents a set of internal and external considerations, barriers and challenges to overcome. Along the concept of innovation, new paradigms emerge such as open innovation and co-creation that are simultaneously innovation modifiers and intensifiers in organizations, promoting organizational openness and stakeholder integration within the value creation process. Innovation networks composed by a multiplicity of agents in co-creative work perform as innovation mechanisms to face the increasingly complexity of products, services and markets. Technology, especially the Internet, is an enabler of all process among organizations supported by co-creative platforms for innovation. The definition of marketing communication strategies that promote motivation and involvement of all stakeholders in synergic creation and external promotion is the central aspect of this research. The implementation of the projects is performed by participative workshops with stakeholders from Madan Parque through IDEAS(REVOLUTION methodology and the operational model LinkUp parameterized for the project. The project is divided into the first part, the theoretical framework, and the second part where a model is developed for the marketing communication strategies that appeal to the Madan Parque case study. Keywords: Marketing Communication; Open Innovation, Technology; Innovation Networks; Incubator; Co-Creation.
Determining Application Runtimes Using Queueing Network Modeling
Energy Technology Data Exchange (ETDEWEB)
Elliott, Michael L. [Univ. of San Francisco, CA (United States)
2006-12-14
Determination of application times-to-solution for large-scale clustered computers continues to be a difficult problem in high-end computing, which will only become more challenging as multi-core consumer machines become more prevalent in the market. Both researchers and consumers of these multi-core systems desire reasonable estimates of how long their programs will take to run (time-to-solution, or TTS), and how many resources will be consumed in the execution. Currently there are few methods of determining these values, and those that do exist are either overly simplistic in their assumptions or require great amounts of effort to parameterize and understand. One previously untried method is queuing network modeling (QNM), which is easy to parameterize and solve, and produces results that typically fall within 10 to 30% of the actual TTS for our test cases. Using characteristics of the computer network (bandwidth, latency) and communication patterns (number of messages, message length, time spent in communication), the QNM model of the NAS-PB CG application was applied to MCR and ALC, supercomputers at LLNL, and the Keck Cluster at USF, with average errors of 2.41%, 3.61%, and -10.73%, respectively, compared to the actual TTS observed. While additional work is necessary to improve the predictive capabilities of QNM, current results show that QNM has a great deal of promise for determining application TTS for multi-processor computer systems.
Modeling management of research and education networks
Galagan, D.V.
2004-01-01
Computer networks and their services have become an essential part of research and education. Nowadays every modern R&E institution must have a computer network and provide network services to its students and staff. In addition to its internal computer network, every R&E institution must have a
Modeling stochasticity in biochemical reaction networks
Constantino, P. H.; Vlysidis, M.; Smadbeck, P.; Kaznessis, Y. N.
2016-03-01
Small biomolecular systems are inherently stochastic. Indeed, fluctuations of molecular species are substantial in living organisms and may result in significant variation in cellular phenotypes. The chemical master equation (CME) is the most detailed mathematical model that can describe stochastic behaviors. However, because of its complexity the CME has been solved for only few, very small reaction networks. As a result, the contribution of CME-based approaches to biology has been very limited. In this review we discuss the approach of solving CME by a set of differential equations of probability moments, called moment equations. We present different approaches to produce and to solve these equations, emphasizing the use of factorial moments and the zero information entropy closure scheme. We also provide information on the stability analysis of stochastic systems. Finally, we speculate on the utility of CME-based modeling formalisms, especially in the context of synthetic biology efforts.
Modelling of A Trust and Reputation Model in Wireless Networks
Directory of Open Access Journals (Sweden)
Saurabh Mishra
2015-09-01
Full Text Available Security is the major challenge for Wireless Sensor Networks (WSNs. The sensor nodes are deployed in non controlled environment, facing the danger of information leakage, adversary attacks and other threats. Trust and Reputation models are solutions for this problem and to identify malicious, selfish and compromised nodes. This paper aims to evaluate varying collusion effect with respect to static (SW, dynamic (DW, static with collusion (SWC, dynamic with collusion (DWC and oscillating wireless sensor networks to derive the joint resultant of Eigen Trust Model. An attempt has been made for the same by comparing aforementioned networks that are purely dedicated to protect the WSNs from adversary attacks and maintain the security issues. The comparison has been made with respect to accuracy and path length and founded that, collusion for wireless sensor networks seems intractable with the static and dynamic WSNs when varied with specified number of fraudulent nodes in the scenario. Additionally, it consumes more energy and resources in oscillating and collusive environments.
Multiplicative Attribute Graph Model of Real-World Networks
Energy Technology Data Exchange (ETDEWEB)
Kim, Myunghwan [Stanford Univ., CA (United States); Leskovec, Jure [Stanford Univ., CA (United States)
2010-10-20
Large scale real-world network data, such as social networks, Internet andWeb graphs, is ubiquitous in a variety of scientific domains. The study of such social and information networks commonly finds patterns and explain their emergence through tractable models. In most networks, especially in social networks, nodes also have a rich set of attributes (e.g., age, gender) associatedwith them. However, most of the existing network models focus only on modeling the network structure while ignoring the features of nodes in the network. Here we present a class of network models that we refer to as the Multiplicative Attribute Graphs (MAG), which naturally captures the interactions between the network structure and node attributes. We consider a model where each node has a vector of categorical features associated with it. The probability of an edge between a pair of nodes then depends on the product of individual attributeattribute similarities. The model yields itself to mathematical analysis as well as fit to real data. We derive thresholds for the connectivity, the emergence of the giant connected component, and show that the model gives rise to graphs with a constant diameter. Moreover, we analyze the degree distribution to show that the model can produce networks with either lognormal or power-law degree distribution depending on certain conditions.
Multilevel method for modeling large-scale networks.
Energy Technology Data Exchange (ETDEWEB)
Safro, I. M. (Mathematics and Computer Science)
2012-02-24
Understanding the behavior of real complex networks is of great theoretical and practical significance. It includes developing accurate artificial models whose topological properties are similar to the real networks, generating the artificial networks at different scales under special conditions, investigating a network dynamics, reconstructing missing data, predicting network response, detecting anomalies and other tasks. Network generation, reconstruction, and prediction of its future topology are central issues of this field. In this project, we address the questions related to the understanding of the network modeling, investigating its structure and properties, and generating artificial networks. Most of the modern network generation methods are based either on various random graph models (reinforced by a set of properties such as power law distribution of node degrees, graph diameter, and number of triangles) or on the principle of replicating an existing model with elements of randomization such as R-MAT generator and Kronecker product modeling. Hierarchical models operate at different levels of network hierarchy but with the same finest elements of the network. However, in many cases the methods that include randomization and replication elements on the finest relationships between network nodes and modeling that addresses the problem of preserving a set of simplified properties do not fit accurately enough the real networks. Among the unsatisfactory features are numerically inadequate results, non-stability of algorithms on real (artificial) data, that have been tested on artificial (real) data, and incorrect behavior at different scales. One reason is that randomization and replication of existing structures can create conflicts between fine and coarse scales of the real network geometry. Moreover, the randomization and satisfying of some attribute at the same time can abolish those topological attributes that have been undefined or hidden from
CNMO: Towards the Construction of a Communication Network Modelling Ontology
Rahman, Muhammad Azizur; Pakstas, Algirdas; Wang, Frank Zhigang
Ontologies that explicitly identify objects, properties, and relationships in specific domains are essential for collaboration that involves sharing of data, knowledge or resources. A communications network modelling ontology (CNMO) has been designed to represent a network model as well as aspects related to its development and actual network operation. Network nodes/sites, link, traffic sources, protocols as well as aspects of the modeling/simulation scenario and operational aspects are defined with their formal representation. A CNMO may be beneficial for various network design/simulation/research communities due to the uniform representation of network models. This ontology is designed using terminology and concepts from various network modeling, simulation and topology generation tools.
Topological evolution of virtual social networks by modeling social activities
Sun, Xin; Dong, Junyu; Tang, Ruichun; Xu, Mantao; Qi, Lin; Cai, Yang
2015-09-01
With the development of Internet and wireless communication, virtual social networks are becoming increasingly important in the formation of nowadays' social communities. Topological evolution model is foundational and critical for social network related researches. Up to present most of the related research experiments are carried out on artificial networks, however, a study of incorporating the actual social activities into the network topology model is ignored. This paper first formalizes two mathematical abstract concepts of hobbies search and friend recommendation to model the social actions people exhibit. Then a social activities based topology evolution simulation model is developed to satisfy some well-known properties that have been discovered in real-world social networks. Empirical results show that the proposed topology evolution model has embraced several key network topological properties of concern, which can be envisioned as signatures of real social networks.
Hematopoietic differentiation: a coordinated dynamical process towards attractor stable states
Directory of Open Access Journals (Sweden)
Rossi Simona
2010-06-01
Full Text Available Abstract Background The differentiation process, proceeding from stem cells towards the different committed cell types, can be considered as a trajectory towards an attractor of a dynamical process. This view, taking into consideration the transcriptome and miRNome dynamics considered as a whole, instead of looking at few 'master genes' driving the system, offers a novel perspective on this phenomenon. We investigated the 'differentiation trajectories' of the hematopoietic system considering a genome-wide scenario. Results We developed serum-free liquid suspension unilineage cultures of cord blood (CB CD34+ hematopoietic progenitor cells through erythroid (E, megakaryocytic (MK, granulocytic (G and monocytic (Mo pathways. These cultures recapitulate physiological hematopoiesis, allowing the analysis of almost pure unilineage precursors starting from initial differentiation of HPCs until terminal maturation. By analyzing the expression profile of protein coding genes and microRNAs in unilineage CB E, MK, G and Mo cultures, at sequential stages of differentiation and maturation, we observed a coordinated, fully interconnected and scalable character of cell population behaviour in both transcriptome and miRNome spaces reminiscent of an attractor-like dynamics. MiRNome and transcriptome space differed for a still not terminally committed behaviour of microRNAs. Conclusions Consistent with their roles, the transcriptome system can be considered as the state space of a cell population, while the continuously evolving miRNA space corresponds to the tuning system necessary to reach the attractor. The behaviour of miRNA machinery could be of great relevance not only for the promise of reversing the differentiated state but even for tumor biology.
An Efficient Multitask Scheduling Model for Wireless Sensor Networks
Directory of Open Access Journals (Sweden)
Hongsheng Yin
2014-01-01
Full Text Available The sensor nodes of multitask wireless network are constrained in performance-driven computation. Theoretical studies on the data processing model of wireless sensor nodes suggest satisfying the requirements of high qualities of service (QoS of multiple application networks, thus improving the efficiency of network. In this paper, we present the priority based data processing model for multitask sensor nodes in the architecture of multitask wireless sensor network. The proposed model is deduced with the M/M/1 queuing model based on the queuing theory where the average delay of data packets passing by sensor nodes is estimated. The model is validated with the real data from the Huoerxinhe Coal Mine. By applying the proposed priority based data processing model in the multitask wireless sensor network, the average delay of data packets in a sensor nodes is reduced nearly to 50%. The simulation results show that the proposed model can improve the throughput of network efficiently.
Vehicle Scheduling with Network Flow Models
Directory of Open Access Journals (Sweden)
Gustavo P. Silva
2010-04-01
Full Text Available
Este trabalho retrata a primeira fase de uma pesquisa de doutorado voltada para a utilização de modelos de fluxo em redes para programação de veículos (de ônibus, em particular. A utilização de modelos deste tipo ainda e muito pouco explorada na literatura, principalmente pela dificuldade imposta pelo grande numero de variáveis resultante. Neste trabalho são apresentadas formulações para tratamento do problema de programação de veículos associados a um único depósito (ou garagem como problema de fluxo em redes, incluindo duas técnicas para reduzir o numero de arcos na rede criada e, conseqüentemente, o numero de variáveis a tratar. Uma destas técnicas de redução de arcos foi implementada e o problema de fluxo resultante foi direcionado para ser resolvido, nesta fase da pesquisa, por uma versão disponível do algoritmo Simplex para redes. Problemas teste baseados em dados reais da cidade de Reading, UK, foram resolvidos com a utilização da formulação de fluxo em redes adotada, e os resultados comparados com aqueles obtidos pelo método heurístico BOOST, o qual tem sido largamente testado e comercializado pela School of Computer Studies da Universidade de Leeds, UK. Os resultados alcançados demonstram a possibilidade de tratamento de problemas reais com a técnica de redução de arcos.
ABSTRACT
This paper presents the successful results of a first phase of a doctoral research addressed to solving vehicle (bus, in particular scheduling problems through network flow formulations. Network flow modeling for this kind of problem is a promising, but not a well explored approach, mainly because of the large number of variables related to number of arcs of real case networks. The paper presents and discusses some network flow formulations for the single depot bus vehicle scheduling problem, along with two techniques of arc reduction. One of these arc reduction techniques has been implemented and the underlying
Bicriteria Models of Vehicles Recycling Network Facility Location
Merkisz-Guranowska, Agnieszka
2012-06-01
The paper presents the issues related to modeling of a vehicle recycling network. The functioning of the recycling network is within the realm of interest of a variety of government agendas, companies participating in the network, vehicle manufacturers and vehicle end users. The interests of these groups need to be considered when deciding about the network organization. The paper presents bicriteria models of network entity location that take into account the preferences of the vehicle owners and network participants related to the network construction and reorganization. A mathematical formulation of the optimization tasks has been presented including the objective functions and limitations that the solutions have to comply with. Then, the models were used for the network optimization in Poland.
Models as Tools of Analysis of a Network Organisation
Directory of Open Access Journals (Sweden)
Wojciech Pająk
2013-06-01
Full Text Available The paper presents models which may be applied as tools of analysis of a network organisation. The starting point of the discussion is defining the following terms: supply chain and network organisation. Further parts of the paper present basic assumptions analysis of a network organisation. Then the study characterises the best known models utilised in analysis of a network organisation. The purpose of the article is to define the notion and the essence of network organizations and to present the models used for their analysis.
Diffusion-Reorganized Aggregates: Attractors in Diffusion Processes?
Filoche, Marcel; Sapoval, Bernard
2000-12-01
A process based on particle evaporation, diffusion, and redeposition is applied iteratively to a two-dimensional object of arbitrary shape. The evolution spontaneously transforms the object morphology, converging to branched structures. Independently of initial geometry, the structures found after a long time present fractal geometry with a fractal dimension around 1.75. The final morphology, which constantly evolves in time, can be considered as the dynamic attractor of this evaporation-diffusion-redeposition operator. The ensemble of these fractal shapes can be considered to be the dynamical equilibrium geometry of a diffusion-controlled self-transformation process.
Multiple Coexisting Attractors and Hysteresis in the Generalized Ueda Oscillator
Directory of Open Access Journals (Sweden)
Kehui Sun
2013-01-01
Full Text Available A periodically forced nonlinear oscillator called the generalized Ueda oscillator is proposed. The restoring force term of this equation consists of a nonlinear function sgn(x and an absolute function with a variant power. Dynamics is investigated by detailed numerical analysis as well as dynamic simulation, including the largest Lyapunov exponent, phase diagrams, and bifurcation diagrams. Multiple coexisting attractors and complex hysteresis phenomenon are observed. The results show that this system has rich dynamical behaviors, and it has a promising application in the fields of science and engineering.
Exploring strange nonchaotic attractors through Jacobian elliptic functions
Energy Technology Data Exchange (ETDEWEB)
GarcIa-Hoz, A Martinez [Departamento de Fisica Aplicada, Escuela Universitaria Politecnica, Universidad de Castilla La Mancha, E-13400 Almaden (Ciudad Real) (Spain); Chacon, R, E-mail: rchacon@unex.es [Departamento de Fisica Aplicada, Escuela de IngenierIas Industriales, Universidad de Extremadura, Apartado Postal 382, E-06006 Badajoz (Spain)
2011-11-15
We demonstrate the effectiveness of Jacobian elliptic functions (JEFs) for inquiring into the reshaping effect of quasiperiodic forces in nonlinear nonautonomous systems exhibiting strange nonchaotic attractors (SNAs). Specifically, we characterize analytically and numerically some reshaping-induced transitions starting from SNAs in the context of quasiperiodically forced systems. We found similar scenarios of SNAs from the analysis of two representative examples: a quasiperiodically forced damped pendulum and a two-dimensional map. This clearly well-suited and advantageous use of the JEFs, which in their own right lie at the heart of nonlinear physics, may encourage students at intermediate university levels to study them in depth.
From topology to dynamics in biochemical networks.
Fox, Jeffrey J.; Hill, Colin C.
2001-12-01
Abstract formulations of the regulation of gene expression as random Boolean switching networks have been studied extensively over the past three decades. These models have been developed to make statistical predictions of the types of dynamics observed in biological networks based on network topology and interaction bias, p. For values of mean connectivity chosen to correspond to real biological networks, these models predict disordered dynamics. However, chaotic dynamics seems to be absent from the functioning of a normal cell. While these models use a fixed number of inputs for each element in the network, recent experimental evidence suggests that several biological networks have distributions in connectivity. We therefore study randomly constructed Boolean networks with distributions in the number of inputs, K, to each element. We study three distributions: delta function, Poisson, and power law (scale free). We analytically show that the critical value of the interaction bias parameter, p, above which steady state behavior is observed, is independent of the distribution in the limit of the number of elements N--> infinity. We also study these networks numerically. Using three different measures (types of attractors, fraction of elements that are active, and length of period), we show that finite, scale-free networks are more ordered than either the Poisson or delta function networks below the critical point. Thus the topology of scale-free biochemical networks, characterized by a wide distribution in the number of inputs per element, may provide a source of order in living cells. (c) 2001 American Institute of Physics.
Sustainability as global attractor: the greening of the 2008 Beijing Olympics
Mol, A.P.J.
2010-01-01
If one interprets sustainability as an attractor, it means that across time and place notions and ideas of sustainability structure, order and pattern institutions and practices. One can effectively explore the idea that sustainability is turning into a global attractor through mega events. As high
Natural Models for Evolution on Networks
Mertzios, George B; Raptopoulos, Christoforos; Spirakis, Paul G
2011-01-01
Evolutionary dynamics have been traditionally studied in the context of homogeneous populations, mainly described my the Moran process. Recently, this approach has been generalized in \\cite{LHN} by arranging individuals on the nodes of a network. Undirected networks seem to have a smoother behavior than directed ones, and thus it is more challenging to find suppressors/amplifiers of selection. In this paper we present the first class of undirected graphs which act as suppressors of selection, by achieving a fixation probability that is at most one half of that of the complete graph, as the number of vertices increases. Moreover, we provide some generic upper and lower bounds for the fixation probability of general undirected graphs. As our main contribution, we introduce the natural alternative of the model proposed in \\cite{LHN}, where all individuals interact simultaneously and the result is a compromise between aggressive and non-aggressive individuals. That is, the behavior of the individuals in our new m...
A last updating evolution model for online social networks
Bu, Zhan; Xia, Zhengyou; Wang, Jiandong; Zhang, Chengcui
2013-05-01
As information technology has advanced, people are turning to electronic media more frequently for communication, and social relationships are increasingly found on online channels. However, there is very limited knowledge about the actual evolution of the online social networks. In this paper, we propose and study a novel evolution network model with the new concept of “last updating time”, which exists in many real-life online social networks. The last updating evolution network model can maintain the robustness of scale-free networks and can improve the network reliance against intentional attacks. What is more, we also found that it has the “small-world effect”, which is the inherent property of most social networks. Simulation experiment based on this model show that the results and the real-life data are consistent, which means that our model is valid.
Precise Network Modeling of Systems Genetics Data Using the Bayesian Network Webserver.
Ziebarth, Jesse D; Cui, Yan
2017-01-01
The Bayesian Network Webserver (BNW, http://compbio.uthsc.edu/BNW ) is an integrated platform for Bayesian network modeling of biological datasets. It provides a web-based network modeling environment that seamlessly integrates advanced algorithms for probabilistic causal modeling and reasoning with Bayesian networks. BNW is designed for precise modeling of relatively small networks that contain less than 20 nodes. The structure learning algorithms used by BNW guarantee the discovery of the best (most probable) network structure given the data. To facilitate network modeling across multiple biological levels, BNW provides a very flexible interface that allows users to assign network nodes into different tiers and define the relationships between and within the tiers. This function is particularly useful for modeling systems genetics datasets that often consist of multiscalar heterogeneous genotype-to-phenotype data. BNW enables users to, within seconds or minutes, go from having a simply formatted input file containing a dataset to using a network model to make predictions about the interactions between variables and the potential effects of experimental interventions. In this chapter, we will introduce the functions of BNW and show how to model systems genetics datasets with BNW.
Multiple Social Networks, Data Models and Measures for
DEFF Research Database (Denmark)
Magnani, Matteo; Rossi, Luca
2017-01-01
Multiple Social Network Analysis is a discipline defining models, measures, methodologies, and algorithms to study multiple social networks together as a single social system. It is particularly valuable when the networks are interconnected, e.g., the same actors are present in more than one...
Throughput capacity computation model for hybrid wireless networks
African Journals Online (AJOL)
wireless networks. We present in this paper, a computational model for obtaining throughput capacity for hybrid wireless networks. For a hybrid network with n nodes and m base stations, we observe through simulation that the throughput capacity increases linearly with the base station infrastructure connected by the wired ...
Modelling crime linkage with Bayesian networks.
de Zoete, Jacob; Sjerps, Marjan; Lagnado, David; Fenton, Norman
2015-05-01
When two or more crimes show specific similarities, such as a very distinct modus operandi, the probability that they were committed by the same offender becomes of interest. This probability depends on the degree of similarity and distinctiveness. We show how Bayesian networks can be used to model different evidential structures that can occur when linking crimes, and how they assist in understanding the complex underlying dependencies. That is, how evidence that is obtained in one case can be used in another and vice versa. The flip side of this is that the intuitive decision to "unlink" a case in which exculpatory evidence is obtained leads to serious overestimation of the strength of the remaining cases. Copyright © 2014 Forensic Science Society. Published by Elsevier Ireland Ltd. All rights reserved.
Structural equation models from paths to networks
Westland, J Christopher
2015-01-01
This compact reference surveys the full range of available structural equation modeling (SEM) methodologies. It reviews applications in a broad range of disciplines, particularly in the social sciences where many key concepts are not directly observable. This is the first book to present SEM’s development in its proper historical context–essential to understanding the application, strengths and weaknesses of each particular method. This book also surveys the emerging path and network approaches that complement and enhance SEM, and that will grow in importance in the near future. SEM’s ability to accommodate unobservable theory constructs through latent variables is of significant importance to social scientists. Latent variable theory and application are comprehensively explained, and methods are presented for extending their power, including guidelines for data preparation, sample size calculation, and the special treatment of Likert scale data. Tables of software, methodologies and fit st...
A mathematical model for networks with structures in the mesoscale
Criado, Regino; Flores, Julio; Gacia Del Amo, Alejandro Jose; Gómez, Jesus; Romance, Miguel
2011-01-01
Abstract The new concept of multilevel network is introduced in order to embody some topological properties of complex systems with structures in the mesoscale which are not completely captured by the classical models. This new model, which generalizes the hyper-network and hyper-structure models, fits perfectly with several real-life complex systems, including social and public transportation networks. We present an analysis of the structural properties of the mu...
Agent Based Modeling on Organizational Dynamics of Terrorist Network
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 ...
Adaptive Networks Theory, Models and Applications
Gross, Thilo
2009-01-01
With adaptive, complex networks, the evolution of the network topology and the dynamical processes on the network are equally important and often fundamentally entangled. Recent research has shown that such networks can exhibit a plethora of new phenomena which are ultimately required to describe many real-world networks. Some of those phenomena include robust self-organization towards dynamical criticality, formation of complex global topologies based on simple, local rules, and the spontaneous division of "labor" in which an initially homogenous population of network nodes self-organizes into functionally distinct classes. These are just a few. This book is a state-of-the-art survey of those unique networks. In it, leading researchers set out to define the future scope and direction of some of the most advanced developments in the vast field of complex network science and its applications.
Directory of Open Access Journals (Sweden)
Ping Zhou
2017-01-01
Full Text Available Based on the 3D autonomous continuous Lü chaotic system, a new 3D autonomous continuous chaotic system is proposed in this paper, and there are coexisting chaotic attractors in the 3D autonomous continuous chaotic system. Moreover, there are no overlaps between the coexisting chaotic attractors; that is, there are two isolated chaotic attractors (in this paper, named “positive attractor” and “negative attractor,” resp.. The “positive attractor” and “negative attractor” depend on the distance between the initial points (initial conditions and the unstable equilibrium points. Furthermore, by means of topological horseshoes theory and numerical computation, the topological horseshoes in this 3D autonomous continuous system is found, and the topological entropy is obtained. These results indicate that the chaotic attractor emerges in the new 3D autonomous continuous system.
A Cascade-Based Emergency Model for Water Distribution Network
Directory of Open Access Journals (Sweden)
Qing Shuang
2015-01-01
Full Text Available Water distribution network is important in the critical physical infrastructure systems. The paper studies the emergency resource strategies on water distribution network with the approach of complex network and cascading failures. The model of cascade-based emergency for water distribution network is built. The cascade-based model considers the network topology analysis and hydraulic analysis to provide a more realistic result. A load redistribution function with emergency recovery mechanisms is established. From the aspects of uniform distribution, node betweenness, and node pressure, six recovery strategies are given to reflect the network topology and the failure information, respectively. The recovery strategies are evaluated with the complex network indicators to describe the failure scale and failure velocity. The proposed method is applied by an illustrative example. The results showed that the recovery strategy considering the node pressure can enhance the network robustness effectively. Besides, this strategy can reduce the failure nodes and generate the least failure nodes per time.
Integrating public transort networks in the axial model
Gil, J.
2012-01-01
This study presents a first step in the development of a model that integrates public transport networks with the space syntax axial model, towards a network model that can describe the multi?modal movement structure of a city and study its patterns and flows. It describes the method for building an
An intercausal cancellation model for Bayesian-network engineering
Woudenberg, Steven P D; Van Der Gaag, Linda C.; Rademaker, Carin M A
2015-01-01
When constructing Bayesian networks with domain experts, network engineers often use the noisy-OR model, and causal interaction models more generally, to alleviate the burden of probability elicitation: the use of such a model serves to reduce the number of probabilities to be elicited on the one
Common quandaries and their practical solutions in Bayesian network modeling
Bruce G. Marcot
2017-01-01
Use and popularity of Bayesian network (BN) modeling has greatly expanded in recent years, but many common problems remain. Here, I summarize key problems in BN model construction and interpretation,along with suggested practical solutions. Problems in BN model construction include parameterizing probability values, variable definition, complex network structures,...
Directory of Open Access Journals (Sweden)
Lan Liu
2017-01-01
Full Text Available As the adoption of Software Defined Networks (SDNs grows, the security of SDN still has several unaddressed limitations. A key network security research area is in the study of malware propagation across the SDN-enabled networks. To analyze the spreading processes of network malware (e.g., viruses in SDN, we propose a dynamic model with a time-varying community network, inspired by research models on the spread of epidemics in complex networks across communities. We assume subnets of the network as communities and links that are dense in subnets but sparse between subnets. Using numerical simulation and theoretical analysis, we find that the efficiency of network malware propagation in this model depends on the mobility rate q of the nodes between subnets. We also find that there exists a mobility rate threshold qc. The network malware will spread in the SDN when the mobility rate q>qc. The malware will survive when q>qc and perish when q
Modeling the reemergence of information diffusion in social network
Yang, Dingda; Liao, Xiangwen; Shen, Huawei; Cheng, Xueqi; Chen, Guolong
2018-01-01
Information diffusion in networks is an important research topic in various fields. Existing studies either focus on modeling the process of information diffusion, e.g., independent cascade model and linear threshold model, or investigate information diffusion in networks with certain structural characteristics such as scale-free networks and small world networks. However, there are still several phenomena that have not been captured by existing information diffusion models. One of the prominent phenomena is the reemergence of information diffusion, i.e., a piece of information reemerges after the completion of its initial diffusion process. In this paper, we propose an optimized information diffusion model by introducing a new informed state into traditional susceptible-infected-removed model. We verify the proposed model via simulations in real-world social networks, and the results indicate that the model can reproduce the reemergence of information during the diffusion process.
Spectral Modelling for Spatial Network Analysis
Nourian, P.; Rezvani, S.; Sariyildiz, I.S.; van der Hoeven, F.D.; Attar, Ramtin; Chronis, Angelos; Hanna, Sean; Turrin, Michela
2016-01-01
Spatial Networks represent the connectivity structure between units of space as a weighted graph whose links are weighted as to the strength of connections. In case of urban spatial networks, the units of space correspond closely to streets and in architectural spatial networks the units correspond
Charge Orbits of Symmetric Special Geometries and Attractors
Bellucci, S; Günaydin, M; Marrani, A; Bellucci, Stefano; Ferrara, Sergio; Gunaydin, Murat; Marrani, Alessio
2006-01-01
We study the critical points of the black hole scalar potential $V_{BH}$ in N=2, d=4 supergravity coupled to $n_{V}$ vector multiplets, in an asymptotically flat extremal black hole background described by a 2(n_{V}+1)-dimensional dyonic charge vector and (complex) scalar fields which are coordinates of a special K\\"{a}hler manifold. For the case of homogeneous symmetric spaces, we find three general classes of regular attractor solutions with non-vanishing Bekenstein-Hawking entropy. They correspond to three (inequivalent) classes of orbits of the charge vector, which is in a 2(n_{V}+1)-dimensional representation $R_{V}$ of the U-duality group. Such orbits are non-degenerate, namely they have non-vanishing quartic invariant (for rank-3 spaces). Other than the 1/2-BPS one, there are two other distinct non-BPS classes of charge orbits, one of which has vanishing central charge. The three species of solutions to the N=2 extremal black hole attractor equations give rise to different mass spectra of the scalar fl...
Infinite Multiple Membership Relational Modeling for Complex Networks
DEFF Research Database (Denmark)
Mørup, Morten; Schmidt, Mikkel Nørgaard; Hansen, Lars Kai
Learning latent structure in complex networks has become an important problem fueled by many types of networked data originating from practically all fields of science. In this paper, we propose a new non-parametric Bayesian multiplemembership latent feature model for networks. Contrary to existing...... multiplemembership models that scale quadratically in the number of vertices the proposedmodel scales linearly in the number of links admittingmultiple-membership analysis in large scale networks. We demonstrate a connection between the single membership relational model and multiple membership models and show...
Performance Modeling for Heterogeneous Wireless Networks with Multiservice Overflow Traffic
DEFF Research Database (Denmark)
Huang, Qian; Ko, King-Tim; Iversen, Villy Bæk
2009-01-01
Performance modeling is important for the purpose of developing efficient dimensioning tools for large complicated networks. But it is difficult to achieve in heterogeneous wireless networks, where different networks have different statistical characteristics in service and traffic models....... Multiservice loss analysis based on multi-dimensional Markov chain becomes intractable in these networks due to intensive computations required. This paper focuses on performance modeling for heterogeneous wireless networks based on a hierarchical overlay infrastructure. A method based on decomposition...... of the correlated traffic is used to achieve an approximate performance modeling for multiservice in hierarchical heterogeneous wireless networks with overflow traffic. The accuracy of the approximate performance obtained by our proposed modeling is verified by simulations....
Piecewise linear and Boolean models of chemical reaction networks.
Veliz-Cuba, Alan; Kumar, Ajit; Josić, Krešimir
2014-12-01
Models of biochemical networks are frequently complex and high-dimensional. Reduction methods that preserve important dynamical properties are therefore essential for their study. Interactions in biochemical networks are frequently modeled using Hill functions ([Formula: see text]). Reduced ODEs and Boolean approximations of such model networks have been studied extensively when the exponent [Formula: see text] is large. However, while the case of small constant [Formula: see text] appears in practice, it is not well understood. We provide a mathematical analysis of this limit and show that a reduction to a set of piecewise linear ODEs and Boolean networks can be mathematically justified. The piecewise linear systems have closed-form solutions that closely track those of the fully nonlinear model. The simpler, Boolean network can be used to study the qualitative behavior of the original system. We justify the reduction using geometric singular perturbation theory and compact convergence, and illustrate the results in network models of a toggle switch and an oscillator.
Directory of Open Access Journals (Sweden)
Mohammad Taghi Ameli
2012-01-01
Full Text Available Transmission Network Expansion Planning (TNEP is a basic part of power network planning that determines where, when and how many new transmission lines should be added to the network. So, the TNEP is an optimization problem in which the expansion purposes are optimized. Artificial Intelligence (AI tools such as Genetic Algorithm (GA, Simulated Annealing (SA, Tabu Search (TS and Artificial Neural Networks (ANNs are methods used for solving the TNEP problem. Today, by using the hybridization models of AI tools, we can solve the TNEP problem for large-scale systems, which shows the effectiveness of utilizing such models. In this paper, a new approach to the hybridization model of Probabilistic Neural Networks (PNNs and Harmony Search Algorithm (HSA was used to solve the TNEP problem. Finally, by considering the uncertain role of the load based on a scenario technique, this proposed model was tested on the Garver’s 6-bus network.
BOUNDARY CRISIS OF ATTRACTOR IN THE SIMULATION CAUSES OF THE DEGRADATION OF COMMERCIAL BIORESOURCES
Directory of Open Access Journals (Sweden)
A. Yu. Perevarukha
2015-01-01
Full Text Available The article describes the computational model that unites the formalization of ecological features of the reproductive cycle of anadromous fish and the possibility of studying nonlinear effects in the population dynamics under anthropogenic impact. Event-driven component implemented in continuous time has allowed us to take into account changes in the survival generation in interrelation with the factors of growth rate. Discrete component trajectory of the dynamical system has two areas of attraction and is characterized by the reverse tangent bifurcation due to the impact of fishing, which dramatically transforms the population with the condition of irregular fluctuations in low numbers. The further emergence of «boundary crisis» for the interval attractor describes a common scenario an irreversible degradation of biological resources.
d=4 Black Hole Attractors in N=2 Supergravity with Fayet-Iliopoulos Terms
Bellucci, S; Marrani, A; Yeranyan, A
2008-01-01
We generalize the description of the d=4 Attractor Mechanism based on an effective black hole (BH) potential to the presence of a gauging which does not modify the derivatives of the scalars and does not involve hypermultiplets. The obtained results do not rely necessarily on supersymmetry, and they can be extended to d>4, as well. Thence, we work out the example of the stu model of N=2 supergravity in the presence of Fayet-Iliopoulos terms, for the supergravity analogues of the magnetic and D0-D6 BH charge configurations, and in three different symplectic frames: the SO(1,1)^{2}, SO(2,2) covariant and SO(8)-truncated ones. The attractive nature of the critical points, related to the semi-positive definiteness of the Hessian matrix, is also studied.
Heterogeneous information network model for equipment-standard system
Yin, Liang; Shi, Li-Chen; Zhao, Jun-Yan; Du, Song-Yang; Xie, Wen-Bo; Yuan, Fei; Chen, Duan-Bing
2018-01-01
Entity information network is used to describe structural relationships between entities. Taking advantage of its extension and heterogeneity, entity information network is more and more widely applied to relationship modeling. Recent years, lots of researches about entity information network modeling have been proposed, while seldom of them concentrate on equipment-standard system with properties of multi-layer, multi-dimension and multi-scale. In order to efficiently deal with some complex issues in equipment-standard system such as standard revising, standard controlling, and production designing, a heterogeneous information network model for equipment-standard system is proposed in this paper. Three types of entities and six types of relationships are considered in the proposed model. Correspondingly, several different similarity-measuring methods are used in the modeling process. The experiments show that the heterogeneous information network model established in this paper can reflect relationships between entities accurately. Meanwhile, the modeling process has a good performance on time consumption.
Modified Penna bit-string network evolution model for scale-free networks with assortative mixing
Kim, Yup; Choi, Woosik; Yook, Soon-Hyung
2012-02-01
Motivated by biological aging dynamics, we introduce a network evolution model for social interaction networks. In order to study the effect of social interactions originating from biological and sociological reasons on the topological properties of networks, we introduce the activitydependent rewiring process. From the numerical simulations, we show that the degree distribution of the obtained networks follows a power-law distribution with an exponentially decaying tail, P( k) ˜ ( k + c)- γ exp(- k/k 0). The obtained value of γ is in the range 2 networks. Moreover, we also show that the degree-degree correlation of the network is positive, which is a characteristic of social interaction networks. The possible applications of our model to real systems are also discussed.
Ripple-Spreading Network Model Optimization by Genetic Algorithm
Directory of Open Access Journals (Sweden)
Xiao-Bing Hu
2013-01-01
Full Text Available Small-world and scale-free properties are widely acknowledged in many real-world complex network systems, and many network models have been developed to capture these network properties. The ripple-spreading network model (RSNM is a newly reported complex network model, which is inspired by the natural ripple-spreading phenomenon on clam water surface. The RSNM exhibits good potential for describing both spatial and temporal features in the development of many real-world networks where the influence of a few local events spreads out through nodes and then largely determines the final network topology. However, the relationships between ripple-spreading related parameters (RSRPs of RSNM and small-world and scale-free topologies are not as obvious or straightforward as in many other network models. This paper attempts to apply genetic algorithm (GA to tune the values of RSRPs, so that the RSNM may generate these two most important network topologies. The study demonstrates that, once RSRPs are properly tuned by GA, the RSNM is capable of generating both network topologies and therefore has a great flexibility to study many real-world complex network systems.
Network models of frugivory and seed dispersal: Challenges and opportunities
Carlo, Tomás A.; Yang, Suann
2011-11-01
Network analyses have emerged as a new tool to study frugivory and seed dispersal (FSD) mutualisms because networks can model and simplify the complexity of multiple community-wide species interactions. Moreover, network theory suggests that structural properties, such as the presence of highly generalist species, are linked to the stability of mutualistic communities. However, we still lack empirical validation of network model predictions. Here we outline new research avenues to connect network models to FSD processes, and illustrate the challenges and opportunities of this tool with a field study. We hypothesized that generalist frugivores would be important for forest stability by dispersing seeds into deforested areas and initiating reforestation. We then constructed a network of plant-frugivore interactions using published data and identified the most generalist frugivores. To test the importance of generalists we measured: 1) the frequency with which frugivores moved between pasture and forest, 2) the bird-generated seed rain under perches in the pasture, and 3) the perching frequency of birds above seed traps. The generalist frugivores in the forest network were not important for seed dispersal into pastures, and thus for forest recovery, because the forest network excluded habitat heterogeneities, frugivore behavior, and movements. More research is needed to develop ways to incorporate relevant FSD processes into network models in order for these models to be more useful to community ecology and conservation. The network framework can serve to spark and renew interest in FSD and further our understanding of plant-animal communities.
Hybrid neural network bushing model for vehicle dynamics simulation
Energy Technology Data Exchange (ETDEWEB)
Sohn, Jeong Hyun [Pukyong National University, Busan (Korea, Republic of); Lee, Seung Kyu [Hyosung Corporation, Changwon (Korea, Republic of); Yoo, Wan Suk [Pusan National University, Busan (Korea, Republic of)
2008-12-15
Although the linear model was widely used for the bushing model in vehicle suspension systems, it could not express the nonlinear characteristics of bushing in terms of the amplitude and the frequency. An artificial neural network model was suggested to consider the hysteretic responses of bushings. This model, however, often diverges due to the uncertainties of the neural network under the unexpected excitation inputs. In this paper, a hybrid neural network bushing model combining linear and neural network is suggested. A linear model was employed to represent linear stiffness and damping effects, and the artificial neural network algorithm was adopted to take into account the hysteretic responses. A rubber test was performed to capture bushing characteristics, where sine excitation with different frequencies and amplitudes is applied. Random test results were used to update the weighting factors of the neural network model. It is proven that the proposed model has more robust characteristics than a simple neural network model under step excitation input. A full car simulation was carried out to verify the proposed bushing models. It was shown that the hybrid model results are almost identical to the linear model under several maneuvers
Optical Network Models and Their Application to Software-Defined Network Management
Directory of Open Access Journals (Sweden)
Thomas Szyrkowiec
2017-01-01
Full Text Available Software-defined networking is finding its way into optical networks. Here, it promises a simplification and unification of network management for optical networks allowing automation of operational tasks despite the highly diverse and vendor-specific commercial systems and the complexity and analog nature of optical transmission. Common abstractions and interfaces are a fundamental component for software-defined optical networking. Currently, a number of models for optical networks are available. They all claim to provide open and vendor agnostic management of optical equipment. In this work, we survey and compare the most important models and propose an intent interface for creating virtual topologies which is integrated in the existing model ecosystem.
An image segmentation method based on network clustering model
Jiao, Yang; Wu, Jianshe; Jiao, Licheng
2018-01-01
Network clustering phenomena are ubiquitous in nature and human society. In this paper, a method involving a network clustering model is proposed for mass segmentation in mammograms. First, the watershed transform is used to divide an image into regions, and features of the image are computed. Then a graph is constructed from the obtained regions and features. The network clustering model is applied to realize clustering of nodes in the graph. Compared with two classic methods, the algorithm based on the network clustering model performs more effectively in experiments.
Small is beautiful: models of small neuronal networks.
Lamb, Damon G; Calabrese, Ronald L
2012-08-01
Modeling has contributed a great deal to our understanding of how individual neurons and neuronal networks function. In this review, we focus on models of the small neuronal networks of invertebrates, especially rhythmically active CPG networks. Models have elucidated many aspects of these networks, from identifying key interacting membrane properties to pointing out gaps in our understanding, for example missing neurons. Even the complex CPGs of vertebrates, such as those that underlie respiration, have been reduced to small network models to great effect. Modeling of these networks spans from simplified models, which are amenable to mathematical analyses, to very complicated biophysical models. Some researchers have now adopted a population approach, where they generate and analyze many related models that differ in a few to several judiciously chosen free parameters; often these parameters show variability across animals and thus justify the approach. Models of small neuronal networks will continue to expand and refine our understanding of how neuronal networks in all animals program motor output, process sensory information and learn. Copyright © 2012 Elsevier Ltd. All rights reserved.
Stochastic Online Learning in Dynamic Networks under Unknown Models
2016-08-02
Stochastic Online Learning in Dynamic Networks under Unknown Models This research aims to develop fundamental theories and practical algorithms for...12211 Research Triangle Park, NC 27709-2211 Online learning , multi-armed bandit, dynamic networks REPORT DOCUMENTATION PAGE 11. SPONSOR/MONITOR’S... Online Learning in Dynamic Networks under Unknown Models Report Title This research aims to develop fundamental theories and practical algorithms for
A Cellular Automata Models of Evolution of Transportation Networks
Directory of Open Access Journals (Sweden)
Mariusz Paszkowski
2002-01-01
Full Text Available We present a new approach to modelling of transportation networks. Supply of resources and their influence on the evolution of the consuming environment is a princqral problem considered. ne present two concepts, which are based on cellular automata paradigm. In the first model SCAM4N (Simple Cellular Automata Model of Anastomosing Network, the system is represented by a 2D mesh of elementary cells. The rules of interaction between them are introduced for modelling ofthe water flow and other phenomena connected with anastomosing river: Due to limitations of SCAMAN model, we introduce a supplementary model. The MANGraCA (Model of Anastomosing Network with Graph of Cellular Automata model beside the classical mesh of automata, introduces an additional structure: the graph of cellular automata, which represents the network pattern. Finally we discuss the prospective applications ofthe models. The concepts of juture implementation are also presented.
Runoff Modelling in Urban Storm Drainage by Neural Networks
DEFF Research Database (Denmark)
Rasmussen, Michael R.; Brorsen, Michael; Schaarup-Jensen, Kjeld
1995-01-01
A neural network is used to simulate folw and water levels in a sewer system. The calibration of th neural network is based on a few measured events and the network is validated against measureed events as well as flow simulated with the MOUSE model (Lindberg and Joergensen, 1986). The neural...... network is used to compute flow or water level at selected points in the sewer system, and to forecast the flow from a small residential area. The main advantages of the neural network are the build-in self calibration procedure and high speed performance, but the neural network cannot be used to extract...... knowledge of the runoff process. The neural network was found to simulate 150 times faster than e.g. the MOUSE model....
Lai, Qiang; Zhao, Xiao-Wen; Rajagopal, Karthikeyan; Xu, Guanghui; Akgul, Akif; Guleryuz, Emre
2018-01-01
This paper considers the generation of multi-butterfly chaotic attractors from a generalised Sprott C system with multiple non-hyperbolic equilibria. The system is constructed by introducing an additional variable whose derivative has a switching function to the Sprott C system. It is numerically found that the system creates two-, three-, four-, five-butterfly attractors and any other multi-butterfly attractors. First, the dynamic analyses of multi-butterfly chaotic attractors are presented. Secondly, the field programmable gate array implementation, electronic circuit realisation and random number generator are done with the multi-butterfly chaotic attractors.
Castet, Jean-Francois; Saleh, Joseph H
2013-01-01
This article develops a novel approach and algorithmic tools for the modeling and survivability analysis of networks with heterogeneous nodes, and examines their application to space-based networks. Space-based networks (SBNs) allow the sharing of spacecraft on-orbit resources, such as data storage, processing, and downlink. Each spacecraft in the network can have different subsystem composition and functionality, thus resulting in node heterogeneity. Most traditional survivability analyses of networks assume node homogeneity and as a result, are not suited for the analysis of SBNs. This work proposes that heterogeneous networks can be modeled as interdependent multi-layer networks, which enables their survivability analysis. The multi-layer aspect captures the breakdown of the network according to common functionalities across the different nodes, and it allows the emergence of homogeneous sub-networks, while the interdependency aspect constrains the network to capture the physical characteristics of each node. Definitions of primitives of failure propagation are devised. Formal characterization of interdependent multi-layer networks, as well as algorithmic tools for the analysis of failure propagation across the network are developed and illustrated with space applications. The SBN applications considered consist of several networked spacecraft that can tap into each other's Command and Data Handling subsystem, in case of failure of its own, including the Telemetry, Tracking and Command, the Control Processor, and the Data Handling sub-subsystems. Various design insights are derived and discussed, and the capability to perform trade-space analysis with the proposed approach for various network characteristics is indicated. The select results here shown quantify the incremental survivability gains (with respect to a particular class of threats) of the SBN over the traditional monolith spacecraft. Failure of the connectivity between nodes is also examined, and the
Directory of Open Access Journals (Sweden)
Jean-Francois Castet
Full Text Available This article develops a novel approach and algorithmic tools for the modeling and survivability analysis of networks with heterogeneous nodes, and examines their application to space-based networks. Space-based networks (SBNs allow the sharing of spacecraft on-orbit resources, such as data storage, processing, and downlink. Each spacecraft in the network can have different subsystem composition and functionality, thus resulting in node heterogeneity. Most traditional survivability analyses of networks assume node homogeneity and as a result, are not suited for the analysis of SBNs. This work proposes that heterogeneous networks can be modeled as interdependent multi-layer networks, which enables their survivability analysis. The multi-layer aspect captures the breakdown of the network according to common functionalities across the different nodes, and it allows the emergence of homogeneous sub-networks, while the interdependency aspect constrains the network to capture the physical characteristics of each node. Definitions of primitives of failure propagation are devised. Formal characterization of interdependent multi-layer networks, as well as algorithmic tools for the analysis of failure propagation across the network are developed and illustrated with space applications. The SBN applications considered consist of several networked spacecraft that can tap into each other's Command and Data Handling subsystem, in case of failure of its own, including the Telemetry, Tracking and Command, the Control Processor, and the Data Handling sub-subsystems. Various design insights are derived and discussed, and the capability to perform trade-space analysis with the proposed approach for various network characteristics is indicated. The select results here shown quantify the incremental survivability gains (with respect to a particular class of threats of the SBN over the traditional monolith spacecraft. Failure of the connectivity between nodes is also
Artificial Neural Network Modeling of an Inverse Fluidized Bed ...
African Journals Online (AJOL)
MICHAEL
modeling of the inverse fluidized bed reactor. In the proposed model, the trained neural network represents the kinetics of biological decomposition of pollutants in the reactor. The neural network has been trained with experimental data obtained from an inverse fluidized bed reactor treating the starch industry wastewater.
A control model for district heating networks with storage
Scholten, Tjeert; De Persis, Claudio; Tesi, Pietro
2014-01-01
In [1] pressure control of hydraulic networks is investigated. We extend this work to district heating systems with storage capabilities and derive a model taking the topology of the network into account. The goal for the derived model is that it should allow for control of the storage level and
A small-world network model of facial emotion recognition.
Takehara, Takuma; Ochiai, Fumio; Suzuki, Naoto
2016-01-01
Various models have been proposed to increase understanding of the cognitive basis of facial emotions. Despite those efforts, interactions between facial emotions have received minimal attention. If collective behaviours relating to each facial emotion in the comprehensive cognitive system could be assumed, specific facial emotion relationship patterns might emerge. In this study, we demonstrate that the frameworks of complex networks can effectively capture those patterns. We generate 81 facial emotion images (6 prototypes and 75 morphs) and then ask participants to rate degrees of similarity in 3240 facial emotion pairs in a paired comparison task. A facial emotion network constructed on the basis of similarity clearly forms a small-world network, which features an extremely short average network distance and close connectivity. Further, even if two facial emotions have opposing valences, they are connected within only two steps. In addition, we show that intermediary morphs are crucial for maintaining full network integration, whereas prototypes are not at all important. These results suggest the existence of collective behaviours in the cognitive systems of facial emotions and also describe why people can efficiently recognize facial emotions in terms of information transmission and propagation. For comparison, we construct three simulated networks--one based on the categorical model, one based on the dimensional model, and one random network. The results reveal that small-world connectivity in facial emotion networks is apparently different from those networks, suggesting that a small-world network is the most suitable model for capturing the cognitive basis of facial emotions.
Systems and methods for modeling and analyzing networks
Hill, Colin C; Church, Bruce W; McDonagh, Paul D; Khalil, Iya G; Neyarapally, Thomas A; Pitluk, Zachary W
2013-10-29
The systems and methods described herein utilize a probabilistic modeling framework for reverse engineering an ensemble of causal models, from data and then forward simulating the ensemble of models to analyze and predict the behavior of the network. In certain embodiments, the systems and methods described herein include data-driven techniques for developing causal models for biological networks. Causal network models include computational representations of the causal relationships between independent variables such as a compound of interest and dependent variables such as measured DNA alterations, changes in mRNA, protein, and metabolites to phenotypic readouts of efficacy and toxicity.
Ocean wave prediction using numerical and neural network models
Digital Repository Service at National Institute of Oceanography (India)
Mandal, S.; Prabaharan, N.
This paper presents an overview of the development of the numerical wave prediction models and recently used neural networks for ocean wave hindcasting and forecasting. The numerical wave models express the physical concepts of the phenomena...
An information spreading model based on online social networks
Wang, Tao; He, Juanjuan; Wang, Xiaoxia
2018-01-01
Online social platforms are very popular in recent years. In addition to spreading information, users could review or collect information on online social platforms. According to the information spreading rules of online social network, a new information spreading model, namely IRCSS model, is proposed in this paper. It includes sharing mechanism, reviewing mechanism, collecting mechanism and stifling mechanism. Mean-field equations are derived to describe the dynamics of the IRCSS model. Moreover, the steady states of reviewers, collectors and stiflers and the effects of parameters on the peak values of reviewers, collectors and sharers are analyzed. Finally, numerical simulations are performed on different networks. Results show that collecting mechanism and reviewing mechanism, as well as the connectivity of the network, make information travel wider and faster, and compared to WS network and ER network, the speed of reviewing, sharing and collecting information is fastest on BA network.
A Mathematical Model to Improve the Performance of Logistics Network
Directory of Open Access Journals (Sweden)
Muhammad Izman Herdiansyah
2012-01-01
Full Text Available The role of logistics nowadays is expanding from just providing transportation and warehousing to offering total integrated logistics. To remain competitive in the global market environment, business enterprises need to improve their logistics operations performance. The improvement will be achieved when we can provide a comprehensive analysis and optimize its network performances. In this paper, a mixed integer linier model for optimizing logistics network performance is developed. It provides a single-product multi-period multi-facilities model, as well as the multi-product concept. The problem is modeled in form of a network flow problem with the main objective to minimize total logistics cost. The problem can be solved using commercial linear programming package like CPLEX or LINDO. Even in small case, the solver in Excel may also be used to solve such model.Keywords: logistics network, integrated model, mathematical programming, network optimization
Completely random measures for modelling block-structured sparse networks
DEFF Research Database (Denmark)
Herlau, Tue; Schmidt, Mikkel Nørgaard; Mørup, Morten
2016-01-01
Many statistical methods for network data parameterize the edge-probability by attributing latent traits to the vertices such as block structure and assume exchangeability in the sense of the Aldous-Hoover representation theorem. Empirical studies of networks indicate that many real-world networks...... [2014] proposed the use of a different notion of exchangeability due to Kallenberg [2006] and obtained a network model which admits power-law behaviour while retaining desirable statistical properties, however this model does not capture latent vertex traits such as block-structure. In this work we re......-introduce the use of block-structure for network models obeying allenberg’s notion of exchangeability and thereby obtain a model which admits the inference of block-structure and edge inhomogeneity. We derive a simple expression for the likelihood and an efficient sampling method. The obtained model...
A Network Contention Model for the Extreme-scale Simulator
Energy Technology Data Exchange (ETDEWEB)
Engelmann, Christian [ORNL; Naughton III, Thomas J [ORNL
2015-01-01
The Extreme-scale Simulator (xSim) is a performance investigation toolkit for high-performance computing (HPC) hardware/software co-design. It permits running a HPC application with millions of concurrent execution threads, while observing its performance in a simulated extreme-scale system. This paper details a newly developed network modeling feature for xSim, eliminating the shortcomings of the existing network modeling capabilities. The approach takes a different path for implementing network contention and bandwidth capacity modeling using a less synchronous and accurate enough model design. With the new network modeling feature, xSim is able to simulate on-chip and on-node networks with reasonable accuracy and overheads.
Application Interaction Model for Opportunistic Networking
de Souza Schwartz, Ramon; van Dijk, H.W.; Scholten, Johan
In Opportunistic Networks, autonomous nodes discover, assess and potentially seize opportunities for communication and distributed processing whenever these emerge. In this paper, we consider prerequisites for a successful implementation of such a way of processing in networks that consist mainly of
A Model for Telestrok Network Evaluation
DEFF Research Database (Denmark)
Storm, Anna; Günzel, Franziska; Theiss, Stephan
2011-01-01
Different telestroke network concepts have been implemented worldwide to enable fast and efficient treatment of stroke patients in underserved rural areas. Networks could demonstrate the improvement in clinical outcome, but have so far excluded a cost-effectiveness analysis. With health economic ...
Concentration dependent model of protein-protein interaction networks
Zhang, Jingshan
2007-01-01
The scale free structure p(k)~k^{-gamma} of protein-protein interaction networks can be produced by a static physical model. We find the earlier study of deterministic threshold models with exponential fitness distributions can be generalized to explain the apparent scale free degree distribution of the physical model, and this explanation provides a generic mechanism of "scale free" networks. We predict the dependence of gamma on experimental protein concentrations. The clustering coefficient distribution of the model is also studied.
Model and simulation of Krause model in dynamic open network
Zhu, Meixia; Xie, Guangqiang
2017-08-01
The construction of the concept of evolution is an effective way to reveal the formation of group consensus. This study is based on the modeling paradigm of the HK model (Hegsekmann-Krause). This paper analyzes the evolution of multi - agent opinion in dynamic open networks with member mobility. The results of the simulation show that when the number of agents is constant, the interval distribution of the initial distribution will affect the number of the final view, The greater the distribution of opinions, the more the number of views formed eventually; The trust threshold has a decisive effect on the number of views, and there is a negative correlation between the trust threshold and the number of opinions clusters. The higher the connectivity of the initial activity group, the more easily the subjective opinion in the evolution of opinion to achieve rapid convergence. The more open the network is more conducive to the unity of view, increase and reduce the number of agents will not affect the consistency of the group effect, but not conducive to stability.
A new parameter in attractor single-field inflation
Directory of Open Access Journals (Sweden)
Jinn-Ouk Gong
2015-07-01
Full Text Available We revisit the notion of slow-roll in the context of general single-field inflation. As a generalization of slow-roll dynamics, we consider an inflaton ϕ in an attractor phase where the time derivative of ϕ is determined by a function of ϕ, ϕ˙=ϕ˙(ϕ. In other words, we consider the case when the number of e-folds N counted backward in time from the end of inflation is solely a function of ϕ, N=N(ϕ. In this case, it is found that we need a new independent parameter to properly describe the dynamics of the inflaton field in general, in addition to the standard parameters conventionally denoted by ϵ, η, cs2 and s. Two illustrative examples are presented to discuss the non-slow-roll dynamics of the inflaton field consistent with observations.
Flow version of statistical neurodynamics for oscillator neural networks
Uchiyama, Satoki
2012-04-01
We consider a neural network of Stuart-Landau oscillators as an associative memory. This oscillator network with N elements is a system of an N-dimensional differential equation, works as an attractor neural network, and is expected to have no Lyapunov functions. Therefore, the technique of equilibrium statistical physics is not applicable to the study of this system in the thermodynamic limit. However, the simplicity of this system allows us to extend statistical neurodynamics [S. Amari, K. Maginu, Neural Netw. 1 (1988) 63-73], which was originally developed to analyse the discrete time evolution of the Hopfield model, into the version for continuous time evolution. We have developed and attempted to apply this method in the analysis of the phase transition of our model network.
Rumor spreading model with noise interference in complex social networks
Zhu, Liang; Wang, Youguo
2017-03-01
In this paper, a modified susceptible-infected-removed (SIR) model has been proposed to explore rumor diffusion on complex social networks. We take variation of connectivity into consideration and assume the variation as noise. On the basis of related literature on virus networks, the noise is described as standard Brownian motion while stochastic differential equations (SDE) have been derived to characterize dynamics of rumor diffusion both on homogeneous networks and heterogeneous networks. Then, theoretical analysis on homogeneous networks has been demonstrated to investigate the solution of SDE model and the steady state of rumor diffusion. Simulations both on Barabási-Albert (BA) network and Watts-Strogatz (WS) network display that the addition of noise accelerates rumor diffusion and expands diffusion size, meanwhile, the spreading speed on BA network is much faster than on WS network under the same noise intensity. In addition, there exists a rumor diffusion threshold in statistical average meaning on homogeneous network which is absent on heterogeneous network. Finally, we find a positive correlation between peak value of infected individuals and noise intensity while a negative correlation between rumor lifecycle and noise intensity overall.
Hydrometeorological network for flood monitoring and modeling
Efstratiadis, Andreas; Koussis, Antonis D.; Lykoudis, Spyros; Koukouvinos, Antonis; Christofides, Antonis; Karavokiros, George; Kappos, Nikos; Mamassis, Nikos; Koutsoyiannis, Demetris
2013-08-01
Due to its highly fragmented geomorphology, Greece comprises hundreds of small- to medium-size hydrological basins, in which often the terrain is fairly steep and the streamflow regime ephemeral. These are typically affected by flash floods, occasionally causing severe damages. Yet, the vast majority of them lack flow-gauging infrastructure providing systematic hydrometric data at fine time scales. This has obvious impacts on the quality and reliability of flood studies, which typically use simplistic approaches for ungauged basins that do not consider local peculiarities in sufficient detail. In order to provide a consistent framework for flood design and to ensure realistic predictions of the flood risk -a key issue of the 2007/60/EC Directive- it is essential to improve the monitoring infrastructures by taking advantage of modern technologies for remote control and data management. In this context and in the research project DEUCALION, we have recently installed and are operating, in four pilot river basins, a telemetry-based hydro-meteorological network that comprises automatic stations and is linked to and supported by relevant software. The hydrometric stations measure stage, using 50-kHz ultrasonic pulses or piezometric sensors, or both stage (piezometric) and velocity via acoustic Doppler radar; all measurements are being temperature-corrected. The meteorological stations record air temperature, pressure, relative humidity, wind speed and direction, and precipitation. Data transfer is made via GPRS or mobile telephony modems. The monitoring network is supported by a web-based application for storage, visualization and management of geographical and hydro-meteorological data (ENHYDRIS), a software tool for data analysis and processing (HYDROGNOMON), as well as an advanced model for flood simulation (HYDROGEIOS). The recorded hydro-meteorological observations are accessible over the Internet through the www-application. The system is operational and its
A computational model of hemodynamic parameters in cortical capillary networks.
Safaeian, Navid; Sellier, Mathieu; David, Tim
2011-02-21
The analysis of hemodynamic parameters and functional reactivity of cerebral capillaries is still controversial. To assess the hemodynamic parameters in the cortical capillary network, a generic model was created using 2D voronoi tessellation in which each edge represents a capillary segment. This method is capable of creating an appropriate generic model of cerebral capillary network relating to each part of the brain cortex because the geometric model is able to vary the capillary density. The modeling presented here is based on morphometric parameters extracted from physiological data of the human cortex. The pertinent hemodynamic parameters were obtained by numerical simulation based on effective blood viscosity as a function of hematocrit and microvessel diameter, phase separation and plasma skimming effects. The hemodynamic parameters of capillary networks with two different densities (consistent with the variation of the morphometric data in the human cortical capillary network) were analyzed. The results show pertinent hemodynamic parameters for each model. The heterogeneity (coefficient variation) and the mean value of hematocrits, flow rates and velocities of the both network models were specified. The distributions of blood flow throughout the both models seem to confirm the hypothesis in which all capillaries in a cortical network are recruited at rest (normal condition). The results also demonstrate a discrepancy of the network resistance between two models, which are derived from the difference in the number density of capillary segments between the models. Copyright Â© 2010 Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
Jairo A Díaz
Full Text Available In a previous research, we have described and documented self-assembly of geometric triangular chiral hexagon crystal-like complex organizations (GTCHC in human pathological tissues. This article documents and gathers insights into the magnetic field in cancer tissues and also how it generates an invariant functional geometric attractor constituted for collider partners in their entangled environment. The need to identify this hierarquic attractor was born out of the concern to understand how the vascular net of these complexes are organized, and to determine if the spiral vascular subpatterns observed adjacent to GTCHC complexes and their assembly are interrelational. The study focuses on cancer tissues and all the macroscopic and microscopic material in which GTCHC complexes are identified, which have been overlooked so far, and are rigorously revised. This revision follows the same parameters that were established in the initial phase of the investigation, but with a new item: the visualization and documentation of external dorsal serous vascular bed areas in spatial correlation with the localization of GTCHC complexes inside the tumors. Following the standard of the electro-optical collision model, we were able to reproduce and replicate collider patterns, that is, pairs of left and right hand spin-spiraled subpatterns, associated with the orientation of the spinning process that can be an expansion or contraction disposition of light particles. Agreement between this model and tumor data is surprisingly close; electromagnetic spiral patterns generated were identical at the spiral vascular arrangement in connection with GTCHC complexes in malignant tumors. These findings suggest that the framework of collagen type 1 - vasoactive vessels that structure geometric attractors in cancer tissues with invariant morphology sets generate collider partners in their magnetic domain with opposite biological behavior. If these principles are incorporated
How organisms do the right thing: The attractor hypothesis
Emlen, J.M.; Freeman, D.C.; Mills, A.; Graham, J.H.
1998-01-01
Neo-Darwinian theory is highly successful at explaining the emergence of adaptive traits over successive generations. However, there are reasons to doubt its efficacy in explaining the observed, impressively detailed adaptive responses of organisms to day-to-day changes in their surroundings. Also, the theory lacks a clear mechanism to account for both plasticity and canalization. In effect, there is a growing sentiment that the neo-Darwinian paradigm is incomplete, that something more than genetic structure, mutation, genetic drift, and the action of natural selection is required to explain organismal behavior. In this paper we extend the view of organisms as complex self-organizing entities by arguing that basic physical laws, coupled with the acquisitive nature of organisms, makes adaptation all but tautological. That is, much adaptation is an unavoidable emergent property of organisms' complexity and, to some a significant degree, occurs quite independently of genomic changes wrought by natural selection. For reasons that will become obvious, we refer to this assertion as the attractor hypothesis. The arguments also clarify the concept of "adaptation." Adaptation across generations, by natural selection, equates to the (game theoretic) maximization of fitness (the success with which one individual produces more individuals), while self-organizing based adaptation, within generations, equates to energetic efficiency and the matching of intake and biosynthesis to need. Finally, we discuss implications of the attractor hypothesis for a wide variety of genetical and physiological phenomena, including genetic architecture, directed mutation, genetic imprinting, paramutation, hormesis, plasticity, optimality theory, genotype-phenotype linkage and puncuated equilibrium, and present suggestions for tests of the hypothesis. ?? 1998 American Institute of Physics.
Generation of a New Three Dimension Autonomous Chaotic Attractor and its Four Wing Type
Directory of Open Access Journals (Sweden)
F. Yu
2013-02-01
Full Text Available n this paper, a new three-dimension (3D autonomous chaotic system with a nonlinear term in the form of a hyperbolic sine (or cosine function is reported. Some interesting and complex attractors are obtained. Basic dynamical properties of the new chaotic system are demonstrated in terms of Lyapunov exponents, Poincare mapping, fractal dimension and continuous spectrum. Meanwhile, for further enhancing the complexity of the topological structure of the new chaotic attractors, the attractors are changed from two-wing to four-wing through making axis doubly polarized, theoretically analyzed and numerically simulated. The obtained results clearly show that the chaotic system deserves further detailed investigation.
A modelling and reasoning framework for social networks policies
Governatori, Guido; Iannella, Renato
2011-02-01
Policy languages (such as privacy and rights) have had little impact on the wider community. Now that social networks have taken off, the need to revisit policy languages and realign them towards social networks requirements has become more apparent. One such language is explored as to its applicability to the social networks masses. We also argue that policy languages alone are not sufficient and thus they should be paired with reasoning mechanisms to provide precise and unambiguous execution models of the policies. To this end, we propose a computationally oriented model to represent, reason with and execute policies for social networks.
Constitutive Modelling of INCONEL 718 using Artificial Neural Network
Abiriand Bhekisipho Twala, Olufunminiyi
2017-08-01
Artificial neural network is used to model INCONEL 718 in this paper. The model accounts for precipitate hardening in the alloy. The input variables for the neural network model are strain, strain rate, temperature and microstructure state. The output variable is the flow stress. The early stopping technique is combined with Bayesian regularization process in training the network. Sample and non-sample measurement data were taken from the literature. The model predictions of flow stress of the alloy are in good agreement with experimental measurements.
Modeling Temporal Evolution and Multiscale Structure in Networks
DEFF Research Database (Denmark)
Herlau, Tue; Mørup, Morten; Schmidt, Mikkel Nørgaard
2013-01-01
-point model to account for the temporal evolution of each vertex. We demonstrate that our model is able to infer time-varying multiscale structure in synthetic as well as three real world time-evolving complex networks. Our modeling of the temporal evolution of hierarchies brings new insights......Many real-world networks exhibit both temporal evolution and multiscale structure. We propose a model for temporally correlated multifurcating hierarchies in complex networks which jointly capture both effects. We use the Gibbs fragmentation tree as prior over multifurcating trees and a change...
Gallagher, H. Colin; Robins, Garry
2015-01-01
As part of the shift within second language acquisition (SLA) research toward complex systems thinking, researchers have called for investigations of social network structure. One strand of social network analysis yet to receive attention in SLA is network statistical models, whereby networks are explained in terms of smaller substructures of…
Modeling the propagation of mobile malware on complex networks
Liu, Wanping; Liu, Chao; Yang, Zheng; Liu, Xiaoyang; Zhang, Yihao; Wei, Zuxue
2016-08-01
In this paper, the spreading behavior of malware across mobile devices is addressed. By introducing complex networks to model mobile networks, which follows the power-law degree distribution, a novel epidemic model for mobile malware propagation is proposed. The spreading threshold that guarantees the dynamics of the model is calculated. Theoretically, the asymptotic stability of the malware-free equilibrium is confirmed when the threshold is below the unity, and the global stability is further proved under some sufficient conditions. The influences of different model parameters as well as the network topology on malware propagation are also analyzed. Our theoretical studies and numerical simulations show that networks with higher heterogeneity conduce to the diffusion of malware, and complex networks with lower power-law exponents benefit malware spreading.
Network Inoculation: Heteroclinics and phase transitions in an epidemic model
Yang, Hui; Gross, Thilo
2016-01-01
In epidemiological modelling, dynamics on networks, and in particular adaptive and heterogeneous networks have recently received much interest. Here we present a detailed analysis of a previously proposed model that combines heterogeneity in the individuals with adaptive rewiring of the network structure in response to a disease. We show that in this model qualitative changes in the dynamics occur in two phase transitions. In a macroscopic description one of these corresponds to a local bifurcation whereas the other one corresponds to a non-local heteroclinic bifurcation. This model thus provides a rare example of a system where a phase transition is caused by a non-local bifurcation, while both micro- and macro-level dynamics are accessible to mathematical analysis. The bifurcation points mark the onset of a behaviour that we call network inoculation. In the respective parameter region exposure of the system to a pathogen will lead to an outbreak that collapses, but leaves the network in a configuration wher...
Random field Ising model and community structure in complex networks
Son, S.-W.; Jeong, H.; Noh, J. D.
2006-04-01
We propose a method to determine the community structure of a complex network. In this method the ground state problem of a ferromagnetic random field Ising model is considered on the network with the magnetic field Bs = +∞, Bt = -∞, and Bi≠s,t=0 for a node pair s and t. The ground state problem is equivalent to the so-called maximum flow problem, which can be solved exactly numerically with the help of a combinatorial optimization algorithm. The community structure is then identified from the ground state Ising spin domains for all pairs of s and t. Our method provides a criterion for the existence of the community structure, and is applicable equally well to unweighted and weighted networks. We demonstrate the performance of the method by applying it to the Barabási-Albert network, Zachary karate club network, the scientific collaboration network, and the stock price correlation network. (Ising, Potts, etc.)
Persistent activity in neural networks with dynamic synapses.
Directory of Open Access Journals (Sweden)
Omri Barak
2007-02-01
Full Text Available Persistent activity states (attractors, observed in several neocortical areas after the removal of a sensory stimulus, are believed to be the neuronal basis of working memory. One of the possible mechanisms that can underlie persistent activity is recurrent excitation mediated by intracortical synaptic connections. A recent experimental study revealed that connections between pyramidal cells in prefrontal cortex exhibit various degrees of synaptic depression and facilitation. Here we analyze the effect of synaptic dynamics on the emergence and persistence of attractor states in interconnected neural networks. We show that different combinations of synaptic depression and facilitation result in qualitatively different network dynamics with respect to the emergence of the attractor states. This analysis raises the possibility that the framework of attractor neural networks can be extended to represent time-dependent stimuli.
Dynamical complexity in the perception-based network formation model
Jo, Hang-Hyun; Moon, Eunyoung
2016-12-01
Many link formation mechanisms for the evolution of social networks have been successful to reproduce various empirical findings in social networks. However, they have largely ignored the fact that individuals make decisions on whether to create links to other individuals based on cost and benefit of linking, and the fact that individuals may use perception of the network in their decision making. In this paper, we study the evolution of social networks in terms of perception-based strategic link formation. Here each individual has her own perception of the actual network, and uses it to decide whether to create a link to another individual. An individual with the least perception accuracy can benefit from updating her perception using that of the most accurate individual via a new link. This benefit is compared to the cost of linking in decision making. Once a new link is created, it affects the accuracies of other individuals' perceptions, leading to a further evolution of the actual network. As for initial actual networks, we consider both homogeneous and heterogeneous cases. The homogeneous initial actual network is modeled by Erdős-Rényi (ER) random networks, while we take a star network for the heterogeneous case. In any cases, individual perceptions of the actual network are modeled by ER random networks with controllable linking probability. Then the stable link density of the actual network is found to show discontinuous transitions or jumps according to the cost of linking. As the number of jumps is the consequence of the dynamical complexity, we discuss the effect of initial conditions on the number of jumps to find that the dynamical complexity strongly depends on how much individuals initially overestimate or underestimate the link density of the actual network. For the heterogeneous case, the role of the highly connected individual as an information spreader is also discussed.
Huisman, Tijs; Boucherie, Richardus J.; van Dijk, N.M.
2002-01-01
The performance of new railway networks cannot be measured or simulated, as no detailed train schedules are available. Railway infrastructure and capacities are to be determined long before the actual traffic is known. This paper therefore proposes a solvable queueing network model to compute
Stochastic modelling and control of communication networks
Zuraniewski, P.W.
2011-01-01
The unprecedented growth of the Information Technologies sector observed within the past years creates an excellent opportunity to conduct new, exciting and interdisciplinary research. Increasing complexity of the communication networks calls for incorporating rigorously developed and reliable
Analysis and Comparison of Typical Models within Distribution Network Design
DEFF Research Database (Denmark)
Jørgensen, Hans Jacob; Larsen, Allan; Madsen, Oli B.G.
This paper investigates the characteristics of typical optimisation models within Distribution Network Design. During the paper fourteen models known from the literature will be thoroughly analysed. Through this analysis a schematic approach to categorisation of distribution network design models...... for educational purposes. Furthermore, the paper can be seen as a practical introduction to network design modelling as well as a being an art manual or recipe when constructing such a model....... are covered in the categorisation include fixed vs. general networks, specialised vs. general nodes, linear vs. nonlinear costs, single vs. multi commodity, uncapacitated vs. capacitated activities, single vs. multi modal and static vs. dynamic. The models examined address both strategic and tactical planning...