Analysis of proximal femur DXA scans in growing children: Comparisons of different protocols for cross-sectional 8-month and 7-year longitudinal data

Dual-energy X-ray absorptiometry (DXA) is a widely used method for measuring bone mineral in the growing skeleton. Because scan analysis in children offers a number of challenges, we compared DXA results using six analysis methods at the total proximal femur (PF) and five methods at the femoral neck (FN), In total we assessed 50 scans (25 boys, 25 girls) from two separate studies for cross-sectional differences in bone area, bone mineral content (BMC), and areal bone mineral density (aBMD) and for percentage change over the short term (8 months) and long term (7 years). At the proximal femur for the short-term longitudinal analysis, there was an approximate 3.5% greater change in bone area and BMC when the global region of interest (ROI) was allowed to increase in size between years as compared with when the global ROI was held constant. Trend analysis showed a significant (p < 0.05) difference between scan analysis methods for bone area and BMC across 7 years. At the femoral neck, cross-sectional analysis using a narrower (from default) ROI, without change in location, resulted in a 12.9 and 12.6% smaller bone area and BMC, respectively (both p < 0.001), Changes in FN area and BMC over 8 months were significantly greater (2.3 %, p < 0.05) using a narrower FN rather than the default ROI, Similarly, the 7-year longitudinal data revealed that differences between scan analysis methods were greatest when the narrower FN ROI was maintained across all years (p < 0.001), For aBMD there were no significant differences in group means between analysis methods at either the PF or FN, Our findings show the need to standardize the analysis of proximal femur DXA scans in growing children.

Trial-of-antibiotic algorithm for the diagnosis of tuberculosis in a district hospital in a developing country with high HIV prevalence

OBJECTIVE: To evaluate a diagnostic algorithm for pulmonary tuberculosis based on smear microscopy and objective response to trial of antibiotics. SETTING: Adult medical wards, Hlabisa Hospital, South Africa, 1996-1997. METHODS: Adults with chronic chest symptoms and abnormal chest X-ray had sputum examined for Ziehl-Neelsen stained acid-fast bacilli by light microscopy. Those with negative smears were treated with amoxycillin for 5 days and assessed. Those who had not improved were treated with erythromycin for 5 days and reassessed. Response was compared with mycobacterial culture. RESULTS: Of 280 suspects who completed the diagnostic pathway, 160 (57%) had a positive smear, 46 (17%) responded to amoxycillin, 34 (12%) responded to erythromycin and 40 (14%) were treated as smear-negative tuberculosis. The sensitivity (89%) and specificity (84%) of the full algorithm for culture-positive tuberculosis were high. However, 11 patients (positive predictive value [PPV] 95%) were incorrectly diagnosed with tuberculosis, and 24 cases of tuberculosis (negative predictive value [NPV] 70%) were not identified. NPV improved to 75% when anaemia was included as a predictor. Algorithm performance was independent of human immunodeficiency virus status. CONCLUSION: Sputum smear microscopy plus trial of antibiotic algorithm among a selected group of tuberculosis suspects may increase diagnostic accuracy in district hospitals in developing countries.

Minimum-order stable recursive filter design via the genetic algorithm approach

In this paper, the minimum-order stable recursive filter design problem is proposed and investigated. This problem is playing an important role in pipeline implementation sin signal processing. Here, the existence of a high-order stable recursive filter is proved theoretically, in which the upper bound for the highest order of stable filters is given. Then the minimum-order stable linear predictor is obtained via solving an optimization problem. In this paper, the popular genetic algorithm approach is adopted since it is a heuristic probabilistic optimization technique and has been widely used in engineering designs. Finally, an illustrative example is sued to show the effectiveness of the proposed algorithm.

The HI Parkes All Sky Survey: southern observations, calibration and robust imaging

The acquisition of HI Parkes All Shy Survey (HIPASS) southern sky data commenced at the Australia Telescope National Facility's Parkes 64-m telescope in 1997 February, and was completed in 2000 March. HIPASS is the deepest HI survey yet of the sky south of declination +2 degrees, and is sensitive to emission out to 170 h(75)(-1) Mpc. The characteristic root mean square noise in the survey images is 13.3 mJy. This paper describes the survey observations, which comprise 23 020 eight-degree scans of 9-min duration, and details the techniques used to calibrate and image the data. The processing algorithms are successfully designed to be statistically robust to the presence of interference signals, and are particular to imaging point (or nearly point) sources. Specifically, a major improvement in image quality is obtained by designing a median-gridding algorithm which uses the median estimator in place of the mean estimator.

An equivalent algorithm for simulating thermal effects of magma intrusion problems in porous rocks

