Open Access Published by De Gruyter Open Access

Volume 1 Issue 1

March 2011

Issue of Open Computer Science

Contents
Journal Overview

Open Access March 25, 2011

Welcome Message from the Editor-in-Chief

Page range: 1-1

Download PDF

Open Access March 25, 2011

Designing Wireless Sensor Networks: from theory to applications

Dharma Agrawal

Page range: 2-18

More Download PDF

Abstract

Wireless Sensor Networks (WSNs) are having a dramatic impact on the way surrounding environment is being monitored. In this article, many underlying design issues of WSNs have been summarized, starting from the coverage and the connectivity. As batteries provide energy to sensor nodes, effective ways of power conservation are considered. Advantages of placing sensors in a regular pattern have also been discussed and various tradeoffs for many possible ways of secured communication in a WSN are summarized. Challenges in deploying WSN for monitoring CO emission are briefly covered. Finally, the use of sensors is illustrated in automatically generating music based on dancers’ movements.

Open Access March 25, 2011

On clustering DAGs for task-hungry computing platforms

Gennaro Cordasco, Arnold Rosenberg, Mark Sims

Page range: 19-35

More Download PDF

Abstract

Many modern computing platforms are “task-hungry”: their performance is enhanced by always having as many tasks available for execution as possible. IC-scheduling, a master-worker framework for executing static computations that have intertask dependencies (modeled as dags), was developed with precisely the goal of rendering a computation-dag’s tasks eligible for execution at the maximum possible rate. The current paper addresses the problem of enhancing IC-scheduling so that it can accommodate the varying computational resources of different workers, by clustering a computation-dag’s tasks, while still producing eligible (now, clustered) tasks at the maximum possible rate. The task-clustering strategies presented exploit the structure of the computation being performed, ranging from a strategy that works for any dag, to ones that build increasingly on the explicit structure of the dagbeing scheduled.

Open Access March 25, 2011

Automated software and hardware evolution analysis for distributed real-time and embedded systems

Brian Dougherty, Jules White, Douglas Schmidt

Page range: 36-57

More Download PDF

Abstract

Software evolution is critical to extending the utility and life of distributed real-time and embedded (DRE) systems. Determining the optimal set of software and hardware components to evolve that (1) incorporate cutting-edge technology and (2) satisfy DRE system resource constraints, such as memory, power, and CPU usage is an NP-Hard problem. This article provides four contributions to evolving legacy DRE system configurations. First, we present the Software Evolution Analysis with Resources (SEAR) technique for converting legacy DRE system configurations, external resource availabilities, and candidate replacement components into multiple-choice multidimension knapsack problems (MMKP). Second, we present a formal methodology for assessing the validity of evolved system configurations. Third, we apply heuristic approximation algorithms to determine low-cost, high value evolution paths in polynomial time. Finally, we analyze results of experiments that apply these techniques to determine which technique is most effective for given system parameters. Our results show that constraint solvers can only evolve small system configurations, whereas approximation techniques are needed to evolve larger system configurations.

Open Access March 25, 2011

Recent trends in metaheuristics for stochastic combinatorial optimization

Walter Gutjahr

Page range: 58-66

More Download PDF

Abstract

This short overview is an addendum to a recent literature survey by Bianchi et al. on metaheuristics for stochastic combinatorial optimization (SCO). It outlines some new developments that occurred in this field during the last few years. Special attention is given to multi-objective SCO as well as to combinations of metaheuristics with mathematical programming.

Open Access March 25, 2011

On the global stability of time delayed CNNs

Athanasios Margaris

Page range: 67-100

More Download PDF

Abstract

The objective of this paper is the concise presentation of the most important and recent lemmas and theorems associated with the global asymptotic and exponential stability of the equilibrium point of time delayed cellular neural networks. For each theorem a short proof is given, so that the reader can understand its features and its relationships to other theorems. In the last section, the presented theorems are grouped according to their characteristics and the way they relate to one another, and some of them are demonstrated, in order to draw conclusions about their use.

Open Access March 25, 2011

A review of recent evolutionary computation-based techniques in wind turbines layout optimization problems

S. Salcedo-Sanz, B. Saavedra-Moreno, A. Paniagua-Tineo, L. Prieto, A. Portilla-Figueras

Page range: 101-107

More Download PDF

Abstract

This paper presents a mini-review of the main works recently published about optimal wind turbines layout in wind farms. Specifically, we focus on discussing articles where evolutionary computation techniques have been applied, since this computational framework has obtained very good results in different formulations of the problem. A summary of the main concepts needed to face the problem are also included in the article, such as a basic wake model and several cost models and objective functions previously used in the literature. This review includes works published in the most significant journals and international conferences, and it gives a brief remark of the optimization models proposed and the implemented algorithms, so it can be useful for readers who want to be quickly introduced in this research area.

Open Access March 25, 2011

A vision for computer science — the system perspective

Joseph Sifakis

Page range: 108-116

Download PDF

Open Access March 25, 2011

XML document-grammar comparison: related problems and applications

Joe Tekli, Richard Chbeir, Agma Traina, Caetano Traina

Page range: 117-136

More Download PDF

Abstract

