Recognition of Temporal Sequences of Patterns
F. Zertuche, R. López-Peña, H. Waelbroeck
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.
Create a lesson
Related papers
A new discrete velocity method for Navier-Stokes equations
Michael Junk, S. V. Raghurama Rao
Construction of Molecular Dynamics Like Cellular Automata Models for Simulation of Compressible Fluid Dynamic Systems
Himanshu Agrawal
Lattice Gases and Cellular Automata
Bruce M. Boghosian
Cellular Automaton Rule184++C. A Simple Model for the Complex Dynamics of Various Particles Flow
A. Awazu
Exact results for deterministic cellular automata traffic models
Henryk Fuks
Crystalline Computation
Norman Margolus