Computer and information sciences topic list of research papers
-
A Dynamically Self-reconfigurable System Design Based on SSE Instruction Set
Abstract The Dynamic Reconfiguration Technology provides powerful technological support to achieve high-performance general-purpose CPU system in resolving the application of diversity issues, meanwhile improving the enhanced on-chip resource...
2011 / Kaiyu Wang, Zhenan Tang, Yun Zhao, Hualong Li -
Novel hierarchical routing protocol in wireless sensor network
Abstract Sensor networks consist of wireless enabled sensor nodes with limited energy. One of the most important problems in wireless sensor network is to develop an energy efficient routing protocol. Reducing energy consumption and prolonging...
2011 / Mohammad Zeynali, Amir Mollanejad, Leili Mohammad Khanli -
Enterprise information security, a review of architectures and frameworks from interoperability perspective
Abstract With the growth of ICT opportunities, the enterprises have realized the significance of interoperability as a competitive advantage. Thus, many enterprises have adopted the main strategy of rapidly changing their structures to support...
2011 / Marzieh Shariati, Faezeh Bahmani, Fereidoon Shams -
A new training method for sequence data
Abstract Under the framework of max margin method, this work proposes a model for training sequence data, which can be solved as a binary classification. However, there are too many samples in the auxiliary classification problem to make the model...
2010 / Lingfeng Niua, Yong Shi -
Knowledge extraction from multiple criteria linear programming classification approach
Abstract As an effective model for classification, Multiple Criteria Linear Programming (MCLP) has been widely used in business intelligence. However, a possible limitation of MCLP is that it generates unexplainable black-box models which can only...
2010 / Yuejin Zhang, Peng Zhang, Lingling Zhang, Yong Shi -
Performance evaluation of data delivery approaches for wireless sensor networks
Abstract Wireless sensor networks are expected to revolutionize our abilities in sensing and controlling the physical environment. Power conservation is a primary research concern for these networks, due to the limited energy resources of the sensor ...
2011 / Plamen Z. Zahariev, Georgi V. Hristov -
Farsi/Arabic optical font recognition using SIFT features
Abstract Most optical font recognition (OFR) methods have been designed to recognize the font in non-cursive documents. However, the recognition of cursive font scripts like Farsi/Arabic texts has its own challenges. Thus, most of the currently...
2011 / Morteza Zahedi, Saeideh Eslami -
Model Checking Multithreaded Programs by Means of Reduced Models
Abstract Java is largely used to develop distributed and concurrent systems, but testing multithreaded systems cannot guarantee the quality of the software; in contrast, verification techniques give us a higher confidence about the system and, among ...
2004 / Sara Gradara, Antonella Santone, Maria Luisa Villani, Gigliola Vaglini -
Transforming SAT into Termination of Rewriting
Abstract In this paper we propose different translations from SAT to termination of term rewriting, i.e., we translate a propositional formula φ into a generic rewrite system R ...
2009 / Harald Zankl, Christian Sternagel, Aart Middeldorp -
The Haskell Refactorer, HaRe, and its API
Abstract We demonstrate the Haskell Refactorer, HaRe, both as an example of a fully-functional tool for a complete (functional) programming language, and to show the API which HaRe provides for building source-level program transformations for...
2005 / Huiqing Li, Simon Thompson, Claus Reinke -
The Kantorovich Metric in Computer Science: A Brief Survey
Abstract In contrast to its wealth of applications in mathematics, the Kantorovich metric started to be noticed in computer science only in recent years. We give a brief survey of its applications in probabilistic concurrency, image retrieval, data...
2009 / Yuxin Deng, Wenjie Du -
Transforming Programs into Recursive Functions
Abstract This paper presents a new proof-assistant based approach to program verification: programs are translated, via fully-automatic deduction, into tail-recursive function defined in the logic of a theorem prover. This approach improves on...
2009 / Magnus O. Myreen, Michael J.C. Gordon -
Controller/Orchestrator Synthesis via Filtration
Abstract The present paper is interested in the following decision problems: (1) given finite frames F , F ′ ...
2010 / Philippe Balbiani, Fahima Cheikh, Guillaume Feuillade -
Connector Colouring I: Synchronisation and Context Dependency
Abstract Reo is a coordination model based on circuit-like connectors which coordinate components through the interplay of data flow, synchronisation and mutual exclusion, state, and context-dependent behaviour. This paper proposes a scheme based on ...
2006 / Dave Clarke, David Costa, Farhad Arbab -
Combining Partitions in SecSpaces2004 / Mario Bravetti, Roberto Gorrieri, Roberto Lucchi, Gianluigi Zavattaro
-
Derivation of a Scalable Lock-Free Stack Algorithm
Abstract We show how a sophisticated, lock-free concurrent stack implementation can be derived from an abstract specification in a series of verifiable steps. The algorithm is a simplified version of one described by Hendler, Shavit and Yerushalmi...
2007 / Lindsay Groves, Robert Colvin -
A Framework for Establishing Formal Conformance between Object Models and Object-Oriented Programs
Abstract Conformance between structural models and their implementations are usually simplified in practice, restraining reasoning to simple mappings between modeling and implementation constructs. This is not appropriate to accommodate the usual...
2008 / Tiago Massoni, Rohit Gheyi, Paulo Borba -
An Input/Output Semantics for Distributed Program Equivalence Reasoning
Abstract A new notion of input/output equivalence of distributed imperative programs, with synchronous communications, is introduced. It preserves the input/output relation, encompassing both, initial/final state and communication channel values....
2005 / Miquel Bertran, Francesc-Xavier Babot, August Climent -
Embedding Constructive K into Intuitionistic K
Abstract We investigate an embedding of CK natural deduction proofs into IK natural deduction proofs. CK and IK can both be regarded as intuitionistic analogs of the basic classical modal logic K. Since, in general, the proof theory of these logics...
2010 / Kurt Ranalter -
Verifying Communication Protocols Using Live Sequence Chart Specifications
Abstract The need for a formal verification process in System on Chip (SoC) design and Intellectual Property (IP) integration has been recognized and investigated significantly in the past. A major drawback is the lack of a suitable specification...
2009 / Rahul Kumar, Eric G. Mercer