Finding Edges and Lines in Images

The problem of detecting intensity changes in images is canonical in vision. Edge detection operators are typically designed to optimally estimate first or second derivative over some (usually small) support. Other criteria such as output signal to noise ratio or bandwidth have also been argued for. This thesis is an attempt to formulate a set of edge detection criteria that capture as directly as possible the desirable properties of an edge operator. Variational techniques are used to find a solution over the space of all linear shift invariant operators. The first criterion is that the detector have low probability of error i.e. failing to mark edges or falsely marking non-edges. The second is that the marked points should be as close as possible to the centre of the true edge. The third criterion is that there should be low probability of more than one response to a single edge. The technique is used to find optimal operators for step edges and for extended impulse profiles (ridges or valleys in two dimensions). The extension of the one dimensional operators to two dimentions is then discussed. The result is a set of operators of varying width, length and orientation. The problem of combining these outputs into a single description is discussed, and a set of heuristics for the integration are given.

An empirical 3D model of the large-scale coronal structure based on the distribution of H? filaments on the solar disk

Morgan, H.; Habbal, S. R., An empirical 3D model of the large-scale coronal structure based on the distribution of H? filaments on the solar disk, Astronomy and Astrophysics, Volume 464, Issue 1, March II 2007, pp.357-365

ROSSI: Emergence of communication in Robots through Sensorimotor and Social Interaction

ROSSI: Emergence of communication in Robots through Sensorimotor and Social Interaction, T. Ziemke, A. Borghi, F. Anelli, C. Gianelli, F. Binkovski, G. Buccino, V. Gallese, M. Huelse, M. Lee, R. Nicoletti, D. Parisi, L. Riggio, A. Tessari, E. Sahin, International Conference on Cognitive Systems (CogSys 2008), University of Karlsruhe, Karlsruhe, Germany, 2008 Sponsorship: EU-FP7

Johnny's in the Basement: Keats, Bob Dylan and Influence

Marggraf Turley, Richard, 'Johnny's in the Basement: Keats, Bob Dylan and Influence', In: 'The Monstrous Debt: Modalities of Romantic Influence in Twentieth Century Literature', (Detroit, MI: Wayne State University Press), pp.181-204, 2006 RAE2008

The Politics of Language in Romantic Literature

Marggraf Turley, R. (2002). The Politics of Language in Romantic Literature. Basingstoke: Palgrave Macmillan. RAE2008

Approaching the Unapproached Light: Milton and the Romantic Visionary

Shears, J. (2006). Approaching the Unapproached Light: Milton and the Romantic Visionary. In G. Hopps and J. Stabler (Eds.), Romanticism and Religion from William Cowper to Wallace Stevens (pp.25-40). The Nineteenth Century Series. Aldershot: Ashgate. RAE2008

Keats's Boyish Imagination

Marggraf Turley, Richard, Keats's Boyish Imagination (New York: Routledge, 2003) RAE2008

Gadamer, History and the Classics: Fugard, Marowitz, Berkoff and Harrison Rewrite the Theatre

Forsyth, A. (2002). Gadamer, History and the Classics: Fugard, Marowitz, Berkoff and Harrison Rewrite the Theatre. Studies in Literary Criticism and Theory: Vol. 15. New York: Peter Lang. RAE2008

Birkhoff normal forms for Fourier integral operators II

Iantchenko, A.; Sj?strand, J., (2001) 'Birkhoff normal forms for Fourier integral operators II', American Journal of Mathematics 124(4) pp.817-850 RAE2008

Integration of relational and hierarchical network information for protein function prediction

BACKGROUND:In the current climate of high-throughput computational biology, the inference of a protein's function from related measurements, such as protein-protein interaction relations, has become a canonical task. Most existing technologies pursue this task as a classification problem, on a term-by-term basis, for each term in a database, such as the Gene Ontology (GO) database, a popular rigorous vocabulary for biological functions. However, ontology structures are essentially hierarchies, with certain top to bottom annotation rules which protein function predictions should in principle follow. Currently, the most common approach to imposing these hierarchical constraints on network-based classifiers is through the use of transitive closure to predictions.RESULTS:We propose a probabilistic framework to integrate information in relational data, in the form of a protein-protein interaction network, and a hierarchically structured database of terms, in the form of the GO database, for the purpose of protein function prediction. At the heart of our framework is a factorization of local neighborhood information in the protein-protein interaction network across successive ancestral terms in the GO hierarchy. We introduce a classifier within this framework, with computationally efficient implementation, that produces GO-term predictions that naturally obey a hierarchical 'true-path' consistency from root to leaves, without the need for further post-processing.CONCLUSION:A cross-validation study, using data from the yeast Saccharomyces cerevisiae, shows our method offers substantial improvements over both standard 'guilt-by-association' (i.e., Nearest-Neighbor) and more refined Markov random field methods, whether in their original form or when post-processed to artificially impose 'true-path' consistency. Further analysis of the results indicates that these improvements are associated with increased predictive capabilities (i.e., increased positive predictive value), and that this increase is consistent uniformly with GO-term depth. Additional in silico validation on a collection of new annotations recently added to GO confirms the advantages suggested by the cross-validation study. Taken as a whole, our results show that a hierarchical approach to network-based protein function prediction, that exploits the ontological structure of protein annotation databases in a principled manner, can offer substantial advantages over the successive application of 'flat' network-based methods.

Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN

