Documental para la promoción de la experiencia del proyecto: Mujeres campo-ciudad: acciones para el desarrollo.

El Comité Ecuatoriano de Cooperación con la Comisión Interamericana de Mujeres CECIM presentó en el año 2009 a la Agencia Española de Cooperación Internacional Para el Desarrollo AECID el proyecto titulado “Mujeres Campo-Ciudad: Acciones para el Desarrollo en las provincias de Cotopaxi, Imbabura y Pichincha”, mismo que ha sido ejecutado en 13 asociaciones de pequeñas productoras agropecuarias, que tiene como socio local al Ministerio de Agricultura, Ganadería, Acuacultura y Pesca (MAGAP), institución con la que ha venido trabajando permanentemente. Los grupos beneficiarios del proyecto recibieron capacitado en asistencia técnica en producción agroecológica, nutrición, soberanía alimentaria, salud, comercialización, computación, sociedades populares de inversión y Conformación de la Empresa Agrofruthiza. Además, del buscar el aprovechamiento óptimo de los productos y su consumo. El mecanismo establecido para los procesos de comercialización son las ferias que se realizan en la ciudad de Latacunga en las instalaciones del CECIM filial Cotopaxi; inicialmente cada 15 días, ahora todos los sábados de 08:00 am a 14:00 pm en las que participan los grupos del proyecto y los organizados por el MAGAP

Two Novel Adenoviruses in Free-Living British lizards

In this study, we describe two novel adenoviruses isolated from (i) a common lizard (Zootoca vivipara) found dead and examined post-mortem and (ii) pooled samples from free-living sand lizards (Lacerta agilis agilis). Sequencing indicated the two were closely related atadenovirus strains which were distinct from previously recorded adenoviruses in lizards. Adenoviruses are not always associated with disease in squamates, but morbidity and mortality have been reported. These are the first known cases of adenovirus infection in free-living native British lizards, and further monitoring will be necessary to elucidate the implications of these possible pathogens for vulnerable populations of native reptiles

The Cognitive‐Functional Composite is sensitive to clinical progression in early dementia: Longitudinal findings from the Catch‐Cog study cohort

Introduction: In an attempt to capture clinically meaningful cognitive decline in early dementia, we developed the Cognitive-Functional Composite (CFC). We investigated the CFC's sensitivity to decline in comparison to traditional clinical endpoints. Methods: This longitudinal construct validation study included 148 participants with subjective cognitive decline, mild cognitive impairment, or mild dementia. The CFC and traditional tests were administered at baseline, 3, 6, and 12 months. Sensitivity to change was investigated using linear mixed models and r2 effect sizes. Results: CFC scores declined over time (β = −.16, P <.001), with steepest decline observed in mild Alzheimer's dementia (β = −.25, P <.001). The CFC showed medium-to-large effect sizes at succeeding follow-up points (r2=.08-.42), exhibiting greater change than the Clinical Dementia Rating scale (r2=.02-.12). Moreover, change on the CFC was significantly associated with informant reports of cognitive decline (β =.38, P <.001). Discussion: By showing sensitivity to decline, the CFC could enhance the monitoring of disease progression in dementia research and clinical practice

Gravitational waves: search results, data analysis and parameter estimation

The Amaldi 10 Parallel Session C2 on gravitational wave (GW) search results, data analysis and parameter estimation included three lively sessions of lectures by 13 presenters, and 34 posters. The talks and posters covered a huge range of material, including results and analysis techniques for ground-based GW detectors, targeting anticipated signals from different astrophysical sources: compact binary inspiral, merger and ringdown; GW bursts from intermediate mass binary black hole mergers, cosmic string cusps, core-collapse supernovae, and other unmodeled sources; continuous waves from spinning neutron stars; and a stochastic GW background. There was considerable emphasis on Bayesian techniques for estimating the parameters of coalescing compact binary systems from the gravitational waveforms extracted from the data from the advanced detector network. This included methods to distinguish deviations of the signals from what is expected in the context of General Relativity

Evolutionary Toggling of Vpx/Vpr Specificity Results in Divergent Recognition of the Restriction Factor SAMHD1

