21,199 research outputs found

    Approximate renormalization for the break-up of invariant tori with three frequencies

    Full text link
    We construct an approximate renormalization transformation for Hamiltonian systems with three degrees of freedom in order to study the break-up of invariant tori with three incommensurate frequencies which belong to the cubic field Q(τ)Q(\tau), where τ3+τ22τ1=0\tau^3+\tau^2-2\tau-1=0. This renormalization has two fixed points~: a stable one and a hyperbolic one with a codimension one stable manifold. We compute the associated critical exponents that characterize the universality class for the break-up of the invariant tori we consider.Comment: 5 pages, REVTe

    Bayesian interpolation

    Get PDF
    Although Bayesian analysis has been in use since Laplace, the Bayesian method of model-comparison has only recently been developed in depth. In this paper, the Bayesian approach to regularization and model-comparison is demonstrated by studying the inference problem of interpolating noisy data. The concepts and methods described are quite general and can be applied to many other data modeling problems. Regularizing constants are set by examining their posterior probability distribution. Alternative regularizers (priors) and alternative basis sets are objectively compared by evaluating the evidence for them. “Occam's razor” is automatically embodied by this process. The way in which Bayes infers the values of regularizing constants and noise levels has an elegant interpretation in terms of the effective number of parameters determined by the data set. This framework is due to Gull and Skilling

    Information-based objective functions for active data selection

    Get PDF
    Learning can be made more efficient if we can actively select particularly salient data points. Within a Bayesian learning framework, objective functions are discussed that measure the expected informativeness of candidate measurements. Three alternative specifications of what we want to gain information about lead to three different criteria for data selection. All these criteria depend on the assumption that the hypothesis space is correct, which may prove to be their main weakness

    Quick disconnect latch and handle combination Patent

    Get PDF
    Quick disconnect latch and handle combination for mounting articles on walls or supporting bases in spacecraft under zero gravity condition

    A practical Bayesian framework for backpropagation networks

    Get PDF
    A quantitative and practical Bayesian framework is described for learning of mappings in feedforward networks. The framework makes possible (1) objective comparisons between solutions using alternative network architectures, (2) objective stopping rules for network pruning or growing procedures, (3) objective choice of magnitude and type of weight decay terms or additive regularizers (for penalizing large weights, etc.), (4) a measure of the effective number of well-determined parameters in a model, (5) quantified estimates of the error bars on network parameters and on network output, and (6) objective comparisons with alternative learning and interpolation models such as splines and radial basis functions. The Bayesian "evidence" automatically embodies "Occam's razor," penalizing overflexible and overcomplex models. The Bayesian approach helps detect poor underlying assumptions in learning models. For learning models well matched to a problem, a good correlation between generalization ability and the Bayesian evidence is obtained

    Sparse Graph Codes for Quantum Error-Correction

    Full text link
    We present sparse graph codes appropriate for use in quantum error-correction. Quantum error-correcting codes based on sparse graphs are of interest for three reasons. First, the best codes currently known for classical channels are based on sparse graphs. Second, sparse graph codes keep the number of quantum interactions associated with the quantum error correction process small: a constant number per quantum bit, independent of the blocklength. Third, sparse graph codes often offer great flexibility with respect to blocklength and rate. We believe some of the codes we present are unsurpassed by previously published quantum error-correcting codes.Comment: Version 7.3e: 42 pages. Extended version, Feb 2004. A shortened version was resubmitted to IEEE Transactions on Information Theory Jan 20, 200

    Diffraction-limited CCD imaging with faint reference stars

    Get PDF
    By selecting short exposure images taken using a CCD with negligible readout noise we obtained essentially diffraction-limited 810 nm images of faint objects using nearby reference stars brighter than I=16 at a 2.56 m telescope. The FWHM of the isoplanatic patch for the technique is found to be 50 arcseconds, providing ~20% sky coverage around suitable reference stars.Comment: 4 page letter accepted for publication in Astronomy and Astrophysic

    Correlation length and negative phase velocity in isotropic dielectric-magnetic materials

    Get PDF
    A composite material comprising randomly distributed spherical particles of two different isotropic dielectric-magnetic materials is homogenized using the second-order strong-property-fluctuation theory in the long-wavelength approximation. Whereas neither of the two constituent materials by itself supports planewave propagation with negative phase velocity (NPV), the homogenized composite material (HCM) can. The propensity of the HCM to support NPV propagation is sensitive to the distributional statistics of the constituent material particles, as characterized by a two--point covariance function and its associated correlation length. The scope for NPV propagation diminishes as the correlation length increases
    corecore