Emotional experiences during engagement in intrinsically and extrinsically motivated tasks

Previous theories of intrinsic motivation have traditionally ignored the experiential or subjective aspects of engagement in intrinsically and extrinsically motivated tasks. Part of the reason for the lack of research in this area was our ignorance of which emotions to study. Data are presented here from two studies designed to produce the first systematic evidence of changes in basic emotional states during task engagement. Our findings suggest that intrinsic and extrinsic tasks can be differentiated according to the emotional changes subjects retrospectively report about their engagement with these tasks, and point the way to future research incorporating emotion as an important variable to consider.The first author was supported in part by a Minority Fellowship administered by the American Psychological Association under a Clinical Training Grant from the National Institute of Mental Health (5 T01 MH13833), and by a Regents Fellowship from the University of California, Berkeley.     

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.     

Family interaction and child psychopathology: A comparison of two observation strategies

We examined two systems of assessing family interactions that are in common usage: a home based observation of free parent-child interaction and a clinic based observation of a structured mother-child problem solving discussion. Participants were 18 depressed, 27 conduct disordered and 16 comparison children and their mothers. Results indicated that: 1) these observations may yield very different data about child, and to a lesser extent, parent behavior, 2) parental affect in the clinic was related to their level of aversive behaviour in the home, 3) levels of both aversive and positive behavior for children and their mothers were correlated within each setting, 4) accuracy of diagnostic classifications made on the basis of the observational data were highest for comparison and conduct disordered children, but lowest for depressed children observed in the clinic, and 5) the inclusion of data on mothers' behavior increased classification accuracy for conduct disordered children only.     

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.     

Minimizing the number of observations: A generalization of the spearman-brown formula

A new method for determining the minimum number of observations per subject needed to achieve a specific generalizability coefficient is presented. This method, which consists of a branch-and-bound algorithm, allows for the employment of constraints specified by the investigator.     

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.