Computer and information sciences topic list of research papers
-
Do insulin cartridges really provide a lower risk of potential diabetes complications than traditional vials?
Abstract Scope Recently, many publicly funded healthcare organizations suffered from an economical crisis. This forced some organizations to utilize less costly alternatives where possible. Insulin cartridges and vials are...
2013 / Mohammad G. Al-Sharayri, Tariq M. Aljbori, Qusai M. Migdadi, Marwa B. Al-Omoush, Ayman R. Jaarah -
A Free Online Parallel Corpus Construction Tool for Language Teachers and Learners
Abstract In this article we present a free online parallel corpus construction tool, the PENCIL tool (Pedagogy Enhancement through Corpora in Language learning), part of the SOURCe Project, a French-Greek parallel corpora collection developed for...
2013 / Fryni Kakoyianni-Doa, Stefanos Antaris, Eleni Tziafa -
Compositional Asymmetric Cooperations for Process Algebras with Probabilities, Priorities, and Time
Abstract The modeling and analysis experience with process algebras has shown the necessity of extending them with priority, probabilistic internal/external choice, and time in order to be able to faithfully model the behavior of real systems and...
2005 / Mario Bravetti, Marco Bernardo -
Towards the applicability of biometric wood log traceability using digital log end images
Abstract Log traceability in the timber based industries is a basic requirement to fulfil economical, social and legal requirements. This work introduces biometric log recognition using digital log end images and explores the robustness to a set of...
2015 / R. Schraml, J. Charwat-Pessler, A. Petutschnigg, A. Uhl -
Demandness in Rewriting and Narrowing
Abstract The traditional investigation of rewriting and narrowing strategies aims at establishing fundamental properties, such as soundness, completeness and/or optimality, of a strategy. In this work, we analyze and compare rewriting and narrowing...
2004 / Sergio Antoy, Salvador Lucas -
A Model of Finite Automata on Timed ω-Trees
Abstract In the last decade Alur and Dill introduced a model of automata on timed ω-sequences which extends the traditional models of finite automata. In this paper we present a theory of timed ω-trees which extends both the theory of timed...
2004 / Salvatore La Torre, Margherita Napoli -
Digital Projections in Prime and Composite Arrays
Abstract The Discrete Radon Transform (DRT) provides a 1:1 mapping between any discrete array, for example a 3D micro-crystal or a 2D digital photograph, and its digital projections. The DRT is both conceptually simple and computationally efficient, ...
2004 / Imants Svalbe -
Using the Topological Characterization of Synchronous Models1 1This work is partially supported by the National Competence Center in Research on Mobile Information and Communication Systems (NCCR-MICS), a center supported by the Swiss National Science Foundation (under grant number 5005-67322).
Abstract This paper contributes to the characterization of synchronous models of distributed computing using topological techniques. We consider a generic synchronous model with send-omission failures and use a topological structure corresponding to ...
2004 / Giovanni Adagio -
A Genetic-Fuzzy Based Mathematical Model to Evaluate The Distance Education Students’ Academic Performance
Abstract In distance education systems, it is very important to predict academic performance for both instructors and students during the course of the semester. If an instructor can properly assess and predict student performance early at the...
2012 / Osman Yıldız, Abdullah Bal, Sevinç GŸlseçen, Fulya Damla Kentli -
Developing High-Performance Server Applications in Haskell, Case Study: A Haskell Web Server
Abstract Server applications, and in particular network-based server applications, place a unique combination of demands on a programming language: lightweight concurrency and high I/O throughput are both important. This paper...
2005 / Simon Marlow -
Contracts, Games and Refinement
Abstract We consider the notion of a contract that governs the behavior of a collection of agents. In particular, we study the question of whether a group among these agents can achieve a given goal by following the contract. We show that this can...
2005 / R.J.R. Back, J. von Wright -
A Fault Taxonomy for Component-Based Software
Abstract Component technology is increasingly used to develop modular, configurable, and reusable systems. The problem of design and implement component-based systems is addressed by many models, methodologies, tools, and frameworks. On the...
2004 / Leonardo Mariani -
On Modifying High Level Replacement Systems1 1Partially supported by the European Community under TMR GETGRATS and Esprit WG APPLIGRAPH
Abstract High Level Replacement Systems generalize the concept of graph transformation systems from graphs to other types of structures. Transformation rules to replace a structure with another structure in the same category are defined using...
2004 / Francesco Parisi-Presicce -
Dynamic Deterministic Pattern-Matching
Abstract Efficient term matching techniques are pre-requisite for practical term rewriting systems, compilers and interpreters. In previous work, we proposed a new technique to construct deterministic and optimal pattern-matching automata [8–11]. As ...
2005 / Nadia Nedjah, Luiza de Macedo Mourelle -
ProveEasy: Helping people learn to do proofs
Abstract This paper describes an experimental system called ProveEasy for helping people learn to write Natural Deduction proofs in a goal directed style. The proof is an editable text, produced by typing or by pointing and clicking. The intended...
2005 / Rod Burstall -
Safe Execution of Unreliable Software
Abstract We introduce a method, Lightweight Privilege Separation, enabling safe execution of unreliable software. Our method introduces no new software vulnerabilities and is fairly easy to implement. Furthermore, we show by experiments that the...
2004 / Per Mellstrand, Rune Gustavsson -
Modal Rules are Co-Implications
Abstract In [13], it was shown that modal logic for coalgebras dualises—concerning definability—equational logic for algebras. This paper establishes that, similarly, modal rules dualise implications: It is shown that a class of coalgebras is...
2004 / Alexander Kurz -
Preface
Abstract This volume contains the Proceedings of the Fifth Workshop on Coalgebraic Methods in Computer Science (CMCS'2002). The Workshop was held in Grenoble, France on April 6--7 2002, as satellite event to ETAPS'2002. Over the...
2005 / Lawrence S. Moss -
Dynamic Event Generation for Runtime Checking using the JDI1 1This work was partially funded by the German Research Council (DFG) under grant OL 98/3-1.
Abstract Approaches to runtime checking have to track the execution of a software system and therefore have to deal with generating and processing execution events. Often these techniques are applied at the code level – either by inserting new...
2004 / Mark Brörkens, Michael Möller -
The Mechanisation of Barendregt-Style Equational Proofs (the Residual Perspective)
Abstract We show how to mechanise equational proofs about higher-order languages by using the primitive proof principles of first-order abstract syntax over one-sorted variable names. We illustrate the method here by proving (in Isabelle/HOL) a...
2004 / René Vestergaard, James Brotherston