Investigating interactions between search mechanisms in the control of visual attention
Bibliographic record
Abstract
Olds, Cowan and Jolicoeur (2000) showed that although the mechanisms underlying visual search have traditionally been assumed to be independent. in fact they interact. Using coloured disk stimuli, they interrupted pop-out search (target plus Dl distractors) by adding more distractors (D2s) of a different colour to the display before pop-out processes were able to find the target. In short, partially completed pop-out processes facilitated subsequent difficult search processes (“search assistance"). The present study investigated hypotheses for this interaction. In Experiments 1 and 2, we used methods aimed at determining where the bulk of attentional resources are allocated during search of a visual display assumed to produce search assistance (by measuring the effect of inhibition of return [IOR] between DI and D2 locations). In Experiment 1, we first presented observers with a search task that has been shown to produce search assistance (using coloured disks: see Olds et al., 2000). Immediately following target response, observers had to determine as quickly and accurately as possible whether a small probe-dot (that appeared on one of the disks) was present or absent. The results of Experiment 1 provided tentative support for a negative prioritisation hypothesis which proposed that some initial distractors (Dls) are eliminated from consideration during the second portion of the display. The sequence of events in Experiment 2 were identical to that of Experiment 1 except that, following target response, observers had to make a temporal order judgement (TOJ) as to which of two physically simultaneous lines (one on a Dl, and one on a D2) appeared first. The results of Experiment 2 did not support either of the hypotheses regarding the nature of search assistance. Experiment 3 examined the effect of spatial cues on difficult search by attempting to eliminate the effect of negative prioritisation while measuring the effect of positive prioritisation. The results of Experiment 3 provided evidence in support of a positive prioritisation hypothesis which proposed that the initial items are more likely to be searched in the second portion of the display. Future research is discussed.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".