Search NASA⌕ Search

SEARCH · Search NASA

Results for “Bounded”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17

Covariant entropy bound and loop quantum cosmology

We examine Bousso's covariant entropy bound conjecture in the context of radiation filled, spatially flat, Friedmann-Robertson-Walker models. The bound is violated near the big bang. However, the hope has been that quantum gravity effects would intervene and protect it. Loop quantum cosmology provides a near ideal setting for investigating this issue. For, on the one hand, quantum geometry effects resolve the singularity and, on the other hand, the wave function is sharply peaked at a quantum corrected but smooth geometry, which can supply the structure needed to test the bound. We find that the bound is respected. We suggest that the bound need not be an essential ingredient for a quantum gravity theory but may emerge from it under suitable circumstances.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Bounds on the parameter of noncommutativity from supernova SN1987A

We consider supernova SN1987A to find bounds on the parameter of noncommutativity, {theta}{sub {mu}}{sub {nu}}. The right-handed neutrino in the noncommutative standard model (NCSM) can directly couple to the photon and the Z-gauge boson. Therefore the observed flux of neutrinos from SN1987A can constrain the strength of the new couplings in the NCSM. We obtain two bounds on the NC-parameter, {lambda}{sub NC}=1/{radical}(|){theta}|, with respect to escaping or trapping of the right-handed neutrinos inside the supernova which are {lambda}{sub NC} > or approx. 3.7 TeV or {lambda}{sub NC} < or approx. 1 TeV, respectively. The excluded region 1 TeV < or approx. {lambda}{sub NC} < or approx. 3.7 TeV for the NC parameter is obtained for the first time. In fact {lambda}{sub NC} < or approx. 1 TeV is consistent with the existing bounds on {lambda}{sub NC} and raises our hopes to find the NC effects in the LHC or even in the LEP. Meanwhile {lambda}{sub NC} > or approx. 3.7 TeV is more stringent than the other bounds obtained from LEP and LHC considerations. Furthermore, since NC calculations are perturbative and are correct only up to the energy scale of the NC system < or approx. {lambda}{sub NC}, then these bounds (which are obtained from the energy scale and considerably less than the energy scale of LEP and LHC) are more reliable.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Effects of bound states on dark matter annihilation

Here, we study the impact of bound state formation on dark matter annihilation rates in models where dark matter interacts via a light mediator, the dark photon. We derive the general cross section for radiative capture into all possible bound states, and point out its nontrivial dependence on the dark matter velocity and the dark photon mass. For indirect detection, our result shows that dark matter annihilation inside bound states can play an important role in enhancing signal rates over the rate for direct dark matter annihilation with Sommerfeld enhancement. The results are strongest for large dark gauge coupling and when the dark photon mass is smaller than the typical momentum of dark matter in the Galaxy. As an example, we show that for thermal dark matter the Fermi gamma ray constraint is substantially increased once bound state effects are taken into account. We also find that bound state effects are not important for dark matter annihilation during the freeze-out and recombination epochs.

79 ASTRONOMY AND ASTROPHYSICS↗

Bound of dissipation on a plane Couette dynamo

Variational turbulence is among the few approaches providing rigorous results in turbulence. In addition, it addresses a question of direct practical interest, namely, the rate of energy dissipation. Unfortunately, only an upper bound is obtained as a larger functional space than the space of solutions to the Navier-Stokes equations is searched. Yet, in some cases, this upper bound is in good agreement with experimental results in terms of order of magnitude and power law of the imposed Reynolds number. In this paper, the variational approach to turbulence is extended to the case of dynamo action and an upper bound is obtained for the global dissipation rate (viscous and Ohmic). A simple plane Couette flow is investigated. For low magnetic Prandtl number P{sub m} fluids, the upper bound of energy dissipation is that of classical turbulence (i.e., proportional to the cubic power of the shear velocity) for magnetic Reynolds numbers below P{sub m}{sup -1} and follows a steeper evolution for magnetic Reynolds numbers above P{sub m}{sup -1} (i.e., proportional to the shear velocity to the power of 4) in the case of electrically insulating walls. However, the effect of wall conductance is crucial: for a given value of wall conductance, there is a value for the magnetic Reynolds number above which energy dissipation cannot be bounded. This limiting magnetic Reynolds number is inversely proportional to the square root of the conductance of the wall. Implications in terms of energy dissipation in experimental and natural dynamos are discussed.

97 MATHEMATICS AND COMPUTING↗

Exploring the Structure of the Bound Proton with Deeply Virtual Compton Scattering

