Introduction A mature and fulfilling sexuality is based on appropriate sexual education. The message must be adapted to the level of knowledge practices young people. Old studies dating back more than 15 years have been published. Objectives objective this study assess adolescents’ attitudes about sexuality. Methods This a descriptive cross-sectional conducted among 80 adolescents using an anon...

Abstract Extreme heatwaves are among the fastest-changing meteorological hazards in a warming world. While likely also true for New Zealand, significant knowledge gaps exist relating to current and future risks associated with extreme heat. Using high-quality station observations dating back at least 1972, this study presents first detailed synthesis of severity, frequency, persistence heat exp...

STUDY OBJECTIVE To explore the previously stated hypothesis that risk factors for atherothrombotic disease are associated with back pain. DESIGN Prospective (mean of four years of follow up) and retrospective analyses using two main outcome measures: (a) short (< or = 7 days) and long (> 7 days) spells of sickness absence because of back pain reported separately in men and women; (b) consiste...

For a graph G, we denote by i(G) the number of isolated vertices of G. We prove that for a connected graph G of order at least five, if i(G − S) < |S| for all ∅ = S ⊆ V (G), then G has a spanning tree T such that the distance in T between any two leaves of T is at least four. This result was conjectured by Kaneko in ”Spanning trees with constrains on the leaf degree”, Discrete Applied Math., 11...

PURPOSE To examine whether there is a direct or a mediated association between dysfunctional parental behavior in later childhood and involvement in dating violence in a sample of low socioeconomic-status boys during mid-adolescence. METHODS Subjects were 717 boys who participated in a longitudinal study. Data collected at six time periods, beginning at age 10 years and covering a span of 8 y...

In 1966, Gallai conjectured that for any simple, connected graph G having n vertices, there is a path-decomposition of G having at most dn2 e paths. In this paper, we show that for any simple graph G having girth g ≥ 4, there is a path-decomposition of G having at most p(G) 2 + ⌊( g+1 2g ) q(G) ⌋ paths, where p(G) is the number of vertices of odd degree in G and q(G) is the number of non-isolat...

We give infinite families of elliptic curves over Q such that each curve has infinitely many non-isomorphic quadratic twists of rank at least 4. Assuming the Parity Conjecture, we also give elliptic curves over Q with infinitely many non-isomorphic quadratic twists of odd rank at least 5.