1,252 research outputs found

    Existence of Monetary Steady States in a Matching Model: Indivisible Money

    Get PDF
    Existence of a monetary steady state is established for a random matching model with divisible goods, indivisible money, and take-it-or-leave-it offers by consumers. There is no restriction on individual money holdings. The background environment is that in papers by Shi and by Trejos and Wright. The monetary steady state shown to exist has nice properties: the value function, defined on money holdings, is increasing and strictly concave, and the measure over money holdings has full support.

    Unification in the Description Logic EL

    Full text link
    The Description Logic EL has recently drawn considerable attention since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies. Unification in Description Logics has been proposed as a novel inference service that can, for example, be used to detect redundancies in ontologies. The main result of this paper is that unification in EL is decidable. More precisely, EL-unification is NP-complete, and thus has the same complexity as EL-matching. We also show that, w.r.t. the unification type, EL is less well-behaved: it is of type zero, which in particular implies that there are unification problems that have no finite complete set of unifiers.Comment: 31page

    Rings and spirals in barred galaxies. I Building blocks

    Full text link
    In this paper we present building blocks which can explain the formation and properties both of spirals and of inner and outer rings in barred galaxies. We first briefly summarise the main results of the full theoretical description we have given elsewhere, presenting them in a more physical way, aimed to an understanding without the requirement of extended knowledge of dynamical systems or of orbital structure. We introduce in this manner the notion of manifolds, which can be thought of as tubes guiding the orbits. The dynamics of these manifolds can govern the properties of spirals and of inner and outer rings in barred galaxies. We find that the bar strength affects how unstable the L1 and L2 Lagrangian points are, the motion within the 5A5A5Amanifold tubes and the time necessary for particles in a manifold to make a complete turn around the galactic centre. We also show that the strength of the bar, or, to be more precise, of the non-axisymmetric forcing at and somewhat beyond the corotation region, determines the resulting morphology. Thus, less strong bars give rise to R1 rings or pseudorings, while stronger bars drive R2, R1R2 and spiral morphologies. We examine the morphology as a function of the main parameters of the bar and present descriptive two dimensional plots to that avail. We also derive how the manifold morphologies and properties are modified if the L1 and L2 Lagrangian points become stable. Finally, we discuss how dissipation affects the manifold properties and compare the manifolds in gas-like and in stellar cases. Comparison with observations, as well as clear predictions to be tested by observations will be given in an accompanying paper.Comment: Typos corrected to match the version in press in MNRA

    Knotted holomorphic discs in

    Get PDF
    We construct knotted proper holomorphic embeddings of the unit disc i

    Fusions of Description Logics and Abstract Description Systems

    Full text link
    Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion. Though description logics are closely related to modal logics, they are not necessarily normal. In addition, ABox reasoning in description logics is not covered by the results from modal logics. In this paper, we extend the decidability transfer results from normal modal logics to a large class of description logics. To cover different description logics in a uniform way, we introduce abstract description systems, which can be seen as a common generalization of description and modal logics, and show the transfer results in this general setting

    Optimizing the computation of overriding

    Full text link
    We introduce optimization techniques for reasoning in DLN---a recently introduced family of nonmonotonic description logics whose characterizing features appear well-suited to model the applicative examples naturally arising in biomedical domains and semantic web access control policies. Such optimizations are validated experimentally on large KBs with more than 30K axioms. Speedups exceed 1 order of magnitude. For the first time, response times compatible with real-time reasoning are obtained with nonmonotonic KBs of this size

    Propositional Encoding of Constraints over Tree-Shaped Data

    Full text link
    We present a functional programming language for specifying constraints over tree-shaped data. The language allows for Haskell-like algebraic data types and pattern matching. Our constraint compiler CO4 translates these programs into satisfiability problems in propositional logic. We present an application from the area of automated analysis of (non-)termination of rewrite systems

    Insulin Glargine in the Intensive Care Unit: A Model-Based Clinical Trial Design

    Get PDF
    Online 4 Oct 2012Introduction: Current succesful AGC (Accurate Glycemic Control) protocols require extra clinical effort and are impractical in less acute wards where patients are still susceptible to stress-induced hyperglycemia. Long-acting insulin Glargine has the potential to be used in a low effort controller. However, potential variability in efficacy and length of action, prevent direct in-hospital use in an AGC framework for less acute wards. Method: Clinically validated virtual trials based on data from stable ICU patients from the SPRINT cohort who would be transferred to such an approach are used to develop a 24-hour AGC protocol robust to different Glargine potencies (1.0x, 1.5x and 2.0x regular insulin) and initial dose sizes (dose = total insulin over prior 12, 18 and 24 hours). Glycemic control in this period is provided only by varying nutritional inputs. Performance is assessed as %BG in the 4.0-8.0mmol/L band and safety by %BG<4.0mmol/L. Results: The final protocol consisted of Glargine bolus size equal to insulin over the previous 18 hours. Compared to SPRINT there was a 6.9% - 9.5% absolute decrease in mild hypoglycemia (%BG<4.0mmol/L) and up to a 6.2% increase in %BG between 4.0 and 8.0mmol/L. When the efficacy is known (1.5x assumed) there were reductions of: 27% BG measurements, 59% insulin boluses, 67% nutrition changes, and 6.3% absolute in mild hypoglycemia. Conclusion: A robust 24-48 clinical trial has been designed to safely investigate the efficacy and kinetics of Glargine as a first step towards developing a Glargine-based protocol for less acute wards. Ensuring robustness to variability in Glargine efficacy significantly affects the performance and safety that can be obtained

    Formal Reasoning about Efficient Data Structures: A Case Study in ACL2

    Get PDF
    We describe in this paper the formal verification, using the ACL2 system, of a syntactic unification algorithm where terms are represented as directed acyclic graphs (dags) and these graphs are stored in a single-threaded object (stobj). The use of stobjs allows destructive operations on data (thus improving the performance of the algorithm), while maintaining the applicative semantics of ACL2. We intend to show how ACL2 provides an environment where execution of algorithms with efficient data structures and formal reasoning about them can be carried out.Ministerio de Ciencia y Tecnología TIC2000-1368-C03-0
    corecore