MiniAMR - A miniapp for Adaptive Mesh Refinement

This report describes the detailed implementation of MiniAMR - a software for octree-based adaptive mesh refinement (AMR) that can be used to study the communication costs in a typical AMR simulation. We have designed new data structures and refinement/coarsening algorithms for octree-based AMR and studied the performance improvements using a similar software from Sandia National Laboratory. We have also introduced the idea of amortized load balancing to AMR in this report. In addition to this, we have also provided a low-overhead distributed load balancing scheme for AMR applications that perform sub-cycling (refinement in time).Ope

Space-time patterns of urban sprawl, a 1D cellular automata and microeconomic approach

We present a theoretical model of residential growth that emphasizes the path-dependent nature of urban sprawl patterns. The model is founded on the monocentric urban economic model and uses a cellular automata (CA) approach to introduce endogenous neighbourhood effects. Households are assumed to both like and dislike the density of their neighbourhood, and trade-off this density with housing space consumption and commuting costs. Discontinuous spatial patterns emerge from that trade-off, with the size of suburban clusters varying with time and distance to the centre. We use space-time diagrams inspired from 1D elementary CA to visualize changes in spatial patterns through time and space, and undertake sensitivity analyses to show how the pattern and timing of sprawl are affected by neighbourhood preferences, income level, commuting costs or by imposing a green belt.urban sprawl, open space, neighbourhood externalities, cellular automata, residential dynamics.

An investigation into Quadtree fractal image and video compression

Digital imaging is the representation of drawings, photographs and pictures in a format that can be displayed and manipulated using a conventional computer. Digital imaging has enjoyed increasing popularity over recent years, with the explosion of digital photography, the Internet and graphics-intensive applications and games. Digitised images, like other digital media, require a relatively large amount of storage space. These storage requirements can become problematic as demands for higher resolution images increases and the resolution capabilities of digital cameras improve. It is not uncommon for a personal computer user to have a collection of thousands of digital images, mainly photographs, whilst the Internet’s Web pages present a practically infinite source. These two factors 一 image size and abundance 一 inevitably lead to a storage problem. As with other large files, data compression can help reduce these storage requirements. Data compression aims to reduce the overall storage requirements for a file by minimising redundancy. The most popular image compression method, JPEG, can reduce the storage requirements for a photographic image by a factor of ten whilst maintaining the appearance of the original image 一 or can deliver much greater levels of compression with a slight loss of quality as a trade-off. Whilst JPEG's efficiency has made it the definitive image compression algorithm, there is always a demand for even greater levels of compression and as a result new image compression techniques are constantly being explored. One such technique utilises the unique properties of Fractals. Fractals are relatively small mathematical formulae that can be used to generate abstract and often colourful images with infinite levels of detail. This property is of interest in the area of image compression because a detailed, high-resolution image can be represented by a few thousand bytes of formulae and coefficients rather than the more typical multi-megabyte filesizes. The real challenge associated with Fractal image compression is to determine the correct set of formulae and coefficients to represent the image a user is trying to compress; it is trivial to produce an image from a given formula but it is much, much harder to produce a formula from a given image. เท theory, Fractal compression can outperform JPEG for a given image and quality level, if the appropiate formulae can be determined. Fractal image compression can also be applied to digital video sequences, which are typically represented by a long series of digital images 一 or 'frames'

Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)

