Evolving Distributed Algorithms with Genetic Programming

Distributed systems are one of the most vital components of the economy. The most prominent example is probably the internet, a constituent element of our knowledge society. During the recent years, the number of novel network types has steadily increased. Amongst others, sensor networks, distributed systems composed of tiny computational devices with scarce resources, have emerged. The further development and heterogeneous connection of such systems imposes new requirements on the software development process. Mobile and wireless networks, for instance, have to organize themselves autonomously and must be able to react to changes in the environment and to failing nodes alike. Researching new approaches for the design of distributed algorithms may lead to methods with which these requirements can be met efficiently. In this thesis, one such method is developed, tested, and discussed in respect of its practical utility. Our new design approach for distributed algorithms is based on Genetic Programming, a member of the family of evolutionary algorithms. Evolutionary algorithms are metaheuristic optimization methods which copy principles from natural evolution. They use a population of solution candidates which they try to refine step by step in order to attain optimal values for predefined objective functions. The synthesis of an algorithm with our approach starts with an analysis step in which the wanted global behavior of the distributed system is specified. From this specification, objective functions are derived which steer a Genetic Programming process where the solution candidates are distributed programs. The objective functions rate how close these programs approximate the goal behavior in multiple randomized network simulations. The evolutionary process step by step selects the most promising solution candidates and modifies and combines them with mutation and crossover operators. This way, a description of the global behavior of a distributed system is translated automatically to programs which, if executed locally on the nodes of the system, exhibit this behavior. In our work, we test six different ways for representing distributed programs, comprising adaptations and extensions of well-known Genetic Programming methods (SGP, eSGP, and LGP), one bio-inspired approach (Fraglets), and two new program representations called Rule-based Genetic Programming (RBGP, eRBGP) designed by us. We breed programs in these representations for three well-known example problems in distributed systems: election algorithms, the distributed mutual exclusion at a critical section, and the distributed computation of the greatest common divisor of a set of numbers. Synthesizing distributed programs the evolutionary way does not necessarily lead to the envisaged results. In a detailed analysis, we discuss the problematic features which make this form of Genetic Programming particularly hard. The two Rule-based Genetic Programming approaches have been developed especially in order to mitigate these difficulties. In our experiments, at least one of them (eRBGP) turned out to be a very efficient approach and in most cases, was superior to the other representations.

Web Service Composition Systems for the Web Service Challenge - A Detailed Review

This report gives a detailed discussion on the system, algorithms, and techniques that we have applied in order to solve the Web Service Challenges (WSC) of the years 2006 and 2007. These international contests are focused on semantic web service composition. In each challenge of the contests, a repository of web services is given. The input and output parameters of the services in the repository are annotated with semantic concepts. A query to a semantic composition engine contains a set of available input concepts and a set of wanted output concepts. In order to employ an offered service for a requested role, the concepts of the input parameters of the offered operations must be more general than requested (contravariance). In contrast, the concepts of the output parameters of the offered service must be more specific than requested (covariance). The engine should respond to a query by providing a valid composition as fast as possible. We discuss three different methods for web service composition: an uninformed search in form of an IDDFS algorithm, a greedy informed search based on heuristic functions, and a multi-objective genetic algorithm.

Characterization of the role of Drosophila JAK/STAT signalling in cellular proliferation

