Information Technology Reference
In-Depth Information
a
b
Fig. 5.10 Pseudorandom cue editing
memory. The count begins in this model with the count of 111
1. If there is
...
NoHit, the count jumps to 011
1. This takes the feature associated with the “0”
out and so increases the chance of a hit. This system will not add cues that were not
present initially.
In the case of four-toggle devices with only c2 and c4 equal one, the sequence will
be 1111, 0111, 0011, 1001, 1100, 1110, 1111. This shows how a pseudorandom
sequence forces the system to remove cues and then replace them and take others out.
When there are many cues, a pseudorandom search must be such as to change
only a few cues at each step. This is where clustering may be useful, since all except
one could be held fixed. The pseudorandom shift register counter approach is not
elaborated further beyond this point. The counter idea may be useful in understand-
ing, because with two methods, a contrasting is possible.
...
Conclusions
A cue editor is needed because memory lapses are quite common, and must be
resolved fairly quickly, within minutes. Memory search is constantly occurring
subliminally, in the background, independent of real time, as evidenced by the fact
 
Search WWH ::




Custom Search