Unique morphological characteristics of mitochondrial subtypes in the heart: the effect of ischemia and ischemic preconditioning.

RATIONALE: Three subsets of mitochondria have been described in adult cardiomyocytes - intermyofibrillar (IMF), subsarcolemmal (SSM), and perinuclear (PN). They have been shown to differ in physiology, but whether they also vary in morphological characteristics is unknown. Ischemic preconditioning (IPC) is known to prevent mitochondrial dysfunction induced by acute myocardial ischemia/reperfusion injury (IRI), but whether IPC can also modulate mitochondrial morphology is not known. AIMS: Morphological characteristics of three different subsets of adult cardiac mitochondria along with the effect of ischemia and IPC on mitochondrial morphology will be investigated. METHODS: Mouse hearts were subjected to the following treatments (N=6 for each group): stabilization only, IPC (3x5 min cycles of global ischemia and reperfusion), ischemia only (20 min global ischemia); and IPC and ischemia. Hearts were then processed for electron microscopy and mitochondrial morphology was assessed subsequently. RESULTS: In adult cardiomyocytes, IMF mitochondria were found to be more elongated and less spherical than PN and SSM mitochondria. PN mitochondria were smaller in size when compared to the other two subsets. SSM mitochondria had similar area to IMF mitochondria but their sphericity measures were similar to PN mitochondria. Ischemia was shown to increase the sphericity parameters of all 3 subsets of mitochondria; reduce the length of IMF mitochondria, and increase the size of PN mitochondria. IPC had no effect on mitochondrial morphology either at baseline or after ischemia. CONCLUSION: The three subsets of mitochondria in the adult heart are morphologically different. IPC does not appear to modulate mitochondrial morphology in adult cardiomyocytes

Los desafíos en la continuidad de atención de personas viviendo con VIH en el Perú durante la pandemia de la COVID-19 [Challenges to the continuity of care of people living with HIV throughout the COVID-19 crisis in Peru]

The COVID-19 pandemic and societal response implemented may interact with the ongoing HIV epidemic in multiple ways. There are approximately 87000 people living with HIV (PLWH) who are at risk of developing COVID-19 in Peru and 67,000 of them are on antiretroviral therapy (ART) and at risk of limitations in their access to ART, compromising their adherence and their health during the pandemic. Finally, the potential effect of the pandemic on the mental health of PLWH is not documented. This opinion aims to: describe the clinical implications of the HIV/SARS-CoV-2 coinfection; discuss the challenges to the continuity of care of PLWH in Peru during the COVID-19 crisis; and comment possible implications that the COVID-19 crisis may pose on the mental health of PLWH

Reviews of

Antibiotic Switch therapy is defined by the switch of intravenous antibiotic therapy to oral form. This research aimed to learn about the relationship of switch therapy toward the value of wound healing, lenght of stay and the antibiotic expenditure. The data of this cross sectional study was collected from medical record and by direct investigation to patients for their macroscopis the wound healings value. T-test was used to compared the relationship of the patient wound healings value, lenght of stay and the antibiotic expenditure between the those with and accurate switch therapy and those without it. The result showed that there was no different of wound healing value between those groups of patients (P>0,1). On the other hand, lenght of stay and antibiotic expenditure of the patient with the accurate switch therapy was cuted on the patient with the accurate switch therapy. These indicated that accuracy of switch therapy will proceed a benefit outcome to the patient with appendicitis, especially to there lenght of stay and antibiotic expenditure as well

How the weather affects the pain of citizen scientists using a smartphone app

Patients with chronic pain commonly believe their pain is related to the weather. Scientific evidence to support their beliefs is inconclusive, in part due to difficulties in getting a large dataset of patients frequently recording their pain symptoms during a variety of weather conditions. Smartphones allow the opportunity to collect data to overcome these difficulties. Our study Cloudy with a Chance of Pain analysed daily data from 2658 patients collected over a 15-month period. The analysis demonstrated significant yet modest relationships between pain and relative humidity, pressure and wind speed, with correlations remaining even when accounting for mood and physical activity. This research highlights how citizen-science experiments can collect large datasets on real-world populations to address long-standing health questions. These results will act as a starting point for a future system for patients to better manage their health through pain forecasts

