Computer and information sciences topic list of research papers
-
The Semantics of Triveni: A process-Algebraic API for Threads + Events
Abstract This paper describes compositional semantics (operational, denotational and logical) for a process algebra enhanced with input/output actions and preemption combinators, in the presence of fairness. The context of this...
2005 / Christopher Colby, Lalita Jategaonkar, Radha Jagadeesan, Konstantin Läufer, Carlos Puchol -
Rule Induction with Grouping Target Concepts based on Rough Sets
Abstract One of the most important problems with rule induction methods is that they cannot extract rules, which plausibly represent experts’ decision processes. In this paper, the characteristics of experts’ rules are closely examined and a new...
2004 / Shusaku Tsumoto -
Simulations in Coalgebra
Abstract A new approach to simulations is proposed within the theory of coalgebras by taking a notion of order on a functor as primitive. Such an order forms a basic building block for a “lax relation lifting”, or “relator” as used by other authors. ...
2004 / Bart Jacobs, Jesse Hughes -
Unifying Petri Nets with Restricted Occurrence Rule Using Partial Algebra
Abstract The aim of this paper is to present a unifying concept for Petri nets with restricted occurrence rule, to obtain non-sequential semantics in a systematic way. It is shown that partial algebra is a suitable basis for process construction....
2004 / Jörg Desel, Gabriel Juhás, Robert Lorenz -
A Hybrid Algorithm for Compiling Equality Constraints and its Implementation
Abstract In this paper, we extend the language we proposed in [11] to make it possible to program arc-consistency algorithms. We also propose a hybrid algorithm that integrates the interval-consistency (IC) and arc-consistency (AC) algorithms. For a ...
2005 / Neng-Fa Zhou, Sosuke Kaneko -
A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting⋆ ⋆Research partially supported by the British EPSRC grant R29375 through the University of Edinburgh; by the ESPRIT BR Working Group APPLIGRAPH through the University of Paderborn; and by the Spanish DGES project PB96-0191-CO2 through the University of the Balearic Islands.
Abstract In this paper the concurrent semantics of double-pushout (DPO) graph rewriting, which is classically defined in terms of shift-equivalence classes of graph derivations, is axiomatised via the construction of a free monoidal bi-category. In...
2005 / Fabio Gadducci, Reiko Heckel, Mercé Llabrés -
Multimedia Streaming Using Cloud-Based P2P Systems
Abstract The past one and a half decades have seen great strides in the field of commercially available distributed computing implementations. The two most popular architectures in the modern world are Peer-to-Peer Systems and Cloud Systems....
2015 / Navin Thomas, Mathew Thomas, K. Chandrasekaran -
Describing Hierarchical Compositions of Java Beans with the Beanome Language
Abstract To better understand the conceptual issues concerning hierarchical composition, that is the possibility of an assembly of components to become itself a component, we are developing a simple component model that includes a language called...
2004 / Humberto Cervantes, Jean Marie Favre, Frédéric Duclos -
Formalizing and Executing Message Sequence Charts via Timed Rewriting
Abstract Message Sequence Charts (MSC) is a graphical trace language for describing and specifying the communication behaviour of distributed systems by means of message interchange. (Timed) Maude is a formal object-oriented specification language...
2004 / P. Kosiuczenko, M. Wirsing -
On the Structure of Counterexamples to Symmetric Orderings for BDD's
Abstract Binary Decision Diagrams (BDDs) are used to represent boolean functions in a variety of applications. The size of a reduced ordered BDD depends on the ordering of variables. Several researchers have suggested grouping symmetric variables as ...
2004 / Rakesh M. Verma, Sarah B. Hwang -
Logic programs as specifications in the inductive verification of logic programs
Abstract In this paper we define a new verification method based on an assertion language able to express properties defined by the user through a logic program. We first apply the verification framework defined in [3] to derive sufficient inductive ...
2004 / Marco Comini, Roberta Gori, Giorgio Levi -
An implementation model of the typed λ-calculus based on Linear Chemical Abstract Machine
Abstract Abramsky's Linear Chemical Abstract Machine is a term calculus which corresponds to Linear Logic, via the Curry-Howard isomorphism. We show that the typed λ-calculus is embedded into Linear Chemical Abstract Machine by Girard's embedding of ...
2004 / Shinya Sato, Toru Sugimoto, Shinichi Yamada -
Graph Relabelling Systems2004 / M. Bauderon, Y. Métivier, M. Mosbah, A. Sellami
-
Subtypes and bounded quantification from a fibred perspective
Abstract A general categorical description of subtyping σ < σ′ and of bounded quantification ∀α<: σ.τ and ∃α <: σ.τ is presented in terms of fibrations. In fact, we shall generalize these bounded quantifiers to “constrained quantifiers”...
2004 / B.P.F. Jacobs -
Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen.2004 / Nico Verlinden, Dirk Janssens
-
Composition of Distributed Software with Algon — Concepts and Possibilities
Abstract The perceived advantages of distributed systems, such as increased reliability and availability, are offset by the increased complexity of developing such applications. The developers of distributed applications have to both understand the...
2004 / Judith Bishop, Karen Renaud, Basil Worrall -
Relating Natural Deduction and Sequent Calculus for Intuitionistic Non-Commutative Linear Logic
Abstract We present a sequent calculus for intuitionistic non-commutative linear logic (INCLL), show that it satisfies cut elimination, and investigate its relationship to a natural deduction system for the logic. We show how normal natural...
2004 / Jeff Polakow, Frank Pfenning -
Comparing cospan-spans and tiles via a Hoare-style process calculus1 1Research partly supported by the Italian MIUR Project Teoria della Concorrenza, Linguaggi di Ordine Superiore e Strutture di Tipi (TOSCA).
Abstract The large diffusion of concurrent and distributed systems has spawned in recent years a variety of new formalisms, equipped with features for supporting an easy specification of such systems. The aim of our note is to compare two recent...
2004 / Fabio Gadducci, Piergiulio Katis, Ugo Montanari, Nicoletta Sabadini, Robert F.C. Walters -
Parallel Processing of Sensor Network Data Using Column-oriented Databases
Abstract Many wireless sensor network (WSN) applications require join of sensor data belonging to various sensor nodes. For join processing, it is important to minimize the communication cost since it is the main consumer of battery power. In this...
2013 / Kyung-Chang Kim, Choung-Seok Kim -
Retinal Image Recognition Using Tree Data Structure Search Method with Fractal Dimension Descriptors
Abstract Monitoring the evolution of retinal pathologies can be done by comparing images from the same patient captured at different times. Therefore when a new retinal image is recorded it is important to identify other images in the image database ...
2014 / Diana Craveiro Mourão, Carlos Manta Oliveira, Luís A. Da Silva Cruz