Preliminary results for RR Lyrae stars and Classical Cepheids from the Vista Magellanic Cloud (VMC) Survey

The Vista Magellanic Cloud (VMC, PI M.R. Cioni) survey is collecting $K_S$-band time series photometry of the system formed by the two Magellanic Clouds (MC) and the "bridge" that connects them. These data are used to build $K_S$-band light curves of the MC RR Lyrae stars and Classical Cepheids and determine absolute distances and the 3D geometry of the whole system using the $K$-band period luminosity ($PLK_S$), the period - luminosity - color ($PLC$) and the Wesenhiet relations applicable to these types of variables. As an example of the survey potential we present results from the VMC observations of two fields centered respectively on the South Ecliptic Pole and the 30 Doradus star forming region of the Large Magellanic Cloud. The VMC $K_S$-band light curves of the RR Lyrae stars in these two regions have very good photometric quality with typical errors for the individual data points in the range of $\sim$ 0.02 to 0.05 mag. The Cepheids have excellent light curves (typical errors of $\sim$ 0.01 mag). The average $K_S$ magnitudes derived for both types of variables were used to derive $PLK_S$ relations that are in general good agreement within the errors with the literature data, and show a smaller scatter than previous studies.Comment: 7 pages, 6 figure. Accepted for publication in Astrophysics and Space Science. Following a presentation at the conference "The Fundamental Cosmic Distance Scale: State of the Art and the Gaia Perspective", Naples, May 201

Decision Problems for Nash Equilibria in Stochastic Games

We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with $\omega$-regular objectives. While the existence of an equilibrium whose payoff falls into a certain interval may be undecidable, we single out several decidable restrictions of the problem. First, restricting the search space to stationary, or pure stationary, equilibria results in problems that are typically contained in PSPACE and NP, respectively. Second, we show that the existence of an equilibrium with a binary payoff (i.e. an equilibrium where each player either wins or loses with probability 1) is decidable. We also establish that the existence of a Nash equilibrium with a certain binary payoff entails the existence of an equilibrium with the same payoff in pure, finite-state strategies.Comment: 22 pages, revised versio

Games where you can play optimally without any memory

International audienceReactive systems are often modelled as two person antagonistic games where one player represents the system while his adversary represents the environment. Undoubtedly, the most popular games in this context are parity games and their cousins (Rabin, Streett and Muller games). Recently however also games with other types of payments, like discounted or mean-payoff , previously used only in economic context, entered into the area of system modelling and verification. The most outstanding property of parity, mean-payoff and discounted games is the existence of optimal positional (memoryless) strategies for both players. This observation raises two questions: (1) can we characterise the family of payoff mappings for which there always exist optimal positional strategies for both players and (2) are there other payoff mappings with practical or theoretical interest and admitting optimal positional strategies. This paper provides a complete answer to the first question by presenting a simple necessary and sufficient condition on payoff mapping guaranteeing the existence of optimal positional strategies. As a corollary to this result we show the following remarkable property of payoff mappings: if both players have optimal positional strategies when playing solitary one-player games then also they have optimal positional strategies for two-player games

Perfect Information Stochastic Priority Games

International audienceWe introduce stochastic priority games - a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority games a play can be stopped by the environment after a finite number of stages, however, infinite plays are also possible. In discounted priority games only infinite plays are possible and the payoff is a linear combination of the classical discount payoff and of a limit payoff evaluating the performance at infinity. Shapley games and parity games are special extreme cases of priority games

Ethics of controlled human infection to study COVID-19

Development of an effective vaccine is the clearest path to controlling the coronavirus disease 2019 (COVID-19) pandemic. To accelerate vaccine development, some researchers are pursuing, and thousands of people have expressed interest in participating in, controlled human infection studies (CHIs) with severe acute respiratory syndrome–coronavirus 2 (SARS-CoV-2) (1, 2). In CHIs, a small number of participants are deliberately exposed to a pathogen to study infection and gather preliminary efficacy data on experimental vaccines or treatments. We have been developing a comprehensive, state-of-the-art ethical framework for CHIs that emphasizes their social value as fundamental to justifying these studies. The ethics of CHIs in general are underexplored (3, 4), and ethical examinations of SARS-CoV-2 CHIs have largely focused on whether the risks are acceptable and participants could give valid informed consent (1). The high social value of such CHIs has generally been assumed. Based on our framework, we agree on the ethical conditions for conducting SARS-CoV-2 CHIs (see the table). We differ on whether the social value of such CHIs is sufficient to justify the risks at present, given uncertainty about both in a rapidly evolving situation; yet we see none of our disagreements as insurmountable. We provide ethical guidance for research sponsors, communities, participants, and the essential independent reviewers considering SARS-CoV-2 CHIs

