Cleaning uncertain data for top-k queries

The information managed in emerging applications, such as sensor networks, location-based services, and data integration, is inherently imprecise. To handle data uncertainty, probabilistic databases have been recently developed. In this paper, we study how to quantify the ambiguity of answers returned by a probabilistic top-k query. We develop efficient algorithms to compute the quality of this query under the possible world semantics. We further address the cleaning of a probabilistic database, in order to improve top-k query quality. Cleaning involves the reduction of ambiguity associated with the database entities. For example, the uncertainty of a temperature value acquired from a sensor can be reduced, or cleaned, by requesting its newest value from the sensor. While this 'cleaning operation' may produce a better query result, it may involve a cost and fail. We investigate the problem of selecting entities to be cleaned under a limited budget. Particularly, we propose an optimal solution and several heuristics. Experiments show that the greedy algorithm is efficient and close to optimal. © 2013 IEEE.published_or_final_versio

Accurate and linear time pose estimation from points and lines

The final publication is available at link.springer.comThe Perspective-n-Point (PnP) problem seeks to estimate the pose of a calibrated camera from n 3Dto-2D point correspondences. There are situations, though, where PnP solutions are prone to fail because feature point correspondences cannot be reliably estimated (e.g. scenes with repetitive patterns or with low texture). In such scenarios, one can still exploit alternative geometric entities, such as lines, yielding the so-called Perspective-n-Line (PnL) algorithms. Unfortunately, existing PnL solutions are not as accurate and efficient as their point-based counterparts. In this paper we propose a novel approach to introduce 3D-to-2D line correspondences into a PnP formulation, allowing to simultaneously process points and lines. For this purpose we introduce an algebraic line error that can be formulated as linear constraints on the line endpoints, even when these are not directly observable. These constraints can then be naturally integrated within the linear formulations of two state-of-the-art point-based algorithms, the OPnP and the EPnP, allowing them to indistinctly handle points, lines, or a combination of them. Exhaustive experiments show that the proposed formulation brings remarkable boost in performance compared to only point or only line based solutions, with a negligible computational overhead compared to the original OPnP and EPnP.Peer ReviewedPostprint (author's final draft

Control and Characterization of Individual Grains and Grain Boundaries in Graphene Grown by Chemical Vapor Deposition

The strong interest in graphene has motivated the scalable production of high quality graphene and graphene devices. Since large-scale graphene films synthesized to date are typically polycrystalline, it is important to characterize and control grain boundaries, generally believed to degrade graphene quality. Here we study single-crystal graphene grains synthesized by ambient CVD on polycrystalline Cu, and show how individual boundaries between coalescing grains affect graphene's electronic properties. The graphene grains show no definite epitaxial relationship with the Cu substrate, and can cross Cu grain boundaries. The edges of these grains are found to be predominantly parallel to zigzag directions. We show that grain boundaries give a significant Raman "D" peak, impede electrical transport, and induce prominent weak localization indicative of intervalley scattering in graphene. Finally, we demonstrate an approach using pre-patterned growth seeds to control graphene nucleation, opening a route towards scalable fabrication of single-crystal graphene devices without grain boundaries.Comment: New version with additional data. Accepted by Nature Material

Study of psi(2S) decays to X J/psi

Using J/psi -> mu^+ mu^- decays from a sample of approximately 4 million psi(2S) events collected with the BESI detector, the branching fractions of psi(2S) -> eta J/psi, pi^0 pi^0 J/psi, and anything J/psi normalized to that of psi(2S) -> pi^+ pi^- J/psi are measured. The results are B(psi(2S) -> eta J/psi)/B(psi(2S) -> pi^+ pi^- J/psi) = 0.098 \pm 0.005 \pm 0.010, B(psi(2S) -> pi^0 pi^0 J/psi)/B(psi(2S) -> pi^+ pi^- J/psi) = 0.570 \pm 0.009 \pm 0.026, and B(psi(2S) -> anything J/psi)/B(psi(2S) -> pi^+ pi^- J/psi) = 1.867 \pm 0.026 \pm 0.055.Comment: 13 pages, 8 figure

Family conflict and lower morning cortisol in adolescents and adults: modulation of puberty

published_or_final_versio

Search for K_S K_L in psi'' decays

K_S K_L from psi'' decays is searched for using the psi'' data collected by BESII at BEPC, the upper limit of the branching fraction is determined to be B(psi''--> K_S K_L) < 2.1\times 10^{-4} at 90% C. L. The measurement is compared with the prediction of the S- and D-wave mixing model of the charmonia, based on the measurements of the branching fractions of J/psi-->K_S K_L and psi'-->K_S K_L.Comment: 5 pages, 1 figur

First observation of psi(2S)-->K_S K_L

The decay psi(2S)-->K_S K_L is observed for the first time using psi(2S) data collected with the Beijing Spectrometer (BESII) at the Beijing Electron Positron Collider (BEPC); the branching ratio is determined to be B(psi(2S)-->K_S K_L) = (5.24\pm 0.47 \pm 0.48)\times 10^{-5}. Compared with J/psi-->K_S K_L, the psi(2S) branching ratio is enhanced relative to the prediction of the perturbative QCD ``12%'' rule. The result, together with the branching ratios of psi(2S) decays to other pseudoscalar meson pairs (\pi^+\pi^- and K^+K^-), is used to investigate the relative phase between the three-gluon and the one-photon annihilation amplitudes of psi(2S) decays.Comment: 5 pages, 4 figures, 2 tables, submitted to Phys. Rev. Let

Broadband gradient impedance matching using an acoustic metamaterial for ultrasonic transducers

2016-2017 > Academic research: refereed > Publication in refereed journal201804_a bcmaVersion of RecordPublishe

Antikaon production in nucleon-nucleon reactions near threshold

The antikaon production cross section from nucleon-nucleon reactions near threshold is studied in a meson exchange model. We include both pion and kaon exchange, but neglect the interference between the amplitudes. In case of pion exchange the antikaon production cross section can be expressed in terms of the antikaon production cross section from a pion-nucleon interaction, which we take from the experimental data if available. Otherwise, a $K^*$-resonance exchange model is introduced to relate the different reaction cross sections. In case of kaon exchange the antikaon production cross section is related to the elastic $KN$ and $\bar KN$ cross sections, which are again taken from experimental measurements. We find that the one-meson exchange model gives a satisfactory fit to the available data for the $NN\to NNK\bar K$ cross section at high energies. We compare our predictions for the cross section near threshold with an earlier empirical parameterization and that from phase space models.Comment: 16 pages, LaTeX, 5 postscript figures included, submitted to Z. Phys.