Computer and information sciences topic list of research papers
-
MVCC: An Architectural Pattern for Developing Context-aware Frameworks
Abstract Presenting a personalized service and information is a key aspect of pervasive computing, but development of such context-aware systems is quite complicated. Context-aware applications should be able to acquire raw data from sensors, make...
2014 / Hossein Shams, Kamran Zamanifar -
Comparison of Optimal Signal Plans by Synchro & TRANSYT-7F Using PARAMICS – A Case Study
Abstract TRANSYT-7F and Synchro are two of the most extensively used signal timing optimization softwares in Saudi Arabia. Each of them has its inbuilt objective function to optimize signal plan for intersections, which is different from each other. ...
2014 / Nedal T. Ratrout, Imran Reza -
Clustering Text Data Streams – A Tree based Approach with Ternary Function and Ternary Feature Vector
Abstract Data is the primary concern in data mining. Data Stream Mining is gaining a lot of practical significance with the huge online data generated from Sensors, Internet Relay Chats, Twitter, Facebook, Online Bank or ATM Transactions. The...
2014 / Phridviraj, Chintakindi Srinivas, C.V. GuruRao -
Integrated Control System Simulation for Supporting Changes of Routing Strategy in an Automated Material Flow System
Abstract Increased demand for customised products, sophisticated scheduling requirements caused by shorter product life cycle and hardly foreseeable disturbances have created a new challenge for the manufacturing industry. Planned production...
2013 / Azrul Azwan Abdul Rahman, Günther Seliger -
ML-Quadtree: The Design of an Efficient Access Method for Spatial Database Systems
Abstract The aim of this paper is to present a new indexing technique that provides an efficient support for retrieving and handling spatial data. Traditionally, the mapping between layers (in a thematic point of view) and index structures is one to ...
2013 / A. Touir -
Broadcast Calculus Interpreted in CCS upto Bisimulation
Abstract A function M is given that takes any process p in the calculus of broadcasting systems CBS and returns a CCS process M(p) with special actions {hear?, heard!, say?, said!} such that a broadcast of ω by p is matched by the sequence say? τ∗ ...
2004 / K.V.S. Prasad -
A Framework for Composing Real-Time Schedulers
Abstract In this paper, we present a framework for integrating real-time components in the same system, where each component has its own scheduling algorithm. There are two main reasons for this research: to allow maximum flexibility in the design...
2004 / Giuseppe Lipari, Enrico Bini, Gerhard Folher -
The Relevance of Semantic Subtyping
Abstract We compare Meyer and Routley's minimal relevant logic B + with the recent semantics-based approach to subtyping introduced by Frisch, Castagna and Benzaken in the definition of a type system with intersection and union. ...
2004 / Mariangiola Dezani-Ciancaglini, Alain Frisch, Elio Giovannetti, Yoko Motohama -
Aspects as Modular Language Extensions
Abstract Extensible programming languages and their compilers use highly modular specifications of languages and language extensions that allow a variety of different language feature sets to be easily imported into the programming environment by...
2005 / Eric Van Wyk -
Constructivist Approach in Virtual Universities
Abstract This paper proposed the application of the constructivist approach in virtual university where learners can learn based on their learning style, information and skills to succeed in life and also in their job. Constructivist learning and...
2012 / Abbas Abdoli Sejzi, Baharuddin bin Aris -
A Framework for Selecting Components Automatically
Abstract CBSE (Component Based Software Engineering) is devoted to develop software projects in such a way that the final applications can be created by using plug and play generic components. It requires to properly choose the needed components...
2004 / Ismael Rodríguez, Fernando Rubio -
Axiomatisation of an Interval Calculus for Theorem Proving
Abstract We provide an axiomatisation of the Timed Interval Calculus, a set-theoretic notation for expressing properties of time intervals. We implement the axiomatisation in the Ergo theorem prover in order to allow the machine-checked proof of...
2004 / Antonio Cerone -
Runtime Verification of Timed LTL using Disjunctive Normalized Equation Systems
Abstract In this paper we present a new framework for runtime verification of properties of real time systems such as financial systems or backend databases. Such a systems has a semantics which resemples that of timed traces, namely a sequence of...
2004 / Kåre Jelling Kristoffersen, Christian Pedersen, Henrik Reif Andersen -
Maude versus Haskell: an Experimental Comparison in Security Protocol Analysis
Abstract We compare two executable languages: the rewriting logic based specification language Maude and the higher-order, lazy, functional programming language Haskell. We compare these languages experimentally on a problem in modeling and...
2005 / David Basin, Grit Denker -
Preface
Abstract This volume contains the Proceedings of the First Irish Conference on the Mathematical Foundations of Computer Science and Information Technology (MFCSIT2000). The conference was a two-day event and took place in the National University of...
2005 / Anthony Seda -
Clean: a Programming Environment Based on Term Graph Rewriting
Abstract The main features of the lazy functional language Concurrent Clean and of its semantics based on Term Graph Rewriting are presented.
2005 / M.J. Plasmeijer -
Encryption as an abstract data-type
Abstract At the Dolev-Yao level of abstraction, security protocols can be specified using multisets rewriting. Such rewriting can be modeled naturally using proof search in linear logic. The linear logic setting also provides a simple mechanism for...
2004 / Dale Miller -
Generalized standardization lemma for the additives
Abstract This is a preliminary report, in which we prove the so-called standardization lemma for the additives, in presence of a generalization (the natural one) of the commutative elementary reduction step. The technical tools developped to achieve ...
2005 / Lorenzo Tortora de Falco -
On Generative Parallel Composition1 1Supported by the NWO/SION project 612-33-006 and the System Validation Centre/CTIT.
Abstract A major reason for studying probabilistic processes is to establish a link between a formal model for describing functional system behaviour and a stochastic process. Compositionality is an essential ingredient for specifying systems....
2005 / Pedro R. D'Argenio, Holger Hermanns, Joost-Pieter Katoen -
Modeling Agent Systems with Distributed Transformation Units
Abstract Agent systems have become more and more important in computer science. They allow to implement complex distributed systems composed of communicating autonomous entities. Transformation units constitute a structuring principle for graph...
2004 / Sabine Kuske, Peter Knirsch