## αΊe present a linguistic extension from a crisp model by using a codification model that allows us to implement a fuzzy system on a discrete decision model. The paper begins with an introduction to the representation of fuzzy information, followed by a discussion of the codification method and t
A cryogenic associative memory
β Scribed by C.C. Yang; Julius T. Tou
- Publisher
- Elsevier Science
- Year
- 1967
- Tongue
- English
- Weight
- 739 KB
- Volume
- 284
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
β¦ Synopsis
A. new associative memory system composed of persistent-current bit-cells is developed. Each word of the memory system is associated with a selection and control network which is made up of only seven cryotrons. In the proposed system both reading and writing circuits are derived from three-terminal networks with complementary outputs. The writeselection lines are not connected in series, nor are the read-selection lines. Inductance of the circuit for reading or writing a word is made independent of the total number of word positions in the memory. Logic equations describing the reading, writing and comparison circuits are discussed. In this system the processes of comparison, including enabled and enabled-masked operations, sequential nondestructive reading or single individual word destructive reading, and automatic sequential writing, are performed in a simple manner. Furthermore, the matching condition of comparison and the termination of sequential writing and reading processes can be readily indicated.
π SIMILAR VOLUMES
We present a new associative memory model based on the Hamming memory, but where the winner-take-all network part is replaced by a layer of nodes with somewhat complex node functions. This new memory can produce output vectors with individual "don't know" bits. The simulations demonstrate that this
Greene, R.L., Connectionist hashed associative memory (Research Note), Artificial Intelligence 48 (1991) 87-98. This paper proposes the use of simple connectionist networks as hashing functions for sparse associative or content addressable memory. The robustness of such networks in the presence of n
## αΊe present a new associative memory model that stores arbitrary bipolar patterns without the problems we can find in other models like BAM or LAM. After identifying those problems we show the new memory topology and we explain its learning and recall stages. Mathematical demonstrations are provi