16,174 research outputs found

    On morphological hierarchical representations for image processing and spatial data clustering

    Full text link
    Hierarchical data representations in the context of classi cation and data clustering were put forward during the fties. Recently, hierarchical image representations have gained renewed interest for segmentation purposes. In this paper, we briefly survey fundamental results on hierarchical clustering and then detail recent paradigms developed for the hierarchical representation of images in the framework of mathematical morphology: constrained connectivity and ultrametric watersheds. Constrained connectivity can be viewed as a way to constrain an initial hierarchy in such a way that a set of desired constraints are satis ed. The framework of ultrametric watersheds provides a generic scheme for computing any hierarchical connected clustering, in particular when such a hierarchy is constrained. The suitability of this framework for solving practical problems is illustrated with applications in remote sensing

    Patterns of Soft Masses from General Semi-Direct Gauge Mediation

    Get PDF
    We give a general formulation of semi-direct gauge mediation of supersymmetry breaking where the messengers interact with the hidden sector only through a weakly gauged group. Using this general formulation, we provide an explicit proof that the MSSM gaugino masses are vanishing to leading order in the gauge couplings. On the other hand, the MSSM sfermion masses have, generically, a non-vanishing leading contribution. We discuss how such a mechanism can successfully be combined with other mediation schemes which give tachyonic sfermions, such as sequestered anomaly mediation and some direct gauge mediation models.Comment: 26 pages, 5 figures; v2: refs added; v3: minor corrections, clarifications added, mainly in section

    Optical Network Models and their Application to Software-Defined Network Management

    Get PDF
    Software-defined networking is finding its way into optical networks. Here, it promises a simplification and unification of network management for optical networks allowing automation of operational tasks despite the highly diverse and vendor-specific commercial systems and the complexity and analog nature of optical transmission. A fundamental component for software-defined optical networking are common abstractions and interfaces. Currently, a number of models for optical networks are available. They all claim to provide open and vendor agnostic management of optical equipment. In this work, we survey and compare the most important models and propose an intent interface for creating virtual topologies that is integrated in the existing model ecosystem.Comment: Parts of the presented work has received funding from the European Commission within the H2020 Research and Innovation Programme, under grant agreeement n.645127, project ACIN

    Optimizing Associative Information Transfer within Content-addressable Memory

    Get PDF
    Original article can be found at: http://www.oldcitypublishing.com/IJUC/IJUC.htmlPeer reviewe

    Taking advantage of hybrid systems for sparse direct solvers via task-based runtimes

    Get PDF
    The ongoing hardware evolution exhibits an escalation in the number, as well as in the heterogeneity, of computing resources. The pressure to maintain reasonable levels of performance and portability forces application developers to leave the traditional programming paradigms and explore alternative solutions. PaStiX is a parallel sparse direct solver, based on a dynamic scheduler for modern hierarchical manycore architectures. In this paper, we study the benefits and limits of replacing the highly specialized internal scheduler of the PaStiX solver with two generic runtime systems: PaRSEC and StarPU. The tasks graph of the factorization step is made available to the two runtimes, providing them the opportunity to process and optimize its traversal in order to maximize the algorithm efficiency for the targeted hardware platform. A comparative study of the performance of the PaStiX solver on top of its native internal scheduler, PaRSEC, and StarPU frameworks, on different execution environments, is performed. The analysis highlights that these generic task-based runtimes achieve comparable results to the application-optimized embedded scheduler on homogeneous platforms. Furthermore, they are able to significantly speed up the solver on heterogeneous environments by taking advantage of the accelerators while hiding the complexity of their efficient manipulation from the programmer.Comment: Heterogeneity in Computing Workshop (2014
    corecore