Computer and information sciences topic list of research papers
-
Bi-inductive Structural Semantics
Abstract We propose a simple order-theoretic generalization of set-theoretic inductive definitions. This generalization covers inductive, co-inductive and bi-inductive definitions and is preserved by abstraction. This allows the structural...
2007 / Patrick Cousot, Radhia Cousot -
Synchronization Algebras with Mobility for Graph Transformations
Abstract We propose a generalization of synchronization algebras that allows to deal with mobility and local resource handling. We show how it can be used to model communication primitives for distributed and mobile computations, such as the ones...
2005 / Ivan Lanese, Ugo Montanari -
Semantics of Visual Models in a Rule-based Setting
Abstract In this paper, some fundamental aspects of the semantics of rule-based systems are sketched and related to the semantics of visual models. A rule-based system comprises a set of rules and some control conditions including descriptions of...
2006 / Hans-Jörg Kreowski, Karsten Hölscher, Peter Knirsch -
Bridging the Web Accessibility Divide
Abstract The Web has become the primary medium for accessing information and for conducting many types of online transactions, including shopping, paying bills, making travel plans, etc. The primary mode of interaction over the Web is via graphical...
2009 / I.V. Ramakrishnan, Jalal Mahmud, Yevgen Borodin, Muhammad Asiful Islam, Faisal Ahmed -
Metareasoning about Security Protocols using Distributed Temporal Logic
Abstract We introduce a version of distributed temporal logic for rigorously formalizing and proving metalevel properties of different protocol models, and establishing relationships between models. The resulting logic is quite expressive and...
2005 / Carlos Caleiro, Luca Viganò, David Basin -
A Formalization of Credit and Responsibility Within the GNDC Schema
Abstract We formally define a notion of credit and responsibility within the Generalized Non Deducibility on Compositions framework. We investigate the validity of our definitions through some examples discussed in the literature. ...
2006 / Roberto Gorrieri, Fabio Martinelli, Marinella Petrocchi -
On the specification of software adaptation
Abstract The problem of adapting heterogeneous software components that present mismatching interaction behaviour is one of the crucial problems in Component-Based Software Engineering. The aim of this paper is to contribute to setting a theoretical ...
2004 / Antonio Brogi, Carlos Canal, Ernesto Pimentel -
A GPS-based Mobile Dynamic Service Locator System
Abstract The mobile network providers have provided the most widely used means of communication. In an attempt to expand on this frontier, we propose and develop a GPS-based Mobile Service Locator System to help individuals in different walks of...
2011 / Hassan I. Mathkour -
Models of e-learning adopted in the Middle East
Abstract Traditional academic institutions as well as newly established online or hybrid educational organizations in the Middle East (ME) are still in the early phases of trying to get students and their parents to accept and adapt to the concept...
2011 / Abdulrahman A. Mirza, Mohammed Al-Abdulkareem -
Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Abstract This paper focus on the problem of adaptive resource allocation for the electric environment pollution control through the web-based GIS. The paper provides a optimization problem for a general utility function such that it could be...
2012 / Ying Yang -
An Evolutive and Multilingual CIM Ontology Management System
Abstract CIM(Common Information Model) descrybed by IEC 61970/61968 standards is recognized as the Smart Grid ontology, while Chinese localized standards of the IEC 61970 series are published as DL/T 890 series and are widely applied to power...
2011 / Lan Wang, Akira Hosokawa, Hiroshi Murayama -
Massively parallel FPGA-based implementation of BLASTp with the two-hit method
Abstract Protein database search requests are generally being performed using the BLASTp algorithm, introduced by NCBI [1]. Since it is computationally intensive, it becomes more and more ine_ective with today's growth of sequence database sizes....
2011 / Lars Wienbrandt, Stefan Baumgart, Jost Bissel, Florian Schatz, Manfred Schimmler -
Design and implementation of a CUDA-compatible GPU-based core for gapped BLAST algorithm
Abstract This paper presents the first ever reported implementation of the Gapped Basic Local Alignment Search Tool (Gapped BLAST) for biological sequence alignment, with the Two-Hit method, on CUDA (compute unified device architecture)-compatible...
2010 / Cheng Ling, Khaled Benkrid -
Mathematical Model of Security Framework for Routing Layer Protocol in Wireless Sensor Networks
Abstract Most of the environmental and non-attended applications of Wireless Sensor Networks (WSN's) need mobile sensor nodes. However, mobility of sensor nodes increases security issues in WSNs and it's also vulnerable to various kinds of attacks....
2016 / Ganesh R. Pathak, Suhas H. Patil -
Low-Cost Microcontroller-based Hover Control Design of a Quadcopter
Abstract In this paper, a low-cost hover control mechanism is developed and implemented on low-cost microcontroller for a type of aircraft configuration known as the quadcopter. Flight control becomes simpler as the quadcopter hovers at a constant...
2012 / Bernard Tat Meng Leong, Sew Ming Low, Melanie Po-Leen Ooi -
Improving Fault-based Conformance Testing
Abstract Fault-based conformance testing is a conformance testing strategy that relies on specific fault models. Previously, this mutation testing technique has been applied to protocol specifications. Although a practical case study of web-server...
2008 / Bernhard K. Aichernig, Martin Weiglhofer, Franz Wotawa -
Data Analysis with Intersection Graphs
Abstract This paper presents a new framework for multivariate data analysis, based on graph theory, using intersection graphs [1]. We have named this approach DAIG – Data Analysis with Intersection Graphs. This new framework represents data vectors...
2013 / V.M. Vairinhos, V. Lobo, P. Galindo Villardón -
Memory Requirements of Java Bytecode Verification on Limited Devices
Abstract Bytecode verification forms the corner stone of the Java security model that ensures the integrity of the runtime environment even in the presence of untrusted code. Limited devices, like Java smart cards, lack the necessary amount of...
2005 / Karsten Klohs, Uwe Kastens -
SPPF-Style Parsing From Earley Recognisers
Abstract In its recogniser form, Earley's algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave an outline of a method for turning his recognisers into parsers,...
2008 / Elizabeth Scott -
Optimizing Code Generation from SSA Form: A Comparison Between Two Formal Correctness Proofs in Isabelle/HOL
Abstract Correctness of compilers is a vital precondition for the correctness of the software translated by them. In this paper, we present two approaches for the formalization of static single assignment (SSA) form together with two corresponding...
2005 / Jan Olaf Blech, Sabine Glesner, Johannes Leitner, Steffen Mülling