Computer and information sciences topic list of research papers
-
Pervasive Integrity Checking With Coupled Objects
Abstract Integrity checking is important in many activities, such as logistics, telecommunications or even usual tasks such as checking for someone missing in a group. While the computing and telecommunications worlds commonly use digital integrity...
2011 / Paul Couderc, Michel Banâtre, Fabien Allard -
Directed Hidden-Code Extractor for Environment-Sensitive Malwares
Abstract Malware writers often use packing technique to hide malicious payload. A number of dynamic unpacking tools are.designed in order to identify and extract the hidden code in the packed malware. However, such unpacking methods.are all based on ...
2012 / Chunfu Jia, Zhi Wang, Kai Lu, Xinhai Liu, Xin Liu -
Conversational Collaborative Recommendation – An Experimental Analysis2005 / Rachael Rafter, Barry Smyth
-
Scannerless Boolean Parsing
Abstract Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing programming languages at the character level, disambiguation...
2006 / Adam Megacz -
Abstract Interpretation of Dynamics of Biological Regulatory Networks
Abstract Analysing dynamics of large biological regulatory networks (BRNs) calls for innovative methods to cope with the state space explosion. Static analysis and abstract interpretation techniques seem promising approaches. In this paper, we...
2011 / Loïc Paulevé, Morgan Magnin, Olivier Roux -
A Rewriting Calculus for Multigraphs with Ports
Abstract In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of these structures is expressed with multigraph rewrite rules and ...
2008 / Oana Andrei, Hélène Kirchner -
Generating Multi-Threaded code from Polychronous Specifications
Abstract SIGNAL, Lustre, Esterel, and a few other synchronous programming language compilers accomplish automated sequential code generation from synchronous specifications. In generating sequential code, the concurrency expressed in the synchronous ...
2009 / Bijoy A. Jose, Hiren D. Patel, Sandeep K. Shukla, Jean-Pierre Talpin -
Algorithmic Design Using Object-Z for Twig XML Queries Evaluation
Abstract Web technologies based on XML, e.g. Semantic Web and Web Services, facilitate Web automation and universally accessible content. One of the key factors for the success of XML-based technologies is of finding an efficient query evaluation...
2006 / Yang Liu, Jun Sun -
Towards an Efficient Path-Oriented Tool for Bounded Reachability Analysis of Linear Hybrid Systems using Linear Programming
Abstract The existing techniques for reachability analysis of linear hybrid automata do not scale well to problem sizes of practical interest. Instead of developing a tool to perform reachability check on all the paths of a linear hybrid automaton,...
2007 / Xuandong Li, Sumit Jha Aanand, Lei Bu -
Actors and Logical Analysis of Interactive Systems
Abstract Formalization in a logical theory can contribute to the foundational understanding of interactive systems in two ways. One is to provide language and principles for specification of and reasoning about such systems. The other is to better...
2005 / Ian A. Mason, Carolyn L. Talcott -
Selective Memoization with Box Types
Abstract Memoization is a useful technique to eliminate computational redundancy. A memo function remembers all the arguments to which it has been applied, together with their corresponding results, by storing them in a table. This table is...
2009 / Favio Ezequiel Miranda-Perea, Lourdes Del Carmen González-Huesca -
Test Case Generation for Adequacy of Floating-point to Fixed-point Conversion
Abstract Porting an application written for personal computer to embedded devices requires conversion of floating-point numbers and operations into fixed-point ones. Testing the conversion hence requires the latter be as close as possible to the...
2010 / Tuan-Hung Pham, Anh-Hoang Truong, Wei-Ngan Chin, Takenobu Aoshima -
Discounting in Time
Abstract This paper deals with the issue of discounting in weighted timed transition systems. Discounting provides a way to model optimal-cost problems for infinite runs and has applications in optimal scheduling and other areas. ...
2009 / Uli Fahrenberg, Kim G. Larsen -
Preface2005 / Jens Knoop, George C. Necula, Wolf Zimmermann
-
Satisfiability of Dolev-Yao Constraints
Abstract The secrecy problem, under certain hypothesis, is equivalent to satisfiability of constraints involving Dolev-Yao's operator ⊢. Making some restrictions over these constraints, their satisfiability has been proven to be NP-complete....
2005 / Laurent Mazaré -
Component-Based Specification of Collaborative Objects
Abstract A collaborative object represents a data type (such as a text document or a spreadsheet) designed to be shared by multiple geographically separated users. In order to improve performance and availability of data in such a distributed...
2007 / Abdessamad Imine -
Selection of Logistics Outsourcing Service Suppliers Based on AHP
Abstract The good choice of service suppliers is the key to success in logistics outsourcing. Based on the analysis of the characteristics of logistics outsourcing industry, the evaluation index system including logistics cost, the logistics...
2012 / Jianliang Peng -
A Dynamic Mesh-based Wireless Multicast Opportunistic Routing with Network Coding
Abstract This paper presents a practical multicast routing, which dynamically transforms a conventional multicast tree into a multicast mesh and increases the opportunities for coding by applying double direction network coding scheme. The...
2012 / Daru Pan, Zhaohua Ruan, Wei Cao -
Autotuning a Random Walk Boolean Satisfiability Solver
Abstract In this paper we present a performance optimization case study for a kernel with dynamic data structures, few instructions on boolean variables per node, and data-dependent control flow. This kernel serves as model for wide class of...
2011 / Tao Cui, Franz Franchetti -
A transparent virtual machine monitor level packet compression network service
Abstract Packet compression is a well-known technique for improving the performance of low speed networks such as WANs. This technique is also effective in networks with a high cost per transmitted byte, namely wireless networks. Most...
2011 / Ali Hamidi, Hadi Salimi, Mohsen Sharifi