MARECHIARA-phytoplankton long-term time-series (1984-2006) at the fixed coastal station in the Gulf of Naples, Southern Tyrrhenian Sea

The "MARECHIARA-phytoplankton" dataset contains phytoplankton data collected in the ongoing time-series at Stn MC ( 40°48.5' N, 14°15' E) in the Gulf of Naples. This dataset spans over the period 1984-2006 and contains data of phytoplankton species composition and abundance. Phytoplankton sampling was regularly conducted from January 1984 till July 1991 and in 1995-2006. Sampling was interrupted from August 1991 till January 1995. The sampling frequency was fortnightly till 1991 and weekly since 1995. Phytoplankton samples were collected at 0.5 m depth using Niskin bottles and immediately fixed with formaldehyde (0.8-1.6% final concentration) for species identification and counts.

Improved static analysis and verification of energy consumption and other resources via abstract interpretation

Resource analysis aims at inferring the cost of executing programs for any possible input, in terms of a given resource, such as the traditional execution steps, time ormemory, and, more recently energy consumption or user defined resources (e.g., number of bits sent over a socket, number of database accesses, number of calls to particular procedures, etc.). This is performed statically, i.e., without actually running the programs. Resource usage information is useful for a variety of optimization and verification applications, as well as for guiding software design. For example, programmers can use such information to choose different algorithmic solutions to a problem; program transformation systems can use cost information to choose between alternative transformations; parallelizing compilers can use cost estimates for granularity control, which tries to balance the overheads of task creation and manipulation against the benefits of parallelization. In this thesis we have significatively improved an existing prototype implementation for resource usage analysis based on abstract interpretation, addressing a number of relevant challenges and overcoming many limitations it presented. The goal of that prototype was to show the viability of casting the resource analysis as an abstract domain, and howit could overcome important limitations of the state-of-the-art resource usage analysis tools. For this purpose, it was implemented as an abstract domain in the abstract interpretation framework of the CiaoPP system, PLAI.We have improved both the design and implementation of the prototype, for eventually allowing an evolution of the tool to the industrial application level. The abstract operations of such tool heavily depend on the setting up and finding closed-form solutions of recurrence relations representing the resource usage behavior of program components and the whole program as well. While there exist many tools, such as Computer Algebra Systems (CAS) and libraries able to find closed-form solutions for some types of recurrences, none of them alone is able to handle all the types of recurrences arising during program analysis. In addition, there are some types of recurrences that cannot be solved by any existing tool. This clearly constitutes a bottleneck for this kind of resource usage analysis. Thus, one of the major challenges we have addressed in this thesis is the design and development of a novel modular framework for solving recurrence relations, able to combine and take advantage of the results of existing solvers. Additionally, we have developed and integrated into our novel solver a technique for finding upper-bound closed-form solutions of a special class of recurrence relations that arise during the analysis of programs with accumulating parameters. Finally, we have integrated the improved resource analysis into the CiaoPP general framework for resource usage verification, and specialized the framework for verifying energy consumption specifications of embedded imperative programs in a real application, showing the usefulness and practicality of the resulting tool.---ABSTRACT---El Análisis de recursos tiene como objetivo inferir el coste de la ejecución de programas para cualquier entrada posible, en términos de algún recurso determinado, como pasos de ejecución, tiempo o memoria, y, más recientemente, el consumo de energía o recursos definidos por el usuario (por ejemplo, número de bits enviados a través de un socket, el número de accesos a una base de datos, cantidad de llamadas a determinados procedimientos, etc.). Ello se realiza estáticamente, es decir, sin necesidad de ejecutar los programas. La información sobre el uso de recursos resulta muy útil para una gran variedad de aplicaciones de optimización y verificación de programas, así como para asistir en el diseño de los mismos. Por ejemplo, los programadores pueden utilizar dicha información para elegir diferentes soluciones algorítmicas a un problema; los sistemas de transformación de programas pueden utilizar la información de coste para elegir entre transformaciones alternativas; los compiladores paralelizantes pueden utilizar las estimaciones de coste para realizar control de granularidad, el cual trata de equilibrar el coste debido a la creación y gestión de tareas, con los beneficios de la paralelización. En esta tesis hemos mejorado de manera significativa la implementación de un prototipo existente para el análisis del uso de recursos basado en interpretación abstracta, abordando diversos desafíos relevantes y superando numerosas limitaciones que éste presentaba. El objetivo de dicho prototipo era mostrar la viabilidad de definir el análisis de recursos como un dominio abstracto, y cómo se podían superar las limitaciones de otras herramientas similares que constituyen el estado del arte. Para ello, se implementó como un dominio abstracto en el marco de interpretación abstracta presente en el sistema CiaoPP, PLAI. Hemos mejorado tanto el diseño como la implementación del mencionado prototipo para posibilitar su evolución hacia una herramienta utilizable en el ámbito industrial. Las operaciones abstractas de dicha herramienta dependen en gran medida de la generación, y posterior búsqueda de soluciones en forma cerrada, de relaciones recurrentes, las cuales modelizan el comportamiento, respecto al consumo de recursos, de los componentes del programa y del programa completo. Si bien existen actualmente muchas herramientas capaces de encontrar soluciones en forma cerrada para ciertos tipos de recurrencias, tales como Sistemas de Computación Algebraicos (CAS) y librerías de programación, ninguna de dichas herramientas es capaz de tratar, por sí sola, todos los tipos de recurrencias que surgen durante el análisis de recursos. Existen incluso recurrencias que no las puede resolver ninguna herramienta actual. Esto constituye claramente un cuello de botella para este tipo de análisis del uso de recursos. Por lo tanto, uno de los principales desafíos que hemos abordado en esta tesis es el diseño y desarrollo de un novedoso marco modular para la resolución de relaciones recurrentes, combinando y aprovechando los resultados de resolutores existentes. Además de ello, hemos desarrollado e integrado en nuestro nuevo resolutor una técnica para la obtención de cotas superiores en forma cerrada de una clase característica de relaciones recurrentes que surgen durante el análisis de programas lógicos con parámetros de acumulación. Finalmente, hemos integrado el nuevo análisis de recursos con el marco general para verificación de recursos de CiaoPP, y hemos instanciado dicho marco para la verificación de especificaciones sobre el consumo de energía de programas imperativas embarcados, mostrando la viabilidad y utilidad de la herramienta resultante en una aplicación real.

