SEARCH · Engineering Papers

Results for “error bound”

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.

SourceResearch connectionFrom yearThrough year

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

At least 883 records · Page 49

All sources NASA NTRS DOE OSTI

NASA NTRS1988

Finite-state codes

A class of codes called finite-state (FS) codes is defined and investigated. The codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived. A general construction for FS codes is given, and it is shown that in many cases the FS codes constructed in this way have a free distance that is the largest possible. Catastrophic error propagation (CEP) for FS codes is also discussed. It is found that to avoid CEP one must solve the graph-theoretic problem of finding a uniquely decodable edge labeling of the state diagram.

Pollara, Fabrizio↗

NASA NTRS1991

Frequency domain identification for robust large space structure control design

A methodology is demonstrated for frequency domain identification of large space structures which systematically transforms experimental raw data into a form required for synthesizing H(infinity) controllers using modern robust control design software (e.g., Matlab Toolboxes). A unique feature of this approach is that the additive uncertainty is characterized to a specified statistic confidence rather than with hard bounds. In this study, the difference in robust performance is minimal between the two levels of confidence. In general cases, the present methodology provides a tool for performance/confidence level tradeoff studies. For simplicity, the additive uncertainty on a frequency grid is considered and the interpolation error in between grid points is neglected.

Yam, Y.↗

NASA NTRS1992

Least reliable bits coding (LRBC) for high data rate satellite communications

LRBC, a bandwidth efficient multilevel/multistage block-coded modulation technique, is analyzed. LRBC uses simple multilevel component codes that provide increased error protection on increasingly unreliable modulated bits in order to maintain an overall high code rate that increases spectral efficiency. Soft-decision multistage decoding is used to make decisions on unprotected bits through corrections made on more protected bits. Analytical expressions and tight performance bounds are used to show that LRBC can achieve increased spectral efficiency and maintain equivalent or better power efficiency compared to that of BPSK. The relative simplicity of Galois field algebra vs the Viterbi algorithm and the availability of high-speed commercial VLSI for block codes indicates that LRBC using block codes is a desirable method for high data rate implementations.

Vanderaar, Mark↗

NASA NTRS1992

Rotational relaxation of molecular H2 at moderate temperatures

A coupled rotation-vibration-dissociation model is used to compute the rotational relaxation times for molecular hydrogen as a function of final temperatures (500-5000 K) in a hypothetical scenario of sudden compression. The theoretical model is based on a master equation solver. The bound-bound and bound-free transition rates have been computed using a quasi-classical trajectory method. A review of the available experimental data on the rotational relaxation of hydrogen is presented, with a critical overview of the method of measurements and data reduction, including the sources of errors. The experimental data are compared with the computed results.

Sharma, S. P.↗

NASA NTRS2001

The effects of aberrations (low order and quilting) on the performance of the all-composite design for the Herschel Space Observatory

The effects of specific aberrations on the optical performance of the all-composite design for the Herschel Space Observatory are examined. A review of the all-composite design for the large aperture (3.5 m) telescope that satisfies the target specifications is presented. Cryogenic experiments with carbon fiber reinforced polymer (CFRP) 2 m demonstration mirror have yielded empirical bounds on the high-and low-order spatial frequency aberrations that will be anticipated in the full 3.5 m Ritchey-Chretien telescope design. Detailed analysis is presented on the effect of the low order aberrations of the primary mirror on the system wavefront error and encircled energy. Predictable limits of correction via low order shaping of the secondary mirror are described. The impact of higher order surface errors on the encircled energy and the stray light will also be presented. Comments are made regarding the impact of the optical prescription and CRFP design on flight telescope testing.

energy↗

DOE OSTI2025

Bayesian estimation of HIV acquisition dates for prevention trials

