Testrun results from prototype fiber detectors for high rate particle tracking

A fiber detector concept has been realized allowing to registrate particles within less than 100 nsec with a space point precision of about 0.1 mm at low occupancy. Three full size prototypes have been build by different producers and tested at a 3 GeV electron beam at DESY. After 3 m of light guides 8-10 photoelectrons were registrated by multichannel photomultipliers providing an efficiency of more than 99%. Using all available data a resolution of 0.086 mm was measured.Comment: 18 pages, 17 figure

Phase Transition in the Number Partitioning Problem

Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the pseudo-polynomiality of number partitioning. The phase diagram and the value of the typical ground state energy are calculated.Comment: minor changes (references, typos and discussion of results

Optimal combinations of imperfect objects

We address the question of how to make best use of imperfect objects, such as defective analog and digital components. We show that perfect, or near-perfect, devices can be constructed by taking combinations of such defects. Any remaining objects can be recycled efficiently. In addition to its practical applications, our `defect combination problem' provides a novel generalization of classical optimization problems.Comment: 4 pages, 3 figures, minor change

Adaptive Regret Minimization in Bounded-Memory Games

Online learning algorithms that minimize regret provide strong guarantees in situations that involve repeatedly making decisions in an uncertain environment, e.g. a driver deciding what route to drive to work every day. While regret minimization has been extensively studied in repeated games, we study regret minimization for a richer class of games called bounded memory games. In each round of a two-player bounded memory-m game, both players simultaneously play an action, observe an outcome and receive a reward. The reward may depend on the last m outcomes as well as the actions of the players in the current round. The standard notion of regret for repeated games is no longer suitable because actions and rewards can depend on the history of play. To account for this generality, we introduce the notion of k-adaptive regret, which compares the reward obtained by playing actions prescribed by the algorithm against a hypothetical k-adaptive adversary with the reward obtained by the best expert in hindsight against the same adversary. Roughly, a hypothetical k-adaptive adversary adapts her strategy to the defender's actions exactly as the real adversary would within each window of k rounds. Our definition is parametrized by a set of experts, which can include both fixed and adaptive defender strategies. We investigate the inherent complexity of and design algorithms for adaptive regret minimization in bounded memory games of perfect and imperfect information. We prove a hardness result showing that, with imperfect information, any k-adaptive regret minimizing algorithm (with fixed strategies as experts) must be inefficient unless NP=RP even when playing against an oblivious adversary. In contrast, for bounded memory games of perfect and imperfect information we present approximate 0-adaptive regret minimization algorithms against an oblivious adversary running in time n^{O(1)}.Comment: Full Version. GameSec 2013 (Invited Paper

Exponentially hard problems are sometimes polynomial, a large deviation analysis of search algorithms for the random Satisfiability problem, and its application to stop-and-restart resolutions

A large deviation analysis of the solving complexity of random 3-Satisfiability instances slightly below threshold is presented. While finding a solution for such instances demands an exponential effort with high probability, we show that an exponentially small fraction of resolutions require a computation scaling linearly in the size of the instance only. This exponentially small probability of easy resolutions is analytically calculated, and the corresponding exponent shown to be smaller (in absolute value) than the growth exponent of the typical resolution time. Our study therefore gives some theoretical basis to heuristic stop-and-restart solving procedures, and suggests a natural cut-off (the size of the instance) for the restart.Comment: Revtex file, 4 figure

Number partitioning as random energy model

Number partitioning is a classical problem from combinatorial optimisation. In physical terms it corresponds to a long range anti-ferromagnetic Ising spin glass. It has been rigorously proven that the low lying energies of number partitioning behave like uncorrelated random variables. We claim that neighbouring energy levels are uncorrelated almost everywhere on the energy axis, and that energetically adjacent configurations are uncorrelated, too. Apparently there is no relation between geometry (configuration) and energy that could be exploited by an optimization algorithm. This ``local random energy'' picture of number partitioning is corroborated by numerical simulations and heuristic arguments.Comment: 8+2 pages, 9 figures, PDF onl

Nonlinear Schr\"odinger Equation with Spatio-Temporal Perturbations

We investigate the dynamics of solitons of the cubic Nonlinear Schr\"odinger Equation (NLSE) with the following perturbations: non-parametric spatio-temporal driving of the form $f(x,t) = a \exp[i K(t) x]$, damping, and a linear term which serves to stabilize the driven soliton. Using the time evolution of norm, momentum and energy, or, alternatively, a Lagrangian approach, we develop a Collective-Coordinate-Theory which yields a set of ODEs for our four collective coordinates. These ODEs are solved analytically and numerically for the case of a constant, spatially periodic force $f(x)$. The soliton position exhibits oscillations around a mean trajectory with constant velocity. This means that the soliton performs, on the average, a unidirectional motion although the spatial average of the force vanishes. The amplitude of the oscillations is much smaller than the period of $f(x)$. In order to find out for which regions the above solutions are stable, we calculate the time evolution of the soliton momentum $P(t)$ and soliton velocity $V(t)$: This is a parameter representation of a curve $P(V)$ which is visited by the soliton while time evolves. Our conjecture is that the soliton becomes unstable, if this curve has a branch with negative slope. This conjecture is fully confirmed by our simulations for the perturbed NLSE. Moreover, this curve also yields a good estimate for the soliton lifetime: the soliton lives longer, the shorter the branch with negative slope is.Comment: 21 figure

Internal Modes and Magnon Scattering on Topological Solitons in 2d Easy-Axis Ferromagnets

We study the magnon modes in the presence of a topological soliton in a 2d Heisenberg easy-axis ferromagnet. The problem of magnon scattering on the soliton with arbitrary relation between the soliton radius R and the "magnetic length" Delta_0 is investigated for partial modes with different values of the azimuthal quantum numbers m. Truly local modes are shown to be present for all values of m, when the soliton radius is enough large. The eigenfrequencies of such internal modes are calculated analytically on limiting case of a large soliton radius and numerically for arbitrary soliton radius. It is demonstrated that the model of an isotropic magnet, which admits an exact analytical investigation, is not adequate even for the limit of small radius solitons, R<<Delta_0: there exists a local mode with nonzero frequency. We use the data about local modes to derive the effective equation of soliton motion; this equation has the usual Newtonian form in contrast to the case of the easy-plane ferromagnet. The effective mass of the soliton is found.Comment: 33 pages (REVTeX), 12 figures (EPS