journal article
LitStream Collection
Home
doi: 10.1007/s11047-015-9521-6pmid: N/A
The mathematical analysis of the second-order phase transitions that occur in α-asynchronous cellular automata field is a highly challenging task. From the experimental side, these phenomena appear as a qualitative change of behaviour which separates a behaviour with an active phase, where the system evolves in a stationary state with fluctuations, from a passive state, where the system is absorbed in a homogeneous fixed state. The transition between the two phases is abrupt: we ask how to analyse this change and how to predict the critical value of the synchrony rate α. We show that an extension of the mean-field approximation, called the local structure theory, can be used to predict the existence of second-order phase transitions belonging to the directed percolation university class. The change of behaviour is related to the existence of a transcritical bifurcation in the local structure maps. We show that for a proper setting of the approximation, the form of the transition is predicted correctly and, more importantly, an increase in the level of local structure approximation allows one to gain precision on the value of the critical synchrony rate which separates the two phases.
doi: 10.1007/s11047-015-9522-5pmid: N/A
Probabilistic cellular automata generalise CA by implementing in a synchronous way an updating rule defined through a probability. A probabilistic synchronous updating scheme does it mean an efficient parallel evolution mechanism? This article deals with the question of quantifying the effectiveness of the parallel updating. A good indicator of this effectiveness is the fraction of components whose value is updated between two time steps. Two classes of parameterised models are considered. Multiple stationary distributions may occur when an infinite number of interacting components is considered (ergodicity breaks/supercritical regime). As a consequence, these models both exhibit different dynamical regimes in the corresponding case when a finite number of sites are interacting. These two classes’ non trivial steady states are of different nature. One is a family of positive rates reversible PCA dynamics. The other one is the Stavskaja PCA dynamics. It exhibits an absorbing state. Thanks to numerical simulations, both these PCA dynamics are shown to behave nearly asynchronous when these phase transition phenomena occur.
Klarner, Hannes; Bockmayr, Alexander; Siebert, Heike
doi: 10.1007/s11047-015-9520-7pmid: N/A
Asymptotic behaviors are often of particular interest when analyzing Boolean networks that represent biological systems such as signal transduction or gene regulatory networks. Methods based on a generalization of the steady state notion, the so-called trap spaces, can be exploited to investigate attractor properties as well as for model reduction techniques. In this paper, we propose a novel optimization-based method for computing all minimal and maximal trap spaces and motivate their use. In particular, we add a new result yielding a lower bound for the number of cyclic attractors and illustrate the methods with a study of a MAPK pathway model. To test the efficiency and scalability of the method, we compare the performance of the ILP solver gurobi with the ASP solver potassco in a benchmark of random networks.
doi: 10.1007/s11047-015-9523-4pmid: N/A
The study of relationships between structure and dynamics of asynchronous Boolean networks has recently led to the introduction of hereditarily bijective maps and even or odd self-dual networks. We show here that these two notions can be simply characterized geometrically: through orthogonality between certain affine subspaces. We also use this characterization to study operations preserving hereditary bijectiveness, and to provide effective methods for constructing hereditarily bijective maps and even or odd self-dual networks.
Streck, Adam; Lorenz, Therese; Siebert, Heike
doi: 10.1007/s11047-015-9525-2pmid: N/A
Multi-valued logical models can be used to describe biological networks on a high level of abstraction based on the network structure and logical parameters capturing regulatory effects. Interestingly, the dynamics of two distinct models need not necessarily be different, which might hint at either only non-functional characteristics distinguishing the models or at different possible implementations for the same behaviour. Here, we study the conditions allowing for such effects by analysing classes of dynamically equivalent models and both structurally maximal and minimal representatives of such classes. Finally, we present an efficient algorithm that constructs a minimal representative of the respective class of a given multi-valued model.
doi: 10.1007/s11047-014-9477-ypmid: 26612981
This article introduces methods for modeling compound granules used in algorithms which could successfully construct a mosaic from the images coming from an endoscope capsule. In order to apply the algorithm, combined images must have a common area where the correspondence of points is determined. That allows to determine the transformation parameters to compensate movement of the capsule that occurs between moments when the mosaic images were acquired. The developed algorithm for images from the capsule endoscopy has proved to be faster and comparably accurate as commercial GDB-ICP algorithm.
doi: 10.1007/s11047-014-9478-xpmid: N/A
Guided by a polymath approach—encompassing neuroscience, philosophy, psychology and computer science, this article describes a novel ‘cognitive’ computational mind framework for text comprehension in terms of Minsky’s ‘Society of Mind’ and ‘Emotion Machine’ theories. Observing a top-down design method, we enumerate here the macrocosmic elements of the model—the ‘agencies’ and memory constructs, followed by an elucidation on the working principles and synthesis concerns. Besides corroboration of results of a dry-run test by thoughts generated by random human subjects; the completeness of the conceptualized framework has been validated as a consequence of its total representation of ‘text understanding’ functions of the human brain, types of human memory and emulation of the layers of the mind. A brief conceptual comparison, between the architecture and existing ‘conscious’ agents, has been included as well. The framework, though observed here in its capacity as a text comprehender, is capable of understanding in general. A cognitive model of text comprehension, besides contributing to the ‘thinking machines’ research enterprise, is envisioned to be strategic in the design of intelligent plagiarism checkers, literature genre-cataloguers, differential diagnosis systems, and educational aids for children with reading disorders. Turing’s landmark 1950 article on computational intelligence is the principal motivator behind our research initiative.
Wang, Hui; Huang, Jiajin; Zhou, Erzhong; Huang, Zhisheng; Zhong, Ning
doi: 10.1007/s11047-014-9479-9pmid: N/A
With the increasing popularity of mobile phones, large amounts of real and reliable mobile phone data are being generated every day. These mobile phone data represent the practical travel routes of users and imply the intelligence of them in selecting a suitable route. Usually, an experienced user knows which route is congested in a specified period of time but unblocked in another period of time. Moreover, a route used frequently and recently by a user is usually the suitable one to satisfy the user’s needs. Adaptive control of thought-rational (ACT-R) is a computational cognitive architecture, which provides a good framework to understand the principles and mechanisms of information organization, retrieval and selection in human memory. In this paper, we employ ACT-R to model the process of selecting a suitable route of users. We propose a cognition-inspired route evaluation method to mine the intelligence of users in selecting a suitable route, evaluate the suitability of the routes, and then recommend an ordered list of routes for subscribers. Experiments show that it is effective and feasible to evaluate the suitability of the routes inspired by cognition.
Qu, Ri; Shang, Bingjian; Bao, Yanru; Song, Dawei; Teng, ChunMing; Zhou, Zhiwei
doi: 10.1007/s11047-014-9481-2pmid: N/A
We firstly investigate the multipartite entanglement features of the quantum states by means of the separable degree and the entanglement measure. Then we give the qualitative and quantitative descriptions of the entanglement dynamics of the quantum states in Grover’s search algorithm. Our results show that for most instances (1) the separable degrees of these states and ranges of their maximum Schmidt numbers are invariable by following the dynamics of Grover’s search algorithm; (2) the dynamics of Grover’s search algorithm is almost “filled” by the fully entangled states.
Showing 1 to 10 of 11 Articles