Pause measures during reading and recall in serial list learning

An investigation is reported into pausing and grouping during the serial learning of letter strings, when presented randomly by length and when presented in ascending order. Mean pause times for the reading and recall of longer lists were significantly greater than for lists of shorter span due to extended pausing at specific list positions. In general, reading rhythms were duplicated during recall. Subjects were highly consistent in maintaining their level of pause duration across lists and responded to additions in list length by increasing their number of groups, not by increasing group size. Triadic sequences were the most popular form of spontaneous organization. Pausing measures are discussed as indices of organizational strategies.     

Auditory evoked brain responses: Intensity functions from bipolar human scalp recordings

Average evoked brain responses were computed from four simultaneous recordings during binaural tone stimulation at 10 intensity levels. Amplitudes and latencies were measured for the prominent components, and linear regression coefficients were computed. The results indicate that the sensitivity of the evoked response to stimulus intensity is dependent upon the selection of the appropriate measure. Linear amplitude functions were demonstrated. Additional research relating these responses to psychophysical measures is suggested.     

Detection of extraneous signals during sentence recognition

In two separate experiments, 40 Ss were presented with recorded sentences during each of which a click occurred. Ss had to depress a key as soon as they heard the click. RTs were f aster when the click was located at the major syntactic break of the sentence compared with RTs to clicks not at a break. This confirmed the hypothesis that processing load is a function of the surface structure of sentences, although the role of minor breaks was not clear. A second finding was that RTs were slower when the click was in the first rather than in the second half of the sentence. This can also be explained in terms of differential processing loads.     

Orthogonal rotation algorithms

The quartimax and varimax algorithms for orthogonal rotation attempt to maximize particular simplicity criteria by a sequence of two-factor rotations. Derivations of these algorithms have been fairly complex. A simple general theory for obtaining two factor at a time algorithms for any polynomial simplicity criteria satisfying a natural symmetry condition is presented. It is shown that the degree of any symmetric criterion must be a multiple of four. A basic fourth degree algorithm, which is applicable to all symmetric fourth degree criteria, is derived and applied using a variety of criteria. When used with the quartimax and varimax criteria the algorithm is mathematically identical to the standard algorithms for these criteria. A basic eighth degree algorithm is also obtained and applied using a variety of eighth degree criteria. In general the problem of writing a basic algorithm for all symmetric criteria of any specified degree reduces to the problem of maximizing a trigonometric polynomial of degree one-fourth that of the criteria.This research was supported by the Bell Telephone Laboratories, Murray Hill, New Jersey and NIH Grant FR-3.