1,122 research outputs found

    Clustering with shallow trees

    Full text link
    We propose a new method for hierarchical clustering based on the optimisation of a cost function over trees of limited depth, and we derive a message--passing method that allows to solve it efficiently. The method and algorithm can be interpreted as a natural interpolation between two well-known approaches, namely single linkage and the recently presented Affinity Propagation. We analyze with this general scheme three biological/medical structured datasets (human population based on genetic information, proteins based on sequences and verbal autopsies) and show that the interpolation technique provides new insight.Comment: 11 pages, 7 figure

    Combat and Warfare in the Early Paleolithic and Medically Unexplained Musculo-Facial Pain in the 21st Century War Veterns and Active-Duty Military Personnel

    Get PDF
    In a series of recent articles, we suggest that family dentists, military dentists and psychiatrists with expertise in posttraumatic stress disorder (especially in the Veterans Health Administration) are likely to see an increased number of patients with symptomatic jaw-clenching and early stages of tooth- grinding (Bracha et al., 2005). Returning warfighters and other returnees from military deployment may be especially at risk for high rates of clenching- induced masticatory muscle disorders at early stages of incisor grinding. The literature we have recently reviewed strongly supports the conclusion that clenching and grinding may primarily be a manifestation of experiencing extreme fear or severe chronic distress (respectively). We have recently reviewed the clinical and paleoanthropological literature and have noted that ancestral warfare and ancestral combat, in the early Paleolithic Environment of Evolutionary Adaptedness (EEA) may be a neglected factor explaining the conservation of the archaic trait of bite-muscle strengthening. We have hypothesized that among ancestral warriors, jaw clenching may have rapidly strengthened the two primary muscles involved in biting, the masseter muscles and the much larger temporalis muscles. The strengthening of these muscles may have served the purpose of enabling a stronger, deeper, and therefore more lethal, defensive bite for early Paleolithic humans. The neuroevolutionary perspective presented here may be novel to many dentists. However, it may be useful in patient education and in preventing progression from jaw-clenching to chronic facial pain

    Ternary Syndrome Decoding with Large Weight

    Get PDF
    The Syndrome Decoding problem is at the core of many code-based cryptosystems. In this paper, we study ternary Syndrome Decoding in large weight. This problem has been introduced in the Wave signature scheme but has never been thoroughly studied. We perform an algorithmic study of this problem which results in an update of the Wave parameters. On a more fundamental level, we show that ternary Syndrome Decoding with large weight is a really harder problem than the binary Syndrome Decoding problem, which could have several applications for the design of code-based cryptosystems

    Probabilistic Analysis of Facility Location on Random Shortest Path Metrics

    Get PDF
    The facility location problem is an NP-hard optimization problem. Therefore, approximation algorithms are often used to solve large instances. Such algorithms often perform much better than worst-case analysis suggests. Therefore, probabilistic analysis is a widely used tool to analyze such algorithms. Most research on probabilistic analysis of NP-hard optimization problems involving metric spaces, such as the facility location problem, has been focused on Euclidean instances, and also instances with independent (random) edge lengths, which are non-metric, have been researched. We would like to extend this knowledge to other, more general, metrics. We investigate the facility location problem using random shortest path metrics. We analyze some probabilistic properties for a simple greedy heuristic which gives a solution to the facility location problem: opening the κ\kappa cheapest facilities (with κ\kappa only depending on the facility opening costs). If the facility opening costs are such that κ\kappa is not too large, then we show that this heuristic is asymptotically optimal. On the other hand, for large values of κ\kappa, the analysis becomes more difficult, and we provide a closed-form expression as upper bound for the expected approximation ratio. In the special case where all facility opening costs are equal this closed-form expression reduces to O(ln(n)4)O(\sqrt[4]{\ln(n)}) or O(1)O(1) or even 1+o(1)1+o(1) if the opening costs are sufficiently small.Comment: A preliminary version accepted to CiE 201

    Chosen-ciphertext security from subset sum

    Get PDF
    We construct a public-key encryption (PKE) scheme whose security is polynomial-time equivalent to the hardness of the Subset Sum problem. Our scheme achieves the standard notion of indistinguishability against chosen-ciphertext attacks (IND-CCA) and can be used to encrypt messages of arbitrary polynomial length, improving upon a previous construction by Lyubashevsky, Palacio, and Segev (TCC 2010) which achieved only the weaker notion of semantic security (IND-CPA) and whose concrete security decreases with the length of the message being encrypted. At the core of our construction is a trapdoor technique which originates in the work of Micciancio and Peikert (Eurocrypt 2012
    corecore