Computer and information sciences topic list of research papers
-
A Formal Method for Assessing Architecture Model and Design Maturity Using Domain-independent Patterns
Abstract Design patterns have been used as a formal or systematic means for extracting and patterning knowledge about good design choices, as well as capturing lessons learned associated with poor design choices (or so-called anti-patterns). Yet...
2014 / Kristin Giammarco -
Evaluation of Multi-stage Framing and Retransmission Overheads with Emphasis on IBM-SNA
Abstract This paper presents mathematical and computer tools for the evaluation of data overheads in message streams considering a two-stage framing and a retransmission protocol for error correction: a typical case of IBM-SNA with SDLC. The paper...
2013 / Imad Al-Sughaiyer, Abdullah Al-Dhalaan, Saad Haj Bakry -
Learning Defect Classifiers for Textured Surfaces Using Neural Networks and Statistical Feature Representations
Abstract Detecting surface defects is a challenging visual recognition problem arising in many processing steps during manufacturing. These defects occur with arbitrary size, shape and orientation. The challenges posed by this complexity have been...
2013 / D. Weimer, H. Thamer, B. Scholz-Reiter -
Computational System Architecture Development Using a Holistic Modeling Approach
Abstract This paper presents an innovative system architecture development framework that allows the search of optimum architecture solutions within large design space by automating certain model construction, alternative generation, simulation, and ...
2012 / Renzhong Wang, Cihan H. Dagli -
A novel and efficient user access control scheme for wireless body area sensor networks
Abstract Wireless body area networks (WBANs) can be applied to provide healthcare and patient monitoring. However, patient privacy can be vulnerable in a WBAN unless security is considered. Access to authorized users for the correct information and...
2013 / Santanu Chatterjee, Ashok Kumar Das, Jamuna Kanta Sing -
An adaptive neuro fuzzy model for estimating the reliability of component-based software systems
Abstract Although many algorithms and techniques have been developed for estimating the reliability of component-based software systems (CBSSs), much more research is needed. Accurate estimation of the reliability of a CBSS is difficult because it...
2014 / Kirti Tyagi, Arun Sharma -
Arabic Character Recognition: Progress and Challenges
Abstract An optical character recognition (OCR) system may provide a solution to the data entry problems, a bottleneck for the data processing industry. Therefore, OCR systems are being developed for almost all major languages and Arabic language is ...
2013 / Pervez Ahmed, Yousef Al-Ohali -
New developments around the μCRL tool set1 1http://www.cwi.nl/~mcrl
Abstract Some recent developments in the μCRL tool set are presented. New analysis techniques are a symbolic model checker, and a visualizer for huge state spaces. Also various transformations are presented. At symbolic level, theorem proving, data...
2004 / Stefan Blom, Jan Friso Groote, Izak van Langevelde, Bert Lisser, Jaco van de Pol -
Linear Embedding for a Quantitative Comparison of Language Expressiveness
Abstract We introduce the notion of linear embedding which refines Shapiro's notion of embedding by recasting it in a linear-space based semantics setting. We use this notion to compare the expressiveness of a class of languages that employ...
2004 / Antonio Brogi, Alessandra Di Pierro, Herbert Wiklicky -
Typing rule-based transformations over topological collections
Abstract Pattern-matching programming is an example of a rule-based programming style developed in functional languages. This programming style is intensively used in dialects of ML but is restricted to algebraic data-types. This...
2004 / Julien Cohen -
Timed Term Rewrite Systems
Abstract We propose a new class of rewrite systems that are conservative extensions of first-order conditional term rewrite systems together with time features such as clocks, signals, timed terms, timed atoms and timed rules. We define first timed...
2004 / Jérémie Blanc, Rachid Echahed -
Axiomatic Design/Design Patterns Mashup: Part 2 (Cyber Security)
Abstract Part 1 established the theoretical framework for undertaking a top-down/bottom-up mash-up between the Axiomatic Design/Complexity Theory (AD/CT) and the Design Patterns (ÐP) framework. It synthesized an integrated N-model from the top-down...
2015 / John Thomas, Pam Mantri -
From Contextual Grammars to Range Concatenation Grammars
Abstract Though the field of natural language processing is one of the major aims that has led to the definition of contextual grammars, very little was made on that subject. One reason is certainly the lack of efficient parsers for contextual...
2005 / Pierre Boullier -
Branching-Depth Hierarchies
Abstract We study the distinguishing and expressive power of branching temporal logics with bounded nesting depth of path quantifiers. We define the fragments CTL∗ i and CTL ...
2005 / Shoham Shamir, Orna Kupferman, Eli Shamir -
Search, choice, and revealed preference2011 / Andrew Caplin, Mark Dean
-
Object Closure Conversion
Abstract An integral part of implementing functional languages is closure conversion—the process of converting code with free variables into closed code and auxiliary data structures. Closure conversion has been extensively studied in this context,...
2005 / Neal Glew -
Dominance-based Rough Set Classifier without Induction of Decision Rules
Abstract Rough Sets Theory is often applied to the task of classification and prediction, in which objects are assigned to some pre-defined decision classes. When the classes are preference-ordered, the process of classification is referred to as...
2004 / Krzysztof Dembczyński, Roman Pindur, Robert Susmaga -
Concepts and Techniques simplifying the Assembly Process for Component Instances
Abstract This article presents new techniques for the assembly of component instances which go beyond the known ones simplifying the assembly process significantly. The techniques are based on a component model focussing on interface connections...
2004 / Ursula Scheben, Arnd Poetzsch-Heffter -
Abstract Commands:
Abstract Total correctness and general correctness are examined, and the latter is promoted as the more appropriate semantic basis for the programs which comprise the basic sequential interacting components of today's typically highly distributed...
2004 / Steve Dunne -
First–order Semantics for Higher–order Processes
Abstract Context bisimulation is a conceptually appealing behavioural equivalence for higher–order processes. Assuming that the scoping discipline for names or channels is static, that notion can be characterized in terms of...
2004 / Michael Baldamus