Bone mass and the CAG and GGN androgen receptor polymorphisms in young men

[EN] BACKGROUND: To determine whether androgen receptor (AR) CAG (polyglutamine) and GGN (polyglycine) polymorphisms influence bone mineral density (BMD), osteocalcin and free serum testosterone concentration in young men. METHODOLOGY/PRINCIPAL FINDINGS: Whole body, lumbar spine and femoral bone mineral content (BMC) and BMD, Dual X-ray Absorptiometry (DXA), AR repeat polymorphisms (PCR), osteocalcin and free testosterone (ELISA) were determined in 282 healthy men (28.6+/-7.6 years). Individuals were grouped as CAG short (CAG(S)) if harboring repeat lengths of < or = 21 or CAG long (CAG(L)) if CAG > 21, and GGN was considered short (GGN(S)) or long (GGN(L)) if GGN < or = 23 or > 23. There was an inverse association between logarithm of CAG and GGN length and Ward's Triangle BMC (r = -0.15 and -0.15, P<0.05, age and height adjusted). No associations between CAG or GGN repeat length and regional BMC or BMD were observed after adjusting for age. Whole body and regional BMC and BMD values were similar in men harboring CAG(S), CAG(L), GGN(S) or GGN(L) AR repeat polymorphisms. Men harboring the combination CAG(L)+GGN(L) had 6.3 and 4.4% higher lumbar spine BMC and BMD than men with the haplotype CAG(S)+GGN(S) (both P<0.05). Femoral neck BMD was 4.8% higher in the CAG(S)+GGN(S) compared with the CAG(L)+GGN(S) men (P<0.05). CAG(S), CAG(L), GGN(S), GGN(L) men had similar osteocalcin concentration as well as the four CAG-GGN haplotypes studied. CONCLUSION: AR polymorphisms have an influence on BMC and BMD in healthy adult humans, which cannot be explained through effects in osteoblastic activity.

Multithread parallelization of lepp-bisection algorithms

[EN]Longest edge (nested) algorithms for triangulation refinement in two dimensions are able to produce hierarchies of quality and nested irregular triangulations as needed both for adaptive finite element methods and for multigrid methods. They can be formulated in terms of the longest edge propagation path (Lepp) and terminal edge concepts, to refine the target triangles and some related neighbors. We discuss a parallel multithread algorithm, where every thread is in charge of refining a triangle t and its associated Lepp neighbors. The thread manages a changing Lepp(t) (ordered set of increasing triangles) both to find a last longest (terminal) edge and to refine the pair of triangles sharing this edge...