13,281 research outputs found
Finding Top-k Dominance on Incomplete Big Data Using Map-Reduce Framework
Incomplete data is one major kind of multi-dimensional dataset that has random-distributed missing nodes in its dimensions. It is very difficult to retrieve information from this type of dataset when it becomes huge. Finding top-k dominant values in this type of dataset is a challenging procedure. Some algorithms are present to enhance this process but are mostly efficient only when dealing with a small-size incomplete data. One of the algorithms that make the application of TKD query possible is the Bitmap Index Guided (BIG) algorithm. This algorithm strongly improves the performance for incomplete data, but it is not originally capable of finding top-k dominant values in incomplete big data, nor is it designed to do so. Several other algorithms have been proposed to find the TKD query, such as Skyband Based and Upper Bound Based algorithms, but their performance is also questionable. Algorithms developed previously were among the first attempts to apply TKD query on incomplete data; however, all these had weak performances or were not compatible with the incomplete data. This thesis proposes MapReduced Enhanced Bitmap Index Guided Algorithm (MRBIG) for dealing with the aforementioned issues. MRBIG uses the MapReduce framework to enhance the performance of applying top-k dominance queries on huge incomplete datasets. The proposed approach uses the MapReduce parallel computing approach using multiple computing nodes. The framework separates the tasks between several computing nodes that independently and simultaneously work to find the result. This method has achieved up to two times faster processing time in finding the TKD query result in comparison to previously presented algorithms
Electroweak corrections to W-boson pair production at the LHC
Vector-boson pair production ranks among the most important Standard-Model
benchmark processes at the LHC, not only in view of on-going Higgs analyses.
These processes may also help to gain a deeper understanding of the electroweak
interaction in general, and to test the validity of the Standard Model at
highest energies. In this work, the first calculation of the full one-loop
electroweak corrections to on-shell W-boson pair production at hadron colliders
is presented. We discuss the impact of the corrections on the total cross
section as well as on relevant differential distributions. We observe that
corrections due to photon-induced channels can be amazingly large at energies
accessible at the LHC, while radiation of additional massive vector bosons does
not influence the results significantly.Comment: 29 pages, 15 figures, 4 tables; some references and comments on
\gamma\gamma -> WW added; matches version published in JHE
Consistency of a recursive estimate of mixing distributions
Mixture models have received considerable attention recently and Newton
[Sankhy\={a} Ser. A 64 (2002) 306--322] proposed a fast recursive algorithm for
estimating a mixing distribution. We prove almost sure consistency of this
recursive estimate in the weak topology under mild conditions on the family of
densities being mixed. This recursive estimate depends on the data ordering and
a permutation-invariant modification is proposed, which is an average of the
original over permutations of the data sequence. A Rao--Blackwell argument is
used to prove consistency in probability of this alternative estimate. Several
simulations are presented, comparing the finite-sample performance of the
recursive estimate and a Monte Carlo approximation to the permutation-invariant
alternative along with that of the nonparametric maximum likelihood estimate
and a nonparametric Bayes estimate.Comment: Published in at http://dx.doi.org/10.1214/08-AOS639 the Annals of
Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical
Statistics (http://www.imstat.org
GraphCombEx: A Software Tool for Exploration of Combinatorial Optimisation Properties of Large Graphs
We present a prototype of a software tool for exploration of multiple
combinatorial optimisation problems in large real-world and synthetic complex
networks. Our tool, called GraphCombEx (an acronym of Graph Combinatorial
Explorer), provides a unified framework for scalable computation and
presentation of high-quality suboptimal solutions and bounds for a number of
widely studied combinatorial optimisation problems. Efficient representation
and applicability to large-scale graphs and complex networks are particularly
considered in its design. The problems currently supported include maximum
clique, graph colouring, maximum independent set, minimum vertex clique
covering, minimum dominating set, as well as the longest simple cycle problem.
Suboptimal solutions and intervals for optimal objective values are estimated
using scalable heuristics. The tool is designed with extensibility in mind,
with the view of further problems and both new fast and high-performance
heuristics to be added in the future. GraphCombEx has already been successfully
used as a support tool in a number of recent research studies using
combinatorial optimisation to analyse complex networks, indicating its promise
as a research software tool
Truss Decomposition in Massive Networks
The k-truss is a type of cohesive subgraphs proposed recently for the study
of networks. While the problem of computing most cohesive subgraphs is NP-hard,
there exists a polynomial time algorithm for computing k-truss. Compared with
k-core which is also efficient to compute, k-truss represents the "core" of a
k-core that keeps the key information of, while filtering out less important
information from, the k-core. However, existing algorithms for computing
k-truss are inefficient for handling today's massive networks. We first improve
the existing in-memory algorithm for computing k-truss in networks of moderate
size. Then, we propose two I/O-efficient algorithms to handle massive networks
that cannot fit in main memory. Our experiments on real datasets verify the
efficiency of our algorithms and the value of k-truss.Comment: VLDB201
- …