Boulanger J.-P.,University Pierre and Marie Curie |
Brasseur G.,U.S. National Center for Atmospheric Research |
Carril A.F.,CONICET |
de Castro M.,University of Castilla - La Mancha |
And 10 more authors.
Climatic Change | Year: 2010
The goal of the CLARIS project was to build an integrated European-South American network dedicated to promote common research strategies to observe and predict climate changes and their consequent socio-economic impacts taking into account the climate and societal peculiarities of South America. Reaching that goal placed the present network as a privileged advisor to contribute to the design of adaptation strategies in a region strongly affected by and dependent on climate variability (e. g. agriculture, health, hydro-electricity). Building the CLARIS network required fulfilling the following three objectives: (1) The first objective of CLARIS was to set up and favour the technical transfer and expertise in earth system and regional climate modelling between Europe and South America together with the providing of a list of climate data (observed and simulated) required for model validations; (2) The second objective of CLARIS was to facilitate the exchange of observed and simulated climate data between the climate research groups and to create a South American high-quality climate database for studies in extreme events and long-term climate trends; (3) Finally, the third objective of CLARIS was to strengthen the communication between climate researchers and stakeholders, and to demonstrate the feasibility of using climate information in the decision-making process. © Springer Science + Business Media B.V. 2009.
PubMed | CONICET, Division Tisioneumonologia Hospital Fj Muniz, Intendente Guiraldes 2160 and Hospital General Of Agudos Dr E Tornu
Type: | Journal: Scientific reports | Year: 2017
Mycobacterium tuberculosis (Mtb) causes nearly 10 millions of new tuberculosis disease cases annually. However, most individuals exposed to Mtb do not develop tuberculosis, suggesting the influence of a human genetic component. Here, we investigated the association of the rs2275913 SNP (GA) from IL-17A and tuberculosis in Argentina by a case-control study. Furthermore, we evaluated in vitro the functional relevance of this SNP during the immune response of the host against Mtb and analyzed its impact on clinical parameters of the disease. We found an association between the AA genotype and tuberculosis resistance. Additionally, within the healthy donors population, AA cells stimulated with a Mtb lysate (Mtb-Ag) produced the highest amounts of IL-17A and IFN-, which further support the genetic evidence found. In contrast, within the tuberculosis patients population, AA Mtb-Ag stimulated cells showed the lowest immunological parameters and we evidenced an association between the AA genotype and clinical parameters of disease severity, such as severe radiological lesions and higher bacilli burden in sputum. Overall, our findings demonstrated that the AA genotype from the IL-17A rs2275913 SNP is positively associated with protection to active tuberculosis but related to higher disease severity in the Argentinean population.
Lin M.C.,Intendente Guiraldes 2160 |
Mizrahi M.J.,Intendente Guiraldes 2160
RAIRO - Theoretical Informatics and Applications | Year: 2015
The minimum roman dominating problem (denoted by γR (G), the weight of minimum roman dominating function of graph G) is a variant of the very well known minimum dominating set problem (denoted by γ (G), the cardinality of minimum dominating set of graph G). Both problems remain NP-Complete when restricted to P5-free graph class [A.A. Bertossi, Inf. Process. Lett. 19 (1984) 37-40; E.J. Cockayne, et al. Discret. Math. 278 (2004) 11-22]. In this paper we study both problems restricted to some subclasses of P5-free graphs. We describe robust algorithms that solve both problems restricted to (P5, (s, t)-net)-free graphs in polynomial time. This result generalizes previous works for both problems, and improves existing algorithms when restricted to certain families such as (P5,bull)-free graphs. It turns out that the same approach also serves to solve problems for general graphs in polynomial time whenever γ(G) and γR(G) are fixed (more efficiently than naive algorithms). Moreover, the algorithms described are extremely simple which makes them useful for practical purposes, and as we show in the last section it allows to simplify algorithms for significant classes such as cographs. © EDP Sciences 2015.