Accurate timing estimates of when participants acquire HIV in HIV prevention trials are necessary for determining antibody levels at acquisition. The Antibody-Mediated Prevention (AMP) Studies showed that a passively administered broadly neutralizing antibody can prevent the acquisition of HIV from a neutralization-sensitive virus. We developed a pipeline for estimating the date of detectable HIV acquisition (DDA) in AMP Study participants using diagnostic and viral sequence data. Using a Bayesian strategy that combines three streams of data (REN [rev/vpu/env/Δnef] sequence, GP [gag/Δpol] sequence, and diagnostic) where their 95% credible intervals overlap based on pre-specified criteria and decision rules. We evaluated the performance of our AMP pipeline using PacBio viral sequence data from 41 participants across two prospective acute HIV acquisition cohort studies, FRESH and RV217, with twice-weekly sampling. These cohort studies enrolled young women in South Africa and men and women in Kenya and Thailand, respectively, with a high likelihood of HIV acquisition. In evaluating performance, “true DDA” was the center of bounds between last-negative and first-positive RNA diagnostic tests (median time 4 days, range 2–7 days); bias was the mean difference between estimated and true DDA. Using diagnostic data alone yielded timing estimates with a bias of 2.4 days and root mean square error (RMSE) of 7.9 days. These results were improved using sequence + diagnostic data (bias 1.5 days, RMSE 6.9 days), as well as by restricting sequence-based estimation to samples from ≤5 weeks post-DDA (bias 0.2 days, RMSE 7.8 days).

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Robust Containment Queries over Collections of Rational Parametric Curves via Generalized Winding Numbers

Point containment queries for regions bound by watertight geometric surfaces, i.e., closed and without self-intersections, can be evaluated straightforwardly with a number of well-studied algorithms. When this assumption on domain geometry is not met, such methods are either unusable, or prone to misclassifications that can lead to cascading errors in downstream applications. More robust point classification schemes based on generalized winding numbers have been proposed, as they are indifferent to these imperfections. However, existing algorithms are limited to point clouds and collections of linear elements. We extend this methodology to encompass more general curved shapes with an algorithm that evaluates the winding number scalar field over unstructured collections of rational parametric curves. In particular, we evaluate the winding number for each curve independently, making the derived containment query robust to how the curves are arranged. We ensure geometric fidelity in our queries by treating each curve as equivalent to an adaptively constructed polyline that provably has the same generalized winding number at the point of interest. Our algorithm is numerically stable for points that are arbitrarily close to the model, and explicitly treats points that are coincident with curves. We demonstrate the improvements in computational performance granted by this method over conventional techniques as well as the robustness induced by its application.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Information transmission with continuous variable quantum erasure channels

Quantum capacity, as the key figure of merit for a given quantum channel, upper bounds the channel's ability in transmitting quantum information. Identifying different types of channels, evaluating the corresponding quantum capacity, and finding the capacity-approaching coding scheme are the major tasks in quantum communication theory. Quantum channel in discrete variables has been discussed enormously based on various error models, while error model in the continuous variable channel has been less studied due to the infinite dimensional problem. In this paper, we investigate a general continuous variable quantum erasure channel. By defining an effective subspace of the continuous variable system, we find a continuous variable random coding model. We then derive the quantum capacity of the continuous variable erasure channel in the framework of decoupling theory. The discussion in this paper fills the gap of a quantum erasure channel in continuous variable setting and sheds light on the understanding of other types of continuous variable quantum channels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1984

Optimum Cyclic Redundancy Codes for Noisier Channels

Binary cyclic redundancy codes for feedback communication over noisy digital links are considered. The standard 16 bit American Data and Computer Communication Protocol (ADCCP) polynomial is designed for digital links which already have a low input bit error probability. For file transfer between personal computers over telephone circuits, the quality of resulting digital circuit may be much lower. The 3 byte (24 bit) and 4 byte (32 bit) polynomials are considered. Generator polynomials of a certain class have minimum weight and yet achieve the bound on minimum distance for arbitrary codes. Particular choices for 24 bit and 32 bit redundancies are exhibited: of weight and distance 6 in the 24-bit case; and weight 10 and distance 8 in the 32-bit case.

Merkey, P.↗

NASA NTRS1984

Optimum cyclic redundancy codes for noisy channels

Merkey, P.↗

NASA NTRS1985

An ab initio investigation of possible intermediates in the reaction of the hydroxyl and hydroperoxyl radicals

Ab initio quantum chemical techniques are used to investigate covalently-bonded and hydrogen-bonded species that may be important intermediates in the reaction of hydroxyl and hydroperoxyl radicals. Stable structures of both types are identified. Basis sets of polarized double zeta quality and large scale configuration interaction wave functions are utilized. Based on electronic energies, the covalently bonded HOOOH species is 26.4 kcal/mol more stable than the OH and HO2 radicals. Similarly, the hydrogen bonded HO---HO2 species has an electronic energy 4.7 kcal/mol below that of the component radicals, after correction is made for the basis set superposition error. The hydrogen bonded form is planar, possesses one relatively normal hydrogen bond, and has the lowest energy 3A' and 1A' states that are essentially degenerate. The 1A" and 3A" excited states produced by rotation of the unpaired OH electron into the molecular plane are very slightly bound.

