跳至主要内容

Fixation Effects on Forward and Backward Recall in a Spatial Working Memory Task

Spatial working memory is the ability to remember a location where something is perceived and the ability to recall a series of visited locations. During the last few decades, a great deal of research has specifically examined spatial working memory. A commonly used task to investigate spatial working memory is the Corsi blocks task, which is used originally as a neuropsychological assessment and which is now used also in empirical studies.

This study was designed to investigate whether fixation on the items to be remembered provided a beneficial effect on spatial working memory. Twenty-four undergraduate and graduate students (12 men, 12 women; M age = 21.5 yr., SD = 1.3, range = 18 - 24) volunteered to participate in the experiment. All had normal or corrected-to-normal vision. For the experiment, participants performed a computerized spatial working memory task based on the Corsi blocks task. Participants were tested individually in a private room. After the nine-point calibration procedure, the memory task was initiated. Participants were asked to recall a sequence of seven squares in the forward or the backward order. Participants were instructed to respond as quickly and accurately as possible. Participants’ responses in the memory task were classified into any one of the three categories: correct recall, location error, or order error. Eye movements scored in the memory task were analyzed for the fixation duration.

The results showed that the benefit by fixation was limited on serial position 6 for backward recall, where participants were able to recall immediately. No benefit was apparent by fixation for forward recall. Rather, for backward recall, recall performance was impaired at serial positions 1 and 3, or the latter part of recall, by requiring fixation on each target. Examination of details of the impairment revealed that order errors were increased.

In sum, in this study, a beneficial effect on recall performance by fixation on the items to be remembered was shown to a limited degree. However, if the methodological problem is eliminated, then the benefit of fixation can be demonstrated. Furthermore, the results suggest that some memory processes which proceed without fixation on the items being presented are relied upon to a greater degree for backward recall.


Article by Yuhei Oi, et al, from Japan.

Full access: http://t.cn/EcmRUPF

Image by thefeverhead, from Flickr-cc.

评论

此博客中的热门博文

Electron Spin and Proton Spin in the Hydrogen and Hydrogen-Like Atomic Systems

Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=52202#.VIj7tMnQrzE Author(s) Stanisław Olszewski * Affiliation(s) Institute of Physical Chemistry, Polish Academy of Sciences, Warsaw, Poland . ABSTRACT The mechanical angular momentum and magnetic moment of the electron and proton spin have been calculated semiclassically with the aid of the uncertainty principle for energy and time. The spin effects of both kinds of the elementary particles can be expressed in terms of similar formulae. The quantization of the spin motion has been done on the basis of the old quantum theory. It gives a quantum number n = 1/2 as the index of the spin state acceptable for both the electron and proton ...

Remarks on the Complexity of Signed k-Domination on Graphs

Read  full  paper  at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=53574#.VMnXsCzQrzE Author(s)    Chuan-Min Lee 1 , Cheng-Chien Lo 1 , Rui-Xin Ye 2 , Xun Xu 2 , Xiao-Han Shi 2 , Jia-Ying Li 2 Affiliation(s) 1 Department of Computer and Communication Engineering, Ming Chuan University, The First American University in Asia, Taoyuan, Taiwan, Chinese Taipei . 2 Department of Electronic Information Engineering, Fuzhou University, Fuzhou, China . ABSTRACT This paper is motivated by the concept of the signed k-domination problem and dedicated to the complexity of the problem on graphs. For any fixed nonnegative integer k, we show that the signed k-domination problem is NP-complete for doubly chordal graphs. For strongly chordal graphs and distance-hereditary graphs, we show that the signed k-domination problem can be solved in polynomial time. We also show that the problem is linear-time solvable for trees, interval graphs, and chord...

A Review of Technical Requirements for High Penetration of Wind Power Systems

Read full paper at: http://www.scirp.org/journal/PaperInformation.aspx?PaperID=52361#.VJN8VcCAM4 Author(s)    Yuan-Kang Wu 1 , Tung-Ching Lee 2 , Ting-Yen Hsieh 2 , Wei-Min Lin 2 Affiliation(s) 1 Department of Electrical Engineering, National Chung-Cheng University, Chiayi, Taiwan . 2 Green Energy and Environment Research Laboratories, Industrial Technology Research Institute, Hsinchu, Taiwan . ABSTRACT Renewable portfolio targets have been established in many regions around the world. Regional targets such as 20% renewable energy by year 2020 are not uncommon. As the levels of wind power penetration increase, there are many power system impacts. This work investigated possible challenges and technic...