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

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.

Propositional Encoding of Constraints over Tree-Shaped Data

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

Towards Correctness of Program Transformations Through Unification and Critical Pair Computation

Correctness of program transformations in extended lambda calculi with a contextual semantics is usually based on reasoning about the operational semantics which is a rewrite semantics. A successful approach to proving correctness is the combination of a context lemma with the computation of overlaps between program transformations and the reduction rules, and then of so-called complete sets of diagrams. The method is similar to the computation of critical pairs for the completion of term rewriting systems. We explore cases where the computation of these overlaps can be done in a first order way by variants of critical pair computation that use unification algorithms. As a case study we apply the method to a lambda calculus with recursive let-expressions and describe an effective unification algorithm to determine all overlaps of a set of transformations with all reduction rules. The unification algorithm employs many-sorted terms, the equational theory of left-commutativity modelling multi-sets, context variables of different kinds and a mechanism for compactly representing binding chains in recursive let-expressions.Comment: In Proceedings UNIF 2010, arXiv:1012.455

Computing FO-Rewritings in EL in Practice: from Atomic to Conjunctive Queries

A prominent approach to implementing ontology-mediated queries (OMQs) is to rewrite into a first-order query, which is then executed using a conventional SQL database system. We consider the case where the ontology is formulated in the description logic EL and the actual query is a conjunctive query and show that rewritings of such OMQs can be efficiently computed in practice, in a sound and complete way. Our approach combines a reduction with a decomposed backwards chaining algorithm for OMQs that are based on the simpler atomic queries, also illuminating the relationship between first-order rewritings of OMQs based on conjunctive and on atomic queries. Experiments with real-world ontologies show promising results

Effect of the Output of the System in Signal Detection

We analyze the consequences that the choice of the output of the system has in the efficiency of signal detection. It is shown that the signal and the signal-to-noise ratio (SNR), used to characterize the phenomenon of stochastic resonance, strongly depend on the form of the output. In particular, the SNR may be enhanced for an adequate output.Comment: 4 pages, RevTex, 6 PostScript figure

Guided Unfoldings for Finding Loops in Standard Term Rewriting

In this paper, we reconsider the unfolding-based technique that we have introduced previously for detecting loops in standard term rewriting. We improve it by guiding the unfolding process, using distinguished positions in the rewrite rules. This results in a depth-first computation of the unfoldings, whereas the original technique was breadth-first. We have implemented this new approach in our tool NTI and compared it to the previous one on a bunch of rewrite systems. The results we get are promising (better times, more successful proofs).Comment: Pre-proceedings paper presented at the 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018), Frankfurt am Main, Germany, 4-6 September 2018 (arXiv:1808.03326

Surface properties changing of biodegradable polymers by the radio frequency magnetron sputtering modification

this paper. On the one hand, dening a semantics for the combined system may depend on methods and results from formal logic and universal algebra. On the other hand, an ecient combination of the actual constraint solvers often requires the possibility of communication and cooperation between the solvers

On Fibring Semantics for BDI Logics

This study examines BDI logics in the context of Gabbay's fibring semantics. We show that dovetailing (a special form of fibring) can be adopted as a semantic methodology to combine BDI logics. We develop a set of interaction axioms that can capture static as well as dynamic aspects of the mental states in BDI systems, using Catach's incestual schema G^[a, b, c, d]. Further we exemplify the constraints required on fibring function to capture the semantics of interactions among modalities. The advantages of having a fibred approach is discussed in the final section

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

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

Microsatellite genotyping clarified conspicuous accumulation of Candida parapsilosis at a cardiothoracic surgery intensive care unit.

Contains fulltext : 124291.pdf (publisher's version ) (Open Access)Candida parapsilosis has become a significant cause of invasive fungal infections in seriously ill patients. Nosocomial outbreaks through direct and indirect contact have been described. The aim of this study was the molecular characterization of what appeared to be an ongoing C. parapsilosis outbreak at the cardiothoracic intensive care unit of the University Hospital of Vienna between January 2007 and December 2008. Using two different molecular typing methods-automated repetitive sequence-based PCR (DiversiLab; bioMerieux) and microsatellite genotyping-we investigated the genetic relationship of 99 C. parapsilosis isolates. Eighty-three isolates originated from the cardiothoracic intensive care unit, while 16 isolates were random control isolates from other intensive care units and a different Austrian hospital. The 99 C. parapsilosis isolates analyzed by repetitive-element PCR all showed identical genotypes, suggesting an ongoing outbreak. In contrast, microsatellite genotyping showed a total of 56 different genotypes. Two major genotypes were observed in 10 and 15 isolates, respectively, whereas another 13 genotypes were observed in 2 to 4 isolates each. Forty-one genotypes were observed only once. Closely related genotypes that differed in only a single microsatellite marker were grouped into clonal complexes. When it comes to C. parapsilosis, microsatellite genotyping is a more discriminative method than repetitive-element PCR genotyping to investigate outbreaks.1 november 201