We consider a model of algorithmic self-assembly of geometric shapes out of square Wang tiles studied in SODA 2010, in which there are two types of tiles (e.g., constructed out of DNA and RNA material) and one operation that destroys all tiles of a particular type (e.g., an RNAse enzyme destroys all RNA tiles). We show that a single use of this destruction operation enables much more efficient construction of arbitrary shapes. In particular, an arbitrary shape can be constructed using an asymptotically optimal number of distinct tile types (related to the shape's Kolmogorov complexity), after scaling the shape by only a logarithmic factor. By contrast, without the destruction operation, the best such result has a scale factor at least linear in the size of the shape, and is connected only by a spanning tree of the scaled tiles. We also characterize a large collection of shapes that can be constructed efficiently without any scaling

Radio frequency channel characterization for energy harvesting in factory environments

This thesis presents ambient energy data obtained from a measurement campaign carried out at an automobile plant. At the automobile plant, ambient light, ambient temperature and ambient radio frequency were measured during the day time over two days. The measurement results showed that ambient light generated the highest DC power. For plant and operation managers at the automobile plant, the measurement data can be used in system design considerations for future energy harvesting wireless sensor nodes at the plant. In addition, wideband measurements obtained from a machine workshop are presented in this thesis. The power delay profile of the wireless channel was obtained by using a frequency domain channel sounding technique. The measurements were compared with an equivalent ray tracing model in order to validate the suitability of the commercial propagation software used in this work. Furthermore, a novel technique for mathematically recreating the time dispersion created by factory inventory in a radio frequency channel is discussed. As a wireless receiver design parameter, delay spread characterizes the amplitude and phase response of the radio channel. In wireless sensor devices, this becomes paramount, as it determines the complexity of the receiver. In reality, it is sometimes difficult to obtain full detail floor plans of factories for deterministic modelling or carry out spot measurements during building construction. As a result, radio provision may be suboptimal. The method presented in this thesis is based on 3-D fractal geometry. By employing the fractal overlaying algorithm presented, metallic objects can be placed on a floor plan so as to obtain similar radio frequency channel effects. The environment created using the fractal approach was used to estimate the amount of energy a harvesting device can accumulate in a University machine workshop space

Inverse Design of Three-Dimensional Frequency Selective Structures and Metamaterials using Multi-Objective Lazy Ant Colony Optimization

With the rise of big data and the “internet of things,” wireless signals permeate today’s environment more than ever before. As the demand for information and security continues to expand, the need for filtering a crowded signal space will become increasingly important. Although existing devices can achieve this with additional components, such as in-line filters and low noise amplifiers, these approaches introduce additional bulk, cost and complexity. An alternative, low-cost solution to filtering these signals can be achieved through the use of Frequency Selective Surfaces (FSSs), which are commonly used in antennas, polarizers, radomes, and intelligent architecture. FSSs typically consist of a doubly-periodic array of unit cells, which acts as a spatial electromagnetic filter that selectively rejects or transmits electromagnetic waves, based on the unit cell’s geometry and material properties. Unlike traditional analog filters, spatial filters must also account for the polarization and incidence angle of signals; thus, an ideal FSS maintains a given frequency response for all polarizations and incidence angles. Traditional FSS designs have ranged from planar structures with canonical shapes to miniaturized and multi-layer designs using fractals and other space-filling geometries. More recently, FSS research has expanded into three-dimensional (3D) designs, which have demonstrated enhanced fields of view over traditional planar and multi-layer designs. To date, nearly all FSSs still suffer from significant shifts in resonant frequencies or onset of grating lobes at incidence angles beyond 60 degrees in one or more polarizations. Additionally, while recent advances in additive manufacturing techniques have made fully 3D FSS designs increasingly popular, design tools to exploit these fabrication methods to develop FSSs with ultra-wide Fields of View (FOV) do not currently exist. In this dissertation, a Multi-Objective Lazy Ant Colony Optimization (MOLACO) scheme will be introduced and applied to the problem of 3D FSS design for extreme FOVs. The versatility of this algorithm will further be demonstrated through application to the design of meander line antennas, optical antennas, and phase-gradient metasurfaces

Entwurf und Implementation einer auf Graph-Grammatiken beruhenden Sprache zur Funktions-Struktur-Modellierung von Pflanzen

Increasing biological knowledge requires more and more elaborate methods to translate the knowledge into executable model descriptions, and increasing computational power allows to actually execute these descriptions. Such a simulation helps to validate, extend and question the knowledge. For plant modelling, the well-established formal description language of Lindenmayer systems reaches its limits as a method to concisely represent current knowledge and to conveniently assist in current research. On one hand, it is well-suited to represent structural and geometric aspects of plant models - of which units is a plant composed, how are these connected, what is their location in 3D space -, but on the other hand, its usage to describe functional aspects - what internal processes take place in the plant structure, how does this interact with the structure - is not as convenient as desirable. This can be traced back to the underlying representation of structure as a linear chain of units, while the intrinsic nature of the structure is a tree or even a graph. Therefore, we propose to use graphs and graph grammars as a basis for plant modelling which combines structural and functional aspects. In the first part of this thesis, we develop the necessary theoretical framework. Starting with a presentation of the state of the art concerning Lindenmayer systems and graph grammars, we develop the formalism of relational growth grammars as a variant of graph grammars. We show that this formalism has a natural embedding of Lindenmayer systems which keeps all relevant properties, but represents branched structures directly as axial trees and not as linear chains with indirect encoding of branches. In the second part, we develop the main practical result, the XL programming language as an extension of the Java programming language by very general rule-based features. Short examples illustrate the application of the new language features. We describe the built-in pattern matching algorithm of the implemented run-time system for the XL programming language, and we sketch a possible implementation of an XL compiler. The third part is an application of relational growth grammars and the XL programming language. We show how the general XL interfaces can be customized for relational growth grammars. On top of this customization, several examples from a variety of disciplines demonstrate the usefulness of the developed formalism and language to describe plant growth, especially functional-structural plant models, but also artificial life, architecture or interactive games. Some examples operate on custom graphs like XML DOM trees or scene graphs of commercial 3D modellers, while the majority uses the 3D modelling platform GroIMP, a software developed in conjunction with this thesis. The appendix gives an overview of the GroIMP software. The practical usage of its plug-in for relational growth grammars is also illustrated.Das zunehmende Wissen über biologische Prozesse verlangt nach geeigneten Methoden, es in ausführbare Modelle zu übersetzen, und die zunehmende Rechenleistung der Computer ermöglicht es, diese Modelle auch tatsächlich auszuführen. Solche Simulationen dienen zur Validierung, Erweiterung und Hinterfragung des Wissens. Speziell für die Pflanzenmodellierung wurden Lindenmayer-Systeme mit Erfolg eingesetzt, jedoch stoßen diese bei aktuellen Modellierungsproblemen und Forschungsvorhaben an ihre Grenzen. Zwar sind sie gut geeignet, Pflanzenstruktur und Geometrie abzubilden - aus welchen Einheiten setzt sich eine Pflanze zusammen, wie sind diese verbunden, wie ist ihre räumliche Lage -, aber die lineare Datenstruktur erschwert die Integration von Funktionsmodellen, welche Prozesse innerhalb der verzweigten Struktur und des beanspruchten Raumes beschreiben. Daher wird in dieser Arbeit vorgeschlagen, anstelle der linearen Stuktur Graphen und Graph-Grammatiken als Grundlage für die kombinierte Funktions-Struktur-Modellierung von Pflanzen zu verwenden. Im ersten Teil der Dissertation wird der theoretische Unterbau entwickelt. Nach einer Vorstellung des aktuellen Wissensstandes auf dem Gebiet der Lindenmayer-Systeme und Graph-Grammatiken werden relationale Wachstumsgrammatiken eingeführt, die auf bekannten Mechanismen für parallele Graph-Grammatiken aufbauen und Lindenmayer-Systeme als Spezialfall enthalten, dabei jedoch verzweigte Strukturen direkt als axiale Bäume darstellen. Zur praktischen Anwendung wird im zweiten Teil die Programmiersprache XL entwickelt, die Java um allgemein gehaltene Sprachkonstrukte für Graph-Grammatiken erweitert. Kurze Beispiele zeigen die Anwendung der neuen Sprachmerkmale. Der Algorithmus zur Mustersuche wird erläutert, und die Implementation des XL-Compilers wird vorgestellt. Im dritten Teil werden mögliche Anwendungen relationaler Wachstumsgrammatiken aufgezeigt. Dazu werden zunächst die allgemeinen XL-Schnittstellen für relationale Wachstumsgrammatiken konkretisiert, um dieses System dann für Modelle aus verschiedenen Bereichen zu nutzen, darunter Funktions-Struktur-Modelle von Pflanzen, Künstliches Leben, Architektur und interaktive Spiele. Einige Beispiele nutzen spezifische Graphen wie XML-DOM-Bäume oder Szenengraphen kommerzieller 3D-Modellierprogramme, aber der überwiegende Teil baut auf der 3D-Plattform GroIMP auf, die zusammen mit dieser Dissertation entwickelt wurde. Im Anhang wird die Software GroIMP kurz vorgestellt und ihre praktische Anwendung für relationale Wachstumsgrammatiken erläutert