Jackels, C. F.↗

NASA NTRS2000

How Well Will MODIS Measure Top of Atmosphere Aerosol Direct Radiative Forcing?

The new generation of satellite sensors such as the Moderate Resolution Imaging Spectroradiometer (MODIS) will be able to detect and characterize global aerosols with an unprecedented accuracy. The question remains whether this accuracy will be sufficient to narrow the uncertainties in our estimates of aerosol radiative forcing at the top of the atmosphere. Satellite remote sensing detects aerosol optical thickness with the least amount of relative error when aerosol loading is high. Satellites are less effective when aerosol loading is low. We use the monthly mean results of two global aerosol transport models to simulate the spatial distribution of smoke aerosol in the Southern Hemisphere during the tropical biomass burning season. This spatial distribution allows us to determine that 87-94% of the smoke aerosol forcing at the top of the atmosphere occurs in grid squares with sufficient signal to noise ratio to be detectable from space. The uncertainty of quantifying the smoke aerosol forcing in the Southern Hemisphere depends on the uncertainty introduced by errors in estimating the background aerosol, errors resulting from uncertainties in surface properties and errors resulting from uncertainties in assumptions of aerosol properties. These three errors combine to give overall uncertainties of 1.5 to 2.2 Wm-2 (21-56%) in determining the Southern Hemisphere smoke aerosol forcing at the top of the atmosphere. The range of values depend on which estimate of MODIS retrieval uncertainty is used, either the theoretical calculation (upper bound) or the empirical estimate (lower bound). Strategies that use the satellite data to derive flux directly or use the data in conjunction with ground-based remote sensing and aerosol transport models can reduce these uncertainties.

Remer, Lorraine A.↗

DOE OSTI2022

Assessing the stability of noisy quantum computation

Quantum computation has made considerable progress in the last decade with multiple emerging technologies providing proof-of-principle experimental demonstrations of such calculations. However, these experimental demonstrations of quantum computation face technical challenges due to the noise and errors that arise from imperfect implementation of the technology. Here, we frame the concepts of computational accuracy, result reproducibility, device reliability and program stability in the context of quantum computation. We provide intuitive definitions for these concepts in the context of quantum computation that lead to operationally meaningful bounds on program output. Our assessment highlights the continuing need for statistical analyses of quantum computing program to increase our confidence in the burgeoning field of quantum information science.

Dasgupta, Samudra↗

DOE OSTI2023

Muon capture on deuteron using local chiral potentials

The muon capture reaction μ – + d → n + n + ν μ in the doublet hyperfine state is studied using nuclear potentials and consistent currents derived in the chiral effective field theory, which are local and expressed in coordinate space (the so-called Norfolk models). Only the largest contribution due to the 1 S 0 nn scattering state is considered. Particular attention is given to the estimate of theoretical uncertainty, for which four sources have been identified: 1) the model dependence, 2) the chiral-order convergence for the weak nuclear current, 3) the uncertainty in the single-nucleon axial form factor, and 4) the numerical technique adopted to solve the bound and scattering A = 2 systems. This last source of uncertainty has turned out to be essentially negligible. For the 1 S 0 doublet muon capture rate Γ D ( 1 S 0 ), we obtain Γ D ( 1 S 0 ) = 255.8(0.6) (4.4)(2.9) s –1 , where the three errors come from the first three sources of uncertainty. The value for Γ D ( 1 S 0 ) obtained within this local chiral framework is compared with previous calculations and found in very good agreement.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS2017

Map Projection Induced Variations in Locations of Polygon Geofence Edges

