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.

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

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

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

Stream Productivity by Outermost Termination

Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. A core property is productivity: unfolding the equations produces the intended stream in the limit. In this paper we show that productivity is equivalent to termination with respect to the balanced outermost strategy of a TRS obtained by adding an additional rule. For specifications not involving branching symbols balancedness is obtained for free, by which tools for proving outermost termination can be used to prove productivity fully automatically

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

Concept logics

Concept languages (as used in BACK, KL-ONE, KRYPTON, LOOM) are employed as knowledge representation formalisms in Artificial Intelligence. Their main purpose is to represent the generic concepts and the taxonomical hierarchies of the domain to be modeled. This paper addresses the combination of the fast taxonomical reasoning algorithms (e.g. subsumption, the classifier etc.) that come with these languages and reasoning in first order predicate logic. The interface between these two different modes of reasoning is accomplished by a new rule of inference, called constrained resolution. Correctness, completeness as well as the decidability of the constraints (in a restricted constraint language) are shown

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

Algorithm for Adapting Cases Represented in a Tractable Description Logic

Case-based reasoning (CBR) based on description logics (DLs) has gained a lot of attention lately. Adaptation is a basic task in the CBR inference that can be modeled as the knowledge base revision problem and solved in propositional logic. However, in DLs, it is still a challenge problem since existing revision operators only work well for strictly restricted DLs of the \emph{DL-Lite} family, and it is difficult to design a revision algorithm which is syntax-independent and fine-grained. In this paper, we present a new method for adaptation based on the DL $\mathcal{EL_{\bot}}$. Following the idea of adaptation as revision, we firstly extend the logical basis for describing cases from propositional logic to the DL $\mathcal{EL_{\bot}}$, and present a formalism for adaptation based on $\mathcal{EL_{\bot}}$. Then we present an adaptation algorithm for this formalism and demonstrate that our algorithm is syntax-independent and fine-grained. Our work provides a logical basis for adaptation in CBR systems where cases and domain knowledge are described by the tractable DL $\mathcal{EL_{\bot}}$.Comment: 21 pages. ICCBR 201

On the emergent Semantic Web and overlooked issues

The emergent Semantic Web, despite being in its infancy, has already received a lotof attention from academia and industry. This resulted in an abundance of prototype systems and discussion most of which are centred around the underlying infrastructure. However, when we critically review the work done to date we realise that there is little discussion with respect to the vision of the Semantic Web. In particular, there is an observed dearth of discussion on how to deliver knowledge sharing in an environment such as the Semantic Web in effective and efficient manners. There are a lot of overlooked issues, associated with agents and trust to hidden assumptions made with respect to knowledge representation and robust reasoning in a distributed environment. These issues could potentially hinder further development if not considered at the early stages of designing Semantic Web systems. In this perspectives paper, we aim to help engineers and practitioners of the Semantic Web by raising awareness of these issues