An extended interval dosing method for gentamicin in neonates

Traditional gentamicin dosing every 8–24 h depending on age and weight in neonates does not provide the ideal concentration–time profile to both optimize the concentration-dependent killing by aminoglycosides and minimize toxicity. Fifty-three neonates were audited prospectively while receiving gentamicin 2.5 mg/kg every 8–24 h, aiming for peak concentrations (Cmax) of 6–10 mg/L and trough concentrations (Cmin) 10 mg/L after the first dose. The mean area under the concentration versus time curve AUC0–24 was 93 mg•h/L (target = 100 mg•h/L). The extended interval dosing achieved higher Cmax values while ensuring that overall exposure per 24 h was acceptable. Prospective testing of the method demonstrated good predictive ability.

Trade spectra of complete partite graphs

The trade spectrum of a graph G is essentially the set of all integers t for which there is a graph H whose edges can be partitioned into t copies of G in two entirely different ways. In this paper we determine the trade spectrum of complete partite graphs, in all but a few cases.

Factorizations of and by powers of complete graphs

Let K-k(d) denote the Cartesian product of d copies of the complete graph K-k. We prove necessary and sufficient conditions for the existence of a K-k(r)-factorization of K-pn(s), where p is prime and k > 1, n, r and s are positive integers. (C) 2002 Elsevier Science B.V. All rights reserved.

Further decompositions of complete tripartite graphs into 5-cycles

Let K(r,s,t) denote the complete tripartite graph with partite sets of sizes r, s and t, where r less than or equal to s less than or equal to t. Necessary and sufficient conditions are given for decomposability of K(r, s, t) into 5-cycles whenever r, s and t are all even. This extends work done by Mahmoodian and Mirza-khani (Decomposition of complete tripartite graphs into 5-cycles, in: Combinatorics Advances, Kluwer Academic Publishers, Netherlands, 1995, pp. 235-241) and Cavenagh and Billington. (C) 2002 Elsevier Science B.V. All rights reserved.

Effect of periparturient diseases accompanied by excessive vulval discharge and weaning to mating interval on sow reproductive performance

Objective To evaluate the effect of periparturient disease accompanied by vulval discharge, and weaning-to-mating intervals, on sow fertility and litter size. Design Reproductive data were collected and analysed from 19 Hungarian swine herds over a 4 year period. Conception rates, farrowing rates and litter sizes of sows with periparturient disease accompanied by vulval discharge were used to evaluate the relationship between duration of vulval discharge and subsequent fertility and litter size. The possibility of interactions between weaning-to-mating intervals and duration of vulval discharges was investigated to determine if there was any effect on subsequent fertility and litter size. Results and conclusions Both parity 1 and parity 2 to 8 sows having had periparturient disease accompanied by vulval discharge in excess of 6 days duration had significantly (P < 0.001) lower subsequent fertility (conception, farrowing and adjusted farrowing rates) compared with sows of similar parity where the duration of vulval discharge was < 4 or 4 to 6 days. There was no difference in fertility rates between sows, in both parity categories, with vulval discharge for < 4 days compared with 4 to 6 days. A duration of vulval discharge in excess of 6 days in parity 1 sows significantly reduced litter size (total born and live-born) in subsequent farrowings, but not in parity 2 to 8 sows. There was no interaction between the duration of vulval discharge and post-weaning to mating intervals. However sows with weaning to mating intervals between 7 and 10 days had smaller (P < 0.001) subsequent litter sizes compared with 3 to 6 or 11 to 14 day intervals. It was concluded that the duration of vulval discharge in excess of 6 days was an indication of a severe persistent endometritis adversely affecting fertility of sows.

Interval training program optimization in highly trained endurance cyclists

