Computer and information sciences topic list of research papers
-
Stereoscopy based 3D face recognition system
Abstract This paper presents an innovative facial recognition algorithm: a stereoscopic calibrated system acquires two images of a subject that are then separately analyzed by an active appearance model code which extracts from each of them 58...
2010 / Emanuele Zappa, Paolo Mazzoleni, Yumei Hai -
Graph grammar-based multi-thread multi-frontal parallel solver with trace theory-based scheduler
Abstract The paper presents the graph grammar based multi-thread multi-frontal parallel direct solver for one and two dimensional Finite Difference Method (FDM). The multi-frontal solver algorithm has been expressed by graph grammar productions....
2010 / Paweł Obrok, Paweł Pierzchała, Arkadiusz Szymczak, Maciej Paszyński -
3D Off-Line Path Planning For Aerial Vehicle Using Distance Transform Technique
Abstract Optimal Path Planning is a well-known problem and there are many approaches and techniques for solving this task, which are mostly based on graph or grid representation of the environment. Such a representation can be very difficult to...
2011 / S. Jaishankar, R.N. Pralhad -
Experiences on implementing a QoS-aware architecture on a DHT based broker overlay
Abstract The new scale of the distributed systems due to the evolution of the Internet and new emergent technologies has given rise to applications based on the dissemination of high volumes of information. Future software systems must be responsive ...
2011 / Cosmina Ivan -
Modeling recommendations for the educational domain
Abstract Recommendations for technology enhanced learning scenarios have differences from those in other domains as recommendations in e-learning should be guided by educational objectives, and not only by the users’ preferences. Most efforts so far ...
2010 / Olga C. Santos, Jesus G. Boticario -
Misbehavior nodes detection and isolation for MANETs OLSR protocol
Abstract Intrusion Detection Systems (IDS) in Mobile Ad hoc Networks (MANETs) are required to develop a strong security scheme it is therefore necessary to understand how malicious nodes can attack the MANETs. Focusing on the Optimized Link State...
2011 / Ahmed M. Abdalla, Imane A. Saroit, Amira Kotb, Ali H Afsari -
Discriminating between gamma and lognormal distributions with applications
Abstract In this paper, we discuss the use of the coefficient of skewness as a goodness-of-fit test to distinguish between the gamma and lognormal distributions. We also show the limitations of this idea. Next, we use the moments of order statistics ...
2009 / A. Alzaid, K.S. Sultan -
Special issue on Advances in Transportation Science2011 / S.S. Ganji
-
BDD-versus SAT-based bounded model checking for the existential fragment of linear temporal logic with knowledge: algorithms and their performance2013 / Artur Mȩski, Wojciech Penczek, Maciej Szreter, Bożena Woźna-Szcześniak, Andrzej Zbrzezny
-
Seamless Integration of RESTful Services into the Web of Data2012 / Markus Lanthaler, Christian Gütl
-
Graph Rewriting for Agent Oriented Visual Modeling
Abstract In this paper we will describe our approach, based on Graph Rewriting (GR), to support the visual modeling process in Tropos, an Agent Oriented software engineering methodology. We will give examples of the rewriting rules which specify the ...
2004 / Aliaksei Novikau, Anna Perini, Marco Pistore -
Quantified Interference for a While Language
Abstract We show how information theory can be used to give a quantitative definition of interference between variables in imperative programming languages. In this paper we focus on a particular case of this definition of interference: leakage of...
2005 / David Clark, Sebastian Hunt, Pasquale Malacaria -
Believing the Integrity of a System
Abstract An integrity policy defines the situations when modification of information is authorised and is enforced by the protection mechanisms of a system. Traditional models of protection tend to define integrity in terms of ad-hoc authorisation...
2005 / Simon N. Foley -
Concurrent Logic and Automata Combined: A Semantics for Components
Abstract In this paper, we describe a true-concurrent hierarchical logic interpreted over concurrent automata. Concurrent automata constitute a special kind of asynchronous transition system (ATS) used for modelling the behaviour of components as...
2007 / J.K.F. Bowles, S. Moschoyiannis -
A Compiler for Mapping a Rule-Based Event-Triggered Program to a Hardware Engine
Abstract In this paper we describe the RERAL compiler. RERAL is a Rule-based Event-driven Routing Algorithm Language. It is intended for the configuration of a router for regular networks, as found in parallel computers or computer clusters. The...
2005 / Carsten Albrecht, Andreas C. Döring -
Proving VLRL Action Properties with the Maude Model Checker
Abstract The Verification Logic for Rewriting Logic (VLRL) is a modal action logic in which rewrite rules are captured as actions. This paper studies a possible representation of the VLRL action formulae using the Next and the Until operators of...
2005 / Miguel Palomino, Isabel Pita -
Recursive Coalgebras from Comonads
Abstract We discuss Osius's [G. Osius, Categorical set theory: A characterisation of the category of sets, J. of Pure and Appl. Algebra 4 (1974) 79–119] concept of a recursive coalgebra of a functor from the perspective of programming semantics and...
2004 / Venanzio Capretta, Tarmo Uustalu, Varmo Vene -
Through Personalized Web Service Composition Specification: From BPEL to C-BPEL
Abstract Over the last few years, Web services technologies offered a new and successful way for interoperability among web applications. A Web service is a software system designed in a way that other software components and humans can discover and ...
2006 / C. Ghedira, H. Mezni -
Refactoring Real-time Specifications
Abstract This paper presents an approach to refactoring real-time specifications written using Real-Time Object-Z. This allows implementation components such as clocks and sensors, not necessarily present in an initial abstract specification, to be...
2008 / Graeme Smith, Tim McComb -
On Extensions of Process Rewrite Systems: Rewrite Systems with Weak Finite-State Unit
Abstract Various classes of infinite-state processes are often specified by rewrite systems. We extend Mayr's Process Rewrite Systems (PRS) [Information and Computation 156 (2000) 264–286] by finite-state unit whose transition function satisfies...
2004 / Mojmı́r Křetı́nský, Vojtěch Rehák, Jan Strejček