Der Janus Kinase / signal transducer and activator of transcription (JAK/STAT) Signal- transduktionsweg wird für viele Entwicklungsvorgänge benötigt und spielt eine zentrale Rolle bei der Hämatopoese und bei der Immunantwort. Obwohl der JAK/STAT-Signalweg in den vergangenen Jahren Gegenstand intensiver Forschung war, erschwert die Redundanz des Signalwegs bei Wirbeltieren genetische Untersuchungen zur Identifizierung derjenigen Mechanismen, die den JAK/STAT-Signalweg regulieren. Der JAK/STAT-Signaltransduktionsweg ist evolutionär konserviert und ebenfalls bei der Taufliege Drosophila melanogaster vorhanden. Im Gegensatz zu Wirbeltieren ist der Signaltransduktionsweg von Drosophila weniger redundant und beinhaltet folgende Hauptkomponenten: den Liganden Unpaired (Upd), den Transmembranrezeptor Domeless (Dome), die einzige JAK-Tyrosinkinase Hopscotch (hop), sowie den Transkriptionsfaktor STAT92E. In der vorliegenden Arbeit wird die Rolle des JAK/STAT-Signalwegs bei der zellulären Proliferation mithilfe der Modellsysteme der Flügel- und der Augen-Imaginalscheiben von Drosophila charakterisiert. "Loss-of-function"- und "Gain-of-function"-Experimente zur Verminderung beziehungs-weise Erhöhung der Signalaktivität zeigten, dass der JAK/STAT-Signalweg eine Rolle bei der zellulären Proliferation der Flügel-Imaginalscheiben spielte, ohne die Zellgröße oder Apoptose zu verändern. Bei der Flügelentwicklung während des zweiten und des frühen dritten Larvalstadiums war die Aktivität des JAK/STAT-Signalwegs sowohl notwendig für die zelluläre Proliferation als auch hinreichend, um Überproliferation anzutreiben. Allerdings änderte sich während der späten dritten Larvalstadien die JAK/STAT-Signalaktivität, sodass endogene STAT92E-Mengen einen anti-proliferativen Effekt im gleichen Gewebe aufwiesen. Weiterhin reichte die ektopische Aktivierung des JAK/STAT-Signalwegs zu diesem späten Entwicklungszeitpunkt aus, um die Mitose zu inhibieren und die Zellen in der Phase G2 des Zellzyklus zu arretieren. Diese Ergebnisse legen den Schluss nahe, dass der JAK/STAT-Signalweg sowohl pro-proliferativ in frühen Flügelscheiben als auch anti-proliferativ zu späten Stadien der Flügelscheiben-Entwicklung wirken kann. Dieser späte anti-proliferative Effekt wurde durch einen nicht-kanonischen Mechanismus der STAT92E-Aktivierung vermittelt, da späte hop defiziente Zellverbände im Vergleich zu Wildtyp-Zellen keine Veränderungen im Ausmaß der zellulären Proliferation aufwiesen. Ferner konnte gezeigt werden, dass eine während der Larvalstadien exprimierte dominant-negative und im N-Terminus deletierte Form von STAT92E (?NSTAT92E) nicht für den anti-proliferativen Effekt verantwortlich ist. Diese Tatsache ist ein weiteres Indiz dafür, dass das vollständige STAT92E den späten anti-proliferativen Effekt verursacht. Um Modulatoren für die von JAK/STAT vermittelte zelluläre Proliferation zu identifieren, wurde ein P-Element-basierter genetischer Interaktions-Screen in einem sensibilisierten genetischen Hintergrund durchgeführt. Insgesamt wurden dazu 2267 unabhängige P-Element-Insertionen auf ihre Wechselwirkung mit der JAK/STAT-Signalaktivität untersucht und 24 interagierende Loci identifiziert. Diese Kandidaten können in folgende Gruppen eingeordnet werden: Zellzyklusproteine, Transkriptionsfaktoren, DNA und RNA bindende Proteine, ein Mikro-RNA-Gen, Komponenten anderer Signaltransduktionswege und Zelladhäsionsproteine. In den meisten Fällen wurden mehrere Allele der interagierenden Kandidatengene getestet. 18 Kandidatengene mit übereinstimmend interagierenden Allelen wurden dann zur weiteren Analyse ausgewählt. Von diesen 18 Kandidaten-Loci wurden 7 mögliche JAK/STAT-Signalwegskomponenten und 6 neue Zielgene des Signalwegs gefunden. Zusammenfassend wurde das Verständnis um STAT92E verbessert. Dieses Protein hat die gleiche Funktion wie das STAT3-Protein der Wirbeltiere und treibt die zelluläre Proliferation voran. Analog zu STAT1 hat STAT92E aber auch einen anti-proliferativen Effekt. Ferner wurden 24 mögliche Modulatoren der JAK/STAT-Signalaktivität identifiziert. Die Charakterisierung dieser Wechselwirkungen eröffnet vielversprechende Wege zu dem Verständnis, wie JAK/STAT die zelluläre Proliferation reguliert und könnte bei der Entwicklung von neuartigen therapeutischen Targets zur Behandlung von Krebskrankheiten und Entwicklungsstörungen beitragen.

