3,022 research outputs found

    Placing Arrows in Directed Graph Drawings

    Full text link
    We consider the problem of placing arrow heads in directed graph drawings without them overlapping other drawn objects. This gives drawings where edge directions can be deduced unambiguously. We show hardness of the problem, present exact and heuristic algorithms, and report on a practical study.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

    The Validation of Speech Corpora

    Get PDF
    1.2 Intended audience........................

    Envy-free cake division without assuming the players prefer nonempty pieces

    Full text link
    Consider nn players having preferences over the connected pieces of a cake, identified with the interval [0,1][0,1]. A classical theorem, found independently by Stromquist and by Woodall in 1980, ensures that, under mild conditions, it is possible to divide the cake into nn connected pieces and assign these pieces to the players in an envy-free manner, i.e, such that no player strictly prefers a piece that has not been assigned to her. One of these conditions, considered as crucial, is that no player is happy with an empty piece. We prove that, even if this condition is not satisfied, it is still possible to get such a division when nn is a prime number or is equal to 44. When nn is at most 33, this has been previously proved by Erel Segal-Halevi, who conjectured that the result holds for any nn. The main step in our proof is a new combinatorial lemma in topology, close to a conjecture by Segal-Halevi and which is reminiscent of the celebrated Sperner lemma: instead of restricting the labels that can appear on each face of the simplex, the lemma considers labelings that enjoy a certain symmetry on the boundary

    Flowcharting with D-charts

    Get PDF
    A D-Chart is a style of flowchart using control symbols highly appropriate to modern structured programming languages. The intent of a D-Chart is to provide a clear and concise one-for-one mapping of control symbols to high-level language constructs for purposes of design and documentation. The notation lends itself to both high-level and code-level algorithmic description. The various issues that may arise when representing, in D-Chart style, algorithms expressed in the more popular high-level languages are addressed. In particular, the peculiarities of mapping control constructs for Ada, PASCAL, FORTRAN 77, C, PL/I, Jovial J73, HAL/S, and Algol are discussed

    Effect of electron heating on self-induced transparency in relativistic intensity laser-plasma interaction

    Full text link
    The effective increase of the critical density associated with the interaction of relativistically intense laser pulses with overcritical plasmas, known as self-induced transparency, is revisited for the case of circular polarization. A comparison of particle-in-cell simulations to the predictions of a relativistic cold-fluid model for the transparency threshold demonstrates that kinetic effects, such as electron heating, can lead to a substantial increase of the effective critical density compared to cold-fluid theory. These results are interpreted by a study of separatrices in the single-electron phase space corresponding to dynamics in the stationary fields predicted by the cold-fluid model. It is shown that perturbations due to electron heating exceeding a certain finite threshold can force electrons to escape into the vacuum, leading to laser pulse propagation. The modification of the transparency threshold is linked to the temporal pulse profile, through its effect on electron heating.Comment: 13 pages, 12 figures; fixed some typos and improved discussion of review materia

    Copernicus-EMS mapping guidelines and best practice

    Get PDF
    This document contains the mapping guidelines for Copernicus Emergency Management Service (EMS) mapping production. It summarizes the JRC experience developed in the frame of Copernicus with respect to the challenging task of providing maps in support of the disaster risk management cycle. The main focus is on the rush mode mapping service, however the guidelines are applicable to the non-rush service as well. The document approaches the map per part component: title, cartographic information, overview maps, legend, and map frame, etc. Some specific and innovative elements are introduced, e.g. the summary table and the standard use of vector files. Particular attention is devoted to the consistency across the components that constitute the product. The structure and the schematic organization of the guidelines allow considering this document as a kind of practical handbook.JRC.G.2-Global security and crisis managemen
    • …
    corecore