Observation of Coherent Elastic Neutrino-Nucleus Scattering

The coherent elastic scattering of neutrinos off nuclei has eluded detection for four decades, even though its predicted cross-section is the largest by far of all low-energy neutrino couplings. This mode of interaction provides new opportunities to study neutrino properties, and leads to a miniaturization of detector size, with potential technological applications. We observe this process at a 6.7-sigma confidence level, using a low-background, 14.6-kg CsI[Na] scintillator exposed to the neutrino emissions from the Spallation Neutron Source (SNS) at Oak Ridge National Laboratory. Characteristic signatures in energy and time, predicted by the Standard Model for this process, are observed in high signal-to-background conditions. Improved constraints on non-standard neutrino interactions with quarks are derived from this initial dataset

Transit Photometry as an Exoplanet Discovery Method

Photometry with the transit method has arguably been the most successful exoplanet discovery method to date. A short overview about the rise of that method to its present status is given. The method's strength is the rich set of parameters that can be obtained from transiting planets, in particular in combination with radial velocity observations; the basic principles of these parameters are given. The method has however also drawbacks, which are the low probability that transits appear in randomly oriented planet systems, and the presence of astrophysical phenomena that may mimic transits and give rise to false detection positives. In the second part we outline the main factors that determine the design of transit surveys, such as the size of the survey sample, the temporal coverage, the detection precision, the sample brightness and the methods to extract transit events from observed light curves. Lastly, an overview over past, current and future transit surveys is given. For these surveys we indicate their basic instrument configuration and their planet catch, including the ranges of planet sizes and stellar magnitudes that were encountered. Current and future transit detection experiments concentrate primarily on bright or special targets, and we expect that the transit method remains a principal driver of exoplanet science, through new discoveries to be made and through the development of new generations of instruments.Comment: Review chapte

The role of anti-aquaporin 4 antibody in the conversion of acute brainstem syndrome to neuromyelitis optica

Background: Acute brainstem syndrome (ABS) may herald multiple sclerosis (MS), neuromyelitis optica (NMO), or occur as an isolated syndrome. The aquaporin 4 (AQP4)-specific serum autoantibody, NMO-IgG, is a biomarker for NMO. However, the role of anti-AQP4 antibody in the conversion of ABS to NMO is unclear. Methods: Thirty-one patients with first-event ABS were divided into two groups according to the presence of anti-AQP4 antibodies, their clinical features and outcomes were retrospectively analyzed. Results: Fourteen of 31 patients (45.16 %) were seropositive for NMO-IgG. The 71.43 % of anti-AQP4 (+) ABS patients converted to NMO, while only 11.76 % of anti-AQP4 (-) ABS patients progressed to NMO. Anti-AQP4 (+) ABS patients demonstrated a higher IgG index (0.68 ± 0.43 vs 0.42 ± 0.13, p < 0.01) and Kurtzke Expanded Disability Status Scale (4.64 ± 0.93 vs 2.56 ± 0.81, p < 0.01) than anti-AQP4 (-) ABS patients. Area postrema clinical brainstem symptoms occurred more frequently in anti-AQP4 (+) ABS patients than those in anti-AQP4 (-) ABS patients (71.43 % vs 17.65 %, p = 0.004). In examination of magnetic resonance imaging (MRI), the 78.57 % of anti-AQP4 (+) ABS patients had medulla-predominant involvements in the sagittal view and dorsal-predominant involvements in the axial view. Conclusions: ABS represents an inaugural or limited form of NMO in a high proportion of anti-AQP4 (+) patients

First observations of separated atmospheric nu_mu and bar{nu-mu} events in the MINOS detector