In the past two decades, deeply virtual Compton scattering of electrons has been successfully used to advance our knowledge of the partonic structure of the free proton and investigate correlations between the transverse position and the longitudinal momentum of quarks inside the nucleon. Meanwhile, the structure of bound nucleons in nuclei has been studied in inclusive deep-inelastic lepton scattering experiments off nuclear targets, showing a significant difference in longitudinal momentum distribution of quarks inside the bound nucleon, known as the EMC effect. In this work, we report the first beam spin asymmetry (BSA) measurement of exclusive deeply virtual Compton scattering (DVCS) off a proton bound in $^4$He. The data used here were accumulated using a $6$ GeV longitudinally polarized electron beam incident on a pressurized $^4$He gaseous target placed within the CLAS spectrometer in Hall-B at the Thomas Jefferson National Accelerator Facility. Here, the azimuthal angle ($\phi$) dependence of the BSA was studied in a wide range of virtual photon and scattered proton kinematics. The $Q^2$, $x_B$, and t dependencies of the BSA on the bound proton are compared with those on the free proton. In the whole kinematical region of our measurements, the BSA on the bound proton is smaller by 20\% to 40\%, indicating possible medium modification of its partonic structure.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Graviton mass bounds

Recently, aLIGO announced the first direct detections of gravitational waves, a direct manifestation of the propagating degrees of freedom of gravity. The detected signals GW150914 and GW151226 have been used to examine the basic properties of these gravitational degrees of freedom, particularly setting an upper bound on their mass. It is timely to review what the mass of these gravitational degrees of freedom means from the theoretical point of view, particularly taking into account the recent developments in constructing consistent massive gravity theories. Apart from the GW150914 mass bound, a few other observational bounds have been established from the effects of the Yukawa potential, modified dispersion relation, and fifth force that are all induced when the fundamental gravitational degrees of freedom are massive. These different mass bounds are reviewed, how they stand in the wake of recent theoretical developments and how they compare to the bound from GW150914 are examined.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimizing Error-Bounded Lossy Compression for Scientific Data by Dynamic Spline Interpolation

Today's scientific simulations are producing vast volumes of data that cannot be stored and transferred efficiently because of limited storage capacity, parallel I/O bandwidth, and network bandwidth. The situation is getting worse over time because of the ever-increasing gap between relatively slow data transfer speed and fast-growing computation power in modern supercomputers. Error-bounded lossy compression is becoming one of the most critical techniques for resolving the big scientific data issue, in that it can significantly reduce the scientific data volume while guaranteeing that the reconstructed data is valid for users because of its compression-error-bounding feature. In this paper, we present a novel error-bounded lossy compressor based on a state-of-the-art prediction-based compression framework. Our solution exhibits substantially better compression quality than all of the existing error-bounded lossy compressors, with comparable compression speed. Specifically, our contribution is threefold. (1) We provide an in-depth analysis of why the best-existing prediction-based lossy compressor can only minimally improve the compression quality. (2) We propose a dynamic spline interpolation approach with a series of optimization strategies that can significantly improve the data prediction accuracy, substantially improving the compression quality in turn. (3) We perform a thorough evaluation using six real-world scientific simulation datasets across different science domains to evaluate our solution vs. all other related works. Experiments show that the compression ratio of our solution is higher than that of the second-best lossy compressor by 20%similar to 460% with the same error bound in most of the cases.

Zhao, Kai↗

Class-specific Error Bounds for Ensemble Classifiers

The generalization error, or probability of misclassification, of ensemble classifiers has been shown to be bounded above by a function of the mean correlation between the constituent (i.e., base) classifiers and their average strength. This bound suggests that increasing the strength and/or decreasing the correlation of an ensemble's base classifiers may yield improved performance under the assumption of equal error costs. However, this and other existing bounds do not directly address application spaces in which error costs are inherently unequal. For applications involving binary classification, Receiver Operating Characteristic (ROC) curves, performance curves that explicitly trade off false alarms and missed detections, are often utilized to support decision making. To address performance optimization in this context, we have developed a lower bound for the entire ROC curve that can be expressed in terms of the class-specific strength and correlation of the base classifiers. We present empirical analyses demonstrating the efficacy of these bounds in predicting relative classifier performance. In addition, we specify performance regions of the ROC curve that are naturally delineated by the class-specific strengths of the base classifiers and show that each of these regions can be associated with a unique set of guidelines for performance optimization of binary classifiers within unequal error cost regimes.

99 GENERAL AND MISCELLANEOUS↗

Ultrafast Error-bounded Lossy Compression for Scientific Datasets