Evolving Classifiers - Evolutionary Algorithms in Data Mining

Data mining means to summarize information from large amounts of raw data. It is one of the key technologies in many areas of economy, science, administration and the internet. In this report we introduce an approach for utilizing evolutionary algorithms to breed fuzzy classifier systems. This approach was exercised as part of a structured procedure by the students Achler, Göb and Voigtmann as contribution to the 2006 Data-Mining-Cup contest, yielding encouragingly positive results.

Offline Emergence Engineering For Agent Societies

Many examples for emergent behaviors may be observed in self-organizing physical and biological systems which prove to be robust, stable, and adaptable. Such behaviors are often based on very simple mechanisms and rules, but artificially creating them is a challenging task which does not comply with traditional software engineering. In this article, we propose a hybrid approach by combining strategies from Genetic Programming and agent software engineering, and demonstrate that this approach effectively yields an emergent design for given problems.

Design, implementation and application of a generic framework for integrated regional land-use modeling

Land use is a crucial link between human activities and the natural environment and one of the main driving forces of global environmental change. Large parts of the terrestrial land surface are used for agriculture, forestry, settlements and infrastructure. Given the importance of land use, it is essential to understand the multitude of influential factors and resulting land use patterns. An essential methodology to study and quantify such interactions is provided by the adoption of land-use models. By the application of land-use models, it is possible to analyze the complex structure of linkages and feedbacks and to also determine the relevance of driving forces. Modeling land use and land use changes has a long-term tradition. In particular on the regional scale, a variety of models for different regions and research questions has been created. Modeling capabilities grow with steady advances in computer technology, which on the one hand are driven by increasing computing power on the other hand by new methods in software development, e.g. object- and component-oriented architectures. In this thesis, SITE (Simulation of Terrestrial Environments), a novel framework for integrated regional sland-use modeling, will be introduced and discussed. Particular features of SITE are the notably extended capability to integrate models and the strict separation of application and implementation. These features enable efficient development, test and usage of integrated land-use models. On its system side, SITE provides generic data structures (grid, grid cells, attributes etc.) and takes over the responsibility for their administration. By means of a scripting language (Python) that has been extended by language features specific for land-use modeling, these data structures can be utilized and manipulated by modeling applications. The scripting language interpreter is embedded in SITE. The integration of sub models can be achieved via the scripting language or by usage of a generic interface provided by SITE. Furthermore, functionalities important for land-use modeling like model calibration, model tests and analysis support of simulation results have been integrated into the generic framework. During the implementation of SITE, specific emphasis was laid on expandability, maintainability and usability. Along with the modeling framework a land use model for the analysis of the stability of tropical rainforest margins was developed in the context of the collaborative research project STORMA (SFB 552). In a research area in Central Sulawesi, Indonesia, socio-environmental impacts of land-use changes were examined. SITE was used to simulate land-use dynamics in the historical period of 1981 to 2002. Analogous to that, a scenario that did not consider migration in the population dynamics, was analyzed. For the calculation of crop yields and trace gas emissions, the DAYCENT agro-ecosystem model was integrated. In this case study, it could be shown that land-use changes in the Indonesian research area could mainly be characterized by the expansion of agricultural areas at the expense of natural forest. For this reason, the situation had to be interpreted as unsustainable even though increased agricultural use implied economic improvements and higher farmers' incomes. Due to the importance of model calibration, it was explicitly addressed in the SITE architecture through the introduction of a specific component. The calibration functionality can be used by all SITE applications and enables largely automated model calibration. Calibration in SITE is understood as a process that finds an optimal or at least adequate solution for a set of arbitrarily selectable model parameters with respect to an objective function. In SITE, an objective function typically is a map comparison algorithm capable of comparing a simulation result to a reference map. Several map optimization and map comparison methodologies are available and can be combined. The STORMA land-use model was calibrated using a genetic algorithm for optimization and the figure of merit map comparison measure as objective function. The time period for the calibration ranged from 1981 to 2002. For this period, respective reference land-use maps were compiled. It could be shown, that an efficient automated model calibration with SITE is possible. Nevertheless, the selection of the calibration parameters required detailed knowledge about the underlying land-use model and cannot be automated. In another case study decreases in crop yields and resulting losses in income from coffee cultivation were analyzed and quantified under the assumption of four different deforestation scenarios. For this task, an empirical model, describing the dependence of bee pollination and resulting coffee fruit set from the distance to the closest natural forest, was integrated. Land-use simulations showed, that depending on the magnitude and location of ongoing forest conversion, pollination services are expected to decline continuously. This results in a reduction of coffee yields of up to 18% and a loss of net revenues per hectare of up to 14%. However, the study also showed that ecological and economic values can be preserved if patches of natural vegetation are conservated in the agricultural landscape. -----------------------------------------------------------------------

