571 research outputs found

    Lower bound for the maximal number of facets of a 0/1 polytope

    Full text link
    We show that there exist 0/1 polytopes in R^n with as many as (cn / (log n)^2)^(n/2) facets (or more), where c>0 is an absolute constant.Comment: 19 page

    Asymptotic formulas for the diameter of sections of symmetric convex bodies

    Get PDF
    AbstractSharpening work of the first two authors, for every proportion λ∈(0,1) we provide exact quantitative relations between global parameters of n-dimensional symmetric convex bodies and the diameter of their random ⌊λn⌋-dimensional sections. Using recent results of Gromov and Vershynin, we obtain an “asymptotic formula” for the diameter of random proportional sections

    Estimation in high dimensions: a geometric perspective

    Full text link
    This tutorial provides an exposition of a flexible geometric framework for high dimensional estimation problems with constraints. The tutorial develops geometric intuition about high dimensional sets, justifies it with some results of asymptotic convex geometry, and demonstrates connections between geometric results and estimation problems. The theory is illustrated with applications to sparse recovery, matrix completion, quantization, linear and logistic regression and generalized linear models.Comment: 56 pages, 9 figures. Multiple minor change

    Linking healthcare and societal resilience during the Covid-19 pandemic

    Get PDF
    Coronavirus disease 2019 (Covid-19) has highlighted the link between public healthcare and the broader context of operational response to complex crises. Data are needed to support the work of the emergency services and enhance governance. This study develops a Europe-wide analysis of perceptions, needs and priorities of the public affected by the Covid-19 emergency. An online multilingual survey was conducted from mid-May until mid-July 2020. The questionnaire investigates perceptions of public healthcare, emergency management and societal resilience. In total, N = 3029 valid answers were collected. They were analysed both as a whole and focusing on the most represented countries (Italy, Romania, Spain and the United Kingdom). Our findings highlight some perceived weaknesses in emergency management that are associated with the underlying vulnerability of the global interconnected society and public healthcare systems. The spreading of the epidemic in Italy represented a ‘tipping point’ for perceiving Covid-19 as an ‘emergency’ in the surveyed countries. The respondents uniformly suggested a preference for gradually restarting activities. We observed a tendency to ignore the cascading effects of Covid-19 and possible concurrence of threats. Our study highlights the need for practices designed to address the next phases of the Covid-19 crisis and prepare for future systemic shocks. Cascading effects that could compromise operational capacity need to be considered more carefully. We make the case for the reinforcement of cross-border coordination of public health initiatives, for standardization in business continuity management, and for dealing with the recovery at the European level

    The Complexity of Separating Points in the Plane

    Get PDF
    We study the following separation problem: given n connected curves and two points s and t in the plane, compute the minimum number of curves one needs to retain so that any path connecting s to t intersects some of the retained curves. We give the first polynomial (O(n3)) time algorithm for the problem, assuming that the curves have reasonable computational properties. The algorithm is based on considering the intersection graph of the curves, defining an appropriate family of closed walks in the intersection graph that satisfies the 3-path-condition, and arguing that a shortest cycle in the family gives an optimal solution. The 3-path-condition has been used mainly in topological graph theory, and thus its use here makes the connection to topology clear. We also show that the generalized version, where several input points are to be separated, is NP-hard for natural families of curves, like segments in two directions or unit circles

    The parameterized complexity of some geometric problems in unbounded dimension

    Full text link
    We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension dd: i) Given nn points in \Rd, compute their minimum enclosing cylinder. ii) Given two nn-point sets in \Rd, decide whether they can be separated by two hyperplanes. iii) Given a system of nn linear inequalities with dd variables, find a maximum-size feasible subsystem. We show that (the decision versions of) all these problems are W[1]-hard when parameterized by the dimension dd. %and hence not solvable in O(f(d)nc){O}(f(d)n^c) time, for any computable function ff and constant cc %(unless FPT=W[1]). Our reductions also give a nΩ(d)n^{\Omega(d)}-time lower bound (under the Exponential Time Hypothesis)

    Taxonomic corpus-based concept summary generation for document annotation.

    Get PDF
    Semantic annotation is an enabling technology which links documents to concepts that unambiguously describe their content. Annotation improves access to document contents for both humans and software agents. However, the annotation process is a challenging task as annotators often have to select from thousands of potentially relevant concepts from controlled vocabularies. The best approaches to assist in this task rely on reusing the annotations of an annotated corpus. In the absence of a pre-annotated corpus, alternative approaches suffer due to insufficient descriptive texts for concepts in most vocabularies. In this paper, we propose an unsupervised method for recommending document annotations based on generating node descriptors from an external corpus. We exploit knowledge of the taxonomic structure of a thesaurus to ensure that effective descriptors (concept summaries) are generated for concepts. Our evaluation on recommending annotations show that the content that we generate effectively represents the concepts. Also, our approach outperforms those which rely on information from a thesaurus alone and is comparable with supervised approaches
    • 

    corecore