Representations of swinging London in 1960s British cinema : Blowup (1966), Smashing Time (1967), and Performance (1970)

This thesis explores the representation of Swinging London in three examples of 1960s British cinema: Blowup (Michelangelo Antonioni, 1966), Smashing Time (Desmond Davis, 1967) and Performance (Donald Cammell and Nicolas Roeg, 1970). It suggests that the films chronologically signify the evolution, commodification and dissolution of the Swinging London era. The thesis explores how the concept of Swinging London is both critiqued and perpetuated in each film through the use of visual tropes: the reconstruction of London as a cinematic space; the Pop photographer; the dolly; representations of music performance and fashion; the appropriation of signs and symbols associated with the visual culture of Swinging London. Using fashion, music performance, consumerism and cultural symbolism as visual narratives, each film also explores the construction of youth identity through the representation of manufactured and mediated images. Ultimately, these films reinforce Swinging London as a visual economy that circulates media images as commodities within a system of exchange. With this in view, the signs and symbols that comprise the visual culture of Swinging London are as central and significant to the cultural era as their material reality. While they attempt to destabilize prevailing representations of the era through the reproduction and exchange of such symbols, Blowup, Smashing Time, and Performance nevertheless contribute to the nostalgia for Swinging London in larger cultural memory.

Enabling and Measuring Complexity in Evolving Designs using Generative Representations for Artificial Architecture

As the complexity of evolutionary design problems grow, so too must the quality of solutions scale to that complexity. In this research, we develop a genetic programming system with individuals encoded as tree-based generative representations to address scalability. This system is capable of multi-objective evaluation using a ranked sum scoring strategy. We examine Hornby's features and measures of modularity, reuse and hierarchy in evolutionary design problems. Experiments are carried out, using the system to generate three-dimensional forms, and analyses of feature characteristics such as modularity, reuse and hierarchy were performed. This work expands on that of Hornby's, by examining a new and more difficult problem domain. The results from these experiments show that individuals encoded with those three features performed best overall. It is also seen, that the measures of complexity conform to the results of Hornby. Moving forward with only this best performing encoding, the system was applied to the generation of three-dimensional external building architecture. One objective considered was passive solar performance, in which the system was challenged with generating forms that optimize exposure to the Sun. The results from these and other experiments satisfied the requirements. The system was shown to scale well to the architectural problems studied.

A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations

Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.