Neural Comp. Sign up for ETOCS
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Sevrani, F.
Right arrow Articles by Abe, K.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Sevrani, F.
Right arrow Articles by Abe, K.
(Neural Computation. 2000;12:451-472.)
© 2000 The MIT Press


Letter

On the Synthesis of Brain-State-in-a-Box Neural Models with Application to Associative Memory

Fation Sevrani

Department of Electrical Engineering, Faculty of Engineering, Tohoku University, Sendai 980-8579, Japan

Kennichi Abe

Department of Electrical Engineering, Faculty of Engineering, Tohoku University, Sendai 980-8579, Japan

In this article we present techniques for designing associative memories to be implemented by a class of synchronous discrete-time neural networks based on a generalization of the brain-state-in-a-box neural model. First, we address the local qualitative properties and global qualitative aspects of the class of neural networks considered. Our approach to the stability analysis of the equilibrium points of the network gives insight into the extent of the domain of attraction for the patterns to be stored as asymptotically stable equilibrium points and is useful in the analysis of the retrieval performance of the network and also for design purposes. By making use of the analysis results as constraints, the design for associative memory is performed by solving a constraint optimization problem whereby each of the stored patterns is guaranteed a substantial domain of attraction. The performance of the designed network is illustrated by means of three specific examples.




This article has been cited by other articles:


Home page
Neural Comput.Home page
Y. Xia
An Extended Projection Neural Network for Constrained Optimization
Neural Comput., April 1, 2004; 16(4): 863 - 883.
[Abstract] [Full Text] [PDF]


Home page
Neural Comput.Home page
P. Tino, B. G. Horne, and C. L. Giles
Attractive Periodic Sets in Discrete-Time Recurrent Networks (with Emphasis on Fixed-Point Stability and Bifurcations in Two-Neuron Networks)
Neural Comput., June 1, 2001; 13(6): 1379 - 1414.
[Abstract] [Full Text] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2000 by The MIT Press.