529 research outputs found

    Improved Implementation of Point Location in General Two-Dimensional Subdivisions

    Full text link
    We present a major revamp of the point-location data structure for general two-dimensional subdivisions via randomized incremental construction, implemented in CGAL, the Computational Geometry Algorithms Library. We can now guarantee that the constructed directed acyclic graph G is of linear size and provides logarithmic query time. Via the construction of the Voronoi diagram for a given point set S of size n, this also enables nearest-neighbor queries in guaranteed O(log n) time. Another major innovation is the support of general unbounded subdivisions as well as subdivisions of two-dimensional parametric surfaces such as spheres, tori, cylinders. The implementation is exact, complete, and general, i.e., it can also handle non-linear subdivisions. Like the previous version, the data structure supports modifications of the subdivision, such as insertions and deletions of edges, after the initial preprocessing. A major challenge is to retain the expected O(n log n) preprocessing time while providing the above (deterministic) space and query-time guarantees. We describe an efficient preprocessing algorithm, which explicitly verifies the length L of the longest query path in O(n log n) time. However, instead of using L, our implementation is based on the depth D of G. Although we prove that the worst case ratio of D and L is Theta(n/log n), we conjecture, based on our experimental results, that this solution achieves expected O(n log n) preprocessing time.Comment: 21 page

    Well-balanced treatment of gravity in astrophysical fluid dynamics simulations at low Mach numbers

    Full text link
    Accurate simulations of flows in stellar interiors are crucial to improving our understanding of stellar structure and evolution. Because the typically slow flows are merely tiny perturbations on top of a close balance between gravity and the pressure gradient, such simulations place heavy demands on numerical hydrodynamics schemes. We demonstrate how discretization errors on grids of reasonable size can lead to spurious flows orders of magnitude faster than the physical flow. Well-balanced numerical schemes can deal with this problem. Three such schemes were applied in the implicit, finite-volume Seven-League Hydro (SLH) code in combination with a low-Mach-number numerical flux function. We compare how the schemes perform in four numerical experiments addressing some of the challenges imposed by typical problems in stellar hydrodynamics. We find that the α\alpha-ÎČ\beta and deviation well-balancing methods can accurately maintain hydrostatic solutions provided that gravitational potential energy is included in the total energy balance. They accurately conserve minuscule entropy fluctuations advected in an isentropic stratification, which enables the methods to reproduce the expected scaling of convective flow speed with the heating rate. The deviation method also substantially increases accuracy of maintaining stationary orbital motions in a Keplerian disk on long timescales. The Cargo-LeRoux method fares substantially worse in our tests, although its simplicity may still offer some merits in certain situations. Overall, we find the well-balanced treatment of gravity in combination with low Mach number flux functions essential to reproducing correct physical solutions to challenging stellar slow-flow problems on affordable collocated grids.Comment: Accepted for publication in A&

    Theory for the coupling between longitudinal phonons and intrinsic Josephson oscillations in layered superconductors

    Full text link
    In this publication a microscopic theory for the coupling of intrinsic Josephson oscillations in layered superconductors with longitudinal c-axis-phonons is developed. It is shown that the influence of lattice vibrations on the c-axis transport can be fully described by introducing an effective longitudinal dielectric function. Resonances in the I-V-characteristic appear at van Hove singularities of both acoustical and optical longitudinal phonon branches. This provides a natural explanation of the recently discovered subgap structures in the I-V-characteristic of highly anisotropic cuprate superconductors. The effect of the phonon dispersion on the damping of these resonances and the coupling of Josephson oscillations in different resistive junctions due to phonons are discussed in detail.Comment: submitted to Phys. Rev. B, corrections following referee repor

    Answering Twitter Questions: a Model for Recommending Answerers through Social Collaboration

    Get PDF
    International audienceIn this paper, we specifically consider the challenging task of solving a question posted on Twitter. The latter generally remains unanswered and most of the replies, if any, are only from members of the questioner's neighborhood. As outlined in previous work related to community Q&A, we believe that question-answering is a collaborative process and that the relevant answer to a question post is an aggregation of answer nuggets posted by a group of relevant users. Thus, the problem of identifying the relevant answer turns into the problem of identifying the right group of users who would provide useful answers and would possibly be willing to collaborate together in the long-term. Accordingly, we present a novel method, called CRAQ, that is built on the collaboration paradigm and formulated as a group entropy optimization problem. To optimize the quality of the group, an information gain measure is used to select the most likely " informative " users according to topical and collaboration likelihood predictive features. Crowd-based experiments performed on two crisis-related Twitter datasets demonstrate the effectiveness of our collaborative-based answering approach

    What’s in a Name? Use of Brand versus Generic Drug Names in United States Outpatient Practice

    Get PDF
    BACKGROUND: The use of brand rather than generic names for medications can increase health care costs. However, little is known at a national level about how often physicians refer to drugs using their brand or generic names. OBJECTIVE: To evaluate how often physicians refer to drugs using brand or generic terminology. DESIGN AND PARTICIPANTS: We used data from the 2003 National Ambulatory Medical Care Survey (NAMCS), a nationally representative survey of 25,288 community-based outpatient visits in the United States. After each visit, patient medications were recorded on a survey encounter form by the treating physician or transcribed from office notes. MEASUREMENTS: Our main outcome measure was the frequency with which medications were recorded on the encounter form using their brand or generic names. RESULTS: For 20 commonly used drugs, the median frequency of brand name use was 98% (interquartile range, 81–100%). Among 12 medications with no generic competition at the time of the survey, the median frequency of brand name use was 100% (range 92–100%). Among 8 medications with generic competition at the time of the survey (“multisource” drugs), the median frequency of brand name use was 79% (range 0–98%; P < .001 for difference between drugs with and without generic competition). CONCLUSIONS: Physicians refer to most medications by their brand names, including drugs with generic formulations. This may lead to higher health care costs by promoting the use of brand-name products when generic alternatives are available

    Deregulation of Sucrose-Controlled Translation of a bZIP-Type Transcription Factor Results in Sucrose Accumulation in Leaves

    Get PDF
    Sucrose is known to repress the translation of Arabidopsis thaliana AtbZIP11 transcript which encodes a protein belonging to the group of S (S - stands for small) basic region-leucine zipper (bZIP)-type transcription factor. This repression is called sucrose-induced repression of translation (SIRT). It is mediated through the sucrose-controlled upstream open reading frame (SC-uORF) found in the AtbZIP11 transcript. The SIRT is reported for 4 other genes belonging to the group of S bZIP in Arabidopsis. Tobacco tbz17 is phylogenetically closely related to AtbZIP11 and carries a putative SC-uORF in its 5â€Č-leader region. Here we demonstrate that tbz17 exhibits SIRT mediated by its SC-uORF in a manner similar to genes belonging to the S bZIP group of the Arabidopsis genus. Furthermore, constitutive transgenic expression of tbz17 lacking its 5â€Č-leader region containing the SC-uORF leads to production of tobacco plants with thicker leaves composed of enlarged cells with 3–4 times higher sucrose content compared to wild type plants. Our finding provides a novel strategy to generate plants with high sucrose content

    Motion Planning via Manifold Samples

    Full text link
    We present a general and modular algorithmic framework for path planning of robots. Our framework combines geometric methods for exact and complete analysis of low-dimensional configuration spaces, together with practical, considerably simpler sampling-based approaches that are appropriate for higher dimensions. In order to facilitate the transfer of advanced geometric algorithms into practical use, we suggest taking samples that are entire low-dimensional manifolds of the configuration space that capture the connectivity of the configuration space much better than isolated point samples. Geometric algorithms for analysis of low-dimensional manifolds then provide powerful primitive operations. The modular design of the framework enables independent optimization of each modular component. Indeed, we have developed, implemented and optimized a primitive operation for complete and exact combinatorial analysis of a certain set of manifolds, using arrangements of curves of rational functions and concepts of generic programming. This in turn enabled us to implement our framework for the concrete case of a polygonal robot translating and rotating amidst polygonal obstacles. We demonstrate that the integration of several carefully engineered components leads to significant speedup over the popular PRM sampling-based algorithm, which represents the more simplistic approach that is prevalent in practice. We foresee possible extensions of our framework to solving high-dimensional problems beyond motion planning.Comment: 18 page
    • 

    corecore