The complete 5.4 kton MINOS far detector has been taking data since the beginning of August 2003 at a depth of 2070 meters water-equivalent in the Soudan mine, Minnesota. This paper presents the first MINOS observations of nuµ and [overline nu ]µ charged-current atmospheric neutrino interactions based on an exposure of 418 days. The ratio of upward- to downward-going events in the data is compared to the Monte Carlo expectation in the absence of neutrino oscillations, giving Rup/downdata/Rup/downMC=0.62-0.14+0.19(stat.)±0.02(sys.). An extended maximum likelihood analysis of the observed L/E distributions excludes the null hypothesis of no neutrino oscillations at the 98% confidence level. Using the curvature of the observed muons in the 1.3 T MINOS magnetic field nuµ and [overline nu ]µ interactions are separated. The ratio of [overline nu ]µ to nuµ events in the data is compared to the Monte Carlo expectation assuming neutrinos and antineutrinos oscillate in the same manner, giving R[overline nu ][sub mu]/nu[sub mu]data/R[overline nu ][sub mu]/nu[sub mu]MC=0.96-0.27+0.38(stat.)±0.15(sys.), where the errors are the statistical and systematic uncertainties. Although the statistics are limited, this is the first direct observation of atmospheric neutrino interactions separately for nuµ and [overline nu ]µ

On environment difficulty and discriminating power

