51,242 research outputs found

    JPEG2000 Image Compression on Solar EUV Images

    Get PDF
    For future solar missions as well as ground-based telescopes, efficient ways to return and process data have become increasingly important. Solar Orbiter, e.g., which is the next ESA/NASA mission to explore the Sun and the heliosphere, is a deep-space mission, which implies a limited telemetry rate that makes efficient onboard data compression a necessity to achieve the mission science goals. Missions like the Solar Dynamics Observatory (SDO) and future ground-based telescopes such as the Daniel K. Inouye Solar Telescope, on the other hand, face the challenge of making petabyte-sized solar data archives accessible to the solar community. New image compression standards address these challenges by implementing efficient and flexible compression algorithms that can be tailored to user requirements. We analyse solar images from the Atmospheric Imaging Assembly (AIA) instrument onboard SDO to study the effect of lossy JPEG2000 (from the Joint Photographic Experts Group 2000) image compression at different bit rates. To assess the quality of compressed images, we use the mean structural similarity (MSSIM) index as well as the widely used peak signal-to-noise ratio (PSNR) as metrics and compare the two in the context of solar EUV images. In addition, we perform tests to validate the scientific use of the lossily compressed images by analysing examples of an on-disk and off-limb coronal-loop oscillation time-series observed by AIA/SDO.Comment: 25 pages, published in Solar Physic

    Beyond the Runs Theorem

    Full text link
    Recently, a short and elegant proof was presented showing that a binary word of length nn contains at most n3n-3 runs. Here we show, using the same technique and a computer search, that the number of runs in a binary word of length nn is at most 2223n<0.957n\frac{22}{23}n<0.957n.Comment: New version with substantially improved bound and coauthors who carried out a similar research independentl

    Testing formula satisfaction

    Get PDF
    We study the query complexity of testing for properties defined by read once formulae, as instances of massively parametrized properties, and prove several testability and non-testability results. First we prove the testability of any property accepted by a Boolean read-once formula involving any bounded arity gates, with a number of queries exponential in \epsilon and independent of all other parameters. When the gates are limited to being monotone, we prove that there is an estimation algorithm, that outputs an approximation of the distance of the input from satisfying the property. For formulae only involving And/Or gates, we provide a more efficient test whose query complexity is only quasi-polynomial in \epsilon. On the other hand we show that such testability results do not hold in general for formulae over non-Boolean alphabets; specifically we construct a property defined by a read-once arity 2 (non-Boolean) formula over alphabets of size 4, such that any 1/4-test for it requires a number of queries depending on the formula size

    Hadronic decays of the (pseudo-)scalar charmonium states ηc\eta_c and χc0\chi_{c0} in the extended Linear Sigma Model

    Full text link
    We study the phenomenology of the ground-state (pseudo-)scalar charmonia ηc\eta_c and χc0\chi_{c0} in the framework of a U(4)r×U(4)lU(4)_r \times U(4)_l symmetric linear sigma model with (pseudo-)scalar and (axial-) vector mesons. Based on previous results for the spectrum of charmonia and the spectrum and (OZI-dominant) strong decays of open charmed mesons, we extend the study of this model to OZI-suppressed charmonia decays. This includes decays into 'ordinary' mesons but also particularly interesting channels with scalar-isoscalar resonances f0(1370),f0(1500),f0(1710)f_0(1370),\, f_0(1500),\, f_0(1710) that may include sizeable contributions from a scalar glueball. We study the variation of the corresponding decay widths assuming different mixings between glueball and quark-antiquark states. We also compute the decay width of the pseudoscalar ηc\eta_c into a pseudoscalar glueball. In general, our results for decay widths are in reasonable agreement with experimental data where available. Order of magnitude predictions for as yet unmeasured states and channels are potentially interesting for BESIII, Belle II, LHCb as well as the future PANDA experiment at the FAIR facility.Comment: 20 pages, 3 figures, 6 tabe

    Extensive chaos in Rayleigh-Bénard convection

    Get PDF
    Using large-scale numerical calculations we explore spatiotemporal chaos in Rayleigh-Bénard convection for experimentally relevant conditions. We calculate the spectrum of Lyapunov exponents and the Lyapunov dimension describing the chaotic dynamics of the convective fluid layer at constant thermal driving over a range of finite system sizes. Our results reveal that the dynamics of fluid convection is truly chaotic for experimental conditions as illustrated by a positive leading-order Lyapunov exponent. We also find the chaos to be extensive over the range of finite-sized systems investigated as indicated by a linear scaling between the Lyapunov dimension of the chaotic attractor and the system size

    Analytic structure in the coupling constant plane in perturbative QCD

    Full text link
    We investigate the analytic structure of the Borel-summed perturbative QCD amplitudes in the complex plane of the coupling constant. Using the method of inverse Mellin transform, we show that the prescription dependent Borel-Laplace integral can be cast, under some conditions, into the form of a dispersion relation in the a-plane. We also discuss some recent works relating resummation prescriptions, renormalons and nonperturbative effects, and show that a method proposed recently for obtaining QCD nonperturbative condensates from perturbation theory is based on special assumptions about the analytic structure in the coupling plane that are not valid in QCD.Comment: 14 pages, revtex4, 1 eps-figur
    corecore