Formal correctness of complex multi-party network protocols can be difficult to verify. While models of specific fixed compositions of agents can be checked against design constraints, protocols which lend themselves to arbitrarily many compositions of agents-such as the chaining of proxies or the peering of routers-are more difficult to verify because they represent potentially infinite state spaces and may exhibit emergent behaviors which may not materialize under particular fixed compositions. We address this challenge by developing an algebraic approach that enables us to reduce arbitrary compositions of network agents into a behaviorally-equivalent (with respect to some correctness property) compact, canonical representation, which is amenable to mechanical verification. Our approach consists of an algebra and a set of property-preserving rewrite rules for the Canonical Homomorphic Abstraction of Infinite Network protocol compositions (CHAIN). Using CHAIN, an expression over our algebra (i.e., a set of configurations of network protocol agents) can be reduced to another behaviorally-equivalent expression (i.e., a smaller set of configurations). Repeated applications of such rewrite rules produces a canonical expression which can be checked mechanically. We demonstrate our approach by characterizing deadlock-prone configurations of HTTP agents, as well as establishing useful properties of an overlay protocol for scheduling MPEG frames, and of a protocol for Web intra-cache consistency.

Modal Matching for Correspondence and Recognition

Modal matching is a new method for establishing correspondences and computing canonical descriptions. The method is based on the idea of describing objects in terms of generalized symmetries, as defined by each object's eigenmodes. The resulting modal description is used for object recognition and categorization, where shape similarities are expressed as the amounts of modal deformation energy needed to align the two objects. In general, modes provide a global-to-local ordering of shape deformation and thus allow for selecting which types of deformations are used in object alignment and comparison. In contrast to previous techniques, which required correspondence to be computed with an initial or prototype shape, modal matching utilizes a new type of finite element formulation that allows for an object's eigenmodes to be computed directly from available image information. This improved formulation provides greater generality and accuracy, and is applicable to data of any dimensionality. Correspondence results with 2-D contour and point feature data are shown, and recognition experiments with 2-D images of hand tools and airplanes are described.

Claude McKay and the transnational novel

This thesis considers the three works of fiction of the Jamaican author Claude McKay (1889-1948) as a coherent transnational trilogy which dramatises the semi-autobiographical complexities of diasporic exile and return in the period of the 1920s and 1930s. Chapter One explores McKay’s urban North American novel, Home to Harlem (1928). I suggest that we need to ‘reworld’ conceptions of McKay’s writing in order to release him from his canonical confinement in the Harlem Renaissance. Querying the problematics of the city space, of sexuality and of race as they emerge in the novel, this chapter considers McKay’s percipient understanding of the need to reconfigure diasporic identity beyond the limits set by American nationalism. Chapter Two engages with McKay’s novel of portside Marseilles, Banjo (1929), and considers the homosocial interactions of the vagabond collective. A comparison of North America and France as supposed exemplars of individual liberty highlights the unsuitability of nationalistic prerogatives to an internally diverse black diaspora. Paul Gilroy’s Black Atlantic construct provides a suggestive space in which to re-imagine the possibilities of affiliation in the port. The latter section of the chapter examines McKay’s particular influence on, and relationship, to the Négritude movement and Pan-African philosophies. Chapter Three focuses on McKay’s third novel, Banana Bottom (1933). I suggest here that the three novels comprise a coherent New World Trilogy comparable to Edward (Kamau) Brathwaite’s trilogy, The Arrivants. This chapter considers both the Caribbean and the transnational dimensions to McKay’s work.

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.

Who pays and who plays? Mapping the discourse of publicly funded instrumental music education in Ireland

Instrumental music education is provided as an extra-curricular activity on a fee-paying basis by a small number of Education and Training Boards, formerly Vocational Education Committees (ETB/VECs) through specialist instrumental Music Services. Although all citizens’ taxes fund the public music provision, participation in instrumental music during school-going years is predominantly accessed by middle class families. A series of semistructured interviews sought to access the perceptions and beliefs of instrumental music education practitioners (N=14) in seven publicly-funded music services in Ireland. Canonical dispositions were interrogated and emergent themes were coded and analysed in a process of Grounded theory. The study draws on Foucault’s conception of discourse as a lens with which to map professional practices, and utilises Bourdieu’s analysis of the reproduction of social advantage to examine cultural assumptions, which may serve to privilege middle-class cultural choice to the exclusion of other social groups. Study findings show that within the Music Services, aesthetic and pedagogic discourses of the 19th century Conservatory system exert a hegemonic influence over policy and practice. An enduring ‘examination culture’ located within the Western art music tradition determines pedagogy, musical genre, and assessment procedures. Ideologies of musical taste and value reinforce the more tangible boundaries of fee-payment and restricted availability as barriers to access. Practitioners are aware of a status duality whereby instrumental teachers working as visiting specialists in primary schools experience a conflict between specialist and generalist educational aims. Nevertheless, study participants consistently advocated siting the point of access to instrumental music education in the primary schools as the most equitable means of access to instrumental music education. This study addresses a ‘knowledge gap’ in the sociology of music education in Ireland. It provides a framework for rethinking instrumental music education as equitable in-school musical participation. The conclusions of the study suggest starting-points for further educational research and may provide key ‘prompts’ for curriculum planning.