Global Optimization Algorithms and their Application to Distributed Systems

In this report, we discuss the application of global optimization and Evolutionary Computation to distributed systems. We therefore selected and classified many publications, giving an insight into the wide variety of optimization problems which arise in distributed systems. Some interesting approaches from different areas will be discussed in greater detail with the use of illustrative examples.

Applicability of Emergence Engineering to Distributed Systems Scenarios

Genetic Programming can be effectively used to create emergent behavior for a group of autonomous agents. In the process we call Offline Emergence Engineering, the behavior is at first bred in a Genetic Programming environment and then deployed to the agents in the real environment. In this article we shortly describe our approach, introduce an extended behavioral rule syntax, and discuss the impact of the expressiveness of the behavioral description to the generation success, using two scenarios in comparison: the election problem and the distributed critical section problem. We evaluate the results, formulating criteria for the applicability of our approach.

Managing Quality Properties of Web Service Compositions

Web services from different partners can be combined to applications that realize a more complex business goal. Such applications built as Web service compositions define how interactions between Web services take place in order to implement the business logic. Web service compositions not only have to provide the desired functionality but also have to comply with certain Quality of Service (QoS) levels. Maximizing the users' satisfaction, also reflected as Quality of Experience (QoE), is a primary goal to be achieved in a Service-Oriented Architecture (SOA). Unfortunately, in a dynamic environment like SOA unforeseen situations might appear like services not being available or not responding in the desired time frame. In such situations, appropriate actions need to be triggered in order to avoid the violation of QoS and QoE constraints. In this thesis, proper solutions are developed to manage Web services and Web service compositions with regard to QoS and QoE requirements. The Business Process Rules Language (BPRules) was developed to manage Web service compositions when undesired QoS or QoE values are detected. BPRules provides a rich set of management actions that may be triggered for controlling the service composition and for improving its quality behavior. Regarding the quality properties, BPRules allows to distinguish between the QoS values as they are promised by the service providers, QoE values that were assigned by end-users, the monitored QoS as measured by our BPR framework, and the predicted QoS and QoE values. BPRules facilitates the specification of certain user groups characterized by different context properties and allows triggering a personalized, context-aware service selection tailored for the specified user groups. In a service market where a multitude of services with the same functionality and different quality values are available, the right services need to be selected for realizing the service composition. We developed new and efficient heuristic algorithms that are applied to choose high quality services for the composition. BPRules offers the possibility to integrate multiple service selection algorithms. The selection algorithms are applicable also for non-linear objective functions and constraints. The BPR framework includes new approaches for context-aware service selection and quality property predictions. We consider the location information of users and services as context dimension for the prediction of response time and throughput. The BPR framework combines all new features and contributions to a comprehensive management solution. Furthermore, it facilitates flexible monitoring of QoS properties without having to modify the description of the service composition. We show how the different modules of the BPR framework work together in order to execute the management rules. We evaluate how our selection algorithms outperform a genetic algorithm from related research. The evaluation reveals how context data can be used for a personalized prediction of response time and throughput.