Uncertainty visualization in 3D scalar data

One problem in most three-dimensional (3D) scalar data visualization techniques is that they often overlook to depict uncertainty that comes with the 3D scalar data and thus fail to faithfully present the 3D scalar data and have risks which may mislead users’ interpretations, conclusions or even decisions. Therefore this thesis focuses on the study of uncertainty visualization in 3D scalar data and we seek to create better uncertainty visualization techniques, as well as to find out the advantages/disadvantages of those state-of-the-art uncertainty visualization techniques. To do this, we address three specific hypotheses: (1) the proposed Texture uncertainty visualization technique enables users to better identify scalar/error data, and provides reduced visual overload and more appropriate brightness than four state-of-the-art uncertainty visualization techniques, as demonstrated using a perceptual effectiveness user study. (2) The proposed Linked Views and Interactive Specification (LVIS) uncertainty visualization technique enables users to better search max/min scalar and error data than four state-of-the-art uncertainty visualization techniques, as demonstrated using a perceptual effectiveness user study. (3) The proposed Probabilistic Query uncertainty visualization technique, in comparison to traditional Direct Volume Rendering (DVR) methods, enables radiologists/physicians to better identify possible alternative renderings relevant to a diagnosis and the classification probabilities associated to the materials appeared on these renderings; this leads to improved decision support for diagnosis, as demonstrated in the domain of medical imaging. For each hypothesis, we test it by following/implementing a unified framework that consists of three main steps: the first main step is uncertainty data modeling, which clearly defines and generates certainty types of uncertainty associated to given 3D scalar data. The second main step is uncertainty visualization, which transforms the 3D scalar data and their associated uncertainty generated from the first main step into two-dimensional (2D) images for insight, interpretation or communication. The third main step is evaluation, which transforms the 2D images generated from the second main step into quantitative scores according to specific user tasks, and statistically analyzes the scores. As a result, the quality of each uncertainty visualization technique is determined.

Axial symmetry and transverse trace-free tensors in numerical relativity

Transverse trace-free (TT) tensors play an important role in the initial conditions of numerical relativity, containing two of the component freedoms. Expressing a TT tensor entirely, by the choice of two scalar potentials, is not a trivial task however. Assuming the added condition of axial symmetry, expressions are given in both spherical and cylindrical coordinates, for TT tensors in flat space. A coordinate relation is then calculated between the scalar potentials of each coordinate system. This is extended to a non-flat space, though only one potential is found. The remaining equations are reduced to form a second order partial differential equation in two of the tensor components. With the axially symmetric flat space tensors, the choice of potentials giving Bowen-York conformal curvatures, are derived. A restriction is found for the potentials which ensure an axially symmetric TT tensor, which is regular at the origin, and conditions on the potentials, which give an axially symmetric TT tensor with a spherically symmetric scalar product, are also derived. A comparison is made of the extrinsic curvatures of the exact Kerr solution and numerical Bowen-York solution for axially symmetric black hole space-times. The Brill wave, believed to act as the difference between the Kerr and Bowen-York space-times, is also studied, with an approximate numerical solution found for a mass-factor, under different amplitudes of the metric.

Gröbner basis techniques for certain problems in coding and systems theory

There is much common ground between the areas of coding theory and systems theory. Fitzpatrick has shown that a Göbner basis approach leads to efficient algorithms in the decoding of Reed-Solomon codes and in scalar interpolation and partial realization. This thesis simultaneously generalizes and simplifies that approach and presents applications to discrete-time modeling, multivariable interpolation and list decoding. Gröbner basis theory has come into its own in the context of software and algorithm development. By generalizing the concept of polynomial degree, term orders are provided for multivariable polynomial rings and free modules over polynomial rings. The orders are not, in general, unique and this adds, in no small way, to the power and flexibility of the technique. As well as being generating sets for ideals or modules, Gröbner bases always contain a element which is minimal with respect tot the corresponding term order. Central to this thesis is a general algorithm, valid for any term order, that produces a Gröbner basis for the solution module (or ideal) of elements satisfying a sequence of generalized congruences. These congruences, based on shifts and homomorphisms, are applicable to a wide variety of problems, including key equations and interpolations. At the core of the algorithm is an incremental step. Iterating this step lends a recursive/iterative character to the algorithm. As a consequence, not all of the input to the algorithm need be available from the start and different "paths" can be taken to reach the final solution. The existence of a suitable chain of modules satisfying the criteria of the incremental step is a prerequisite for applying the algorithm.

