1,574 research outputs found

    Space-Time Tradeoffs for Distributed Verification

    Full text link
    Verifying that a network configuration satisfies a given boolean predicate is a fundamental problem in distributed computing. Many variations of this problem have been studied, for example, in the context of proof labeling schemes (PLS), locally checkable proofs (LCP), and non-deterministic local decision (NLD). In all of these contexts, verification time is assumed to be constant. Korman, Kutten and Masuzawa [PODC 2011] presented a proof-labeling scheme for MST, with poly-logarithmic verification time, and logarithmic memory at each vertex. In this paper we introduce the notion of a tt-PLS, which allows the verification procedure to run for super-constant time. Our work analyzes the tradeoffs of tt-PLS between time, label size, message length, and computation space. We construct a universal tt-PLS and prove that it uses the same amount of total communication as a known one-round universal PLS, and tt factor smaller labels. In addition, we provide a general technique to prove lower bounds for space-time tradeoffs of tt-PLS. We use this technique to show an optimal tradeoff for testing that a network is acyclic (cycle free). Our optimal tt-PLS for acyclicity uses label size and computation space O((log⁡n)/t)O((\log n)/t). We further describe a recursive O(log⁡∗n)O(\log^* n) space verifier for acyclicity which does not assume previous knowledge of the run-time tt.Comment: Pre-proceedings version of paper presented at the 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2017

    ϕ\phi meson transparency in nuclei from ϕN\phi N resonant interactions

    Full text link
    We investigate the ϕ\phi meson nuclear transparency using some recent theoretical developments on the ϕ\phi in medium self-energy. The inclusion of direct resonant ϕN\phi N-scattering and the kaon decay mechanisms leads to a ϕ\phi width much larger than in most previous theoretical approaches. The model has been confronted with photoproduction data from CLAS and LEPS and the recent proton induced ϕ\phi production from COSY finding an overall good agreement. The results support the need of a quite large direct ϕN\phi N-scattering contribution to the self-energy

    Fast Arc-Annotated Subsequence Matching in Linear Space

    Full text link
    An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings PP and QQ the arc-preserving subsequence problem is to determine if PP can be obtained from QQ by deleting bases from QQ. Whenever a base is deleted any arc with an endpoint in that base is also deleted. Arc-annotated strings where the arcs are ``nested'' are a natural model of RNA molecules that captures both the primary and secondary structure of these. The arc-preserving subsequence problem for nested arc-annotated strings is basic primitive for investigating the function of RNA molecules. Gramm et al. [ACM Trans. Algorithms 2006] gave an algorithm for this problem using O(nm)O(nm) time and space, where mm and nn are the lengths of PP and QQ, respectively. In this paper we present a new algorithm using O(nm)O(nm) time and O(n+m)O(n + m) space, thereby matching the previous time bound while significantly reducing the space from a quadratic term to linear. This is essential to process large RNA molecules where the space is likely to be a bottleneck. To obtain our result we introduce several novel ideas which may be of independent interest for related problems on arc-annotated strings.Comment: To appear in Algoritmic

    A GENERAL ITERATION SCHEME FOR THE CALCULATION OF LEVEL DENSITIES, AND RESULTS USING A SEMICLASSICAL APPROXIMATION

    No full text
    A general scheme is derived to calculate m-particle n-hole fermion level densities for any single particle Hamiltonian taking into account Pauli exclusion. This technique is applied to obtain level densities of the three dimensional isotropic Harmonic Oscillator semiclassically in the Thomas-Fermi approach

    ON THE ROLE OF QUANTUM AND STATISTICAL EFFECTS IN THE LIQUID GAS PHASE TRANSITION OF HOT NUCLEI

    No full text
    The triggering of the liquid-gas phase transition in hot nuclear matter by quantum and statistical fluctuations is studied in a microscopic approach to nucleation, which is a fluid-dynamical version of the imaginary time dependent mean field theory at finite temperature

    Cartographie du risque unitaire d'endommagement (CRUE) par inondations pour les résidences unifamiliales du Québec

    Get PDF
    Actuellement, en considĂ©rant simultanĂ©ment les Ă©lĂ©ments constitutifs du risque, soit l'alĂ©a et la vulnĂ©rabilitĂ©, aucune des mĂ©thodes existantes dites de cartographie des risques d'inondation ne permet d'Ă©tablir de façon prĂ©cise et quantifiable en tous points du territoire les risques d'inondation. La mĂ©thode de cartographie prĂ©sentĂ©e permet de combler ce besoin en rĂ©pondant aux critĂšres suivants : facilitĂ© d'utilisation, de consultation et d'application, rĂ©sultats distribuĂ©s spatialement, simplicitĂ© de mise Ă  jour, applicabilitĂ© Ă  divers types de rĂ©sidences.La mĂ©thode prĂ©sentĂ©e utilise une formulation unitaire du risque basĂ©e sur les taux d'endommagement distribuĂ©s et reliĂ©s Ă  diverses pĂ©riodes de retour de crues Ă  l'eau libre. Ceux-ci sont d'abord calculĂ©s Ă  partir des hauteurs de submersion qu'on dĂ©duit de la topographie, des niveaux d'eau pour des pĂ©riodes de retour reprĂ©sentatives et du mode d'implantation des rĂ©sidences (prĂ©sence de sous-sol, hauteur moyenne du rez-de-chaussĂ©e). Ensuite, le risque unitaire est obtenu par intĂ©gration du produit du taux d'endommagement croissant par son incrĂ©ment de probabilitĂ© au dĂ©passement. Le rĂ©sultat est une carte reprĂ©sentant le risque en % de dommage direct moyen annuel. Une Ă©tude pilote sur un tronçon de la riviĂšre Montmorency (QuĂ©bec, Canada) a montrĂ© que les cartes sont expressives, flexibles et peuvent recevoir tous les traitements additionnels permis par un SIG tel que le logiciel MODELEUR/HYDROSIM dĂ©veloppĂ© Ă  l'INRS-ETE, l'outil utilisĂ© pour cette recherche. Enfin, l'interprĂ©tation sur la Montmorency des cartes d'inondation en vigueur actuellement au Canada (les limites de crue de 20/100 ans) soulĂšve des interrogations sur le niveau de risque actuellement acceptĂ© dans la rĂ©glementation, surtout quand on le compare aux taux de taxation municipale.Public managers of flood risks need simple and precise tools to deal with this problem and to minimize its consequences, especially for land planning and management. Several methods exist that produce flood risk maps and help to restrict building residences in flood plains. For example, the current method in Canada is based on the delineation in flood plains of two regions corresponding to floods of 20- and 100-year return periods (CONVENTION CANADA/QUÉBEC, 1994), mostly applied to ice-free flooding conditions. The method applied by the Federal Emergency Management Agency FEMA (2004) is also based on the statistical structure of the floods in different contexts, with a goal mostly oriented towards the determination of insurance rates. In France, the INONDABILITÉ method (GILARD and GENDREAU, 1998) seeks to match the present probability of flooding to a reduced one that the stakeholders would be willing to accept.However, considering that the commonly accepted definition of risk includes both the probability of flooding and its consequences (costs of damages), very few, if any of the present methods can strictly be considered as risk-mapping methods. The method presented hereafter addresses this gap by representing the mean annual rate of direct damage (unit value) for different residential building modes, taking into account the flood probability structure and the spatial distribution of the submersion height, which takes into account the topography of the flood plain and the water stage distribution, the residential settlement mode (basement or not) and the first floor elevation of the building. The method seeks to meet important criteria related to efficient land planning and management, including: ease of utilisation, consultation and application for managers; spatially distributed results usable in current geographical information systems (GIS maps); availability anywhere in the area under study; ease of updating; and adaptability for a wide range of residence types.The proposed method is based on a unit treatment of the risk variable that corresponds to a rate of damage, instead of an absolute value expressed in monetary units. Direct damages to the building are considered, excluding damages to furniture and other personal belongs. Damage rates are first computed as a function of the main explanatory variable represented by the field of submersion depths. This variable, which is obtained from the 2D subtraction of the terrain topography from the water stage for each reference flood event, is defined by its probability of occurrence. The mean annual rate of damage (unit risk) is obtained by integrating the field of damage rate with respect to the annual probability structure of the available flood events. The result is a series of maps corresponding to representative modes of residential settlement.The damage rate was computed with a set of empirical functional relationships developed for the Saguenay region (QuĂ©bec, Canada) after the flood of 1996. These curves were presented in LECLERC et al. (2003); four different curves form the set that represents residences with or without a basement, with a value below or above $CAD 50,000, which is roughly correlated with the type of occupation (i.e., secondary or main residence). While it cannot be assumed that theses curves are generic with respect to the general situation in Canada, or more specifically, in the province of QuĂ©bec, the method itself can still be applied by making use of alternate sets of submersion rates of damage curves developed for other specific scenarios. Moreover, as four different functional relationships were used to represent the different residential settlement modes, four different maps have to be drawn to represent the vulnerability of the residential sector depending of the type of settlement. Consequently, as the maps are designed to represent a homogeneous mode of settlement, they represent potential future development in a given region better than the current situation. They can also be used to evaluate public policies regarding urban development and building restrictions in the flood plains.A pilot study was conducted on a reach of the Montmorency River (QuĂ©bec, Canada; BLIN, 2002). It was possible to verify the compliance of the method to the proposed utilisation criteria. The method proved to be simple to use, adaptive and compatible with GIS modeling environments, such as MODELEUR (SECRETAN at al, 1999), a 2D finite elements modeling system designed for a fluvial environment. Water stages were computed with a 2D hydrodynamic simulator (HYDROSIM; HENICHE et al., 1999a) to deal with the river reach complexity (a breaded reach with back waters). Due to the availability of 2D results, a 2D graphic representation of the information layers can therefore be configured, taking into account the specific needs of the interveners. In contexts where one dimensional water stage profiles are computed (e.g., HEC-RAS by USACE, 1990; DAMBRK by FREAD, 1984), an extended 2D representation of these data needs to be developed in the lateral flood plains in order to achieve a 2D distributed submersion field.Among the interesting results, it was possible to compare the risk level for given modes of settlements (defined by the presence/absence of a basement and the elevation of the first floor with respect to the land topography) with current practices, based only on the delineation of the limits of the flood zones corresponding to 20/100 year return periods. We conclude that, at least in the particular case under study, the distributed annual rate of damage seems relatively large with respect to other financial indicators for residences such as urban taxation rates

    Studying the Pc(4450) resonance in J/psi photoproduction off protons

    Full text link
    The LHCb has reported the observation of a resonancelike structure, the Pc(4450), in the J/psi p invariant masses. In our work, we discuss the feasibility of detecting this structure in J/psi photoproduction, e.g. in the measurements that have been approved for the experiments in Hall A/C and in Hall B with CLAS12 at JLab. Also the GlueX Collaboration has already reported preliminary results. We take into account the experimental resolution effects, and perform a global fit to world J/psi photoproduction data in order to study the possibility of observing the Pc(4450) signal in future JLab data. We present a first estimate of the upper limit for the branching ratio of the Pc(4450) into the J/psi p channel, and we study the angular distributions of the differential cross sections. This will shed light on the nature and couplings of the Pc(4450) structure in the future photoproduction experiments.Comment: NSTAR 2017 conference proceeding

    Structure of Pion Photoproduction Amplitudes

    Get PDF
    We derive and apply the finite energy sum rules to pion photoproduction. We evaluate the low energy part of the sum rules using several state-of-the-art models. We show how the differences in the low energy side of the sum rules might originate from different quantum number assignments of baryon resonances. We interpret the observed features in the low energy side of the sum rules with the expectation from Regge theory. Finally, we present a model, in terms of a Regge-pole expansion, that matches the sum rules and the high-energy observables.Comment: 19 pages, 15 figures and 4 table

    Short words for the terminology of common animals A linguistic study

    Get PDF
    Ce travail est une Ă©tude prĂ©liminaire dans 34 langues, portant sur les mots dĂ©signant les animaux familiers. Ces mots sont trĂšs courts (moins de six lettres en moyenne). La linguistique peut permettre de mieux connaĂźtre l'histoire des animaux domestiques, qu’il s’agisse de l’extension de l’élevage ou de la domestication.This paper constitutes a preliminary study concerning the terminology of the domestic and pet animals in 34 languages. The words which designate these animals are short (less than six letters on the average). Linguistics allows a better knowledge of the history of domestic animals (extension of breeding, domestication)

    The zero exemplar distance problem

    Full text link
    Given two genomes with duplicate genes, \textsc{Zero Exemplar Distance} is the problem of deciding whether the two genomes can be reduced to the same genome without duplicate genes by deleting all but one copy of each gene in each genome. Blin, Fertin, Sikora, and Vialette recently proved that \textsc{Zero Exemplar Distance} for monochromosomal genomes is NP-hard even if each gene appears at most two times in each genome, thereby settling an important open question on genome rearrangement in the exemplar model. In this paper, we give a very simple alternative proof of this result. We also study the problem \textsc{Zero Exemplar Distance} for multichromosomal genomes without gene order, and prove the analogous result that it is also NP-hard even if each gene appears at most two times in each genome. For the positive direction, we show that both variants of \textsc{Zero Exemplar Distance} admit polynomial-time algorithms if each gene appears exactly once in one genome and at least once in the other genome. In addition, we present a polynomial-time algorithm for the related problem \textsc{Exemplar Longest Common Subsequence} in the special case that each mandatory symbol appears exactly once in one input sequence and at least once in the other input sequence. This answers an open question of Bonizzoni et al. We also show that \textsc{Zero Exemplar Distance} for multichromosomal genomes without gene order is fixed-parameter tractable if the parameter is the maximum number of chromosomes in each genome.Comment: Strengthened and reorganize
    • 

    corecore