Dialogues in cardiovascular medicine : DCM最新文献

{"title":"Towards Formal Interaction-Based Models of Grid Computing Infrastructures","authors":"Carlos Alberto Ramírez Restrepo, Jorge A. Pérez, Jesús Aranda, J. F. Díaz","doi":"10.4204/EPTCS.144.5","DOIUrl":"https://doi.org/10.4204/EPTCS.144.5","url":null,"abstract":"Grid computing (GC) systems are large-scale virtual machines, built upon a massive pool of resources (processing time, storage, software) that often span multiple distributed domains. Concurrent users interact with the grid by adding new tasks; the grid is expected to assign resources to tasks in a fair, trustworthy way. These distinctive features of GC systems make their specification and verification a challenging issue. Although prior works have proposed formal approaches to the specification of GC systems, a precise account of the interaction model which underlies resource sharing has not been yet proposed. In this paper, we describe ongoing work aimed at filling in this gap. Our approach relies on (higher-order) process calculi: these core languages for concurrency offer a compositional framework in which GC systems can be precisely described and potentially reasoned about.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"29 1","pages":"57-72"},"PeriodicalIF":0.0,"publicationDate":"2014-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78490773","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Non-deterministic computation and the Jayne-Rogers Theorem","authors":"A. Pauly, Matthew de Brecht","doi":"10.4204/EPTCS.143.8","DOIUrl":"https://doi.org/10.4204/EPTCS.143.8","url":null,"abstract":"We provide a simple proof of a computable analogue to the Jayne Rogers Theorem from descriptive set theory. The difficulty of the proof is delegated to a simulation result pertaining to non-deterministic type-2 machines. Thus, we demonstrate that developments in computational models can have applications in fields thought to be far removed from it.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"42 1","pages":"87-96"},"PeriodicalIF":0.0,"publicationDate":"2014-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86250748","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Propositional Logics Complexity and the Sub-Formula Property","authors":"E. Haeusler","doi":"10.4204/EPTCS.179.1","DOIUrl":"https://doi.org/10.4204/EPTCS.179.1","url":null,"abstract":"In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete. He showed a polynomially bounded translation from full Intuitionistic Propositional Logic into its implicational fragment. By the PSPACE-completeness of S4, proved by Ladner, and the Goedel translation from S4 into Intuitionistic Logic, the PSPACE- completeness of M-imply is drawn. The sub-formula principle for a deductive system for a logic L states that whenever F1,...,Fk proves A, there is a proof in which each formula occurrence is either a sub-formula of A or of some of Fi. In this work we extend Statman result and show that any propositional (possibly modal) structural logic satisfying a particular formulation of the sub-formula principle is in PSPACE. If the logic includes the minimal purely implicational logic then it is PSPACE-complete. As a consequence, EXPTIME-complete propositional logics, such as PDL and the common-knowledge epistemic logic with at least 2 agents satisfy this particular sub-formula principle, if and only if, PSPACE=EXPTIME. We also show how our technique can be used to prove that any finitely many-valued logic has the set of its tautologies in PSPACE.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"35 1 1","pages":"1-16"},"PeriodicalIF":0.0,"publicationDate":"2014-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89126592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The probability of non-confluent systems","authors":"Alejandro Díaz-Caro, Gilles Dowek","doi":"10.4204/EPTCS.144.1","DOIUrl":"https://doi.org/10.4204/EPTCS.144.1","url":null,"abstract":"We show how to provide a structure of probability space to the set of execution traces on a non-confluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability space to transform a non-deterministic calculus into a probabilistic one. We use as example Lambda+, a recently introduced calculus defined through type isomorphisms.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"5 1","pages":"1-15"},"PeriodicalIF":0.0,"publicationDate":"2013-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80673422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Probabilistic Monads, Domains and Classical Information","authors":"M. Mislove","doi":"10.4204/EPTCS.88.8","DOIUrl":"https://doi.org/10.4204/EPTCS.88.8","url":null,"abstract":"Shannon’s classical information theory [18] uses probabil ity theory to analyze channels as mechanisms for information flow. In this paper, we generalize res ults from [14] for binary channels to show how some more modern tools — probabilistic monads and domain theory in particular — can be used to model classical channels. As initiated in [14], th e point of departure is to consider the family of channels with fixed inputs and outputs, rather than trying to analyze channels one at a time. The results show that domain theory has a role to play in the capacity of channels; in particular, the n× n-stochastic matrices, which are the classical channels hav ing the same sized input as output, admit a quotient compact ordered space which is a domain, and the capacity map factors through this quotient via a Scott-continuous map that measures the quotient domain. We also comment on how some of our results relate to recent discoveries about quantum channels and free affine monoids. Classical information theory has its foundations in the seminal work of Claude Shannon [18], who first conceived of analyzing the behavior of channels using entropy and deriving a formula for channel capacity based on mutual information (cf. [6] for a modern presentation of the basic results). Recent work of Martin, et al. [14] reveals that the theory of compact, affi ne monoids and domain theory can be used to analyze the family of binary channels. In this paper, our goal is to generalize the results in [14] to the case of n× n-channels — channels that have n input ports and n output ports. Our approach also uses the monadic properties of probability distributions to giv e an abstract presentation of how channels arise, and that clarifies the role of the doubly stochastic matrices , which are special channels. While our work focuses on the classical case, the situation around quantum information and quantum channels is also a concern, and we point out how our results relate to some recent work [7, 15] on quantum qubit channels and free affine monoids. While most of the ingredients we piec e together are not new, we believe the approach we present does represent a new way in which to understand families of channels and some of their important features. The rest of the paper is structured as follows. In the next sec tion, we describe three monads based on the probability measures over compact spaces, compact monoids and compact groups. Each of these is used to present some aspect of the classical channels. We then introduce topology, and show how the capacity of a channel can be viewed from a topological perspective. The main result here is that capacity is the maximum distance from the surface determined by the entropy function and the underlying polytope generated by the rows of a channel matrix, viewed as vectors in R n for appropriate n. This leads to a generalization of Jensen’s Lemma that charac terizes strictly concave functions. Domain theory is then introduced, as appli","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"56 1","pages":"87-100"},"PeriodicalIF":0.0,"publicationDate":"2012-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77877194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-","authors":"N. Dershowitz, Evgenia Falkovich","doi":"10.4204/EPTCS.88.6","DOIUrl":"https://doi.org/10.4204/EPTCS.88.6","url":null,"abstract":"We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine. This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract state machine by a random access machine, representing data as a minimal term graph.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"2010 1","pages":"72-78"},"PeriodicalIF":0.0,"publicationDate":"2012-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73422721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"On the Existence of Universal Finite or Pushdown Automata","authors":"M. Kudlek","doi":"10.4204/EPTCS.88.7","DOIUrl":"https://doi.org/10.4204/EPTCS.88.7","url":null,"abstract":"We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function. An alternative approach, using transition systems, is presented too.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"1 1","pages":"79-86"},"PeriodicalIF":0.0,"publicationDate":"2012-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83528703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Calculus of Looping Sequences with Local Rules","authors":"L. Bioglio, M. Dezani-Ciancaglini, P. Giannini, Angelo Troina","doi":"10.4204/EPTCS.88.4","DOIUrl":"https://doi.org/10.4204/EPTCS.88.4","url":null,"abstract":"In this paper we present a variant of the Calculus of Looping Sequences (CLS for short) with global and local rewrite rules. While global rules, as in CLS, are applied anywhere in a given term, local rules can only be applied in the compartment on which they are defined. Local rules are dynamic: they can be added, moved and erased. We enrich the new calculus with a parallel semantics where a reduction step is lead by any number of global and local rules that could be performed in parallel. A type system is developed to enforce the property that a compartment must contain only local rules with specific features. As a running example we model some int eractions happening in a cell starting from its nucleus and moving towards its mitochondria.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"16 1","pages":"43-58"},"PeriodicalIF":0.0,"publicationDate":"2012-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87246279","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"The Generic Model of Computation","authors":"N. Dershowitz","doi":"10.4204/EPTCS.88.5","DOIUrl":"https://doi.org/10.4204/EPTCS.88.5","url":null,"abstract":"Over the past two decades, Yuri Gurevich and his colleagues have formulated axiomatic foundations for the notion of algorithm, be it classical, interactive, or parallel, and formalized them in the new generic framework of abstract state machines. This approach has recently been extended to suggest a formalization of the notion of effective computation over arbitrary countable domains. The central notions are summarized herein.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"24 1","pages":"59-71"},"PeriodicalIF":0.0,"publicationDate":"2012-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84123577","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Pattern Graph Rewrite Systems","authors":"A. Kissinger, Alex Merry, Matvey Soloviev","doi":"10.4204/EPTCS.143.5","DOIUrl":"https://doi.org/10.4204/EPTCS.143.5","url":null,"abstract":"String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes (\"bang boxes\"), on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"78 1","pages":"54-66"},"PeriodicalIF":0.0,"publicationDate":"2012-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84050934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}