Today's scientific high-performance computing applications and advanced instruments are producing vast volumes of data across a wide range of domains, which impose a serious burden on data transfer and storage. Error-bounded lossy compression has been developed and widely used in the scientific community because it not only can significantly reduce the data volumes but also can strictly control the data distortion based on the user-specified error bound. Existing lossy compressors, however, cannot offer ultrafast compression speed, which is highly demanded by numerous applications or use cases (such as in-memory compression and online instrument data compression). In this paper, we propose a novel ultrafast error-bounded lossy compressor that can obtain fairly high compression performance on both CPUs and GPUs and with reasonably high compression ratios. The key contributions are threefold. (1) We propose a generic error-bounded lossy compression framework---called SZx---that achieves ultrafast performance through its novel design comprising only lightweight operations such as bitwise and addition/subtraction operations, while still keeping a high compression ratio. (2) We implement SZx on both CPUs and GPUs and optimize the performance according to their architectures. (3) We perform a comprehensive evaluation with six real-world production-level scientific datasets on both CPUs and GPUs. Experiments show that SZx is 2~16x faster than the second-fastest existing error-bounded lossy compressor (either SZ or ZFP) on CPUs and GPUs, with respect to both compression and decompression.

Yu, Xiaodong↗

Heuristic methods and performance bounds for photonic design

In the photonic design problem, a scientist or engineer chooses the physical parameters of a device to best match some desired device behavior. Many instances of the photonic design problem can be naturally stated as a mathematical optimization problem that is computationally difficult to solve globally. Because of this, several heuristic methods have been developed to approximately solve such problems. These methods often produce very good designs, and, in many practical applications, easily outperform ‘traditional’ designs that rely on human intuition. Yet, because these heuristic methods do not guarantee that the approximate solution found is globally optimal, the question remains of just how much better a designer might hope to do. This question is addressed by performance bounds or impossibility results, which determine a performance level that no design can achieve. We focus on algorithmic performance bounds, which involve substantial computation to determine. We illustrate a variety of both heuristic methods and performance bounds on two examples. In these examples (and many others not reported here) the performance bounds show that the heuristic designs are nearly optimal, and can be considered globally optimal in practice. This review serves to clearly set up the photonic design problem and unify existing approaches for calculating performance bounds, while also providing some natural generalizations and properties.

Angeris, Guillermo (ORCID:0000000249503990)↗

A posteriori superlinear convergence bounds for block conjugate gradient

In this paper, we extend to the block case the a posteriori bound showing superlinear convergence of the conjugate gradient method developed by van der Vorst and Vuik in [J. Comput. Applied Math., 48 (1993), pp. 327–341]. That is, we obtain similar bounds but now for the block conjugate gradient method. We also present a series of computational experiments, illustrating the validity of the bound developed here as well as the bound by Simoncini and Szyld from [SIAM Review, 47 (2005), pp. 247–272] using angles between subspaces. Using these bounds, we make some observations on the onset of superlinearity and how this onset depends on the eigenvalue distribution and the block size.

97 MATHEMATICS AND COMPUTING↗

What exactly does Bekenstein bound?

The Bekenstein bound posits a maximum entropy for matter with finite energy confined to a spatial region. It is often interpreted as a fundamental limit on the information that can be stored by physical objects. In this work, we test this interpretation by asking whether the Bekenstein bound imposes constraints on a channel's communication capacity, a context in which information can be given a mathematically rigorous and operationally meaningful definition. We study specifically the Unruh channel that describes a stationary Alice exciting different species of free scalar fields to send information to an accelerating Bob, who is confined to a Rindler wedge and exposed to the noise of Unruh radiation. We show that the classical and quantum capacities of the Unruh channel obey the Bekenstein bound that pertains to the decoder Bob. In contrast, even at high temperatures, the Unruh channel can transmit a significant number of zero-bits , which are quantum communication resources that can be used for quantum identification and many other primitive protocols. Therefore, unlike classical bits and qubits, zero-bits and their associated information processing capability are generally not constrained by the Bekenstein bound. However, we further show that when both the encoder and the decoder are restricted, the Bekenstein bound does constrain the channel capacities, including the zero-bit capacity.

