Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

PL EN


2005 | 43 | 1 | 37-5

Article title

MECHANISM OF TWO-PHASE WORKING MEMORY SEARCH: COMPUTATIONAL MODEL

Title variants

Languages of publication

PL

Abstracts

EN
Two-phase model of working memory (WM) search tries to explain memory search taking set size, positive vs negative trials difference and speed of stimuli presentation into consideration. It was assumed that in the first - parallel - phase cognitive system uses both bottom-up (items in memory) and top-down (target) activations to prepare to actual search. Preparation to search is a process of indexing memory contents that uses strength of items activation or their similarity to target. The second phase is a serial process of comparing the target with items stored in memory which leads to signal detection (positive trials) or recognition of its absence (negative trials). This paper describes an implementation of the model for verbal stimuli in ACT-R cognitive architecture. Two-phase model has been extended with two strategies of memory trace coding. Computational model simulates 95,4% and 97,4% variance observed in accuracy and reaction latencies, respectively. It replicates group differences in WM scanning. A comparison of alternative model versions falsifies single-phase models of WM scanning. A third search phase was needed to obtain best fit to the data: parallel and non-efficient search of partially active part of WM that is outside the focus of attention.

Year

Volume

43

Issue

1

Pages

37-5

Physical description

Document type

ARTICLE

Contributors

author
  • A. Chuderski, Uniwersytet Jagiellonski, ul Golebia 24, 31-007 Kraków, Poland

References

Document Type

Publication order reference

Identifiers

CEJSH db identifier
05PLAAAA00481208

YADDA identifier

bwmeta1.element.54c08453-66be-3229-9b05-c10fa804e8e2
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.