zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A synthesis procedure for Hopfield’s continuous-time associative memory. (English) Zbl 0715.94021
Summary: The present paper presents a new technique for designing associative memories to be implemented by Hopfield neural networks. This technique guarantees that each desired memory is stored and is attractive. The procedure also guarantees that the resulting network is implementable, a requirement often overlooked by other methods. The present synthesis procedure does not require a symmetric interconnection matrix; instead, stability is guaranteed by use of the results presented in [A. N. Michel, J. A. Farrell, W. Porod, IEEE Trans. Circuits Syst. CAS-36, No.2, 229-243 (1989; Zbl 0672.94015)]. Two examples are presented that demonstrate the synthesis procedure’s storage ability and flexibility.
94C10Switching theory, application of Boolean algebra; Boolean functions
68T05Learning and adaptive systems
68Q10Modes of computation