5,737 research outputs found

    Diversifying Top-K Results

    Full text link
    Top-k query processing finds a list of k results that have largest scores w.r.t the user given query, with the assumption that all the k results are independent to each other. In practice, some of the top-k results returned can be very similar to each other. As a result some of the top-k results returned are redundant. In the literature, diversified top-k search has been studied to return k results that take both score and diversity into consideration. Most existing solutions on diversified top-k search assume that scores of all the search results are given, and some works solve the diversity problem on a specific problem and can hardly be extended to general cases. In this paper, we study the diversified top-k search problem. We define a general diversified top-k search problem that only considers the similarity of the search results themselves. We propose a framework, such that most existing solutions for top-k query processing can be extended easily to handle diversified top-k search, by simply applying three new functions, a sufficient stop condition sufficient(), a necessary stop condition necessary(), and an algorithm for diversified top-k search on the current set of generated results, div-search-current(). We propose three new algorithms, namely, div-astar, div-dp, and div-cut to solve the div-search-current() problem. div-astar is an A* based algorithm, div-dp is an algorithm that decomposes the results into components which are searched using div-astar independently and combined using dynamic programming. div-cut further decomposes the current set of generated results using cut points and combines the results using sophisticated operations. We conducted extensive performance studies using two real datasets, enwiki and reuters. Our div-cut algorithm finds the optimal solution for diversified top-k search problem in seconds even for k as large as 2,000.Comment: VLDB201

    The Ξ₯(nS){\Upsilon}(nS) β†’{\to} Bcβˆ—Ο€B_{c}^{\ast}{\pi}, Bcβˆ—KB_{c}^{\ast}K decays with perturbative QCD approach

    Get PDF
    Besides the traditional strong and electromagnetic decay modes, Ξ₯(nS){\Upsilon}(nS) meson can also decay through the weak interactions within the standard model of elementary particle. With anticipation of copious Ξ₯(nS){\Upsilon}(nS) data samples at the running LHC and coming SuperKEKB experiments, the two-body nonleptonic bottom-changing Ξ₯(nS){\Upsilon}(nS) β†’{\to} Bcβˆ—Ο€B_{c}^{\ast}{\pi}, Bcβˆ—KB_{c}^{\ast}K decays (nn == 1, 2, 3) are investigated with perturbative QCD approach firstly. The absolute branching ratios for Ξ₯(nS){\Upsilon}(nS) β†’{\to} Bcβˆ—Ο€B_{c}^{\ast}{\pi} and Bcβˆ—KB_{c}^{\ast}K decays are estimated to reach up to about 10βˆ’1010^{-10} and 10βˆ’1110^{-11}, respectively, which might possibly be measured by the future experiments.Comment: 16 pages, 3 figure

    Determination of the chiral indices of tungsten disulfide (WS2) nanotubes by electron diffraction

    Get PDF
    An electron diffraction method is described and applied to analyze the atomic structure of individual tungsten disulfide (WS2) nanotubes. The method is based on a recently developed zoning scheme to determine the chiral indices of nanotubes by nanobeam electron diffraction. The chiral indices of a WS2 nanotube, which has its outermost shell missing on one end due to uneven growth of shells, is given to illustrate the indexing procedure. We also observed that the tubule chiralities within each WS2 nanotube display a mono-helical structure on average with a dispersion of a few degrees
    • …
    corecore