Computer and information sciences topic list of research papers
-
E-matching for Fun and Profit
Abstract Efficient handling of quantifiers is crucial for solving software verification problems. E-matching algorithms are used in satisfiability modulo theories solvers that handle quantified formulas through instantiation. Two novel, efficient...
2008 / Michał Moskal, Jakub Łopuszański, Joseph R. Kiniry -
An Improvement of Software Architecture Verification
Abstract Static analysis may cause state space explosion problem. In this paper we explore differential equation model that makes the task of verifying software architecture properties much more efficient. We demonstrate how ordinary differential...
2009 / Zuohua Ding, Jing Liu -
a-Logic With Arrows
Abstract We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-rules for it, we demonstrate cut-elimination for...
2008 / Murdoch J. Gabbay, Michael J. Gabbay -
Web Sites Repairing through Abduction
Abstract We present a methodology and a tool for suggesting repairs to web sites that violate some given requirements in the form of web rules expressed in (an extension of) a fragment of Excerpt. The methodology consists in translating these web...
2009 / Paolo Mancarella, Giacomo Terreni, Francesca Toni -
Throughput Analysis of a Cooperative ARQ Scheme in the Presence of Hidden and Exposed Terminals2011 / Jesus Alonso-Zarate, Luis Alonso, Georgios Kormentzas, R. Tafazolli, Christos Verikoukis
-
The Verification of Structure Identification Algorithm and Error Detection Strategies for Structured Flowchart
Abstract Automatic code generation for structured flowchart is of great practical significance. It makes software development based on MDA (Model Driven Architecture) be more practical in detailed processing logic. A depth-first search algorithm...
2012 / Wen-Jia Gong, Ming-Cheng Qu, Xiang-hu Wu, Pei-Jun Ma -
Study on CANbus Control System-oriented Simulation Platform Based on the Node Task
Abstract Net control system simulation is an important method in the process of research of networked control theory. In the paper, a simulation platform for CANbus control system based on the node task is built. TrueTime software is adopted to...
2011 / Junli Liu, Jianfeng Wan, Yanyan Yan -
User selection scheme with secrecy capacity in MIMO downlink systems
Abstract For multiuser Multiple-Input-Multiple-Output (MIMO) downlink systems where some receivers exist, several user selection schemes have been recently proposed. However, these user selection schemes do not take security into consideration. One...
2010 / Masatoshi Yanase, Tomoaki Ohtsuki -
Evaluating system change options and timing using the epoch syncopation framework
Abstract Complex engineering systems face many unknowns with respect to their operating contexts and time-varying stakeholder needs over their lifespan. A useful means for partitioning this problem is to consider a set of static snapshots of...
2012 / Daniel O. Fulcoly, Adam M. Ross, Donna H. Rhodes -
Partial Metric Topology2006 / S. G. MATTHEWS
-
A performance analysis of channel fragmentation in dynamic spectrum access systems2012 / Ed Coffman, Philippe Robert, Florian Simatos, Shuzo Tarumi, Gil Zussman
-
Implementing a Language with Flow-Sensitive and Structural Typing on the JVM
Abstract Dynamically typed languages are flexible and impose few burdens on the programmer. In contrast, static typing leads to software that is more efficient and has fewer errors. However, static type systems traditionally require every variable...
2011 / David J. Pearce, James Noble -
Stochastic Modelling and Optimisation of Internet Auction Processes
Abstract Internet auctions are an attractive mechanism for the exchange of goods at a non-fixed price point. The operation of these auctions can be run under a variety of parameters. In this paper, we provide a theoretical analysis of fixed time...
2011 / Timothy L.Y. Leung, William J. Knottenbelt -
Tableau Method and NEXPTIME-Completeness of DEL-Sequents
Abstract Dynamic Epistemic Logic (DEL) deals with the representation of situations in a multi-agent and dynamic setting. It can express in a uniform way statements about: (i) ...
2011 / Guillaume Aucher, Bastien Maubert, François Schwarzentruber -
ICMAP: An interactive tool for concept map generation to facilitate learning process
Abstract Human-computer interaction could play an essential role in learning. In distance learning, interactive tools can facilitate the learning process for teachers and students. In this article, the design and implementation of software will be...
2011 / Hendijanifard Fatemeh, Kardan Ahmad, Dibay Moghadam Mohammad -
Efficient visualization of 3D models on hardware-limited portable devices2012 / Francisco Ramos, Oscar Ripolles, Miguel Chover
-
A genetic algorithm for finding the k shortest paths in a network
Abstract Most of the multimedia applications require the k shortest paths during the communication between a single source and multiple destinations. This problem is known as multimedia multicast routing and has been proved to be NP-complete. The...
2010 / Ahmed Younes Hamed -
Cyclic Preferential Attachment in Complex Networks
Abstract Preferential Attachment (PA), which was originally proposed in the Barabasi-Albert (BA) Model, has been widely ac- cepted as a network growth model which returns in scale-free networks. Preferential attachment in the BA model operates on...
2013 / Dharshana Kasthurirathna, Mahendra Piraveenan -
A smart card based framework for securing e-business transactions in distributed systems
Abstract In the recent years, we have seen the emergence and the growing of the e-business via the internet. Many organizations are extending their business transactions by using the Web. This will allow them to reach more customers in a cost...
2012 / Hakim Fourar-Laidi -
Interestingness measures and strategies for mining multi-ontology multi-level association rules from gene ontology annotations for the discovery of new GO relationships
Abstract The Gene Ontology (GO), a set of three sub-ontologies, is one of the most popular bio-ontologies used for describing gene product characteristics. GO annotation data containing terms from multiple sub-ontologies and at different levels in...
2013 / Prashanti Manda, Fiona McCarthy, Susan M. Bridges