Computer and information sciences topic list of research papers
-
PAPR Reduction in SC-FDMA Using NCT Technique
Abstract Orthogonal Frequency Division Multiplexing (OFDM) technology is undoubtedly the best available option for supporting high data rate in both wired and wireless communication systems. But, the feature of high peak-to-average power ratio...
2014 / Sandeep Shukla, Saurabh Shukla, Neetesh Purohit -
Analysis of Tajweed Errors in Quranic Recitation
Abstract The aim of this study is to identify the various types of tajweed errors made by students during Quran recitation. This study was carried out on 20 students who took the Tilawah Al-Quran (Quran Recitation) level 2 course as part of their...
2013 / Surul Shahbudin Bin Hassan, Muhammad Azhar Bin Zailaini -
n-Tiered Test Automation Architecture for Agile Software Systems
Abstract This paper introduces a multi-tiered test automation architecture to optimize test automation in an Agile software development environment while increasing both the test coverage and depth of each tier. Test Automation is the act of...
2014 / Patrick Day -
Determination of distances and sizes of visible objects using a plane transparent glass plate
Abstract A novel approach for the determination of distances and sizes of the different visible objects has been proposed. Accordingly, an experimental set up has been designed. This method is cheap, handy and easy to use. Observations are conducted ...
2014 / Arvind Kumar Pandey, Umesh Yadava -
Information Integration in Research Information Systems
Abstract Information integration is an on-going challenge in data management and various approaches have been proposed in database research. New technologies and application areas create different requirements for integration systems. Research...
2014 / Christoph Quix, Matthias Jarke -
Modeling Text Similarity with Parse Thickets
Abstract Parse thickets provide extensive descriptive representation of text information, based on structure of paragraphs of text. This technique widely uses additional information in terms of inter-sentence word-word relations, such as same...
2014 / Fedor Strok -
A Workflow Application for Parallel Processing of Big Data from an Internet Portal
Abstract The paper presents a workflow application for efficient parallel processing of data downloaded from an Internet portal. The workflow partitions input files into subdirectories which are further split for parallel processing by services...
2014 / Paweł Czarnul -
Protocol for Latency Reduction of Prioritized Traffic in WSN
Abstract In critical scenarios nodes switch from low data rate of transmission mode to high data rate. Such scenarios are event driven and traffic is highly dynamic in nature. Latency and reliability issues with Quality of Service (QoS) for such...
2013 / Kiran Kumar Pattanaik, Shivani Sharma -
Automatic Verification of Data-centric Web Service Specifications
Abstract Amodel are proposed for modeling data-centric Web services which are powered by relational databases and interact with users according to logical formulas specifying input constraints, control-flow constraints and state/output/action rules. ...
2013 / Zhi Fang, Lejian Liao, Ruoyu Chen -
Transformation of Shaped Nested Graphs and Diagrams1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph).
Abstract This paper describes a new computational model for rule-based programming with graphs and diagrams. Using existing nesting concepts for graphs, this model defines an intuitive way of nested graph transformation that is based on variable...
2004 / Berthold Hoffmann, Mark Minas -
Uniform provability realization of intuitionistic logic, modality and λ-terms
Abstract The intended meaning of intuitionistic logic is explained by the Brouwer-Heyting-Kolmogorov (BHK) provability semantics which informally defines intuitionistic truth as provability and specifies the intuitionistic connectives via operations ...
2004 / Sergei N. Artemov -
Formal Models of Timing Attacks on Web Privacy1 1Research partially supported by MURST Progetto Cofinanziato TOSCA.
Abstract We model a timing attack on web privacy proposed by Felten and Schneider by using three different approaches: HL-Timed Automata, SMV model checker, and tSPA Process Algebra. Some comparative analysis on the three approaches is derived. ...
2004 / Riccardo Focardi, Roberto Gorrieri, Ruggero Lanotte, Andrea Maggiolo-Schettini, Fabio Martinelli, et al. -
Incremental Induction of Decision Rules from Dominance-based Rough Approximations
Abstract An incremental algorithm generating satisfactory decision rules and a rule post-processing technique are presented. The rule induction algorithm is based on the Apriori algorithm. It is extended to handle preference-ordered domains of...
2004 / Jerzy Błaszczyński, Roman Słowiński -
Technologies for ubiquitous supercomputing: a Java interface to the Nexus communication system2005 / Ian Foster, George K. Thiruvathukal, Steven Tuecke
-
Plan in Maude Specifying an Active Network Programming Language
Abstract PLAN is a language designed for programming active networks, and can more generally be regarded as a model of mobile computation. PLAN generalizes the paradigm of imperative functional programming in an elegant way that allows for...
2005 / Mark-Oliver Stehr, Carolyn L. Talcott -
Coverage-driven Automated Compiler Test Suite Generation
Abstract The paper presents a novel approach to automated compiler test suite generation based on the source level specification. Several coverage criteria are introduced. The application of the proposed methodology to testing the realistic...
2005 / A. Kalinov, A. Kossatchev, A. Petrenko, M. Posypkin, V. Shishkov -
Specification and Verification of Agent Interaction using Social Integrity Constraints
Abstract In this paper we propose a logic-based social approach to the specification and verification of agent interaction. We firstly introduce integrity constraints about social acts (called Social Integrity Constraints) as a formalism to express...
2005 / Marco Alberti, Marco Gavanelli, Evelina Lamma, Paola Mello, Paolo Torroni -
Java Programming Assessment Tool for Assignment Module in Moodle E-learning System
Abstract This paper proposes an intermediate system called JAssess which is developed to provide a handy way to manage submission of students’ Java programming exercises from MoodleTM, as well as grading them semi-automatically. Details about the...
2012 / Norazah Yusof, Nur Ariffin Mohd Zin, Noor Shyahira Adnan -
NL-printable sets and Nondeterministic Kolmogorov Complexity
Abstract This paper introduces nondeterministic space-bounded Kolmogorov complexity, and we show that it has some nice properties not shared by some other resource-bounded notions of K-complexity. P-printable sets were defined by...
2004 / Eric Allender -
Preface
Abstract One of the main areas of research in logic programming is the design and implementation of sequential and parallel (constraint) logic programming systems. This research goes broadly from the design and specification of novel implementation...
2005 / Ines Dutra, Vítor Santos Costa, Gopal Gupta, Enrico Pontelli, Manuel Carro, et al.