237 research outputs found
A polynomial training algorithm for calculating perceptrons of optimal stability
Recomi (REpeated COrrelation Matrix Inversion) is a polynomially fast
algorithm for searching optimally stable solutions of the perceptron learning
problem. For random unbiased and biased patterns it is shown that the algorithm
is able to find optimal solutions, if any exist, in at worst O(N^4) floating
point operations. Even beyond the critical storage capacity alpha_c the
algorithm is able to find locally stable solutions (with negative stability) at
the same speed. There are no divergent time scales in the learning process. A
full proof of convergence cannot yet be given, only major constituents of a
proof are shown.Comment: 11 pages, Latex, 4 EPS figure
Physics with e<SUP>+</SUP>e<SUP>-</SUP> linear colliders
We describe the physics potential of e+e- linear colliders in this report. These machines are planned to operate in the first phase at a center-of-mass energy of 500 GeV, before being scaled up to about 1 TeV. In the second phase of the operation, a final energy of about 2 TeV is expected. The machines will allow us to perform precision tests of the heavy particles in the Standard Model, the top quark and the electroweak bosons. They are ideal facilities for exploring the properties of Higgs particles, in particular in the intermediate mass range. New vector bosons and novel matter particles in extended gauge theories can be searched for and studied thoroughly. The machines provide unique opportunities for the discovery of particles in supersymmetric extensions of the Standard Model, the spectrum of Higgs particles, the supersymmetric partners of the electroweak gauge and Higgs bosons, and of the matter particles. High precision analyses of their properties and interactions will allow for extrapolations to energy scales close to the Planck scale where gravity becomes significant. In alternative scenarios, like compositeness models, novel matter particles and interactions can be discovered and investigated in the energy range above the existing colliders up to the TeV scale. Whatever scenario is realized in Nature, the discovery potential of e+e- linear colliders and the high-precision with which the properties of particles and their interactions can be analysed, define an exciting physics programme complementary to hadron machines
Simulation of the process within electroweak theory with longitudinally polarized initial electrons
We present simple analytic expressions for the distributions of the Bhabha
scattering process with emission of one hard photon, including weak boson
exchanges, and with longitudinal polarization of the initial electron. The
results from the Monte Carlo generator BHAGEN-1PH, based on these expressions,
are presented and compared, for the unpolarized case, with those existing in
literature.Comment: 9 pages, plain Tex, no figures, small change in Table
Optimal coloured perceptrons
Ashkin-Teller type perceptron models are introduced. Their maximal capacity
per number of couplings is calculated within a first-step
replica-symmetry-breaking Gardner approach. The results are compared with
extensive numerical simulations using several algorithms.Comment: 8 pages in Latex with 2 eps figures, RSB1 calculations has been adde
QED Corrections to Deep Inelastic Scattering with Tagged Photons at HERA
We calculate the QED corrections to deep inelastic scattering with tagged
photons at HERA in the leading logarithmic approximation. Due to the special
experimental setup, two large scales appear in the calculation that lead to two
large logarithms of comparable size. The relation of our formalism to the
conventional structure function formalism is outlined. We present some
numerical results and compare with previous calculations.Comment: 7 pages, REVTeX, 2 figures; published versio
Event Generators for Bhabha Scattering
The results obtained by the "Event Generators for Bhabha Scattering" working
group during the CERN Workshop "Physics at LEP2" (1994/1995) are presented.Comment: 70 pages, PostScript file. To appear in the Report of the Workshop on
Physics at LEP2, G. Altarelli T. Sjostrand and F. Zwirner ed
Storage capacity of a constructive learning algorithm
Upper and lower bounds for the typical storage capacity of a constructive
algorithm, the Tilinglike Learning Algorithm for the Parity Machine [M. Biehl
and M. Opper, Phys. Rev. A {\bf 44} 6888 (1991)], are determined in the
asymptotic limit of large training set sizes. The properties of a perceptron
with threshold, learning a training set of patterns having a biased
distribution of targets, needed as an intermediate step in the capacity
calculation, are determined analytically. The lower bound for the capacity,
determined with a cavity method, is proportional to the number of hidden units.
The upper bound, obtained with the hypothesis of replica symmetry, is close to
the one predicted by Mitchinson and Durbin [Biol. Cyber. {\bf 60} 345 (1989)].Comment: 13 pages, 1 figur
Neutralino Proton Cross Sections In Supergravity Models
The neutralino-proton cross section is examined for supergravity models with
R-parity invariance with universal and non-universal soft breaking. The region
of parameter space that dark matter detectors are currently (or will be
shortly) sensitive i.e. pb, is examined. For universal
soft breaking (mSUGRA), detectors with sensitivity
pb will be able to
sample parts of the parameter space for .
Current relic density bounds restrict GeV
for the maximum cross sections, which is below where astronomical uncertainties
about the Milky Way are relevant. Nonuniversal soft breaking models can allow
much larger cross sections and can sample the parameter space for . In such models, can be quite large reducing the
tension between proton decay bounds and dark matter analysis. We note the
existance of two new domains where coannihilation effects can enter, i.e. for
mSUGRA at large , and for nonuniversal models with small .Comment: 22 pages, latex, 18 figure
- …