Attractors in complex networks
Rodrigues, Alexandre A. P.
2017-10-01
In the framework of the generalized Lotka-Volterra model, solutions representing multispecies sequential competition can be predictable with high probability. In this paper, we show that it occurs because the corresponding "heteroclinic channel" forms part of an attractor. We prove that, generically, in an attracting heteroclinic network involving a finite number of hyperbolic and non-resonant saddle-equilibria whose linearization has only real eigenvalues, the connections corresponding to the most positive expanding eigenvalues form part of an attractor (observable in numerical simulations).
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.
Accurate path integration in continuous attractor network models of grid cells.
Burak, Yoram; Fiete, Ila R
2009-02-01
Grid cells in the rat entorhinal cortex display strikingly regular firing responses to the animal's position in 2-D space and have been hypothesized to form the neural substrate for dead-reckoning. However, errors accumulate rapidly when velocity inputs are integrated in existing models of grid cell activity. To produce grid-cell-like responses, these models would require frequent resets triggered by external sensory cues. Such inadequacies, shared by various models, cast doubt on the dead-reckoning potential of the grid cell system. Here we focus on the question of accurate path integration, specifically in continuous attractor models of grid cell activity. We show, in contrast to previous models, that continuous attractor models can generate regular triangular grid responses, based on inputs that encode only the rat's velocity and heading direction. We consider the role of the network boundary in the integration performance of the network and show that both periodic and aperiodic networks are capable of accurate path integration, despite important differences in their attractor manifolds. We quantify the rate at which errors in the velocity integration accumulate as a function of network size and intrinsic noise within the network. With a plausible range of parameters and the inclusion of spike variability, our model networks can accurately integrate velocity inputs over a maximum of approximately 10-100 meters and approximately 1-10 minutes. These findings form a proof-of-concept that continuous attractor dynamics may underlie velocity integration in the dorsolateral medial entorhinal cortex. The simulations also generate pertinent upper bounds on the accuracy of integration that may be achieved by continuous attractor dynamics in the grid cell network. We suggest experiments to test the continuous attractor model and differentiate it from models in which single cells establish their responses independently of each other.
Statistical mechanics of attractor neural network models with synaptic depression
International Nuclear Information System (INIS)
Igarashi, Yasuhiko; Oizumi, Masafumi; Otsubo, Yosuke; Nagata, Kenji; Okada, Masato
2009-01-01
Synaptic depression is known to control gain for presynaptic inputs. Since cortical neurons receive thousands of presynaptic inputs, and their outputs are fed into thousands of other neurons, the synaptic depression should influence macroscopic properties of neural networks. We employ simple neural network models to explore the macroscopic effects of synaptic depression. Systems with the synaptic depression cannot be analyzed due to asymmetry of connections with the conventional equilibrium statistical-mechanical approach. Thus, we first propose a microscopic dynamical mean field theory. Next, we derive macroscopic steady state equations and discuss the stabilities of steady states for various types of neural network models.
Benusková, L; Estok, S
1998-11-01
We propose an attractor neural network (ANN) model that performs rotation-invariant pattern recognition in such a way that it can account for a neural mechanism being involved in the image transformation accompanying the experience of mental rotation. We compared the performance of our ANN model with the results of the chronometric psychophysical experiments of Cooper and Shepard (Cooper L A and Shepard R N 1973 Visual Information Processing (New York: Academic) pp 204-7) on discrimination of alphanumeric characters presented in various angular departures from their canonical upright position. Comparing the times required for pattern retrieval in its canonical upright position with the reaction times of human subjects, we found agreement in that (i) retrieval times for clockwise and anticlockwise departures of the same angular magnitude (up to 180 degrees) were not different, (ii) retrieval times increased with departure from upright and (iii) increased more sharply as departure from upright approached 180 degrees. The rotation-invariant retrieval of the activity pattern has been accomplished by means of the modified algorithm of Dotsenko (Dotsenko V S 1988 J. Phys. A: Math. Gen. 21 L783-7) proposed for translation-, rotation- and size-invariant pattern recognition, which uses relaxation of neuronal firing thresholds to guide the evolution of the ANN in state space towards the desired memory attractor. The dynamics of neuronal relaxation has been modified for storage and retrieval of low-activity patterns and the original gradient optimization of threshold dynamics has been replaced with optimization by simulated annealing.
Finite connectivity attractor neural networks
International Nuclear Information System (INIS)
Wemmenhove, B; Coolen, A C C
2003-01-01
We study a family of diluted attractor neural networks with a finite average number of (symmetric) connections per neuron. As in finite connectivity spin glasses, their equilibrium properties are described by order parameter functions, for which we derive an integral equation in replica symmetric approximation. A bifurcation analysis of this equation reveals the locations of the paramagnetic to recall and paramagnetic to spin-glass transition lines in the phase diagram. The line separating the retrieval phase from the spin-glass phase is calculated at zero temperature. All phase transitions are found to be continuous
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.
Khodabakhshi, Mohammad Bagher; Moradi, Mohammad Hassan
2017-05-01
The respiratory system dynamic is of high significance when it comes to the detection of lung abnormalities, which highlights the importance of presenting a reliable model for it. In this paper, we introduce a novel dynamic modelling method for the characterization of the lung sounds (LS), based on the attractor recurrent neural network (ARNN). The ARNN structure allows the development of an effective LS model. Additionally, it has the capability to reproduce the distinctive features of the lung sounds using its formed attractors. Furthermore, a novel ARNN topology based on fuzzy functions (FFs-ARNN) is developed. Given the utility of the recurrent quantification analysis (RQA) as a tool to assess the nature of complex systems, it was used to evaluate the performance of both the ARNN and the FFs-ARNN models. The experimental results demonstrate the effectiveness of the proposed approaches for multichannel LS analysis. In particular, a classification accuracy of 91% was achieved using FFs-ARNN with sequences of RQA features. Copyright © 2017 Elsevier Ltd. All rights reserved.
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.
Modelling and prediction for chaotic fir laser attractor using rational function neural network.
Cho, S
2001-02-01
Many real-world systems such as irregular ECG signal, volatility of currency exchange rate and heated fluid reaction exhibit highly complex nonlinear characteristic known as chaos. These chaotic systems cannot be retreated satisfactorily using linear system theory due to its high dimensionality and irregularity. This research focuses on prediction and modelling of chaotic FIR (Far InfraRed) laser system for which the underlying equations are not given. This paper proposed a method for prediction and modelling a chaotic FIR laser time series using rational function neural network. Three network architectures, TDNN (Time Delayed Neural Network), RBF (radial basis function) network and the RF (rational function) network, are also presented. Comparisons between these networks performance show the improvements introduced by the RF network in terms of a decrement in network complexity and better ability of predictability.
Neiman, Tal; Loewenstein, Yonatan
2013-01-23
In free operant experiments, subjects alternate at will between targets that yield rewards stochastically. Behavior in these experiments is typically characterized by (1) an exponential distribution of stay durations, (2) matching of the relative time spent at a target to its relative share of the total number of rewards, and (3) adaptation after a change in the reward rates that can be very fast. The neural mechanism underlying these regularities is largely unknown. Moreover, current decision-making neural network models typically aim at explaining behavior in discrete-time experiments in which a single decision is made once in every trial, making these models hard to extend to the more natural case of free operant decisions. Here we show that a model based on attractor dynamics, in which transitions are induced by noise and preference is formed via covariance-based synaptic plasticity, can account for the characteristics of behavior in free operant experiments. We compare a specific instance of such a model, in which two recurrently excited populations of neurons compete for higher activity, to the behavior of rats responding on two levers for rewarding brain stimulation on a concurrent variable interval reward schedule (Gallistel et al., 2001). We show that the model is consistent with the rats' behavior, and in particular, with the observed fast adaptation to matching behavior. Further, we show that the neural model can be reduced to a behavioral model, and we use this model to deduce a novel "conservation law," which is consistent with the behavior of the rats.
Reconstruction of the El Nino attractor with neural networks
International Nuclear Information System (INIS)
Grieger, B.; Latif, M.
1993-01-01
Based on a combined data set of sea surface temperature, zonal surface wind stress and upper ocean heat content the dynamics of the El Nino phenomenon is investigated. In a reduced phase space spanned by the first four EOFs two different stochastic models are estimated from the data. A nonlinear model represented by a simulated neural network is compared with a linear model obtained with the Principal Oscillation Pattern (POP) analysis. While the linear model is limited to damped oscillations onto a fix point attractor, the nonlinear model recovers a limit cycle attractor. This indicates that the real system is located above the bifurcation point in parameter space supporting self-sustained oscillations. The results are discussed with respect to consistency with current theory. (orig.)
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.
Reactivation in working memory: an attractor network model of free recall.
Directory of Open Access Journals (Sweden)
Anders Lansner
Full Text Available 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.
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
Dynamics of neural networks with continuous attractors
Fung, C. C. Alan; Wong, K. Y. Michael; Wu, Si
2008-10-01
We investigate the dynamics of continuous attractor neural networks (CANNs). Due to the translational invariance of their neuronal interactions, CANNs can hold a continuous family of stationary states. We systematically explore how their neutral stability facilitates the tracking performance of a CANN, which is believed to have wide applications in brain functions. We develop a perturbative approach that utilizes the dominant movement of the network stationary states in the state space. We quantify the distortions of the bump shape during tracking, and study their effects on the tracking performance. Results are obtained on the maximum speed for a moving stimulus to be trackable, and the reaction time to catch up an abrupt change in stimulus.
Attractor neural networks with resource-efficient synaptic connectivity
Pehlevan, Cengiz; Sengupta, Anirvan
Memories are thought to be stored in the attractor states of recurrent neural networks. Here we explore how resource constraints interplay with memory storage function to shape synaptic connectivity of attractor networks. We propose that given a set of memories, in the form of population activity patterns, the neural circuit choses a synaptic connectivity configuration that minimizes a resource usage cost. We argue that the total synaptic weight (l1-norm) in the network measures the resource cost because synaptic weight is correlated with synaptic volume, which is a limited resource, and is proportional to neurotransmitter release and post-synaptic current, both of which cost energy. Using numerical simulations and replica theory, we characterize optimal connectivity profiles in resource-efficient attractor networks. Our theory explains several experimental observations on cortical connectivity profiles, 1) connectivity is sparse, because synapses are costly, 2) bidirectional connections are overrepresented and 3) are stronger, because attractor states need strong recurrence.
Attractor controllability of Boolean networks by flipping a subset of their nodes
Rafimanzelat, Mohammad Reza; Bahrami, Fariba
2018-04-01
The controllability analysis of Boolean networks (BNs), as models of biomolecular regulatory networks, has drawn the attention of researchers in recent years. In this paper, we aim at governing the steady-state behavior of BNs using an intervention method which can easily be applied to most real system, which can be modeled as BNs, particularly to biomolecular regulatory networks. To this end, we introduce the concept of attractor controllability of a BN by flipping a subset of its nodes, as the possibility of making a BN converge from any of its attractors to any other one, by one-time flipping members of a subset of BN nodes. Our approach is based on the algebraic state-space representation of BNs using semi-tensor product of matrices. After introducing some new matrix tools, we use them to derive necessary and sufficient conditions for the attractor controllability of BNs. A forward search algorithm is then suggested to identify the minimal perturbation set for attractor controllability of a BN. Next, a lower bound is derived for the cardinality of this set. Two new indices are also proposed for quantifying the attractor controllability of a BN and the influence of each network variable on the attractor controllability of the network and the relationship between them is revealed. Finally, we confirm the efficiency of the proposed approach by applying it to the BN models of some real biomolecular networks.
Sun, Mengyang; Cheng, Xianrui; Socolar, Joshua E S
2013-06-01
A common approach to the modeling of gene regulatory networks is to represent activating or repressing interactions using ordinary differential equations for target gene concentrations that include Hill function dependences on regulator gene concentrations. An alternative formulation represents the same interactions using Boolean logic with time delays associated with each network link. We consider the attractors that emerge from the two types of models in the case of a simple but nontrivial network: a figure-8 network with one positive and one negative feedback loop. We show that the different modeling approaches give rise to the same qualitative set of attractors with the exception of a possible fixed point in the ordinary differential equation model in which concentrations sit at intermediate values. The properties of the attractors are most easily understood from the Boolean perspective, suggesting that time-delay Boolean modeling is a useful tool for understanding the logic of regulatory networks.
Roach, James; Sander, Leonard; Zochowski, Michal
Auto-associative memory is the ability to retrieve a pattern from a small fraction of the pattern and is an important function of neural networks. Within this context, memories that are stored within the synaptic strengths of networks act as dynamical attractors for network firing patterns. In networks with many encoded memories, some attractors will be stronger than others. This presents the problem of how networks switch between attractors depending on the situation. We suggest that regulation of neuronal spike-frequency adaptation (SFA) provides a universal mechanism for network-wide attractor selectivity. Here we demonstrate in a Hopfield type attractor network that neurons minimal SFA will reliably activate in the pattern corresponding to a local attractor and that a moderate increase in SFA leads to the network to converge to the strongest attractor state. Furthermore, we show that on long time scales SFA allows for temporal sequences of activation to emerge. Finally, using a model of cholinergic modulation within the cortex we argue that dynamic regulation of attractor preference by SFA could be critical for the role of acetylcholine in attention or for arousal states in general. This work was supported by: NSF Graduate Research Fellowship Program under Grant No. DGE 1256260 (JPR), NSF CMMI 1029388 (MRZ) and NSF PoLS 1058034 (MRZ & LMS).
Detection of strong attractors in social media networks.
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. The work described here aims to introduce a new approach that characterizes the influence of actors by the strength of attracting new active members into a networked community. We present a model of influence of an actor that is based on the attractiveness of the actor in terms of the number of other new actors with which he or she has established relations over time. We have used this concept and measure of influence to determine optimal seeds in a simulation of influence maximization using two empirically collected social networks for the underlying graphs. Our empirical results on the datasets demonstrate that our measure stands out as a useful measure to define the attractors comparing to the other influence measures.
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…
General method to find the attractors of discrete dynamic models of biological systems
Gan, Xiao; Albert, Réka
2018-04-01
Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.
General method to find the attractors of discrete dynamic models of biological systems.
Gan, Xiao; Albert, Réka
2018-04-01
Analyzing the long-term behaviors (attractors) of dynamic models of biological networks can provide valuable insight. We propose a general method that can find the attractors of multilevel discrete dynamical systems by extending a method that finds the attractors of a Boolean network model. The previous method is based on finding stable motifs, subgraphs whose nodes' states can stabilize on their own. We extend the framework from binary states to any finite discrete levels by creating a virtual node for each level of a multilevel node, and describing each virtual node with a quasi-Boolean function. We then create an expanded representation of the multilevel network, find multilevel stable motifs and oscillating motifs, and identify attractors by successive network reduction. In this way, we find both fixed point attractors and complex attractors. We implemented an algorithm, which we test and validate on representative synthetic networks and on published multilevel models of biological networks. Despite its primary motivation to analyze biological networks, our motif-based method is general and can be applied to any finite discrete dynamical system.
Hierarchical-control-based output synchronization of coexisting attractor networks
International Nuclear Information System (INIS)
Yun-Zhong, Song; Yi-Fa, Tang
2010-01-01
This paper introduces the concept of hierarchical-control-based output synchronization of coexisting attractor networks. Within the new framework, each dynamic node is made passive at first utilizing intra-control around its own arena. Then each dynamic node is viewed as one agent, and on account of that, the solution of output synchronization of coexisting attractor networks is transformed into a multi-agent consensus problem, which is made possible by virtue of local interaction between individual neighbours; this distributed working way of coordination is coined as inter-control, which is only specified by the topological structure of the network. Provided that the network is connected and balanced, the output synchronization would come true naturally via synergy between intra and inter-control actions, where the Tightness is proved theoretically via convex composite Lyapunov functions. For completeness, several illustrative examples are presented to further elucidate the novelty and efficacy of the proposed scheme. (general)
Directory of Open Access Journals (Sweden)
Wensheng Guo
Full Text Available In biological systems, the dynamic analysis method has gained increasing attention in the past decade. The Boolean network is the most common model of a genetic regulatory network. The interactions of activation and inhibition in the genetic regulatory network are modeled as a set of functions of the Boolean network, while the state transitions in the Boolean network reflect the dynamic property of a genetic regulatory network. A difficult problem for state transition analysis is the finding of attractors. In this paper, we modeled the genetic regulatory network as a Boolean network and proposed a solving algorithm to tackle the attractor finding problem. In the proposed algorithm, we partitioned the Boolean network into several blocks consisting of the strongly connected components according to their gradients, and defined the connection between blocks as decision node. Based on the solutions calculated on the decision nodes and using a satisfiability solving algorithm, we identified the attractors in the state transition graph of each block. The proposed algorithm is benchmarked on a variety of genetic regulatory networks. Compared with existing algorithms, it achieved similar performance on small test cases, and outperformed it on larger and more complex ones, which happens to be the trend of the modern genetic regulatory network. Furthermore, while the existing satisfiability-based algorithms cannot be parallelized due to their inherent algorithm design, the proposed algorithm exhibits a good scalability on parallel computing architectures.
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.
From Cellular Attractor Selection to Adaptive Signal Control for Traffic Networks.
Tian, Daxin; Zhou, Jianshan; Sheng, Zhengguo; Wang, Yunpeng; Ma, Jianming
2016-03-14
The management of varying traffic flows essentially depends on signal controls at intersections. However, design an optimal control that considers the dynamic nature of a traffic network and coordinates all intersections simultaneously in a centralized manner is computationally challenging. Inspired by the stable gene expressions of Escherichia coli in response to environmental changes, we explore the robustness and adaptability performance of signalized intersections by incorporating a biological mechanism in their control policies, specifically, the evolution of each intersection is induced by the dynamics governing an adaptive attractor selection in cells. We employ a mathematical model to capture such biological attractor selection and derive a generic, adaptive and distributed control algorithm which is capable of dynamically adapting signal operations for the entire dynamical traffic network. We show that the proposed scheme based on attractor selection can not only promote the balance of traffic loads on each link of the network but also allows the global network to accommodate dynamical traffic demands. Our work demonstrates the potential of bio-inspired intelligence emerging from cells and provides a deep understanding of adaptive attractor selection-based control formation that is useful to support the designs of adaptive optimization and control in other domains.
Boolean Factor Analysis by Attractor Neural Network
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.
2007-01-01
Roč. 18, č. 3 (2007), s. 698-707 ISSN 1045-9227 R&D Projects: GA AV ČR 1ET100300419; GA ČR GA201/05/0079 Institutional research plan: CEZ:AV0Z10300504 Keywords : recurrent neural network * Hopfield-like neural network * associative memory * unsupervised learning * neural network architecture * neural network application * statistics * Boolean factor analysis * dimensionality reduction * features clustering * concepts search * information retrieval Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 2.769, year: 2007
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
Detecting small attractors of large Boolean networks by function-reduction-based strategy.
Zheng, Qiben; Shen, Liangzhong; Shang, Xuequn; Liu, Wenbin
2016-04-01
Boolean networks (BNs) are widely used to model gene regulatory networks and to design therapeutic intervention strategies to affect the long-term behaviour of systems. A central aim of Boolean-network analysis is to find attractors that correspond to various cellular states, such as cell types or the stage of cell differentiation. This problem is NP-hard and various algorithms have been used to tackle it with considerable success. The idea is that a singleton attractor corresponds to n consistent subsequences in the truth table. To find these subsequences, the authors gradually reduce the entire truth table of Boolean functions by extending a partial gene activity profile (GAP). Not only does this process delete inconsistent subsequences in truth tables, it also directly determines values for some nodes not extended, which means it can abandon the partial GAPs that cannot lead to an attractor as early as possible. The results of simulation show that the proposed algorithm can detect small attractors with length p = 4 in BNs of up to 200 nodes with average indegree K = 2.
Neural attractor network for application in visual field data classification
International Nuclear Information System (INIS)
Fink, Wolfgang
2004-01-01
The purpose was to introduce a novel method for computer-based classification of visual field data derived from perimetric examination, that may act as a ' counsellor', providing an independent 'second opinion' to the diagnosing physician. The classification system consists of a Hopfield-type neural attractor network that obtains its input data from perimetric examination results. An iterative relaxation process determines the states of the neurons dynamically. Therefore, even 'noisy' perimetric output, e.g., early stages of a disease, may eventually be classified correctly according to the predefined idealized visual field defect (scotoma) patterns, stored as attractors of the network, that are found with diseases of the eye, optic nerve and the central nervous system. Preliminary tests of the classification system on real visual field data derived from perimetric examinations have shown a classification success of over 80%. Some of the main advantages of the Hopfield-attractor-network-based approach over feed-forward type neural networks are: (1) network architecture is defined by the classification problem; (2) no training is required to determine the neural coupling strengths; (3) assignment of an auto-diagnosis confidence level is possible by means of an overlap parameter and the Hamming distance. In conclusion, the novel method for computer-based classification of visual field data, presented here, furnishes a valuable first overview and an independent 'second opinion' in judging perimetric examination results, pointing towards a final diagnosis by a physician. It should not be considered a substitute for the diagnosing physician. Thanks to the worldwide accessibility of the Internet, the classification system offers a promising perspective towards modern computer-assisted diagnosis in both medicine and tele-medicine, for example and in particular, with respect to non-ophthalmic clinics or in communities where perimetric expertise is not readily available
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 faster in computing attractors for empirical experimental systems. Availability The software package is available at https://sites.google.com/site/desheng619/download. PMID:23585840
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...
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.
Robustness of unstable attractors in arbitrarily sized pulse-coupled networks with delay
International Nuclear Information System (INIS)
Broer, Henk; Efstathiou, Konstantinos; Subramanian, Easwar
2008-01-01
We consider arbitrarily large networks of pulse-coupled oscillators with non-zero delay where the coupling is given by the Mirollo–Strogatz function. We prove that such systems have unstable attractors (saddle periodic orbits whose stable set has non-empty interior) in an open parameter region for three or more oscillators. The evolution operator of the system can be discontinuous and we propose an improved model with continuous evolution operator
Bump formation in a binary attractor neural network
International Nuclear Information System (INIS)
Koroutchev, Kostadin; Korutcheva, Elka
2006-01-01
The conditions for the formation of local bumps in the activity of binary attractor neural networks with spatially dependent connectivity are investigated. We show that these formations are observed when asymmetry between the activity during the retrieval and learning is imposed. An analytical approximation for the order parameters is derived. The corresponding phase diagram shows a relatively large and stable region where this effect is observed, although critical storage and information capacities drastically decrease inside that region. We demonstrate that the stability of the network, when starting from the bump formation, is larger than the stability when starting even from the whole pattern. Finally, we show a very good agreement between the analytical results and the simulations performed for different topologies of the network
Topology and computational performance of attractor neural networks
International Nuclear Information System (INIS)
McGraw, Patrick N.; Menzinger, Michael
2003-01-01
To explore the relation between network structure and function, we studied the computational performance of Hopfield-type attractor neural nets with regular lattice, random, small-world, and scale-free topologies. The random configuration is the most efficient for storage and retrieval of patterns by the network as a whole. However, in the scale-free case retrieval errors are not distributed uniformly among the nodes. The portion of a pattern encoded by the subset of highly connected nodes is more robust and efficiently recognized than the rest of the pattern. The scale-free network thus achieves a very strong partial recognition. The implications of these findings for brain function and social dynamics are suggestive
Revisiting non-Gaussianity from non-attractor inflation models
Cai, Yi-Fu; Chen, Xingang; Namjoo, Mohammad Hossein; Sasaki, Misao; Wang, Dong-Gang; Wang, Ziwei
2018-05-01
Non-attractor inflation is known as the only single field inflationary scenario that can violate non-Gaussianity consistency relation with the Bunch-Davies vacuum state and generate large local non-Gaussianity. However, it is also known that the non-attractor inflation by itself is incomplete and should be followed by a phase of slow-roll attractor. Moreover, there is a transition process between these two phases. In the past literature, this transition was approximated as instant and the evolution of non-Gaussianity in this phase was not fully studied. In this paper, we follow the detailed evolution of the non-Gaussianity through the transition phase into the slow-roll attractor phase, considering different types of transition. We find that the transition process has important effect on the size of the local non-Gaussianity. We first compute the net contribution of the non-Gaussianities at the end of inflation in canonical non-attractor models. If the curvature perturbations keep evolving during the transition—such as in the case of smooth transition or some sharp transition scenarios—the Script O(1) local non-Gaussianity generated in the non-attractor phase can be completely erased by the subsequent evolution, although the consistency relation remains violated. In extremal cases of sharp transition where the super-horizon modes freeze immediately right after the end of the non-attractor phase, the original non-attractor result can be recovered. We also study models with non-canonical kinetic terms, and find that the transition can typically contribute a suppression factor in the squeezed bispectrum, but the final local non-Gaussianity can still be made parametrically large.
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.
Context-dependent retrieval of information by neural-network dynamics with continuous attractors.
Tsuboshita, Yukihiro; Okamoto, Hiroshi
2007-08-01
Memory retrieval in neural networks has traditionally been described by dynamic systems with discrete attractors. However, recent neurophysiological findings of graded persistent activity suggest that memory retrieval in the brain is more likely to be described by dynamic systems with continuous attractors. To explore what sort of information processing is achieved by continuous-attractor dynamics, keyword extraction from documents by a network of bistable neurons, which gives robust continuous attractors, is examined. Given an associative network of terms, a continuous attractor led by propagation of neuronal activation in this network appears to represent keywords that express underlying meaning of a document encoded in the initial state of the network-activation pattern. A dominant hypothesis in cognitive psychology is that long-term memory is archived in the network structure, which resembles associative networks of terms. Our results suggest that keyword extraction by the neural-network dynamics with continuous attractors might symbolically represent context-dependent retrieval of short-term memory from long-term memory in the brain.
Our universe as an attractor in a superstring model
International Nuclear Information System (INIS)
Maeda, Keiichi.
1986-11-01
One preferential scenario of the evolution of the universe is discussed in a superstring model. The universe can reach the present state as an attractor in the dynamical system. The kinetic terms of the ''axions'' play an important role so that our present universe is realized almost uniquely. (author)
Coexisting chaotic attractors in a single neuron model with adapting feedback synapse
International Nuclear Information System (INIS)
Li Chunguang; Chen Guanrong
2005-01-01
In this paper, we consider the nonlinear dynamical behavior of a single neuron model with adapting feedback synapse, and show that chaotic behaviors exist in this model. In some parameter domain, we observe two coexisting chaotic attractors, switching from the coexisting chaotic attractors to a connected chaotic attractor, and then switching back to the two coexisting chaotic attractors. We confirm the chaoticity by simulations with phase plots, waveform plots, and power spectra
Szalay, Kristóf Z; Nussinov, Ruth; Csermely, Peter
2014-06-01
Conformational barcodes tag functional sites of proteins and are decoded by interacting molecules transmitting the incoming signal. Conformational barcodes are modified by all co-occurring allosteric events induced by post-translational modifications, pathogen, drug binding, etc. We argue that fuzziness (plasticity) of conformational barcodes may be increased by disordered protein structures, by integrative plasticity of multi-phosphorylation events, by increased intracellular water content (decreased molecular crowding) and by increased action of molecular chaperones. This leads to increased plasticity of signaling and cellular networks. Increased plasticity is both substantiated by and inducing an increased noise level. Using the versatile network dynamics tool, Turbine (www.turbine.linkgroup.hu), here we show that the 10 % noise level expected in cellular systems shifts a cancer-related signaling network of human cells from its proliferative attractors to its largest, apoptotic attractor representing their health-preserving response in the carcinogen containing and tumor suppressor deficient environment modeled in our study. Thus, fuzzy conformational barcodes may not only make the cellular system more plastic, and therefore more adaptable, but may also stabilize the complex system allowing better access to its largest attractor. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
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.
Entropies from Markov Models as Complexity Measures of Embedded Attractors
Directory of Open Access Journals (Sweden)
Julián D. Arias-Londoño
2015-06-01
Full Text Available This paper addresses the problem of measuring complexity from embedded attractors as a way to characterize changes in the dynamical behavior of different types of systems with a quasi-periodic behavior by observing their outputs. With the aim of measuring the stability of the trajectories of the attractor along time, this paper proposes three new estimations of entropy that are derived from a Markov model of the embedded attractor. The proposed estimators are compared with traditional nonparametric entropy measures, such as approximate entropy, sample entropy and fuzzy entropy, which only take into account the spatial dimension of the trajectory. The method proposes the use of an unsupervised algorithm to find the principal curve, which is considered as the “profile trajectory”, that will serve to adjust the Markov model. The new entropy measures are evaluated using three synthetic experiments and three datasets of physiological signals. In terms of consistency and discrimination capabilities, the results show that the proposed measures perform better than the other entropy measures used for comparison purposes.
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.
Unraveling chaotic attractors by complex networks and measurements of stock market complexity
International Nuclear Information System (INIS)
Cao, Hongduo; Li, Ying
2014-01-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
Robustness of unstable attractors in arbitrarily sized pulse-coupled networks with delay
Broer, Hendrik; Efstathiou, Konstantinos; Subramanian, Easwar
We consider arbitrarily large networks of pulse-coupled oscillators with non-zero delay where the coupling is given by the Mirollo-Strogatz function. We prove that such systems have unstable attractors (saddle periodic orbits whose stable set has non-empty interior) in an open parameter region for
Lorenz-like attractors in a nonholonomic model of a rattleback
International Nuclear Information System (INIS)
Gonchenko, A S; Gonchenko, S V
2015-01-01
We study chaotic dynamics in a nonholonomic model of a rattleback stone. We show that, for certain values of parameters that characterise geometrical and physical properties of the stone, a strange Lorenz-like attractor is observed in the model. We also study bifurcation scenarios for the appearance and break-down of this attractor. (paper)
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.
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
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.
Storage capacity of attractor neural networks with depressing synapses
International Nuclear Information System (INIS)
Torres, Joaquin J.; Pantic, Lovorka; Kappen, Hilbert J.
2002-01-01
We compute the capacity of a binary neural network with dynamic depressing synapses to store and retrieve an infinite number of patterns. We use a biologically motivated model of synaptic depression and a standard mean-field approach. We find that at T=0 the critical storage capacity decreases with the degree of the depression. We confirm the validity of our main mean-field results with numerical simulations
Generation of n x m-scroll attractors in a two-port RCL network with hysteresis circuits
International Nuclear Information System (INIS)
Yu Simin; Tang, Wallace K.S.
2009-01-01
In this paper, the generation of n x m-scroll attractors based on a two-port network is presented. The two-port network is built according to the RCL circuit suggested in the conventional Chua's circuit. By appending hysteresis voltage controlled devices on this two-port network, n-scroll and n x m-scroll attractors can be duly obtained both in simulations and experiments.
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
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.
Navigating cancer network attractors for tumor-specific therapy
DEFF Research Database (Denmark)
Creixell, Pau; Schoof, Erwin; Erler, Janine Terra
2012-01-01
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....
Hidden Attractors in a Model of a Bubble Contrast Agent Oscillating Near an Elastic Wall
Garashchuk, Ivan; Sinelshchikov, Dmitry; Kudryashov, Nikolay
2018-02-01
A model describing the dynamics of a spherical gas bubble in a compressible viscous liquid is studied. The bubble is oscillating close to an elastic wall of finite thickness under the influence of an external pressure field which simulates a contrast agent oscillating close to a blood vessel wall. Here we investigate numerically the coexistence of chaotic and periodic attractors in this model. One of the tools applied for seeking coexisting attractors is the perpetual points method. This method can be helpful for localizing coexisting attractors, occurring in various physically realistic ranges of variation of the control parameters. We provide some examples of coexisting attractors to demonstrate the importance of the multistability problem for the applications.
Global attractor and asymptotic dynamics in the Kuramoto model for coupled noisy phase oscillators
International Nuclear Information System (INIS)
Giacomin, Giambattista; Pakdaman, Khashayar; Pellegrin, Xavier
2012-01-01
We study the dynamics of the large N limit of the Kuramoto model of coupled phase oscillators, subject to white noise. We introduce the notion of shadow inertial manifold and we prove their existence for this model, supporting the fact that the long-term dynamics of this model is finite dimensional. Following this, we prove that the global attractor of this model takes one of two forms. When coupling strength is below a critical value, the global attractor is a single equilibrium point corresponding to an incoherent state. Otherwise, when coupling strength is beyond this critical value, the global attractor is a two-dimensional disc composed of radial trajectories connecting a saddle-point equilibrium (the incoherent state) to an invariant closed curve of locally stable equilibria (partially synchronized state). Our analysis hinges, on the one hand, upon sharp existence and uniqueness results and their consequence for the existence of a global attractor, and, on the other hand, on the study of the dynamics in the vicinity of the incoherent and coherent (or synchronized) equilibria. We prove in particular nonlinear stability of each synchronized equilibrium, and normal hyperbolicity of the set of such equilibria. We explore mathematically and numerically several properties of the global attractor, in particular we discuss the limit of this attractor as noise intensity decreases to zero
Bistable Chimera Attractors on a Triangular Network of Oscillator Populations
DEFF Research Database (Denmark)
Martens, Erik Andreas
2010-01-01
. This triangular network is the simplest discretization of a continuous ring of oscillators. Yet it displays an unexpectedly different behavior: in contrast to the lone stable chimera observed in continuous rings of oscillators, we find that this system exhibits two coexisting stable chimeras. Both chimeras are......, as usual, born through a saddle-node bifurcation. As the coupling becomes increasingly local in nature they lose stability through a Hopf bifurcation, giving rise to breathing chimeras, which in turn get destroyed through a homoclinic bifurcation. Remarkably, one of the chimeras reemerges by a reversal...
Linear-control-based synchronization of coexisting attractor networks with time delays
International Nuclear Information System (INIS)
Yun-Zhong, Song
2010-01-01
This paper introduces the concept of linear-control-based synchronization of coexisting attractor networks with time delays. Within the new framework, closed loop control for each dynamic node is realized through linear state feedback around its own arena in a decentralized way, where the feedback matrix is determined through consideration of the coordination of the node dynamics, the inner connected matrix and the outer connected matrix. Unlike previously existing results, the feedback gain matrix here is decoupled from the inner matrix; this not only guarantees the flexible choice of the gain matrix, but also leaves much space for inner matrix configuration. Synchronization of coexisting attractor networks with time delays is made possible in virtue of local interaction, which works in a distributed way between individual neighbours, and the linear feedback control for each node. Provided that the network is connected and balanced, synchronization will come true naturally, where theoretical proof is given via a Lyapunov function. For completeness, several illustrative examples are presented to further elucidate the novelty and efficacy of the proposed scheme. (general)
Local community detection as pattern restoration by attractor dynamics of recurrent neural networks.
Okamoto, Hiroshi
2016-08-01
Densely connected parts in networks are referred to as "communities". Community structure is a hallmark of a variety of real-world networks. Individual communities in networks form functional modules of complex systems described by networks. Therefore, finding communities in networks is essential to approaching and understanding complex systems described by networks. In fact, network science has made a great deal of effort to develop effective and efficient methods for detecting communities in networks. Here we put forward a type of community detection, which has been little examined so far but will be practically useful. Suppose that we are given a set of source nodes that includes some (but not all) of "true" members of a particular community; suppose also that the set includes some nodes that are not the members of this community (i.e., "false" members of the community). We propose to detect the community from this "imperfect" and "inaccurate" set of source nodes using attractor dynamics of recurrent neural networks. Community detection by the proposed method can be viewed as restoration of the original pattern from a deteriorated pattern, which is analogous to cue-triggered recall of short-term memory in the brain. We demonstrate the effectiveness of the proposed method using synthetic networks and real social networks for which correct communities are known. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.
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
Energy Technology Data Exchange (ETDEWEB)
Timpanaro, Andre M; Prado, Carmen P C, E-mail: timpa@if.usp.br, E-mail: prado@if.usp.br [Instituto de Fisica da Universidade de Sao Paulo, Sao Paulo (Brazil)
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 Barabasi-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)
Takashi Kanamaru
Full Text Available Corticopetal acetylcholine (ACh is released transiently from the nucleus basalis of Meynert (NBM into the cortical layers and is associated with top-down attention. Recent experimental data suggest that this release of ACh disinhibits layer 2/3 pyramidal neurons (PYRs via muscarinic presynaptic effects on inhibitory synapses. Together with other possible presynaptic cholinergic effects on excitatory synapses, this may result in dynamic and temporal modifications of synapses associated with top-down attention. However, the system-level consequences and cognitive relevance of such disinhibitions are poorly understood. Herein, we propose a theoretical possibility that such transient modifications of connectivity associated with ACh release, in addition to top-down glutamatergic input, may provide a neural mechanism for the temporal reactivation of attractors as neural correlates of memories. With baseline levels of ACh, the brain returns to quasi-attractor states, exhibiting transitive dynamics between several intrinsic internal states. This suggests that top-down attention may cause the attention-induced deformations between two types of attractor landscapes: the quasi-attractor landscape (Q-landscape, present under low-ACh, non-attentional conditions and the attractor landscape (A-landscape, present under high-ACh, top-down attentional conditions. We present a conceptual computational model based on experimental knowledge of the structure of PYRs and interneurons (INs in cortical layers 1 and 2/3 and discuss the possible physiological implications of our results.
Stringer, Simon M; Rolls, Edmund T
2006-12-01
A key issue is how networks in the brain learn to perform path integration, that is update a represented position using a velocity signal. Using head direction cells as an example, we show that a competitive network could self-organize to learn to respond to combinations of head direction and angular head rotation velocity. These combination cells can then be used to drive a continuous attractor network to the next head direction based on the incoming rotation signal. An associative synaptic modification rule with a short term memory trace enables preceding combination cell activity during training to be associated with the next position in the continuous attractor network. The network accounts for the presence of neurons found in the brain that respond to combinations of head direction and angular head rotation velocity. Analogous networks in the hippocampal system could self-organize to perform path integration of place and spatial view representations.
Multifractal chaotic attractors in a system of delay-differential equations modeling road traffic.
Safonov, Leonid A.; Tomer, Elad; Strygin, Vadim V.; Ashkenazy, Yosef; Havlin, Shlomo
2002-12-01
We study a system of delay-differential equations modeling single-lane road traffic. The cars move in a closed circuit and the system's variables are each car's velocity and the distance to the car ahead. For low and high values of traffic density the system has a stable equilibrium solution, corresponding to the uniform flow. Gradually decreasing the density from high to intermediate values we observe a sequence of supercritical Hopf bifurcations forming multistable limit cycles, corresponding to flow regimes with periodically moving traffic jams. Using an asymptotic technique we find approximately small limit cycles born at Hopf bifurcations and numerically preform their global continuations with decreasing density. For sufficiently large delay the system passes to chaos following the Ruelle-Takens-Newhouse scenario (limit cycles-two-tori-three-tori-chaotic attractors). We find that chaotic and nonchaotic attractors coexist for the same parameter values and that chaotic attractors have a broad multifractal spectrum. (c) 2002 American Institute of Physics.
Exponential attractors for a Cahn-Hilliard model in bounded domains with permeable walls
Directory of Open Access Journals (Sweden)
Ciprian G. Gal
2006-11-01
Full Text Available In a previous article [7], we proposed a model of phase separation in a binary mixture confined to a bounded region which may be contained within porous walls. The boundary conditions were derived from a mass conservation law and variational methods. In the present paper, we study the problem further. Using a Faedo-Galerkin method, we obtain the existence and uniqueness of a global solution to our problem, under more general assumptions than those in [7]. We then study its asymptotic behavior and prove the existence of an exponential attractor (and thus of a global attractor with finite dimension.
Counting and classifying attractors in high dimensional dynamical systems.
Bagley, R J; Glass, L
1996-12-07
Randomly connected Boolean networks have been used as mathematical models of neural, genetic, and immune systems. A key quantity of such networks is the number of basins of attraction in the state space. The number of basins of attraction changes as a function of the size of the network, its connectivity and its transition rules. In discrete networks, a simple count of the number of attractors does not reveal the combinatorial structure of the attractors. These points are illustrated in a reexamination of dynamics in a class of random Boolean networks considered previously by Kauffman. We also consider comparisons between dynamics in discrete networks and continuous analogues. A continuous analogue of a discrete network may have a different number of attractors for many different reasons. Some attractors in discrete networks may be associated with unstable dynamics, and several different attractors in a discrete network may be associated with a single attractor in the continuous case. Special problems in determining attractors in continuous systems arise when there is aperiodic dynamics associated with quasiperiodicity of deterministic chaos.
Cusps enable line attractors for neural computation
International Nuclear Information System (INIS)
Xiao, Zhuocheng; Zhang, Jiwei; Sornborger, Andrew T.; Tao, Louis
2017-01-01
Here, 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.
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.
Multiple attractors and crisis route to chaos in a model food-chain
International Nuclear Information System (INIS)
Upadhyay, Ranjit Kumar
2003-01-01
An attempt has been made to identify the mechanism, which is responsible for the existence of chaos in narrow parameter range in a realistic ecological model food-chain. Analytical and numerical studies of a three species food-chain model similar to a situation likely to be seen in terrestrial ecosystems has been carried out. The study of the model food chain suggests that the existence of chaos in narrow parameter ranges is caused by the crisis-induced sudden death of chaotic attractors. Varying one of the critical parameters in its range while keeping all the others constant, one can monitor the changes in the dynamical behaviour of the system, thereby fixing the regimes in which the system exhibits chaotic dynamics. The computed bifurcation diagrams and basin boundary calculations indicate that crisis is the underlying factor which generates chaotic dynamics in this model food-chain. We investigate sudden qualitative changes in chaotic dynamical behaviour, which occur at a parameter value a 1 =1.7804 at which the chaotic attractor destroyed by boundary crisis with an unstable periodic orbit created by the saddle-node bifurcation. Multiple attractors with riddled basins and fractal boundaries are also observed. If ecological systems of interacting species do indeed exhibit multiple attractors etc., the long term dynamics of such systems may undergo vast qualitative changes following epidemics or environmental catastrophes due to the system being pushed into the basin of a new attractor by the perturbation. Coupled with stochasticity, such complex behaviours may render such systems practically unpredictable
Directory of Open Access Journals (Sweden)
Marcello eMulas
2016-02-01
Full Text Available After the discovery of grid cells, which are an essential component to understand how the mammalian brain encodes spatial information, three main classes of computational models were proposed in order to explain their working principles. Amongst them, the one based on continuous attractor networks (CAN, is promising in terms of biological plausibility and suitable for robotic applications. However, in its current formulation, it is unable to reproduce important electrophysiological findings and cannot be used to perform path integration for long periods of time. In fact, in absence of an appropriate resetting mechanism, the accumulation of errors overtime due to the noise intrinsic in velocity estimation and neural computation prevents CAN models to reproduce stable spatial grid patterns. In this paper, we propose an extension of the CAN model using Hebbian plasticity to anchor grid cell activity to environmental landmarks. To validate our approach we used as input to the neural simulations both artificial data and real data recorded from a robotic setup. The additional neural mechanism can not only anchor grid patterns to external sensory cues but also recall grid patterns generated in previously explored environments. These results might be instrumental for next generation bio-inspired robotic navigation algorithms that take advantage of neural computation in order to cope with complex and dynamic environments.
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.
On convergence of trajectory attractors of the 3D Navier-Stokes-α model as α approaches 0
International Nuclear Information System (INIS)
Vishik, M I; Chepyzhov, V V; Titi, E S
2007-01-01
We study the relations between the long-time dynamics of the Navier-Stokes-α model and the exact 3D Navier-Stokes system. We prove that bounded sets of solutions of the Navier-Stokes-α model converge to the trajectory attractor A 0 of the 3D Navier-Stokes system as the time approaches infinity and α approaches zero. In particular, we show that the trajectory attractor A α of the Navier-Stokes-α model converges to the trajectory attractor A 0 of the 3D Navier-Stokes system as α→0+. We also construct the minimal limit A min (subset or equal A 0 ) of the trajectory attractor A α as α→0+ and prove that the set A min is connected and strictly invariant. Bibliography: 35 titles.
Crisis of the chaotic attractor of a climate model: a transfer operator approach
Tantet, Alexis; Lucarini, Valerio; Lunkeit, Frank; Dijkstra, Henk A.
2018-05-01
The destruction of a chaotic attractor leading to rough changes in the dynamics of a dynamical system is studied. Local bifurcations are known to be characterised by a single or a pair of characteristic exponents crossing the imaginary axis. As a result, the approach of such bifurcations in the presence of noise can be inferred from the slowing down of the decay of correlations (Held and Kleinen 2004 Geophys. Res. Lett. 31 1–4). On the other hand, little is known about global bifurcations involving high-dimensional attractors with several positive Lyapunov exponents. It is known that the global stability of chaotic attractors may be characterised by the spectral properties of the Koopman (Mauroy and Mezić 2016 IEEE Trans. Autom. Control 61 3356–69) or the transfer operators governing the evolution of statistical ensembles. Accordingly, it has recently been shown (Tantet 2017 J. Stat. Phys. 1–33) that a boundary crisis in the Lorenz flow coincides with the approach to the unit circle of the eigenvalues of these operators associated with motions about the attractor, the stable resonances. A second class of resonances, the unstable resonances, are responsible for the decay of correlations and mixing on the attractor. In the deterministic case, these cannot be expected to be affected by general boundary crises. Here, however, we give an example of a chaotic system in which slowing down of the decay of correlations of some observables does occur at the approach of a boundary crisis. The system considered is a high-dimensional, chaotic climate model of physical relevance. Moreover, coarse-grained approximations of the transfer operators on a reduced space, constructed from a long time series of the system, give evidence that this behaviour is due to the approach of unstable resonances to the unit circle. That the unstable resonances are affected by the crisis can be physically understood from the fact that the process responsible for the instability, the ice
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.
Multiple single-centered attractors
International Nuclear Information System (INIS)
Dominic, Pramod; Mandal, Taniya; Tripathy, Prasanta K.
2014-01-01
In this paper we study spherically symmetric single-centered attractors in N=2 supergravity in four dimensions. The attractor points are obtained by extremising the effective black hole potential in the moduli space. Both supersymmetric as well as non-supersymmetric attractors exist in mutually exclusive domains of the charge lattice. We construct axion free supersymmetric as well as non-supersymmetric multiple attractors in a simple two parameter model. We further obtain explicit examples of two distinct non-supersymmetric attractors in type IIA string theory compactified on K3×T"2 carrying D0−D4−D6 charges. We compute the entropy of these attractors and analyse their stability in detail.
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.)
Park, Jeryang; Rao, P Suresh C
2014-11-15
We present here a conceptual model and analysis of complex systems using hypothetical cases of regime shifts resulting from temporal non-stationarity in attractor strengths, and then present selected published cases to illustrate such regime shifts in hydrologic systems (shallow aquatic ecosystems; water table shifts; soil salinization). Complex systems are dynamic and can exist in two or more stable states (or regimes). Temporal variations in state variables occur in response to fluctuations in external forcing, which are modulated by interactions among internal processes. Combined effects of external forcing and non-stationary strengths of alternative attractors can lead to shifts from original to alternate regimes. In systems with bi-stable states, when the strengths of two competing attractors are constant in time, or are non-stationary but change in a linear fashion, regime shifts are found to be temporally stationary and only controlled by the characteristics of the external forcing. However, when attractor strengths change in time non-linearly or vary stochastically, regime shifts in complex systems are characterized by non-stationary probability density functions (pdfs). We briefly discuss implications and challenges to prediction and management of hydrologic complex systems. Copyright © 2014 Elsevier B.V. All rights reserved.
Emergence of unstable itinerant orbits in a recurrent neural network model
International Nuclear Information System (INIS)
Suemitsu, Yoshikazu; Nara, Shigetoshi
2005-01-01
A recurrent neural network model with time delay is investigated by numerical methods. The model functions as both conventional associative memory and also enables us to embed a new kind of memory attractor that cannot be realized in models without time delay, for example chain-ring attractors. This is attributed to the fact that the time delay extends the available state space dimension. The difference between the basin structures of chain-ring attractors and of isolated cycle attractors is investigated with respect to the two attractor pattern sets, random memory patterns and designed memory patterns with intended structures. Compared to isolated attractors with random memory patterns, the basins of chain-ring attractors are reduced considerably. Computer experiments confirm that the basin volume of each embedded chain-ring attractor shrinks and the emergence of unstable itinerant orbits in the outer state space of the memory attractor basins is discovered. The instability of such itinerant orbits is investigated. Results show that a 1-bit difference in initial conditions does not exceed 10% of a total dimension within 100 updating steps
Attractor comparisons based on density
International Nuclear Information System (INIS)
Carroll, T. L.
2015-01-01
Recognizing a chaotic attractor can be seen as a problem in pattern recognition. Some feature vector must be extracted from the attractor and used to compare to other attractors. The field of machine learning has many methods for extracting feature vectors, including clustering methods, decision trees, support vector machines, and many others. In this work, feature vectors are created by representing the attractor as a density in phase space and creating polynomials based on this density. Density is useful in itself because it is a one dimensional function of phase space position, but representing an attractor as a density is also a way to reduce the size of a large data set before analyzing it with graph theory methods, which can be computationally intensive. The density computation in this paper is also fast to execute. In this paper, as a demonstration of the usefulness of density, the density is used directly to construct phase space polynomials for comparing attractors. Comparisons between attractors could be useful for tracking changes in an experiment when the underlying equations are too complicated for vector field modeling
How additive noise generates a phantom attractor in a model with cubic nonlinearity
Energy Technology Data Exchange (ETDEWEB)
Bashkirtseva, Irina; Ryashko, Lev, E-mail: lev.ryashko@urfu.ru
2016-10-07
Two-dimensional nonlinear system forced by the additive noise is studied. We show that an increasing noise shifts random states and localizes them in a zone far from deterministic attractors. This phenomenon of the generation of the new “phantom” attractor is investigated on the base of probability density functions, mean values and variances of random states. We show that increasing noise results in the qualitative changes of the form of pdf, sharp shifts of mean values, and spikes of the variance. To clarify this phenomenon mathematically, we use the fast–slow decomposition and averaging over the fast variable. For the dynamics of the mean value of the slow variable, a deterministic equation is derived. It is shown that equilibria and the saddle-node bifurcation point of this deterministic equation well describe the stochastic phenomenon of “phantom” attractor in the initial two-dimensional stochastic system. - Highlights: • Two-dimensional nonlinear system with cubic nonlinearity is studied. • Additive noise generates a new phantom attractor. • By averaging over the fast variable one-dimensional equation is derived. • Phantom attractor appearance is analyzed by bifurcation analysis of this equation.
An evolutionary attractor model for sapwood cross section in relation to leaf area.
Westoby, Mark; Cornwell, William K; Falster, Daniel S
2012-06-21
Sapwood cross-sectional area per unit leaf area (SA:LA) is an influential trait that plants coordinate with physical environment and with other traits. We develop theory for SA:LA and also for root surface area per leaf area (RA:LA) on the premise that plants maximizing the surplus of revenue over costs should have competitive advantage. SA:LA is predicted to increase in water-relations environments that reduce photosynthetic revenue, including low soil water potential, high water vapor pressure deficit (VPD), and low atmospheric CO(2). Because sapwood has costs, SA:LA adjustment does not completely offset difficult water relations. Where sapwood costs are large, as in tall plants, optimal SA:LA may actually decline with (say) high VPD. Large soil-to-root resistance caps the benefits that can be obtained from increasing SA:LA. Where a plant can adjust water-absorbing surface area of root per leaf area (RA:LA) as well as SA:LA, optimal RA:SA is not affected by VPD, CO(2) or plant height. If selection favours increased height more so than increased revenue-minus-cost, then height is predicted to rise substantially under improved water-relations environments such as high-CO(2) atmospheres. Evolutionary-attractor theory for SA:LA and RA:LA complements models that take whole-plant conductivity per leaf area as a parameter. Copyright © 2012 Elsevier Ltd. All rights reserved.
Heteroclinic cycles between unstable attractors
International Nuclear Information System (INIS)
Broer, Henk; Efstathiou, Konstantinos; Subramanian, Easwar
2008-01-01
We consider networks of pulse coupled linear oscillators with non-zero delay where the coupling between the oscillators is given by the Mirollo–Strogatz function. We prove the existence of heteroclinic cycles between unstable attractors for a network of four oscillators and for an open set of parameter values
Heteroclinic cycles between unstable attractors
Broer, Henk; Efstathiou, Konstantinos; Subramanian, Easwar
We consider networks of pulse coupled linear oscillators with non-zero delay where the coupling between the oscillators is given by the Mirollo-Strogatz function. We prove the existence of heteroclinic cycles between unstable attractors for a network of four oscillators and for an open set of
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.
New BFA Method Based on Attractor Neural Network and Likelihood Maximization
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Polyakov, P.Y.; Snášel, V.
2014-01-01
Roč. 132, 20 May (2014), s. 14-29 ISSN 0925-2312 Grant - others:GA MŠk(CZ) ED1.1.00/02.0070; GA MŠk(CZ) EE.2.3.20.0073 Program:ED Institutional support: RVO:67985807 Keywords : recurrent neural network * associative memory * Hebbian learning rule * neural network application * data mining * statistics * Boolean factor analysis * information gain * dimension reduction * likelihood-maximization * bars problem Subject RIV: IN - Informatics, Computer Science Impact factor: 2.083, year: 2014
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
Institute of Scientific and Technical Information of China (English)
应阳君; 黄祖洽
2001-01-01
Frequency catastrophe is found in a cell Ca2+ nonlinear oscillation model with time delay. The relation of the frequency transition to the time delay is studied by numerical simulations and theoretical analysis. There is a range of parameters in which two kinds of attractors with great frequency differences co-exist in the system. Along with parameter changes, a critical phenomenon occurs and the oscillation frequency changes greatly. This mechanism helps us to deepen the understanding of the complex dynamics of delay systems, and might be of some meaning in cell signalling.
Ibrahim, K. M.; Jamal, R. K.; Ali, F. H.
2018-05-01
The behaviour of certain dynamical nonlinear systems are described in term as chaos, i.e., systems’ variables change with the time, displaying very sensitivity to initial conditions of chaotic dynamics. In this paper, we study archetype systems of ordinary differential equations in two-dimensional phase spaces of the Rössler model. A system displays continuous time chaos and is explained by three coupled nonlinear differential equations. We study its characteristics and determine the control parameters that lead to different behavior of the system output, periodic, quasi-periodic and chaos. The time series, attractor, Fast Fourier Transformation and bifurcation diagram for different values have been described.
Neural network modeling of associative memory: Beyond the Hopfield model
Dasgupta, Chandan
1992-07-01
A number of neural network models, in which fixed-point and limit-cycle attractors of the underlying dynamics are used to store and associatively recall information, are described. In the first class of models, a hierarchical structure is used to store an exponentially large number of strongly correlated memories. The second class of models uses limit cycles to store and retrieve individual memories. A neurobiologically plausible network that generates low-amplitude periodic variations of activity, similar to the oscillations observed in electroencephalographic recordings, is also described. Results obtained from analytic and numerical studies of the properties of these networks are discussed.
Tetrapterous butterfly attractors in modified Lorenz systems
International Nuclear Information System (INIS)
Yu Simin; Tang, Wallace K.S.
2009-01-01
In this paper, the Lorenz-type tetrapterous butterfly attractors are firstly reported. With the introduction of multiple segment piecewise linear functions, these interesting and complex attractors are obtained from two different modified Lorenz models. This approach are verified in both simulations and experiments.
The Lorentz Attractor and Other Attractors in the Economic System of a Firm
International Nuclear Information System (INIS)
Shapovalov, V I; Kazakov, N V
2015-01-01
A nonlinear model of the economic system of ''a firm'' is offered. It is shown that this model has several chaotic attractors, including the Lorentz attractor and a new attractor that, in our opinion, has not yet been described in the scientific literature. The chaotic nature of the attractors that were found was confirmed by computing the Lyapunov indicators. The functioning of our economic model is demonstrated with examples of firm behaviour that change the control parameters; these are well known in practice. In particular, it is shown that changes in the specific control parameters may change the system and avoid bankruptcy for the firm
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.
Cortical computations via transient attractors.
Rourke, Oliver L C; Butts, Daniel A
2017-01-01
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.
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.
Strange Attractors in Drift Wave Turbulence
International Nuclear Information System (INIS)
Lewandowski, J.L.V.
2003-01-01
A multi-grid part-in-cell algorithm for a shearless slab drift wave model with kinetic electrons is presented. The algorithm, which is based on an exact separation of adiabatic and nonadiabatic electron responses, is used to investigate the presence of strange attractors in drift wave turbulence. Although the simulation model has a large number of degrees of freedom, it is found that the strange attractor is low-dimensional and that it is strongly affected by dissipative (collisional) effects
Analytic models for the evolution of semilocal string networks
International Nuclear Information System (INIS)
Nunes, A. S.; Martins, C. J. A. P.; Avgoustidis, A.; Urrestilla, J.
2011-01-01
We revisit previously developed analytic models for defect evolution and adapt them appropriately for the study of semilocal string networks. We thus confirm the expectation (based on numerical simulations) that linear scaling evolution is the attractor solution for a broad range of model parameters. We discuss in detail the evolution of individual semilocal segments, focusing on the phenomenology of segment growth, and also provide a preliminary comparison with existing numerical simulations.
Localization of hidden Chua's attractors
International Nuclear Information System (INIS)
Leonov, G.A.; Kuznetsov, N.V.; Vagaitsev, V.I.
2011-01-01
The classical attractors of Lorenz, Rossler, Chua, Chen, and other widely-known attractors are those excited from unstable equilibria. From computational point of view this allows one to use numerical method, in which after transient process a trajectory, started from a point of unstable manifold in the neighborhood of equilibrium, reaches an attractor and identifies it. However there are attractors of another type: hidden attractors, a basin of attraction of which does not contain neighborhoods of equilibria. In the present Letter for localization of hidden attractors of Chua's circuit it is suggested to use a special analytical-numerical algorithm. -- Highlights: → There are hidden attractors: basin doesn't contain neighborhoods of equilibria. → Hidden attractors cannot be reached by trajectory from neighborhoods of equilibria. → We suggested special procedure for localization of hidden attractors. → We discovered hidden attractor in Chua's system, L. Chua in his work didn't expect this.
Anisotropic nonequilibrium hydrodynamic attractor
Strickland, Michael; Noronha, Jorge; Denicol, Gabriel S.
2018-02-01
We determine the dynamical attractors associated with anisotropic hydrodynamics (aHydro) and the DNMR equations for a 0 +1 d conformal system using kinetic theory in the relaxation time approximation. We compare our results to the nonequilibrium attractor obtained from the exact solution of the 0 +1 d conformal Boltzmann equation, the Navier-Stokes theory, and the second-order Mueller-Israel-Stewart theory. We demonstrate that the aHydro attractor equation resums an infinite number of terms in the inverse Reynolds number. The resulting resummed aHydro attractor possesses a positive longitudinal-to-transverse pressure ratio and is virtually indistinguishable from the exact attractor. This suggests that an optimized hydrodynamic treatment of kinetic theory involves a resummation not only in gradients (Knudsen number) but also in the inverse Reynolds number. We also demonstrate that the DNMR result provides a better approximation of the exact kinetic theory attractor than the Mueller-Israel-Stewart theory. Finally, we introduce a new method for obtaining approximate aHydro equations which relies solely on an expansion in the inverse Reynolds number. We then carry this expansion out to the third order, and compare these third-order results to the exact kinetic theory solution.
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.
Equilibrium and nonequilibrium attractors for a discrete, selection-migration model
James F. Selgrade; James H. Roberds
2003-01-01
This study presents a discrete-time model for the effects of selection and immigration on the demographic and genetic compositions of a population. Under biologically reasonable conditions, it is shown that the model always has an equilibrium. Although equilibria for similar models without migration must have real eigenvalues, for this selection-migration model we...
International Nuclear Information System (INIS)
Ferrara, S.; Kallosh, R.
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 mechanism in N=4,8 supersymmetries and the relation to the N=2 case. The entropy-area formula in five dimensions, recently discussed in the literature, is also seen to be obtained by extremizing the 5d central charge. copyright 1996 The American Physical Society
Ghil, M.; Pierini, S.; Chekroun, M.
2017-12-01
A low-order quasigeostrophic model [1] 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. 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 [2,3]. Ensemble simulations help us explore these PBAs. The chaotic PBAs of the periodically forced model [4] 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 types of system behavior. 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 [5]. 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 analyzed in detail. The extension to random dynamical systems is described and connected to the model's autonomous and periodically forced behavior. [1] Pierini, S., 2011. J. Phys. Oceanogr., 41, 1585
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
Horseshoes in modified Chen's attractors
International Nuclear Information System (INIS)
Huang Yan; Yang Xiaosong
2005-01-01
In this paper we study dynamics of a class of modified Chen's attractors, we show that these attractors are chaotic by giving a rigorous verification for existence of horseshoes in these systems. We prove that the Poincare maps derived from these modified Chen's attractors are semi-conjugate to the 2-shift map
Hidden attractors in dynamical systems
Dudkowski, Dawid; Jafari, Sajad; Kapitaniak, Tomasz; Kuznetsov, Nikolay V.; Leonov, Gennady A.; Prasad, Awadhesh
2016-06-01
Complex dynamical systems, ranging from the climate, ecosystems to financial markets and engineering applications typically have many coexisting attractors. This property of the system is called multistability. The final state, i.e., the attractor on which the multistable system evolves strongly depends on the initial conditions. Additionally, such systems are very sensitive towards noise and system parameters so a sudden shift to a contrasting regime may occur. To understand the dynamics of these systems one has to identify all possible attractors and their basins of attraction. Recently, it has been shown that multistability is connected with the occurrence of unpredictable attractors which have been called hidden attractors. The basins of attraction of the hidden attractors do not touch unstable fixed points (if exists) and are located far away from such points. Numerical localization of the hidden attractors is not straightforward since there are no transient processes leading to them from the neighborhoods of unstable fixed points and one has to use the special analytical-numerical procedures. From the viewpoint of applications, the identification of hidden attractors is the major issue. The knowledge about the emergence and properties of hidden attractors can increase the likelihood that the system will remain on the most desirable attractor and reduce the risk of the sudden jump to undesired behavior. We review the most representative examples of hidden attractors, discuss their theoretical properties and experimental observations. We also describe numerical methods which allow identification of the hidden attractors.
Optimizing Markovian modeling of chaotic systems with recurrent neural networks
International Nuclear Information System (INIS)
Cechin, Adelmo L.; Pechmann, Denise R.; Oliveira, Luiz P.L. de
2008-01-01
In this paper, we propose a methodology for optimizing the modeling of an one-dimensional chaotic time series with a Markov Chain. The model is extracted from a recurrent neural network trained for the attractor reconstructed from the data set. Each state of the obtained Markov Chain is a region of the reconstructed state space where the dynamics is approximated by a specific piecewise linear map, obtained from the network. The Markov Chain represents the dynamics of the time series in its statistical essence. An application to a time series resulted from Lorenz system is included
Chaotic attractors in tumor growth and decay: a differential equation model.
Harney, Michael; Yim, Wen-sau
2015-01-01
Tumorigenesis can be modeled as a system of chaotic nonlinear differential equations. A simulation of the system is realized by converting the differential equations to difference equations. The results of the simulation show that an increase in glucose in the presence of low oxygen levels decreases tumor growth.
Multiple attractors and dynamics in an OLG model with productive environment
Caravaggio, Andrea; Sodini, Mauro
2018-05-01
This work analyses an overlapping generations model in which economic activity depends on the exploitation of a free-access natural resource. In addition, public expenditures for environmental maintenance are assumed. By characterising some properties of the map and performing numerical simulations, we investigate consequences of the interplay between environmental public expenditure and private sector. In particular, we identify different scenarios in which multiple equilibria as well as complex dynamics may arise.
Czech Academy of Sciences Publication Activity Database
Colwell, R. K.; Gotelli, N. J.; Ashton, L. A.; Beck, J.; Brehm, G.; Fayle, Tom Maurice; Fiedler, K.; Forister, M. L.; Kessler, M.; Kitching, R. L.; Klimeš, Petr; Kluge, J.; Longino, J. T.; Maunsell, S. C.; McCain, C. M.; Moses, J.; Noben, N.; Sam, Kateřina; Sam, Legi; Shapiro, A. M.; Wang, X.; Novotný, Vojtěch
2016-01-01
Roč. 19, č. 9 (2016), s. 1009-1022 ISSN 1461-023X R&D Projects: GA ČR GB14-36098G; GA ČR GA14-32302S; GA ČR(CZ) GP14-32024P; GA ČR GA13-10486S Institutional support: RVO:60077344 Keywords : Bayesian model * biogeography * elevational gradients Subject RIV: EH - Ecology, Behaviour Impact factor: 9.449, year: 2016 http://onlinelibrary.wiley.com/doi/10.1111/ele.12640/full
Describing chaotic attractors: Regular and perpetual points
Dudkowski, Dawid; Prasad, Awadhesh; Kapitaniak, Tomasz
2018-03-01
We study the concepts of regular and perpetual points for describing the behavior of chaotic attractors in dynamical systems. The idea of these points, which have been recently introduced to theoretical investigations, is thoroughly discussed and extended into new types of models. We analyze the correlation between regular and perpetual points, as well as their relation with phase space, showing the potential usefulness of both types of points in the qualitative description of co-existing states. The ability of perpetual points in finding attractors is indicated, along with its potential cause. The location of chaotic trajectories and sets of considered points is investigated and the study on the stability of systems is shown. The statistical analysis of the observing desired states is performed. We focus on various types of dynamical systems, i.e., chaotic flows with self-excited and hidden attractors, forced mechanical models, and semiconductor superlattices, exhibiting the universality of appearance of the observed patterns and relations.
Czech Academy of Sciences Publication Activity Database
Frolov, A. A.; Húsek, Dušan; Muraviev, I. P.; Polyakov, P.Y.
2010-01-01
Roč. 73, č. 7-9 (2010), s. 1394-1404 ISSN 0925-2312 R&D Projects: GA ČR GA205/09/1079; GA MŠk(CZ) 1M0567 Institutional research plan: CEZ:AV0Z10300504 Keywords : Boolean factor analysis * Hopfield neural Network * unsupervised learning * dimension reduction * data mining Subject RIV: IN - Informatics, Computer Science Impact factor: 1.429, year: 2010
SUSTAIN: a network model of category learning.
Love, Bradley C; Medin, Douglas L; Gureckis, Todd M
2004-04-01
SUSTAIN (Supervised and Unsupervised STratified Adaptive Incremental Network) is a model of how humans learn categories from examples. SUSTAIN initially assumes a simple category structure. If simple solutions prove inadequate and SUSTAIN is confronted with a surprising event (e.g., it is told that a bat is a mammal instead of a bird), SUSTAIN recruits an additional cluster to represent the surprising event. Newly recruited clusters are available to explain future events and can themselves evolve into prototypes-attractors-rules. SUSTAIN's discovery of category substructure is affected not only by the structure of the world but by the nature of the learning task and the learner's goals. SUSTAIN successfully extends category learning models to studies of inference learning, unsupervised learning, category construction, and contexts in which identification learning is faster than classification learning.
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.
Dimension of chaotic attractors
Energy Technology Data Exchange (ETDEWEB)
Farmer, J.D.; Ott, E.; Yorke, J.A.
1982-09-01
Dimension is perhaps the most basic property of an attractor. In this paper we discuss a variety of different definitions of dimension, compute their values for a typical example, and review previous work on the dimension of chaotic attractors. The relevant definitions of dimension are of two general types, those that depend only on metric properties, and those that depend on probabilistic properties (that is, they depend on the frequency with which a typical trajectory visits different regions of the attractor). Both our example and the previous work that we review support the conclusion that all of the probabilistic dimensions take on the same value, which we call the dimension of the natural measure, and all of the metric dimensions take on a common value, which we call the fractal dimension. Furthermore, the dimension of the natural measure is typically equal to the Lyapunov dimension, which is defined in terms of Lyapunov numbers, and thus is usually far easier to calculate than any other definition. Because it is computable and more physically relevant, we feel that the dimension of the natural measure is more important than the fractal dimension.
Attractor merging crisis in chaotic business cycles
International Nuclear Information System (INIS)
Chian, Abraham C.-L.; Borotto, Felix A.; Rempel, Erico L.; Rogers, Colin
2005-01-01
A numerical study is performed on a forced-oscillator model of nonlinear business cycles. An attractor merging crisis due to a global bifurcation is analyzed using the unstable periodic orbits and their associated stable and unstable manifolds. Characterization of crisis can improve our ability to forecast sudden major changes in economic systems
Vaidyanathan, S.; Sambas, A.; Sukono; Mamat, M.; Gundara, G.; Mada Sanjaya, W. S.; Subiyanto
2018-03-01
A 3-D new chaotic attractor with two quadratic nonlinearities is proposed in this paper. The dynamical properties of the new chaotic system are described in terms of phase portraits, equilibrium points, Lyapunov exponents, Kaplan-Yorke dimension, dissipativity, etc. We show that the new chaotic system has three unstable equilibrium points. The new chaotic attractor is dissipative in nature. As an engineering application, adaptive synchronization of identical new chaotic attractors is designed via nonlinear control and Lyapunov stability theory. Furthermore, an electronic circuit realization of the new chaotic attractor is presented in detail to confirm the feasibility of the theoretical chaotic attractor model.
Attractors, universality, and inflation
Downes, Sean; Dutta, Bhaskar; Sinha, Kuver
2012-11-01
Studies of the initial conditions for inflation have conflicting predictions from exponential suppression to inevitability. At the level of phase space, this conflict arises from the competing intuitions of CPT invariance and thermodynamics. After reviewing this conflict, we enlarge the ensemble beyond phase space to include scalar potential data. We show how this leads to an important contribution from inflection point inflation, enhancing the likelihood of inflation to a power law, 1/Ne3. In the process, we emphasize the attractor dynamics of the gravity-scalar system and the existence of universality classes from inflection point inflation. Finally, we comment on the predictivity of inflation in light of these results.
Trajectory attractors of equations of mathematical physics
International Nuclear Information System (INIS)
Vishik, Marko I; Chepyzhov, Vladimir V
2011-01-01
In this survey the method of trajectory dynamical systems and trajectory attractors is described, and is applied in the study of the limiting asymptotic behaviour of solutions of non-linear evolution equations. This method is especially useful in the study of dissipative equations of mathematical physics for which the corresponding Cauchy initial-value problem has a global (weak) solution with respect to the time but the uniqueness of this solution either has not been established or does not hold. An important example of such an equation is the 3D Navier-Stokes system in a bounded domain. In such a situation one cannot use directly the classical scheme of construction of a dynamical system in the phase space of initial conditions of the Cauchy problem of a given equation and find a global attractor of this dynamical system. Nevertheless, for such equations it is possible to construct a trajectory dynamical system and investigate a trajectory attractor of the corresponding translation semigroup. This universal method is applied for various types of equations arising in mathematical physics: for general dissipative reaction-diffusion systems, for the 3D Navier-Stokes system, for dissipative wave equations, for non-linear elliptic equations in cylindrical domains, and for other equations and systems. Special attention is given to using the method of trajectory attractors in approximation and perturbation problems arising in complicated models of mathematical physics. Bibliography: 96 titles.
Modeling Network Interdiction Tasks
2015-09-17
118 xiii Table Page 36 Computation times for weighted, 100-node random networks for GAND Approach testing in Python ...in Python . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120 38 Accuracy measures for weighted, 100-node random networks for GAND...networks [15:p. 1]. A common approach to modeling network interdiction is to formulate the problem in terms of a two-stage strategic game between two
Chaotic attractors with separated scrolls
International Nuclear Information System (INIS)
Bouallegue, Kais
2015-01-01
This paper proposes a new behavior of chaotic attractors with separated scrolls while combining Julia's process with Chua's attractor and Lorenz's attractor. The main motivation of this work is the ability to generate a set of separated scrolls with different behaviors, which in turn allows us to choose one or many scrolls combined with modulation (amplitude and frequency) for secure communication or synchronization. This set seems a new class of hyperchaos because each element of this set looks like a simple chaotic attractor with one positive Lyapunov exponent, so the cardinal of this set is greater than one. This new approach could be used to generate more general higher-dimensional hyperchaotic attractor for more potential application. Numerical simulations are given to show the effectiveness of the proposed theoretical results
Boolean network model for cancer pathways: predicting carcinogenesis and targeted therapy outcomes.
Directory of Open Access Journals (Sweden)
Herman F Fumiã
Full Text Available A Boolean dynamical system integrating the main signaling pathways involved in cancer is constructed based on the currently known protein-protein interaction network. This system exhibits stationary protein activation patterns--attractors--dependent on the cell's microenvironment. These dynamical attractors were determined through simulations and their stabilities against mutations were tested. In a higher hierarchical level, it was possible to group the network attractors into distinct cell phenotypes and determine driver mutations that promote phenotypic transitions. We find that driver nodes are not necessarily central in the network topology, but at least they are direct regulators of central components towards which converge or through which crosstalk distinct cancer signaling pathways. The predicted drivers are in agreement with those pointed out by diverse census of cancer genes recently performed for several human cancers. Furthermore, our results demonstrate that cell phenotypes can evolve towards full malignancy through distinct sequences of accumulated mutations. In particular, the network model supports routes of carcinogenesis known for some tumor types. Finally, the Boolean network model is employed to evaluate the outcome of molecularly targeted cancer therapies. The major find is that monotherapies were additive in their effects and that the association of targeted drugs is necessary for cancer eradication.
Directory of Open Access Journals (Sweden)
Yasser Roudi
2007-09-01
Full Text Available A fundamental problem in neuroscience is understanding how working memory--the ability to store information at intermediate timescales, like tens of seconds--is implemented in realistic neuronal networks. The most likely candidate mechanism is the attractor network, and a great deal of effort has gone toward investigating it theoretically. Yet, despite almost a quarter century of intense work, attractor networks are not fully understood. In particular, there are still two unanswered questions. First, how is it that attractor networks exhibit irregular firing, as is observed experimentally during working memory tasks? And second, how many memories can be stored under biologically realistic conditions? Here we answer both questions by studying an attractor neural network in which inhibition and excitation balance each other. Using mean-field analysis, we derive a three-variable description of attractor networks. From this description it follows that irregular firing can exist only if the number of neurons involved in a memory is large. The same mean-field analysis also shows that the number of memories that can be stored in a network scales with the number of excitatory connections, a result that has been suggested for simple models but never shown for realistic ones. Both of these predictions are verified using simulations with large networks of spiking neurons.
COSMOS-e'-soft Higgsotic attractors
Choudhury, Sayantan
2017-07-01
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^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.
COSMOS-e"'-soft Higgsotic attractors
International Nuclear Information System (INIS)
Choudhury, Sayantan
2017-01-01
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"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.)
Optimal region of latching activity in an adaptive Potts model for networks of neurons
International Nuclear Information System (INIS)
Abdollah-nia, Mohammad-Farshad; Saeedghalati, Mohammadkarim; Abbassian, Abdolhossein
2012-01-01
In statistical mechanics, the Potts model is a model for interacting spins with more than two discrete states. Neural networks which exhibit features of learning and associative memory can also be modeled by a system of Potts spins. A spontaneous behavior of hopping from one discrete attractor state to another (referred to as latching) has been proposed to be associated with higher cognitive functions. Here we propose a model in which both the stochastic dynamics of Potts models and an adaptive potential function are present. A latching dynamics is observed in a limited region of the noise(temperature)–adaptation parameter space. We hence suggest noise as a fundamental factor in such alternations alongside adaptation. From a dynamical systems point of view, the noise–adaptation alternations may be the underlying mechanism for multi-stability in attractor-based models. An optimality criterion for realistic models is finally inferred
Attractors for discrete periodic dynamical systems
John E. Franke; James F. Selgrade
2003-01-01
A mathematical framework is introduced to study attractors of discrete, nonautonomous dynamical systems which depend periodically on time. A structure theorem for such attractors is established which says that the attractor of a time-periodic dynamical system is the unin of attractors of appropriate autonomous maps. If the nonautonomous system is a perturbation of an...
International Nuclear Information System (INIS)
Max, G
2011-01-01
Traffic models in computer networks can be described as a complicated system. These systems show non-linear features and to simulate behaviours of these systems are also difficult. Before implementing network equipments users wants to know capability of their computer network. They do not want the servers to be overloaded during temporary traffic peaks when more requests arrive than the server is designed for. As a starting point for our study a non-linear system model of network traffic is established to exam behaviour of the network planned. The paper presents setting up a non-linear simulation model that helps us to observe dataflow problems of the networks. This simple model captures the relationship between the competing traffic and the input and output dataflow. In this paper, we also focus on measuring the bottleneck of the network, which was defined as the difference between the link capacity and the competing traffic volume on the link that limits end-to-end throughput. We validate the model using measurements on a working network. The results show that the initial model estimates well main behaviours and critical parameters of the network. Based on this study, we propose to develop a new algorithm, which experimentally determines and predict the available parameters of the network modelled.
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.
Controlling Strange Attractor in Dynamics
Institute of Scientific and Technical Information of China (English)
无
2000-01-01
A nonlinear system which exhibits a strange attractor is considered, with the goal of illustrating how to control the chaotic dynamical system and to obtain a desired attracting periodic orbit by the OGY control algorithm.
Attractor behaviour in ELKO cosmology
International Nuclear Information System (INIS)
Basak, Abhishek; Bhatt, Jitesh R.; Shankaranarayanan, S.; Varma, K.V. Prasantha
2013-01-01
We study the dynamics of ELKO in the context of accelerated phase of our universe. To avoid the fine tuning problem associated with the initial conditions, it is required that the dynamical equations lead to an early-time attractor. In the earlier works, it was shown that the dynamical equations containing ELKO fields do not lead to early-time stable fixed points. In this work, using redefinition of variables, we show that ELKO cosmology admits early-time stable fixed points. More interestingly, we show that ELKO cosmology admit two sets of attractor points corresponding to slow and fast-roll inflation. The fast-roll inflation attractor point is unique for ELKO as it is independent of the form of the potential. We also discuss the plausible choice of interaction terms in these two sets of attractor points and constraints on the coupling constant
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.
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...
The power spectrum of inflationary attractors
International Nuclear Information System (INIS)
Broy, Benedict J.; Westphal, Alexander; Roest, Diederik
2014-08-01
Inflationary attractors predict the spectral index and tensor-to-scalar ratio to take specific values that are consistent with Planck. An example is the universal attractor for models with a generalised non-minimal coupling, leading to Starobinsky inflation. In this letter we demonstrate that it also predicts a specific relation between the amplitude of the power spectrum and the number of e-folds. The length and height of the inflationary plateau are related via the non-minimal coupling: in a wide variety of examples, the observed power normalisation leads to at least 55 flat e-foldings. Prior to this phase, the inflationary predictions vary and can account for the observational indications of power loss at large angular scales.
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...... the SID model’s behavior and impact on the network performance, as well as the severity of the infection spreading. The simulations are carried out in OPNET Modeler. The model provides an important input to epidemic connection recovery mechanisms, and can due to its flexibility and versatility be used...... to evaluate multiple epidemic scenarios in various network types....
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. .
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...
Noise-induced attractor annihilation in the delayed feedback logistic map
International Nuclear Information System (INIS)
Pisarchik, A.N.; Martínez-Zérega, B.E.
2013-01-01
We study dynamics of the bistable logistic map with delayed feedback, under the influence of white Gaussian noise and periodic modulation applied to the variable. This system may serve as a model to describe population dynamics under finite resources in noisy environment with seasonal fluctuations. While a very small amount of noise has no effect on the global structure of the coexisting attractors in phase space, an intermediate noise totally eliminates one of the attractors. Slow periodic modulation enhances the attractor annihilation.
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.
Suemitsu, Yoshikazu; Nara, Shigetoshi
2004-09-01
Chaotic dynamics introduced into a neural network model is applied to solving two-dimensional mazes, which are ill-posed problems. A moving object moves from the position at t to t + 1 by simply defined motion function calculated from firing patterns of the neural network model at each time step t. We have embedded several prototype attractors that correspond to the simple motion of the object orienting toward several directions in two-dimensional space in our neural network model. Introducing chaotic dynamics into the network gives outputs sampled from intermediate state points between embedded attractors in a state space, and these dynamics enable the object to move in various directions. System parameter switching between a chaotic and an attractor regime in the state space of the neural network enables the object to move to a set target in a two-dimensional maze. Results of computer simulations show that the success rate for this method over 300 trials is higher than that of random walk. To investigate why the proposed method gives better performance, we calculate and discuss statistical data with respect to dynamical structure.
Moduli backreaction on inflationary attractors
International Nuclear Information System (INIS)
Roest, Diederik; Werkman, Pelle
2016-07-01
We investigate the interplay between moduli dynamics and inflation, focusing on the KKLT- scenario and cosmological α-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 α-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 gravitino mass is independent from the inflationary scale with no fine-tuning of the parameters. 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.
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.
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.
Neural network modeling of chaotic dynamics in nuclear reactor flows
International Nuclear Information System (INIS)
Welstead, S.T.
1992-01-01
Neural networks have many scientific applications in areas such as pattern classification and time series prediction. The universal approximation property of these networks, however, can also be exploited to provide researchers with tool for modeling observed nonlinear phenomena. It has been shown that multilayer feed forward networks can capture important global nonlinear properties, such as chaotic dynamics, merely by training the network on a finite set of observed data. The network itself then provides a model of the process that generated the data. Characterizations such as the existence and general shape of a strange attractor and the sign of the largest Lyapunov exponent can then be extracted from the neural network model. In this paper, the author applies this idea to data generated from a nonlinear process that is representative of convective flows that can arise in nuclear reactor applications. Such flows play a role in forced convection heat removal from pressurized water reactors and boiling water reactors, and decay heat removal from liquid-metal-cooled reactors, either by natural convection or by thermosyphons
Hyperbolic geometry of cosmological attractors
Carrasco, John Joseph M.; Kallosh, Renata; Linde, Andrei; Roest, Diederik
2015-01-01
Cosmological alpha attractors give a natural explanation for the spectral index n(s) of inflation as measured by Planck while predicting a range for the tensor-to-scalar ratio r, consistent with all observations, to be measured more precisely in future B-mode experiments. We highlight the crucial
Attractors of multivalued semiflows generated by differential inclusions and their approximations
Directory of Open Access Journals (Sweden)
Alexei V. Kapustian
2000-01-01
Full Text Available We prove the existence of global compact attractors for differential inclusions and obtain some results concerning the continuity and upper semicontinuity of the attractors for approximating and perturbed inclusions. Applications are given to a model of regional economic growth.
Using periodic modulation to control coexisting attractors induced by delayed feedback
International Nuclear Information System (INIS)
Martinez-Zerega, B.E.; Pisarchik, A.N.; Tsimring, L.S.
2003-01-01
A delay in feedback can stabilize simultaneously several unstable periodic orbits embedded in a chaotic attractor. We show that by modulating the feedback variable it is possible to lock one of these states and eliminate other coexisting periodic attractors. The method is demonstrated with both a logistic map and a CO 2 laser model
Dynamical chaos and uniformly hyperbolic attractors: from mathematics to physics
Energy Technology Data Exchange (ETDEWEB)
Kuznetsov, Sergei P [Saratov Branch, Kotel' nikov Institute of Radio Engineering and Electronics, Russian Academy of Sciences, Saratov (Russian Federation)
2011-02-28
Research is reviewed on the identification and construction of physical systems with chaotic dynamics due to uniformly hyperbolic attractors (such as the Plykin attraction or the Smale-Williams solenoid). Basic concepts of the mathematics involved and approaches proposed in the literature for constructing systems with hyperbolic attractors are discussed. Topics covered include periodic pulse-driven models; dynamics models consisting of periodically repeated stages, each described by its own differential equations; the construction of systems of alternately excited coupled oscillators; the use of parametrically excited oscillations; and the introduction of delayed feedback. Some maps, differential equations, and simple mechanical and electronic systems exhibiting chaotic dynamics due to the presence of uniformly hyperbolic attractors are presented as examples. (reviews of topical problems)
Generation and control of multi-scroll chaotic attractors in fractional order systems
International Nuclear Information System (INIS)
Ahmad, Wajdi M.
2005-01-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
Strange attractor in the Potts spin glass on hierarchical lattices
Energy Technology Data Exchange (ETDEWEB)
Lima, Washington de [Universidade Federal de Pernambuco, Centro Acadêmico do Agreste, Pernambuco (Brazil); Camelo-Neto, G. [Universidade Federal de Alagoas, Núcleo de Ciências Exatas, Laboratório de Física Teórica e Computacional, CEP 57309-005 Arapiraca, Alagoas (Brazil); Coutinho, S., E-mail: sergio@ufpe.br [Universidade Federal de Pernambuco, Departamento de Física, Laboratório de Física Teórica e Computacional, Cidade Universitária, CEP 50670-901 Recife, Pernambuco (Brazil)
2013-11-29
The spin-glass q-state Potts model on d-dimensional diamond hierarchical lattices is investigated by an exact real space renormalization group scheme. Above a critical dimension d{sub l}(q) for q>2, the coupling constants probability distribution flows to a low-temperature strange attractor or to the high-temperature paramagnetic fixed point, according to the temperature is below or above the critical temperature T{sub c}(q,d). The strange attractor was investigated considering four initial different distributions for q=3 and d=5 presenting strong robustness in shape and temperature interval suggesting a condensed phase with algebraic decay.
Statistical properties of chaotic dynamical systems which exhibit strange attractors
International Nuclear Information System (INIS)
Jensen, R.V.; Oberman, C.R.
1981-07-01
A path integral method is developed for the calculation of the statistical properties of turbulent dynamical systems. The method is applicable to conservative systems which exhibit a transition to stochasticity as well as dissipative systems which exhibit strange attractors. A specific dissipative mapping is considered in detail which models the dynamics of a Brownian particle in a wave field with a broad frequency spectrum. Results are presented for the low order statistical moments for three turbulent regimes which exhibit strange attractors corresponding to strong, intermediate, and weak collisional damping
Statistical Models for Social Networks
Snijders, Tom A. B.; Cook, KS; Massey, DS
2011-01-01
Statistical models for social networks as dependent variables must represent the typical network dependencies between tie variables such as reciprocity, homophily, transitivity, etc. This review first treats models for single (cross-sectionally observed) networks and then for network dynamics. For
Attractors of equations of non-Newtonian fluid dynamics
International Nuclear Information System (INIS)
Zvyagin, V G; Kondrat'ev, S K
2014-01-01
This survey describes a version of the trajectory-attractor method, which is applied to study the limit asymptotic behaviour of solutions of equations of non-Newtonian fluid dynamics. The trajectory-attractor method emerged in papers of the Russian mathematicians Vishik and Chepyzhov and the American mathematician Sell under the condition that the corresponding trajectory spaces be invariant under the translation semigroup. The need for such an approach was caused by the fact that for many equations of mathematical physics for which the Cauchy initial-value problem has a global (weak) solution with respect to the time, the uniqueness of such a solution has either not been established or does not hold. In particular, this is the case for equations of fluid dynamics. At the same time, trajectory spaces invariant under the translation semigroup could not be constructed for many equations of non-Newtonian fluid dynamics. In this connection, a different approach to the construction of trajectory attractors for dissipative systems was proposed in papers of Zvyagin and Vorotnikov without using invariance of trajectory spaces under the translation semigroup and is based on the topological lemma of Shura-Bura. This paper presents examples of equations of non-Newtonian fluid dynamics (the Jeffreys system describing movement of the Earth's crust, the model of motion of weak aqueous solutions of polymers, a system with memory) for which the aforementioned construction is used to prove the existence of attractors in both the autonomous and the non-autonomous cases. At the beginning of the paper there is also a brief exposition of the results of Ladyzhenskaya on the existence of attractors of the two-dimensional Navier-Stokes system and the result of Vishik and Chepyzhov for the case of attractors of the three-dimensional Navier-Stokes system. Bibliography: 34 titles
Kuznetsov, N. V.; Leonov, G. A.; Yuldashev, M. V.; Yuldashev, R. V.
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.
Synchronous versus asynchronous modeling of gene regulatory networks.
Garg, Abhishek; Di Cara, Alessandro; Xenarios, Ioannis; Mendoza, Luis; De Micheli, Giovanni
2008-09-01
In silico modeling of gene regulatory networks has gained some momentum recently due to increased interest in analyzing the dynamics of biological systems. This has been further facilitated by the increasing availability of experimental data on gene-gene, protein-protein and gene-protein interactions. The two dynamical properties that are often experimentally testable are perturbations and stable steady states. Although a lot of work has been done on the identification of steady states, not much work has been reported on in silico modeling of cellular differentiation processes. In this manuscript, we provide algorithms based on reduced ordered binary decision diagrams (ROBDDs) for Boolean modeling of gene regulatory networks. Algorithms for synchronous and asynchronous transition models have been proposed and their corresponding computational properties have been analyzed. These algorithms allow users to compute cyclic attractors of large networks that are currently not feasible using existing software. Hereby we provide a framework to analyze the effect of multiple gene perturbation protocols, and their effect on cell differentiation processes. These algorithms were validated on the T-helper model showing the correct steady state identification and Th1-Th2 cellular differentiation process. The software binaries for Windows and Linux platforms can be downloaded from http://si2.epfl.ch/~garg/genysis.html.
Attractor mechanism as a distillation procedure
International Nuclear Information System (INIS)
Levay, Peter; Szalay, Szilard
2010-01-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.
Fibre inflation and α-attractors
Energy Technology Data Exchange (ETDEWEB)
Kallosh, Renata; Linde, Andrei [Stanford Univ., Stanford, CA (United States). Stanford Inst. for Theoretical Physics and Dept. of Physics; Leiden Univ. (Netherlands). Lorentz Inst. for Theoretical Physics; Roest, Diederik [Groningen Univ. (Netherlands). Van Swinderen Inst. for Particle Physics and Gravity; Westphal, Alexander [DESY, Hamburg (Germany). Theory Group; Yamada, Yusuke [Stanford Univ., Stanford, CA (United States). Stanford Inst. for Theoretical Physics and Dept. of Physics
2017-07-15
Fibre inflation is a specific string theory construction based on the Large Volume Scenario that produces an inflationary plateau. We outline its relation to α-attractor models for inflation, with the cosmological sector originating from certain string theory corrections leading to α=2 and α=1/2. Above a certain field range, the steepening effect of higher-order corrections leads first to the breakdown of single-field slow-roll and after that to the onset of 2-field dynamics: the overall volume of the extra dimensions starts to participate in the effective dynamics. Finally, we propose effective supergravity models of fibre inflation based on an D3 uplift term with a nilpotent superfield. Specific moduli dependent D3 induced geometries lead to cosmological fibre models but have in addition a de Sitter minimum exit. These supergravity models motivated by fibre inflation are relatively simple, stabilize the axions and disentangle the Hubble parameter from supersymmetry breaking.
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.
Coevolutionary modeling in network formation
Al-Shyoukh, Ibrahim; Chasparis, Georgios; Shamma, Jeff S.
2014-01-01
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.
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.
Modeling online social signed networks
Li, Le; Gu, Ke; Zeng, An; Fan, Ying; Di, Zengru
2018-04-01
People's online rating behavior can be modeled by user-object bipartite networks directly. However, few works have been devoted to reveal the hidden relations between users, especially from the perspective of signed networks. We analyze the signed monopartite networks projected by the signed user-object bipartite networks, finding that the networks are highly clustered with obvious community structure. Interestingly, the positive clustering coefficient is remarkably higher than the negative clustering coefficient. Then, a Signed Growing Network model (SGN) based on local preferential attachment is proposed to generate a user's signed network that has community structure and high positive clustering coefficient. Other structural properties of the modeled networks are also found to be similar to the empirical networks.
Lifetime of chaotic attractors in a multidimensional laser system
International Nuclear Information System (INIS)
Pando L, C.L.; Cerdeira, H.A.
1995-01-01
We study the lifetimes of chaotic attractors at crises in a multidimensional laser system. This system describes the CO 2 laser with modulated losses and is known as the four-level model. The critical exponents which are related to the lifetimes of the attractors are estimated in terms of the corresponding eigenvalues and the measured characteristic lifetime in the model. The critical exponents in this model and those of its center manifold version are in good agreement. We conjecture that generically in the four-level model the critical exponents are close to 1/2 at crises. In addition, we compare predictions of a simpler and popular model known as the two-level model with those of the above mentioned models. (author). 21 refs, 2 figs, 3 tabs
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.
Sourcing dark matter and dark energy from α-attractors
International Nuclear Information System (INIS)
Mishra, Swagat S.; Sahni, Varun; Shtanov, Yuri
2017-01-01
In [1], Kallosh and Linde drew attention to a new family of superconformal inflationary potentials, subsequently called α-attractors [2]. The α-attractor family can interpolate between a large class of inflationary models. It also has an important theoretical underpinning within the framework of supergravity. We demonstrate that the α-attractors have an even wider appeal since they may describe dark matter and perhaps even dark energy. The dark matter associated with the α-attractors, which we call α-dark matter (αDM), shares many of the attractive features of fuzzy dark matter, with V (φ) = ½ m 2 φ 2 , while having none of its drawbacks. Like fuzzy dark matter, αDM can have a large Jeans length which could resolve the cusp-core and substructure problems faced by standard cold dark matter. αDM also has an appealing tracker property which enables it to converge to the late-time dark matter asymptote, ( w ) ≅ 0, from a wide range of initial conditions. It thus avoids the enormous fine-tuning problems faced by the m 2 φ 2 potential in describing dark matter.
Sourcing dark matter and dark energy from α-attractors
Energy Technology Data Exchange (ETDEWEB)
Mishra, Swagat S.; Sahni, Varun [Inter-University Centre for Astronomy and Astrophysics, Post Bag 4, Ganeshkhind, Pune 411 007 (India); Shtanov, Yuri, E-mail: swagat@iucaa.in, E-mail: varun@iucaa.in, E-mail: shtanov@bitp.kiev.ua [Bogolyubov Institute for Theoretical Physics, Kiev 03680 (Ukraine)
2017-06-01
In [1], Kallosh and Linde drew attention to a new family of superconformal inflationary potentials, subsequently called α-attractors [2]. The α-attractor family can interpolate between a large class of inflationary models. It also has an important theoretical underpinning within the framework of supergravity. We demonstrate that the α-attractors have an even wider appeal since they may describe dark matter and perhaps even dark energy. The dark matter associated with the α-attractors, which we call α-dark matter (αDM), shares many of the attractive features of fuzzy dark matter, with V (φ) = ½ m {sup 2}φ{sup 2}, while having none of its drawbacks. Like fuzzy dark matter, αDM can have a large Jeans length which could resolve the cusp-core and substructure problems faced by standard cold dark matter. αDM also has an appealing tracker property which enables it to converge to the late-time dark matter asymptote, ( w ) ≅ 0, from a wide range of initial conditions. It thus avoids the enormous fine-tuning problems faced by the m {sup 2}φ{sup 2} potential in describing dark matter.
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.
A neighbourhood evolving network model
International Nuclear Information System (INIS)
Cao, Y.J.; Wang, G.Z.; Jiang, Q.Y.; Han, Z.X.
2006-01-01
Many social, technological, biological and economical systems are best described by evolved network models. In this short Letter, we propose and study a new evolving network model. The model is based on the new concept of neighbourhood connectivity, which exists in many physical complex networks. The statistical properties and dynamics of the proposed model is analytically studied and compared with those of Barabasi-Albert scale-free model. Numerical simulations indicate that this network model yields a transition between power-law and exponential scaling, while the Barabasi-Albert scale-free model is only one of its special (limiting) cases. Particularly, this model can be used to enhance the evolving mechanism of complex networks in the real world, such as some social networks development
Bifurcation and category learning in network models of oscillating cortex
Baird, Bill
1990-06-01
A genetic model of oscillating cortex, which assumes “minimal” coupling justified by known anatomy, is shown to function as an associative memory, using previously developed theory. The network has explicit excitatory neurons with local inhibitory interneuron feedback that forms a set of nonlinear oscillators coupled only by long-range excitatory connections. Using a local Hebb-like learning rule for primary and higher-order synapses at the ends of the long-range connections, the system learns to store the kinds of oscillation amplitude patterns observed in olfactory and visual cortex. In olfaction, these patterns “emerge” during respiration by a pattern forming phase transition which we characterize in the model as a multiple Hopf bifurcation. We argue that these bifurcations play an important role in the operation of real digital computers and neural networks, and we use bifurcation theory to derive learning rules which analytically guarantee CAM storage of continuous periodic sequences-capacity: N/2 Fourier components for an N-node network-no “spurious” attractors.
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.)
Logical Attractors: a Boolean Approach to the Dynamics of Psychosis
Kupper, Z.; Hoffmann, H.
A Boolean modeling approach to attractors in the dynamics of psychosis is presented: Kinetic Logic, originating from R. Thomas, describes systems on an intermediate level between a purely verbal, qualitative description and a description using nonlinear differential equations. With this method we may model impact, feedback and temporal evolution, as well as analyze the resulting attractors. In our previous research the method has been applied to general and more specific questions in the dynamics of psychotic disorders. In this paper a model is introduced that describes different dynamical patterns of chronic psychosis in the context of vocational rehabilitation. It also shows to be useful in formulating and exploring possible treatment strategies. Finally, some of the limitations and benefits of Kinetic Logic as a modeling tool for psychology and psychiatry are discussed.
Using attractiveness model for actors ranking in social media networks.
Qasem, Ziyaad; Jansen, Marc; Hecking, Tobias; Hoppe, H Ulrich
2017-01-01
Influential actors detection in social media such as Twitter or Facebook can play a major role in gathering opinions on particular topics, improving the marketing efficiency, predicting the trends, etc. This work aims to extend our formally defined T measure to present a new measure aiming to recognize the actor's influence by the strength of attracting new important actors into a networked community. Therefore, we propose a model of the actor's influence based on the attractiveness of the actor in relation to the number of other attractors with whom he/she has established connections over time. Using an empirically collected social network for the underlying graph, we have applied the above-mentioned measure of influence in order to determine optimal seeds in a simulation of influence maximization. We study our extended measure in the context of information diffusion because this measure is based on a model of actors who attract others to be active members in a community. This corresponds to the idea of the IC simulation model which is used to identify the most important spreaders in a set of actors.
Sequences by Metastable Attractors: Interweaving Dynamical Systems and Experimental Data
Directory of Open Access Journals (Sweden)
Axel Hutt
2017-05-01
Full Text Available Metastable attractors and heteroclinic orbits are present in the dynamics of various complex systems. Although their occurrence is well-known, their identification and modeling is a challenging task. The present work reviews briefly the literature and proposes a novel combination of their identification in experimental data and their modeling by dynamical systems. This combination applies recurrence structure analysis permitting the derivation of an optimal symbolic representation of metastable states and their dynamical transitions. To derive heteroclinic sequences of metastable attractors in various experimental conditions, the work introduces a Hausdorff clustering algorithm for symbolic dynamics. The application to brain signals (event-related potentials utilizing neural field models illustrates the methodology.
Jiang, T; Jiang, C-Y; Shu, J-H; Xu, Y-J
2017-07-10
The molecular mechanism of nasopharyngeal carcinoma (NPC) is poorly understood and effective therapeutic approaches are needed. This research aimed to excavate the attractor modules involved in the progression of NPC and provide further understanding of the underlying mechanism of NPC. Based on the gene expression data of NPC, two specific protein-protein interaction networks for NPC and control conditions were re-weighted using Pearson correlation coefficient. Then, a systematic tracking of candidate modules was conducted on the re-weighted networks via cliques algorithm, and a total of 19 and 38 modules were separately identified from NPC and control networks, respectively. Among them, 8 pairs of modules with similar gene composition were selected, and 2 attractor modules were identified via the attract method. Functional analysis indicated that these two attractor modules participate in one common bioprocess of cell division. Based on the strategy of integrating systemic module inference with the attract method, we successfully identified 2 attractor modules. These attractor modules might play important roles in the molecular pathogenesis of NPC via affecting the bioprocess of cell division in a conjunct way. Further research is needed to explore the correlations between cell division and NPC.
Chaotic Attractor Crisis and Climate Sensitivity: a Transfer Operator Approach
Tantet, A.; Lucarini, V.; Lunkeit, F.; Dijkstra, H. A.
2015-12-01
The rough response to a smooth parameter change of some non-chaotic climate models, such as the warm to snowball-Earth transition in energy balance models due to the ice-albedo feedback, can be studied in the framework of bifurcation theory, in particular by analysing the Lyapunov spectrum of fixed points or periodic orbits. However, bifurcation theory is of little help to study the destruction of a chaotic attractor which can occur in high-dimensional General Circulation Models (GCM). Yet, one would expect critical slowing down to occur before the crisis, since, as the system becomes susceptible to the physical instability mechanism responsible for the crisis, it turns out to be less and less resilient to exogenous perturbations and to spontaneous fluctuations due to other types of instabilities on the attractor. The statistical physics framework, extended to nonequilibrium systems, is particularly well suited for the study of global properties of chaotic and stochastic systems. In particular, the semigroup of transfer operators governs the evolution of distributions in phase space and its spectrum characterises both the relaxation rate of distributions to a statistical steady-state and the stability of this steady-state to perturbations. If critical slowing down indeed occurs in the approach to an attractor crisis, the gap in the spectrum of the semigroup of transfer operators is expected to shrink. We show that the chaotic attractor crisis due to the ice-albedo feedback and resulting in a transition from a warm to a snowball-Earth in the Planet Simulator (PlaSim), a GCM of intermediate complexity, is associated with critical slowing down, as observed by the slower decay of correlations before the crisis (cf. left panel). In addition, we demonstrate that this critical slowing down can be traced back to the shrinkage of the gap between the leading eigenvalues of coarse-grained approximations of the transfer operators and that these eigenvalues capture the
Developing Personal Network Business Models
DEFF Research Database (Denmark)
Saugstrup, Dan; Henten, Anders
2006-01-01
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...
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.
Mathematical Modelling Plant Signalling Networks
Muraro, D.; Byrne, H.M.; King, J.R.; Bennett, M.J.
2013-01-01
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
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.
Exponential attractors for a nonclassical diffusion equation
Directory of Open Access Journals (Sweden)
Qiaozhen Ma
2009-01-01
Full Text Available In this article, we prove the existence of exponential attractors for a nonclassical diffusion equation in ${H^{2}(Omega}cap{H}^{1}_{0}(Omega$ when the space dimension is less than 4.
Feigenbaum attractor and intermittency in particle collisions
International Nuclear Information System (INIS)
Batunin, A.V.
1992-01-01
The hypothesis is proposed that the Feigenbaum attractor arising as a limit set in an infinite pichfork bifurcation sequence for unimodal one-dimensional maps underlies the intermittency phenomena in particle collisions. 23 refs.; 8 figs
Reduction of Dietrich-Ruina attractors to unimodal maps
Directory of Open Access Journals (Sweden)
S. Shkoller
1997-01-01
Full Text Available We present a geometric analysis of a quasi-static single degree of freedom elastic slider with a state and rate dependent friction law. In particular, we examine and characterize the regime of chaotic motions displayed by the Dieterich-Ruina model. We do so by numerically reducing the chaotic attractors to a family of unimodal maps and discuss why this suggests complex behaviour in the dynamical system.
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
Oscillatory attractors: a new cosmological phase
Energy Technology Data Exchange (ETDEWEB)
Bains, Jasdeep S. [Center for the Fundamental Laws of Nature, Harvard University, 17 Oxford St, Cambridge, MA 02138 (United States); Hertzberg, Mark P. [Institute of Cosmology, Department of Physics and Astronomy, Tufts University, 574 Boston Ave, Medford, MA 02155 (United States); Wilczek, Frank, E-mail: bains@physics.harvard.edu, E-mail: mark.hertzberg@tufts.edu, E-mail: wilczek@mit.edu [Center for Theoretical Physics, Department of Physics, MIT, 77 Massachusetts Ave, Cambridge, MA 02139 (United States)
2017-05-01
In expanding FRW spacetimes, it is usually the case that homogeneous scalar fields redshift and their amplitudes approach limiting values: Hubble friction usually ensures that the field relaxes to its minimum energy configuration, which is usually a static configuration. Here we discover a class of relativistic scalar field models in which the attractor behavior is the field oscillating indefinitely, with finite amplitude, in an expanding FRW spacetime, despite the presence of Hubble friction. This is an example of spontaneous breaking of time translation symmetry. We find that the effective equation of state of the field has average value ( w )=−1, implying that the field itself could drive an inflationary or dark energy dominated phase. This behavior is reminiscent of ghost condensate models, but in the new models, unlike in the ghost condensate models, the energy-momentum tensor is time dependent, so that these new models embody a more definitive breaking of time translation symmetry. We explore (quantum) fluctuations around the homogeneous background solution, and find that low k -modes can be stable, while high k -modes are typically unstable. We discuss possible interpretations and implications of that instability.
Determining the flexibility of regular and chaotic attractors
International Nuclear Information System (INIS)
Marhl, Marko; Perc, Matjaz
2006-01-01
We present an overview of measures that are appropriate for determining the flexibility of regular and chaotic attractors. In particular, we focus on those system properties that constitute its responses to external perturbations. We deploy a systematic approach, first introducing the simplest measure given by the local divergence of the system along the attractor, and then develop more rigorous mathematical tools for estimating the flexibility of the system's dynamics. The presented measures are tested on the regular Brusselator and chaotic Hindmarsh-Rose model of an excitable neuron with equal success, thus indicating the overall effectiveness and wide applicability range of the proposed theory. Since responses of dynamical systems to external signals are crucial in several scientific disciplines, and especially in natural sciences, we discuss several important aspects and biological implications of obtained results
Quintessential inflation with α-attractors
Energy Technology Data Exchange (ETDEWEB)
Dimopoulos, Konstantinos; Owen, Charlotte, E-mail: k.dimopoulos1@lancaster.ac.uk, E-mail: c.owen@lancaster.ac.uk [Consortium for Fundamental Physics, Physics Department, Lancaster University, Lancaster LA1 4YB (United Kingdom)
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.
Fibre inflation and α-attractors
Kallosh, Renata; Linde, Andrei; Roest, Diederik; Westphal, Alexander; Yamada, Yusuke
2018-02-01
Fibre inflation is a specific string theory construction based on the Large Volume Scenario that produces an inflationary plateau. We outline its relation to α-attractor models for inflation, with the cosmological sector originating from certain string theory corrections leading to α = 2 and α = 1/2. Above a certain field range, the steepening effect of higher-order corrections leads first to the breakdown of single-field slow-roll and after that to the onset of 2-field dynamics: the overall volume of the extra dimensions starts to participate in the effective dynamics. Finally, we propose effective supergravity models of fibre inflation based on an \\overline{D3} uplift term with a nilpotent superfield. Specific moduli dependent \\overline{D3} induced geometries lead to cosmological fibre models but have in addition a de Sitter minimum exit. These supergravity models motivated by fibre inflation are relatively simple, stabilize the axions and disentangle the Hubble parameter from supersymmetry breaking.
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.
Global attractors and extinction dynamics of cyclically competing species.
Rulands, Steffen; Zielinski, Alejandro; Frey, Erwin
2013-05-01
Transitions to absorbing states are of fundamental importance in nonequilibrium physics as well as ecology. In ecology, absorbing states correspond to the extinction of species. We here study the spatial population dynamics of three cyclically interacting species. The interaction scheme comprises both direct competition between species as in the cyclic Lotka-Volterra model, and separated selection and reproduction processes as in the May-Leonard model. We show that the dynamic processes leading to the transient maintenance of biodiversity are closely linked to attractors of the nonlinear dynamics for the overall species' concentrations. The characteristics of these global attractors change qualitatively at certain threshold values of the mobility and depend on the relative strength of the different types of competition between species. They give information about the scaling of extinction times with the system size and thereby the stability of biodiversity. We define an effective free energy as the negative logarithm of the probability to find the system in a specific global state before reaching one of the absorbing states. The global attractors then correspond to minima of this effective energy landscape and determine the most probable values for the species' global concentrations. As in equilibrium thermodynamics, qualitative changes in the effective free energy landscape indicate and characterize the underlying nonequilibrium phase transitions. We provide the complete phase diagrams for the population dynamics and give a comprehensive analysis of the spatio-temporal dynamics and routes to extinction in the respective phases.
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.
Supersymmetry, attractors and cosmic censorship
Energy Technology Data Exchange (ETDEWEB)
Bellorin, Jorge [Instituto de Fisica Teorica UAM/CSIC, Facultad de Ciencias C-XVI, C.U. Cantoblanco, E-28049 Madrid (Spain)]. E-mail: jorge.bellorin@uam.es; Meessen, Patrick [Instituto de Fisica Teorica UAM/CSIC, Facultad de Ciencias C-XVI, C.U. Cantoblanco, E-28049 Madrid (Spain)]. E-mail: patrick.meessen@cern.ch; Ortin, Tomas [Instituto de Fisica Teorica UAM/CSIC, Facultad de Ciencias C-XVI, C.U. Cantoblanco, E-28049 Madrid (Spain)]. E-mail: tomas.ortin@cern.ch
2007-01-29
We show that requiring unbroken supersymmetry everywhere in black-hole-type solutions of N=2, d=4 supergravity coupled to vector supermultiplets ensures in most cases absence of naked singularities. We formulate three specific conditions which we argue are equivalent to the requirement of global supersymmetry. These three conditions can be related to the absence of sources for NUT charge, angular momentum, scalar hair and negative energy, although the solutions can still have globally defined angular momentum and non-trivial scalar fields, as we show in an explicit example. Furthermore, only the solutions satisfying these requirements seem to have a microscopic interpretation in string theory since only they have supersymmetric sources. These conditions exclude, for instance, singular solutions such as the Kerr-Newman with M=|q|, which fails to be everywhere supersymmetric. We also present a re-derivation of several results concerning attractors in N=2, d=4 theories based on the explicit knowledge of the most general solutions in the timelike class.
Generalized Network Psychometrics : Combining Network and Latent Variable Models
Epskamp, S.; Rhemtulla, M.; Borsboom, D.
2017-01-01
We introduce the network model as a formal psychometric model, conceptualizing the covariance between psychometric indicators as resulting from pairwise interactions between observable variables in a network structure. This contrasts with standard psychometric models, in which the covariance between
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. PMID:28572780
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.
Modeling of fluctuating reaction networks
International Nuclear Information System (INIS)
Lipshtat, A.; Biham, O.
2004-01-01
Full Text:Various dynamical systems are organized as reaction networks, where the population size of one component affects the populations of all its neighbors. Such networks can be found in interstellar surface chemistry, cell biology, thin film growth and other systems. I cases where the populations of reactive species are large, the network can be modeled by rate equations which provide all reaction rates within mean field approximation. However, in small systems that are partitioned into sub-micron size, these populations strongly fluctuate. Under these conditions rate equations fail and the master equation is needed for modeling these reactions. However, the number of equations in the master equation grows exponentially with the number of reactive species, severely limiting its feasibility for complex networks. Here we present a method which dramatically reduces the number of equations, thus enabling the incorporation of the master equation in complex reaction networks. The method is examplified in the context of reaction network on dust grains. Its applicability for genetic networks will be discussed. 1. Efficient simulations of gas-grain chemistry in interstellar clouds. Azi Lipshtat and Ofer Biham, Phys. Rev. Lett. 93 (2004), 170601. 2. Modeling of negative autoregulated genetic networks in single cells. Azi Lipshtat, Hagai B. Perets, Nathalie Q. Balaban and Ofer Biham, Gene: evolutionary genomics (2004), In press
Stochastic Boolean networks: An efficient approach to modeling gene regulatory networks
Directory of Open Access Journals (Sweden)
Liang Jinghang
2012-08-01
network inferred from a T cell immune response dataset. An SBN can also implement the function of an asynchronous PBN and is potentially useful in a hybrid approach in combination with a continuous or single-molecule level stochastic model. Conclusions Stochastic Boolean networks (SBNs are proposed as an efficient approach to modelling gene regulatory networks (GRNs. The SBN approach is able to recover biologically-proven regulatory behaviours, such as the oscillatory dynamics of the p53-Mdm2 network and the dynamic attractors in a T cell immune response network. The proposed approach can further predict the network dynamics when the genes are under perturbation, thus providing biologically meaningful insights for a better understanding of the dynamics of GRNs. The algorithms and methods described in this paper have been implemented in Matlab packages, which are attached as Additional files.
Generalized pole inflation: Hilltop, natural, and chaotic inflationary attractors
Energy Technology Data Exchange (ETDEWEB)
Terada, Takahiro, E-mail: takahiro.terada@apctp.org [Department of Physics, The University of Tokyo, Tokyo 113-0033 (Japan); Asia Pacific Center for Theoretical Physics, Pohang 37673 (Korea, Republic of)
2016-09-10
A reformulation of inflationary model analyses appeared recently, in which inflationary observables are determined by the structure of a pole in the inflaton kinetic term rather than the shape of the inflaton potential. We comprehensively study this framework with an arbitrary order of the pole taking into account possible additional poles in the kinetic term or in the potential. Depending on the setup, the canonical potential becomes the form of hilltop or plateau models, variants of natural inflation, power-law inflation, or monomial/polynomial chaotic inflation. We demonstrate attractor behaviors of these models and compute corrections from the additional poles to the inflationary observables.
Some statistical properties of strange attractors: engineering view
International Nuclear Information System (INIS)
Mijangos, M; Kontorovich, V; Aguilar-Torrentera, J
2008-01-01
In this paper, the statistical characterization of strange attractors is investigated via the so-called 'model distribution' approach. It is shown that in order to calculate the first four cumulants, which are necessary to create a model distribution of kurtosis approximation, a systematic method for the calculus of the variance needs to be considered. Correspondently, an analytical method based on the Kolmogorov-Sinai (K-S) entropy for variance approximation is herein proposed. The methodology is of interest for its application in the statistical analysis of chaotic systems that model physical phenomena found in some areas of electrical (communication) engineering
Black hole attractors and pure spinors
International Nuclear Information System (INIS)
Hsu, Jonathan P.; Maloney, Alexander; Tomasiello, Alessandro
2006-01-01
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 Σf k = Im(CΦ), where Φ is a pure spinor of odd (even) chirality in IIB (A). For IIB on a Calabi-Yau, Φ = Ω and the equation reduces to the usual one. Methods in generalized complex geometry can be used to study solutions to the attractor equation
Black Hole Attractors and Pure Spinors
International Nuclear Information System (INIS)
Hsu, Jonathan P.; Maloney, Alexander; Tomasiello, Alessandro
2006-01-01
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 Σf k = Im(CΦ), where Φ is a pure spinor of odd (even) chirality in IIB (A). For IIB on a Calabi-Yau, Φ = (Omega) and the equation reduces to the usual one. Methods in generalized complex geometry can be used to study solutions to the attractor equation
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
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.
Non-linguistic Conditions for Causativization as a Linguistic Attractor
Johanna Nichols; Johanna Nichols; Johanna Nichols
2018-01-01
An attractor, in complex systems theory, is any state that is more easily or more often entered or acquired than departed or lost; attractor states therefore accumulate more members than non-attractors, other things being equal. In the context of language evolution, linguistic attractors include sounds, forms, and grammatical structures that are prone to be selected when sociolinguistics and language contact make it possible for speakers to choose between competing forms. The reasons why an e...
Current approaches to gene regulatory network modelling
Directory of Open Access Journals (Sweden)
Brazma Alvis
2007-09-01
Full Text Available Abstract Many different approaches have been developed to model and simulate gene regulatory networks. We proposed the following categories for gene regulatory network models: network parts lists, network topology models, network control logic models, and dynamic models. Here we will describe some examples for each of these categories. We will study the topology of gene regulatory networks in yeast in more detail, comparing a direct network derived from transcription factor binding data and an indirect network derived from genome-wide expression data in mutants. Regarding the network dynamics we briefly describe discrete and continuous approaches to network modelling, then describe a hybrid model called Finite State Linear Model and demonstrate that some simple network dynamics can be simulated in this model.
Connecting coherent structures and strange attractors
Keefe, Laurence R.
1990-01-01
A concept of turbulence derived from nonlinear dynamical systems theory suggests that turbulent solutions to the Navier-Stokes equations are restricted to strange attractors, and, by implication, that turbulent phenomenology must find some expression or source in the structure of these mathematical objects. Examples and discussions are presented to link coherent structures to some of the commonly known characteristics of strange attractors. Basic to this link is a geometric interpretation of conditional sampling techniques employed to educe coherent structures that offers an explanation for their appearance in measurements as well as their size.
Periodic dynamics in queuing networks
Energy Technology Data Exchange (ETDEWEB)
Addabbo, Tommaso [Information Engineering Department, University of Siena, Via Roma 56, 53100 Siena (Italy)], E-mail: addabbo@dii.unisi.it; Kocarev, Ljupco [Macedonian Academy of Sciences and Arts, bul. Krste Misirkov 2, P.O. Box 428, 1000 Skopje, Republic of Macedonia (Macedonia, The Former Yugoslav Republic of)], E-mail: lkocarev@ucsd.edu
2009-08-30
This paper deals with state-dependent open Markovian (or exponential) queuing networks, for which arrival and service rates, as well as routing probabilities, may depend on the queue lengths. For a network of this kind, following Mandelbaum and Pats, we provide a formal definition of its associated fluid model, and we focus on the relationships which may occur between the network stochastic dynamics and the deterministic dynamics of its corresponding fluid model, particularly focusing on queuing networks whose fluid models have global periodic attractors.
Applying Chaos Theory to Careers: Attraction and Attractors
Pryor, Robert G. L.; Bright, Jim E. H.
2007-01-01
This article presents the Chaos Theory of Careers with particular reference to the concepts of "attraction" and "attractors". Attractors are defined in terms of characteristic trajectories, feedback mechanisms, end states, ordered boundedness, reality visions and equilibrium and fluctuation. The identified types of attractors (point, pendulum,…
Griffin: A Tool for Symbolic Inference of Synchronous Boolean Molecular Networks
Directory of Open Access Journals (Sweden)
Stalin Muñoz
2018-03-01
Full Text Available Boolean networks are important models of biochemical systems, located at the high end of the abstraction spectrum. A number of Boolean gene networks have been inferred following essentially the same method. Such a method first considers experimental data for a typically underdetermined “regulation” graph. Next, Boolean networks are inferred by using biological constraints to narrow the search space, such as a desired set of (fixed-point or cyclic attractors. We describe Griffin, a computer tool enhancing this method. Griffin incorporates a number of well-established algorithms, such as Dubrova and Teslenko's algorithm for finding attractors in synchronous Boolean networks. In addition, a formal definition of regulation allows Griffin to employ “symbolic” techniques, able to represent both large sets of network states and Boolean constraints. We observe that when the set of attractors is required to be an exact set, prohibiting additional attractors, a naive Boolean coding of this constraint may be unfeasible. Such cases may be intractable even with symbolic methods, as the number of Boolean constraints may be astronomically large. To overcome this problem, we employ an Artificial Intelligence technique known as “clause learning” considerably increasing Griffin's scalability. Without clause learning only toy examples prohibiting additional attractors are solvable: only one out of seven queries reported here is answered. With clause learning, by contrast, all seven queries are answered. We illustrate Griffin with three case studies drawn from the Arabidopsis thaliana literature. Griffin is available at: http://turing.iimas.unam.mx/griffin.
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...... reporting formats, along with a tested process that facilitates the production of a wide range of analytical products for civilian, military, and hybrid intelligence environments. Readers will learn how to perform the specific actions of problem definition modeling, target network modeling......, 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...
Recurrence quantification analysis in Liu's attractor
International Nuclear Information System (INIS)
Balibrea, Francisco; Caballero, M. Victoria; Molera, Lourdes
2008-01-01
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
On the control of the chaotic attractors of the 2-d Navier-Stokes equations.
Smaoui, Nejib; Zribi, Mohamed
2017-03-01
The control problem of the chaotic attractors of the two dimensional (2-d) Navier-Stokes (N-S) equations is addressed in this paper. First, the Fourier Galerkin method based on a reduced-order modelling approach developed by Chen and Price is applied to the 2-d N-S equations to construct a fifth-order system of nonlinear ordinary differential equations (ODEs). The dynamics of the fifth-order system was studied by analyzing the system's attractor for different values of Reynolds number, R e . Then, control laws are proposed to drive the states of the ODE system to a desired attractor. Finally, an adaptive controller is designed to synchronize two reduced order ODE models having different Reynolds numbers and starting from different initial conditions. Simulation results indicate that the proposed control schemes work well.
Far-from-equilibrium attractors and nonlinear dynamical systems approach to the Gubser flow
Behtash, Alireza; Cruz-Camacho, C. N.; Martinez, M.
2018-02-01
The nonequilibrium attractors of systems undergoing Gubser flow within relativistic kinetic theory are studied. In doing so we employ well-established methods of nonlinear dynamical systems which rely on finding the fixed points, investigating the structure of the flow diagrams of the evolution equations, and characterizing the basin of attraction using a Lyapunov function near the stable fixed points. We obtain the attractors of anisotropic hydrodynamics, Israel-Stewart (IS) and transient fluid (DNMR) theories and show that they are indeed nonplanar and the basin of attraction is essentially three dimensional. The attractors of each hydrodynamical model are compared with the one obtained from the exact Gubser solution of the Boltzmann equation within the relaxation time approximation. We observe that the anisotropic hydrodynamics is able to match up to high numerical accuracy the attractor of the exact solution while the second-order hydrodynamical theories fail to describe it. We show that the IS and DNMR asymptotic series expansions diverge and use resurgence techniques to perform the resummation of these divergences. We also comment on a possible link between the manifold of steepest descent paths in path integrals and the basin of attraction for the attractors via Lyapunov functions that opens a new horizon toward an effective field theory description of hydrodynamics. Our findings indicate that the reorganization of the expansion series carried out by anisotropic hydrodynamics resums the Knudsen and inverse Reynolds numbers to all orders and thus, it can be understood as an effective theory for the far-from-equilibrium fluid dynamics.
Free association transitions in models of cortical latching dynamics
International Nuclear Information System (INIS)
Russo, Eleonora; Treves, Alessandro; Kropff, Emilio; Namboodiri, Vijay M K
2008-01-01
Potts networks, in certain conditions, hop spontaneously from one discrete attractor state to another, a process we have called latching dynamics. When continuing indefinitely, latching can serve as a model of infinite recursion, which is nontrivial if the matrix of transition probabilities presents a structure, i.e. a rudimentary grammar. We show here, with computer simulations, that latching transitions cluster in a number of distinct classes: effectively random transitions between weakly correlated attractors; structured, history-dependent transitions between attractors with intermediate correlations; and oscillations between pairs of closely overlapping attractors. Each type can be described by a reduced set of equations of motion, which, once numerically integrated, matches simulations results. We propose that the analysis of such equations may offer clues on how to embed meaningful grammatical structures into more realistic models of specific recursive processes
Free association transitions in models of cortical latching dynamics
Energy Technology Data Exchange (ETDEWEB)
Russo, Eleonora; Treves, Alessandro; Kropff, Emilio [SISSA, Cognitive Neuroscience, via Beirut 4, 34014 Trieste (Italy); Namboodiri, Vijay M K [Department of Physics, IIT Bombay, Powai, Mumbai, India 400076 (India)], E-mail: russo@sissa.it, E-mail: vijay_mkn@iitb.ac.in, E-mail: ale@sissa.it, E-mail: kropff@sissa.it
2008-01-15
Potts networks, in certain conditions, hop spontaneously from one discrete attractor state to another, a process we have called latching dynamics. When continuing indefinitely, latching can serve as a model of infinite recursion, which is nontrivial if the matrix of transition probabilities presents a structure, i.e. a rudimentary grammar. We show here, with computer simulations, that latching transitions cluster in a number of distinct classes: effectively random transitions between weakly correlated attractors; structured, history-dependent transitions between attractors with intermediate correlations; and oscillations between pairs of closely overlapping attractors. Each type can be described by a reduced set of equations of motion, which, once numerically integrated, matches simulations results. We propose that the analysis of such equations may offer clues on how to embed meaningful grammatical structures into more realistic models of specific recursive processes.
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
with the neighborhood of that cycle. We show how the equilibrium point of a relay system disappears in a boundary-equilibrium bifurcation as the system enters the region of autonomous switching dynamics and demonstrate experimentally how a relay system can exhibit large amplitude chaotic oscillations at high values...... 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....
Szejka, Agnes; Drossel, Barbara
2010-02-01
We study the evolution of Boolean networks as model systems for gene regulation. Inspired by biological networks, we select simultaneously for robust attractors and for the ability to respond to external inputs by changing the attractor. Mutations change the connections between the nodes and the update functions. In order to investigate the influence of the type of update functions, we perform our simulations with canalizing as well as with threshold functions. We compare the properties of the fitness landscapes that result for different versions of the selection criterion and the update functions. We find that for all studied cases the fitness landscape has a plateau with maximum fitness resulting in the fact that structurally very different networks are able to fulfill the same task and are connected by neutral paths in network (“genotype”) space. We find furthermore a connection between the attractor length and the mutational robustness, and an extremely long memory of the initial evolutionary stage.
Continuum Model for River Networks
Giacometti, Achille; Maritan, Amos; Banavar, Jayanth R.
1995-07-01
The effects of erosion, avalanching, and random precipitation are captured in a simple stochastic partial differential equation for modeling the evolution of river networks. Our model leads to a self-organized structured landscape and to abstraction and piracy of the smaller tributaries as the evolution proceeds. An algebraic distribution of the average basin areas and a power law relationship between the drainage basin area and the river length are found.
Reconstructing a f ( R ) theory from the α-Attractors
Energy Technology Data Exchange (ETDEWEB)
Miranda, T.; Fabris, J. C.; Piattella, O. F., E-mail: tays.andrade@aluno.ufes.br, E-mail: oliver.piattella@pq.cnpq.br, E-mail: fabris@pq.cnpq.br [Department of Physics, Universidade Federal do Espírito Santo, avenida Fernando Ferrari 514, 29075-910 Vitória, Espírito Santo (Brazil)
2017-09-01
We show an analogy at high curvature between a f ( R ) = R + aR {sup n} {sup −} {sup 1} + bR {sup 2} theory and the α-Attractors. We calculate the expressions of the parameters a , b and n as functions of α and the predictions of the model f ( R ) = R + aR {sup n} {sup −} {sup 1} + bR {sup 2} on the scalar spectral index n {sub s} and the tensor-to-scalar ratio r . We find that the power law correction R {sup n} {sup −} {sup 1} allows for a production of gravitational waves enhanced with respect to the one in the Starobinsky model, while maintaining a viable prediction on n {sub s}. We numerically reconstruct the full α-Attractors class of models testing the goodness of our high-energy approximation f ( R ) = R + aR {sup n} {sup −} {sup 1} + bR {sup 2}. Moreover, we also investigate the case of a single power law f ( R ) = γ R {sup 2} {sup −} {sup δ} theory, with γ and δ free parameters. We calculate analytically the predictions of this model on the scalar spectral index n {sub s} and the tensor-to-scalar ratio r and the values of δ which are allowed from the current observational results. We find that −0.015 < δ < 0.016, confirming once again the excellent agreement between the Starobinsky model and observation.
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.
You, Hongzhi; Wang, Da-Hui
2017-01-01
Neural networks configured with winner-take-all (WTA) competition and N-methyl-D-aspartate receptor (NMDAR)-mediated synaptic dynamics are endowed with various dynamic characteristics of attractors underlying many cognitive functions. This paper presents a novel method for neuromorphic implementation of a two-variable WTA circuit with NMDARs aimed at implementing decision-making, working memory and hysteresis in visual perceptions. The method proposed is a dynamical system approach of circuit synthesis based on a biophysically plausible WTA model. Notably, slow and non-linear temporal dynamics of NMDAR-mediated synapses was generated. Circuit simulations in Cadence reproduced ramping neural activities observed in electrophysiological recordings in experiments of decision-making, the sustained activities observed in the prefrontal cortex during working memory, and classical hysteresis behavior during visual discrimination tasks. Furthermore, theoretical analysis of the dynamical system approach illuminated the underlying mechanisms of decision-making, memory capacity and hysteresis loops. The consistence between the circuit simulations and theoretical analysis demonstrated that the WTA circuit with NMDARs was able to capture the attractor dynamics underlying these cognitive functions. Their physical implementations as elementary modules are promising for assembly into integrated neuromorphic cognitive systems.
Network modelling methods for FMRI.
Smith, Stephen M; Miller, Karla L; Salimi-Khorshidi, Gholamreza; Webster, Matthew; Beckmann, Christian F; Nichols, Thomas E; Ramsey, Joseph D; Woolrich, Mark W
2011-01-15
There is great interest in estimating brain "networks" from FMRI data. This is often attempted by identifying a set of functional "nodes" (e.g., spatial ROIs or ICA maps) and then conducting a connectivity analysis between the nodes, based on the FMRI timeseries associated with the nodes. Analysis methods range from very simple measures that consider just two nodes at a time (e.g., correlation between two nodes' timeseries) to sophisticated approaches that consider all nodes simultaneously and estimate one global network model (e.g., Bayes net models). Many different methods are being used in the literature, but almost none has been carefully validated or compared for use on FMRI timeseries data. In this work we generate rich, realistic simulated FMRI data for a wide range of underlying networks, experimental protocols and problematic confounds in the data, in order to compare different connectivity estimation approaches. Our results show that in general correlation-based approaches can be quite successful, methods based on higher-order statistics are less sensitive, and lag-based approaches perform very poorly. More specifically: there are several methods that can give high sensitivity to network connection detection on good quality FMRI data, in particular, partial correlation, regularised inverse covariance estimation and several Bayes net methods; however, accurate estimation of connection directionality is more difficult to achieve, though Patel's τ can be reasonably successful. With respect to the various confounds added to the data, the most striking result was that the use of functionally inaccurate ROIs (when defining the network nodes and extracting their associated timeseries) is extremely damaging to network estimation; hence, results derived from inappropriate ROI definition (such as via structural atlases) should be regarded with great caution. Copyright © 2010 Elsevier Inc. All rights reserved.
Finite-dimensional attractor for a composite system of wave/plate equations with localized damping
International Nuclear Information System (INIS)
Bucci, Francesca; Toundykov, Daniel
2010-01-01
The long-term behaviour of solutions to a model for acoustic–structure interactions is addressed; the system consists of coupled semilinear wave (3D) and plate equations with nonlinear damping and critical sources. The questions of interest are the existence of a global attractor for the dynamics generated by this composite system as well as dimensionality and regularity of the attractor. A distinct and challenging feature of the problem is the geometrically restricted dissipation on the wave component of the system. It is shown that the existence of a global attractor of finite fractal dimension—established in a previous work by Bucci et al (2007 Commun. Pure Appl. Anal. 6 113–40) only in the presence of full-interior acoustic damping—holds even in the case of localized dissipation. This nontrivial generalization is inspired by, and consistent with, the recent advances in the study of wave equations with nonlinear localized damping
Research on the model of home networking
Yun, Xiang; Feng, Xiancheng
2007-11-01
It is the research hotspot of current broadband network to combine voice service, data service and broadband audio-video service by IP protocol to transport various real time and mutual services to terminal users (home). Home Networking is a new kind of network and application technology which can provide various services. Home networking is called as Digital Home Network. It means that PC, home entertainment equipment, home appliances, Home wirings, security, illumination system were communicated with each other by some composing network technology, constitute a networking internal home, and connect with WAN by home gateway. It is a new network technology and application technology, and can provide many kinds of services inside home or between homes. Currently, home networking can be divided into three kinds: Information equipment, Home appliances, Communication equipment. Equipment inside home networking can exchange information with outer networking by home gateway, this information communication is bidirectional, user can get information and service which provided by public networking by using home networking internal equipment through home gateway connecting public network, meantime, also can get information and resource to control the internal equipment which provided by home networking internal equipment. Based on the general network model of home networking, there are four functional entities inside home networking: HA, HB, HC, and HD. (1) HA (Home Access) - home networking connects function entity; (2) HB (Home Bridge) Home networking bridge connects function entity; (3) HC (Home Client) - Home networking client function entity; (4) HD (Home Device) - decoder function entity. There are many physical ways to implement four function entities. Based on theses four functional entities, there are reference model of physical layer, reference model of link layer, reference model of IP layer and application reference model of high layer. In the future home network
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.
A New Chaotic Flow with Hidden Attractor: The First Hyperjerk System with No Equilibrium
Ren, Shuili; Panahi, Shirin; Rajagopal, Karthikeyan; Akgul, Akif; Pham, Viet-Thanh; Jafari, Sajad
2018-02-01
Discovering unknown aspects of non-equilibrium systems with hidden strange attractors is an attractive research topic. A novel quadratic hyperjerk system is introduced in this paper. It is noteworthy that this non-equilibrium system can generate hidden chaotic attractors. The essential properties of such systems are investigated by means of equilibrium points, phase portrait, bifurcation diagram, and Lyapunov exponents. In addition, a fractional-order differential equation of this new system is presented. Moreover, an electronic circuit is also designed and implemented to verify the feasibility of the theoretical model.
Energy modelling in sensor networks
Schmidt, D.; Krämer, M.; Kuhn, T.; Wehn, N.
2007-06-01
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.
Two-Layer Feedback Neural Networks with Associative Memories
International Nuclear Information System (INIS)
Gui-Kun, Wu; Hong, Zhao
2008-01-01
We construct a two-layer feedback neural network by a Monte Carlo based algorithm to store memories as fixed-point attractors or as limit-cycle attractors. Special attention is focused on comparing the dynamics of the network with limit-cycle attractors and with fixed-point attractors. It is found that the former has better retrieval property than the latter. Particularly, spurious memories may be suppressed completely when the memories are stored as a long-limit cycle. Potential application of limit-cycle-attractor networks is discussed briefly. (general)
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.
Biological transportation networks: Modeling and simulation
Albi, Giacomo; Artina, Marco; Foransier, Massimo; Markowich, Peter A.
2015-01-01
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
Black hole entropy functions and attractor equations
International Nuclear Information System (INIS)
Lopes Cardoso, Gabriel; Wit, Bernard de; Mahapatra, Swapna
2007-01-01
The entropy and the attractor equations for static extremal black hole solutions follow from a variational principle based on an entropy function. In the general case such an entropy function can be derived from the reduced action evaluated in a near-horizon geometry. BPS black holes constitute special solutions of this variational principle, but they can also be derived directly from a different entropy function based on supersymmetry enhancement at the horizon. Both functions are consistent with electric/magnetic duality and for BPS black holes their corresponding OSV-type integrals give identical results at the semi-classical level. We clarify the relation between the two entropy functions and the corresponding attractor equations for N = 2 supergravity theories with higher-derivative couplings in four space-time dimensions. We discuss how non-holomorphic corrections will modify these entropy functions
D0-branes in black hole attractors
International Nuclear Information System (INIS)
Gaiotto, Davide; Simons, Aaron; Strominger, Andrew; Yin Xi
2006-01-01
Configurations of N probe D0-branes in a Calabi-Yau black hole are studied. A large degeneracy of near-horizon bound states are found which can be described as lowest Landau levels tiling the horizon of the black hole. These states preserve some of the enhanced supersymmetry of the near-horizon AdS 2 x S 2 x CY 3 attractor geometry, but not of the full asymptotically flat solution. Supersymmetric non-abelian configurations are constructed which, via the Myers effect, develop charges associated with higher-dimensional branes wrapping CY 3 cycles. An SU(1,1/2) superconformal quantum mechanics describing D0-branes in the attractor geometry is explicitly constructed
Attractors near grazing–sliding bifurcations
International Nuclear Information System (INIS)
Glendinning, P; Kowalczyk, P; Nordmark, A B
2012-01-01
In this paper we prove, for the first time, that multistability can occur in three-dimensional Fillipov type flows due to grazing–sliding bifurcations. We do this by reducing the study of the dynamics of Filippov type flows around a grazing–sliding bifurcation to the study of appropriately defined one-dimensional maps. In particular, we prove the presence of three qualitatively different types of multiple attractors born in grazing–sliding bifurcations. Namely, a period-two orbit with a sliding segment may coexist with a chaotic attractor, two stable, period-two and period-three orbits with a segment of sliding each may coexist, or a non-sliding and period-three orbit with two sliding segments may coexist
Multistability in Large Scale Models of Brain Activity.
Directory of Open Access Journals (Sweden)
Mathieu Golos
2015-12-01
Full Text Available Noise driven exploration of a brain network's dynamic repertoire has been hypothesized to be causally involved in cognitive function, aging and neurodegeneration. The dynamic repertoire crucially depends on the network's capacity to store patterns, as well as their stability. Here we systematically explore the capacity of networks derived from human connectomes to store attractor states, as well as various network mechanisms to control the brain's dynamic repertoire. Using a deterministic graded response Hopfield model with connectome-based interactions, we reconstruct the system's attractor space through a uniform sampling of the initial conditions. Large fixed-point attractor sets are obtained in the low temperature condition, with a bigger number of attractors than ever reported so far. Different variants of the initial model, including (i a uniform activation threshold or (ii a global negative feedback, produce a similarly robust multistability in a limited parameter range. A numerical analysis of the distribution of the attractors identifies spatially-segregated components, with a centro-medial core and several well-delineated regional patches. Those different modes share similarity with the fMRI independent components observed in the "resting state" condition. We demonstrate non-stationary behavior in noise-driven generalizations of the models, with different meta-stable attractors visited along the same time course. Only the model with a global dynamic density control is found to display robust and long-lasting non-stationarity with no tendency toward either overactivity or extinction. The best fit with empirical signals is observed at the edge of multistability, a parameter region that also corresponds to the highest entropy of the attractors.
Contractive function systems, their attractors and metrization
Czech Academy of Sciences Publication Activity Database
Banakh, T.; Kubiś, Wieslaw; Novosad, N.; Nowak, M.; Strobin, F.
2015-01-01
Roč. 46, č. 2 (2015), s. 1029-1066 ISSN 1230-3429 R&D Projects: GA ČR(CZ) GA14-07880S Institutional support: RVO:67985840 Keywords : fractal * attractor * iterated function system * contracting function system Subject RIV: BA - General Mathematics Impact factor: 0.717, year: 2015 http://www.apcz.pl/czasopisma/index.php/TMNA/article/view/TMNA.2015.076
Internal wave attractors: different scenarios of instability
Brouzet, Christophe; Ermanyuk, E. V.; Joubaud, Sylvain; Pillet, Grimaud; Dauxois, Thierry
2017-01-01
International audience; This paper presents an experimental study of different instability scenarios in a parallelogram-shaped internal wave attractor in a trapezoidal domain filled with a uniformly stratified fluid.Energy is injected into the system via the oscillatory motion of a vertical wall of the trapezoidal domain. Whole-field velocity measurements are performed with the conventional PIV technique. In the linear regime, the total kinetic energyof the fluid system is used to quantify th...
Holonomy Attractor Connecting Spaces of Different Curvature Responsible for ``Anomalies''
Binder, Bernd
2009-03-01
SO(3). MAP can be extended to a neural network, where the synaptic connection of the holonomy attractor is just the mathematical condition adjusting and bridging spaces with positive (spherical) and negative (hyperbolic) curvature allowing for lossless/supra spin currents. Another strategy is to look for existing spin/precession anomalies and corresponding nonlinear holonomy conditions at the most fundamental level from the quark level to the cosmic scale. In these sceneries the geodesic attractor could control holonomy and curvature near the fixed points. It was proposed in 2002 that this should happen with electrons in atomic orbits showing a Berry phase part of the Rydberg or Sommerfeld fine structure constant and in 2003 that this effect could be responsible for (in)stabilities in the nuclear range and in superconductors. In 2008 it was shown that the attractor is part of the chaotic mechanical dynamics successfully at work in the Gyro-twister fitness device, and in 2007-2009 that there could be some deep relevance to "anomalies" in many scenarios even on the cosmic scales. Thus, we will point to and discuss some possible future applications that could be utilized for metric engineering: generating artificial holonomy and curvature (DC effect) for propulsion, or forcing holonomy waves (AC effect) in hyperbolic space-time, which are just gravitational waves interesting for communication.
An evolving network model with community structure
International Nuclear Information System (INIS)
Li Chunguang; Maini, Philip K
2005-01-01
Many social and biological networks consist of communities-groups of nodes within which connections are dense, but between which connections are sparser. Recently, there has been considerable interest in designing algorithms for detecting community structures in real-world complex networks. In this paper, we propose an evolving network model which exhibits community structure. The network model is based on the inner-community preferential attachment and inter-community preferential attachment mechanisms. The degree distributions of this network model are analysed based on a mean-field method. Theoretical results and numerical simulations indicate that this network model has community structure and scale-free properties
Brand Marketing Model on Social Networks
Directory of Open Access Journals (Sweden)
Jolita Jezukevičiūtė
2014-04-01
Full Text Available The paper analyzes the brand and its marketing solutions onsocial networks. This analysis led to the creation of improvedbrand marketing model on social networks, which will contributeto the rapid and cheap organization brand recognition, increasecompetitive advantage and enhance consumer loyalty. Therefore,the brand and a variety of social networks are becoming a hotresearch area for brand marketing model on social networks.The world‘s most successful brand marketing models exploratoryanalysis of a single case study revealed a brand marketingsocial networking tools that affect consumers the most. Basedon information analysis and methodological studies, develop abrand marketing model on social networks.
A novel Direct Small World network model
Directory of Open Access Journals (Sweden)
LIN Tao
2016-10-01
Full Text Available There is a certain degree of redundancy and low efficiency of existing computer networks.This paper presents a novel Direct Small World network model in order to optimize networks.In this model,several nodes construct a regular network.Then,randomly choose and replot some nodes to generate Direct Small World network iteratively.There is no change in average distance and clustering coefficient.However,the network performance,such as hops,is improved.The experiments prove that compared to traditional small world network,the degree,average of degree centrality and average of closeness centrality are lower in Direct Small World network.This illustrates that the nodes in Direct Small World networks are closer than Watts-Strogatz small world network model.The Direct Small World can be used not only in the communication of the community information,but also in the research of epidemics.
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.
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...
Brand Marketing Model on Social Networks
Jolita Jezukevičiūtė; Vida Davidavičienė
2014-01-01
The paper analyzes the brand and its marketing solutions onsocial networks. This analysis led to the creation of improvedbrand marketing model on social networks, which will contributeto the rapid and cheap organization brand recognition, increasecompetitive advantage and enhance consumer loyalty. Therefore,the brand and a variety of social networks are becoming a hotresearch area for brand marketing model on social networks.The world‘s most successful brand marketing models exploratoryanalys...
Brand marketing model on social networks
Jezukevičiūtė, Jolita; Davidavičienė, Vida
2014-01-01
Paper analyzes the brand and its marketing solutions on social networks. This analysis led to the creation of improved brand marketing model on social networks, which will contribute to the rapid and cheap organization brand recognition, increase competitive advantage and enhance consumer loyalty. Therefore, the brand and a variety of social networks are becoming a hot research area for brand marketing model on social networks. The world‘s most successful brand marketing models exploratory an...
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.
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
Loonen, Anton J M; Ivanova, Svetlana A
2017-01-01
The non-reward attractor theory of depression describes this mood disorder as originating from a neuronal dysfunction that arises from increased vulnerability of a cortical network that detects failure to receive an expected reward. From an evolutionary standpoint, the concept that the cerebral
Spinal Cord Injury Model System Information Network
... the UAB-SCIMS More The UAB-SCIMS Information Network The University of Alabama at Birmingham Spinal Cord Injury Model System (UAB-SCIMS) maintains this Information Network as a resource to promote knowledge in the ...
Eight challenges for network epidemic models
Directory of Open Access Journals (Sweden)
Lorenzo Pellis
2015-03-01
Full Text Available Networks offer a fertile framework for studying the spread of infection in human and animal populations. However, owing to the inherent high-dimensionality of networks themselves, modelling transmission through networks is mathematically and computationally challenging. Even the simplest network epidemic models present unanswered questions. Attempts to improve the practical usefulness of network models by including realistic features of contact networks and of host–pathogen biology (e.g. waning immunity have made some progress, but robust analytical results remain scarce. A more general theory is needed to understand the impact of network structure on the dynamics and control of infection. Here we identify a set of challenges that provide scope for active research in the field of network epidemic models.
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
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
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...... to the suggestion of suitable network models. An existing model for flow control is presented and an inherent weakness is revealed and remedied. Examples are given and numerically analysed through deterministic network modelling. Results are presented to highlight the properties of the suggested models...
Light Higgs from pole attractor
International Nuclear Information System (INIS)
Matsedonskyi, Oleksii; Montull, Marc
2017-09-01
We propose a new way of explaining the observed Higgs mass, within the cosmological relaxation framework. The key feature distinguishing it from other scanning scenarios is that the scanning field has a non-canonical kinetic term, whose role is to terminate the scan around the desired Higgs mass value. We propose a concrete realisation of this idea with two new singlet fields, one that scans the Higgs mass, and another that limits the time window in which the scan is possible. Within the provided time period, the scanning field does not significantly evolve after the Higgs field gets close to the Standard Model value, due to particle production friction.
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.
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
Strange Attractors in Drift Wave Turbulence
International Nuclear Information System (INIS)
Lewandowski, Jerome L.V.
2003-01-01
There are growing experimental, numerical and theoretical evidences that the anomalous transport observed in tokamaks and stellarators is caused by slow, drift-type modes (such as trapped electron modes and ion-temperature gradient-driven modes). Although typical collision frequencies in hot, magnetized fusion plasmas can be quite low in absolute values, collisional effects are nevertheless important since they act as dissipative sinks. As it is well known, dissipative systems with many (strictly speaking more than two) degrees of freedom are often chaotic and may evolve towards a so-called attractor
Attractors of the periodically forced Rayleigh system
Directory of Open Access Journals (Sweden)
Petre Bazavan
2011-07-01
Full Text Available The autonomous second order nonlinear ordinary differential equation(ODE introduced in 1883 by Lord Rayleigh, is the equation whichappears to be the closest to the ODE of the harmonic oscillator withdumping.In this paper we present a numerical study of the periodic andchaotic attractors in the dynamical system associated with the generalized Rayleigh equation. Transition between periodic and quasiperiodic motion is also studied. Numerical results describe the system dynamics changes (in particular bifurcations, when the forcing frequency is varied and thus, periodic, quasiperiodic or chaotic behaviour regions are predicted.
Attractors for a class of doubly nonlinear parabolic systems
Directory of Open Access Journals (Sweden)
Hamid El Ouardi
2006-03-01
Full Text Available In this paper, we establish the existence and boundedness of solutions of a doubly nonlinear parabolic system. We also obtain the existence of a global attractor and the regularity property for this attractor in $\\left[ L^{\\infty }(\\Omega \\right] ^{2}$ and ${\\prod_{i=1}^{2}}{B_{\\infty }^{1+\\sigma_{i},p_{i}}( \\Omega } $.
Existence and attractors of solutions for nonlinear parabolic systems
Directory of Open Access Journals (Sweden)
Hamid El Ouardi
2001-01-01
Full Text Available We prove existence and asymptotic behaviour results for weak solutions of a mixed problem (S. We also obtain the existence of the global attractor and the regularity for this attractor in $\\left[H^{2}(\\Omega \\right] ^{2}$ and we derive estimates of its Haussdorf and fractal dimensions.
Synchronization in Coupled Oscillators with Two Coexisting Attractors
International Nuclear Information System (INIS)
Han-Han, Zhu; Jun-Zhong, Yang
2008-01-01
Dynamics in coupled Duffing oscillators with two coexisting symmetrical attractors is investigated. For a pair of Duffing oscillators coupled linearly, the transition to the synchronization generally consists of two steps: Firstly, the two oscillators have to jump onto a same attractor, then they reach synchronization similarly to coupled monostable oscillators. The transition scenarios to the synchronization observed are strongly dependent on initial conditions. (general)
How to model wireless mesh networks topology
International Nuclear Information System (INIS)
Sanni, M L; Hashim, A A; Anwar, F; Ali, S; Ahmed, G S M
2013-01-01
The specification of network connectivity model or topology is the beginning of design and analysis in Computer Network researches. Wireless Mesh Networks is an autonomic network that is dynamically self-organised, self-configured while the mesh nodes establish automatic connectivity with the adjacent nodes in the relay network of wireless backbone routers. Researches in Wireless Mesh Networks range from node deployment to internetworking issues with sensor, Internet and cellular networks. These researches require modelling of relationships and interactions among nodes including technical characteristics of the links while satisfying the architectural requirements of the physical network. However, the existing topology generators model geographic topologies which constitute different architectures, thus may not be suitable in Wireless Mesh Networks scenarios. The existing methods of topology generation are explored, analysed and parameters for their characterisation are identified. Furthermore, an algorithm for the design of Wireless Mesh Networks topology based on square grid model is proposed in this paper. The performance of the topology generated is also evaluated. This research is particularly important in the generation of a close-to-real topology for ensuring relevance of design to the intended network and validity of results obtained in Wireless Mesh Networks researches
Model checking mobile ad hoc networks
Ghassemi, Fatemeh; Fokkink, Wan
2016-01-01
Modeling arbitrary connectivity changes within mobile ad hoc networks (MANETs) makes application of automated formal verification challenging. We use constrained labeled transition systems as a semantic model to represent mobility. To model check MANET protocols with respect to the underlying
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...
Nonparametric Bayesian Modeling of Complex Networks
DEFF Research Database (Denmark)
Schmidt, Mikkel Nørgaard; Mørup, Morten
2013-01-01
an infinite mixture model as running example, we go through the steps of deriving the model as an infinite limit of a finite parametric model, inferring the model parameters by Markov chain Monte Carlo, and checking the model?s fit and predictive performance. We explain how advanced nonparametric models......Modeling structure in complex networks using Bayesian nonparametrics makes it possible to specify flexible model structures and infer the adequate model complexity from the observed data. This article provides a gentle introduction to nonparametric Bayesian modeling of complex networks: Using...
Day-to-day evolution of the traffic network with Advanced Traveler Information System
International Nuclear Information System (INIS)
Han Linghui; Sun Huijun; Wu Jianjun; Zhu Chengjuan
2011-01-01
Highlights: → We develop a dynamical system with Advanced Travelers Information System (ATIS). → We use the dynamical system to study stability of the traffic network with ATIS. → It is found that some periodic attractors appear in some cases. → A road pricing is implemented to alleviate the instability of the traffic network with ATIS. - Abstract: Since the notion of user equilibrium (UE) was proposed by Wardrop , it has become a cornerstone for traffic assignment analysis. But, it is not sufficient to only ask whether equilibrium exists or not; it is equally important to ask whether and how the system can achieve equilibrium. Meanwhile, stability is an important performance in the sense that if equilibrium is unsustainable, both the equilibrium and the trajectory are sensitive to disturbances, even a small perturbation will result in the system evolution away from the equilibrium point. These incentive a growing interest in day-to-day dynamics. In this paper, we develop a dynamical system with Advanced Traveler Information System (ATIS) and study the stability of the network with ATIS. A simple network is used to simulate the model, and the results show that there exist periodic attractors in the traffic network in some cases (for example, the market penetration level of ATIS is 0.25 and traffic demand is 2 unit). It is found that the logit parameter of the dynamical model and the traffic demand can also affect the stability of the traffic network. More periodic attractors appear in the system when the traffic demand is large and the low logit parameter can delay the appearance of periodic attractors. By simulation, it can be concluded that if the range of the periodic attractors' domain of the simple network is known, the road pricing based on the range of the attraction domain is effective to alleviate the instability of the system.
Network structure exploration via Bayesian nonparametric models
International Nuclear Information System (INIS)
Chen, Y; Wang, X L; Xiang, X; Tang, B Z; Bu, J Z
2015-01-01
Complex networks provide a powerful mathematical representation of complex systems in nature and society. To understand complex networks, it is crucial to explore their internal structures, also called structural regularities. The task of network structure exploration is to determine how many groups there are in a complex network and how to group the nodes of the network. Most existing structure exploration methods need to specify either a group number or a certain type of structure when they are applied to a network. In the real world, however, the group number and also the certain type of structure that a network has are usually unknown in advance. To explore structural regularities in complex networks automatically, without any prior knowledge of the group number or the certain type of structure, we extend a probabilistic mixture model that can handle networks with any type of structure but needs to specify a group number using Bayesian nonparametric theory. We also propose a novel Bayesian nonparametric model, called the Bayesian nonparametric mixture (BNPM) model. Experiments conducted on a large number of networks with different structures show that the BNPM model is able to explore structural regularities in networks automatically with a stable, state-of-the-art performance. (paper)
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....... 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...
Building functional networks of spiking model neurons.
Abbott, L F; DePasquale, Brian; Memmesheimer, Raoul-Martin
2016-03-01
Most of the networks used by computer scientists and many of those studied by modelers in neuroscience represent unit activities as continuous variables. Neurons, however, communicate primarily through discontinuous spiking. We review methods for transferring our ability to construct interesting networks that perform relevant tasks from the artificial continuous domain to more realistic spiking network models. These methods raise a number of issues that warrant further theoretical and experimental study.
Modeling, Optimization & Control of Hydraulic Networks
DEFF Research Database (Denmark)
Tahavori, Maryamsadat
2014-01-01
. 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......Water supply systems consist of a number of pumping stations, which deliver water to the customers via pipeline networks and elevated reservoirs. A huge amount of drinking water is lost before it reaches to end-users due to the leakage in pipe networks. A cost effective solution to reduce leakage...... 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...
Port Hamiltonian modeling of Power Networks
van Schaik, F.; van der Schaft, Abraham; Scherpen, Jacquelien M.A.; Zonetti, Daniele; Ortega, R
2012-01-01
In this talk a full nonlinear model for the power network in port–Hamiltonian framework is derived to study its stability properties. For this we use the modularity approach i.e., we first derive the models of individual components in power network as port-Hamiltonian systems and then we combine all
Modelling traffic congestion using queuing networks
Indian Academy of Sciences (India)
Flow-density curves; uninterrupted traffic; Jackson networks. ... ness - also suffer from a big handicap vis-a-vis the Indian scenario: most of these models do .... more well-known queuing network models and onsite data, a more exact Road Cell ...
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
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
A New Chaotic Attractor with Quadratic Exponential Nonlinear Term from Chen’s Attractor
Directory of Open Access Journals (Sweden)
Iftikhar Ahmed
2014-02-01
Full Text Available In this paper a new three-dimensional chaotic system is proposed, which relies on a nonlinear exponential term and a nonlinear quadratic cross term necessary for folding trajectories. Basic dynamical characteristics of the new system are analyzed. Compared with the Chen system, the equilibrium points of the new system does not contain the origin, and has a greater positive Lyapunov index, can produce more complex shaped chaotic attractor.
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.
Continuum Modeling of Biological Network Formation
Albi, Giacomo; Burger, Martin; Haskovec, Jan; Markowich, Peter A.; Schlottbom, Matthias
2017-01-01
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
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.
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.
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.
Evaluation of EOR Processes Using Network Models
DEFF Research Database (Denmark)
Winter, Anatol; 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......) including estimation of their "petrophysical" properties (e.g. absolute permeability). 3) Mathematical modelling and computer studies of multiphase transport through pore space using mathematical network models. 4) Investigation of link between pore-scale and macroscopic recovery mechanisms....
Black hole microstates and attractor without supersymmetry
International Nuclear Information System (INIS)
Dabholkar, Atish; Trivedi, Sandip P.; Sen, Ashoke
2007-01-01
Due to the attractor mechanism, the entropy of an extremal black hole does not vary continuously as we vary the asymptotic values of various moduli fields. Using this fact we argue that the entropy of an extremal black hole in string theory, calculated for a range of values of the asymptotic moduli for which the microscopic theory is strongly coupled, should match the statistical entropy of the same system calculated for a range of values of the asymptotic moduli for which the microscopic theory is weakly coupled. This argument does not rely on supersymmetry and applies equally well to nonsupersymmetric extremal black holes. We discuss several examples which support this argument and also several caveats which could invalidate this argument
Attractor cosmology from nonminimally coupled gravity
Odintsov, S. D.; Oikonomou, V. K.
2018-03-01
By using a bottom-up reconstruction technique for nonminimally coupled scalar-tensor theories, we realize the Einstein frame attractor cosmologies in the Ω (ϕ )-Jordan frame. For our approach, what is needed for the reconstruction method to work is the functional form of the nonminimal coupling Ω (ϕ ) and of the scalar-to-tensor ratio, and also the assumption of the slow-roll inflation in the Ω (ϕ )-Jordan frame. By appropriately choosing the scalar-to-tensor ratio, we demonstrate that the observational indices of the attractor cosmologies can be realized directly in the Ω (ϕ )-Jordan frame. We investigate the special conditions that are required to hold true in for this realization to occur, and we provide the analytic form of the potential in the Ω (ϕ )-Jordan frame. Also, by performing a conformal transformation, we find the corresponding Einstein frame canonical scalar-tensor theory, and we calculate in detail the corresponding observational indices. The result indicates that although the spectral index of the primordial curvature perturbations is the same in the Jordan and Einstein frames, at leading order in the e -foldings number, the scalar-to-tensor ratio differs. We discuss the possible reasons behind this discrepancy, and we argue that the difference is due to some approximation we performed to the functional form of the potential in the Einstein frame, in order to obtain analytical results, and also due to the difference in the definition of the e -foldings number in the two frames, which is also pointed out in the related literature. Finally, we find the F (R ) gravity corresponding to the Einstein frame canonical scalar-tensor theory.
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.
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.
Improved Maximum Parsimony Models for Phylogenetic Networks.
Van Iersel, Leo; Jones, Mark; Scornavacca, Celine
2018-05-01
Phylogenetic networks are well suited to represent evolutionary histories comprising reticulate evolution. Several methods aiming at reconstructing explicit phylogenetic networks have been developed in the last two decades. In this article, we propose a new definition of maximum parsimony for phylogenetic networks that permits to model biological scenarios that cannot be modeled by the definitions currently present in the literature (namely, the "hardwired" and "softwired" parsimony). Building on this new definition, we provide several algorithmic results that lay the foundations for new parsimony-based methods for phylogenetic network reconstruction.
Modeling, robust and distributed model predictive control for freeway networks
Liu, S.
2016-01-01
In Model Predictive Control (MPC) for traffic networks, traffic models are crucial since they are used as prediction models for determining the optimal control actions. In order to reduce the computational complexity of MPC for traffic networks, macroscopic traffic models are often used instead of
Tool wear modeling using abductive networks
Masory, Oren
1992-09-01
A tool wear model based on Abductive Networks, which consists of a network of `polynomial' nodes, is described. The model relates the cutting parameters, components of the cutting force, and machining time to flank wear. Thus real time measurements of the cutting force can be used to monitor the machining process. The model is obtained by a training process in which the connectivity between the network's nodes and the polynomial coefficients of each node are determined by optimizing a performance criteria. Actual wear measurements of coated and uncoated carbide inserts were used for training and evaluating the established model.
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.
A Network Disruption Modeling Tool
National Research Council Canada - National Science Library
Leinart, James
1998-01-01
Given that network disruption has been identified as a military objective and C2-attack has been identified as the mechanism to accomplish this objective, a target set must be acquired and priorities...
Lien, C.-H.; Vaidyanathan, S.; Sambas, A.; Sukono; Mamat, M.; Sanjaya, W. S. M.; Subiyanto
2018-03-01
A 3-D new two-scroll chaotic attractor with three quadratic nonlinearities is investigated in this paper. First, the qualitative and dynamical properties of the new two-scroll chaotic system are described in terms of phase portraits, equilibrium points, Lyapunov exponents, Kaplan-Yorke dimension, dissipativity, etc. We show that the new two-scroll dissipative chaotic system has three unstable equilibrium points. As an engineering application, global chaos control of the new two-scroll chaotic system with unknown system parameters is designed via adaptive feedback control and Lyapunov stability theory. Furthermore, an electronic circuit realization of the new chaotic attractor is presented in detail to confirm the feasibility of the theoretical chaotic two-scroll attractor model.
García-Gómez, Mónica L; Azpeitia, Eugenio; Álvarez-Buylla, Elena R
2017-04-01
The study of the concerted action of hormones and transcription factors is fundamental to understand cell differentiation and pattern formation during organ development. The root apical meristem of Arabidopsis thaliana is a useful model to address this. It has a stem cell niche near its tip conformed of a quiescent organizer and stem or initial cells around it, then a proliferation domain followed by a transition domain, where cells diminish division rate before transiting to the elongation zone; here, cells grow anisotropically prior to their final differentiation towards the plant base. A minimal model of the gene regulatory network that underlies cell-fate specification and patterning at the root stem cell niche was proposed before. In this study, we update and couple such network with both the auxin and cytokinin hormone signaling pathways to address how they collectively give rise to attractors that correspond to the genetic and hormonal activity profiles that are characteristic of different cell types along A. thaliana root apical meristem. We used a Boolean model of the genetic-hormonal regulatory network to integrate known and predicted regulatory interactions into alternative models. Our analyses show that, after adding some putative missing interactions, the model includes the necessary and sufficient components and regulatory interactions to recover attractors characteristic of the root cell types, including the auxin and cytokinin activity profiles that correlate with different cellular behaviors along the root apical meristem. Furthermore, the model predicts the existence of activity configurations that could correspond to the transition domain. The model also provides a possible explanation for apparently paradoxical cellular behaviors in the root meristem. For example, how auxin may induce and at the same time inhibit WOX5 expression. According to the model proposed here the hormonal regulation of WOX5 might depend on the cell type. Our results
Directory of Open Access Journals (Sweden)
Mónica L García-Gómez
2017-04-01
Full Text Available The study of the concerted action of hormones and transcription factors is fundamental to understand cell differentiation and pattern formation during organ development. The root apical meristem of Arabidopsis thaliana is a useful model to address this. It has a stem cell niche near its tip conformed of a quiescent organizer and stem or initial cells around it, then a proliferation domain followed by a transition domain, where cells diminish division rate before transiting to the elongation zone; here, cells grow anisotropically prior to their final differentiation towards the plant base. A minimal model of the gene regulatory network that underlies cell-fate specification and patterning at the root stem cell niche was proposed before. In this study, we update and couple such network with both the auxin and cytokinin hormone signaling pathways to address how they collectively give rise to attractors that correspond to the genetic and hormonal activity profiles that are characteristic of different cell types along A. thaliana root apical meristem. We used a Boolean model of the genetic-hormonal regulatory network to integrate known and predicted regulatory interactions into alternative models. Our analyses show that, after adding some putative missing interactions, the model includes the necessary and sufficient components and regulatory interactions to recover attractors characteristic of the root cell types, including the auxin and cytokinin activity profiles that correlate with different cellular behaviors along the root apical meristem. Furthermore, the model predicts the existence of activity configurations that could correspond to the transition domain. The model also provides a possible explanation for apparently paradoxical cellular behaviors in the root meristem. For example, how auxin may induce and at the same time inhibit WOX5 expression. According to the model proposed here the hormonal regulation of WOX5 might depend on the cell
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.
Spatial Epidemic Modelling in Social Networks
Simoes, Joana Margarida
2005-06-01
The spread of infectious diseases is highly influenced by the structure of the underlying social network. The target of this study is not the network of acquaintances, but the social mobility network: the daily movement of people between locations, in regions. It was already shown that this kind of network exhibits small world characteristics. The model developed is agent based (ABM) and comprehends a movement model and a infection model. In the movement model, some assumptions are made about its structure and the daily movement is decomposed into four types: neighborhood, intra region, inter region and random. The model is Geographical Information Systems (GIS) based, and uses real data to define its geometry. Because it is a vector model, some optimization techniques were used to increase its efficiency.
Implementing network constraints in the EMPS model
Energy Technology Data Exchange (ETDEWEB)
Helseth, Arild; Warland, Geir; Mo, Birger; Fosso, Olav B.
2010-02-15
This report concerns the coupling of detailed market and network models for long-term hydro-thermal scheduling. Currently, the EPF model (Samlast) is the only tool available for this task for actors in the Nordic market. A new prototype for solving the coupled market and network problem has been developed. The prototype is based on the EMPS model (Samkjoeringsmodellen). Results from the market model are distributed to a detailed network model, where a DC load flow detects if there are overloads on monitored lines or intersections. In case of overloads, network constraints are generated and added to the market problem. Theoretical and implementation details for the new prototype are elaborated in this report. The performance of the prototype is tested against the EPF model on a 20-area Nordic dataset. (Author)
Role models for complex networks
Reichardt, J.; White, D. R.
2007-11-01
We present a framework for automatically decomposing (“block-modeling”) the functional classes of agents within a complex network. These classes are represented by the nodes of an image graph (“block model”) depicting the main patterns of connectivity and thus functional roles in the network. Using a first principles approach, we derive a measure for the fit of a network to any given image graph allowing objective hypothesis testing. From the properties of an optimal fit, we derive how to find the best fitting image graph directly from the network and present a criterion to avoid overfitting. The method can handle both two-mode and one-mode data, directed and undirected as well as weighted networks and allows for different types of links to be dealt with simultaneously. It is non-parametric and computationally efficient. The concepts of structural equivalence and modularity are found as special cases of our approach. We apply our method to the world trade network and analyze the roles individual countries play in the global economy.
Structural health monitoring based on sensitivity vector fields and attractor morphing.
Yin, Shih-Hsun; Epureanu, Bogdan I
2006-09-15
The dynamic responses of a thermo-shielding panel forced by unsteady aerodynamic loads and a classical Duffing oscillator are investigated to detect structural damage. A nonlinear aeroelastic model is obtained for the panel by using third-order piston theory to model the unsteady supersonic flow, which interacts with the panel. To identify damage, we analyse the morphology (deformation and movement) of the attractor of the dynamics of the aeroelastic system and the Duffing oscillator. Damages of various locations, extents and levels are shown to be revealed by the attractor-based analysis. For the panel, the type of damage considered is a local reduction in the bending stiffness. For the Duffing oscillator, variations in the linear and nonlinear stiffnesses and damping are considered as damage. Present studies of such problems are based on linear theories. In contrast, the presented approach using nonlinear dynamics has the potential of enhancing accuracy and sensitivity of detection.
The de Sitter spacetime as an attractor solution in fourth-order gravity
International Nuclear Information System (INIS)
Schmidt, H.-J.
1988-01-01
We investigate the general vacuum solution of fourth-order gravity, and include the Bach tensor. For L 2 = 1.3μR 2 + 1/2αC 2 the expanding de Sitter spacetime is an attractor in the set of axially symmetric Bianchi type-I models if and only if αμ ≤ 0 or α > 4μ holds. It will be argued that this result holds true for a large class of inhomogeneous models. As a byproduct, a new closed-form cosmological solution, is obtained. It is also shown that the de Sitter spacetime is an attractor for the Bach-Einstein gravity with a minimally coupled scalar field φ. Specialised to Einstein gravity (i.e. α = 0 above) this conformal equivalence remains a non-trivial one. (author)
Kinetic attractor phase diagrams of active nematic suspensions: the dilute regime.
Forest, M Gregory; Wang, Qi; Zhou, Ruhai
2015-08-28
Large-scale simulations by the authors of the kinetic-hydrodynamic equations for active polar nematics revealed a variety of spatio-temporal attractors, including steady and unsteady, banded (1d) and cellular (2d) spatial patterns. These particle scale activation-induced attractors arise at dilute nanorod volume fractions where the passive equilibrium phase is isotropic, whereas all previous model simulations have focused on the semi-dilute, nematic equilibrium regime and mostly on low-moment orientation tensor and polarity vector models. Here we extend our previous results to complete attractor phase diagrams for active nematics, with and without an explicit polar potential, to map out novel spatial and dynamic transitions, and to identify some new attractors, over the parameter space of dilute nanorod volume fraction and nanorod activation strength. The particle-scale activation parameter corresponds experimentally to a tunable force dipole strength (so-called pushers with propulsion from the rod tail) generated by active rod macromolecules, e.g., catalysis with the solvent phase, ATP-induced propulsion, or light-activated propulsion. The simulations allow 2d spatial variations in all flow and orientational variables and full spherical orientational degrees of freedom; the attractors correspond to numerical integration of a coupled system of 125 nonlinear PDEs in 2d plus time. The phase diagrams with and without the polar interaction potential are remarkably similar, implying that polar interactions among the rodlike particles are not essential to long-range spatial and temporal correlations in flow, polarity, and nematic order. As a general rule, above a threshold, low volume fractions induce 1d banded patterns, whereas higher yet still dilute volume fractions yield 2d patterns. Again as a general rule, varying activation strength at fixed volume fraction induces novel dynamic transitions. First, stationary patterns saturate the instability of the isotropic
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.
Latent variable models are network models.
Molenaar, Peter C M
2010-06-01
Cramer et al. present an original and interesting network perspective on comorbidity and contrast this perspective with a more traditional interpretation of comorbidity in terms of latent variable theory. My commentary focuses on the relationship between the two perspectives; that is, it aims to qualify the presumed contrast between interpretations in terms of networks and latent variables.
Homophyly/Kinship Model: Naturally Evolving Networks
Li, Angsheng; Li, Jiankou; Pan, Yicheng; Yin, Xianchen; Yong, Xi
2015-10-01
It has been a challenge to understand the formation and roles of social groups or natural communities in the evolution of species, societies and real world networks. Here, we propose the hypothesis that homophyly/kinship is the intrinsic mechanism of natural communities, introduce the notion of the affinity exponent and propose the homophyly/kinship model of networks. We demonstrate that the networks of our model satisfy a number of topological, probabilistic and combinatorial properties and, in particular, that the robustness and stability of natural communities increase as the affinity exponent increases and that the reciprocity of the networks in our model decreases as the affinity exponent increases. We show that both homophyly/kinship and reciprocity are essential to the emergence of cooperation in evolutionary games and that the homophyly/kinship and reciprocity determined by the appropriate affinity exponent guarantee the emergence of cooperation in evolutionary games, verifying Darwin’s proposal that kinship and reciprocity are the means of individual fitness. We propose the new principle of structure entropy minimisation for detecting natural communities of networks and verify the functional module property and characteristic properties by a healthy tissue cell network, a citation network, some metabolic networks and a protein interaction network.
Multi-wing hyperchaotic attractors from coupled Lorenz systems
International Nuclear Information System (INIS)
Grassi, Giuseppe; Severance, Frank L.; Miller, Damon A.
2009-01-01
This paper illustrates an approach to generate multi-wing attractors in coupled Lorenz systems. In particular, novel four-wing (eight-wing) hyperchaotic attractors are generated by coupling two (three) identical Lorenz systems. The paper shows that the equilibria of the proposed systems have certain symmetries with respect to specific coordinate planes and the eigenvalues of the associated Jacobian matrices exhibit the property of similarity. In analogy with the original Lorenz system, where the two-wings of the butterfly attractor are located around the two equilibria with the unstable pair of complex-conjugate eigenvalues, this paper shows that the four-wings (eight-wings) of these attractors are located around the four (eight) equilibria with two (three) pairs of unstable complex-conjugate eigenvalues.
Neural network tagging in a toy model
International Nuclear Information System (INIS)
Milek, Marko; Patel, Popat
1999-01-01
The purpose of this study is a comparison of Artificial Neural Network approach to HEP analysis against the traditional methods. A toy model used in this analysis consists of two types of particles defined by four generic properties. A number of 'events' was created according to the model using standard Monte Carlo techniques. Several fully connected, feed forward multi layered Artificial Neural Networks were trained to tag the model events. The performance of each network was compared to the standard analysis mechanisms and significant improvement was observed
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.
Modelling and designing electric energy networks
International Nuclear Information System (INIS)
Retiere, N.
2003-11-01
The author gives an overview of his research works in the field of electric network modelling. After a brief overview of technological evolutions from the telegraph to the all-electric fly-by-wire aircraft, he reports and describes various works dealing with a simplified modelling of electric systems and with fractal simulation. Then, he outlines the challenges for the design of electric networks, proposes a design process, gives an overview of various design models, methods and tools, and reports an application in the design of electric networks for future jumbo jets
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
Modeling GMPLS and Optical MPLS Networks
DEFF Research Database (Denmark)
Christiansen, Henrik Lehrmann; Wessing, Henrik
2003-01-01
. The MPLS concept is attractive because it can work as a unifying control structure. covering all technologies. This paper describes how a novel scheme for optical MPLS and circuit switched GMPLS based networks can incorporated in such multi-domain, MPLS-based scenarios and how it could be modeled. Network...
Cyber threat model for tactical radio networks
Kurdziel, Michael T.
2014-05-01
The shift to a full information-centric paradigm in the battlefield has allowed ConOps to be developed that are only possible using modern network communications systems. Securing these Tactical Networks without impacting their capabilities has been a challenge. Tactical networks with fixed infrastructure have similar vulnerabilities to their commercial counterparts (although they need to be secure against adversaries with greater capabilities, resources and motivation). However, networks with mobile infrastructure components and Mobile Ad hoc Networks (MANets) have additional unique vulnerabilities that must be considered. It is useful to examine Tactical Network based ConOps and use them to construct a threat model and baseline cyber security requirements for Tactical Networks with fixed infrastructure, mobile infrastructure and/or ad hoc modes of operation. This paper will present an introduction to threat model assessment. A definition and detailed discussion of a Tactical Network threat model is also presented. Finally, the model is used to derive baseline requirements that can be used to design or evaluate a cyber security solution that can be scaled and adapted to the needs of specific deployments.
Modeling documents with Generative Adversarial Networks
Glover, John
2016-01-01
This paper describes a method for using Generative Adversarial Networks to learn distributed representations of natural language documents. We propose a model that is based on the recently proposed Energy-Based GAN, but instead uses a Denoising Autoencoder as the discriminator network. Document representations are extracted from the hidden layer of the discriminator and evaluated both quantitatively and qualitatively.
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....
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.
Coexisting multiple attractors and riddled basins of a memristive system.
Wang, Guangyi; Yuan, Fang; Chen, Guanrong; Zhang, Yu
2018-01-01
In this paper, a new memristor-based chaotic system is designed, analyzed, and implemented. Multistability, multiple attractors, and complex riddled basins are observed from the system, which are investigated along with other dynamical behaviors such as equilibrium points and their stabilities, symmetrical bifurcation diagrams, and sustained chaotic states. With different sets of system parameters, the system can also generate various multi-scroll attractors. Finally, the system is realized by experimental circuits.
Attractor of reaction-diffusion equations in Banach spaces
Directory of Open Access Journals (Sweden)
José Valero
2001-04-01
Full Text Available In this paper we prove first some abstract theorems on existence of global attractors for differential inclusions generated by w-dissipative operators. Then these results are applied to reaction-diffusion equations in which the Babach space Lp is used as phase space. Finally, new results concerning the fractal dimension of the global attractor in the space L2 are obtained.
Existence of a new three-dimensional chaotic attractor
International Nuclear Information System (INIS)
Wang Jiezhi; Chen Zengqiang; Yuan Zhuzhi
2009-01-01
In this paper, one heteroclinic orbit of a new three-dimensional continuous autonomous chaotic system, whose chaotic attractor belongs to the conjugate Lue attractor, is found. The series expression of the heteroclinic orbit of Shil'nikov type is derived by using the undetermined coefficient method. The uniform convergence of the precise series expansions of this heteroclinic orbits is proved. According to the Shil'nikov theorem, this system clearly has Smale horseshoes and the horseshoe chaos.
Internal Waves and Wave Attractors in Enceladus' Subsurface Ocean
van Oers, A. M.; Maas, L. R.; Vermeersen, B. L. A.
2016-12-01
One of the most peculiar features on Saturn moon Enceladus is its so-called tiger stripe pattern at the geologically active South Polar Terrain (SPT), as first observed in detail by the Cassini spacecraft early 2005. It is generally assumed that the four almost parallel surface lines that constitute this pattern are faults in the icy surface overlying a confined salty water reservoir. In 2013, we formulated the original idea [Vermeersen et al., AGU Fall Meeting 2013, abstract #P53B-1848] that the tiger stripe pattern is formed and maintained by induced, tidally and rotationally driven, wave-attractor motions in the ocean underneath the icy surface of the tiger-stripe region. Such wave-attractor motions are observed in water tank experiments in laboratories on Earth and in numerical experiments [Maas et al., Nature, 338, 557-561, 1997; Drijfhout and Maas, J. Phys. Oceanogr., 37, 2740-2763, 2007; Hazewinkel et al., Phys. Fluids, 22, 107102, 2010]. Numerical simulations show the persistence of wave attractors for a range of ocean shapes and stratifications. The intensification of the wave field near the location of the surface reflections of wave attractors has been numerically and experimentally confirmed. We measured the forces a wave attractor exerts on a solid surface, near a reflection point. These reflection points would correspond to the location of the tiger stripes. Combining experiments and numerical simulations we conclude that (1) wave attractors can exist in Enceladus' subsurface sea, (2) their shape can be matched to the tiger stripes, (3) the wave attractors cause a localized force at the water-ice boundaries, (4) this force could have been large enough to contribute to fracturing the ice and (5) the wave attractors localize energy (and particles) and cause dissipation along its path, helping explain Enceladus' enigmatic heat output at the tiger stripes.
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.
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
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.
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.
Graphical Model Theory for Wireless Sensor Networks
International Nuclear Information System (INIS)
Davis, William B.
2002-01-01
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
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.
Sparsity in Model Gene Regulatory Networks
International Nuclear Information System (INIS)
Zagorski, M.
2011-01-01
We propose a gene regulatory network model which incorporates the microscopic interactions between genes and transcription factors. In particular the gene's expression level is determined by deterministic synchronous dynamics with contribution from excitatory interactions. We study the structure of networks that have a particular '' function '' and are subject to the natural selection pressure. The question of network robustness against point mutations is addressed, and we conclude that only a small part of connections defined as '' essential '' for cell's existence is fragile. Additionally, the obtained networks are sparse with narrow in-degree and broad out-degree, properties well known from experimental study of biological regulatory networks. Furthermore, during sampling procedure we observe that significantly different genotypes can emerge under mutation-selection balance. All the preceding features hold for the model parameters which lay in the experimentally relevant range. (author)
Octodon Degus: A Strong Attractor for Alzheimer Research
Directory of Open Access Journals (Sweden)
Rafael Castro-Fuentes
2013-01-01
Full Text Available The most popular animal models of Alzheimer’s disease (AD are transgenic mice expressing human genes with known mutations which do not represent the most abundant sporadic form of the disease. An increasing number of genetic, vascular and psychosocial data strongly support that the Octodon degus, a moderate-sized and diurnal precocial rodent, provides a naturalistic model for the study of the early neurodegenerative process associated with sporadic AD. In this minireview we describe and analyze the risk factors that contribute to Alzheimer-like characteristics in the degus, following recent publications, and establish some guidelines for future studies in this model of natural aging associated with the disease. Given the heterogeneity of current data derived from the diverse transgenic animal models of AD, now may be the time for the degus to become a strong attractor for academic research labs and companies involved with AD. This may help to understand the mechanisms responsible for the early neurodegenerative process associated with this devastating disease.
Octodon Degus: A Strong Attractor for Alzheimer Research
Directory of Open Access Journals (Sweden)
Rafael Castro-Fuentes
2013-02-01
Full Text Available The most popular animal models of Alzheimer’s disease (AD are transgenic mice expressing human genes with known mutations which do not represent the most abundant sporadic form of the disease. An increasing number of genetic, vascular and psychosocial data strongly support that the Octodon degus, a moderate-sized and diurnal precocial rodent, provides a naturalistic model for the study of the early neurodegenerative process associated with sporadic AD. In this minireview we describe and analyze the risk factors that contribute to Alzheimer-like characteristics in the degus, following recent publications, and establish some guidelines for future studies in this model of natural aging associated with the disease. Given the heterogeneity of current data derived from the diverse transgenic animal models of AD, now may be the time for the degus to become a strong attractor for academic research labs and companies involved with AD. This may help to understand the mechanisms responsible for the early neurodegenerative process associated with this devastating disease.
The QKD network: model and routing scheme
Yang, Chao; Zhang, Hongqi; Su, Jinhai
2017-11-01
Quantum key distribution (QKD) technology can establish unconditional secure keys between two communicating parties. Although this technology has some inherent constraints, such as the distance and point-to-point mode limits, building a QKD network with multiple point-to-point QKD devices can overcome these constraints. Considering the development level of current technology, the trust relaying QKD network is the first choice to build a practical QKD network. However, the previous research didn't address a routing method on the trust relaying QKD network in detail. This paper focuses on the routing issues, builds a model of the trust relaying QKD network for easily analysing and understanding this network, and proposes a dynamical routing scheme for this network. From the viewpoint of designing a dynamical routing scheme in classical network, the proposed scheme consists of three components: a Hello protocol helping share the network topology information, a routing algorithm to select a set of suitable paths and establish the routing table and a link state update mechanism helping keep the routing table newly. Experiments and evaluation demonstrates the validity and effectiveness of the proposed routing scheme.
2016-11-09
Figure 1. We generally express such networks in terms of the services running in each enclave as well as the routing and firewall rules between the...compromise a server, they can compromise other devices in the same subnet or protected enclave. They probe attached firewalls and routers for open ports and...spam and malware filter would prevent this content from reaching its destination. Content filtering provides another layer of defense to other controls
Thermal conductivity model for nanofiber networks
Zhao, Xinpeng; Huang, Congliang; Liu, Qingkun; Smalyukh, Ivan I.; Yang, Ronggui
2018-02-01
Understanding thermal transport in nanofiber networks is essential for their applications in thermal management, which are used extensively as mechanically sturdy thermal insulation or high thermal conductivity materials. In this study, using the statistical theory and Fourier's law of heat conduction while accounting for both the inter-fiber contact thermal resistance and the intrinsic thermal resistance of nanofibers, an analytical model is developed to predict the thermal conductivity of nanofiber networks as a function of their geometric and thermal properties. A scaling relation between the thermal conductivity and the geometric properties including volume fraction and nanofiber length of the network is revealed. This model agrees well with both numerical simulations and experimental measurements found in the literature. This model may prove useful in analyzing the experimental results and designing nanofiber networks for both high and low thermal conductivity applications.
Thermal conductivity model for nanofiber networks
Energy Technology Data Exchange (ETDEWEB)
Zhao, Xinpeng [Department of Mechanical Engineering, University of Colorado, Boulder, Colorado 80309, USA; Huang, Congliang [Department of Mechanical Engineering, University of Colorado, Boulder, Colorado 80309, USA; School of Electrical and Power Engineering, China University of Mining and Technology, Xuzhou 221116, China; Liu, Qingkun [Department of Physics, University of Colorado, Boulder, Colorado 80309, USA; Smalyukh, Ivan I. [Department of Physics, University of Colorado, Boulder, Colorado 80309, USA; Materials Science and Engineering Program, University of Colorado, Boulder, Colorado 80309, USA; Yang, Ronggui [Department of Mechanical Engineering, University of Colorado, Boulder, Colorado 80309, USA; Materials Science and Engineering Program, University of Colorado, Boulder, Colorado 80309, USA; Buildings and Thermal Systems Center, National Renewable Energy Laboratory, Golden, Colorado 80401, USA
2018-02-28
Understanding thermal transport in nanofiber networks is essential for their applications in thermal management, which are used extensively as mechanically sturdy thermal insulation or high thermal conductivity materials. In this study, using the statistical theory and Fourier's law of heat conduction while accounting for both the inter-fiber contact thermal resistance and the intrinsic thermal resistance of nanofibers, an analytical model is developed to predict the thermal conductivity of nanofiber networks as a function of their geometric and thermal properties. A scaling relation between the thermal conductivity and the geometric properties including volume fraction and nanofiber length of the network is revealed. This model agrees well with both numerical simulations and experimental measurements found in the literature. This model may prove useful in analyzing the experimental results and designing nanofiber networks for both high and low thermal conductivity applications.
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.
Combinatorial explosion in model gene networks
Edwards, R.; Glass, L.
2000-09-01
The explosive growth in knowledge of the genome of humans and other organisms leaves open the question of how the functioning of genes in interacting networks is coordinated for orderly activity. One approach to this problem is to study mathematical properties of abstract network models that capture the logical structures of gene networks. The principal issue is to understand how particular patterns of activity can result from particular network structures, and what types of behavior are possible. We study idealized models in which the logical structure of the network is explicitly represented by Boolean functions that can be represented by directed graphs on n-cubes, but which are continuous in time and described by differential equations, rather than being updated synchronously via a discrete clock. The equations are piecewise linear, which allows significant analysis and facilitates rapid integration along trajectories. We first give a combinatorial solution to the question of how many distinct logical structures exist for n-dimensional networks, showing that the number increases very rapidly with n. We then outline analytic methods that can be used to establish the existence, stability and periods of periodic orbits corresponding to particular cycles on the n-cube. We use these methods to confirm the existence of limit cycles discovered in a sample of a million randomly generated structures of networks of 4 genes. Even with only 4 genes, at least several hundred different patterns of stable periodic behavior are possible, many of them surprisingly complex. We discuss ways of further classifying these periodic behaviors, showing that small mutations (reversal of one or a few edges on the n-cube) need not destroy the stability of a limit cycle. Although these networks are very simple as models of gene networks, their mathematical transparency reveals relationships between structure and behavior, they suggest that the possibilities for orderly dynamics in such
Diffusion of intrinsic localized modes by attractor hopping
International Nuclear Information System (INIS)
Meister, Matthias; Vazquez, Luis
2003-01-01
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 θ and a delay time τ 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, θ and τ 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 θ, a decrease in τ A and reduces the average distance a mode travels during the transition period
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.
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.
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
Network Modeling and Simulation A Practical Perspective
Guizani, Mohsen; Khan, Bilal
2010-01-01
Network Modeling and Simulation is a practical guide to using modeling and simulation to solve real-life problems. The authors give a comprehensive exposition of the core concepts in modeling and simulation, and then systematically address the many practical considerations faced by developers in modeling complex large-scale systems. The authors provide examples from computer and telecommunication networks and use these to illustrate the process of mapping generic simulation concepts to domain-specific problems in different industries and disciplines. Key features: Provides the tools and strate
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
Attractors, statefinders and observational measurement for chameleonic Brans-Dicke cosmology
International Nuclear Information System (INIS)
Farajollahi, Hossein; Salehi, Amin
2010-01-01
We investigate chameleonic Brans-Dicke model applied to the FRW universes. A framework to study stability and attractor solutions in the phase space is developed for the model. We show that depending on the matter field and stability conditions, it is possible to realize phantom-like behavior without introducing phantom filed in the model while the stability is fulfilled and phantom crossing occurs. The statefinder parameters to the model for different kinds of matter interacting with the chameleon scalar field are studied. We also compare our model with present day observations
Attractors, statefinders and observational measurement for chameleonic Brans-Dicke cosmology
Energy Technology Data Exchange (ETDEWEB)
Farajollahi, Hossein; Salehi, Amin, E-mail: hosseinf@guilan.ac.ir, E-mail: a.salehi@guilan.ac.ir [Department of Physics, University of Guilan, Rasht (Iran, Islamic Republic of)
2010-11-01
We investigate chameleonic Brans-Dicke model applied to the FRW universes. A framework to study stability and attractor solutions in the phase space is developed for the model. We show that depending on the matter field and stability conditions, it is possible to realize phantom-like behavior without introducing phantom filed in the model while the stability is fulfilled and phantom crossing occurs. The statefinder parameters to the model for different kinds of matter interacting with the chameleon scalar field are studied. We also compare our model with present day observations.
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.
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.
Non-linguistic Conditions for Causativization as a Linguistic Attractor.
Nichols, Johanna
2017-01-01
An attractor, in complex systems theory, is any state that is more easily or more often entered or acquired than departed or lost; attractor states therefore accumulate more members than non-attractors, other things being equal. In the context of language evolution, linguistic attractors include sounds, forms, and grammatical structures that are prone to be selected when sociolinguistics and language contact make it possible for speakers to choose between competing forms. The reasons why an element is an attractor are linguistic (auditory salience, ease of processing, paradigm structure, etc.), but the factors that make selection possible and propagate selected items through the speech community are non-linguistic. This paper uses the consonants in personal pronouns to show what makes for an attractor and how selection and diffusion work, then presents a survey of several language families and areas showing that the derivational morphology of pairs of verbs like fear and frighten , or Turkish korkmak 'fear, be afraid' and korkutmak 'frighten, scare', or Finnish istua 'sit' and istutta 'seat (someone)', or Spanish sentarse 'sit down' and sentar 'seat (someone)' is susceptible to selection. Specifically, the Turkish and Finnish pattern, where 'seat' is derived from 'sit' by addition of a suffix-is an attractor and a favored target of selection. This selection occurs chiefly in sociolinguistic contexts of what is defined here as linguistic symbiosis, where languages mingle in speech, which in turn is favored by certain demographic, sociocultural, and environmental factors here termed frontier conditions. Evidence is surveyed from northern Eurasia, the Caucasus, North and Central America, and the Pacific and from both modern and ancient languages to raise the hypothesis that frontier conditions and symbiosis favor causativization.
Non-linguistic Conditions for Causativization as a Linguistic Attractor
Directory of Open Access Journals (Sweden)
Johanna Nichols
2018-01-01
Full Text Available An attractor, in complex systems theory, is any state that is more easily or more often entered or acquired than departed or lost; attractor states therefore accumulate more members than non-attractors, other things being equal. In the context of language evolution, linguistic attractors include sounds, forms, and grammatical structures that are prone to be selected when sociolinguistics and language contact make it possible for speakers to choose between competing forms. The reasons why an element is an attractor are linguistic (auditory salience, ease of processing, paradigm structure, etc., but the factors that make selection possible and propagate selected items through the speech community are non-linguistic. This paper uses the consonants in personal pronouns to show what makes for an attractor and how selection and diffusion work, then presents a survey of several language families and areas showing that the derivational morphology of pairs of verbs like fear and frighten, or Turkish korkmak ‘fear, be afraid’ and korkutmak ‘frighten, scare’, or Finnish istua ‘sit’ and istutta ‘seat (someone’, or Spanish sentarse ‘sit down’ and sentar ‘seat (someone’ is susceptible to selection. Specifically, the Turkish and Finnish pattern, where ‘seat’ is derived from ‘sit’ by addition of a suffix—is an attractor and a favored target of selection. This selection occurs chiefly in sociolinguistic contexts of what is defined here as linguistic symbiosis, where languages mingle in speech, which in turn is favored by certain demographic, sociocultural, and environmental factors here termed frontier conditions. Evidence is surveyed from northern Eurasia, the Caucasus, North and Central America, and the Pacific and from both modern and ancient languages to raise the hypothesis that frontier conditions and symbiosis favor causativization.
Linear approximation model network and its formation via ...
Indian Academy of Sciences (India)
To overcome the deficiency of `local model network' (LMN) techniques, an alternative `linear approximation model' (LAM) network approach is proposed. Such a network models a nonlinear or practical system with multiple linear models fitted along operating trajectories, where individual models are simply networked ...
Supersymmetric mechanics. Vol. 2. The attractor mechanism and space time singularities
International Nuclear Information System (INIS)
Bellucci, S.; Marrani, A.; Ferrara, S.
2006-01-01
This is the second volume in a series of books on the general theme of Supersymmetric Mechanics; the series is based on lectures and discussions held in 2005 and 2006 at the INFN-Laboratori Nazionali di Frascati. The first volume appears as Lect. Notes Physics, Vol. 698 ''Supersymmetric Mechanics, Vol.1: Supersymmetry, Noncommutativity and Matrix Models'' (2006) ISBN: 3-540-33313-4. The present extensive lecture supplies a pedagogical introduction, at the non-expert level, to the attractor mechanism in space-time singularities. In such a framework, supersymmetry seems to be related to dynamical systems with fixed points, describing the equilibrium state and the stability features of the thermodynamics of black holes. After a qualitative overview, explicit examples realizing the attractor mechanism are treated at some length; they include relevant cases of asymptotically flat, maximal and non-maximal, extended supergravities in 4 and 5 dimensions. A number of recent advances along various directions of research on the attractor mechanism are also given. (orig.)
Modeling Security Aspects of Network
Schoch, Elmar
With more and more widespread usage of computer systems and networks, dependability becomes a paramount requirement. Dependability typically denotes tolerance or protection against all kinds of failures, errors and faults. Sources of failures can basically be accidental, e.g., in case of hardware errors or software bugs, or intentional due to some kind of malicious behavior. These intentional, malicious actions are subject of security. A more complete overview on the relations between dependability and security can be found in [31]. In parallel to the increased use of technology, misuse also has grown significantly, requiring measures to deal with it.
Modeling and optimization of an electric power distribution network ...
African Journals Online (AJOL)
Modeling and optimization of an electric power distribution network planning system using ... of the network was modelled with non-linear mathematical expressions. ... given feasible locations, re-conductoring of existing feeders in the network, ...
An evolving network model with modular growth
International Nuclear Information System (INIS)
Zou Zhi-Yun; Liu Peng; Lei Li; Gao Jian-Zhi
2012-01-01
In this paper, we propose an evolving network model growing fast in units of module, according to the analysis of the evolution characteristics in real complex networks. Each module is a small-world network containing several interconnected nodes and the nodes between the modules are linked by preferential attachment on degree of nodes. We study the modularity measure of the proposed model, which can be adjusted by changing the ratio of the number of inner-module edges and the number of inter-module edges. In view of the mean-field theory, we develop an analytical function of the degree distribution, which is verified by a numerical example and indicates that the degree distribution shows characteristics of the small-world network and the scale-free network distinctly at different segments. The clustering coefficient and the average path length of the network are simulated numerically, indicating that the network shows the small-world property and is affected little by the randomness of the new module. (interdisciplinary physics and related areas of science and technology)
Modeling of contact tracing in social networks
Tsimring, Lev S.; Huerta, Ramón
2003-07-01
Spreading of certain infections in complex networks is effectively suppressed by using intelligent strategies for epidemic control. One such standard epidemiological strategy consists in tracing contacts of infected individuals. In this paper, we use a recently introduced generalization of the standard susceptible-infectious-removed stochastic model for epidemics in sparse random networks which incorporates an additional (traced) state. We describe a deterministic mean-field description which yields quantitative agreement with stochastic simulations on random graphs. We also discuss the role of contact tracing in epidemics control in small-world and scale-free networks. Effectiveness of contact tracing grows as the rewiring probability is reduced.
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.
The International Trade Network: weighted network analysis and modelling
International Nuclear Information System (INIS)
Bhattacharya, K; Mukherjee, G; Manna, S S; Saramäki, J; Kaski, K
2008-01-01
Tools of the theory of critical phenomena, namely the scaling analysis and universality, are argued to be applicable to large complex web-like network structures. Using a detailed analysis of the real data of the International Trade Network we argue that the scaled link weight distribution has an approximate log-normal distribution which remains robust over a period of 53 years. Another universal feature is observed in the power-law growth of the trade strength with gross domestic product, the exponent being similar for all countries. Using the 'rich-club' coefficient measure of the weighted networks it has been shown that the size of the rich-club controlling half of the world's trade is actually shrinking. While the gravity law is known to describe well the social interactions in the static networks of population migration, international trade, etc, here for the first time we studied a non-conservative dynamical model based on the gravity law which excellently reproduced many empirical features of the ITN
Keystone Business Models for Network Security Processors
Arthur Low; Steven Muegge
2013-01-01
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...
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
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.
Artificial Immune Networks: Models and Applications
Directory of Open Access Journals (Sweden)
Xian Shen
2008-06-01
Full Text Available Artificial Immune Systems (AIS, which is inspired by the nature immune system, has been applied for solving complex computational problems in classification, pattern rec- ognition, and optimization. In this paper, the theory of the natural immune system is first briefly introduced. Next, we compare some well-known AIS and their applications. Several representative artificial immune networks models are also dis- cussed. Moreover, we demonstrate the applications of artificial immune networks in various engineering fields.
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.
Adaptive-network models of collective dynamics
Zschaler, G.
2012-09-01
Complex systems can often be modelled as networks, in which their basic units are represented by abstract nodes and the interactions among them by abstract links. This network of interactions is the key to understanding emergent collective phenomena in such systems. In most cases, it is an adaptive network, which is defined by a feedback loop between the local dynamics of the individual units and the dynamical changes of the network structure itself. This feedback loop gives rise to many novel phenomena. Adaptive networks are a promising concept for the investigation of collective phenomena in different systems. However, they also present a challenge to existing modelling approaches and analytical descriptions due to the tight coupling between local and topological degrees of freedom. In this work, which is essentially my PhD thesis, I present a simple rule-based framework for the investigation of adaptive networks, using which a wide range of collective phenomena can be modelled and analysed from a common perspective. In this framework, a microscopic model is defined by the local interaction rules of small network motifs, which can be implemented in stochastic simulations straightforwardly. Moreover, an approximate emergent-level description in terms of macroscopic variables can be derived from the microscopic rules, which we use to analyse the system's collective and long-term behaviour by applying tools from dynamical systems theory. We discuss three adaptive-network models for different collective phenomena within our common framework. First, we propose a novel approach to collective motion in insect swarms, in which we consider the insects' adaptive interaction network instead of explicitly tracking their positions and velocities. We capture the experimentally observed onset of collective motion qualitatively in terms of a bifurcation in this non-spatial model. We find that three-body interactions are an essential ingredient for collective motion to emerge
Network Design Models for Container Shipping
DEFF Research Database (Denmark)
Reinhardt, Line Blander; Kallehauge, Brian; Nielsen, Anders Nørrelund
This paper presents a study of the network design problem in container shipping. The paper combines the network design and fleet assignment problem into a mixed integer linear programming model minimizing the overall cost. The major contributions of this paper is that the time of a vessel route...... is included in the calculation of the capacity and that a inhomogeneous fleet is modeled. The model also includes the cost of transshipment which is one of the major cost for the shipping companies. The concept of pseudo simple routes is introduced to expand the set of feasible routes. The linearization...
Detection of generalized synchronization using echo state networks
Ibáñez-Soria, D.; García Ojalvo, Jordi; Soria Frisch, Aureli; Ruffini, G.
2018-01-01
Generalized synchronization between coupled dynamical systems is a phenomenon of relevance in applications that range from secure communications to physiological modelling. Here, we test the capabilities of reservoir computing and, in particular, echo state networks for the detection of generalized synchronization. A nonlinear dynamical system consisting of two coupled Rössler chaotic attractors is used to generate temporal series consisting of time-locked generalized synchronized sequences i...
Characterization and Modeling of Network Traffic
DEFF Research Database (Denmark)
Shawky, Ahmed; Bergheim, Hans; Ragnarsson, Olafur
2011-01-01
-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...
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.
Agent based modeling of energy networks
International Nuclear Information System (INIS)
Gonzalez de Durana, José María; Barambones, Oscar; Kremers, Enrique; Varga, Liz
2014-01-01
Highlights: • A new approach for energy network modeling is designed and tested. • The agent-based approach is general and no technology dependent. • The models can be easily extended. • The range of applications encompasses from small to large energy infrastructures. - Abstract: Attempts to model any present or future power grid face a huge challenge because a power grid is a complex system, with feedback and multi-agent behaviors, integrated by generation, distribution, storage and consumption systems, using various control and automation computing systems to manage electricity flows. Our approach to modeling is to build upon an established model of the low voltage electricity network which is tested and proven, by extending it to a generalized energy model. But, in order to address the crucial issues of energy efficiency, additional processes like energy conversion and storage, and further energy carriers, such as gas, heat, etc., besides the traditional electrical one, must be considered. Therefore a more powerful model, provided with enhanced nodes or conversion points, able to deal with multidimensional flows, is being required. This article addresses the issue of modeling a local multi-carrier energy network. This problem can be considered as an extension of modeling a low voltage distribution network located at some urban or rural geographic area. But instead of using an external power flow analysis package to do the power flow calculations, as used in electric networks, in this work we integrate a multiagent algorithm to perform the task, in a concurrent way to the other simulation tasks, and not only for the electric fluid but also for a number of additional energy carriers. As the model is mainly focused in system operation, generation and load models are not developed
β-expansion attractors observed in A/D converters
Kohda, Tohru; Horio, Yoshihiko; Aihara, Kazuyuki
2012-12-01
The recently proposed β-encoders, analog-to-digital converters using an amplifier with a factor β and a flaky quantizer with threshold ν, have proven to be explained by the deterministic dynamics of multi-valued Rényi-Parry maps. Such a map is locally eventually onto [ν-1, ν), which is topologically conjugate to Parry's (β,α)-map with α =(β-1)(ν-1). This implies that β-encoders have a closed subinterval [ν-1,ν), which includes an attractor. Thus, the iteration of the multi-valued Rényi-Parry map performs the β-expansion of x while quantization errors in β-encoders behave chaotically and do not converge to a fixed point. This β-expansion attractor is relatively simpler than previously reported attractors. The object of this paper is twofold: to observe the embedded attractors in the β-encoder and to identify attractors that are useful for spread-spectrum codes and optimization techniques using pseudo-random numbers.
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.
Discrete dynamic modeling of cellular signaling networks.
Albert, Réka; Wang, Rui-Sheng
2009-01-01
Understanding signal transduction in cellular systems is a central issue in systems biology. Numerous experiments from different laboratories generate an abundance of individual components and causal interactions mediating environmental and developmental signals. However, for many signal transduction systems there is insufficient information on the overall structure and the molecular mechanisms involved in the signaling network. Moreover, lack of kinetic and temporal information makes it difficult to construct quantitative models of signal transduction pathways. Discrete dynamic modeling, combined with network analysis, provides an effective way to integrate fragmentary knowledge of regulatory interactions into a predictive mathematical model which is able to describe the time evolution of the system without the requirement for kinetic parameters. This chapter introduces the fundamental concepts of discrete dynamic modeling, particularly focusing on Boolean dynamic models. We describe this method step-by-step in the context of cellular signaling networks. Several variants of Boolean dynamic models including threshold Boolean networks and piecewise linear systems are also covered, followed by two examples of successful application of discrete dynamic modeling in cell biology.
Constitutive modelling of composite biopolymer networks.
Fallqvist, B; Kroon, M
2016-04-21
The mechanical behaviour of biopolymer networks is to a large extent determined at a microstructural level where the characteristics of individual filaments and the interactions between them determine the response at a macroscopic level. Phenomena such as viscoelasticity and strain-hardening followed by strain-softening are observed experimentally in these networks, often due to microstructural changes (such as filament sliding, rupture and cross-link debonding). Further, composite structures can also be formed with vastly different mechanical properties as compared to the individual networks. In this present paper, we present a constitutive model presented in a continuum framework aimed at capturing these effects. Special care is taken to formulate thermodynamically consistent evolution laws for dissipative effects. This model, incorporating possible anisotropic network properties, is based on a strain energy function, split into an isochoric and a volumetric part. Generalisation to three dimensions is performed by numerical integration over the unit sphere. Model predictions indicate that the constitutive model is well able to predict the elastic and viscoelastic response of biological networks, and to an extent also composite structures. Copyright © 2016 Elsevier Ltd. All rights reserved.
Modelling students' knowledge organisation: Genealogical conceptual networks
Koponen, Ismo T.; Nousiainen, Maija
2018-04-01
Learning scientific knowledge is largely based on understanding what are its key concepts and how they are related. The relational structure of concepts also affects how concepts are introduced in teaching scientific knowledge. We model here how students organise their knowledge when they represent their understanding of how physics concepts are related. The model is based on assumptions that students use simple basic linking-motifs in introducing new concepts and mostly relate them to concepts that were introduced a few steps earlier, i.e. following a genealogical ordering. The resulting genealogical networks have relatively high local clustering coefficients of nodes but otherwise resemble networks obtained with an identical degree distribution of nodes but with random linking between them (i.e. the configuration-model). However, a few key nodes having a special structural role emerge and these nodes have a higher than average communicability betweenness centralities. These features agree with the empirically found properties of students' concept networks.
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.
Bayesian network modelling of upper gastrointestinal bleeding
Aisha, Nazziwa; Shohaimi, Shamarina; Adam, Mohd Bakri
2013-09-01
Bayesian networks are graphical probabilistic models that represent causal and other relationships between domain variables. In the context of medical decision making, these models have been explored to help in medical diagnosis and prognosis. In this paper, we discuss the Bayesian network formalism in building medical support systems and we learn a tree augmented naive Bayes Network (TAN) from gastrointestinal bleeding data. The accuracy of the TAN in classifying the source of gastrointestinal bleeding into upper or lower source is obtained. The TAN achieves a high classification accuracy of 86% and an area under curve of 92%. A sensitivity analysis of the model shows relatively high levels of entropy reduction for color of the stool, history of gastrointestinal bleeding, consistency and the ratio of blood urea nitrogen to creatinine. The TAN facilitates the identification of the source of GIB and requires further validation.
2016-02-04
of complex systems [1]. Although the ODD protocol was originally intended for individual-based or agent-based models ( ABM ), we adopt this protocol for...applies to information transfer between air-gapped systems . Trust relationships between devices (e.g. a trust relationship created by a domain controller...prevention systems , and data leakage protection systems . 2.2 ATTACKER The model specifies an attacker who gains access to internal enclaves by
International Nuclear Information System (INIS)
Markovic, D; Gros, C
2009-01-01
A class of models describing the flow of information within networks via routing processes is proposed and investigated, concentrating on the effects of memory traces on the global properties. The long-term flow of information is governed by cyclic attractors, allowing to define a measure for the information centrality of a vertex given by the number of attractors passing through this vertex. We find the number of vertices having a nonzero information centrality to be extensive/subextensive for models with/without a memory trace in the thermodynamic limit. We evaluate the distribution of the number of cycles, of the cycle length and of the maximal basins of attraction, finding a complete scaling collapse in the thermodynamic limit for the latter. Possible implications of our results for the information flow in social networks are discussed.
Modeling and optimization of potable water network
Energy Technology Data Exchange (ETDEWEB)
Djebedjian, B.; Rayan, M.A. [Mansoura Univ., El-Mansoura (Egypt); Herrick, A. [Suez Canal Authority, Ismailia (Egypt)
2000-07-01
Software was developed in order to optimize the design of water distribution systems and pipe networks. While satisfying all the constraints imposed such as pipe diameter and nodal pressure, it was based on a mathematical model treating looped networks. The optimum network configuration and cost are determined considering parameters like pipe diameter, flow rate, corresponding pressure and hydraulic losses. It must be understood that minimum cost is relative to the different objective functions selected. The determination of the proper objective function often depends on the operating policies of a particular company. The solution for the optimization technique was obtained by using a non-linear technique. To solve the optimal design of network, the model was derived using the sequential unconstrained minimization technique (SUMT) of Fiacco and McCormick, which decreased the number of iterations required. The pipe diameters initially assumed were successively adjusted to correspond to the existing commercial pipe diameters. The technique was then applied to a two-loop network without pumps or valves. Fed by gravity, it comprised eight pipes, 1000 m long each. The first evaluation of the method proved satisfactory. As with other methods, it failed to find the global optimum. In the future, research efforts will be directed to the optimization of networks with pumps and reservoirs. 24 refs., 3 tabs., 1 fig.
Modelling dendritic ecological networks in space: An integrated network perspective
Erin E. Peterson; Jay M. Ver Hoef; Dan J. Isaak; Jeffrey A. Falke; Marie-Josee Fortin; Chris E. Jordan; Kristina McNyset; Pascal Monestiez; Aaron S. Ruesch; Aritra Sengupta; Nicholas Som; E. Ashley Steel; David M. Theobald; Christian E. Torgersen; Seth J. Wenger
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...
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.
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.
The dimension of attractors underlying periodic turbulent Poiseuille flow
Keefe, Laurence; Moin, Parviz; Kim, John
1992-01-01
A lower bound on the Liapunov dimenison, D-lambda, of the attractor underlying turbulent, periodic Poiseuille flow at a pressure-gradient Reynolds number of 3200 is calculated, on the basis of a coarse-grained (16x33x8) numerical solution, to be approximately 352. Comparison of Liapunov exponent spectra from this and a higher-resolution (16x33x16) simulation on the same spatial domain shows these spectra to have a universal shape when properly scaled. On the basis of these scaling properties, and a partial exponent spectrum from a still higher-resolution (32x33x32) simulation, it is argued that the actual dimension of the attractor underlying motion of the given computational domain is approximately 780. It is suggested that this periodic turbulent shear flow is deterministic chaos, and that a strange attractor does underly solutions to the Navier-Stokes equations in such flows.
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...
Strange attractors in weakly turbulent Couette-Taylor flow
Brandstater, A.; Swinney, Harry L.
1987-01-01
An experiment is conducted on the transition from quasi-periodic to weakly turbulent flow of a fluid contained between concentric cylinders with the inner cylinder rotating and the outer cylinder at rest. Power spectra, phase-space portraits, and circle maps obtained from velocity time-series data indicate that the nonperiodic behavior observed is deterministic, that is, it is described by strange attractors. Various problems that arise in computing the dimension of strange attractors constructed from experimental data are discussed and it is shown that these problems impose severe requirements on the quantity and accuracy of data necessary for determining dimensions greater than about 5. In the present experiment the attractor dimension increases from 2 at the onset of turbulence to about 4 at a Reynolds number 50-percent above the onset of turbulence.
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.
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......Communication networks are becoming more essential for our daily lives and critically important for industry and governments. The intense growth in the backbone traffic implies an increment of the power demands of the transmission systems. This power usage might have a significant negative effect...
A Model for Telestrok Network Evaluation
DEFF Research Database (Denmark)
Storm, Anna; Günzel, Franziska; Theiss, Stephan
2011-01-01
analysis lacking, current telestroke reimbursement by third-party payers is limited to special contracts and not included in the regular billing system. Based on a systematic literature review and expert interviews with health care economists, third-party payers and neurologists, a Markov model...... was developed from the third-party payer perspective. In principle, it enables telestroke networks to conduct cost-effectiveness studies, because the majority of the required data can be extracted from health insurance companies’ databases and the telestroke network itself. The model presents a basis...
Finite-time Lyapunov dimension and hidden attractor of the Rabinovich system
Kuznetsov, N. V.; Leonov, G. A.; Mokaev, T. N.; Prasad, A.; Shrimali, M. D.
2015-01-01
The Rabinovich system, describing the process of interaction between waves in plasma, is considered. It is shown that the Rabinovich system can exhibit a hidden attractor in the case of multistability as well as a classical self-excited attractor. The hidden attractor in this system can be localized by analytical/numerical methods based on the continuation and perpetual points. The concept of finite-time Lyapunov dimension is developed for numerical study of the dimension of attractors. A con...
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.
Mobility Models for Next Generation Wireless Networks Ad Hoc, Vehicular and Mesh Networks
Santi, Paolo
2012-01-01
Mobility Models for Next Generation Wireless Networks: Ad Hoc, Vehicular and Mesh Networks provides the reader with an overview of mobility modelling, encompassing both theoretical and practical aspects related to the challenging mobility modelling task. It also: Provides up-to-date coverage of mobility models for next generation wireless networksOffers an in-depth discussion of the most representative mobility models for major next generation wireless network application scenarios, including WLAN/mesh networks, vehicular networks, wireless sensor networks, and
Modeling Renewable Penertration Using a Network Economic Model
Lamont, A.
2001-03-01
This paper evaluates the accuracy of a network economic modeling approach in designing energy systems having renewable and conventional generators. The network approach models the system as a network of processes such as demands, generators, markets, and resources. The model reaches a solution by exchanging prices and quantity information between the nodes of the system. This formulation is very flexible and takes very little time to build and modify models. This paper reports an experiment designing a system with photovoltaic and base and peak fossil generators. The level of PV penetration as a function of its price and the capacities of the fossil generators were determined using the network approach and using an exact, analytic approach. It is found that the two methods agree very closely in terms of the optimal capacities and are nearly identical in terms of annual system costs.
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.
Analysis of chaos attractors of MCG-recordings.
Jiang, Shiqin; Yang, Fan; Yi, Panke; Chen, Bo; Luo, Ming; Wang, Lemin
2006-01-01
By studying the chaos attractor of cardiac magnetic induction strength B(z) generated by the electrical activity of the heart, we found that its projection in the reconstructed phase space has a similar shape with the map of the total current dipole vector. It is worth noting that the map of the total current dipole vector is computed with MCG recordings measured at 36 locations, whereas the chaos attractor of B(z) is generated by only one cardiac magnetic field recordings on the measured plan. We discuss only two subjects of different ages in this paper.
STRANGE ATTRACTORS ON PSEUDOSPECTRAL SOLUTIONS FOR DISSIPATIVE ZAKHAROV EQUATIONS
Institute of Scientific and Technical Information of China (English)
马书清; 常谦顺
2004-01-01
In this paper, the pseudospcctral method to solve the dissipative Zakharov equations is used. Its convergence is proved by priori estinates. The existence of the global attractors and the estimates of dimension are presented. A class of steady state solutions is also disscussed. The numerical results show that if the steady state solutions satisfy some special conditions, they become unstable and limit cycles and strange attractors will occur for very small perturbations.The largest Lyapunov exponent and analysis of the lincarized system are applied to explain these phenomena.
Simplified Chua's attractor via bridging a diode pair
Directory of Open Access Journals (Sweden)
Quan Xu
2015-04-01
Full Text Available In this paper, a simplified Chua's circuit is realised by bridging a diode pair between a passive LC (inductance and capacitance in parallel connection - LC oscillator and an active RC (resistance and capacitance in parallel connection - RC filter. The dynamical behaviours of the circuit are investigated by numerical simulations and verified by experimental measurements. It is found that the simplified Chua's circuit generates Chua's attractors similarly and demonstrates complex non-linear phenomena including coexisting bifurcation modes and coexisting attractors in particular.
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.
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.
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.
Modeling and Simulation Network Data Standards
2011-09-30
approaches . 2.3. JNAT. JNAT is a Web application that provides connectivity and network analysis capability. JNAT uses propagation models and low-fidelity...COMBATXXI Movement Logger Data Output Dictionary. Field # Geocentric Coordinates (GCC) Heading Geodetic Coordinates (GDC) Heading Universal...B-8 Field # Geocentric Coordinates (GCC) Heading Geodetic Coordinates (GDC) Heading Universal Transverse Mercator (UTM) Heading
The Kuramoto model in complex networks
Rodrigues, Francisco A.; Peron, Thomas K. DM.; Ji, Peng; Kurths, Jürgen
2016-01-01
Synchronization of an ensemble of oscillators is an emergent phenomenon present in several complex systems, ranging from social and physical to biological and technological systems. The most successful approach to describe how coherent behavior emerges in these complex systems is given by the paradigmatic Kuramoto model. This model has been traditionally studied in complete graphs. However, besides being intrinsically dynamical, complex systems present very heterogeneous structure, which can be represented as complex networks. This report is dedicated to review main contributions in the field of synchronization in networks of Kuramoto oscillators. In particular, we provide an overview of the impact of network patterns on the local and global dynamics of coupled phase oscillators. We cover many relevant topics, which encompass a description of the most used analytical approaches and the analysis of several numerical results. Furthermore, we discuss recent developments on variations of the Kuramoto model in networks, including the presence of noise and inertia. The rich potential for applications is discussed for special fields in engineering, neuroscience, physics and Earth science. Finally, we conclude by discussing problems that remain open after the last decade of intensive research on the Kuramoto model and point out some promising directions for future research.
An architectural model for network interconnection
van Sinderen, Marten J.; Vissers, C.A.; Kalin, T.
1983-01-01
This paper presents a technique of successive decomposition of a common users' activity to illustrate the problems of network interconnection. The criteria derived from this approach offer a structuring principle which is used to develop an architectural model that embeds heterogeneous subnetworks
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
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.
Modeling Insurgent Network Structure and Dynamics
Gabbay, Michael; Thirkill-Mackelprang, Ashley
2010-03-01
We present a methodology for mapping insurgent network structure based on their public rhetoric. Indicators of cooperative links between insurgent groups at both the leadership and rank-and-file levels are used, such as joint policy statements or joint operations claims. In addition, a targeting policy measure is constructed on the basis of insurgent targeting claims. Network diagrams which integrate these measures of insurgent cooperation and ideology are generated for different periods of the Iraqi and Afghan insurgencies. The network diagrams exhibit meaningful changes which track the evolution of the strategic environment faced by insurgent groups. Correlations between targeting policy and network structure indicate that insurgent targeting claims are aimed at establishing a group identity among the spectrum of rank-and-file insurgency supporters. A dynamical systems model of insurgent alliance formation and factionalism is presented which evolves the relationship between insurgent group dyads as a function of their ideological differences and their current relationships. The ability of the model to qualitatively and quantitatively capture insurgent network dynamics observed in the data is discussed.
Hybrid simulation models of production networks
Kouikoglou, Vassilis S
2001-01-01
This book is concerned with a most important area of industrial production, that of analysis and optimization of production lines and networks using discrete-event models and simulation. The book introduces a novel approach that combines analytic models and discrete-event simulation. Unlike conventional piece-by-piece simulation, this method observes a reduced number of events between which the evolution of the system is tracked analytically. Using this hybrid approach, several models are developed for the analysis of production lines and networks. The hybrid approach combines speed and accuracy for exceptional analysis of most practical situations. A number of optimization problems, involving buffer design, workforce planning, and production control, are solved through the use of hybrid models.
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.
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 sys...... 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
Unified Model for Generation Complex Networks with Utility Preferential Attachment
International Nuclear Information System (INIS)
Wu Jianjun; Gao Ziyou; Sun Huijun
2006-01-01
In this paper, based on the utility preferential attachment, we propose a new unified model to generate different network topologies such as scale-free, small-world and random networks. Moreover, a new network structure named super scale network is found, which has monopoly characteristic in our simulation experiments. Finally, the characteristics of this new network are given.
Functional model of biological neural networks.
Lo, James Ting-Ho
2010-12-01
A functional model of biological neural networks, called temporal hierarchical probabilistic associative memory (THPAM), is proposed in this paper. THPAM comprises functional models of dendritic trees for encoding inputs to neurons, a first type of neuron for generating spike trains, a second type of neuron for generating graded signals to modulate neurons of the first type, supervised and unsupervised Hebbian learning mechanisms for easy learning and retrieving, an arrangement of dendritic trees for maximizing generalization, hardwiring for rotation-translation-scaling invariance, and feedback connections with different delay durations for neurons to make full use of present and past informations generated by neurons in the same and higher layers. These functional models and their processing operations have many functions of biological neural networks that have not been achieved by other models in the open literature and provide logically coherent answers to many long-standing neuroscientific questions. However, biological justifications of these functional models and their processing operations are required for THPAM to qualify as a macroscopic model (or low-order approximate) of biological neural networks.
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...
Lai, Bang-Cheng; He, Jian-Jun
2018-03-01
In this paper, we construct a novel 4D autonomous chaotic system with four cross-product nonlinear terms and five equilibria. The multiple coexisting attractors and the multiscroll attractor of the system are numerically investigated. Research results show that the system has various types of multiple attractors, including three strange attractors with a limit cycle, three limit cycles, two strange attractors with a pair of limit cycles, two coexisting strange attractors. By using the passive control theory, a controller is designed for controlling the chaos of the system. Both analytical and numerical studies verify that the designed controller can suppress chaotic motion and stabilise the system at the origin. Moreover, an electronic circuit is presented for implementing the chaotic system.
A Networks Approach to Modeling Enzymatic Reactions.
Imhof, P
2016-01-01
Modeling enzymatic reactions is a demanding task due to the complexity of the system, the many degrees of freedom involved and the complex, chemical, and conformational transitions associated with the reaction. Consequently, enzymatic reactions are not determined by precisely one reaction pathway. Hence, it is beneficial to obtain a comprehensive picture of possible reaction paths and competing mechanisms. By combining individually generated intermediate states and chemical transition steps a network of such pathways can be constructed. Transition networks are a discretized representation of a potential energy landscape consisting of a multitude of reaction pathways connecting the end states of the reaction. The graph structure of the network allows an easy identification of the energetically most favorable pathways as well as a number of alternative routes. © 2016 Elsevier Inc. All rights reserved.
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.
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
Low-dimensional chaotic attractors in drift wave turbulence
International Nuclear Information System (INIS)
Persson, M.; Nordman, H.
1991-01-01
Simulation results of toroidal η i -mode turbulence are analyzed using mathematical tools of nonlinear dynamics. Low-dimensional chaotic attractors are found in the strongly nonlinear regime while in the weakly interacting regime the dynamics is high dimensional. In both regimes, the solutions are found to display sensitive dependence on initial conditions, characterized by a positive largest Liapunov exponent. (au)
The Geometric Structure of Strange Attractors in the Lozi Map
Institute of Scientific and Technical Information of China (English)
YongluoCAO; ZengrongLIU
1998-01-01
In this paper,the structure of the strange attractors in the Lozi map is investigated on basis of the results gotten by the authors in 1991-1993,The new results of the strange atrtractors of the Lozi map show that our viewpoint is correct.
Global attractors for the coupled suspension bridge system with temperature
Czech Academy of Sciences Publication Activity Database
Dell'Oro, Filippo; Giorgi, C.
2016-01-01
Roč. 39, č. 4 (2016), s. 864-875 ISSN 0170-4214 Institutional support: RVO:67985840 Keywords : absorbing set * coupled bridge system * global attractor Subject RIV: BA - General Mathematics Impact factor: 1.017, year: 2016 http://onlinelibrary.wiley.com/doi/10.1002/mma.3526/abstract
Probability Density Function Method for Observing Reconstructed Attractor Structure
Institute of Scientific and Technical Information of China (English)
陆宏伟; 陈亚珠; 卫青
2004-01-01
Probability density function (PDF) method is proposed for analysing the structure of the reconstructed attractor in computing the correlation dimensions of RR intervals of ten normal old men. PDF contains important information about the spatial distribution of the phase points in the reconstructed attractor. To the best of our knowledge, it is the first time that the PDF method is put forward for the analysis of the reconstructed attractor structure. Numerical simulations demonstrate that the cardiac systems of healthy old men are about 6 - 6.5 dimensional complex dynamical systems. It is found that PDF is not symmetrically distributed when time delay is small, while PDF satisfies Gaussian distribution when time delay is big enough. A cluster effect mechanism is presented to explain this phenomenon. By studying the shape of PDFs, that the roles played by time delay are more important than embedding dimension in the reconstruction is clearly indicated. Results have demonstrated that the PDF method represents a promising numerical approach for the observation of the reconstructed attractor structure and may provide more information and new diagnostic potential of the analyzed cardiac system.
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.
On reliability of singular-value decomposition in attractor reconstruction
International Nuclear Information System (INIS)
Palus, M.; Dvorak, I.
1990-12-01
Applicability of singular-value decomposition for reconstructing the strange attractor from one-dimensional chaotic time series, proposed by Broomhead and King, is extensively tested and discussed. Previously published doubts about its reliability are confirmed: singular-value decomposition, by nature a linear method, is only of a limited power when nonlinear structures are studied. (author). 29 refs, 9 figs
A novel 3D autonomous system with different multilayer chaotic attractors
International Nuclear Information System (INIS)
Dong Gaogao; Du Ruijin; Tian Lixin; Jia Qiang
2009-01-01
This Letter proposes a novel three-dimensional autonomous system which has complex chaotic dynamics behaviors and gives analysis of novel system. More importantly, the novel system can generate three-layer chaotic attractor, four-layer chaotic attractor, five-layer chaotic attractor, multilayer chaotic attractor by choosing different parameters and initial condition. We analyze the new system by means of phase portraits, Lyapunov exponent spectrum, fractional dimension, bifurcation diagram and Poincare maps of the system. The three-dimensional autonomous system is totally different from the well-known systems in previous work. The new multilayer chaotic attractors are also worth causing attention.
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...... variables of the system. However, this approach disregards any spatial structure of the system, which may potentially change the behaviour drastically. An alternative approach is to construct a cellular automaton with nearest neighbour interactions, or even to model the system as a complex network...... with interactions defined by network topology. In this thesis I first describe three different biological models of ageing and cancer, in which spatial structure is important for the system dynamics. I then turn to describe characteristics of ecosystems consisting of three cyclically interacting species...
Fractional virus epidemic model on financial networks
Directory of Open Access Journals (Sweden)
Balci Mehmet Ali
2016-01-01
Full Text Available In this study, we present an epidemic model that characterizes the behavior of a financial network of globally operating stock markets. Since the long time series have a global memory effect, we represent our model by using the fractional calculus. This model operates on a network, where vertices are the stock markets and edges are constructed by the correlation distances. Thereafter, we find an analytical solution to commensurate system and use the well-known differential transform method to obtain the solution of incommensurate system of fractional differential equations. Our findings are confirmed and complemented by the data set of the relevant stock markets between 2006 and 2016. Rather than the hypothetical values, we use the Hurst Exponent of each time series to approximate the fraction size and graph theoretical concepts to obtain the variables.
Entanglement effects in model polymer networks
Everaers, R.; Kremer, K.
The influence of topological constraints on the local dynamics in cross-linked polymer melts and their contribution to the elastic properties of rubber elastic systems are a long standing problem in statistical mechanics. Polymer networks with diamond lattice connectivity (Everaers and Kremer 1995, Everaers and Kremer 1996a) are idealized model systems which isolate the effect of topology conservation from other sources of quenched disorder. We study their behavior in molecular dynamics simulations under elongational strain. In our analysis we compare the measured, purely entropic shear moduli G to the predictions of statistical mechanical models of rubber elasticity, making extensive use of the microscopic structural and topological information available in computer simulations. We find (Everaers and Kremer 1995) that the classical models of rubber elasticity underestimate the true change in entropy in a deformed network significantly, because they neglect the tension along the contour of the strands which cannot relax due to entanglements (Everaers and Kremer (in preparation)). This contribution and the fluctuations in strained systems seem to be well described by the constrained mode model (Everaers 1998) which allows to treat the crossover from classical rubber elasticity to the tube model for polymer networks with increasing strand length within one transparant formalism. While this is important for the description of the effects we try to do a first quantitative step towards their explanation by topological considerations. We show (Everaers and Kremer 1996a) that for the comparatively short strand lengths of our diamond networks the topology contribution to the shear modulus is proportional to the density of entangled mesh pairs with non-zero Gauss linking number. Moreover, the prefactor can be estimated consistently within a rather simple model developed by Vologodskii et al. and by Graessley and Pearson, which is based on the definition of an entropic
DEFF Research Database (Denmark)
Sindbæk, Søren Michael
2015-01-01
preserve patterns of thisinteraction. Formal network analysis and modelling holds the potential to identify anddemonstrate such patterns, where traditional methods often prove inadequate. Thearchaeological study of communication networks in the past, however, calls for radically different analytical...... this is not a problem of network analysis, but network synthesis: theclassic problem of cracking codes or reconstructing black-box circuits. It is proposedthat archaeological approaches to network synthesis must involve a contextualreading of network data: observations arising from individual contexts, morphologies...
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
A snapshot attractor view of the advection of inertial particles in the presence of history force
Guseva, Ksenia; Daitche, Anton; Tél, Tamás
2017-06-01
We analyse the effect of the Basset history force on the sedimentation or rising of inertial particles in a two-dimensional convection flow. We find that the concept of snapshot attractors is useful to understand the extraordinary slow convergence due to long-term memory: an ensemble of particles converges exponentially fast towards a snapshot attractor, and this attractor undergoes a slow drift for long times. We demonstrate for the case of a periodic attractor that the drift of the snapshot attractor can be well characterized both in the space of the fluid and in the velocity space. For the case of quasiperiodic and chaotic dynamics we propose the use of the average settling velocity of the ensemble as a distinctive measure to characterize the snapshot attractor and the time scale separation corresponding to the convergence towards the snapshot attractor and its own slow dynamics.
Birth of new folds and competing attractors in Elmo Bumpy Torus
Energy Technology Data Exchange (ETDEWEB)
Punjabi, A; Vahala, G
1984-04-09
The topology of equilibrium surfaces for the point model equations with neoclassical nonresonant ions in EBT is a complicated nongradient-dynamic version of the canonical cusp catastrophe. New folds emerge from degenerate equilibrium surfaces as the control vector (filling pressure, microwave power, ambipolar potential) is changed. Strong sensitivity to small changes in initial conditions of the state variables (electron/ion temperatures, plasma density) is found that can drastically alter the final equilibrium state when competing point attractors are present. 5 references, 3 figures.
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
Mapping and modeling of physician collaboration network.
Uddin, Shahadat; Hamra, Jafar; Hossain, Liaquat
2013-09-10
Effective provisioning of healthcare services during patient hospitalization requires collaboration involving a set of interdependent complex tasks, which needs to be carried out in a synergistic manner. Improved patients' outcome during and after hospitalization has been attributed to how effective different health services provisioning groups carry out their tasks in a coordinated manner. Previous studies have documented the underlying relationships between collaboration among physicians on the effective outcome in delivering health services for improved patient outcomes. However, there are very few systematic empirical studies with a focus on the effect of collaboration networks among healthcare professionals and patients' medical condition. On the basis of the fact that collaboration evolves among physicians when they visit a common hospitalized patient, in this study, we first propose an approach to map collaboration network among physicians from their visiting information to patients. We termed this network as physician collaboration network (PCN). Then, we use exponential random graph (ERG) models to explore the microlevel network structures of PCNs and their impact on hospitalization cost and hospital readmission rate. ERG models are probabilistic models that are presented by locally determined explanatory variables and can effectively identify structural properties of networks such as PCN. It simplifies a complex structure down to a combination of basic parameters such as 2-star, 3-star, and triangle. By applying our proposed mapping approach and ERG modeling technique to the electronic health insurance claims dataset of a very large Australian health insurance organization, we construct and model PCNs. We notice that the 2-star (subset of 3 nodes in which 1 node is connected to each of the other 2 nodes) parameter of ERG has significant impact on hospitalization cost. Further, we identify that triangle (subset of 3 nodes in which each node is connected to
Modeling In-Network Aggregation in VANETs
Dietzel, Stefan; Kargl, Frank; Heijenk, Geert; Schaub, Florian
2011-01-01
The multitude of applications envisioned for vehicular ad hoc networks requires efficient communication and dissemination mechanisms to prevent network congestion. In-network data aggregation promises to reduce bandwidth requirements and enable scalability in large vehicular networks. However, most
Different Epidemic Models on Complex Networks
International Nuclear Information System (INIS)
Zhang Haifeng; Small, Michael; Fu Xinchu
2009-01-01
Models for diseases spreading are not just limited to SIS or SIR. For instance, for the spreading of AIDS/HIV, the susceptible individuals can be classified into different cases according to their immunity, and similarly, the infected individuals can be sorted into different classes according to their infectivity. Moreover, some diseases may develop through several stages. Many authors have shown that the individuals' relation can be viewed as a complex network. So in this paper, in order to better explain the dynamical behavior of epidemics, we consider different epidemic models on complex networks, and obtain the epidemic threshold for each case. Finally, we present numerical simulations for each case to verify our results.
Centralized Bayesian reliability modelling with sensor networks
Czech Academy of Sciences Publication Activity Database
Dedecius, Kamil; Sečkárová, Vladimíra
2013-01-01
Roč. 19, č. 5 (2013), s. 471-482 ISSN 1387-3954 R&D Projects: GA MŠk 7D12004 Grant - others:GA MŠk(CZ) SVV-265315 Keywords : Bayesian modelling * Sensor network * Reliability Subject RIV: BD - Theory of Information Impact factor: 0.984, year: 2013 http://library.utia.cas.cz/separaty/2013/AS/dedecius-0392551.pdf
Modelling Pollutant Dispersion in a Street Network
Salem, N. Ben; Garbero, V.; Salizzoni, P.; Lamaison, G.; Soulhac, L.
2015-04-01
This study constitutes a further step in the analysis of the performances of a street network model to simulate atmospheric pollutant dispersion in urban areas. The model, named SIRANE, is based on the decomposition of the urban atmosphere into two sub-domains: the urban boundary layer, whose dynamics is assumed to be well established, and the urban canopy, represented as a series of interconnected boxes. Parametric laws govern the mass exchanges between the boxes under the assumption that the pollutant dispersion within the canopy can be fully simulated by modelling three main bulk transfer phenomena: channelling along street axes, transfers at street intersections, and vertical exchange between street canyons and the overlying atmosphere. Here, we aim to evaluate the reliability of the parametrizations adopted to simulate these phenomena, by focusing on their possible dependence on the external wind direction. To this end, we test the model against concentration measurements within an idealized urban district whose geometrical layout closely matches the street network represented in SIRANE. The analysis is performed for an urban array with a fixed geometry and a varying wind incidence angle. The results show that the model provides generally good results with the reference parametrizations adopted in SIRANE and that its performances are quite robust for a wide range of the model parameters. This proves the reliability of the street network approach in simulating pollutant dispersion in densely built city districts. The results also show that the model performances may be improved by considering a dependence of the wind fluctuations at street intersections and of the vertical exchange velocity on the direction of the incident wind. This opens the way for further investigations to clarify the dependence of these parameters on wind direction and street aspect ratios.
The Channel Network model and field applications
International Nuclear Information System (INIS)
Khademi, B.; Moreno, L.; Neretnieks, I.
1999-01-01
The Channel Network model describes the fluid flow and solute transport in fractured media. The model is based on field observations, which indicate that flow and transport take place in a three-dimensional network of connected channels. The channels are generated in the model from observed stochastic distributions and solute transport is modeled taking into account advection and rock interactions, such as matrix diffusion and sorption within the rock. The most important site-specific data for the Channel Network model are the conductance distribution of the channels and the flow-wetted surface. The latter is the surface area of the rock in contact with the flowing water. These parameters may be estimated from hydraulic measurements. For the Aespoe site, several borehole data sets are available, where a packer distance of 3 meters was used. Numerical experiments were performed in order to study the uncertainties in the determination of the flow-wetted surface and conductance distribution. Synthetic data were generated along a borehole and hydraulic tests with different packer distances were simulated. The model has previously been used to study the Long-term Pumping and Tracer Test (LPT2) carried out in the Aespoe Hard Rock Laboratory (HRL) in Sweden, where the distance travelled by the tracers was of the order hundreds of meters. Recently, the model has been used to simulate the tracer tests performed in the TRUE experiment at HRL, with travel distance of the order of tens of meters. Several tracer tests with non-sorbing and sorbing species have been performed
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.
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 by such ada......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...... by such adaptive applications are often partial fragments of an overall user model. The fragments have then to be collected and merged into a global user profile. In this paper we investigate and present algorithms able to cope with distributed, fragmented user models – based on Bayesian Networks – in the context...... 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...
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.
A network model for Ebola spreading.
Rizzo, Alessandro; Pedalino, Biagio; Porfiri, Maurizio
2016-04-07
The availability of accurate models for the spreading of infectious diseases has opened a new era in management and containment of epidemics. Models are extensively used to plan for and execute vaccination campaigns, to evaluate the risk of international spreadings and the feasibility of travel bans, and to inform prophylaxis campaigns. Even when no specific therapeutical protocol is available, as for the Ebola Virus Disease (EVD), models of epidemic spreading can provide useful insight to steer interventions in the field and to forecast the trend of the epidemic. Here, we propose a novel mathematical model to describe EVD spreading based on activity driven networks (ADNs). Our approach overcomes the simplifying assumption of homogeneous mixing, which is central to most of the mathematically tractable models of EVD spreading. In our ADN-based model, each individual is not bound to contact every other, and its network of contacts varies in time as a function of an activity potential. Our model contemplates the possibility of non-ideal and time-varying intervention policies, which are critical to accurately describe EVD spreading in afflicted countries. The model is calibrated from field data of the 2014 April-to-December spreading in Liberia. We use the model as a predictive tool, to emulate the dynamics of EVD in Liberia and offer a one-year projection, until December 2015. Our predictions agree with the current vision expressed by professionals in the field, who consider EVD in Liberia at its final stage. The model is also used to perform a what-if analysis to assess the efficacy of timely intervention policies. In particular, we show that an earlier application of the same intervention policy would have greatly reduced the number of EVD cases, the duration of the outbreak, and the infrastructures needed for the implementation of the intervention. Copyright © 2016 Elsevier Ltd. All rights reserved.
Modeling Network Transition Constraints with Hypergraphs
DEFF Research Database (Denmark)
Harrod, Steven
2011-01-01
Discrete time dynamic graphs are frequently used to model multicommodity flows or activity paths through constrained resources, but simple graphs fail to capture the interaction effects of resource transitions. The resulting schedules are not operationally feasible, and return inflated objective...... 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...... of train paths on a busy North American railway....
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.
Mathematical model for spreading dynamics of social network worms
International Nuclear Information System (INIS)
Sun, Xin; Liu, Yan-Heng; Han, Jia-Wei; Liu, Xue-Jie; Li, Bin; Li, Jin
2012-01-01
In this paper, a mathematical model for social network worm spreading is presented from the viewpoint of social engineering. This model consists of two submodels. Firstly, a human behavior model based on game theory is suggested for modeling and predicting the expected behaviors of a network user encountering malicious messages. The game situation models the actions of a user under the condition that the system may be infected at the time of opening a malicious message. Secondly, a social network accessing model is proposed to characterize the dynamics of network users, by which the number of online susceptible users can be determined at each time step. Several simulation experiments are carried out on artificial social networks. The results show that (1) the proposed mathematical model can well describe the spreading dynamics of social network worms; (2) weighted network topology greatly affects the spread of worms; (3) worms spread even faster on hybrid social networks
Model parameter updating using Bayesian networks
International Nuclear Information System (INIS)
Treml, C.A.; Ross, Timothy J.
2004-01-01
This paper outlines a model parameter updating technique for a new method of model validation using a modified model reference adaptive control (MRAC) framework with Bayesian Networks (BNs). The model parameter updating within this method is generic in the sense that the model/simulation to be validated is treated as a black box. It must have updateable parameters to which its outputs are sensitive, and those outputs must have metrics that can be compared to that of the model reference, i.e., experimental data. Furthermore, no assumptions are made about the statistics of the model parameter uncertainty, only upper and lower bounds need to be specified. This method is designed for situations where a model is not intended to predict a complete point-by-point time domain description of the item/system behavior; rather, there are specific points, features, or events of interest that need to be predicted. These specific points are compared to the model reference derived from actual experimental data. The logic for updating the model parameters to match the model reference is formed via a BN. The nodes of this BN consist of updateable model input parameters and the specific output values or features of interest. Each time the model is executed, the input/output pairs are used to adapt the conditional probabilities of the BN. Each iteration further refines the inferred model parameters to produce the desired model output. After parameter updating is complete and model inputs are inferred, reliabilities for the model output are supplied. Finally, this method is applied to a simulation of a resonance control cooling system for a prototype coupled cavity linac. The results are compared to experimental data.
Complex networks-based energy-efficient evolution model for wireless sensor networks
Energy Technology Data Exchange (ETDEWEB)
Zhu Hailin [Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, P.O. Box 106, Beijing 100876 (China)], E-mail: zhuhailin19@gmail.com; Luo Hong [Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia, Beijing University of Posts and Telecommunications, P.O. Box 106, Beijing 100876 (China); Peng Haipeng; Li Lixiang; Luo Qun [Information Secure Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, P.O. Box 145, Beijing 100876 (China)
2009-08-30
Based on complex networks theory, we present two self-organized energy-efficient models for wireless sensor networks in this paper. The first model constructs the wireless sensor networks according to the connectivity and remaining energy of each sensor node, thus it can produce scale-free networks which have a performance of random error tolerance. In the second model, we not only consider the remaining energy, but also introduce the constraint of links to each node. This model can make the energy consumption of the whole network more balanced. Finally, we present the numerical experiments of the two models.
Complex networks-based energy-efficient evolution model for wireless sensor networks
International Nuclear Information System (INIS)
Zhu Hailin; Luo Hong; Peng Haipeng; Li Lixiang; Luo Qun
2009-01-01
Based on complex networks theory, we present two self-organized energy-efficient models for wireless sensor networks in this paper. The first model constructs the wireless sensor networks according to the connectivity and remaining energy of each sensor node, thus it can produce scale-free networks which have a performance of random error tolerance. In the second model, we not only consider the remaining energy, but also introduce the constraint of links to each node. This model can make the energy consumption of the whole network more balanced. Finally, we present the numerical experiments of the two models.
Modeling online social networks based on preferential linking
International Nuclear Information System (INIS)
Hu Hai-Bo; Chen Jun; Guo Jin-Li
2012-01-01
We study the phenomena of preferential linking in a large-scale evolving online social network and find that the linear preference holds for preferential creation, preferential acceptance, and preferential attachment. Based on the linear preference, we propose an analyzable model, which illustrates the mechanism of network growth and reproduces the process of network evolution. Our simulations demonstrate that the degree distribution of the network produced by the model is in good agreement with that of the real network. This work provides a possible bridge between the micro-mechanisms of network growth and the macrostructures of online social networks
Modeling the Effect of Bandwidth Allocation on Network Performance
African Journals Online (AJOL)
... The proposed model showed improved performance for CDMA networks, but further increase in the bandwidth did not benefit the network; (iii) A reliability measure such as the spectral efficiency is therefore useful to redeem the limitation in (ii). Keywords: Coverage Capacity, CDMA, Mobile Network, Network Throughput ...
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...
Modelling dependable systems using hybrid Bayesian networks
International Nuclear Information System (INIS)
Neil, Martin; Tailor, Manesh; Marquez, David; Fenton, Norman; Hearty, Peter
2008-01-01
A hybrid Bayesian network (BN) is one that incorporates both discrete and continuous nodes. In our extensive applications of BNs for system dependability assessment, the models are invariably hybrid and the need for efficient and accurate computation is paramount. We apply a new iterative algorithm that efficiently combines dynamic discretisation with robust propagation algorithms on junction tree structures to perform inference in hybrid BNs. We illustrate its use in the field of dependability with two example of reliability estimation. Firstly we estimate the reliability of a simple single system and next we implement a hierarchical Bayesian model. In the hierarchical model we compute the reliability of two unknown subsystems from data collected on historically similar subsystems and then input the result into a reliability block model to compute system level reliability. We conclude that dynamic discretisation can be used as an alternative to analytical or Monte Carlo methods with high precision and can be applied to a wide range of dependability problems
Logic integer programming models for signaling networks.
Haus, Utz-Uwe; Niermann, Kathrin; Truemper, Klaus; Weismantel, Robert
2009-05-01
We propose a static and a dynamic approach to model biological signaling networks, and show how each can be used to answer relevant biological questions. For this, we use the two different mathematical tools of Propositional Logic and Integer Programming. The power of discrete mathematics for handling qualitative as well as quantitative data has so far not been exploited in molecular biology, which is mostly driven by experimental research, relying on first-order or statistical models. The arising logic statements and integer programs are analyzed and can be solved with standard software. For a restricted class of problems the logic models reduce to a polynomial-time solvable satisfiability algorithm. Additionally, a more dynamic model enables enumeration of possible time resolutions in poly-logarithmic time. Computational experiments are included.
When Darwin meets Lorenz: Evolving new chaotic attractors through genetic programming
International Nuclear Information System (INIS)
Pan, Indranil; Das, Saptarshi
2015-01-01
Highlights: •New 3D continuous time chaotic systems with analytical expressions are obtained. •The multi-gene genetic programming (MGGP) paradigm is employed to achieve this. •Extends earlier works for evolving generalised family of Lorenz attractors. •Over one hundred of new chaotic attractors along with their parameters are reported. •The MGGP method have the potential for finding other similar chaotic attractors. -- Abstract: In this paper, we propose a novel methodology for automatically finding new chaotic attractors through a computational intelligence technique known as multi-gene genetic programming (MGGP). We apply this technique to the case of the Lorenz attractor and evolve several new chaotic attractors based on the basic Lorenz template. The MGGP algorithm automatically finds new nonlinear expressions for the different state variables starting from the original Lorenz system. The Lyapunov exponents of each of the attractors are calculated numerically based on the time series of the state variables using time delay embedding techniques. The MGGP algorithm tries to search the functional space of the attractors by aiming to maximise the largest Lyapunov exponent (LLE) of the evolved attractors. To demonstrate the potential of the proposed methodology, we report over one hundred new chaotic attractor structures along with their parameters, which are evolved from just the Lorenz system alone
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.
Research on network information security model and system construction
Wang Haijun
2016-01-01
It briefly describes the impact of large data era on China’s network policy, but also brings more opportunities and challenges to the network information security. This paper reviews for the internationally accepted basic model and characteristics of network information security, and analyses the characteristics of network information security and their relationship. On the basis of the NIST security model, this paper describes three security control schemes in safety management model and the...
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.
Analysis of a dynamic model of guard cell signaling reveals the stability of signal propagation
Gan, Xiao; Albert, RéKa
Analyzing the long-term behaviors (attractors) of dynamic models of biological systems can provide valuable insight into biological phenotypes and their stability. We identified the long-term behaviors of a multi-level, 70-node discrete dynamic model of the stomatal opening process in plants. We reduce the model's huge state space by reducing unregulated nodes and simple mediator nodes, and by simplifying the regulatory functions of selected nodes while keeping the model consistent with experimental observations. We perform attractor analysis on the resulting 32-node reduced model by two methods: 1. converting it into a Boolean model, then applying two attractor-finding algorithms; 2. theoretical analysis of the regulatory functions. We conclude that all nodes except two in the reduced model have a single attractor; and only two nodes can admit oscillations. The multistability or oscillations do not affect the stomatal opening level in any situation. This conclusion applies to the original model as well in all the biologically meaningful cases. We further demonstrate the robustness of signal propagation by showing that a large percentage of single-node knockouts does not affect the stomatal opening level. Thus, we conclude that the complex structure of this signal transduction network provides multiple information propagation pathways while not allowing extensive multistability or oscillations, resulting in robust signal propagation. Our innovative combination of methods offers a promising way to analyze multi-level models.
Generating multi-double-scroll attractors via nonautonomous approach
Energy Technology Data Exchange (ETDEWEB)
Hong, Qinghui; Xie, Qingguo, E-mail: qgxie@mail.hust.edu.cn [Wuhan National Laboratory for Optoelectronics, Wuhan 430074 (China); Shen, Yi; Wang, Xiaoping [School of Automation, Huazhong University of Science and Technology, Wuhan 430074 (China)
2016-08-15
It is a common phenomenon that multi-scroll attractors are realized by introducing the various nonlinear functions with multiple breakpoints in double scroll chaotic systems. Differently, we present a nonautonomous approach for generating multi-double-scroll attractors (MDSA) without changing the original nonlinear functions. By using the multi-level-logic pulse excitation technique in double scroll chaotic systems, MDSA can be generated. A Chua's circuit, a Jerk circuit, and a modified Lorenz system are given as designed example and the Matlab simulation results are presented. Furthermore, the corresponding realization circuits are designed. The Pspice results are in agreement with numerical simulation results, which verify the availability and feasibility of this method.
Generating multi-double-scroll attractors via nonautonomous approach.
Hong, Qinghui; Xie, Qingguo; Shen, Yi; Wang, Xiaoping
2016-08-01
It is a common phenomenon that multi-scroll attractors are realized by introducing the various nonlinear functions with multiple breakpoints in double scroll chaotic systems. Differently, we present a nonautonomous approach for generating multi-double-scroll attractors (MDSA) without changing the original nonlinear functions. By using the multi-level-logic pulse excitation technique in double scroll chaotic systems, MDSA can be generated. A Chua's circuit, a Jerk circuit, and a modified Lorenz system are given as designed example and the Matlab simulation results are presented. Furthermore, the corresponding realization circuits are designed. The Pspice results are in agreement with numerical simulation results, which verify the availability and feasibility of this method.
Non-Abelian magnetized blackholes and unstable attractors
International Nuclear Information System (INIS)
Mosaffa, A.E.; Randjbar-Daemi, S.; Sheikh-Jabbari, M.M.
2006-12-01
Fluctuations of non-Abelian gauge fields in a background magnetic flux contain tachyonic modes and hence the background is unstable. We extend these results to the cases where the background flux is coupled to Einstein gravity and show that the corresponding spherically symmetric geometries, which in the absence of a cosmological constant are of the form of Reissner-Nordstroem blackholes or the AdS 2 x S 2 , are also unstable. We discuss the relevance of these instabilities to several places in string theory including various string compactifications and the attractor mechanism. Our results for the latter imply that the attractor mechanism shown to work for the extremal Abelian charged blackholes, cannot be applied in a straightforward way to the extremal non-Abelian colored blackholes. (author)
Attractors of dissipative structure in three dissipative fluids
International Nuclear Information System (INIS)
Kondoh, Yoshiomi
1993-10-01
A general theory with use of auto-correlations for distributions is presented to derive that realization of coherent structures in general dissipative dynamic systems is equivalent to that of self-organized states with the minimum dissipation rate for instantaneously contained energy. Attractors of dissipative structure are shown to be given by eigenfunctions for dissipative dynamic operators of the dynamic system and to constitute the self-organized and self-similar decay phase. Three typical examples applied to incompressible viscous fluids, to incompressible viscous and resistive magnetohydrodynamic (MHD) fluids and to compressible resistive MHD plasmas are presented to lead to attractors in the three dissipative fluids and to describe a common physical picture of self-organization and bifurcation of the dissipative structure. (author)
Torus-doubling process via strange nonchaotic attractors
International Nuclear Information System (INIS)
Mitsui, Takahito; Uenohara, Seiji; Morie, Takashi; Horio, Yoshihiko; Aihara, Kazuyuki
2012-01-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. -- Highlights: ► We report the occurrence of a torus-doubling process via strange nonchaotic attractors (SNAs). ► The process consists of the gradual fractalization of a torus and the Heagy–Hammel transition. ► The torus-doubling process via SNAs is also experimentally demonstrated in an electronic circuit.
A Hyperchaotic Attractor with Multiple Positive Lyapunov Exponents
International Nuclear Information System (INIS)
Guo-Si, Hu
2009-01-01
There are many hyperchaotic systems, but few systems can generate hyperchaotic attractors with more than three PLEs (positive Lyapunov exponents). A new hyperchaotic system, constructed by adding an approximate time-delay state feedback to a five-dimensional hyperchaotic system, is presented. With the increasing number of phase-shift units used in this system, the number of PLEs also steadily increases. Hyperchaotic attractors with 25 PLEs can be generated by this system with 32 phase-shift units. The sum of the PLEs will reach the maximum value when 23 phase-shift units are used. A simple electronic circuit, consisting of 16 operational amplifiers and two analogy multipliers, is presented for confirming hyperchaos of order 5, i.e., with 5 PLEs
Attractor reconstruction for non-linear systems: a methodological note
Nichols, J.M.; Nichols, J.D.
2001-01-01
Attractor reconstruction is an important step in the process of making predictions for non-linear time-series and in the computation of certain invariant quantities used to characterize the dynamics of such series. The utility of computed predictions and invariant quantities is dependent on the accuracy of attractor reconstruction, which in turn is determined by the methods used in the reconstruction process. This paper suggests methods by which the delay and embedding dimension may be selected for a typical delay coordinate reconstruction. A comparison is drawn between the use of the autocorrelation function and mutual information in quantifying the delay. In addition, a false nearest neighbor (FNN) approach is used in minimizing the number of delay vectors needed. Results highlight the need for an accurate reconstruction in the computation of the Lyapunov spectrum and in prediction algorithms.
Two stage neural network modelling for robust model predictive control.
Patan, Krzysztof
2018-01-01
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.
Pullback attractors for three-dimensional non-autonomous Navier–Stokes–Voigt equations
International Nuclear Information System (INIS)
García-Luengo, Julia; Marín-Rubio, Pedro; Real, José
2012-01-01
In this paper, we consider a non-autonomous Navier–Stokes–Voigt model, with which a continuous process can be associated. We study the existence and relationship between minimal pullback attractors for this process in two different frameworks, namely, for the universe of fixed bounded sets, and also for another universe given by a tempered condition. Since the model does not have a regularizing effect, obtaining asymptotic compactness for the process is a more involved task. We prove this in a relatively simple way just using an energy method. Our results simplify—and in some aspects generalize—some of those obtained previously for the autonomous and non-autonomous cases, since for example in section 4, regularity is not required for the boundary of the domain and the force may take values in V'. Under additional suitable assumptions, regularity results for these families of attractors are also obtained, via bootstrapping arguments. Finally, we also conclude some results concerning the attraction in the D(A) norm
Exact model reduction of combinatorial reaction networks
Directory of Open Access Journals (Sweden)
Fey Dirk
2008-08-01
Full Text Available Abstract Background Receptors and scaffold proteins usually possess a high number of distinct binding domains inducing the formation of large multiprotein signaling complexes. Due to combinatorial reasons the number of distinguishable species grows exponentially with the number of binding domains and can easily reach several millions. Even by including only a limited number of components and binding domains the resulting models are very large and hardly manageable. A novel model reduction technique allows the significant reduction and modularization of these models. Results We introduce methods that extend and complete the already introduced approach. For instance, we provide techniques to handle the formation of multi-scaffold complexes as well as receptor dimerization. Furthermore, we discuss a new modeling approach that allows the direct generation of exactly reduced model structures. The developed methods are used to reduce a model of EGF and insulin receptor crosstalk comprising 5,182 ordinary differential equations (ODEs to a model with 87 ODEs. Conclusion The methods, presented in this contribution, significantly enhance the available methods to exactly reduce models of combinatorial reaction networks.
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.
Resonances in a Chaotic Attractor Crisis of the Lorenz Flow
Tantet, Alexis; Lucarini, Valerio; Dijkstra, Henk A.
2018-02-01
Local bifurcations of stationary points and limit cycles have successfully been characterized in terms of the critical exponents of these solutions. Lyapunov exponents and their associated covariant Lyapunov vectors have been proposed as tools for supporting the understanding of critical transitions in chaotic dynamical systems. However, it is in general not clear how the statistical properties of dynamical systems change across a boundary crisis during which a chaotic attractor collides with a saddle. This behavior is investigated here for a boundary crisis in the Lorenz flow, for which neither the Lyapunov exponents nor the covariant Lyapunov vectors provide a criterion for the crisis. Instead, the convergence of the time evolution of probability densities to the invariant measure, governed by the semigroup of transfer operators, is expected to slow down at the approach of the crisis. Such convergence is described by the eigenvalues of the generator of this semigroup, which can be divided into two families, referred to as the stable and unstable Ruelle-Pollicott resonances, respectively. The former describes the convergence of densities to the attractor (or escape from a repeller) and is estimated from many short time series sampling the state space. The latter is responsible for the decay of correlations, or mixing, and can be estimated from a long times series, invoking ergodicity. It is found numerically for the Lorenz flow that the stable resonances do approach the imaginary axis during the crisis, as is indicative of the loss of global stability of the attractor. On the other hand, the unstable resonances, and a fortiori the decay of correlations, do not flag the proximity of the crisis, thus questioning the usual design of early warning indicators of boundary crises of chaotic attractors and the applicability of response theory close to such crises.
Long time behavior and attractors for energetically insulated fluid systems
Czech Academy of Sciences Publication Activity Database
Feireisl, Eduard
2010-01-01
Roč. 27, č. 4 (2010), s. 1587-1609 ISSN 1078-0947 R&D Projects: GA ČR GA201/09/0917 Institutional research plan: CEZ:AV0Z10190503 Keywords : Navier-Stokes-Fourier system * attractor * long time behavior Subject RIV: BA - General Mathematics Impact factor: 0.986, year: 2010 http://www.aimsciences.org/journals/displayArticles.jsp?paperID=5040
Attractors of magnetohydrodynamic flows in an Alfvenic state
Energy Technology Data Exchange (ETDEWEB)
Nunez, Manuel; Sanz, Javier [Departamento de Analisis Matematico, Universidad de Valladolid, Valladolid (Spain)
1999-08-13
We present a simplified form of the magnetohydrodynamic system which describes the evolution of a plasma where the small-scale velocity and magnetic field are aligned in the form of Alfven waves, such as happens in several turbulent situations. Bounds on the dimension of the global attractor are found, and are shown to be an improvement of the standard ones for the full magnetohydrodynamic equations. (author)
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.
Social network models predict movement and connectivity in ecological landscapes.
Fletcher, Robert J; Acevedo, Miguel A; Reichert, Brian E; Pias, Kyle E; Kitchens, Wiley M
2011-11-29
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 network models of categorical perception.
Damper, R I; Harnad, S R
2000-05-01
Studies of the categorical perception (CP) of sensory continua have a long and rich history in psychophysics. In 1977, Macmillan, Kaplan, and Creelman introduced the use of signal detection theory to CP studies. Anderson and colleagues simultaneously proposed the first neural model for CP, yet this line of research has been less well explored. In this paper, we assess the ability of neural-network models of CP to predict the psychophysical performance of real observers with speech sounds and artificial/novel stimuli. We show that a variety of neural mechanisms are capable of generating the characteristics of CP. Hence, CP may not be a special model of perception but an emergent property of any sufficiently powerful general learning system.
Combination of Bayesian Network and Overlay Model in User Modeling
Directory of Open Access Journals (Sweden)
Loc Nguyen
2009-12-01
Full Text Available The core of adaptive system is user model containing personal information such as knowledge, learning styles, goals… which is requisite for learning personalized process. There are many modeling approaches, for example: stereotype, overlay, plan recognition… but they don’t bring out the solid method for reasoning from user model. This paper introduces the statistical method that combines Bayesian network and overlay modeling so that it is able to infer user’s knowledge from evidences collected during user’s learning process.
On the renormalization group perspective of α-attractors
Energy Technology Data Exchange (ETDEWEB)
Narain, Gaurav, E-mail: gaunarain@itp.ac.cn [Kavli Institute for Theoretical Physics China (KITPC), Key Laboratory of Theoretical Physics, Institute of Theoretical Physics (ITP), Chinese Academy of Sciences -CAS, Beijing 100190 (China)
2017-10-01
In this short paper we outline a recipe for the reconstruction of F ( R ) gravity starting from single field inflationary potentials in the Einstein frame. For simple potentials one can compute the explicit form of F ( R ), whilst for more involved examples one gets a parametric form of F ( R ). The F ( R ) reconstruction algorithm is used to study various examples: power-law φ {sup n} , exponential and α -attractors. In each case it is seen that for large R (corresponding to large value of inflaton field), F ( R ) ∼ R {sup 2}. For the case of α -attractors F ( R ) ∼ R {sup 2} for all values of inflaton field (for all values of R ) as α → 0. For generic inflaton potential V (φ), it is seen that if V {sup '}/ V →0 (for some φ) then the corresponding F ( R ) ∼ R {sup 2}. We then study α-attractors in more detail using non-perturbative renormalisation group methods to analyse the reconstructed F ( R ). It is seen that α →0 is an ultraviolet stable fixed point of the renormalisation group trajectories.
Approximate convex hull of affine iterated function system attractors
International Nuclear Information System (INIS)
Mishkinis, Anton; Gentil, Christian; Lanquetin, Sandrine; Sokolov, Dmitry
2012-01-01
Highlights: ► We present an iterative algorithm to approximate affine IFS attractor convex hull. ► Elimination of the interior points significantly reduces the complexity. ► To optimize calculations, we merge the convex hull images at each iteration. ► Approximation by ellipses increases speed of convergence to the exact convex hull. ► We present a method of the output convex hull simplification. - Abstract: In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output approximate convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In addition, we introduce a method to simplify the approximate convex hull without loss of accuracy.
Topological and metric properties of Henon-type strange attractors
International Nuclear Information System (INIS)
Cvitanovic, P.; Gunaratne, G.H.; Procaccia, I.
1988-01-01
We use the set of all periodic points of Henon-type mappings 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 chemical bondbchemical bond<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, we reconstruct (to resolution of order b/sup n/) the physical attractor by piecing together the linearized neighborhoods of all periodic points of cycle length n. We use this representation to compute the singularity spectrum f(α). The description in terms of periodic points works very well in the ''hyperbolic phase,'' for α larger than some α/sub c/, where α/sub c/ is the value of α corresponding to the (conjectured) phase transition
Investigating parameters participating in the infant respiratory control system attractor.
Terrill, Philip I; Wilson, Stephen J; Suresh, Sadasivam; Cooper, David M; Dakin, Carolyn
2008-01-01
Theoretically, any participating parameter in a non-linear system represents the dynamics of the whole system. Taken's time delay embedding theory provides the fundamental basis for allowing non-linear analysis to be performed on physiological, time-series data. In practice, only one measurable parameter is required to be measured to convey an accurate representation of the system dynamics. In this paper, the infant respiratory control system is represented using three variables-a digitally sampled respiratory inductive plethysmography waveform, and the derived parameters tidal volume and inter-breath interval time series data. For 14 healthy infants, these data streams were analysed using recurrence plot analysis across one night of sleep. The measured attractor size of these variables followed the same qualitative trends across the nights study. Results suggest that the attractor size measures of the derived IBI and tidal volume are representative surrogates for the raw respiratory waveform. The extent to which the relative attractor sizes of IBI and tidal volume remain constant through changing sleep state could potentially be used to quantify pathology, or maturation of breathing control.
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.
Pruning Boltzmann networks and hidden Markov models
DEFF Research Database (Denmark)
Pedersen, Morten With; Stork, D.
1996-01-01
We present sensitivity-based pruning algorithms for general Boltzmann networks. Central to our methods is the efficient calculation of a second-order approximation to the true weight saliencies in a cross-entropy error. Building upon previous work which shows a formal correspondence between linear...... Boltzmann chains and hidden Markov models (HMMs), we argue that our method can be applied to HMMs as well. We illustrate pruning on Boltzmann zippers, which are equivalent to two HMMs with cross-connection links. We verify that our second-order approximation preserves the rank ordering of weight saliencies...
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.
Lemieux, Maxime; Josset, Nicolas; Roussel, Marie; Couraud, Sébastien; Bretzner, Frédéric
2016-01-01
Locomotion results from an interplay between biomechanical constraints of the muscles attached to the skeleton and the neuronal circuits controlling and coordinating muscle activities. Quadrupeds exhibit a wide range of locomotor gaits. Given our advances in the genetic identification of spinal and supraspinal circuits important to locomotion in the mouse, it is now important to get a better understanding of the full repertoire of gaits in the freely walking mouse. To assess this range, young adult C57BL/6J mice were trained to walk and run on a treadmill at different locomotor speeds. Instead of using the classical paradigm defining gaits according to their footfall pattern, we combined the inter-limb coupling and the duty cycle of the stance phase, thus identifying several types of gaits: lateral walk, trot, out-of-phase walk, rotary gallop, transverse gallop, hop, half-bound, and full-bound. Out-of-phase walk, trot, and full-bound were robust and appeared to function as attractor gaits (i.e., a state to which the network flows and stabilizes) at low, intermediate, and high speeds respectively. In contrast, lateral walk, hop, transverse gallop, rotary gallop, and half-bound were more transient and therefore considered transitional gaits (i.e., a labile state of the network from which it flows to the attractor state). Surprisingly, lateral walk was less frequently observed. Using graph analysis, we demonstrated that transitions between gaits were predictable, not random. In summary, the wild-type mouse exhibits a wider repertoire of locomotor gaits than expected. Future locomotor studies should benefit from this paradigm in assessing transgenic mice or wild-type mice with neurotraumatic injury or neurodegenerative disease affecting gait.
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....
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
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...
Joint Modelling of Structural and Functional Brain Networks
DEFF Research Database (Denmark)
Andersen, Kasper Winther; Herlau, Tue; Mørup, Morten
-parametric Bayesian network model which allows for joint modelling and integration of multiple networks. We demonstrate the model’s ability to detect vertices that share structure across networks jointly in functional MRI (fMRI) and diffusion MRI (dMRI) data. Using two fMRI and dMRI scans per subject, we establish...
Artificial Neural Network Modeling of an Inverse Fluidized Bed ...
African Journals Online (AJOL)
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 decomposition of pollutants in the reactor. The neural network has been trained with experimental data ...
Degree distribution of a new model for evolving networks
Indian Academy of Sciences (India)
on intuitive but realistic consideration that nodes are added to the network with both preferential and random attachments. The degree distribution of the model is between a power-law and an exponential decay. Motivated by the features of network evolution, we introduce a new model of evolving networks, incorporating the ...
Neural Network Based Models for Fusion Applications
Meneghini, Orso; Tema Biwole, Arsene; Luda, Teobaldo; Zywicki, Bailey; Rea, Cristina; Smith, Sterling; Snyder, Phil; Belli, Emily; Staebler, Gary; Canty, Jeff
2017-10-01
Whole device modeling, engineering design, experimental planning and control applications demand models that are simultaneously physically accurate and fast. This poster reports on the ongoing effort towards the development and validation of a series of models that leverage neural-Ânetwork (NN) multidimensional regression techniques to accelerate some of the most mission critical first principle models for the fusion community, such as: the EPED workflow for prediction of the H-Mode and Super H-Mode pedestal structure the TGLF and NEO models for the prediction of the turbulent and neoclassical particle, energy and momentum fluxes; and the NEO model for the drift-kinetic solution of the bootstrap current. We also applied NNs on DIII-D experimental data for disruption prediction and quantifying the effect of RMPs on the pedestal and ELMs. All of these projects were supported by the infrastructure provided by the OMFIT integrated modeling framework. Work supported by US DOE under DE-SC0012656, DE-FG02-95ER54309, DE-FC02-04ER54698.
Ferrari, F. A. S.; Viana, R. L.; Reis, A. S.; Iarosz, K. C.; Caldas, I. L.; Batista, A. M.
2018-04-01
The cerebral cortex plays a key role in complex cortical functions. It can be divided into areas according to their function (motor, sensory and association areas). In this paper, the cerebral cortex is described as a network of networks (cortex network), we consider that each cortical area is composed of a network with small-world property (cortical network). The neurons are assumed to have bursting properties with the dynamics described by the Rulkov model. We study the phase synchronization of the cortex network and the cortical networks. In our simulations, we verify that synchronization in cortex network is not homogeneous. Besides, we focus on the suppression of neural phase synchronization. Synchronization can be related to undesired and pathological abnormal rhythms in the brain. For this reason, we consider the delayed feedback control to suppress the synchronization. We show that delayed feedback control is efficient to suppress synchronous behavior in our network model when an appropriate signal intensity and time delay are defined.
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.
Tabor, Whitney; And Others
1997-01-01
Proposes a dynamical systems approach to parsing in which syntactic hypotheses are associated with attractors in a metric space. The experiments discussed documented various contingent frequency effects that cut across traditional linguistic grains, each of which was predicted by the dynamical systems model. (47 references) (Author/CK)