SAMHD1 is a host restriction factor that blocks the ability of lentiviruses such as HIV-1 to undergo reverse transcription in myeloid cells and resting T-cells. This restriction is alleviated by expression of the lentiviral accessory proteins Vpx and Vpr (Vpx/Vpr), which target SAMHD1 for proteasome-mediated degradation. However, the precise determinants within SAMHD1 for recognition by Vpx/Vpr remain unclear. Here we show that evolution of Vpx/Vpr in primate lentiviruses has caused the interface between SAMHD1 and Vpx/Vpr to alter during primate lentiviral evolution. Using multiple HIV-2 and SIV Vpx proteins, we show that Vpx from the HIV-2 and SIVmac lineage, but not Vpx from the SIVmnd2 and SIVrcm lineage, require the C-terminus of SAMHD1 for interaction, ubiquitylation, and degradation. On the other hand, the N-terminus of SAMHD1 governs interactions with Vpx from SIVmnd2 and SIVrcm, but has little effect on Vpx from HIV-2 and SIVmac. Furthermore, we show here that this difference in SAMHD1 recognition is evolutionarily dynamic, with the importance of the N- and C-terminus for interaction of SAMHD1 with Vpx and Vpr toggling during lentiviral evolution. We present a model to explain how the head-to-tail conformation of SAMHD1 proteins favors toggling of the interaction sites by Vpx/Vpr during this virus-host arms race. Such drastic functional divergence within a lentiviral protein highlights a novel plasticity in the evolutionary dynamics of viral antagonists for restriction factors during lentiviral adaptation to its hosts. © 2013 Fregoso et al

Development of the preterm gut microbiome in twins at risk of necrotising enterocolitis and sepsis

The preterm gut microbiome is a complex dynamic community influenced by genetic and environmental factors and is implicated in the pathogenesis of necrotising enterocolitis (NEC) and sepsis. We aimed to explore the longitudinal development of the gut microbiome in preterm twins to determine how shared environmental and genetic factors may influence temporal changes and compared this to the expressed breast milk (EBM) microbiome. Stool samples (n = 173) from 27 infants (12 twin pairs and 1 triplet set) and EBM (n = 18) from 4 mothers were collected longitudinally. All samples underwent PCR-DGGE (denaturing gradient gel electrophoresis) analysis and a selected subset underwent 454 pyrosequencing. Stool and EBM shared a core microbiome dominated by Enterobacteriaceae, Enterococcaceae, and Staphylococcaceae. The gut microbiome showed greater similarity between siblings compared to unrelated individuals. Pyrosequencing revealed a reduction in diversity and increasing dominance of Escherichia sp. preceding NEC that was not observed in the healthy twin. Antibiotic treatment had a substantial effect on the gut microbiome, reducing Escherichia sp. and increasing other Enterobacteriaceae. This study demonstrates related preterm twins share similar gut microbiome development, even within the complex environment of neonatal intensive care. This is likely a result of shared genetic and immunomodulatory factors as well as exposure to the same maternal microbiome during birth, skin contact and exposure to EBM. Environmental factors including antibiotic exposure and feeding are additional significant determinants of community structure, regardless of host genetics

New prioritized value iteration for Markov decision processes

