PROGRAM

5th WSEAS International Conference on
SOFTWARE ENGINEERING, PARALLEL and DISTRIBUTED
SYSTEMS

(SEPADS '06)

 

 

 

Madrid, Spain,

In collaboration with UNIVERSIDAD DE ALCALÁ
February 15-17, 2006

 

 

Wednesday, February 15, 2006

 

 

 

 

OFFICIAL WELCOME

 

Welcome speeches by:

 

Prof. Eloy Garcia-Calvo, Vice-Principle of Research of University of Alcala

Prof. Francisco Lopez-Ferreras, Dean of Polytechnic High School

Prof. Sebanstian Sanchez-Prieto, Head of Department of Automatic

Prof. Manuel Rosa-Zurera, Head of Department of Signal Processing and Communications

 

 

 

 

Plenary Lecture I

 

Title: Approximate Calculation of Information via Evolutionary Algorithms

 

Prof. Angel Fernando Kuri-Morales

Instituto Tecnologico Autonomo de Mexico

Rio Hondo No. 1

Mexico 01000, D.F.

Mexico

akuri@itam.mx

 

Abstract:

Data is expressed in a modern computer by encoding it digitally. There are many ways to encode such data and one of the main issues in present day telematics (in view of the need for efficient transmission in computer networks) is how to best achieve it. To determine what "best" encoding means it is necessary to measure the information contents in the data.

In the recent past there have been two approaches to quantifying information: the statistical approach and the algorithmic approach. In the statistical approach championed by Claude Shannon, information is determined assuming that the two extremes of a communication channel have agreed as to the possible interpretation of the basic symbols of the "message" from the start. In spite of the successful application of such an approach, it has been noted that the tacit aprioristic assumptions somewhat curtail its usefulness. Therefore, the algorithmic approach championed by Andrei Kolmogorov has been developed as a viable alternative. Kolmogorov's complexity (or algorithmic information) is subject independent and relies on the fact that any message may be reproduced by a precisely defined algorithm. Algorithmic information is defined, thereafter, as the length of the shortest program achieving this goal. Unfortunately, it has been shown that this program's length is, in general, not computable.

We shall discuss an approximate way to calculate the algorithmic information resorting to evolutionary computation techniques. We will establish the way to approximate Kolmogorov's complexity from Risanen's minimum description length principle by applying a genetic algorithm. We describe the genetic algorithm involved and how its application leads to the purported calculation. We will illustrate by giving an example of lossy compression arising directly from such approximation.

 

 

 

Plenary Lecture II

 

Prof. Vincenzo Niola

Department of Mechanical Engineering for Energetics

University of Naples "Federico II"

Via Claudio 21, 80125, Napoli

ITALY

vniola@unina.it

http://niola.dime.unina.it

 

 

 

 

SESSION: Software Engineering 

Chair: Zeljka Car, Maria-Isabel Sanchez-Segura

 

Cost Minimization in the Design of IT Infrastructures

 

Danilo Ardagna, Chiara Francalanci, Marco Trubian

512-458

Change Management Process on Database Level within RUP Framework

Zeljka Car, Petra Svoboda, Cornelia Kruslin

512-239

Cross-comparison of MODIS and MISR cloud top height retrieval over the Caribbean

Ana J. Picón, Hamed Parsiani, Ramón Vásquez

512-442

Simulation Environment for Testing and Verifying the L4 Microkernel Mapping Database

Martin K. Revuelta,  Pablo P. Espada,  Ignacio G. Tejedor,  Aitor V. Sanchez

512-529

Software process improvement for practitioners based on knowledge management tools

Antonio Amescua, Javier García, Maria-Isabel Sánchez-Segura, Fuensanta Medina

512-476

A Visual Control Flow Language

László Lengyel, Tihamér Levendovszky, Gergely Mezei, Hassan Charaf

512-243

 

 

 

SESSION: Software Engineering, Knowledge Management and Applications

Chair: Hong Zhu, Kevin J. O'Sullivan

 

Clarifying Modeling Premises As Explicit Ontologies–Axioms For Conceptual Model Management–

Kazuya Koyama, Kazuhisa Seta, Yusuke Hayashi, Mitsuru Ikeda

512-188

An Application of Genetic Algorithm for Auto-body Panel Die-design Case Library Based on Grid

Demin Wang, Hong Zhu, and Xin Liu

512-195

Service Oriented Architecture for Enterprise Applications

Shankar Kambhampaty, Satish Chandra

512-417

Optimization Algorithms For OCL Compilers

Gergely Mezei, Laszlo Lengyel, Tihamér Levendovszky, Hassan Charaf

512-503

Class-Component Testability Analysis

Supaporn Kansomkeat, Jeff Offutt, Wanchai Rivepiboon

512-213

Knowledge management in project phases

Nahid Hashemian Bojnord, Abbas Afrazeh

512-171

 

 

 

SESSION: Software Engineering and Frameworks

Chair: Abdulaziz H. Al-Zoman

 

A Modular Software Framework for Camera Calibration

Stephan Rupp

512-273

Analytical Model for Semantic Overlay Networks in Peer-to-Peer Systems

Bertalan Forstner, Hassan Charaf

512-371

Arabic Domain Names

Abdulaziz H. Al-Zoman

512-333

Some succinctness properties of omega DTAFA

A. Fellah, S. Noureddine, Z. Friggstad

512-472

Broadcasting Algorithm of Constant Complexity for Fully-Switched Clusters

Sandor Juhasz

512-276

 

 

 

 

 

Thursday, February 16, 2006

 

 

 


SESSION: Software Engineering and Distributed Systems

Chair: Shahbaz Pervez, Chanintorn  Jittawiriyanukoon, Aitor Viana

 

Increasing the Determinism in Real-Time Operating Systems for ERC32 Architecture

A. Viana, O.R. Polo, P. Parra, O.G. Población, I.G. Tejedor, S. S. Prieto and D. Meziat

512-531

A Recursive Algorithm for Global Alignment with Gap Consideration in a pair of Sequences

Muneer Ahmad, Shahbaz Pervez, Iftikhar Ahamed, Adeel Akram, Nadeem Daud Potta

512-269

A Novel Tele-Working Platform supporting Public Administrational Bureaus

Philip Sotiriades, George-Peter  Economou, Konstantine Dimopoulos, Dimitris Lymberopoulos

512-241

A light-weight Publisher-Subscriber Middleware for Dynamic Reconfiguration in Networks of  Embedded Smart Cameras

Andreas Doblander, Bernhard Rinner, Norbert Trenkwalder, Andreas Zoufal

512-345

Performance Evaluation of Adaptive Rate Control (ARC) for Distributed Congestion Nodes of Mobile Ad Hoc Network

Surasee Prahmkaew and Chanintorn  Jittawiriyanukoon

512-318

 

 

 

SESSION: Frameworks and Distributed Platforms 

Chair: Franco Frattolillo, Sameer Bataineh, Shih-Chien Chou

 

Framework for Evolving Systems

Urjaswala Vora, N. L. Sarda

512-297

Fault-Tolerant Framework for Load Balancing System

Y. K. Liu, L.M. Cheng, L.L.Cheng

512-439

A Distributed DRM Platform Based on a Web-Oriented Watermarking Protocol

Franco Frattolillo, Salvatore D'Onofrio

512-466

Load Distribution in Daisy Chain & Two-level d-dimensional Tree Networks Based on Power Consumption

Sameer Bataineh and Manar Arafat

512-373

Preventing Information Leakage in C Applications Using RBAC-Based Model

Shih-Chien Chou

512-344

Cognitive Information  Complexity  Measure of Object-Oriented Software - A Practitioner's Approach

Dharmender Singh Kushwaha , A.K.Misra

512-340

 

 

 

SESSION: Software Engineering and Parallel Processing Systems

Chair: Zhiguang Xu, Chanintorn Jittawiriyanukoon

 

Multiport Network Method and Using It for Accurate Design of Square Spiral Antennas

Saman Rajebi, Changiz Ghobadi, Javad Nooriniya

512-128

A Complexity Measure Based on Information Contained in the Software

Dharmender Singh Kushwaha and A.K.Misra

512-321

Direct torque control of double-star induction motors

Rabah. Zaimeddine and El Madjid Berkouk

512-162

Source Routing in the Internet with Reinforcement Learning and Genetic Algorithms

Zhiguang Xu

512-376

A SMT/ARM Simulator and Performance Evaluation

Dong Lan, Ji Zhenzhou, Suixiufeng, Hu Mingzeng, Cui Guangzuo

512-464

A Queueing Model for Evaluating the Performance of Parallel Processing Systems

Chanintorn Jittawiriyanukoon

512-329