Computer and information sciences topic list of research papers
-
Planning Time and Writing Quality in Expository Writing
Abstract This study investigated the effect of planning time on the writing quality of EFL learners’ expository writing. 60 EFL learners were randomly assigned to three groups with different planning conditions and were asked to write an essay. All...
2014 / Esmaeel Abdollahzade, Morteza Taak -
Managing computer networks using peer-to-peer technologies2005 / L.Z. Granville, D.M. da Rosa, A. Panisson, C. Melchiors, M.J.B. Almeida, et al.
-
A Genetic Algorithm for Automated Service Binding
Abstract Binding concrete web services to the tasks involved in an orchestration model is an important step in dynamic web service composition. In our previous work on automated service binding, we have described a method of combining a powerful...
2014 / Raluca Iordache, Florica Moldoveanu -
Solving Economic Dispatch Problem Using Hybrid GA-MGA
Abstract This paper presents a new method combined in two meta-heuristic methods, the Genetic algorithm (GA) and micro-genetic algorithm (MGA), to solve the EPD (economic power dispatch) problem. The GA is applied to find the global optimum by...
2014 / R.L. Kherfane, M. Younes, N. Kherfane, F. Khodja -
The Design of A Natural Language Interface for File System Operations on the basis of a Structured Meanings Model
Abstract Due to evolutionary increase of the software complexity, graphical user interfaces have been becoming more and more complex, and often this process encounters the restricted possibilities of reflecting graphics on a display. This paper...
2014 / Alexander A. Razorenov, Vladimir A. Fomichov -
A Trust-based Probabilistic Coverage Algorithm for Wireless Sensor Networks
Abstract Sensing coverage is a fundamental issue for many applications in wireless sensor networks. Due to sensors resource limitations, inherent uncertainties associated with their measurements, and the harsh and dynamic environment in which they...
2013 / Zahra Taghikhaki, Nirvana Meratnia, Paul J.M. Havinga -
Practicality Issues in Using Fuzzy Approaches for Aggregating Students’ Academic Performance
Abstract Evaluation of student academic performance is one of the most important parts of the educational process. It has to be done for several important reasons. It also has to provide an evaluation in the form of score or grade that is...
2013 / Khairul A. Rasmani, Nor A. Shahari, Jonathan M. Garibaldi, Qiang Shen -
Development of a CAD System for Automatic Classification of Microcalcifications based on FPGA
Abstract This paper presents a Computer Aided Diagnosis (CAD) system that automatically classifies microcalcifications detected on digital mammograms into one of the five types proposed by Michèle Le Gal, a classification scheme that allows...
2013 / Tiago A. Dócusse, Alexandre C.R. da Silva, Aledir S. Pereira, Norian Marranghello -
Towards the Correctness of Security Protocols
Abstract In [19], the authors presented a type-theoretic approach to the verification of security protocols. In this approach, a universal type system is proposed to capture in a finite way all the possible computations (internal actions or protocol ...
2014 / Mourad Debbabi, Mohamed Mejri -
Probabilistic Confinement in a Declarative Framework
Abstract We show how to formulate and analyse some security notions in the context of declarative programming. We concentrate on a particular class of security properties, namely the so-called confinement properties. Our reference language is...
2004 / Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky -
Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols
Abstract In this paper, we first define bisimulation-based non-deterministic admissible interference(BNAI), derive its process-theoretic characterization and present a compositional verification method with respect to the main operators over...
2004 / Stéphane Lafrance, John Mullins -
An Optimal Family of Directed, Bounded-Degree Broadcast Networks
Abstract Increasingly, the design of efficient computer networks and multi-processor configurations are considered important applications of computer science. There are some constraints in network design which are usually created by economic and...
2004 / Michael J. Dinneen, Nian (Alfred)Zhou -
Extracting Decision Rules for Cooperative Team Air Combat Based on Rough Set Theory
Abstract In order to reduce redundant features in air combat information and to meet the requirements of real-time decision in combat, rough set theory is introduced to the tactical decision analysis in cooperative team air combat. An algorithm of...
2011 / Jian GAO, Ming-an TONG -
Quantales as completions of ordered monoids: Revised semantics for Intuitionistic Linear Logic
Abstract The aim of this paper is to propose a unified analysis of the relationships between the notions of order and closure and to relate it to different semantics of Intuitionistic Linear Logic (ILL). We study the embedding of ordered monoids...
2005 / D. Larchey-Wendling, D. Galmiche -
The Two-Phase Commitment Protocol in an Extended π-Calculus
Abstract We examine extensions to the π-calculus for representing basic elements of distributed systems. In spite of its expressiveness for encoding various programming constructs, some of the phenomena inherent in distributed systems are hard to...
2005 / Martin Berger, Kohei Honda -
A DNS Architecture for the Internet of Things: A Case Study in Transport Logistics
Abstract This paper proposes a DNS architecture for the Internet of Things (IoT). Similarly to the existing DNS infrastructure on the Internet, the DNS for the IoT translates unique identifiers (URIs) of physical objects to concrete network...
2013 / Bill Karakostas -
Boundary and holes recognition in wireless sensor networks
Abstract In this paper, a distributed solution is proposed for detecting boundaries and holes in the WSN using only the nodes connectivity information. The run of our protocol is divided imto three main steps. In the first step, each node collects...
2016 / Rachid Beghdad, Amar Lamraoui -
A Unified Framework for Designing, Implementing and Visualizing Distributed Algorithms
Abstract We present a general method and a toolkit for designing, implementing and visualizing distributed algorithms. We make use of the high level encoding of distributed algorithms as graph rewriting systems. The result is a unified and simple...
2004 / Michel Bauderon, Mohamed Mosbah -
Implementing β-Reduction by Hypergraph Rewriting
Abstract The aim of this paper is to implement the β-reduction in the lambda;-calculus with a hypergraph rewriting mechanism called collapsed lambda;-tree rewriting. It turns out that collapsed lambda;-tree rewriting is sound with respect to...
2005 / Sabine Kuske -
Preface
Abstract This issue contains the Proceedings of the Second International Workshop on Parallel and Distributed Model Checking (PDMC 2003) held in Boulder, Colorado, USA, July 14, 2003 as a satellite event to the 15th International Conference on...
2005 / Lubos Brim, Orna Grumberg