• Aucun résultat trouvé

Does adding information on job strain improve risk prediction for coronary heart disease beyond the standard Framingham risk score? The Whitehall II study.: job strain and CHD risk stratification

N/A
N/A
Protected

Academic year: 2021

Partager "Does adding information on job strain improve risk prediction for coronary heart disease beyond the standard Framingham risk score? The Whitehall II study.: job strain and CHD risk stratification"

Copied!
9
0
0

Texte intégral

Loading

Figure

Table 3 shows findings from analyses based on alternative definitions for job strain, i.e
Table 3 Reclassification of the predicted 10-year risk of incident coronary heart disease by using the Framingham risk score vs a risk score based on both the Framingham risk score and alternative job strain indicators measured at Phase 3

Références

Documents relatifs

Two viable strategies, moderately elevating temperature to 50 °C or using an anion receptor (TPFPB) as additive in electrolyte, can increase attainable capacity by a factor of 10

However, the aims of this study—to outline causes and effects of, solutions to, and prevention of, widefield OCTA artifacts—are not substantially impacted by this limitation:

To investigate how quenched bending dynamics affect frac- ture, we performed 350 fracture experiments distributed over 12 different quench speeds v ranging from 1 mm/s to 500 mm/s,

Recently, methane hydrate morphologies and pore habits in sandy sediments, initially under excess-gas conditions and then subjected to saline water injection, or

Andererseits weisen die beiden Beispiele auch unmittelbar erkennbare Unterschiede auf: Während es beim SCR um einen Dialog zwi- schen den höchsten Repräsentanten

We propose different protocols of full magnetization reversal based on the variation of the Josephson junction and pulse parameters, particularly, electric current pulse

These results complete the combinatorial description of the Σ n -hierarchy, but do not solve the decidability questions: given a finite deterministic automaton A, is it

(The time complexity of previous MST algorithms that used Ω(log 2 n) memory bits per node was O(n 2 ), and the time for optimal space algorithms was O(n|E|).) Inherited from our