Automated offspring sizing in evolutionary algorithms

Evolutionary Algorithms (EAs) are a class of algorithms inspired by biological evolution. EAs are applicable to a wide range of problems; however, there are a number of parameters to set in order to use an EA. The performance of an EA is extremely sensitive to these parameter values; setting these parameters often requires expert knowledge of EAs. This prevents EAs from being more widely adopted by nonexperts. Parameter control, the automation of dynamic parameter value selection, has the potential to not only alleviate the burden of parameter tuning, but also to improve performance of EAs on a variety of problem classes in comparison to employing fixed parameter values. The science of parameter control in EAs is, however, still in its infancy and most published work in this area has concentrated on just a subset of the standard parameters. In particular, the control of offspring size has so far received very little attention, despite its importance for balancing exploration and exploitation. This thesis introduces three novel methods for controlling offspring size: Self- Adaptive Offspring Sizing (SAOS), Futility-Based Offspring Sizing (FuBOS), and Diversity-Guided Futility-Based Offspring Sizing (DiGFuBOS). EAs employing these methods are compared to each other and a highly tuned, fixed offspring size EA on a wide range of test problems. It is shown that an EA employing FuBOS or DiGFuBOS performs on par with the highly tuned, fixed offspring size EA on many complex problem instances, while being far more efficient in terms of fitness evaluations. Furthermore, DiGFuBOS does not introduce any new user parameters, thus truly alleviating the burden of tuning the offspring size parameter in EAs --Abstract, page iii

Robust evolutionary algorithms

Evolutionary Algorithms (EAs) have shown great potential to solve complex real world problems, but their dependence on problem specific configuration in order to obtain high quality performance prevents EAs from achieving widespread use. While it is widely accepted that statically configuring an EA is already a complex problem, dynamic configuration of an EA is a combinatorially harder problem. Evidence provided here supports the claim that EAs achieve the best results when using dynamic configurations. By designing methods that automatically configure parts of an EA or by changing how EAs work to avoid configurable aspects, EAs can be made more robust, allowing them better performance on a wider variety of problems with less requirements on the user. Two methods are presented in this thesis to increase the robustness of EAs. The first is a novel algorithm designed to automatically configure and dynamically update the recombination method which is used by the EA to exploit known information to create new solutions. The techniques used by this algorithm can likely be applied to other aspects of an EA in the future, leading to even more robust EAs. The second is an existing set of algorithms which only require a single configurable parameter. The analysis of the existing set led to the creation of a new variation, as well as a better understanding of how these algorithms work. Both methods are able to outperform more traditional EAs while also making both easier to apply to new problems. By building upon these methods, and perhaps combining them, EAs can become even more robust and become more widely used --Abstract, page iv

Evolutionary Design of the Memory Subsystem

The memory hierarchy has a high impact on the performance and power consumption in the system. Moreover, current embedded systems, included in mobile devices, are specifically designed to run multimedia applications, which are memory intensive. This increases the pressure on the memory subsystem and affects the performance and energy consumption. In this regard, the thermal problems, performance degradation and high energy consumption, can cause irreversible damage to the devices. We address the optimization of the whole memory subsystem with three approaches integrated as a single methodology. Firstly, the thermal impact of register file is analyzed and optimized. Secondly, the cache memory is addressed by optimizing cache configuration according to running applications and improving both performance and power consumption. Finally, we simplify the design and evaluation process of general-purpose and customized dynamic memory manager, in the main memory. To this aim, we apply different evolutionary algorithms in combination with memory simulators and profiling tools. This way, we are able to evaluate the quality of each candidate solution and take advantage of the exploration of solutions given by the optimization algorithm.We also provide an experimental experience where our proposal is assessed using well-known benchmark applications

An Inservice Program for Developing Teacher Lesson Plans

This paper deals with change and the inservice program that brought about the change. A log is included that documents the process from the establishment of need, through three workshops that direct the change, to the final writing of a manual of yearly goals and objectives for each teacher participant. The writer of the paper is an elementary principal of a small rural school. The faculty participants were both elementary and high school teachers who were deeply ingrained in unchanging teaching methods. Several had taught in their fields for so long that they felt no need of establishing a plan for teaching, much less the need for lesson plans for substitute teacher use. The inservice program employed the use of a consultant and was funded through a grant from the Illinois Center for Educational Improvement. Stipends were paid to all participants from these funds, as well as consultant expenses and printing costs. Many of the problems that developed in the inservice process were attitudinal, brought about by teacher anxiety as it related to evaluation and accountability. The writer cites specific instances of teacher hostility and gives examples of techniques used to solicit a more cooperative attitude. By allowing the teachers to include the conditions that worked for and against instruction, and to itemize material needs, the writer explains how the teachers were guided toward the belief that the project would help them become better teachers and improve their working conditions. An appendix is included with the paper to illustrate this and the form taken by the goals and objective manual. The paper concludes with an analysis of the activity and makes reference both to the successes and failures of the activity. Plans for the ongoing use of the inservice program and a brief outline of the activity\u27s usefulness in developing a minimal competency test for the writer\u27s school district, are included

The consolations of ambiguity : an essay on the novels of Anthony Burgess

Morris investigates the existential crises that heroes face in the novels of Anthony Burgess. When forced to confront an unsympathetic reality, these heroes use introspection as a means of internal metamorphosis, not only to confront their external struggle, but also to test of their character.The consolations of ambiguity -- Soldier-sinner, spy-saint -- Malaise in Malaya -- State and statement -- The bitter fruits of freedom -- Inderby, outerby, enderby.Digitized at the University of Missouri--Columbia MU Libraries Digitization Lab in 2012. Digitized at 600 dpi with Zeutschel, OS 15000 scanner. Access copy, available in MOspace, is 400 dpi, grayscale