The problem of solving large Markov decision processes accurately and quickly is challenging. Since the computational effort incurred is considerable, current research focuses on finding superior acceleration techniques. For instance, the convergence properties of current solution methods depend, to a great extent, on the order of backup operations. On one hand, algorithms such as topological sorting are able to find good orderings but their overhead is usually high. On the other hand, shortest path methods, such as Dijkstra's algorithm which is based on priority queues, have been applied successfully to the solution of deterministic shortest-path Markov decision processes. Here, we propose an improved value iteration algorithm based on Dijkstra's algorithm for solving shortest path Markov decision processes. The experimental results on a stochastic shortest-path problem show the feasibility of our approach. © Springer Science+Business Media B.V. 2011.García Hernández, MDG.; Ruiz Pinales, J.; Onaindia De La Rivaherrera, E.; Aviña Cervantes, JG.; Ledesma Orozco, S.; Alvarado Mendez, E.; Reyes Ballesteros, A. (2012). New prioritized value iteration for Markov decision processes. Artificial Intelligence Review. 37(2):157-167. doi:10.1007/s10462-011-9224-zS157167372Agrawal S, Roth D (2002) Learning a sparse representation for object detection. In: Proceedings of the 7th European conference on computer vision. Copenhagen, Denmark, pp 1–15Bellman RE (1954) The theory of dynamic programming. Bull Amer Math Soc 60: 503–516Bellman RE (1957) Dynamic programming. Princeton University Press, New JerseyBertsekas DP (1995) Dynamic programming and optimal control. Athena Scientific, MassachusettsBhuma K, Goldsmith J (2003) Bidirectional LAO* algorithm. In: Proceedings of indian international conferences on artificial intelligence. p 980–992Blackwell D (1965) Discounted dynamic programming. Ann Math Stat 36: 226–235Bonet B, Geffner H (2003a) Faster heuristic search algorithms for planning with uncertainty and full feedback. In: Proceedings of the 18th international joint conference on artificial intelligence. Morgan Kaufmann, Acapulco, México, pp 1233–1238Bonet B, Geffner H (2003b) Labeled RTDP: improving the convergence of real-time dynamic programming. In: Proceedings of the international conference on automated planning and scheduling. Trento, Italy, pp 12–21Bonet B, Geffner H (2006) Learning depth-first search: a unified approach to heuristic search in deterministic and non-deterministic settings and its application to MDP. In: Proceedings of the 16th international conference on automated planning and scheduling. Cumbria, UKBoutilier C, Dean T, Hanks S (1999) Decision-theoretic planning: structural assumptions and computational leverage. J Artif Intell Res 11: 1–94Chang I, Soo H (2007) Simulation-based algorithms for Markov decision processes Communications and control engineering. Springer, LondonDai P, Goldsmith J (2007a) Faster dynamic programming for Markov decision processes. Technical report. Doctoral consortium, department of computer science and engineering. University of WashingtonDai P, Goldsmith J (2007b) Topological value iteration algorithm for Markov decision processes. In: Proceedings of the 20th international joint conference on artificial intelligence. Hyderabad, India, pp 1860–1865Dai P, Hansen EA (2007c) Prioritizing bellman backups without a priority queue. In: Proceedings of the 17th international conference on automated planning and scheduling, association for the advancement of artificial intelligence. Rhode Island, USA, pp 113–119Dibangoye JS, Chaib-draa B, Mouaddib A (2008) A Novel prioritization technique for solving Markov decision processes. In: Proceedings of the 21st international FLAIRS (The Florida Artificial Intelligence Research Society) conference, association for the advancement of artificial intelligence. Florida, USAFerguson D, Stentz A (2004) Focused propagation of MDPs for path planning. In: Proceedings of the 16th IEEE international conference on tools with artificial intelligence. pp 310–317Hansen EA, Zilberstein S (2001) LAO: a heuristic search algorithm that finds solutions with loops. Artif Intell 129: 35–62Hinderer K, Waldmann KH (2003) The critical discount factor for finite Markovian decision processes with an absorbing set. Math Methods Oper Res 57: 1–19Li L (2009) A unifying framework for computational reinforcement learning theory. PhD Thesis. The state university of New Jersey, New Brunswick. NJLittman ML, Dean TL, Kaelbling LP (1995) On the complexity of solving Markov decision problems.In: Proceedings of the 11th international conference on uncertainty in artificial intelligence. Montreal, Quebec pp 394–402McMahan HB, Gordon G (2005a) Fast exact planning in Markov decision processes. In: Proceedings of the 15th international conference on automated planning and scheduling. Monterey, CA, USAMcMahan HB, Gordon G (2005b) Generalizing Dijkstra’s algorithm and gaussian elimination for solving MDPs. Technical report, Carnegie Mellon University, PittsburghMeuleau N, Brafman R, Benazera E (2006) Stochastic over-subscription planning using hierarchies of MDPs. In: Proceedings of the 16th international conference on automated planning and scheduling. Cumbria, UK, pp 121–130Moore A, Atkeson C (1993) Prioritized sweeping: reinforcement learning with less data and less real time. Mach Learn 13: 103–130Puterman ML (1994) Markov decision processes. Wiley Editors, New YorkPuterman ML (2005) Markov decision processes. Wiley Inter Science Editors, New YorkRussell S (2005) Artificial intelligence: a modern approach. Making complex decisions (Ch-17), 2nd edn. Pearson Prentice Hill Ed., USAShani G, Brafman R, Shimony S (2008) Prioritizing point-based POMDP solvers. IEEE Trans Syst Man Cybern 38(6): 1592–1605Sniedovich M (2006) Dijkstra’s algorithm revisited: the dynamic programming connexion. Control Cybern 35: 599–620Sniedovich M (2010) Dynamic programming: foundations and principles, 2nd edn. Pure and Applied Mathematics Series, UKTijms HC (2003) A first course in stochastic models. Discrete-time Markov decision processes (Ch-6). Wiley Editors, UKVanderbei RJ (1996) Optimal sailing strategies. Statistics and operations research program, University of Princeton, USA ( http://www.orfe.princeton.edu/~rvdb/sail/sail.html )Vanderbei RJ (2008) Linear programming: foundations and extensions, 3rd edn. Springer, New YorkWingate D, Seppi KD (2005) Prioritization methods for accelerating MDP solvers. J Mach Learn Res 6: 851–88

Beyond literacy and numeracy in patient provider communication: Focus groups suggest roles for empowerment, provider attitude and language

<p>Abstract</p> <p>Background</p> <p>Although the number of people living in the United States with limited English proficiency (LEP) is substantial, the impact of language on patients' experience of provider-patient communication has been little explored.</p> <p>Methods</p> <p>We conducted a series of 12 exploratory focus groups in English, Spanish and Cantonese to elicit discussion about patient-provider communication, particularly with respect to the concerns of the health literacy framework, i.e. ability to accurately understand, interpret and apply information given by providers. Within each language, 2 groups had high education and 2 had low education participants to partially account for literacy levels, which cannot be assessed consistently across three languages. Eighty-five (85) adults enrolled in the focus groups. The resulting video tapes were transcribed, translated and analyzed via content analysis.</p> <p>Results</p> <p>We identified 5 themes: 1) language discordant communication; 2) language concordant communication; 3) empowerment; 4) providers' attitudes; 5) issues with the health care system. Despite efforts by facilitators to elicit responses related to cognitive understanding, issues of interpersonal process were more salient, and respondents did not readily separate issues of accurate understanding from their overall narratives of experience with health care and illness. Thematic codes often appeared to be associated with education level, language and/or culture.</p> <p>Conclusion</p> <p>Our most salient finding was that for most of our participants there was no clear demarcation between literacy and numeracy, language interpretation, health communication, interpersonal relations with their provider and the rest of their experience with the health care system.</p