XML document comparison is becoming an ever more popular research issue due to the increasingly abundant use of XML. Likewise, a growing interest fosters the development of XML grammar matching and comparison, due to the proliferation of heterogeneous XML data sources, particularly on the Web. Nonetheless, the process of comparing XML documents with XML grammars, i.e., XML document and grammar similarity evaluation, has not yet received the attention it deserves. In this paper, we provide an overview on existing research related to XML document/grammar comparison, presenting the background and discussing the various techniques related to the problem. We also discuss some prominent application domains, ranging over document classification and clustering, document transformation, grammar evolution, selective dissemination of XML information, XML querying, as well as alert filtering in intrusion detection systems and Web Services matching and communications.

Open Access March 25, 2011

Good versus optimal: Why network analytic methods need more systematic evaluation

Katharina Zweig

Page range: 137-153

More Download PDF

Abstract

Network analytic method designed for the analysis of static networks promise to identify significant relational patterns that correlate with important structures in the complex system the network is derived from. In this mini review, three groups of network analytic methods are discussed: centrality indices, network motifs, and clustering algorithms. We show that so far these methods have mainly been used in a descriptive way, but that they show promising possibilities to be used for prediction and classification. We thus conclude the article with a discussion of how benchmark sets and evaluation criteria could look like to realize this promise.

About this journal

SPECIAL ISSUES

Generative AI for Computer Vision Applications: A boon or a bane?
GUEST EDITORS: Jude Hemanth (Karunya Institute of Technology and Sciences, India), Anastasia Angelopoulou (University of Westminster, United Kingdom), Daniela Danciulescu (University of Craiova, Romania)
DEADLINE FOR SUBMISSIONS: December 30, 2023
Embracing Nano computing Technologies for Evolving Cyber-Physical System
GUEST EDITORS: Joseph Bamidele Awotunde (University of Ilorin, Nigeria), Akash Kumar Bhoi (Sikkim Manipal University, India), Paolo Barsocchi (National Research Council, Italy)
DEADLINE FOR SUBMISSIONS: December 15, 2023
Advancements in Machine Learning for Cybersecurity and Privacy: Algorithms, Models, and Applications
GUEST EDITORS: Gulshan Kumar (Shaheed Bhagat Singh State University, India), Krishan Kumar (Punjab University, India), Subhash Chander (Malout Institute of Management and Information Technology, India), Munish Kumar (Maharaja Ranjit Singh Punjab Technical University, India).
DEADLINE FOR SUBMISSIONS: November 30, 2023
AI-based Techniques in Wireless Sensor Networks
GUEST EDITORS: Arvind Dhaka (Manipal University Jaipur, India); Siddhartha Chauhan (NIT Hamirpur, India); Edmar Candeia Gurjao (Federal University of Campina Grande, Brazil); Amita Nandal (Manipal University Jaipur, India).
DEADLINE FOR SUBMISSIONS: November 30, 2023
Empowering the Future Generation Systems: Opportunities by the Convergence of Cloud, Edge, AI, and IoT
GUEST EDITORS: Ahmed Farouk (Wilfrid Laurier University, Waterloo, Canada); Shahid Mumtaz (Nottingham Trent University, United Kingdom)
DEADLINE FOR SUBMISSIONS: November 25, 2023
Recent Advances in Biometrics Based on Biomedical Information
GUEST EDITORS: Mohammad Shabaz (Model Institute of Engineering and Technology, Jammu, J&K, India); Imad Rida (Université de Technologie de Compiègne, France); Shah Nazir (University of Swabi, Pakistan); Abolfazl Mehbodniya (Kuwait College of Science and Technology, Kuwait)
DEADLINE FOR SUBMISSIONS: November 25, 2023
High-Performance Computing for Climate Informatics
GUEST EDITORS: Hammam Alshazly (South Valley University, Egypt), Hela Elmannai, (Princess Nourah Bint Abdulrahman University, Saudi Arabia), Amir Benzaoui (University of Skikda, Algeria)
DEADLINE FOR SUBMISSIONS: October 10, 2023
19th International Conference on Intelligent Environments
COORDINATING EDITOR: Egon L. van den Broek (Utrecht University, the Netherlands)
DEADLINE FOR SUBMISSIONS: September 30, 2023
Cybersecurity applications for improving data management: trends and challenges
GUEST EDITORS: Haris M. Khalid (University of Johannesburg, South Africa), Taha Zoulagh (University if Santiago, Chile), Mohammad Abuashour (Hashemite University, Jordan)
DEADLINE FOR SUBMISSIONS: November 15, 2023

Open Computer Science is a fully peer-reviewed, open access, electronic-only journal publishing works of wide significance, originality and relevance. The journal provides the readers with free, instant, and permanent access to all content worldwide; and the authors with extensive promotion of published articles, long-term preservation, no space constraints and quick publication.

Open Computer Science is listed inter alia by Web of Science (ESCI - Emerging Sources Citation Index) and SCOPUS. Our standard policy requires each paper to be reviewed by at least two Referees and the peer-review process is single-blind.

Open Computer Science publishes original and significant research results in the following fields:

algorithms and complexity theory
artificial intelligence
bioinformatics
networking and security systems
programming languages
system and software engineering
theoretical foundations of computer science

The journal considers submissions of different types of articles, including "Research Articles" as well as “Review Articles”, which present the existing literature and achievements on the specific topic from new perspectives. We accept both theoretical and empirical contributions.

Why read

Open Computer Science is a premier source of a high quality research. Thanks to Open Access all articles are freely available to the academic community worldwide.