Validation of frequency and mode extraction calculations from time-domain simulations of accelerator cavities

The recently developed frequency extraction algorithm [G.R. Werner and J.R. Cary, J. Comp. Phys. 227, 5200 (2008)] that enables a simple FDTD algorithm to be transformed into an efficient eigenmode solver is applied to a realistic accelerator cavity modeled with embedded boundaries and Richardson extrapolation. Previously, the frequency extraction method was shown to be capable of distinguishing M degenerate modes by running M different simulations and to permit mode extraction with minimal post-processing effort that only requires solving a small eigenvalue problem. Realistic calculations for an accelerator cavity are presented in this work to establish the validity of the method for realistic modeling scenarios and to illustrate the complexities of the computational validation process. The method is found to be able to extract the frequencies with error that is less than a part in 10^5. The corrected experimental and computed values differ by about one parts in 10^$, which is accounted for (in largest part) by machining errors. The extraction of frequencies and modes from accelerator cavities provides engineers and physicists an understanding of potential cavity performance as it depends on shape without incurring manufacture and measurement costs

Resource Control for Synchronous Cooperative Threads

We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a \emph{synchronous} model of interaction based on cooperative threads whose execution proceeds in synchronous rounds called instants. Our contribution is a system of compositional static analyses to guarantee that each instant terminates and to bound the size of the values computed by the system as a function of the size of its parameters at the beginning of the instant. Our method generalises an approach designed for first-order functional languages that relies on a combination of standard termination techniques for term rewriting systems and an analysis of the size of the computed values based on the notion of quasi-interpretation. We show that these two methods can be combined to obtain an explicit polynomial bound on the resources needed for the execution of the system during an instant. As a second contribution, we introduce a virtual machine and a related bytecode thus producing a precise description of the resources needed for the execution of a system. In this context, we present a suitable control flow analysis that allows to formulte the static analyses for resource control at byte code level

Quantitative Models and Implicit Complexity

We give new proofs of soundness (all representable functions on base types lies in certain complexity classes) for Elementary Affine Logic, LFPL (a language for polytime computation close to realistic functional programming introduced by one of us), Light Affine Logic and Soft Affine Logic. The proofs are based on a common semantical framework which is merely instantiated in four different ways. The framework consists of an innovative modification of realizability which allows us to use resource-bounded computations as realisers as opposed to including all Turing computable functions as is usually the case in realizability constructions. For example, all realisers in the model for LFPL are polynomially bounded computations whence soundness holds by construction of the model. The work then lies in being able to interpret all the required constructs in the model. While being the first entirely semantical proof of polytime soundness for light logi cs, our proof also provides a notable simplification of the original already semantical proof of polytime soundness for LFPL. A new result made possible by the semantic framework is the addition of polymorphism and a modality to LFPL thus allowing for an internal definition of inductive datatypes.Comment: 29 page

JET ANALYSIS BY NEURAL NETWORKS IN HIGH ENERGY HADRON-HADRON COLLISIONS

We study the possibility to employ neural networks to simulate jet clustering procedures in high energy hadron-hadron collisions. We concentrate our analysis on the Fermilab Tevatron energy and on the $k_\bot$ algorithm. We consider both supervised multilayer feed-forward network trained by the backpropagation algorithm and unsupervised learning, where the neural network autonomously organizes the events in clusters.Comment: 9 pages, latex, 2 figures not included

The Power of Non-Determinism in Higher-Order Implicit Complexity

We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we consider cons-free programs of varying data orders, equipped with explicit non-deterministic choice. Cons-freeness roughly means that data constructors cannot occur in function bodies and all manipulation of storage space thus has to happen indirectly using the call stack. While cons-free programs have previously been used by several authors to characterise complexity classes, the work on non-deterministic programs has almost exclusively considered programs of data order 0. Previous work has shown that adding explicit non-determinism to cons-free programs taking data of order 0 does not increase expressivity; we prove that this - dramatically - is not the case for higher data orders: adding non-determinism to programs with data order at least 1 allows for a characterisation of the entire class of elementary-time decidable sets. Finally we show how, even with non-deterministic choice, the original hierarchy of characterisations is restored by imposing different restrictions.Comment: pre-edition version of a paper accepted for publication at ESOP'1

Crab cavities for linear colliders

Crab cavities have been proposed for a wide number of accelerators and interest in crab cavities has recently increased after the successful operation of a pair of crab cavities in KEK-B. In particular crab cavities are required for both the ILC and CLIC linear colliders for bunch alignment. Consideration of bunch structure and size constraints favour a 3.9 GHz superconducting, multi-cell cavity as the solution for ILC, whilst bunch structure and beam-loading considerations suggest an X-band copper travelling wave structure for CLIC. These two cavity solutions are very different in design but share complex design issues. Phase stabilisation, beam loading, wakefields and mode damping are fundamental issues for these crab cavities. Requirements and potential design solutions will be discussed for both colliders.Comment: 3 pages. To be published in proceedings of LINAC 2008, Victoria, Canad

Search for associated Higgs boson production using like charge dilepton events in p(p)over-bar collisions at root s=1.96 TeV

We present a search for associated Higgs boson production in the process p (p) over bar -> W/ZH -> l(+/-)l'(+/-) + X in ee, e mu, and mu mu final states. The search is based on data collected by the D0 experiment at the Fermilab Tevatron Collider at root s = 1.96 TeV corresponding to 5.3 fb(-1) of integrated luminosity. We require two isolated leptons (electrons or muons) with the same electric charge and additional kinematic requirements. No significant excess above background is observed, and we set 95% C. L. observed (expected) upper limits on ratio of the production cross section to the standard model prediction of 6.4 (7.3) for a Higgs boson mass of 165 GeV and 13.5 (19.8) for a mass of 115 GeV

Dynamic critical behavior of the worm algorithm for the Ising model

We study the dynamic critical behavior of the worm algorithm for the two- and three-dimensional Ising models, by Monte Carlo simulation. The autocorrelation functions exhibit an unusual three-time-scale behavior. As a practical matter, the worm algorithm is slightly more efficient than Swendsen-Wang for simulating the two-point function of the three-dimensional Ising model

Measurement of the antineutrino to neutrino charged-current interaction cross section ratio in MINERvA

We present measurements of the neutrino and antineutrino total charged-current cross sections on carbon and their ratio using the MINERvA scintillator-tracker. The measurements span the energy range 2-22 GeV and were performed using forward and reversed horn focusing modes of the Fermilab low-energy NuMI beam to obtain large neutrino and antineutrino samples. The flux is obtained using a subsample of charged-current events at low hadronic energy transfer along with precise higher energy external neutrino cross section data overlapping with our energy range between 12-22 GeV. We also report on the antineutrino-neutrino cross section ratio, R-CC, which does not rely on external normalization information. Our ratio measurement, obtained within the same experiment using the same technique, benefits from the cancellation of common sample systematic uncertainties and reaches a precision of similar to 5% at low energy. Our results for the antineutrino-nucleus scattering cross section and for RCC are the most precise to date in the energy range E-v \u3c 6 GeV