منابع مشابه
Binocularity and visual search.
This paper describes a series of visual search experiments for targets defined by their hinocular characteristics. In searches for targets defined by binocular rivalry among fused distractors, or vice versa, the rivalrous items do not "pop out" (reaction time [RT] increases with number of distractors). Binocular luster, a variety of rivalry, is an exception. Luster, an important property of vis...
متن کاملMoray revisited: high-priority affective stimuli and visual search.
Previous research offers conflicting suggestions about whether "high-priority" verbal stimuli such as an individual's own name or emotionally charged words automatically grab attention and/or can be detected without the usual capacity limitations. Nine experiments investigated this issue, using visual search through displays of words. In speeded search tasks, the subject's own name was detected...
متن کاملFundamentals of Presbyopia: visual processing and binocularity in its transformation
Background The accommodation has considerable interactions with the pupil response, vergence response and binocularity. The transformation of visual reception processing and the changes of the binocular cooperation during the presbyopia development are still poorly studied. So, the regularities of visual system violation in the presbyopia formation need to be characterized. This study aims to r...
متن کاملDynamic Interpolation Search Revisited
A new dynamic Interpolation Search (IS) data structure is presented that achieves O(log log n) search time with high probability on unknown continuous or even discrete input distributions with measurable probability of key collisions, including power law and Binomial distributions. No such previous result holds for IS when the probability of key collisions is measurable. Moreover, our data stru...
متن کاملDigital Search Trees Revisited
Several algorithms have been proposed which build search trees using digital properties of the search keys. A general approach to the study of the average case performance of such algorithms is discussed, with particular attention to the analysis of the digital search tree structures of Coffman and Eve. Specifically, the method leads to the solution of a problem left open by Knuth, finding the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Vision
سال: 2016
ISSN: 1534-7362
DOI: 10.1167/16.12.1283