To study naive and memory CD8 T cell turnover, we performed BrdU incorporation experiments in adult thymectomized C57BL/6 mice and analyzed data in a mathematical framework.

This paper focuses on a new method to compute fitness function (ff) values in genetic algorithms for bus network optimization. In the proposed methodology, a genetic algorithm is used to generate iteratively new populations (sets of bus networks). Each member of the population is evaluated by computing a number of performance indicators obtained by the analysis of the assignment of the O/D demand associated to the considered networks. Thus, ff values are computed by means of a multicriteria analysis executed on the performance indicators so found.

This paper concerns multiphase models of tumor growth in interaction with a surrounding tissue, taking into account also the interplay with diffusible nutrients feeding the cells. Models specialize in nonlinear systems of possibly degenerate parabolic equations, which include phenomenological terms related to specific cell functions. The paper discusses general modeling guidelines for such terms, as well as for initial and boundary conditions, aiming at both biological consistency and mathematical robustness of the resulting problems.

A retrieval algorithm that uses a statistical strategy based on dimension reduction is proposed. The ethodology and details of the implementation of the new algorithm are presented and discussed. The algorithm has been applied to high resolution spectra measured by the Infrared Atmospheric Sounding Interferometer instrument to retrieve atmospheric profiles of temperature, water vapour and ozone.

We investigate the uniform convergence of Lagrange interpolation at the zeros of the orthogonal polynomials with respect to a Freud-type weight in the presence of constraints. We show that by a simple procedure it is always possible to transform the matrices of these zeros into matrices such that the corresponding Lagrange interpolating polynomial with re- spect to the given constraints well approximates a given function. This procedure was, at ¯rst, successfully introduced for the polynomial inter- polation with constraints on bounded intervals [1].