The combination of ascorbic acid and PEG-based bowel preparation reduces the volume patients have to drink without compromising efficacy or safety. The low-volume PEG + Asc preparation was more acceptable to patients, and should, therefore, improve effectiveness in routine practice.

BACKGROUND AND PURPOSE: SHT and ME are feared complications in patients with acute ischemic stroke. They occur Ͼ10 times more frequently in tPA-treated versus placebo-treated patients. Our goal was to evaluate the sensitivity and specificity of admission BBBP measurements derived from PCT in predicting the development of SHT and ME in patients with acute ischemic stroke.

Both pressure-controlled ventilation and pressure support ventilation induce a redistribution of ventilation toward the ventral region, as detected by electrical impedance tomography. Spontaneous breathing prevents this redistribution.

BACKGROUND AND PURPOSE:The Patlak model has been applied to first-pass perfusion CT (PCT) data to extract information on blood-brain barrier permeability (BBBP) to predict hemorrhagic transformation in patients with acute stroke. However, the Patlak model was originally described for the delayed steady-state phase of contrast circulation. The goal of this study was to assess whether the first pass or the delayed phase of a contrast bolus injection better respects the assumptions of the Patlak model for the assessment of BBBP in patients with acute stroke by using PCT.

Driven by application requirements and using well-understood theoretical results, we describe a novel methodology and a tool for modular ontology design. We support the user in the safe use of imported symbols and in the economic import of the relevant part of the imported ontology. Both features are supported in a well-understood way: safety guarantees that the semantics of imported concepts is not changed, and economic import guarantees that no difference can be observed between importing the whole ontology and importing the relevant part. MotivationOntology design and maintenance require an expertise in both the domain of application and the ontology language. Realistic ontologies typically model different aspects of an application domain at various levels of granularity; prominent examples are the National Cancer Institute Ontology (NCI) 4 [1], which describes diseases, drugs, proteins, etc., and GALEN 5 , which represents knowledge mainly about the human anatomy, but also about other domains such as drugs.Ontologies such as NCI and GALEN are used in bio-medical applications as reference ontologies, i.e., ontology developers reuse these ontologies and customise them for their specific needs. For example, ontology designers use concepts 6 from NCI or GALEN and refine them (e.g., add new sub-concepts), generalise them (e.g., add new super-concepts), or refer to them when expressing a property of some other concept (e.g., define the concept Polyarticular JRA by referring to the concept Joint from GALEN).4 Online browser: http://nciterms.nci.nih.gov/NCIBrowser/Dictionary.do, latest version: ftp://ftp1.nci.nih.gov/pub/cacore/EVS/NCI Thesaurus 5 http://www.co-ode.org/galen 6 We use the Description Logic terms "concept" and "role" instead of the OWL terms "class" and "property".

Abstract. In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This paper undertakes a systematic study of satisfiability for LTL formulae over restricted sets of propositional and temporal operators. Since every propositional operator corresponds to a Boolean function, there exist infinitely many propositional operators. In order to systematically cover all possible sets of them, we use Post's lattice. With its help, we determine the computational complexity of LTL satisfiability for all combinations of temporal operators and all but two classes of propositional functions. Each of these infinitely many problems is shown to be either PSPACE-complete, NP-complete, or in P. ACM

Qualitative Spatial and Temporal Reasoning (QSTR) is concerned with symbolic knowledge representation, typically over infinite domains. The motivations for employing QSTR techniques range from exploiting computational properties that allow efficient reasoning to capture human cognitive concepts in a computational framework. The notion of a qualitative calculus is one of the most prominent QSTR formalisms. This article presents the first overview of all qualitative calculi developed to date and their computational properties, together with generalized definitions of the fundamental concepts and methods, which now encompass all existing calculi. Moreover, we provide a classification of calculi according to their algebraic properties.

The SNOMED CT hierarchies cannot be relied upon in their present state in our applications. However, systematic quality assurance and correction are possible and practical but require sound techniques analogous to software engineering and combined lexical and semantic techniques. Until this is done, anyone using SNOMED codes should exercise caution. Errors in the hierarchies, or attempts to compensate for them, are likely to compromise interoperability and meaningful use.