Little research has addressed the heterogeneity and mortality risk in body mass index (BMI) trajectories among older populations. Applying latent class trajectory models to 9,538 adults aged 51 to 77 years from the US Health and Retirement Study (1992-2008), we defined 6 latent BMI trajectories: normal weight downward, normal weight upward, overweight stable, overweight obesity, class I obese u...

We study the problem of characterizing the directed graphs with an upward straightline embedding into every point set in general or in convex position. We solve two questions posed by Binucci et al. [Computational Geometry: Theory and Applications, 2010 ]. Namely, we prove that the classes of directed graphs with an upward straightline embedding into every point set in convex position and with ...

L. W. Schultheis and D. A. Robinson showed that the axis of the rotational vestibuloocular reflex (RVOR) cannot be altered by visual-vestibular mismatch ("cross-axis adaptation") when the vestibulocerebellum is lesioned. This suggests that the cerebellum may calibrate the axis of eye velocity of the RVOR under natural conditions. Thus we asked whether patients with cerebellar disease have alter...

An upward drawing of a tree is a drawing such that no parents are below their children. It is order-preserving if the edges to children appear in prescribed order around each vertex. Chan showed that any tree has an upward order-preserving drawing with width O(logn). In this paper, we consider upward order-preserving drawings where edges are allowed to have bends. We present a linear-time algor...

Little research has addressed the heterogeneity and mortality risk in body mass index (BMI) trajectories among older populations. Applying latent class trajectory models to 9,538 adults aged 51 to 77 years from the US Health and Retirement Study (1992–2008), we defined 6 latent BMI trajectories: normal weight downward, normal weight upward, overweight stable, overweight obesity, class I obese u...

An upward drawing of a rooted tree T is a planar straight-line drawing of T where the vertices of T are placed on a set of horizontal lines, called layers, such that for each vertex u of T , no child of u is placed on a layer vertically above the layer on which u has been placed. In this paper we give a linear-time algorithm to obtain an upward drawing of a given rooted tree T on the minimum nu...