4,839 research outputs found
Prospects for the first Top pair cross section measurement in the semileptonic and dilepton channels at CMS
Although the top quark has been discovered in 1995 and studied extensively by
the Tevatron experiments, the top quark will remain special for years to come
due to unique opportunities it offers. Because of the large top-antitop
production cross section and high luminosity, the LHC would be a Top factory,
producing a large sample of top quarks even at the initial low luminosities.
This will enable a rich program of top quark physics to be explored, both
within the Standard Model and using top quarks as probes of physics beyond the
Standard Model. Prospects for the observation of top pair production in the
proton-proton collisions at the center of mass energy =10 TeV in the
dilepton and lepton+jets final state are discussed. The emphasis is put on
analysis strategies for the early phase of CMS operation with data
corresponding to integrated luminosities of 10-20 pb considering a
realistic detector performance.Comment: 6 pages, To be published in the proceedings of the DPF-2009
Conference, Detroit, MI, July 2009, eConf 09072
Generalized Analogs of the Heisenberg Uncertainty Inequality
We investigate locally compact topological groups for which a generalized
analogue of Heisenberg uncertainty inequality hold. In particular, it is shown
that this inequality holds for (where is a
separable unimodular locally compact group of type I), Euclidean Motion group
and several general classes of nilpotent Lie groups which include thread-like
nilpotent Lie groups, -NPC nilpotent Lie groups and several low-dimensional
nilpotent Lie groups
Some Efficient Solutions to Yao's Millionaire Problem
We present three simple and efficient protocol constructions to solve Yao's
Millionaire Problem when the parties involved are non-colluding and
semi-honest. The first construction uses a partially homomorphic Encryption
Scheme and is a 4-round scheme using 2 encryptions, 2 homomorphic circuit
evaluations (subtraction and XOR) and a single decryption. The second
construction uses an untrusted third party and achieves a communication
overhead linear in input bit-size with the help of an order preserving
function.Moreover, the second construction does not require an apriori input
bound and can work on inputs of different bit-sizes. The third construction
does not use a third party and, even though, it has a quadratic communication
overhead, it is a fairly simple construction.Comment: 17 page
- …