Search results for "Online"
showing 10 items of 4526 documents
Modelling and simulation of several interacting cellular automata
2015
Cellular automata are used for modelling and simulation of many systems. In some applications, the system is formed by a set of subsystems that can be modelled separately, but, in such cases, the existence of interactions between these subsystems requires additional modelling and computer programming. In this paper we propose a modelling methodology for the simulation of a set of cellular automata models that interact with each other. The modelling methodology is described, together with an insight on implementation details. Also, it is applied to a particular cellular automata model, the Sanpile model, to illustrate its use and to obtain some example simulations.
Canonical Retina-to-Cortex Vision Model Ready for Automatic Differentiation
2020
Canonical vision models of the retina-to-V1 cortex pathway consist of cascades of several Linear+Nonlinear layers. In this setting, parameter tuning is the key to obtain a sensible behavior when putting all these multiple layers to work together. Conventional tuning of these neural models very much depends on the explicit computation of the derivatives of the response with regard to the parameters. And, in general, this is not an easy task. Automatic differentiation is a tool developed by the deep learning community to solve similar problems without the need of explicit computation of the analytic derivatives. Therefore, implementations of canonical visual neuroscience models that are ready…
HOW SMART DOES AN AGENT NEED TO BE?
2005
The classic distributed computation is done by atoms, molecules or spins in vast numbers, each equipped with nothing more than the knowledge of their immediate neighborhood and the rules of statistical mechanics. These agents, 1023 or more, are able to form liquids and solids from gases, realize extremely complex ordered states, such as liquid crystals, and even decode encrypted messages. We will describe a study done for a sensor-array "challenge problem" in which we have based our approach on old-fashioned simulated annealing to accomplish target acquisition and tracking under the rules of statistical mechanics. We believe the many additional constraints that occur in the real problem ca…
A Tool for Implementing and Exploring SBM Models: Universal 1D Invertible Cellular Automata
2005
The easiest form of designing Cellular Automata rules with features such as invertibility or particle conserving is to rely on a partitioning scheme, the most important of which is the 2D Margolus neighborhood. In this paper we introduce a 1D Margolus-like neighborhood that gives support to a complete set of Cellular Automata models. We present a set of models called Sliding Ball Models based on this neighborhood and capable of universal computation. We show the way of designing logic gates with these models, propose a digital structure to implement them and finally we present SBMTool, a software development system capable of working with the new models.
A Logical Key Hierarchy Based approach to preserve content privacy in Decentralized Online Social Networks
2020
Distributed Online Social Networks (DOSNs) have been proposed to shift the control over user data from a unique entity, the online social network provider, to the users of the DOSN themselves. In this paper we focus on the problem of preserving the privacy of the contents shared to large groups of users. In general, content privacy is enforced by encrypting the content, having only authorized parties being able to decrypt it. When efficiency has to be taken into account, new solutions have to be devised that: i) minimize the re-encryption of the contents published in a group when the composition of the group changes; and, ii) enable a fast distribution of the cryptographic keys to all the m…
Diagrammatic approach to cellular automata and the emergence of form with inner structure
2018
We present a diagrammatic method to build up sophisticated cellular automata (CAs) as models of complex physical systems. The diagrams complement the mathematical approach to CA modeling, whose details are also presented here, and allow CAs in rule space to be classified according to their hierarchy of layers. Since the method is valid for any discrete operator and only depends on the alphabet size, the resulting conclusions, of general validity, apply to CAs in any dimension or order in time, arbitrary neighborhood ranges and topology. We provide several examples of the method, illustrating how it can be applied to the mathematical modeling of the emergence of order out of disorder. Specif…
Pseudo-Bosons, So Far
2011
In the past years several extensions of the canonical commutation relations have been proposed by different people in different contexts and some interesting physics and mathematics have been deduced. Here, we review some recent results on the so-called {\em pseudo-bosons}. They arise from a special deformation of the canonical commutation relation $[a,a^\dagger]=\1$, which is replaced by $[a,b]=\1$, with $b$ not necessarily equal to $a^\dagger$. We start discussing some of their mathematical properties and then we discuss several examples.
Multi-rogue waves solutions: from the NLS to the KP-I equation
2013
Our discovery of multi-rogue wave (MRW) solutions in 2010 completely changed the viewpoint on the links between the theory of rogue waves and integrable systems, and helped explain many phenomena which were never understood before. It is enough to mention the famous Three Sister waves observed in oceans, the creation of a regular approach to studying higher Peregrine breathers, and the new understanding of 2 + 1 dimensional rogue waves via the NLS-KP correspondence. This article continues the study of the MRW solutions of the NLS equation and their links with the KP-I equation started in a previous series of articles (Dubard et al 2010 Eur. Phys. J. 185 247–58, Dubard and Matveev 2011 Natur…
Analytical design of nonlinear optical loop mirrors for fiber-optic communication systems
2006
International audience; We propose an easy and efficient method for analytically designing nonlinear optical loop mirrors (NOLMs) for fiber-optic communication systems. This analytical design is based on a Taylor series expansion of the transfer function of the NOLM, from which highly stable dynamical regimes can be readily obtained for any desired pulse parameters. We present numerical simulations showing dramatically improved performances in a 160 Gb/s transmission system that incorporates the NOLMs designed analytically.
Quantum versus Probabilistic One-Way Finite Automata with Counter
2001
The paper adds the one-counter one-way finite automaton [6] to the list of classical computing devices having quantum counterparts more powerful in some cases. Specifically, two languages are considered, the first is not recognizable by deterministic one-counter one-way finite automata, the second is not recognizable with bounded error by probabilistic one-counter one-way finite automata, but each recognizable with bounded error by a quantum one-counter one-way finite automaton. This result contrasts the case of one-way finite automata without counter, where it is known [5] that the quantum device is actually less powerful than its classical counterpart.