. In particular, we consider the serial-search strategy and the optimal search procedure to examine the uncertainty space. We derive a lower bound and an upper bound for the mean acquisition times (MATs) over all possible search procedures. These expressions give fundamental limits of the MATs. We then prove

for processes or processing resources, or may produce interfering cross-talk between the spatial information processing of the concurrent search tasks. Because of incongruity, as demonstrated in this study, serial search of objects at different orientations is difficult. To determine that two objects

mechanisms. Automatic detection is shown to develop following consistent mapping of stimuli to responses over trials. Controlled search is utilized in varied-mapping paradigms, and in our studies, it takes the form of serial, terminating search. The approach resolves a number of apparent conflicts

that a serial selfterminating search is necessary to detect conjunctions. In Experiment 1 of the present study, the subjects searched for a conjunction target (a green T) in displays of 2, 4, or 8 items. Positive and negative displaysize slopes were essentially the same in this range. In Experiment 2

Ever since Richard Stone (1954) first estimated a system of demand equations derived explicitly from consumer theory, there has been a continuing search for alternative specifications and functional forms. Many models have been proposed, but perhaps the most important in current use, apart from

to be consistent with Treisman's feature integration model, which proposes serial, self-terminating search for conjunctions. Searches for triple conjunctions (Color x Size x Form) are easier than searches for standard conjunctions and can be independent of set size. A guided search model similar to Hoffman

Abstract—In this paper, we investigate the serial-search-based initial code-acquisition performance of direct-sequence code division multiple access (DS-CDMA) employing multiple transmit/ multiple receive antennas when communicating over uncorrelated Rayleigh channels. We characterize

Alphabetic retrieval is a prototypical task that is studied to gain insight into how humans learn and process long lists. We shall study two conflicting models of this process: serial search and direct association. To distinguish between these models, we shall derive predictions about priming

was checked independently of the others. Unknown targets appear to be found only by serial search for each in turn. Searching through 4 sets of distractors was slower than searching through 2. The results suggest a modification of feature integration theory, in which attention is controlled not only by a

In this paper, we propose to use a nonparametric noncoherent detector for PN code acquisition in DS/CDMA systems. We compare two verification modes and show that type I performs better than type II. We also compare the type I double-dwell scheme using the proposed detector with that using the conventional detector. The PN code acquisition scheme with the proposed detector is robust and has better performance than that with the conventional detector when the estimation of the interference variance is not possible.