Purpose: The purpose of this study was to examine the influence of three different high-intensity interval training (HIT) regimens on endurance performance in highly trained endurance athletes. Methods: Before, and after 2 and 4 wk of training, 38 cyclists and triathletes (mean +/- SD; age = 25 +/- 6 yr; mass = 75 +/- 7 kg; (V)over dot O-2peak = 64.5 +/- 5.2 mL.kg(-1).min(-1)) performed: 1) a progressive cycle test to measure peak oxygen consumption ((V)over dotO(2peak)) and peak aerobic power output (PPO), 2) a time to exhaustion test (T-max) at their (V)over dotO(2peak) power output (P-max), as well as 3) a 40-kin time-trial (TT40). Subjects were matched and assigned to one of four training groups (G(1), N = 8, 8 X 60% T-max P-max, 1:2 work:recovery ratio; G(2), N = 9, 8 X 60% T-max at P-max, recovery at 65% HRmax; G(3), N = 10, 12 X 30 s at 175% PPO, 4.5-min recovery; G(CON), N = 11). In addition to G(1) G(2), and G(3) performing HIT twice per week, all athletes maintained their regular low-intensity training throughout the experimental period. Results: All HIT groups improved TT40 performance (+4.4 to +5.8%) and PPO (+3.0 to +6.2%) significantly more than G(CON) (-0.9 to + 1.1 %; P < 0.05). Furthermore, G(1) (+5.4%) and G(2) (+8.1%) improved their (V)over dot O-2peak significantly more than G(CON) (+ 1.0%; P < 0.05). Conclusion: The present study has shown that when HIT incorporates P-max as the interval intensity and 60% of T-max as the interval duration, already highly trained cyclists can significantly improve their 40-km time trial performance. Moreover, the present data confirm prior research, in that repeated supramaximal HIT can significantly improve 40-km time trial performance.

Strongly regular graphs from differences of quadrics

In this note strongly regular graphs with new parameters are constructed using nested "blown up" quadrics in projective spaces. (C) 2002 Elsevier Science B.V. All rights reserved.

Rock fracture mean trace length estimation and confidence interval calculation using maximum likelihood methods

There has been a resurgence of interest in the mean trace length estimator of Pahl for window sampling of traces. The estimator has been dealt with by Mauldon and Zhang and Einstein in recent publications. The estimator is a very useful one in that it is non-parametric. However, despite some discussion regarding the statistical distribution of the estimator, none of the recent works or the original work by Pahl provide a rigorous basis for the determination a confidence interval for the estimator or a confidence region for the estimator and the corresponding estimator of trace spatial intensity in the sampling window. This paper shows, by consideration of a simplified version of the problem but without loss of generality, that the estimator is in fact the maximum likelihood estimator (MLE) and that it can be considered essentially unbiased. As the MLE, it possesses the least variance of all estimators and confidence intervals or regions should therefore be available through application of classical ML theory. It is shown that valid confidence intervals can in fact be determined. The results of the work and the calculations of the confidence intervals are illustrated by example. (C) 2003 Elsevier Science Ltd. All rights reserved.

Decompositions of complete graphs into theta graphs with fewer than ten edges

A theta graph is a graph consisting of three pairwise internally disjoint paths with common end points. Methods for decomposing the complete graph K-nu into theta graphs with fewer than ten edges are given.

Induction in the timed interval calculus

The Timed Interval Calculus, a timed-trace formalism based on set theory, is introduced. It is extended with an induction law and a unit for concatenation, which facilitates the proof of properties over trace histories. The effectiveness of the extended Timed Interval Calculus is demonstrated via a benchmark case study, the mine pump. Specifically, a safety property relating to the operation of a mine shaft is proved, based on an implementation of the mine pump and assumptions about the environment of the mine. (C) 2002 Elsevier Science B.V. All rights reserved.

Decompositions of complete tripartite graphs into triangles with an edge attached

Let K(r, s, t) denote the complete tripartite graph with partite sets of size r, s and t, where r less than or equal to s less than or equal to t. Let D be the graph consisting of a triangle with an edge attached. We show that K(r, s, t) may be decomposed into copies of D if and only if 4 divides rs + st + rt and t less than or equal to 3rs/(r + s).