منابع مشابه
Associative Memory with Dynamic Synapses
We have examined a role of dynamic synapses in the stochastic Hopfield-like network behavior. Our results demonstrate an appearance of a novel phase characterized by quick transitions from one memory state to another. The network is able to retrieve memorized patterns corresponding to classical ferromagnetic states but switches between memorized patterns with an intermittent type of behavior. T...
متن کاملA Dynamic Model of Associative Semantic Memory
When we analyse a particular stimulus, a number of neurons in thebrain are specifically activated. The recognition of a visual pattern can be interpreted as the activation of a particular group of such neurons, in a particular way. Some recent results (Freeman, 1990) have shown that a group of neurons may respond to a stimulus with a coupled activity. This notion of coupled neural activity can ...
متن کاملCould dynamic attractors explain associative prosopagnosia?
Prosopagnosia is one of the many forms of visual associative agnosia, in which familiar faces lose their distinctive association. In the case of prosopagnosia, the ability to recognize familiar faces is lost, due to lesions in the medial occipitotemporal region. In "associative" prosopagnosia, the perceptual system seems adequate to allow for recognition, yet recognition cannot take place. Our ...
متن کاملAn Associative Dynamic Convex Hull Algorithm
This paper presents a new parallel algorithm for the dynamic convex hull problem. This algorithm is a parallel adaptation of the Jarvis March Algorithm. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and maximum functions. Also, ASC can be sup...
متن کاملA Compiler for Rewrite Programs in Associative-Commutative Theories
We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one ACmatching and reduced term construction. The proposed matching method is based on the construction of compact bipartite graphs, and is designed for working very efficiently on specific classes of AC patterns. We show how to refine this algorithm to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1996
ISSN: 0022-247X
DOI: 10.1006/jmaa.1996.0250