An equivalent algorithm is proposed to simulate thermal effects of the magma intrusion in geological systems, which are composed of porous rocks. Based on the physical and mathematical equivalence, the original magma solidification problem with a moving boundary between the rock and intruded magma is transformed into a new problem without the moving boundary but with a physically equivalent heat source. From the analysis of an ideal solidification model, the physically equivalent heat source has been determined in this paper. The major advantage in using the proposed equivalent algorithm is that the fixed finite element mesh with a variable integration time step can be employed to simulate the thermal effect of the intruded magma solidification using the conventional finite element method. The related numerical results have demonstrated the correctness and usefulness of the proposed equivalent algorithm for simulating the thermal effect of the intruded magma solidification in geological systems. (C) 2003 Elsevier B.V. All rights reserved.

Infiltration from surface and buried point sources: The average wetting water content

The assumption in analytical solutions for flow from surface and buried point sources of an average water content, (θ) over bar, behind the wetting front is examined. Some recent work has shown that this assumption fitted some field data well. Here we calculated (θ) over bar using a steady state solution based on the work by Raats [1971] and an exponential dependence of the diffusivity upon the water content. This is compared with a constant value of (θ) over bar calculated from an assumption of a hydraulic conductivity at the wetting front of 1 mm day(-1) and the water content at saturation. This comparison was made for a wide range of soils. The constant (θ) over bar generally underestimated (θ) over bar at small wetted radii and overestimated (θ) over bar at large radii. The crossover point between under and overestimation changed with both soil properties and flow rate. The largest variance occurred for coarser texture soils at low-flow rates. At high-flow rates in finer-textured soils the use of a constant (θ) over bar results in underestimation of the time for the wetting front to reach a particular radius. The value of (θ) over bar is related to the time at which the wetting front reaches a given radius. In coarse-textured soils the use of a constant value of (θ) over bar can result in an error of the time when the wetting front reaches a particular radius, as large as 80% at low-flow rates and large radii.

Overlapping motifs in the membrane-proximal region of cytokine receptor accessory and signaling subunits

The membrane-proximal cytoplasmic region of cytokine receptors (CRs) is highly conserved and essential for receptor activation. In particular this region is essential for the activation of members of the Janus family of protein kinases (JAK) which results in initiation of receptor signaling. We have examined the sequence of this region in a number of CR signaling and accessory subunits with a view to better delineating motifs that play an important role in initiating receptor activity. Here, we have delineated two distinct proline-rich motifs in the membrane-proximal domains of cytokine receptors. Their configuration and distribution among CR subunits strongly suggest a model in which the two motifs act in a concerted manner to induce full receptor and JAK activation. (C) 2004 Elsevier Ltd. All rights reserved.

A spectral clustering algorithm for manufacturing cell formation

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

The Qu-Prolog unification algorithm: Formalisation and correctness

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.

Phonological sensitivity as a proximal contributor to phonological recoding skills in children's reading

Because it permits self-teaching, phonological recoding (the efficient translation of letters or letter groups into sound) is arguably the key skill acquired in learning to read an alphabetic writing system. Deficits in this skill are the most common source of children's reading difficulties. In addition, poor readers tend to perform at a lower level than good readers on a wide variety of phonological processing tasks. These findings have been widely interpreted as implying a latent phonological processing ability as a distal cause of variation in reading skill. Clearly, such an interpretation does not imply that all phonological processing skills contribute directly to the phonological recoding process. This paper outlines a series of studies conducted at the University of Queensland. This work consistently suggests that children's phonological sensitivity contributes more directly than other phonological processing abilities to the development of phonological recoding skills.

Annexin 1 mimetic peptide protects against renal ischemia/reperfusion injury in rats

Inflammation is currently recognized as a key mechanism in the pathogenesis of renal ischemia-reperfusion (I/R) injury. The importance of infiltrating neutrophil, lymphocytes, and macrophage in this kind of injury has been assessed with conflicting results. Annexin 1 is a protein with potent neutrophil anti-migratory activity. In order to evaluate the effects of annexin A1 on renal I/R injury, uninephrectomized rats received annexin A1 mimetic peptide Ac2-26 (100 mu g) or vehicle before 30 min of renal artery clamping and were compared to sham surgery animals. Annexin A1 mimetic peptide granted a remarkable protection against I/R injury, preventing glomerular filtration rate and urinary osmolality decreases and acute tubular necrosis development. Annexin A1 infusion aborted neutrophil extravasation and attenuated macrophage infiltration but did not prevent tissue lymphocyte traffic. I/R increased annexin A1 expression (assessed by transmission electron microscopy) in renal epithelial cells, which was attenuated by exogenous annexin A1 infusion. Additionally, annexin A1 reduced I/R injury in isolated proximal tubules suspension. Annexin A1 protein afforded striking functional and structural protection against renal I/R. These results point to an important role of annexin A1 in the epithelial cells defense against I/R injury and indicate that neutrophils are key mediators for the development of tissue injury after renal I/R. If these results were confirmed in clinical studies, annexin A1 might emerge as an important tool to protect against I/R injury in renal transplantation and in vascular surgery.

Analysis and implementation of a new constant acceleration subcycling algorithm

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Simulated-annealing-based genetic algorithm for modeling the optical constants of solids

We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.