Does nondirectional signalization of target distance contribute to navigation in the Morris water maze?

The possibility that rats can navigate in the Morris water maze by reducing the difference between the memorized platform scene and the current sensory input was tested in nine blind rats. A computerized videosystem monitored the rats' movements in the pool and converted the rat-target distance into tones the frequency of which increased in 64 equal steps from 120 Hz at 128 cm to 7680 Hz at 0 cm. During 15 days of training to find a fixed platform position from different starting points (12 trials per day) average escape latencies decreased from 39.0 to 25.4 s. The performance significantly deteriorated when the acoustic distance signalization was omitted and/or when the target position was changed form trial to trial. It is concluded that blind rats solved the task by simultaneously employing search strategy based on position responses, mapping using acoustic background beacons, and distance reduction navigation. It is argued that the various strategies are additive and that their relative significance depends of the conditions of the experiment.     

Generalized approaches to the maxbet problem and the maxdiff problem,with applications to canonical correlations

Van de Geer has reviewed various criteria for transforming two or more matrices to maximal agreement, subject to orthogonality constraints. The criteria have applications in the context of matching factor or configuration matrices and in the context of canonical correlation analysis for two or more matrices. The present paper summarizes and gives a unified treatment of fully general computational solutions for two of these criteria, Maxbet and Maxdiff. These solutions will be shown to encompass various well-known methods as special cases. It will be argued that the Maxdiff solution should be preferred to the Maxbet solution whenever the two criteria coincide. Horst's Maxcor method will be shown to lack the property of monotone convergence. Finally, simultaneous and successive versions of the Maxbet and Maxdiff solutions will be treated as special cases of a fully flexible approach where the columns of the rotation matrices are obtained in successive blocks.The author is obliged to Henk Kiers for computational assistance and helpful comments.     

The effect of a non-informative cueing signal in a three-choice reaction-time task

Summary Many studies have shown that in a simple reaction-time (RT) task a non-informative leading cue decreases RT to a subsequent target presented in the same region as the cue. This facilitation lasts about 150 ms; it is then replaced by a sustained inhibition. Experiment 1 tests the hypothesis that the initial facilitation is due to motor, rather than perceptual, processes by using choice RT. Facilitation is greater and lasts longer in choice than in simple tasks, thus supporting the hypothesis. Experiment 2 shows that facilitation occurs even when the subject actively orients his or her attention away from the cue.     

Intrusion patterns in rapid serial visual presentation tasks with two response dimensions

A rapid serial visual presentation (RSVP) paradigm using both one and two response dimensions was used to test parallel processing models of stimulus dimensions. Fifty subjects were asked to report the identity and/or color of a target uppercase word inserted in a series of lowercase words. The results produced a predominance of posttarget intrusions for color responses and a predominance of pretarget intrusions for identity responses. The requirement of a response to a second dimension impaired hit rates but did not change the pattern of intrusions. An examination of the distributions of intrusions in each response dimension as a function of the response given to the other dimension showed an unexpectedly high percentage of simultaneous hits, a moderate covariation between both responses, and the same patterns of intrusions when compared with the general distributions. While these results seem to be compatible with parallel models of processing for stimulus dimensions, two modifications to this model are suggested. First, the processing of response dimension(s) needs some attentional resources. Second, provision for a mixed model is indicated, which would include trials where no illusory conjunctions are formed.     

Neighborhood frequency effects and letter visibility in visual word recognition

Two experiments are described that measured lexical decision latencies and errors to five-letter French words with a single higher frequency orthographic neighbor and control words with no higher frequency neighbors. The higher frequency neighbor differed from the stimulus word by either the second letter (e.g.,astre-autre) or the fourth letter (chope-chose). Neighborhood frequency effects were found to interact with this factor, and significant interference was observed only tochope-type words. The effects of neighborhood frequency were also found to interact with the position of initial fixation in the stimulus word (either the second letter or the fourth letter). Interference was greatly reduced when the initial fixation was on the critical disambiguating letter (i.e., the letterp inchope). Moreover, word recognition was improved when subjects initially fixated the second letter relative to when they initially fixated the fourth letter of a five-letter word, but this second-letter advantage practically disappeared when the stimulus differed from a more frequent word by its fourth letter. The results are interpreted in terms of the interaction between visual and lexical factors in visual word recognition.     

Alternating least squares algorithms for simultaneous components analysis with equal component weight matrices in two or more populations

Millsap and Meredith (1988) have developed a generalization of principal components analysis for the simultaneous analysis of a number of variables observed in several populations or on several occasions. The algorithm they provide has some disadvantages. The present paper offers two alternating least squares algorithms for their method, suitable for small and large data sets, respectively. Lower and upper bounds are given for the loss function to be minimized in the Millsap and Meredith method. These can serve to indicate whether or not a global optimum for the simultaneous components analysis problem has been attained.Financial support by the Netherlands organization for scientific research (NWO) is gratefully acknowledged.     

Phoneme monitoring and lexical processing: Evidence for associative context effects

In this paper, we propose a new version of the phoneme monitoring task that is well-suited for the study of lexical processing. The generalized phoneme monitoring (GPM) task, in which subjects detect target phonemes appearing anywhere in the test words, was shown to be sensitive to associative context effects. In Experiment 1, using the standard phoneme monitoring procedure in which subjects detect only word-initial targets, no effect of associative context was obtained. In contrast, clear context effects were observed in Experiment 2, which used the GPM task. Subjects responded faster to word-initial and word-medial targets when the target-bearing words were preceded by an associatively related word than when preceded by an unrelated one. The differential effect of context in the two versions of the phoneme monitoring task was interpreted with reference to task demands and their role in directing selective attention. Experiment 3 showed that the size of the context effect was unaffected by the proportion of related words in the experiment, suggesting that the observed effects were not due to subject strategies.     

Least-squares approximation of an improper correlation matrix by a proper one

An algorithm is presented for the best least-squares fitting correlation matrix approximating a given missing value or improper correlation matrix. The proposed algorithm is based upon a solution for Mosier's oblique Procrustes rotation problem offered by ten Berge and Nevels. A necessary and sufficient condition is given for a solution to yield the unique global minimum of the least-squares function. Empirical verification of the condition indicates that the occurrence of non-optimal solutions with the proposed algorithm is very unlikely. A possible drawback of the optimal solution is that it is a singular matrix of necessity. In cases where singularity is undesirable, one may impose the additional nonsingularity constraint that the smallest eigenvalue of the solution be , where is an arbitrary small positive constant. Finally, it may be desirable to weight the squared errors of estimation differentially. A generalized solution is derived which satisfies the additional nonsingularity constraint and also allows for weighting. The generalized solution can readily be obtained from the standard unweighted singular solution by transforming the observed improper correlation matrix in a suitable way.