Assessing the effects of multiple infections and long latency in the dynamics of tuberculosis

In order to achieve a better understanding of multiple infections and long latency in the dynamics of Mycobacterium tuberculosis infection, we analyze a simple model. Since backward bifurcation is well documented in the literature with respect to the model we are considering, our aim is to illustrate this behavior in terms of the range of variations of the model's parameters. We show that backward bifurcation disappears (and forward bifurcation occurs) if: (a) the latent period is shortened below a critical value; and (b) the rates of super-infection and re-infection are decreased. This result shows that among immunosuppressed individuals, super-infection and/or changes in the latent period could act to facilitate the onset of tuberculosis. When we decrease the incubation period below the critical value, we obtain the curve of the incidence of tuberculosis following forward bifurcation; however, this curve envelops that obtained from the backward bifurcation diagram.

Self-assembled films from chitosan and poly(vinyl sulfonic acid) on Nafion® for direct methanol fuel cell

Chitosan/poly(vinyl sulfonic acid) (PVS) films have been prepared on Nafion® membranes by the layer-by-layer (LbL) method for use in direct methanol fuel cell (DMFC). Computational methods and Fourier transform infrared (FTIR) spectra suggest that an ionic pair is formed between the sulfonic group of PVS and the protonated amine group of chitosan, thereby promoting the growth of LbL films on the Nafion® membrane as well as partial blocking of methanol. Chronopotentiometry and potential linear scanning experiments have been carried out for investigation of methanol crossover through the Nafion® and chitosan/PVS/Nafion® membranes in a diaphragm diffusion cell. On the basis of electrical impedance measurements, the values of proton resistance of the Nafion® and chitosan/PVS/Nafion® membranes are close due to the small thickness of the LbL film. Thus, it is expected an improved DMFC performance once the additional resistance of the self-assembled film is negligible compared to the result associated with the decrease in the crossover effect.

Shear force and torsion in reinforced concrete beam elements: theoretical analysis based on Brazilian Standard Code ABNT NBR 6118:2007

Reinforced concrete beam elements are submitted to applicable loads along their life cycle that cause shear and torsion. These elements may be subject to only shear, pure torsion or both, torsion and shear combined. The Brazilian Standard Code ABNT NBR 6118:2007 [1] fixes conditions to calculate the transverse reinforcement area in beam reinforced concrete elements, using two design models, based on the strut and tie analogy model, first studied by Mörsch [2]. The strut angle θ (theta) can be considered constant and equal to 45º (Model I), or varying between 30º and 45º (Model II). In the case of transversal ties (stirrups), the variation of angle α (alpha) is between 45º and 90º. When the equilibrium torsion is required, a resistant model based on space truss with hollow section is considered. The space truss admits an inclination angle θ between 30º and 45º, in accordance with beam elements subjected to shear. This paper presents a theoretical study of models I and II for combined shear and torsion, in which ranges the geometry and intensity of action in reinforced concrete beams, aimed to verify the consumption of transverse reinforcement in accordance with the calculation model adopted As the strut angle on model II ranges from 30º to 45º, transverse reinforcement area (Asw) decreases, and total reinforcement area, which includes longitudinal torsion reinforcement (Asℓ), increases. It appears that, when considering model II with strut angle above 40º, under shear only, transverse reinforcement area increases 22% compared to values obtained using model I.

Influence of Goertler vortices spanwise wavelength on heat transfer rates

The boundary layer over concave surfaces can be unstable due to centrifugal forces, giving rise to Goertler vortices. These vortices create two regions in the spanwise direction—the upwash and downwash regions. The downwash region is responsible for compressing the boundary layer toward the wall, increasing the heat transfer rate. The upwash region does the opposite. In the nonlinear development of the Goertler vortices, it can be observed that the upwash region becomes narrow and the spanwise–average heat transfer rate is higher than that for a Blasius boundary layer. This paper analyzes the influence of the spanwise wavelength of the Goertler the heat transfer. The equation is written in vorticity-velocity formulation. The time integration is done via a classical fourth-order Runge-Kutta method. The spatial derivatives are calculated using high-order compact finite difference and spectral methods. Three different wavelengths are analyzed. The results show that steady Goertler flow can increase the heat transfer rates to values close to the values of turbulence, without the existence of a secondary instability. The geometry (and computation domain) are presented

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.