Computer and information sciences topic list of research papers
-
A Twitter-Based Weighted Reputation system
Abstract Trust between buyers and sellers plays an essential role in online shopping. Therefore, reputation systems are, typically, integrated with online shopping systems to form trust decisions between sellers and buyers. Online Social Networks...
2012 / Mohammad Jeragh, Eman AlQuraishi, Eman AlDwaisan -
Enhancing Conflict Resolution Mechanism for Automatic Model Composition2016 / Nisrine El Marzouki, Oksana Ņikiforova, Younes Lakhrissi, Mohammed El Mohajir
-
Design and Implementation of the System of Computer Skills Training and Testing
Abstract The application of computer skills is the fundamental ones that college students should possess. How to train and test these skills are the primary tasks to be addressed, how to solve it in computer tech teaching. This paper aims to explore ...
2012 / Li Yan, Jiang Feng -
Detection and Prevention of Wormhole Attack in Wireless Sensor Network using AOMDV Protocol
Abstract Unique characteristics like limited bandwidth, limited battery power and dynamic topology makes Wireless sensor network (WSN) vulnerable to many kinds of attacks. Therefore interest in research of security in WSN has been increasing since...
2016 / Parmar Amish, V.B. Vaghela -
(m,k)-firm pattern spinning to improve the GTS allocation of periodic messages in IEEE 802.15.4 networks2013 / Tiago Semprebom, Carlos Montez, Francisco Vasques
-
Geographic knowledge extraction and semantic similarity in OpenStreetMap2012 / Andrea Ballatore, Michela Bertolotto, David C. Wilson
-
Efficient QR-Based Multi-Mode Precoding for Limited Feedback Multi-User MIMO Systems2013 / Chien-Hung Pan, Ta-Sung Lee
-
Multi-Level Semantic Characterization and Refinement for Web Image Search
Abstract With the increasing number of Web images and social photograph sharing sites, effective search of real-world images becomes a formidable challenge and an important necessity. Different indexing and annotation algorithms are required for...
2012 / Yuanxi Li, C.H.C. Leung -
Counter-forensics of SIFT-based copy-move detection by means of keypoint classification2013 / Irene Amerini, Mauro Barni, Roberto Caldelli, Andrea Costanzo
-
Preface2008 / Catuscia Palamidessi, Frank D. Valencia
-
Where Do Bugs Come From?
Abstract The analysis of bug databases reveals that some software components are far more failure-prone than others. Yet it is hard to find properties that are universally shared by failure-prone components. We have mined the Eclipse bug and version ...
2007 / Andreas Zeller -
Parallel Assignments in Software Model Checking
Abstract In this paper we investigate how formal software verification systems can be improved by utilising parallel assignment in weakest precondition computations. We begin with an introduction to modern software verification...
2006 / Murray Stokely, Sagar Chaki, Joël Ouaknine -
Generic Trace Theory
Abstract Trace semantics has been defined for various non-deterministic systems with different input/output types, or with different types of “non-determinism” such as classical non-determinism (with a set of possible choices) vs. probabilistic...
2008 / Ichiro Hasuo, Bart Jacobs, Ana Sokolova -
Implementing a Domain-Specific Language Using Stratego/XT: An Experience Paper
Abstract We describe the experience of implementing a Domain-Specific Language using transformation to a General Purpose Language. The domain of application is image processing and low-level computer vision. The transformation is accomplished using...
2008 / Leonard G.C. Hamey, Shirley N. Goldrei -
Transaction Scripts: Making Implicit Scenarios Explicit
Abstract We describe a true-concurrent approach for managing dependencies between distributed and concurrent coordinator components of a long-running transaction. In previous work we have described how interactions specified in a scenario can be...
2010 / Sotiris Moschoyiannis, Amir Razavi, Paul Krause -
Semi-decidability of May, Must and Probabilistic Testing in a Higher-type Setting
Abstract We show that, in a fairly general setting including higher-types, may, must and probabilistic testing are semi-decidable. The case of must testing is perhaps surprising, as its mathematical definition involves universal quantification over...
2009 / Martín Escardó -
Correspondence Assertions for Process Synchronization in Concurrent Communications
Abstract High-level specification of patterns of communications such as protocols can be modeled elegantly by means of session types [Honda, K., V. Vasconcelos and M. Kubo, Language primitives and type discipline for structured communication-based...
2004 / Eduardo Bonelli, Adriana Compagnoni, Elsa Gunter -
A Family of Resource-Bound Real-Time Process Algebras
Abstract The Algebra of Communicating Shared Resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. It takes the view that the timing behavior of a real-time system depends not only on...
2006 / Insup Lee, Anna Philippou, Oleg Sokolsky -
Preface2006 / Anthony K. Seda, Ted Hurley, Michel Schellekens, Micheal Mac an Airchinnigh, Glenn Strong
-
Strong Joinability Analysis for Graph Transformation Systems in CHR
Abstract The notion of confluence is prevalent in graph transformation systems (GTS) as well as constraint handling rules (CHR). This work presents a generalized embedding of GTS in CHR that allows to consider strong derivations in confluence...
2009 / Frank Raiser, Thom Frühwirth