The final publication is available at Springer via http://dx.doi.org/10.1007/s10458-014-9257-1This paper presents a way to estimate the difficulty and discriminating power of any task instance. We focus on a very general setting for tasks: interactive (possibly multiagent) environments where an agent acts upon observations and rewards. Instead of analysing the complexity of the environment, the state space or the actions that are performed by the agent, we analyse the performance of a population of agent policies against the task, leading to a distribution that is examined in terms of policy complexity. This distribution is then sliced by the algorithmic complexity of the policy and analysed through several diagrams and indicators. The notion of environment response curve is also introduced, by inverting the performance results into an ability scale. We apply all these concepts, diagrams and indicators to two illustrative problems: a class of agent-populated elementary cellular automata, showing how the difficulty and discriminating power may vary for several environments, and a multiagent system, where agents can become predators or preys, and may need to coordinate. Finally, we discuss how these tools can be applied to characterise (interactive) tasks and (multi-agent) environments. These characterisations can then be used to get more insight about agent performance and to facilitate the development of adaptive tests for the evaluation of agent abilities.I thank the reviewers for their comments, especially those aiming at a clearer connection with the field of multi-agent systems and the suggestion of better approximations for the calculation of the response curves. The implementation of the elementary cellular automata used in the environments is based on the library 'CellularAutomaton' by John Hughes for R [58]. I am grateful to Fernando Soler-Toscano for letting me know about their work [65] on the complexity of 2D objects generated by elementary cellular automata. I would also like to thank David L. Dowe for his comments on a previous version of this paper. This work was supported by the MEC/MINECO projects CONSOLIDER-INGENIO CSD2007-00022 and TIN 2010-21062-C02-02, GVA project PROMETEO/2008/051, the COST - European Cooperation in the field of Scientific and Technical Research IC0801 AT, and the REFRAME project, granted by the European Coordinated Research on Long-term Challenges in Information and Communication Sciences & Technologies ERA-Net (CHIST-ERA), and funded by the Ministerio de Economia y Competitividad in Spain (PCIN-2013-037).José Hernández-Orallo (2015). On environment difficulty and discriminating power. Autonomous Agents and Multi-Agent Systems. 29(3):402-454. https://doi.org/10.1007/s10458-014-9257-1S402454293Anderson, J., Baltes, J., & Cheng, C. T. (2011). Robotics competitions as benchmarks for ai research. The Knowledge Engineering Review, 26(01), 11–17.Andre, D., & Russell, S. J. (2002). State abstraction for programmable reinforcement learning agents. In Proceedings of the National Conference on Artificial Intelligence (pp. 119–125). Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999.Antunes, L., Fortnow, L., van Melkebeek, D., & Vinodchandran, N. V. (2006). Computational depth: Concept and applications. Theoretical Computer Science, 354(3), 391–404. Foundations of Computation Theory (FCT 2003), 14th Symposium on Fundamentals of Computation Theory 2003.Arai, K., Kaminka, G. A., Frank, I., & Tanaka-Ishii, K. (2003). Performance competitions as research infrastructure: Large scale comparative studies of multi-agent teams. Autonomous Agents and Multi-Agent Systems, 7(1–2), 121–144.Ashcraft, M. H., Donley, R. D., Halas, M. A., & Vakali, M. (1992). Chapter 8 working memory, automaticity, and problem difficulty. In Jamie I.D. Campbell (Ed.), The nature and origins of mathematical skills, volume 91 of advances in psychology (pp. 301–329). North-Holland.Ay, N., Müller, M., & Szkola, A. (2010). Effective complexity and its relation to logical depth. IEEE Transactions on Information Theory, 56(9), 4593–4607.Barch, D. M., Braver, T. S., Nystrom, L. E., Forman, S. D., Noll, D. C., & Cohen, J. D. (1997). Dissociating working memory from task difficulty in human prefrontal cortex. Neuropsychologia, 35(10), 1373–1380.Bordini, R. H., Hübner, J. F., & Wooldridge, M. (2007). Programming multi-agent systems in AgentSpeak using Jason. London: Wiley. com.Boutilier, C., Reiter, R., Soutchanski, M., Thrun, S. et al. (2000). Decision-theoretic, high-level agent programming in the situation calculus. In Proceedings of the National Conference on Artificial Intelligence (pp. 355–362). Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999.Busoniu, L., Babuska, R., & De Schutter, B. (2008). A comprehensive survey of multiagent reinforcement learning. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 38(2), 156–172.Chaitin, G. J. (1977). Algorithmic information theory. IBM Journal of Research and Development, 21, 350–359.Chedid, F. B. (2010). Sophistication and logical depth revisited. In 2010 IEEE/ACS International Conference on Computer Systems and Applications (AICCSA) (pp. 1–4). IEEE.Cheeseman, P., Kanefsky, B. & Taylor, W. M. (1991). Where the really hard problems are. In Proceedings of IJCAI-1991 (pp. 331–337).Dastani, M. (2008). 2APL: A practical agent programming language. Autonomous Agents and Multi-agent Systems, 16(3), 214–248.Delahaye, J. P. & Zenil, H. (2011). Numerical evaluation of algorithmic complexity for short strings: A glance into the innermost structure of randomness. Applied Mathematics and Computation, 219(1), 63–77Dowe, D. L. (2008). Foreword re C. S. Wallace. Computer Journal, 51(5), 523–560. Christopher Stewart WALLACE (1933–2004) memorial special issue.Dowe, D. L., & Hernández-Orallo, J. (2012). IQ tests are not for machines, yet. Intelligence, 40(2), 77–81.Du, D. Z., & Ko, K. I. (2011). Theory of computational complexity (Vol. 58). London: Wiley-Interscience.Elo, A. E. (1978). The rating of chessplayers, past and present (Vol. 3). London: Batsford.Embretson, S. E., & Reise, S. P. (2000). Item response theory for psychologists. London: Lawrence Erlbaum.Fatès, N. & Chevrier, V. (2010). How important are updating schemes in multi-agent systems? an illustration on a multi-turmite model. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1-Volume 1 (pp. 533–540). International Foundation for Autonomous Agents and Multiagent Systems.Ferber, J. & Müller, J. P. (1996). Influences and reaction: A model of situated multiagent systems. In Proceedings of Second International Conference on Multi-Agent Systems (ICMAS-96) (pp. 72–79).Ferrando, P. J. (2009). Difficulty, discrimination, and information indices in the linear factor analysis model for continuous item responses. Applied Psychological Measurement, 33(1), 9–24.Ferrando, P. J. (2012). Assessing the discriminating power of item and test scores in the linear factor-analysis model. Psicológica, 33, 111–139.Gent, I. P., & Walsh, T. (1994). Easy problems are sometimes hard. Artificial Intelligence, 70(1), 335–345.Gershenson, C. & Fernandez, N. (2012). Complexity and information: Measuring emergence, self-organization, and homeostasis at multiple scales. Complexity, 18(2), 29–44.Gruner, S. (2010). Mobile agent systems and cellular automata. Autonomous Agents and Multi-agent Systems, 20(2), 198–233.Hardman, D. K., & Payne, S. J. (1995). Problem difficulty and response format in syllogistic reasoning. The Quarterly Journal of Experimental Psychology, 48(4), 945–975.He, J., Reeves, C., Witt, C., & Yao, X. (2007). A note on problem difficulty measures in black-box optimization: Classification, realizations and predictability. Evolutionary Computation, 15(4), 435–443.Hernández-Orallo, J. (2000). Beyond the turing test. Journal of Logic Language & Information, 9(4), 447–466.Hernández-Orallo, J. (2000). On the computational measurement of intelligence factors. In A. Meystel (Ed.), Performance metrics for intelligent systems workshop (pp. 1–8). Gaithersburg, MD: National Institute of Standards and Technology.Hernández-Orallo, J. (2000). Thesis: Computational measures of information gain and reinforcement in inference processes. AI Communications, 13(1), 49–50.Hernández-Orallo, J. (2010). A (hopefully) non-biased universal environment class for measuring intelligence of biological and artificial systems. In M. Hutter et al. (Ed.), 3rd International Conference on Artificial General Intelligence (pp. 182–183). Atlantis Press Extended report at http://users.dsic.upv.es/proy/anynt/unbiased.pdf .Hernández-Orallo, J., & Dowe, D. L. (2010). Measuring universal intelligence: Towards an anytime intelligence test. Artificial Intelligence, 174(18), 1508–1539.Hernández-Orallo, J., Dowe, D. L., España-Cubillo, S., Hernández-Lloreda, M. V., & Insa-Cabrera, J. (2011). On more realistic environment distributions for defining, evaluating and developing intelligence. In J. Schmidhuber, K. R. Thórisson, & M. Looks (Eds.), LNAI series on artificial general intelligence 2011 (Vol. 6830, pp. 82–91). Berlin: Springer.Hernández-Orallo, J., Dowe, D. L., & Hernández-Lloreda, M. V. (2014). Universal psychometrics: Measuring cognitive abilities in the machine kingdom. Cognitive Systems Research, 27, 50–74.Hernández-Orallo, J., Insa, J., Dowe, D. L. & Hibbard, B. (2012). Turing tests with turing machines. In A. Voronkov (Ed.), The Alan Turing Centenary Conference, Turing-100, Manchester, 2012, volume 10 of EPiC Series (pp. 140–156).Hernández-Orallo, J. & Minaya-Collado, N. (1998). A formal definition of intelligence based on an intensional variant of Kolmogorov complexity. In Proceedings of International Symposium of Engineering of Intelligent Systems (EIS’98) (pp. 146–163). ICSC Press.Hibbard, B. (2009). Bias and no free lunch in formal measures of intelligence. Journal of Artificial General Intelligence, 1(1), 54–61.Hoos, H. H. (1999). Sat-encodings, search space structure, and local search performance. In 1999 International Joint Conference on Artificial Intelligence (Vol. 16, pp. 296–303).Insa-Cabrera, J., Benacloch-Ayuso, J. L., & Hernández-Orallo, J. (2012). On measuring social intelligence: Experiments on competition and cooperation. In J. Bach, B. Goertzel, & M. Iklé (Eds.), AGI, volume 7716 of lecture notes in computer science (pp. 126–135). Berlin: Springer.Insa-Cabrera, J., Dowe, D. L., España-Cubillo, S., Hernández-Lloreda, M. V., & Hernández-Orallo, J. (2011). Comparing humans and AI agents. In J. Schmidhuber, K. R. Thórisson, & M. Looks (Eds.), LNAI series on artificial general intelligence 2011 (Vol. 6830, pp. 122–132). Berlin: Springer.Knuth, D. E. (1973). Sorting and searching, volume 3 of the art of computer programming. Reading, MA: Addison-Wesley.Kotovsky, K., & Simon, H. A. (1990). What makes some problems really hard: Explorations in the problem space of difficulty. Cognitive Psychology, 22(2), 143–183.Legg, S. (2008). Machine super intelligence. PhD thesis, Department of Informatics, University of Lugano, June 2008.Legg, S., & Hutter, M. (2007). Universal intelligence: A definition of machine intelligence. Minds and Machines, 17(4), 391–444.Leonetti, M. & Iocchi, L. (2010). Improving the performance of complex agent plans through reinforcement learning. In Proceedings of the 2010 International Conference on Autonomous Agents and Multiagent Systems (Vol. 1, pp. 723–730). International Foundation for Autonomous Agents and Multiagent Systems.Levin, L. A. (1973). Universal sequential search problems. Problems of Information Transmission, 9(3), 265–266.Levin, L. A. (1986). Average case complete problems. SIAM Journal on Computing, 15, 285.Li, M., & Vitányi, P. (2008). An introduction to Kolmogorov complexity and its applications (3rd ed.). Berlin: Springer.Low, C. K., Chen, T. Y., & Rónnquist, R. (1999). Automated test case generation for bdi agents. Autonomous Agents and Multi-agent Systems, 2(4), 311–332.Madden, M. G., & Howley, T. (2004). Transfer of experience between reinforcement learning environments with progressive difficulty. Artificial Intelligence Review, 21(3), 375–398.Mellenbergh, G. J. (1994). Generalized linear item response theory. Psychological Bulletin, 115(2), 300.Michel, F. (2004). Formalisme, outils et éléments méthodologiques pour la modélisation et la simulation multi-agents. PhD thesis, Université des sciences et techniques du Languedoc, Montpellier.Miller, G. A. (1956). The magical number seven, plus or minus two: Some limits on our capacity for processing information. Psychological Review, 63(2), 81.Orponen, P., Ko, K. I., Schöning, U., & Watanabe, O. (1994). Instance complexity. Journal of the ACM (JACM), 41(1), 96–121.Simon, H. A., & Kotovsky, K. (1963). Human acquisition of concepts for sequential patterns. Psychological Review, 70(6), 534.Team, R., et al. (2013). R: A language and environment for statistical computing. Vienna, Austria: R Foundation for Statistical Computing.Whiteson, S., Tanner, B., & White, A. (2010). The reinforcement learning competitions. The AI Magazine, 31(2), 81–94.Wiering, M., & van Otterlo, M. (Eds.). (2012). Reinforcement learning: State-of-the-art. Berlin: Springer.Wolfram, S. (2002). A new kind of science. Champaign, IL: Wolfram Media.Zatuchna, Z., & Bagnall, A. (2009). Learning mazes with aliasing states: An LCS algorithm with associative perception. Adaptive Behavior, 17(1), 28–57.Zenil, H. (2010). Compression-based investigation of the dynamical properties of cellular automata and other systems. Complex Systems, 19(1), 1–28.Zenil, H. (2011). Une approche expérimentale à la théorie algorithmique de la complexité. PhD thesis, Dissertation in fulfilment of the degree of Doctor in Computer Science, Université de Lille.Zenil, H., Soler-Toscano, F., Delahaye, J. P. & Gauvrit, N. (2012). Two-dimensional kolmogorov complexity and validation of the coding theorem method by compressibility. arXiv, preprint arXiv:1212.6745