Hardware design of cryptographic accelerators

With the rapid growth of the Internet and digital communications, the volume of sensitive electronic transactions being transferred and stored over and on insecure media has increased dramatically in recent years. The growing demand for cryptographic systems to secure this data, across a multitude of platforms, ranging from large servers to small mobile devices and smart cards, has necessitated research into low cost, flexible and secure solutions. As constraints on architectures such as area, speed and power become key factors in choosing a cryptosystem, methods for speeding up the development and evaluation process are necessary. This thesis investigates flexible hardware architectures for the main components of a cryptographic system. Dedicated hardware accelerators can provide significant performance improvements when compared to implementations on general purpose processors. Each of the designs proposed are analysed in terms of speed, area, power, energy and efficiency. Field Programmable Gate Arrays (FPGAs) are chosen as the development platform due to their fast development time and reconfigurable nature. Firstly, a reconfigurable architecture for performing elliptic curve point scalar multiplication on an FPGA is presented. Elliptic curve cryptography is one such method to secure data, offering similar security levels to traditional systems, such as RSA, but with smaller key sizes, translating into lower memory and bandwidth requirements. The architecture is implemented using different underlying algorithms and coordinates for dedicated Double-and-Add algorithms, twisted Edwards algorithms and SPA secure algorithms, and its power consumption and energy on an FPGA measured. Hardware implementation results for these new algorithms are compared against their software counterparts and the best choices for minimum area-time and area-energy circuits are then identified and examined for larger key and field sizes. Secondly, implementation methods for another component of a cryptographic system, namely hash functions, developed in the recently concluded SHA-3 hash competition are presented. Various designs from the three rounds of the NIST run competition are implemented on FPGA along with an interface to allow fair comparison of the different hash functions when operating in a standardised and constrained environment. Different methods of implementation for the designs and their subsequent performance is examined in terms of throughput, area and energy costs using various constraint metrics. Comparing many different implementation methods and algorithms is nontrivial. Another aim of this thesis is the development of generic interfaces used both to reduce implementation and test time and also to enable fair baseline comparisons of different algorithms when operating in a standardised and constrained environment. Finally, a hardware-software co-design cryptographic architecture is presented. This architecture is capable of supporting multiple types of cryptographic algorithms and is described through an application for performing public key cryptography, namely the Elliptic Curve Digital Signature Algorithm (ECDSA). This architecture makes use of the elliptic curve architecture and the hash functions described previously. These components, along with a random number generator, provide hardware acceleration for a Microblaze based cryptographic system. The trade-off in terms of performance for flexibility is discussed using dedicated software, and hardware-software co-design implementations of the elliptic curve point scalar multiplication block. Results are then presented in terms of the overall cryptographic system.

Landscapes of kingship in early medieval Ireland, AD 400–1150

This thesis explores the evolution of kingship in early medieval Ireland (AD 400–1150) through a kingdom based and multi-scalar approach to royal landscapes. Through exploring the role of place and landscape in the construction of early medieval Irish kingship, this study will assess the relationship between the social, economic and ideological roles of the king in Irish society. Kingship in Ireland was vested in places, such that royal landscapes were the pre-eminent symbol of regality and authority. As such, an interdisciplinary study of kingship grounded in archaeological methodologies has a unique potential to contribute to our knowledge of the practice of kingship. Consequently, this research considers the material apparatus of different scales of kingships and explores the role of landscape in the construction of kingship and the evolution of kingdoms. It takes two major case studies; (i) Cashel, Munster and the Éoganachta federation; and (ii) the Uí Néill, Tara and the Síl nÁedo Sláine kingdom of Brega. Through interdisciplinary methodologies it charts the genesis and development of political federations, focusing specifically on the role that royal landscapes’ played in their evolution. Similarly, this thesis engages critically with the nature of assembly places and practices in Ireland, and focuses specifically on issues pertaining to the nature of assembly and the archaeological manifestation of such practices. It includes a list of 115 landscapes identified as assembly places, and through the analysis of this material, this thesis examines the ways in which different types of royal sites articulated together to create royal landscapes implicated in the exercise of kingship, and the construction and maintenance of authority. Moreover, through the analysis of assembly places within the context of the development of kingdoms, and structures of jurisdiction and administration, it also investigates the evolution of supra-regional scales of identity and community associated with the emergence of major political federations in early medieval Ireland.