27,563 research outputs found

    Time Series Analysis Package /TSAP/ for terminal use

    Get PDF
    User manual in form of interactive, functionally dependent time series programs accessible in any order from remote termina

    Statistical Analysis of Project Pyro Liquid Propellant Explosion Data

    Get PDF
    Statistical regression analysis of Project Pyro cryogenic propellant explosion test dat

    Adapting the interior point method for the solution of LPs on serial, coarse grain parallel and massively parallel computers

    Get PDF
    In this paper we describe a unified scheme for implementing an interior point algorithm (IPM) over a range of computer architectures. In the inner iteration of the IPM a search direction is computed using Newton's method. Computationally this involves solving a sparse symmetric positive definite (SSPD) system of equations. The choice of direct and indirect methods for the solution of this system, and the design of data structures to take advantage of serial, coarse grain parallel and massively parallel computer architectures, are considered in detail. We put forward arguments as to why integration of the system within a sparse simplex solver is important and outline how the system is designed to achieve this integration

    Experimental determination of the degree of quantum polarisation of continuous variable states

    Get PDF
    We demonstrate excitation-manifold resolved polarisation characterisation of continuous-variable (CV) quantum states. In contrast to traditional characterisation of polarisation that is based on the Stokes parameters, we experimentally determine the Stokes vector of each excitation manifold separately. Only for states with a given photon number does the methods coincide. For states with an indeterminate photon number, for example Gaussian states, the employed method gives a richer and more accurate description. We apply the method both in theory and in experiment to some common states to demonstrate its advantages.Comment: 5 page

    Approximation of corner polyhedra with families of intersection cuts

    Full text link
    We study the problem of approximating the corner polyhedron using intersection cuts derived from families of lattice-free sets in Rn\mathbb{R}^n. In particular, we look at the problem of characterizing families that approximate the corner polyhedron up to a constant factor, which depends only on nn and not the data or dimension of the corner polyhedron. The literature already contains several results in this direction. In this paper, we use the maximum number of facets of lattice-free sets in a family as a measure of its complexity and precisely characterize the level of complexity of a family required for constant factor approximations. As one of the main results, we show that, for each natural number nn, a corner polyhedron with nn basic integer variables and an arbitrary number of continuous non-basic variables is approximated up to a constant factor by intersection cuts from lattice-free sets with at most ii facets if i>2n1i> 2^{n-1} and that no such approximation is possible if i2n1i \leq 2^{n-1}. When the approximation factor is allowed to depend on the denominator of the fractional vertex of the linear relaxation of the corner polyhedron, we show that the threshold is i>ni > n versus ini \leq n. The tools introduced for proving such results are of independent interest for studying intersection cuts

    W Plus Multiple Jets at the LHC with High Energy Jets

    Get PDF
    We study the production of a W boson in association with n hard QCD jets (for n>=2), with a particular emphasis on results relevant for the Large Hadron Collider (7 TeV and 8 TeV). We present predictions for this process from High Energy Jets, a framework for all-order resummation of the dominant contributions from wide-angle QCD emissions. We first compare predictions against recent ATLAS data and then shift focus to observables and regions of phase space where effects beyond NLO are expected to be large.Comment: 19 pages, 9 figure

    Enumeration of chord diagrams on many intervals and their non-orientable analogs

    Get PDF
    Two types of connected chord diagrams with chord endpoints lying in a collection of ordered and oriented real segments are considered here: the real segments may contain additional bivalent vertices in one model but not in the other. In the former case, we record in a generating function the number of fatgraph boundary cycles containing a fixed number of bivalent vertices while in the latter, we instead record the number of boundary cycles of each fixed length. Second order, non-linear, algebraic partial differential equations are derived which are satisfied by these generating functions in each case giving efficient enumerative schemes. Moreover, these generating functions provide multi-parameter families of solutions to the KP hierarchy. For each model, there is furthermore a non-orientable analog, and each such model likewise has its own associated differential equation. The enumerative problems we solve are interpreted in terms of certain polygon gluings. As specific applications, we discuss models of several interacting RNA molecules. We also study a matrix integral which computes numbers of chord diagrams in both orientable and non-orientable cases in the model with bivalent vertices, and the large-N limit is computed using techniques of free probability.Comment: 23 pages, 7 figures; revised and extended versio

    Does money matter in inflation forecasting?.

    Get PDF
    This paper provides the most fully comprehensive evidence to date on whether or not monetary aggregates are valuable for forecasting US inflation in the early to mid 2000s. We explore a wide range of different definitions of money, including different methods of aggregation and different collections of included monetary assets. In our forecasting experiment we use two non-linear techniques, namely, recurrent neural networks and kernel recursive least squares regression - techniques that are new to macroeconomics. Recurrent neural networks operate with potentially unbounded input memory, while the kernel regression technique is a finite memory predictor. The two methodologies compete to find the best fitting US inflation forecasting models and are then compared to forecasts from a naive random walk model. The best models were non-linear autoregressive models based on kernel methods. Our findings do not provide much support for the usefulness of monetary aggregates in forecasting inflation

    Squeezed state purification with linear optics and feed forward

    Get PDF
    A scheme for optimal and deterministic linear optical purification of mixed squeezed Gaussian states is proposed and experimentally demonstrated. The scheme requires only linear optical elements and homodyne detectors, and allows the balance between purification efficacy and squeezing degradation to be controlled. One particular choice of parameters gave a ten-fold reduction of the thermal noise with a corresponding squeezing degradation of only 11%. We prove optimality of the protocol, and show that it can be used to enhance the performance of quantum informational protocols such as dense coding and entanglement generation.Comment: 4 pages, 3 figure
    corecore