Previous research in North America has supported the view that male involvement in committed, romantic relationships is associated with lower testosterone (T) levels. Here, we test the prediction that undergraduate men involved in committed, romantic relationships (paired) will have lower T levels than men not involved in such relationships (unpaired). Further, we also test whether these differ...

A many-to-many k-disjoint path cover (k-DPC for short) of a graph G joining the pairwise disjoint vertex sets S and T , each of size k, is a collection of k vertex-disjoint paths between S and T , which altogether cover every vertex of G. This is classified as paired, if each vertex of S must be joined to a specific vertex of T , or unpaired, if there is no such constraint. In this paper, we de...

A Disjoint Path Cover (DPC for short) of a graph is a set of pairwise (internally) disjoint paths that altogether cover every vertex of the graph. Given a set S of k sources and a set T of k sinks, a many-to-many k-DPC between S and T is a disjoint path cover each of whose paths joins a pair of source and sink. It is classified as paired if each source of S must be joined to a designated sink o...

Individuals with systemic arterial hypertension have a higher risk of heat-related complications. Thus, the aim of this study was to examine the thermoregulatory responses of hypertensive subjects during recovery from moderate-intensity exercise performed in the heat. A total of eight essential hypertensive (H) and eight normotensive (N) male subjects (age=46.5±1.3 and 45.6±1.4 years, body mass...

The thermal conductivity κ of the heavy-fermion metal CeCoIn_{5} was measured in the normal and superconducting states as a function of temperature T and magnetic field H, for a current and field parallel to the [100] direction. Inside the superconducting state, when the field is lower than the upper critical field H_{c2}, κ/T is found to increase as T→0, just as in a metal and in contrast to t...

Given a graph G, and two vertex sets S and T of size k each, a many-tomany k-disjoint path cover of G joining S and T is a collection of k disjoint paths between S and T that cover every vertex of G. It is classified as paired if each vertex of S must be joined to a designated vertex of T , or unpaired if there is no such constraint. In this article, we first present a necessary and sufficient ...

BACKGROUND AND PURPOSE Pretreatment with intraventricular brain-derived neurotrophic factor (BDNF) reduces ischemic damage after focal cerebral ischemia. In this experiment we studied the effect of intravenous BDNF delivered after focal cerebral ischemia on neurological outcome, infarct size, and expression of proapoptotic and antiapoptotic proteins Bax and Bcl-2, respectively. METHODS With t...

The present review introduces the commonly used t-test, used to compare a single mean with a hypothesized value, two means arising from paired data, or two means arising from unpaired data. The assumptions underlying these tests are also discussed.