10,990 research outputs found

    Cramér-Rao, Bound for Hybrid Peer-to-Peer Positioning

    Get PDF
    Presented at IEEE Communication Theory Workshop (CTW), Cancun, Mexico, May 10-12, 2010. PROCEEDINGS ARE NOT AVAILABL

    Cramér-Rao Bound for Hybrid GNSS-Terrestrial Cooperative Positioning

    Get PDF
    In this contribution we derive an expression of the Cramer-Rao bound for hybrid cooperative positioning, where GNSS information is combined with terrestrial range measurements through exchange of peer-to-peer messages. These results provide a theoretical characterization of achievable performance of hybrid positioning schemes, as well as allow to identify critical network configurations and devise optimized node placement strategies

    A Nonparametric Analysis of the Cournot Model

    Get PDF
    An observer makes a number of observations of an industry producing a homogeneous good. Each observation consists of the market price, the output of individual rms and perhaps information on each rm's production cost. We provide various tests (typically, linear programs) with which the observer can determine if the data set is consistent with the hypothesis that rms in this industry are playing a Cournot game at each observation. When cost information is wholly or partially unavailable, these tests could potentially be used to derive cost information on the rms. This paper is a contribution to the literature that aims to characterize (in various contexts) the restrictions that a data set must satisfy for it to be consistent with Nash outcomes in a game. It is also inspired by the seminal result of Afriat (and the subsequent literature) which addresses similar issues in the context of consumer demand, though one important technical di erence from most of these results is that the objective functions of rms in a Cournot game are not necessarily quasiconcave. Keywords:

    The Lazy Flipper: MAP Inference in Higher-Order Graphical Models by Depth-limited Exhaustive Search

    Full text link
    This article presents a new search algorithm for the NP-hard problem of optimizing functions of binary variables that decompose according to a graphical model. It can be applied to models of any order and structure. The main novelty is a technique to constrain the search space based on the topology of the model. When pursued to the full search depth, the algorithm is guaranteed to converge to a global optimum, passing through a series of monotonously improving local optima that are guaranteed to be optimal within a given and increasing Hamming distance. For a search depth of 1, it specializes to Iterated Conditional Modes. Between these extremes, a useful tradeoff between approximation quality and runtime is established. Experiments on models derived from both illustrative and real problems show that approximations found with limited search depth match or improve those obtained by state-of-the-art methods based on message passing and linear programming.Comment: C++ Source Code available from http://hci.iwr.uni-heidelberg.de/software.ph

    Direct evidence for superconductivity in the organic charge density-wave compound alpha-(BEDT-TTF)_2KHg(SCN)_4 under hydrostatic pressure

    Full text link
    We present direct evidence of a superconducting state existing in the title compound below 300 mK under quasi-hydrostatic pressure. The superconducing transition is observed in the whole pressure range studied, 0 < P < 4 kbar. However, the character of the transition drastically changes with suppressing the charge-density wave state.Comment: 2 pages, 2 figure

    Patterson Function from Low-Energy Electron Diffraction Measured Intensities and Structural Discrimination

    Full text link
    Surface Patterson Functions have been derived by direct inversion of experimental Low-Energy Electron Diffraction I-V spectra measured at multiple incident angles. The direct inversion is computationally simple and can be used to discriminate between different structural models. 1x1 YSi_2 epitaxial layers grown on Si(111) have been used to illustrate the analysis. We introduce a suitable R-factor for the Patterson Function to make the structural discrimination as objective as possible. From six competing models needed to complete the geometrical search, four could easily be discarded, achieving a very significant and useful reduction in the parameter space to be explored by standard dynamical LEED methods. The amount and quality of data needed for this analysis is discussed.Comment: 5 pages, 4 figure
    • …
    corecore