110 research outputs found
An investigation of TNAV equipped aircraft in a simulated en route metering environment
This document presents the results of an effort to estimate how often a TNAV (Time Navigation) equipped aircraft could be given a TNAV clearance in the En Route Metering (ERM) system as a function of the percentage of arriving traffic which is TNAV equipped. A fast-time simulation of Denver Stapleton international arrival traffic in the Denver Air Route Traffic Control Center route structure, including en route metering operations, was used to develop data on estimated conflicts, clearance communications and fuel usage for traffic mixes of 25, 50, 75 and 100% TNAV equipped. This study supports an overall effort by NASA to assess the benefits and required technology for using TNAV-equipped aircraft in the ERM environment
Rich Counter-Examples for Temporal-Epistemic Logic Model Checking
Model checking verifies that a model of a system satisfies a given property,
and otherwise produces a counter-example explaining the violation. The verified
properties are formally expressed in temporal logics. Some temporal logics,
such as CTL, are branching: they allow to express facts about the whole
computation tree of the model, rather than on each single linear computation.
This branching aspect is even more critical when dealing with multi-modal
logics, i.e. logics expressing facts about systems with several transition
relations. A prominent example is CTLK, a logic that reasons about temporal and
epistemic properties of multi-agent systems. In general, model checkers produce
linear counter-examples for failed properties, composed of a single computation
path of the model. But some branching properties are only poorly and partially
explained by a linear counter-example.
This paper proposes richer counter-example structures called tree-like
annotated counter-examples (TLACEs), for properties in Action-Restricted CTL
(ARCTL), an extension of CTL quantifying paths restricted in terms of actions
labeling transitions of the model. These counter-examples have a branching
structure that supports more complete description of property violations.
Elements of these counter-examples are annotated with parts of the property to
give a better understanding of their structure. Visualization and browsing of
these richer counter-examples become a critical issue, as the number of
branches and states can grow exponentially for deeply-nested properties.
This paper formally defines the structure of TLACEs, characterizes adequate
counter-examples w.r.t. models and failed properties, and gives a generation
algorithm for ARCTL properties. It also illustrates the approach with examples
in CTLK, using a reduction of CTLK to ARCTL. The proposed approach has been
implemented, first by extending the NuSMV model checker to generate and export
branching counter-examples, secondly by providing an interactive graphical
interface to visualize and browse them.Comment: In Proceedings IWIGP 2012, arXiv:1202.422
Recommended from our members
You are the only possible oracle: Effective test selection for end users of interactive machine learning systems
How do you test a program when only a single user, with no expertise in software testing, is able to determine if the program is performing correctly? Such programs are common today in the form of machine-learned classifiers. We consider the problem of testing this common kind of machine-generated program when the only oracle is an end user: e.g., only you can determine if your email is properly filed. We present test selection methods that provide very good failure rates even for small test suites, and show that these methods work in both large-scale random experiments using a “gold standard” and in studies with real users. Our methods are inexpensive and largely algorithm-independent. Key to our methods is an exploitation of properties of classifiers that is not possible in traditional software testing. Our results suggest that it is plausible for time-pressured end users to interactively detect failures—even very hard-to-find failures—without wading through a large number of successful (and thus less useful) tests. We additionally show that some methods are able to find the arguably most difficult-to-detect faults of classifiers: cases where machine learning algorithms have high confidence in an incorrect result
Software Model Checking with Explicit Scheduler and Symbolic Threads
In many practical application domains, the software is organized into a set
of threads, whose activation is exclusive and controlled by a cooperative
scheduling policy: threads execute, without any interruption, until they either
terminate or yield the control explicitly to the scheduler. The formal
verification of such software poses significant challenges. On the one side,
each thread may have infinite state space, and might call for abstraction. On
the other side, the scheduling policy is often important for correctness, and
an approach based on abstracting the scheduler may result in loss of precision
and false positives. Unfortunately, the translation of the problem into a
purely sequential software model checking problem turns out to be highly
inefficient for the available technologies. We propose a software model
checking technique that exploits the intrinsic structure of these programs.
Each thread is translated into a separate sequential program and explored
symbolically with lazy abstraction, while the overall verification is
orchestrated by the direct execution of the scheduler. The approach is
optimized by filtering the exploration of the scheduler with the integration of
partial-order reduction. The technique, called ESST (Explicit Scheduler,
Symbolic Threads) has been implemented and experimentally evaluated on a
significant set of benchmarks. The results demonstrate that ESST technique is
way more effective than software model checking applied to the sequentialized
programs, and that partial-order reduction can lead to further performance
improvements.Comment: 40 pages, 10 figures, accepted for publication in journal of logical
methods in computer scienc
Malnutrition and disability: unexplored opportunities for collaboration
There is increasing international interest in the links between malnutrition and disability: both are major global public health problems, both are key human rights concerns, and both are currently prominent within the global health agenda. In this review, interactions between the two fields are explored and it is argued that strengthening links would lead to important mutual benefits and synergies. At numerous points throughout the life-cycle, malnutrition can cause or contribute to an individual's physical, sensory, intellectual or mental health disability. By working more closely together, these problems can be transformed into opportunities: nutrition services and programmes for children and adults can act as entry points to address and, in some cases, avoid or mitigate disability; disability programmes can improve nutrition for the children and adults they serve. For this to happen, however, political commitment and resources are needed, as are better data
Malnutrition and disability: unexplored opportunities for collaboration.
There is increasing international interest in the links between malnutrition and disability: both are major global public health problems, both are key human rights concerns, and both are currently prominent within the global health agenda. In this review, interactions between the two fields are explored and it is argued that strengthening links would lead to important mutual benefits and synergies. At numerous points throughout the life-cycle, malnutrition can cause or contribute to an individual's physical, sensory, intellectual or mental health disability. By working more closely together, these problems can be transformed into opportunities: nutrition services and programmes for children and adults can act as entry points to address and, in some cases, avoid or mitigate disability; disability programmes can improve nutrition for the children and adults they serve. For this to happen, however, political commitment and resources are needed, as are better data
‘Disability and HIV in Africa: Breaking the barriers to sexual health care’
Three decades in to the HIV pandemic, the issues affecting people with disabilities remains less known. Increasing attention has been given to this overlooked population when it comes to HIV prevention, treatment and care. This is related to the significant unmet sexual and reproductive health care needs facing people with disabilities worldwide. This article discusses the barriers to sexual health for people with disabilities in Africa, and presents an argument about how mainstream HIV prevention work and research does not adequately attend to the sorts of systemic barriers that exclude people with disabilities, which a more targeted, and critical approach could
Studies of a Ring-Cleaving Dioxygenase Illuminate the Role of Cholesterol Metabolism in the Pathogenesis of Mycobacterium tuberculosis
Mycobacterium tuberculosis, the etiological agent of TB, possesses a cholesterol catabolic pathway implicated in pathogenesis. This pathway includes an iron-dependent extradiol dioxygenase, HsaC, that cleaves catechols. Immuno-compromised mice infected with a ΔhsaC mutant of M. tuberculosis H37Rv survived 50% longer than mice infected with the wild-type strain. In guinea pigs, the mutant disseminated more slowly to the spleen, persisted less successfully in the lung, and caused little pathology. These data establish that, while cholesterol metabolism by M. tuberculosis appears to be most important during the chronic stage of infection, it begins much earlier and may contribute to the pathogen's dissemination within the host. Purified HsaC efficiently cleaved the catecholic cholesterol metabolite, DHSA (3,4-dihydroxy-9,10-seconandrost-1,3,5(10)-triene-9,17-dione; kcat/Km = 14.4±0.5 µM−1 s−1), and was inactivated by a halogenated substrate analogue (partition coefficient<50). Remarkably, cholesterol caused loss of viability in the ΔhsaC mutant, consistent with catechol toxicity. Structures of HsaC:DHSA binary complexes at 2.1 Å revealed two catechol-binding modes: bidentate binding to the active site iron, as has been reported in similar enzymes, and, unexpectedly, monodentate binding. The position of the bicyclo-alkanone moiety of DHSA was very similar in the two binding modes, suggesting that this interaction is a determinant in the initial substrate-binding event. These data provide insights into the binding of catechols by extradiol dioxygenases and facilitate inhibitor design
SpHincterotomy for Acute Recurrent Pancreatitis Randomized Trial: Rationale, Methodology, and Potential Implications
Objectives:
In patients with acute recurrent pancreatitis (ARP), pancreas divisum, and no other etiologic factors, endoscopic retrograde cholangiopancreatography (ERCP) with minor papilla endoscopic sphincterotomy (miES) is often performed to enlarge the minor papillary orifice, based on limited data. The aims of this study are to describe the rationale and methodology of a sham-controlled clinical trial designed to test the hypothesis that miES reduces the risk of acute pancreatitis.
Methods:
The SpHincterotomy for Acute Recurrent Pancreatitis (SHARP) trial is a multicenter, international, sham-controlled, randomized trial comparing endoscopic ultrasound + ERCP with miES vs. endoscopic ultrasound + sham for the management of ARP. A total of 234 consented patients having two or more discrete episodes of acute pancreatitis, pancreas divisum confirmed by magnetic resonance cholangiopancreatography, and no other clear etiology for acute pancreatitis will be randomized. Both cohorts will be followed for a minimum of 6 months and maximum of 48 months.
Results:
The trial is powered to detect a 33% risk reduction of acute pancreatitis frequency.
Conclusions:
The SHARP trial will determine whether ERCP with miES benefits patients with idiopathic ARP and pancreas divisum. Trial planning has informed the importance of blinded outcome assessors and long-term follow-up
- …