pith. sign in

arxiv: comp-gas/9408001 · v1 · submitted 1994-08-26 · comp-gas · nlin.CG

Recognition of Temporal Sequences of Patterns

classification comp-gas nlin.CG
keywords patternscapacityequationsobtainsequencethresholdassociativeasymmetric
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.