The concurrent-memory-load technique identifies attention demands with interactions between reaction-time-task parameters and the size of the load on memory. Three experiments are reported in which a multiple-choice, reaction time task involving two, four, and eig-ht stimulus-response (S-R) alternatives was performed alone and in the retention interval of a short-termmemory task involving order...

this study examined the effects of task complexity on written narrative production under different task complexity conditions by efl learners at different proficiency levels. task complexity was manipulated along robinson’s (2001b) proposed task complexity dimension of here-and-now (simple) vs. there-and-then (complex) in. accordingly, three specific measures of the written narratives were targ...

iii   this study was an attempt to determine the effect of task-based approach vs. traditional approach on the narrative and expository writing of the iranian efl learners. there were two control groups as well as two experimental ones in the current study. in the two control groups namely g1 and g2 narrative and expository writing were taught respectively using the traditiona...

background nowadays task sharing is a way to optimize utilization of human resources for health. this study was designed to assess the effect of task sharing, mutually between midwives and family health workforces (fhws), on the number of needed staff across the iranian health posts.   methods the workload and required number of midwives and fhws in a health post were calculated and compared in...

The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic realtime task systems. This paper discusses feasibility decision fo r a given real-time task system b y the rate monotonic scheduling algorithm. It presents a new necessary a n d suficient condition fo r a given task system to be feasible, and a new feasibility decision algorithm based on that cond...

It is shown that for a metric space (M,d) the following are equivalent: (i) M is a complete R-tree; (ii) M is hyperconvex and has unique metric segments.