Optimizing Associative Information Transfer within Content-addressable Memory
نویسندگان
چکیده
This paper investigates an information-theoretic design principle, intended to support an evolution of a memory structure fitting a specific selection pressure: associative information transfer through the structure. The proposed criteria measure how much does associativity in memory add to the information transfer in terms of precision, recall and effectiveness. The study also introduces a conjectural analogy between memory retrieval and self-replication, with DNA as a partially-associative memory containing relevant information. DNA decoding by a complicated protein machinery (“cues” or ”keys”) may correspond to an associative recall: i.e., a replicated offspring is an associatively-recalled prototype. The proposed information-theoretic criteria intend to formalize the notion of information transfer involved in self-replication, and enable bio-inspired design of more effective memory structures.
منابع مشابه
DNA Hypernetworks for Information Storage and Retrieval
Content-addressability is a fundamental feature of human memory underlying many associative information retrieval tasks. In contrast to location-based memory devices, content-addressable memories require complex interactions between memory elements, which makes conventional computation paradigms difficult. Here we present a molecular computational model of content-addressable information storag...
متن کاملAn Optical Content-Adressable Parallel Processor for Fast Searching and Retrieving
Associative processing based on content-addressable memories has been argued to be the natural solution for non-numerical information processing applications. Unfortunately, the implementation requirements of these architectures using conventional electronic technology have been very cost prohibitive, and therefore associative processors have not been realized. Instead, software methods that em...
متن کاملComputer Science at Kent Regular expression matching using associative memory
This paper describes a method for the implementation of regular expression matching based on the use of a form of associative (or content addressable) memory. The regular expression matching is performed by converting the regular expression into a Deterministic Finite Automata, but then using associative memory to hold the state transition information. Rather than try t...
متن کاملHigh Order Neural Networks for Efficient Associative Memory Design
We propose learning rules for recurrent neural networks with high-order interactions between some or all neurons. The designed networks exhibit the desired associative memory function: perfect storage and retrieval of pieces of information and/or sequences of information of any complexity.
متن کاملApplication of an Associative Memory to the Analysis of Document Fax Images
An essential part of image analysis is the identification of objects within the image. This paper describes the results of applying a binary associative memory neural network (ADAM), to the complex task of identifying shapes in document images. The associative memory is used to implement the generalised Hough Transform, exploiting the fast look-up ability of the associative memory to give a hig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJUC
دوره 4 شماره
صفحات -
تاریخ انتشار 2008