Bioelectrical impedance with different equations versus deuterium oxide dilution method for the inference of body composition in healthy older persons

There is no consensus regarding the accuracy of bioimpedance for the determination of body composition in older persons. This study aimed to compare the assessment of lean body mass of healthy older volunteers obtained by the deuterium dilution method (reference) with those obtained by two frequently used bioelectrical impedance formulas and one formula specifically developed for a Latin-American population. A cross-sectional study. Twenty one volunteers were studied, 12 women, with mean age 72 +/- 6.7 years. Urban community, Ribeiro Preto, Brazil. Fat free mass was determined, simultaneously, by the deuterium dilution method and bioelectrical impedance; results were compared. In bioelectrical impedance, body composition was calculated by the formulas of Deuremberg, Lukaski and Bolonchuck and Valencia et al. Lean body mass of the studied volunteers, as determined by bioelectrical impedance was 37.8 +/- 9.2 kg by the application of the Lukaski e Bolonchuk formula, 37.4 +/- 9.3 kg (Deuremberg) and 43.2 +/- 8.9 kg (Valencia et. al.). The results were significantly correlated to those obtained by the deuterium dilution method (41.6 +/- 9.3 Kg), with r=0.963, 0.932 and 0.971, respectively. Lean body mass obtained by the Valencia formula was the most accurate. In this study, lean body mass of older persons obtained by the bioelectrical impedance method showed good correlation with the values obtained by the deuterium dilution method. The formula of Valencia et al., developed for a Latin-American population, showed the best accuracy.

Semilinear functional difference equations with infinite delay

We obtain boundedness and asymptotic behavior of solutions for semilinear functional difference equations with infinite delay. Applications to Volterra difference equations with infinite delay are shown. (C) 2011 Elsevier Ltd. All rights reserved.

Matrix-vector multiplication and triangular linear solver using GPGPU for symmetric positive definite matrices derived from elliptic equations

The modern GPUs are well suited for intensive computational tasks and massive parallel computation. Sparse matrix multiplication and linear triangular solver are the most important and heavily used kernels in scientific computation, and several challenges in developing a high performance kernel with the two modules is investigated. The main interest it to solve linear systems derived from the elliptic equations with triangular elements. The resulting linear system has a symmetric positive definite matrix. The sparse matrix is stored in the compressed sparse row (CSR) format. It is proposed a CUDA algorithm to execute the matrix vector multiplication using directly the CSR format. A dependence tree algorithm is used to determine which variables the linear triangular solver can determine in parallel. To increase the number of the parallel threads, a coloring graph algorithm is implemented to reorder the mesh numbering in a pre-processing phase. The proposed method is compared with parallel and serial available libraries. The results show that the proposed method improves the computation cost of the matrix vector multiplication. The pre-processing associated with the triangular solver needs to be executed just once in the proposed method. The conjugate gradient method was implemented and showed similar convergence rate for all the compared methods. The proposed method showed significant smaller execution time.

Solitons in nonlinear Schrödinger equations.

Using a mathematical approach accessible to graduate students of physics and engineering, we show how solitons are solutions of nonlinear Schrödinger equations. Are also given references about the history of solitons in general, their fundamental properties and how they have found applications in optics and fiber-optic communications.