Structural and biochemical characterization of the exopolysaccharide deacetylase Agd3 required for Aspergillus fumigatus biofilm formation

The exopolysaccharide galactosaminogalactan (GAG) is an important virulence factor of the fungal pathogen Aspergillus fumigatus. Deletion of a gene encoding a putative deacetylase, Agd3, leads to defects in GAG deacetylation, biofilm formation, and virulence. Here, we show that Agd3 deacetylates GAG in a metal-dependent manner, and is the founding member of carbohydrate esterase family CE18. The active site is formed by four catalytic motifs that are essential for activity. The structure of Agd3 includes an elongated substrate-binding cleft formed by a carbohydrate binding module (CBM) that is the founding member of CBM family 87. Agd3 homologues are encoded in previously unidentified putative bacterial exopolysaccharide biosynthetic operons and in other fungal genomes. The exopolysaccharide galactosaminogalactan (GAG) is an important virulence factor of the fungal pathogen Aspergillus fumigatus. Here, the authors study an A. fumigatus enzyme that deacetylates GAG in a metal-dependent manner and constitutes a founding member of a new carbohydrate esterase family.Bio-organic Synthesi

Web services at the European Bioinformatics Institute-2009

The European Bioinformatics Institute (EMBL-EBI) has been providing access to mainstream databases and tools in bioinformatics since 1997. In addition to the traditional web form based interfaces, APIs exist for core data resources such as EMBL-Bank, Ensembl, UniProt, InterPro, PDB and ArrayExpress. These APIs are based on Web Services (SOAP/REST) interfaces that allow users to systematically access databases and analytical tools. From the user's point of view, these Web Services provide the same functionality as the browser-based forms. However, using the APIs frees the user from web page constraints and are ideal for the analysis of large batches of data, performing text-mining tasks and the casual or systematic evaluation of mathematical models in regulatory networks. Furthermore, these services are widespread and easy to use; require no prior knowledge of the technology and no more than basic experience in programming. In the following we wish to inform of new and updated services as well as briefly describe planned developments to be made available during the course of 2009–2010