Interactive effect of long-term mental stress and cardiac stress reactivity on carotid intima-media thickness: the Cardiovascular Risk in Young Finns study

The present study examined the interaction between vital exhaustion and cardiac reactivity and recovery on preclinical atherosclerosis assessed by carotid intima-media thickness (IMT) in young men and women. We measured heart rate (HR), respiratory sinus arrhythmia (RSA), and pre-ejection period (PEP) in response to mental arithmetic and speech tasks. Vital exhaustion and carotid IMT were also measured. Significant associations were observed for men aged 28-37 years, but not for men aged 22-25 years, nor for women in these age groups. It was shown that, among highly exhausted men in the older age group, lower HR reactivity was related to greater IMT. Our results also imply that, among non-exhausted men in this age group, slow HR and RSA recovery after acute stress predicted higher IMT. These results suggest that long-term stress as assessed by vital exhaustion is a risk only if it has resulted in ineffective cardiac stress reactivity. Autonomic imbalance resulting from chronic stress may be the common mechanism linking vital exhaustion and cardiac responsiveness to an increased risk of atherosclerosis.     

Ethical Theories and the Transparency Condition

Following John Rawls, writers like Bernard Williams and Christine Korsgaard have suggested that a transparency condition should be put on ethical theories. The exact nature of such a condition and its implications is however not anything on which there is any consensus. It is argued here that the ultimate rationale of transparency conditions is epistemic rather than substantively moral, but also that it clearly connects to substantive concerns about moral psychology. Finally, it is argued that once a satisfactory form of the transparency condition is formulated, then, at least among the main contenders within ethical theory, it speaks in favor of a broadly Aristotelian approach to ethical theorizing.     

Marriages and psychological distress among adult offspring of divorce: a Norwegian study

The study compares the likelihood of getting married and of getting divorced among the adult offspring of divorced parents versus the adult offspring of parents who remain married (total N = 37,230). It also compares levels of psychological distress in the two groups (total N= 22,898). Data derive from The Nord‐Trøndelag Health Study (HUNT) and population registries from Norway. Individuals with divorced parents tended to delay marriage or not marry at all. However, among those who married, there were more divorces among the offspring of divorced parents than among offspring of parents who were still married. Offspring of divorce tended to marry other offspring of divorce. These marriages were at especially high risk of dissolution. Parental divorce was particularly influential as a risk factor during the first years of marriage. Both parental divorce and the individuals’ own divorce were risk factors for psychological distress.     

Das Ausmaß von Müdigkeit und Erschöpfbarkeit in der über 60-jährigen Normalbevölkerung in Deutschland

In a community-based random sample of 622 elderly persons over 60 years of age, fatigue was assessed by means of the multidimensional fatigue inventory (MFI; a self-assessment measure). Higher fatigue values were found with increasing age, particularly physical feelings of fatigue, reduced activity and reduced motivation. Fatigue was associated with depression, with a low health-related quality of life and with subjective physical complaints. Distinct fatigue symptoms in the elderly should therefore be regarded as possible indicators for somatic and/or psychological burdens and should receive diagnostic and therapeutic attention. In the present paper, mean values and percentiles for different age groups over 60 years are given as norm values for the normal population over 60 years of age.     

Suppressing permutations or rigid planar rotations: A remedy against nonoptimal varimax rotations

Varimax rotation consists of iteratively rotating pairs of columns of a matrix to a maximal sum (over columns) of variances of squared elements of the matrix. Without loss of optimality, the two rotated columns can be permuted and/or reflected. Although permutations and reflections are harmless for each planar rotation per se, they can be harmful in Varimax rotation. Specifically, they often give rise to the phenomenon that certain pairs of columns are consistently skipped in the iterative process, whence Varimax will be terminated at a nonstationary point. The skipping phenomenon is demonstrated, and it is shown how to prevent it.The author is obliged to Henk Kiers for commenting on a previous draft.     

Explicit candecomp/parafac solutions for a contrived 2 × 2 × 2 array of rank three

Kruskal, Harshman and Lundy have contrived a special 2 × 2 × 2 array to examine formal properties of degenerate Candecomp/Parafac solutions. It is shown that for this array the Candecomp/Parafac loss has an infimum of 1. In addition, the array will be used to challenge the tradition of fitting Indscal and related models by means of the Candecomp/Parafac process.     

Some additional results on principal components analysis of three-mode data by means of alternating least squares algorithms

Kroonenberg and de Leeuw (1980) have developed an alternating least-squares method TUCKALS-3 as a solution for Tucker's three-way principal components model. The present paper offers some additional features of their method. Starting from a reanalysis of Tucker's problem in terms of a rank-constrained regression problem, it is shown that the fitted sum of squares in TUCKALS-3 can be partitioned according to elements of each mode of the three-way data matrix. An upper bound to the total fitted sum of squares is derived. Finally, a special case of TUCKALS-3 is related to the Carroll/Harshman CANDECOMP/PARAFAC model.     

Convergence properties of an iterative procedure of ipsatizing and standardizing a data matrix,with applications to parafac/candecomp preprocessing

Centering a matrix row-wise and rescaling it column-wise to a unit sum of squares requires an iterative procedure. It is shown that this procedure converges to a stable solution. This solution need not be centered row-wise if the limiting point of the interations is a matrix of rank one. The results of the present paper bear directly on several types of preprocessing methods in Parafac/Candecomp.