19,727 research outputs found

    Image classification over unknown and anomalous domains

    Get PDF
    A longstanding goal in computer vision research is to develop methods that are simultaneously applicable to a broad range of prediction problems. In contrast to this, models often perform best when they are specialized to some task or data type. This thesis investigates the challenges of learning models that generalize well over multiple unknown or anomalous modes and domains in data, and presents new solutions for learning robustly in this setting. Initial investigations focus on normalization for distributions that contain multiple sources (e.g. images in different styles like cartoons or photos). Experiments demonstrate the extent to which existing modules, batch normalization in particular, struggle with such heterogeneous data, and a new solution is proposed that can better handle data from multiple visual modes, using differing sample statistics for each. While ideas to counter the overspecialization of models have been formulated in sub-disciplines of transfer learning, e.g. multi-domain and multi-task learning, these usually rely on the existence of meta information, such as task or domain labels. Relaxing this assumption gives rise to a new transfer learning setting, called latent domain learning in this thesis, in which training and inference are carried out over data from multiple visual domains, without domain-level annotations. Customized solutions are required for this, as the performance of standard models degrades: a new data augmentation technique that interpolates between latent domains in an unsupervised way is presented, alongside a dedicated module that sparsely accounts for hidden domains in data, without requiring domain labels to do so. In addition, the thesis studies the problem of classifying previously unseen or anomalous modes in data, a fundamental problem in one-class learning, and anomaly detection in particular. While recent ideas have been focused on developing self-supervised solutions for the one-class setting, in this thesis new methods based on transfer learning are formulated. Extensive experimental evidence demonstrates that a transfer-based perspective benefits new problems that have recently been proposed in anomaly detection literature, in particular challenging semantic detection tasks

    Mapping Super-Relaxed States of Myosin Heads in Sarcomeres using Oblique Angle Fluorescent Microscopy

    Get PDF
    We have utilised modern methods of super-resolution fluorescent microscopy to spatially map fluorescently labelled ATP molecules in relaxed rabbit psoas skeletal muscles. For our imaging process, we have labelled ATP molecules with Rhodamine and Z-lines with Alexa488. Data from imaging these fluorophores have been collected using oblique angle fluorescent microscopy and further analysed to map super relaxed states (SRX) of myosin heads on the thick filament. Our experiments have concluded that most SRX of myosin heads were found in the C-zone of the thick filament, while other zones of thick filament had smaller populations of SRX. Further introduction of mavacamten (MAVA) to our imaging system has revealed an increase in SRX in both D and P zones, while the C zone population of SRX had remained constant. Further experiments must be conducted to establish a clear pattern and further proof our findings

    The interpretation of Islam and nationalism by the elite through the English language media in Pakistan.

    Get PDF
    The media is constructed and interpreted through what people 'know'. That knowledge is, forthe most part, created through day to day experiences. In Pakistan, Islam and nationalism aretwo components of this social knowledge which are intrinsically tied to the experiences of thePakistani people. Censorship and selection are means through which this knowledge isarticulated and interpreted.General conceptions of partially shared large scale bodies of knowledge and ideas reinforce,and are reinforced by, general medium of mass communication: the print and electronic media.Focusing on the govermnent, media institutions and Pakistani elites, I describe and analyse thedifferent, sometimes conflicting, interpretations of Islam and Pakistani nationalism manifest inand through media productions presented in Pakistan.The media means many things, not least of which is power. It is the media as a source ofpower that is so frequently controlled, directed and manipulated. The terminology may beslightly different according to the context within which one is talking - propaganda, selection,etc. - but ultimately it comes down to the same thing - censorship. Each of the three groups:government, media institutions and Pakistani elites - have the power to interpret and censormedia content and consideration must be taken of each of the other power holders consequentlyrestricting the power of each group in relation to the other two. The processes of thismanipulation and their consequences form the major themes of this thesis

    Strung pieces: on the aesthetics of television fiction series

    Get PDF
    As layered and long works, television fiction series have aesthetic properties that are built over time, bit by bit. This thesis develops a group of concepts that enable the study of these properties, It argues that a series is made of strung pieces, a system of related elements. The text begins by considering this sequential form within the fields of film and television. This opening chapter defines the object and methodology of research, arguing for a non-essentialist distinction between cinema and television and against the adequacy of textual and contextual analyses as approaches to the aesthetics of these shows. It proposes instead that these programmes should be described as televisual works that can be scrutinised through aesthetic analysis. The next chapters propose a sequence of interrelated concepts. The second chapter contends that series are composed of building blocks that can be either units into which series are divided or motifs that unify series and are dispersed across their pans. These blocks are patterned according to four kinds of relations or principles of composition. Repetition and variation are treated in tandem in the third chapter because of their close connection, given that variation emerges from established repetition. Exception and progression are also discussed together in the fourth chapter since they both require a long view of these serial works. The former, in order to be recognised as a deviation from the patterns of repetition and variation. The latter, In order to be understood in Its many dimensions as the series advances. Each of these concepts is further detailed with additional distinctions between types of units, motifs, repetitions, variations, and exceptions, using illustrative examples from numerous shows. In contrast, the section on progression uses a single series as case study, Carnivàle (2003-05), because this is the overarching principle that encompasses all the others. The conclusion considers the findings of the research and suggests avenues for their application

    Studies of strategic performance management for classical organizations theory & practice

    Get PDF
    Nowadays, the activities of "Performance Management" have spread very broadly in actually every part of business and management. There are numerous practitioners and researchers from very different disciplines, who are involved in exploring the different contents of performance management. In this thesis, some relevant historic developments in performance management are first reviewed. This includes various theories and frameworks of performance management. Then several management science techniques are developed for assessing performance management, including new methods in Data Envelopment Analysis (DEA) and Soft System Methodology (SSM). A theoretical framework for performance management and its practical procedures (five phases) are developed for "classic" organizations using soft system thinking, and the relationship with the existing theories are explored. Eventually these results are applied in three case studies to verify our theoretical development. One of the main contributions of this work is to point out, and to systematically explore the basic idea that the effective forms and structures of performance management for an organization are likely to depend greatly on the organizational configuration, in order to coordinate well with other management activities in the organization, which has seemingly been neglected in the existing literature of performance management research in the sense that there exists little known research that associated particular forms of performance management with the explicit assumptions of organizational configuration. By applying SSM, this thesis logically derives some main functional blocks of performance management in 'classic' organizations and clarifies the relationships between performance management and other management activities. Furthermore, it develops some new tools and procedures, which can hierarchically decompose organizational strategies and produce a practical model of specific implementation steps for "classic" organizations. Our approach integrates popular types of performance management models. Last but not least, this thesis presents findings from three major cases, which are quite different organizations in terms of management styles, ownership, and operating environment, to illustrate the fliexbility of the developed theoretical framework

    Anytime algorithms for ROBDD symmetry detection and approximation

    Get PDF
    Reduced Ordered Binary Decision Diagrams (ROBDDs) provide a dense and memory efficient representation of Boolean functions. When ROBDDs are applied in logic synthesis, the problem arises of detecting both classical and generalised symmetries. State-of-the-art in symmetry detection is represented by Mishchenko's algorithm. Mishchenko showed how to detect symmetries in ROBDDs without the need for checking equivalence of all co-factor pairs. This work resulted in a practical algorithm for detecting all classical symmetries in an ROBDD in O(|G|³) set operations where |G| is the number of nodes in the ROBDD. Mishchenko and his colleagues subsequently extended the algorithm to find generalised symmetries. The extended algorithm retains the same asymptotic complexity for each type of generalised symmetry. Both the classical and generalised symmetry detection algorithms are monolithic in the sense that they only return a meaningful answer when they are left to run to completion. In this thesis we present efficient anytime algorithms for detecting both classical and generalised symmetries, that output pairs of symmetric variables until a prescribed time bound is exceeded. These anytime algorithms are complete in that given sufficient time they are guaranteed to find all symmetric pairs. Theoretically these algorithms reside in O(n³+n|G|+|G|³) and O(n³+n²|G|+|G|³) respectively, where n is the number of variables, so that in practice the advantage of anytime generality is not gained at the expense of efficiency. In fact, the anytime approach requires only very modest data structure support and offers unique opportunities for optimisation so the resulting algorithms are very efficient. The thesis continues by considering another class of anytime algorithms for ROBDDs that is motivated by the dearth of work on approximating ROBDDs. The need for approximation arises because many ROBDD operations result in an ROBDD whose size is quadratic in the size of the inputs. Furthermore, if ROBDDs are used in abstract interpretation, the running time of the analysis is related not only to the complexity of the individual ROBDD operations but also the number of operations applied. The number of operations is, in turn, constrained by the number of times a Boolean function can be weakened before stability is achieved. This thesis proposes a widening that can be used to both constrain the size of an ROBDD and also ensure that the number of times that it is weakened is bounded by some given constant. The widening can be used to either systematically approximate an ROBDD from above (i.e. derive a weaker function) or below (i.e. infer a stronger function). The thesis also considers how randomised techniques may be deployed to improve the speed of computing an approximation by avoiding potentially expensive ROBDD manipulation
    • …
    corecore