This Paper under-estimates answers to the following question under various constraints: If a geofencing algorithm uses a map projection to determine whether a position is inside/outside a polygon region, how far outside/inside the polygon can the point be and the algorithm determine that it is inside/outside (the opposite and therefore incorrect answer)? Geofencing systems for unmanned aircraft systems (UAS) often model stay-in and stay-out regions using 2D polygons with minimum and maximum altitudes. The vertices of the polygons are typically input as latitude-longitude pairs, and the edges as paths between adjacent vertices. There are numerous ways to generate these paths, resulting in numerous potential locations for the edges of stay-in and stay-out regions. These paths may be geodesics on a spherical model of the earth or geodesics on the WGS84 reference ellipsoid. In geofencing applications that use map projections, these paths are inverse images of straight lines in the projected plane. This projected plane may be a projection of a spherical earth model onto a tangent plane, called an orthographic projection. Alternatively, it may be a projection where the straight lines in the projected plane correspond to straight lines in the latitudelongitude coordinate system, also called a Plate Carr´ee projection. This paper estimates distances between different edge paths and an oracle path, which is a geodesic on either the spherical earth or the WGS84 ellipsoidal earth. This paper therefore estimates how far apart different edge paths can be rather than comparing their path lengths, which are not considered. Rather, the comparision is between the actual locations of the edges between vertices. For edges drawn using orthographic projections, this maximum distance increases as the distance from the polygon vertices to the projection point increases. For edges drawn using Plate Carr´ee projections, this maximum distance increases as the vertices become further from the equator. Distances between geodesics on a spherical earth and a WGS84 ellipsoidal earth are also analyzed, using the WGS84 ellipsoid as the oracle. Bounds on the 2D distance between a straight line and a great circle path, in an orthographically projected plane rather than on the surface of the earth, have been formally verified in the PVS theorem prover, meaning that they are mathematically correct in the absence of floating point errors.

Neeley, Paula↗

DOE OSTI2025

Analysis of Radiological Release From Fueled Irradiation Experiments During Manual Handling (Slides)

Irradiation experiments are manually handled at the Advanced Test Reactor (ATR) by qualified operators using long handled tools. Standard handling evolutions include insertion and removal from the reactor vessel, transfer to/from a storage location or cask in the ATR canal, and handling/reconfigurations at a canal working tray. Such routine handling has the potential to result in mechanical damage to the experiment boundary which is credited to retain fission products. Since damage can occur due to operator error, this is an anticipated occurrence. This work determines the radiological consequences to receptors inside the ATR facility, as well as public receptors. Given the wide variety of fuel types tested at the ATR, a generic approach to the analysis is taken. The radiological inventory is determined to bound a variety of fuel types (e.g., ceramic and molten fuel matrices) and fission powers on the U-235 enrichment spectrum. The source term analysis considers different release fractions to bound different fuel types and burnups. The postulated handling events occur underwater; thus, retention of the released isotopic content is considered within the canal water column. Retention of radionuclides in the water column is determined using a modified approach of United States (US) Nuclear Regulatory Commission (NRC) Regulatory Guide (RG) 1.183. Radiological dose to the facility receptor is determined using a compartment release model. Dose to the public receptor is determined using atmospheric dispersion models using site specific atmospheric conditions with the use of the Radiological Safety Analysis Computer (RSAC) program version 7.2.

21 - SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLAN↗

DOE OSTI2023

Improved quantum algorithms for linear and nonlinear differential equations

We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes the run time of quantum algorithms for linear ODEs opening the door to an application to a wider class of linear and nonlinear ODEs. In [1], a quantum algorithm for a certain class of linear ODEs is given, where the matrix involved needs to be diagonalizable. The quantum algorithm for linear ODEs presented here extends to many classes of non-diagonalizable matrices including singular matrices. The algorithm here is also exponentially faster than the bounds derived in [1] for certain classes of diagonalizable matrices. Our linear ODE algorithm is then applied to nonlinear differential equations using Carleman linearization (an approach taken recently by us in [2]). The improvement over that result is two-fold. First, we obtain an exponentially better dependence on error. This kind of logarithmic dependence on error has also been achieved by [3], but only for homogeneous nonlinear equations. Second, the present algorithm can handle any sparse matrix (that models dissipation) if it has a negative log-norm (including non-diagonalizable matrices), whereas [2] and [3] additionally require normality.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1979

Evaluation Applied to Reliability Analysis of Reconfigurable, Highly Reliable, Fault-Tolerant, Computing Systems for Avionics

Emulation techniques are proposed as a solution to a difficulty arising in the analysis of the reliability of highly reliable computer systems for future commercial aircraft. The difficulty, viz., the lack of credible precision in reliability estimates obtained by analytical modeling techniques are established. The difficulty is shown to be an unavoidable consequence of: (1) a high reliability requirement so demanding as to make system evaluation by use testing infeasible, (2) a complex system design technique, fault tolerance, (3) system reliability dominated by errors due to flaws in the system definition, and (4) elaborate analytical modeling techniques whose precision outputs are quite sensitive to errors of approximation in their input data. The technique of emulation is described, indicating how its input is a simple description of the logical structure of a system and its output is the consequent behavior. The use of emulation techniques is discussed for pseudo-testing systems to evaluate bounds on the parameter values needed for the analytical techniques.

Migneault, G. E.↗