Abstract

Abstract
The Drag-And-Dock design pattern provides a structured solution for designing graphical software applications with multiple content views that end users can freely arrange following a dragging and docking interaction approach. Copyright 2006 ACM.

Abstract
This paper discusses some issues related with the growing importance of wind power and in modern power systems and some challenges raised by the emergence of distributed generation, and how computational intelligence and other modern techniques have been able to provide valuable results in solving the new problems. It presents some solutions obtained with a number of computational intelligence techniques and their application to real cases. © TÜBITAK.

Abstract
The symmetry of cladding modes excited in microbend and arc-induced long-period fiber gratings is investigated. An optimization technique is developed to determine the fiber parameters and to associate grating resonances with cladding modes of a particular symmetry. Using this optimization procedure, we show that the gratings induced in a standard fiber by arc discharges and microbends couple light to the antisymmetric cladding modes. In the case of a boron-germanium codoped fiber, the cladding modes excited by arc-induced gratings are found to be symmetric. Measurements of the near-field intensity distribution of cladding modes confirm the mode symmetry ascertained by the optimization technique. (c) 2006 Optical Society of America

Abstract
In this chapter we present a coalgebraic semantics for components. Our semantics forms the basis for a family of operators for combining components. These operators together with their algebraic laws establish a calculus for software components. We present two applications of our semantics: a coalgebraic interpretation of UML diagrams and the design of a component repository.

Abstract
This paper addresses the problem of scheduling parallel tasks, represented by a direct acyclic graph (DAG) on heterogeneous clusters. Parallel tasks, also called malleable tasks, are tasks that can be executed on any number of processors with its execution time being a function of the number of processors alloted to it. The scheduling of independent parallel tasks on homogeneous machines has been extensively studied and the case of parallel tasks with precedence constraints has been studied for tree-like graphs. For arbitrary precedence graphs and for heterogeneous machines, the optimization problem is more complex because the processing time of a given task depends on the number of processors and on the total processing capacity of those processors. This paper presents a list scheduling algorithm to minimize the total length of the schedule (makespan) of a given set of parallel tasks, whose dependencies are represented by a DAG.