350 research outputs found

    Prenex Separation Logic with One Selector Field

    Get PDF
    International audienceWe show that infinite satisfiability can be reduced to finite satisfiabil-ity for all prenex formulas of Separation Logic with k ≥ 1 selector fields (SL k). This fact entails the decidability of the finite and infinite satisfiability problems for the class of prenex formulas of SL 1 , by reduction to the first-order theory of a single unary function symbol and an arbitrary number of unary predicate symbols. We also prove that the complexity of this fragment is not elementary recursive, by reduction from the first-order theory of one unary function symbol. Finally, we prove that the Bernays-Schönfinkel-Ramsey fragment of prenex SL 1 formulas with quantifier prefix in the language ∃ * ∀ * is PSPACE-complete

    Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages

    Full text link
    For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular. If L contains a non-regular language, PDL[L] can express non-regular properties, in contrast to pure PDL. For regular, visibly pushdown and deterministic context-free languages, the separation of the respective PDLs can be proven by automata-theoretic techniques. However, these techniques introduce non-determinism on the automata side. As non-determinism is also the difference between DCFL and CFL, these techniques seem to be inappropriate to separate PDL[DCFL] from PDL[CFL]. Nevertheless, this separation is shown but for programs without test operators.Comment: In Proceedings GandALF 2011, arXiv:1106.081

    Does wage rank affect employees' well-being?

    Get PDF
    How do workers make wage comparisons? Both an experimental study and an analysis of 16,000 British employees are reported. Satisfaction and well-being levels are shown to depend on more than simple relative pay. They depend upon the ordinal rank of an individual's wage within a comparison group. “Rank” itself thus seems to matter to human beings. Moreover, consistent with psychological theory, quits in a workplace are correlated with pay distribution skewness

    State, trait, and accumulated features of the Alzheimer's Disease Assessment Scale Cognitive Subscale (ADAS-Cog) in mild Alzheimer's disease

    Get PDF
    Background The Alzheimer's Disease Assessment Scale Cognitive Subscale (ADAS-Cog) is used to assess decline in memory, language, and praxis in Alzheimer's disease (AD). Methods A latent state–trait model with autoregressive effects was used to determine how much of the ADAS-Cog item measurement was reliable, and of that, how much of the information was occasion specific (state) versus consistent (trait or accumulated from one visit to the next). Results Participants with mild AD (n = 341) were assessed four times over 24 months. Praxis items were generally unreliable as were some memory items. Language items were generally the most reliable, and this increased over time. Only two ADAS-Cog items showed reliability >0.70 at all four assessments, word recall (memory) and naming (language). Of the reliable information, language items exhibited greater consistency (63.4% to 88.2%) than occasion specificity, and of the consistent information, language items tended to reflect effects of AD progression that accumulated from one visit to the next (35.5% to 45.3%). In contrast, reliable information from praxis items tended to come from trait information. The reliable information in the memory items reflected more consistent than occasion-specific information, but they varied between items in the relative amounts of trait versus accumulated effects. Conclusions Although the ADAS-Cog was designed to track cognitive decline, most items were unreliable, and each item captured different amounts of information related to occasion-specific, trait, and accumulated effects of AD over time. These latent properties complicate the interpretation of trends seen in ordinary statistical analyses of trials and other clinical studies with repeated ADAS-Cog item measures

    The airway microbiome of persons with cystic fibrosis correlates with acquisition and microbiological outcomes of incident Stenotrophomonas maltophilia infection

    Get PDF
    RationaleChronic infection with Stenotrophomonas maltophilia in persons with cystic fibrosis (pwCF) has been linked to an increased risk of pulmonary exacerbations and lung function decline. We sought to establish whether baseline sputum microbiome associates with risk of S. maltophilia incident infection and persistence in pwCF.MethodspwCF experiencing incident S. maltophilia infections attending the Calgary Adult CF Clinic from 2010–2018 were compared with S. maltophilia-negative sex, age (+/−2 years), and birth-cohort-matched controls. Infection outcomes were classified as persistent (when the pathogen was recovered in ≥50% of cultures in the subsequent year) or transient. We assessed microbial communities from prospectively biobanked sputum using V3-V4 16S ribosomal RNA (rRNA) gene sequencing, in the year preceding (Pre) (n = 57), at (At) (n = 22), and after (Post) (n = 31) incident infection. We verified relative abundance data using S. maltophilia-specific qPCR and 16S rRNA-targeted qPCR to assess bioburden. Strains were typed using pulse-field gel electrophoresis.ResultsTwenty-five pwCF with incident S. maltophilia (56% female, median 29 years, median FEV1 61%) with 33 total episodes were compared with 56 uninfected pwCF controls. Demographics and clinical characteristics were similar between cohorts. Among those with incident S. maltophilia infection, sputum communities did not cluster based on infection timeline (Pre, At, Post). Communities differed between the infection cohort and controls (n = 56) based on Shannon Diversity Index (SDI, p = 0.04) and clustered based on Aitchison distance (PERMANOVA, p = 0.01) prior to infection. At the time of incident S. maltophilia isolation, communities did not differ in SDI but clustered based on Aitchison distance (PERMANOVA, p = 0.03) in those that ultimately developed persistent infection versus those that were transient. S. maltophilia abundance within sputum was increased in samples from patients (Pre) relative to controls, measuring both relative (p = 0.004) and absolute (p = 0.001). Furthermore, S. maltophilia abundance was increased in sputum at incident infection in those who ultimately developed persistent infection relative to those with transient infection, measured relatively (p = 0.04) or absolute (p = 0.04), respectively.ConclusionMicrobial community composition of CF sputum associates with S. maltophilia infection acquisition as well as infection outcome. Our study suggests sputum microbiome may serve as a surrogate for identifying infection risk and persistence risk

    Collapsible Pushdown Automata and Recursion Schemes

    Get PDF
    International audienceWe consider recursion schemes (not assumed to be homogeneously typed, and hence not necessarily safe) and use them as generators of (possibly infinite) ranked trees. A recursion scheme is essentially a finite typed {deterministic term} rewriting system that generates, when one applies the rewriting rules ad infinitum, an infinite tree, called its value tree. A fundamental question is to provide an equivalent description of the trees generated by recursion schemes by a class of machines. In this paper we answer this open question by introducing collapsible pushdown automata (CPDA), which are an extension of deterministic (higher-order) pushdown automata. A CPDA generates a tree as follows. One considers its transition graph, unfolds it and contracts its silent transitions, which leads to an infinite tree which is finally node labelled thanks to a map from the set of control states of the CPDA to a ranked alphabet. Our contribution is to prove that these two models, higher-order recursion schemes and collapsible pushdown automata, are equi-expressive for generating infinite ranked trees. This is achieved by giving an effective transformations in both directions

    A Regional Nuclear Conflict Would Compromise Global Food Security

    Get PDF
    A limited nuclear war between India and Pakistan could ignite fires large enough to emit more than 5 Tg of soot into the stratosphere. Climate model simulations have shown severe resulting climate perturbations with declines in global mean temperature by 1.8 C and precipitation by 8%, for at least 5 y. Here we evaluate impacts for the global food system. Six harmonized state-of-the-art crop models show that global caloric production from maize, wheat, rice, and soybean falls by 13 (1)%, 11 (8)%, 3 (5)%, and 17 (2)% over 5 y. Total single-year losses of 12 (4)% quadruple the largest observed historical anomaly and exceed impacts caused by historic droughts and volcanic eruptions. Colder temperatures drive losses more than changes in precipitation and solar radiation, leading to strongest impacts in temperate regions poleward of 30N, including the United States, Europe, and China for 10 to 15 y. Integrated food trade network analyses show that domestic reserves and global trade can largely buffer the production anomaly in the first year. Persistent multiyear losses, however, would constrain domestic food availability and propagate to the Global South, especially to food-insecure countries. By year 5, maize and wheat availability would decrease by 13% globally and by more than 20% in 71 countries with a cumulative population of 1.3 billion people. In view of increasing instability in South Asia, this study shows that a regional conflict using <1% of the worldwide nuclear arsenal could have adverse consequences for global food security unmatched in modern history

    Using redundancy to cope with failures in a delay tolerant network

    Full text link
    We consider the problem of routing in a delay tolerant net-work (DTN) in the presence of path failures. Previous work on DTN routing has focused on using precisely known network dy-namics, which does not account for message losses due to link failures, buffer overruns, path selection errors, unscheduled de-lays, or other problems. We show how to split, replicate, and erasure code message fragments over multiple delivery paths to optimize the probability of successful message delivery. We provide a formulation of this problem and solve it for two cases: a 0/1 (Bernoulli) path delivery model where messages are ei-ther fully lost or delivered, and a Gaussian path delivery model where only a fraction of a message may be delivered. Ideas from the modern portfolio theory literature are borrowed to solve the underlying optimization problem. Our approach is directly relevant to solving similar problems that arise in replica place-ment in distributed file systems and virtual node placement in DHTs. In three different simulated DTN scenarios covering a wide range of applications, we show the effectiveness of our ap-proach in handling failures
    corecore