Hayden, Patrick [Stanford University, CA (United S↗

TOWARD THE ASTRONOMICAL DETECTION OF THE PROTON-BOUND COMPLEX NN–HCO{sup +}: IMPLICATIONS FOR THE SPECTRA OF PROTOPLANETARY DISKS

Proton-bound complexes have been hypothesized as further means of detecting the nitrogen molecule in the interstellar medium. The study of such complexes has largely been hindered by the necessary experimental setups utilized or by their difficulty in producing and/or analyzing computed potential energy surfaces. Here the NN–HCO{sup +} proton-bound complex is analyzed via quartic force fields (QFFs). While QFFs have produced meaningful results for other proton-bound complexes, they have been hindered by double-well potentials or flat potential surfaces. NN–HCO{sup +} is not affected by these constraints. This strongly dipolar (3.63 D) molecule can be observed rotationally unlike the more heavily analyzed OCHCO{sup +} and NNHNN{sup +} proton-bound complexes. Additionally, the large absorption feature corresponding to the proton motion, a hallmark of proton-bound complexes, is much higher in frequency at 2547.1 cm{sup −1}, changing the range of experimental observation for the bright frequency. NN–HCO{sup +} is hypothesized to be present in protoplanetary disks where N{sub 2}H{sup +} and CO are known. As such, it may help to influence the nitrogen budget of planet-forming astronomical regions.

79 ASTRONOMY AND ASTROPHYSICS↗

Upper bounds on sequential decoding performance parameters

This paper presents the best obtainable random coding and expurgated upper bounds on the probabilities of undetectable error, of t-order failure (advance to depth t into an incorrect subset), and of likelihood rise in the incorrect subset, applicable to sequential decoding when the metric bias G is arbitrary. Upper bounds on the Pareto exponent are also presented. The G-values optimizing each of the parameters of interest are determined, and are shown to lie in intervals that in general have nonzero widths. The G-optimal expurgated bound on undetectable error is shown to agree with that for maximum likelihood decoding of convolutional codes, and that on failure agrees with the block code expurgated bound. Included are curves evaluating the bounds for interesting choices of G and SNR for a binary-input quantized-output Gaussian additive noise channel.

Jelinek, F.↗

Free distance bounds for convolutional codes

The best asymptotic bounds presently known on free distance for convolutional codes are presented from a unified point of view. Upper and lower bounds for both time-varying and fixed codes are obtained. A comparison is made between bounds for nonsystematic and systematic codes which shows that more free distance is available with nonsystematic codes. This result is important when selecting codes for use with sequential or maximum-likelihood (Viterbi) decoding since the probability of decoding error is closely related to the free distance of the code. An ancillary result, used in proving the lower bound on free distance for time-varying nonsystematic codes, furnishes a generalization of two earlier bounds on the definite decoding minimum distance of convolutional codes.

Costello, D. J., Jr.↗

Comparing hard and soft prior bounds in geophysical inverse problems

In linear inversion of a finite-dimensional data vector y to estimate a finite-dimensional prediction vector z, prior information about X sub E is essential if y is to supply useful limits for z. The one exception occurs when all the prediction functionals are linear combinations of the data functionals. Two forms of prior information are compared: a soft bound on X sub E is a probability distribution p sub x on X which describeds the observer's opinion about where X sub E is likely to be in X; a hard bound on X sub E is an inequality Q sub x(X sub E, X sub E) is equal to or less than 1, where Q sub x is a positive definite quadratic form on X. A hard bound Q sub x can be softened to many different probability distributions p sub x, but all these p sub x's carry much new information about X sub E which is absent from Q sub x, and some information which contradicts Q sub x. Both stochastic inversion (SI) and Bayesian inference (BI) estimate z from y and a soft prior bound p sub x. If that probability distribution was obtained by softening a hard prior bound Q sub x, rather than by objective statistical inference independent of y, then p sub x contains so much unsupported new information absent from Q sub x that conclusions about z obtained with SI or BI would seen to be suspect.

Backus, George E.↗

Comparing hard and soft prior bounds in geophysical inverse problems

In linear inversion of a finite-dimensional data vector y to estimate a finite-dimensional prediction vector z, prior information about X sub E is essential if y is to supply useful limits for z. The one exception occurs when all the prediction functionals are linear combinations of the data functionals. Two forms of prior information are compared: a soft bound on X sub E is a probability distribution p sub x on X which describes the observer's opinion about where X sub E is likely to be in X; a hard bound on X sub E is an inequality Q sub x(X sub E, X sub E) is equal to or less than 1, where Q sub x is a positive definite quadratic form on X. A hard bound Q sub x can be softened to many different probability distributions p sub x, but all these p sub x's carry much new information about X sub E which is absent from Q sub x, and some information which contradicts Q sub x. Both stochastic inversion (SI) and Bayesian inference (BI) estimate z from y and a soft prior bound p sub x. If that probability distribution was obtained by softening a hard prior bound Q sub x, rather than by objective statistical inference independent of y, then p sub x contains so much unsupported new information absent from Q sub x that conclusions about z obtained with SI or BI would seen to be suspect.

Backus, George E.↗

Bounds of the bit error probability of a linear cyclic code over GF(2 exp l) and its extended code

An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2 exp l) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF(128). Also, a union upper bound on the BEP of a linear cyclic code with either HD or soft-decision (SD) ML decoding is developed, as well as the corresponding bounds for the extended code of a linear cyclic code. Using these bounds, which are tight at low bit error rate, the performance advantage of SD and HD ML over bounded-distance decoding is established.

Cheng, Unjeng↗