Recognition of Temporal Sequences of Patterns

F. Zertuche; R. López-Peña; H. Waelbroeck

Home/Archive/arXiv

arXiv · comp-gas/9408001

Recognition of Temporal Sequences of Patterns

F. Zertuche·R. López-Peña·H. Waelbroeck

View original source ↗Read source document ↗Export metadata ↓

Abstract

Using an asymmetric associative network with synchronous updating, it is possible to recall a sequence of patterns. To obtain a stable sequence generation with a large storage capacity, we introduce a threshold that eliminates the contribution of weakly correlated patterns. For this system we find a set of evolution equations for the overlaps of the states with the patterns to be recognized. We solve these equations in the limit of the stationary cycle, and obtain the critical value of the capacity as a function of the threshold and temperature. Finally, a numerical simulation is made, confirming the theoretical results.

Explore related subjects

comp-gas nlin.CG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

F. Zertuche, R. López-Peña, H. Waelbroeck. 1994-08-26. Recognition of Temporal Sequences of Patterns. https://arxiv.org/abs/comp-gas/9408001

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv1999

Exact results for deterministic cellular automata traffic models

We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to a well known lattice path counting problem. Assuming infinite lattice size and random initial configuration, the flow can be expressed in terms of generalized hypergeometric function. We show that the steady state limit agrees with previously published results.

comp-gas↗

arXiv1999

A new discrete velocity method for Navier-Stokes equations

The relation between Latttice Boltzmann Method, which has recently become popular, and the Kinetic Schemes, which are routinely used in Computational Fluid Dynamics, is explored. A new discrete velocity model for the numerical solution of the Navier-Stokes equations for incompressible fluid flow is presented by combining both the approaches. The new scheme can be interpreted as a pseudo-compressibility method and, for a particular choice of parameters, this interpretation carries over to the Lattice Boltzmann Method.

comp-gas↗

arXiv1999

Construction of Molecular Dynamics Like Cellular Automata Models for Simulation of Compressible Fluid Dynamic Systems

This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results indicate, the attempt is successful. A systematic method for constructing cellular automata models of fluid dynamic systems is discovered and proposed following a review of the existing developments. The considerations required for constructing such models for fluid dynamic systems consisting of particles with arbitrary interaction potentials and existing over arbitrary spatial lattices are outlined. The method is illustrated by constructing a model for simulation of systems of particles moving with unit speed along the links of an underlying square spatial lattice. Using this model, two two-dimensional systems are simulated and studied for a number of model and system parameters. For almost all the model and system parameters, the results are found to be in complete agreement with the available theoretical predictions. For some model parameters, results show (expected) departure from theoretical predictions which is explained.

comp-gas↗