5 resultados para propagation-rate equations
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo
Resumo:
The growth parameters (growth rate, mu and lag time, lambda) of three different strains each of Salmonella enterica and Listeria monocytogenes in minimally processed lettuce (MPL) and their changes as a function of temperature were modeled. MPL were packed under modified atmosphere (5% O-2, 15% CO2 and 80% N-2), stored at 7-30 degrees C and samples collected at different time intervals were enumerated for S. enterica and L monocytogenes. Growth curves and equations describing the relationship between mu and lambda as a function of temperature were constructed using the DMFit Excel add-in and through linear regression, respectively. The predicted growth parameters for the pathogens observed in this study were compared to ComBase, Pathogen modeling program (PMP) and data from the literature. High R-2 values (0.97 and 0.93) were observed for average growth curves of different strains of pathogens grown on MPL Secondary models of mu and lambda for both pathogens followed a linear trend with high R2 values (>0.90). Root mean square error (RMSE) showed that the models obtained are accurate and suitable for modeling the growth of S. enterica and L monocytogenes in MP lettuce. The current study provides growth models for these foodborne pathogens that can be used in microbial risk assessment. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
A dimensional analysis of the classical equations related to the dynamics of vector-borne infections is presented. It is provided a formal notation to complete the expressions for the Ross' threshold theorem, the Macdonald's basic reproduction "rate" and sporozoite "rate", Garret-Jones' vectorial capacity and Dietz-Molineaux-Thomas' force of infection. The analysis was intended to provide a formal notation that complete the classical equations proposed by these authors.
Resumo:
The nonequilibrium stationary state of an irreversible spherical model is investigated on hypercubic lattices. The model is defined by Langevin equations similar to the reversible case, but with asymmetric transition rates. In spite of being irreversible, we have succeeded in finding an explicit form for the stationary probability distribution, which turns out to be of the Boltzmann-Gibbs type. This enables one to evaluate the exact form of the entropy production rate at the stationary state, which is non-zero if the dynamical rules of the transition rates are asymmetric.
Resumo:
Background: Equations to predict maximum heart rate (HRmax) in heart failure (HF) patients receiving beta-adrenergic blocking (BB) agents do not consider the cause of HF. We determined equations to predict HRmax in patients with ischemic and nonischemic HF receiving BB therapy. Methods and Results: Using treadmill cardiopulmonary exercise testing, we studied HF patients receiving BB therapy being considered for transplantation from 1999 to 2010. Exclusions were pacemaker and/or implantable defibrillator, left ventricle ejection fraction (LVEF) >50%, peak respiratory exchange ratio (RER) <1.00, and Chagas disease. We used linear regression equations to predict HRmax based on age in ischemic and nonischemic patients. We analyzed 278 patients, aged 47 +/- 10 years, with ischemic (n = 75) and nonischemic (n = 203) HF. LVEF was 30.8 +/- 9.4% and 28.6 +/- 8.2% (P = .04), peak VO2 16.9 +/- 4.7 and 16.9 +/- 5.2 mL kg(-1) min(-1) (P = NS), and the HRmax 130.8 +/- 23.3 and 125.3 +/- 25.3 beats/min (P = .051) in ischemic and nonischemic patients, respectively. We devised the equation HRmax = 168 - 0.76 x age (R-2 = 0.095; P = .007) for ischemic HF patients, but there was no significant relationship between age and HRmax in nonischemic HF patients (R-2 = 0.006; P = NS). Conclusions: Our study suggests that equations to estimate HRmax should consider the cause of HF. (J Cardiac Fail 2012;18:831-836)
Resumo:
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.