Decentralized Constraint Satisfaction

We show that several important resource allocation problems in wireless networks fit within the common framework of Constraint Satisfaction Problems (CSPs). Inspired by the requirements of these applications, where variables are located at distinct network devices that may not be able to communicate but may interfere, we define natural criteria that a CSP solver must possess in order to be practical. We term these algorithms decentralized CSP solvers. The best known CSP solvers were designed for centralized problems and do not meet these criteria. We introduce a stochastic decentralized CSP solver and prove that it will find a solution in almost surely finite time, should one exist, also showing it has many practically desirable properties. We benchmark the algorithm's performance on a well-studied class of CSPs, random k-SAT, illustrating that the time the algorithm takes to find a satisfying assignment is competitive with stochastic centralized solvers on problems with order a thousand variables despite its decentralized nature. We demonstrate the solver's practical utility for the problems that motivated its introduction by using it to find a non-interfering channel allocation for a network formed from data from downtown Manhattan

Application of velocity-based gain-scheduling to lateral auto-pilot design for an agile missile

In this paper a modern gain-scheduling methodology is proposed which exploits recently developed velocity-based techniques to resolve many of the deficiencies of classical gain-scheduling approaches (restriction to near equilibrium operation, to slow rate of variation). This is achieved while maintaining continuity with linear methods and providing an open design framework (any linear synthesis approach may be used) which supports divide and conquer design strategies. The application of velocity-based gain-scheduling techniques is demonstrated in application to a demanding, highly nonlinear, missile control design task. Scheduling on instantaneous incidence (a rapidly varying quantity) is well-known to lead to considerable difficulties with classical gain-scheduling methods. It is shown that the methods proposed here can, however, be used to successfully design an effective and robust gain-scheduled controller

Measurement of the B0-anti-B0-Oscillation Frequency with Inclusive Dilepton Events

The $B^0$-$\bar B^0$ oscillation frequency has been measured with a sample of 23 million \B\bar B pairs collected with the BABAR detector at the PEP-II asymmetric B Factory at SLAC. In this sample, we select events in which both B mesons decay semileptonically and use the charge of the leptons to identify the flavor of each B meson. A simultaneous fit to the decay time difference distributions for opposite- and same-sign dilepton events gives $\Delta m_d = 0.493 \pm 0.012{(stat)}\pm 0.009{(syst)}$ ps$^{-1}$.Comment: 7 pages, 1 figure, submitted to Physical Review Letter

Improved Limits on B0B^{0} decays to invisible (+γ)(+\gamma) final states

We establish improved upper limits on branching fractions for B0 decays to final States 10 where the decay products are purely invisible (i.e., no observable final state particles) and for final states where the only visible product is a photon. Within the Standard Model, these decays have branching fractions that are below the current experimental sensitivity, but various models of physics beyond the Standard Model predict significant contributions for these channels. Using 471 million BB pairs collected at the Y(4S) resonance by the BABAR experiment at the PEP-II e+e- storage ring at the SLAC National Accelerator Laboratory, we establish upper limits at the 90% confidence level of 2.4x10^-5 for the branching fraction of B0-->Invisible and 1.7x10^-5 for the branching fraction of B0-->Invisible+gammaComment: 8 pages, 3 postscript figures, submitted to Phys. Rev. D (Rapid Communications

Coherent Photons and Pomerons in Heavy Ion Collisions

Ultrarelativistic heavy ion beams carry large electromagnetic and strong absorptive fields, allowing exploration of a variety of physics. Two-photon, photon-Pomeron, and double Pomeron interactions can probe a huge variety of couplings and final states. RHIC will be the first heavy ion accelerator energetic enough to produce hadronic final states via coherent couplings. Virtual photons from the nuclear EM fields can interact in two-photon interactions, which can be exploited to study many particle spectroscopy and QCD topics. Because the photon flux scales as $Z^2$, Two-photon luminosities are large up to an energy of about \gamma\hbar c/R~ 3 GeV/c. Photon-Pomeron interactions are sensitive to how different vector mesons, including the $J/\psi$, interact with nuclear matter. $PP$ collisions rates are sensitive to the range of the Pomeron. Signals can be separated from backgrounds by using cuts on final state isolation (rapidity gaps) and $p_\perp$. We present Monte Carlo studies of different backgrounds, showing that representative signals can be extracted with good rates and signal to noise ratios.Comment: 5 pages; presented at the 6th Conference on the Intersections of Particle and Nuclear Physics, Big Sky, MO, May 27-June 2, 199

Wind turbine rotor acceleration : identification using Gaussian regression

Gaussian processes prior model methods for data analysis are applied to wind turbine time series data to identify both rotor speed and rotor acceleration from a poor measurement of rotor speed. In so doing, two issues are addressed. Firstly, the rotor speed is extracted from a combined rotor speed and generator speed measurement. A novel adaptation of Gaussian process regression based on two independent processes ratherthan a single process is presented. Secondly, efficient algorithms for the manipulation of large matrices are required. The Toeplitz nature of the matrices is exploited to derive novel fast algorithms for the Gaussian process methodology that are memory efficient