content addressable memory
(CAM, or "associative memory") A kind of storage device which includes
comparison logic with each bit of storage. A data value is broadcast to all
words of storage and compared with the values there. Words which match are
flagged in some way. Subsequent operations can then work on flagged words, e.g.
read them out one at a time or write to certain bit positions in all of them. A
CAM can thus operate as a data parallel (SIMD) processor.
CAMs are often used in caches and memory management units.
Consul « consultant « container class « content
addressable memory » content-based information
retrieval » Content Data Model » content-free
content-based information retrieval
<image, algorithm> (CBIR) A general term for methods for using
information stored in image archives.
[IEEE Computer, September 1995].
consultant « container class « content addressable
content-based information retrieval » Content
Data Model » content-free » contention slot
Content Data Model
(CDM) An SGML-based DoD specification for interactive manuals.
container class « content addressable memory «
content-based information retrieval « Content
Data Model » content-free » contention slot »
1. (By analogy with "context-free") Used of a message that adds nothing to the
recipient's knowledge. Though this adjective is sometimes applied to flamage, it
more usually connotes derision for communication styles that exalt form over
substance or are centred on concerns irrelevant to the subject ostensibly at
hand. Perhaps most used with reference to speeches by company presidents and
other professional manipulators.
See also four-colour glossies.
2. Within British schools the term refers to general-purpose software such as a
word processor, a spreadsheet or a program that tests spelling of words supplied
by the teacher. This is in contrast to software designed to teach a particular
topic, e.g. a plant growth simulation, an interactive periodic table or a
program that tests spelling of a predetermined list of words. Content-free
software can be more cost-effective as it can be reused for many lessons
throughout the syllabus.
content addressable memory « content-based
information retrieval « Content Data Model «
content-free » contention slot » context »
(Or contention period). Minimum time a host must transmit for before it can be
sure that no other host's packet has collided with its transmission. If the
maximum propagation delay from one host to any other is T, then a host that
starts to transmit at time t0 may collide with a host that starts just before t0
+ T. The first host will not detect the collision until time t0 + 2T.
content-based information retrieval « Content Data
Model « content-free « contention slot »
context » context clash » context-free