Extended Computation Tree Logic

We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may determine the moments along a path that an until property may be fulfilled. We consider several classes of languages leading to logics with different expressive power and complexity, whose importance is motivated by their use in model checking, synthesis, abstract interpretation, etc. We show that even with context-free languages on the until operator the logic still allows for polynomial time model-checking despite the significant increase in expressive power. This makes the logic a promising candidate for applications in verification. In addition, we analyse the complexity of satisfiability and compare the expressive power of these logics to CTL* and extensions of PDL

And-or tableaux for fixpoint logics with converse: LTL, CTL, PDL and CPDL

Over the last forty years, computer scientists have invented or borrowed numerous logics for reasoning about digital systems. Here, I would like to concentrate on three of them: Linear Time Temporal Logic (LTL), branching time Computation Tree temporal Logic (CTL), and Propositional Dynamic Logic (PDL), with and without converse. More specifically, I would like to present results and techniques on how to solve the satisfiability problem in these logics, with global assumptions, using the tableau method. The issues that arise are the typical tensions between computational complexity, practicality and scalability. This is joint work with Linh Anh Nguyen, Pietro Abate, Linda Postniece, Florian Widmann and Jimmy Thomson

Pre-operative trichiatic eyelash pattern predicts post-operative trachomatous trichiasis

Importance Trichiasis surgery programs globally have faced high rates of poor surgical outcomes. Identifying correctable risk factors for improving long-term outcomes is essential for countries targeting elimination of trachoma as a public health problem. Objective To determine whether the location of trichiatic eyelashes prior to surgery influences development of post-operative trichiasis (PTT) within two years after surgery. Design Secondary data analysis of four randomized clinical trials evaluating methods to improve trichiasis surgery outcomes. These include the Surgery for Trichiasis, Antibiotics for Recurrence (STAR) trial, Partnership for Rapid Elimination of Trachoma (PRET-Surgery), absorbable versus silk sutures trial, and epilation versus surgery for minor trichiasis trial. Setting Primary trials were conducted in rural areas of Ethiopia and Tanzania Interventions or exposures Trichiasis surgery performed with either the bilamellar tarsal rotation procedure or posterior lamellar rotation procedure Main outcomes Prevalence of PTT within two years after surgery, location of trichiatic eyelashes pre-operatively and post-operatively Results 6,747 eyelids that underwent first-time trichiasis surgery were included. PTT rates varied by study, ranging from 10–40%. PTT was less severe (based on number of trichiatic eyelashes) than initial trichiasis for 72% of those developing PTT, and only 2% of eyelids were worse at follow up than pre-operatively. Eyelids with central only-trichiasis pre-operatively had lower rates of PTT than eyelids with peripheral only trichiasis in each of the three trials that included severe TT cases. 10% of eyelids with peripheral trichiasis pre-operatively that develop PTT have central TT post-operatively. Conclusions and relevance Pre-operative central trichiasis is less likely than peripheral trichiasis to be associated with subsequent PTT. Regardless of type of surgery, surgeon skill levels, or pre-operative trichiasis severity, the presence of peripheral trichiasis pre-operatively is associated with higher rates of PTT. Making an incision that extends the length of the eyelid and adequately rotating the nasal and temporal aspects of the eyelid when suturing may help to minimize the chance of developing peripheral PTT

The impact of working memory load on task execution and online plan adjustment during multitasking in a virtual environment

Three experiments investigated the impact of working memory load on online plan adjustment during a test of multitasking in young, nonexpert, adult participants. Multitasking was assessed using the Edinburgh Virtual Errands Test (EVET). Participants were asked to memorize either good or poor plans for performing multiple errands and were assessed both on task completion and on the extent to which they modified their plans during EVET performance. EVET was performed twice, with and without a secondary task loading a component of working memory. In Experiment 1, articulatory suppression was used to load the phonological loop. In Experiment 2, oral random generation was used to load executive functions. In Experiment 3, spatial working memory was loaded with an auditory spatial localization task. EVET performance for both good- and poor-planning groups was disrupted by random generation and sound localization, but not by articulatory suppression. Additionally, people given a poor plan were able to overcome this initial disadvantage by modifying their plans online. It was concluded that, in addition to executive functions, multiple errands performance draws heavily on spatial, but not verbal, working memory resources but can be successfully completed on the basis of modifying plans online, despite a secondary task load