Severe genital herpes infections in HIV-infected individuals with impaired herpes simplex virus-specific CD8+ cytotoxic T lymphocyte responses

The specific mechanisms underlying the varied susceptibility of HIV-infected (HIV+) individuals to opportunistic infections (OI) are still incompletely understood. One hypothesis is that quantitative differences in specific T cell responses to a colonizing organism determine the development of an AIDS-defining OI. We evaluated this hypothesis for herpes simplex virus (HSV) infection, a common OI in HIV+ patients. Using limiting dilution analyses, the frequency of HSV-specific CD8+ cytotoxic T lymphocyte precursors (pCTL) and proliferative precursors were quantitated in peripheral blood mononuclear cells from 20 patients coinfected with HIV and HSV-2. The frequency of HSV-specific CD8+ pCTL in HSV+HIV+ individuals was significantly lower than in HSV+HIV− individuals (1 in 77,000 vs. 1 in 6,000, P = .0005) and was not different than in HSV-HIV− individuals (1 in 100,000, P = .24). HIV+ patients who suffered more severe genital herpes recurrences had significantly lower HSV-specific CD8+ pCTL frequencies than those patients with mild recurrences (1 in 170,000 vs. 1 in 26,000, P = .03). In contrast, no significant difference was seen in proliferative precursor frequencies between those patients with mild vs. severe genital herpes (1 in 3,800 vs. 1 in 6,600, P > .5). Quantitative differences in pCTL frequency to HSV appear to be the most important host factor influencing the frequency and severity of HSV reactivation in HIV+ patients. Studies to reconstitute such immunity, especially in people with acyclovir-resistant HSV, appear warranted.

ANX7, a candidate tumor suppressor gene for prostate cancer

The ANX7 gene is located on human chromosome 10q21, a site long hypothesized to harbor a tumor suppressor gene(s) (TSG) associated with prostate and other cancers. To test whether ANX7 might be a candidate TSG, we examined the ANX7-dependent suppression of human tumor cell growth, stage-specific ANX7 expression in 301 prostate specimens on a prostate tissue microarray, and loss of heterozygosity (LOH) of microsatellite markers at or near the ANX7 locus. Here we report that human tumor cell proliferation and colony formation are markedly reduced when the wild-type ANX7 gene is transfected into two prostate tumor cell lines, LNCaP and DU145. Consistently, analysis of ANX7 protein expression in human prostate tumor microarrays reveals a significantly higher rate of loss of ANX7 expression in metastatic and local recurrences of hormone refractory prostate cancer as compared with primary tumors (P = 0.0001). Using four microsatellite markers at or near the ANX7 locus, and laser capture microdissected tumor cells, 35% of the 20 primary prostate tumors show LOH. The microsatellite marker closest to the ANX7 locus showed the highest rate of LOH, including one homozygous deletion. We conclude that the ANX7 gene exhibits many biological and genetic properties expected of a TSG and may play a role in prostate cancer progression.