Computer and information sciences topic list of research papers
-
Bimodal Based Environmental Awareness System for Visually Impaired People
Abstract The paper describes the Object detection and recognition along with interpretation is considered as minimum survival requirements to all the creatures in the world. Especially, the human beings rule the world because of their known...
2012 / L. Muthulakshmi, A. Balaji Ganesh -
Secured OHWDM Using Fractals
Abstract We propose an effective method for a secured Orthogonal Wavelet Division Multiplexing (OWDM) communication facilitated using various randomly generated sequences like Gold codes, Kasami sequences undergoing Haar wavelet transform. A random...
2012 / N.R. Raajan, B. Monisha, Niranjana Rangarajan, R. Vishnupriya -
Quality-aware analysis in product line engineering with the orthogonal variability model2011 / Fabricia Roos-Frantz, David Benavides, Antonio Ruiz-Cortés, André Heuer, Kim Lauenroth
-
A joint design of security and quality-of-service (QoS) provisioning in vehicular ad hoc networks with cooperative communications2013 / Li Zhu, F Richard Yu, Bin Ning, Tao Tang
-
Personalizing Mobile Travel Information Services
Abstract Research on Advanced Traveller Information Systems (ATIS) shows that travellers make better travel decisions when they are well informed. In the dynamic setting of urban public transport systems, however, the ability to be informed is not...
2012 / Neal Lathia, Licia Capra, Daniele Magliocchetti, Federico De Vigili, Giuseppe Conti, et al. -
Toward the parallelization of GSL2008 / Jose Ignacio Aliaga, Francisco Almeida, Jose Manuel Badía, Sergio Barrachina, Vicente Blanco, et al.
-
Multi-directional local search
Abstract This paper introduces multi-directional local search, a metaheuristic for multi-objective optimization. We first motivate the method and present an algorithmic framework for it. We then apply it to several known multi-objective problems...
2012 / Fabien Tricoire -
On Term-Graph Rewrite Strategies
Abstract We tackle the problem of cyclic term-graph rewriting. We first revisit the classical algorithmic approach to term-graph rewriting by providing a definition of rewrite rules of the form l h ...
2008 / Rachid Echahed -
Test Case Generation for Mutation-based Testing of Timeliness
Abstract Temporal correctness is crucial for real-time systems. Few methods exist to test temporal correctness and most methods used in practice are ad-hoc. A problem with testing real-time applications is the response-time dependency on the...
2006 / Robert Nilsson, Jeff Offutt, Jonas Mellin -
Action Control by Term Rewriting
Abstract We address the problem of defining access control policies that may be used in the evaluation of requests made by client actors, in the course of e-trading, to perform actions on the resources maintained by an e-collective. An e-collective...
2009 / Steve Barker, Clara Bertolissi, Maribel Fernández -
Quantitative Analysis With the Probabilistic Model Checker PRISM
Abstract Probabilistic model checking is a formal verification technique for establishing the correctness, performance and reliability of systems which exhibit stochastic behaviour. As in conventional verification, a precise mathematical model of a...
2006 / Marta Kwiatkowska, Gethin Norman, David Parker -
On the Refinement of Atomic Actions
Abstract Inspired by the properties of the refinement development of the Mondex Electronic Purse, we view an atomic action as a family of transitions with a common before-state, and different after-states corresponding to different possible outcomes ...
2008 / Richard Banach, Gerhard Schellhorn -
A Calculus for Interaction Nets Based on the Linear Chemical Abstract Machine
Abstract Interaction nets are graph rewriting systems which are a generalisation of proof nets for classical linear logic. The linear chemical abstract machine (CHAM) is a term rewriting system which corresponds to classical linear logic, via the...
2008 / Ian Mackie, Shinya Sato -
Analyzing LTL Model Checking Techniques for Plan Synthesis and Controller Synthesis (Work in Progress)
Abstract In this paper, we present alternative means of handling invariances in reachability testing, either by formula progression or compilation into Büchi automata. These alternatives are presented in connection with three different applications...
2006 / Sylvain Kerjean, Froduald Kabanza, Richard St-Denis, Sylvie Thiébaux -
An Interactive Derivation Viewer
Abstract This work describes the Interactive Derivation Viewer (IDV) tool for graphical rendering of derivations that are written in the TPTP language. IDV provides an interactive interface that allows the user to quickly view various features of...
2007 / Steven Trac, Yury Puzis, Geoff Sutcliffe -
Process Calculi and Peer-to-peer Web Data Integration
Abstract Peer-to-peer systems exchanging dynamic documents through web services are a simple and effective platform for data integration on the Web. Dynamic documents can contain both data and declarative references to external sources, in the form...
2006 / Sergio Maffeis -
Adding Branching to the Strand Space Model
Abstract The strand space model is one of the most successful and widely used formalisms for analysing security protocols. This might seem surprising given that the model is not able to reflect choice points in a protocol execution: the key concept...
2009 / Sibylle Fröschle -
The effect of supply chain integration on information sharing:Enhancing the supply chain performance
Abstract Prior research on supply chain management (SCM) suggests that information sharing has become a major driver of competitive advantage. In the context of increasingly globalized and competitive economy where organizations are part of an...
2011 / İpek Koçoğlu, Salih Zeki İmamoğlu, Hüseyin İnce, Halit Keskin -
Mobile learning through microblogging
Abstract In the context in which the new frontier of Web 2.0 is marked out by the use of mobile devices anywhere, anytime, by anyone and anything, our paper aims at valorizing the mobility parameters of the cirip.eu platform in order to integrate...
2011 / Carmen Holotescu, Gabriela Grosseck -
The Clustering Algorithm of Query Result based on Maximal Frequent
Abstract Most of existing web page clustering algorithms is based on short and uneven snippets of web page, which often cause bad clustering performance. On the other hand, the classical clustering algorithm for full text web pages is too complex to ...
2011 / WEI Yu-wei