Quantifying the area-at-risk of myocardial infarction in-vivo using arterial spin labeling cardiac magnetic resonance

T2-weighted cardiovascular magnetic resonance (T2-CMR) of myocardial edema can quantify the area-at-risk (AAR) following acute myocardial infarction (AMI), and has been used to assess myocardial salvage by new cardioprotective therapies. However, some of these therapies may reduce edema, leading to an underestimation of the AAR by T2-CMR. Here, we investigated arterial spin labeling (ASL) perfusion CMR as a novel approach to quantify the AAR following AMI. Adult B6sv129-mice were subjected to in vivo left coronary artery ligation for 30 minutes followed by 72 hours reperfusion. T2-mapping was used to quantify the edema-based AAR (% of left ventricle) following ischemic preconditioning (IPC) or cyclosporin-A (CsA) treatment. In control animals, the AAR by T2-mapping corresponded to that delineated by histology. As expected, both IPC and CsA reduced MI size. However, IPC, but not CsA, also reduced myocardial edema leading to an underestimation of the AAR by T2-mapping. In contrast, regions of reduced myocardial perfusion delineated by cardiac ASL were able to delineate the AAR when compared to both T2-mapping and histology in control animals, and were not affected by either IPC or CsA. Therefore, ASL perfusion CMR may be an alternative method for quantifying the AAR following AMI, which unlike T2-mapping, is not affected by IPC