9,184 research outputs found
BSAURUS- A Package For Inclusive B-Reconstruction in DELPHI
BSAURUS is a software package for the inclusive reconstruction of B-hadrons
in Z-decay events taken by the DELPHI detector at LEP. The BSAURUS goal is to
reconstruct B-decays, by making use of as many properties of b-jets as
possible, with high efficiency and good purity. This is achieved by exploiting
the capabilities of the DELPHI detector to their extreme, applying wherever
possible physics knowledge about B production and decays and combining
different information sources with modern tools- mainly artificial neural
networks. This note provides a reference of how BSAURUS outputs are formed, how
to access them within the DELPHI framework, and the physics performance one can
expect.Comment: 52 pages, 24 figures, added author Z.
MACRIB High efficiency - high purity hadron identification for DELPHI
Analysis of the data shows that hadron tags of the two standard DELPHI particle identification packages RIBMEAN and HADSIGN are weakly correlated. This led to the idea of constructing a neural network for both kaon and proton identification using as input the existing tags from RIBMEAN and HADSIGN, as well as preproccessed TPC and RICH detector measurements together with additional dE/dx information from the DELPHI vertex detector. It will be shown in this note that the net output is much more efficient at the same purity than the HADSIGN or RIBMEAN tags alone. We present an easy-to-use routine performing the necessary calculations
Characterization of nanometer-sized, mechanically exfoliated graphene on the H-passivated Si(100) surface using scanning tunnelling microscopy
We have developed a method for depositing graphene monolayers and bilayers
with minimum lateral dimensions of 2-10 nm by the mechanical exfoliation of
graphite onto the Si(100)-2x1:H surface. Room temperature, ultra-high vacuum
(UHV) tunnelling spectroscopy measurements of nanometer-sized single-layer
graphene reveal a size dependent energy gap ranging from 0.1-1 eV. Furthermore,
the number of graphene layers can be directly determined from scanning
tunnelling microscopy (STM) topographic contours. This atomistic study provides
an experimental basis for probing the electronic structure of nanometer-sized
graphene which can assist the development of graphene-based nanoelectronics.Comment: Accepted for publication in Nanotechnolog
An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
In this paper, we study the Learning With Errors problem and its binary
variant, where secrets and errors are binary or taken in a small interval. We
introduce a new variant of the Blum, Kalai and Wasserman algorithm, relying on
a quantization step that generalizes and fine-tunes modulus switching. In
general this new technique yields a significant gain in the constant in front
of the exponent in the overall complexity. We illustrate this by solving p
within half a day a LWE instance with dimension n = 128, modulus ,
Gaussian noise and binary secret, using
samples, while the previous best result based on BKW claims a time
complexity of with samples for the same parameters. We then
introduce variants of BDD, GapSVP and UniqueSVP, where the target point is
required to lie in the fundamental parallelepiped, and show how the previous
algorithm is able to solve these variants in subexponential time. Moreover, we
also show how the previous algorithm can be used to solve the BinaryLWE problem
with n samples in subexponential time . This
analysis does not require any heuristic assumption, contrary to other algebraic
approaches; instead, it uses a variant of an idea by Lyubashevsky to generate
many samples from a small number of samples. This makes it possible to
asymptotically and heuristically break the NTRU cryptosystem in subexponential
time (without contradicting its security assumption). We are also able to solve
subset sum problems in subexponential time for density , which is of
independent interest: for such density, the previous best algorithm requires
exponential time. As a direct application, we can solve in subexponential time
the parameters of a cryptosystem based on this problem proposed at TCC 2010.Comment: CRYPTO 201
Large Extra Dimensions from a Small Extra Dimension
Models with extra dimensions have changed our understanding of the hierarchy
problem. In general, these models explain the weakness of gravity by diluting
gravity in a large bulk volume, or by localizing the graviton away from the
standard model. In this paper, we show that the warped geometries necessary for
the latter scenario can naturally induce the large volumes necessary for the
former. We present a model in which a large volume is stabilized without
supersymmetry. We comment on the phenomenology of this scenario and
generalizations to additional dimensions.Comment: Some formulae altered, conclusions unchange
Two-Triplet-Dimer Excitation Spectra in the Shastry-Sutherland Model for SrCu_2(BO_3)_2
By using the perturbation expansion up to the fifth order, we study the
two-triplet-dimer excitation spectra in the Shastry-Sutherland model, where the
localized nature of a triplet-dimer, the propagation of a triplet-dimer pair by
the correlated hopping and the long-range interactions between triplet-dimers
play an essential role. It is found that the dispersion relations for
first-neighbor triplet-dimer pair excitations with S=1 and p-type symmetry
qualitatively explain the second-lowest branch observed in the neutron
inelastic scattering experiment. It is also predicted that the second-lowest
branch consists of two components, p_x- and p_y-states, with slightly different
excitation energies. The origin of the singlet mode at 3.7meV observed in the
Raman scattering experiment is also discussed.Comment: 5 pages, 3 figure
Competing Spin-Gap Phases in a Frustrated Quantum Spin System in Two Dimensions
We investigate quantum phase transitions among the spin-gap phases and the
magnetically ordered phases in a two-dimensional frustrated antiferromagnetic
spin system, which interpolates several important models such as the
orthogonal-dimer model as well as the model on the 1/5-depleted square lattice.
By computing the ground state energy, the staggered susceptibility and the spin
gap by means of the series expansion method, we determine the ground-state
phase diagram and discuss the role of geometrical frustration. In particular,
it is found that a RVB-type spin-gap phase proposed recently for the
orthogonal-dimer system is adiabatically connected to the plaquette phase known
for the 1/5-depleted square-lattice model.Comment: 6 pages, to appear in JPSJ 70 (2001
K*(892)0 Production in Relativistic Heavy Ion Collisions at sqrt(s_NN) = 130 GeV
Preliminary results on the K*(892)0 -> pi + K production using the
mixed-event technique are presented. The measurements are performed at
mid-rapidity by the STAR detector in sqrt(s_NN) = 130 GeV Au-Au collisions at
RHIC. The K*0 to negative hadron, kaon and phi ratios are obtained and compared
to the measurements in e+e-, pp and pbarp at various energies.Comment: 8 pages, 3 figures, proceedings of Strange Quarks in Matter
(SQM2001), Frankfurt am Main, Germany, to be published in J. Phys.
Generalised Shastry-Sutherland Models in three and higher dimensions
We construct Heisenberg anti-ferromagnetic models in arbitrary dimensions
that have isotropic valence bond crystals (VBC) as their exact ground states.
The d=2 model is the Shastry-Sutherland model. In the 3-d case we show that it
is possible to have a lattice structure, analogous to that of SrCu_2(BO_3)_2,
where the stronger bonds are associated with shorter bond lengths. A dimer mean
field theory becomes exact at d -> infinity and a systematic 1/d expansion can
be developed about it. We study the Neel-VBC transition at large d and find
that the transition is first order in even but second order in odd dimensions.Comment: Published version; slightly expande
Simple Encrypted Arithmetic Library - SEAL v2.1
Achieving fully homomorphic encryption was a longstanding open problem in cryptography until it was resolved by Gentry in 2009. Soon after, several homomorphic encryption schemes were proposed. The early homomorphic encryption schemes were extremely impractical, but recently new implementations, new data encoding techniques, and a better understanding of the applications have started to change the situation. In this paper we introduce the most recent version (v2.1) of Simple Encrypted Arithmetic Library - SEAL, a homomorphic encryption library developed by Microsoft Research, and describe some of its core functionality
- …