Results for “error bound” — Page 11

DOE OSTI2024

An implicit solution for Asay foil trajectories generated by separable, sustained-production ejecta source models

We present a simple implicit solution for the time-dependent trajectory of a thin Asay foil ejecta diagnostic for the general case where the impinging ejecta cloud is generated by a source function characterized by an arbitrary (sustained) time dependence and a time-independent (stationary) particle velocity distribution. In the limit that the source function time dependence becomes a delta function, this solution—which is amenable to rapid numerical calculations of arbitrary accuracy—exactly recovers a previously published solution for the special case of instantaneous ejecta production. We also derive simple expressions for the free-surface arrival (catch-up) time as well as the true ejecta areal mass accumulation on the accelerating foil and place bounds on the level of error incurred when applying instant-production mass solutions to a sustained-production trajectory. We demonstrate these solutions with example calculations for hypothetical source functions spanning a wide range of ejecta production durations, velocity distributions, and temporal behaviors. These calculations demonstrate how the foil trajectory is often insensitive to the temporal dependence of the source function, instead being dominated by the velocity distribution. We quantify this insensitivity using a “compatibility score” metric. Under certain conditions, one may capitalize upon this insensitivity to obtain a good approximation of the second integral of the velocity distribution from the observed foil trajectory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2024

Optimal function estimation with photonic quantum sensor networks

The problem of optimally measuring an analytic function of unknown local parameters each linearly coupled to a qubit sensor is well understood, with applications ranging from field interpolation to noise characterization. Here we resolve a number of open questions that arise when extending this framework to Mach-Zehnder interferometers and quadrature displacement sensing. In particular, we derive lower bounds on the achievable mean square error in estimating a linear function of either local phase shifts or quadrature displacements. In the case of local phase shifts, these results prove, and somewhat generalize, a conjecture by Proctor []. For quadrature displacements, we extend proofs of lower bounds to the case of arbitrary linear functions. We provide optimal protocols achieving these bounds up to small (multiplicative) constants and describe an algebraic approach to deriving new optimal protocols, possibly subject to additional constraints. Using this approach, we prove necessary conditions for the amount of entanglement needed for any optimal protocol for both local phase and displacement sensing. Published by the American Physical Society 2024

Bringewatt, Jacob↗

DOE OSTI2020

Predicting Biological Cleanliness: An Empirical Bayes Approach for Spacecraft Bioburden Accounting

To comply with the international planetary protection policy set forth by the Committee on Space Research and NASA Agency level requirements, spacecraft destined to biologically sensitive planetary bodies have to minimize terrestrial biological contamination. Analysis, testing and inspection are the standard forward verification activities that are used to demonstrate compliance with the biological contamination requirements. For testing of spacecraft surface areas, a swab or wipe sample is collected from surfaces prior to last access and subsequently processed in the lab using NASA Approved Planetary Protection Methods for Culture Based Assays. Raw data resulting from this assay is then statistically treated employing a mathematical paradigm stemming from the 1970’s Viking Lander Project to generate the bioburden density and total microbial bioburden present. This standard approach arbitrarily accounts for error and provides an upper conservative bound as it reports the maximum number of spores estimated to be present on flight hardware surfaces. A bioburden density estimate factors in the following variables: the observed bioburden count, representative volume processed, sampling efficiencies. Notably, to account for error in the approach, a 0 observed count is arbitrarily changed to a count of 1 for each hardware grouping. The data generated by spacecraft bioburden verification campaigns in the past have resulted in <80% of wipes and <90% of swabs containing a bioburden count of 0. As such, having a robust and well documented statistical approach for dealing with the probability of low incident rates is necessary to be able to estimate spacecraft bioburden. Being able to statistically describe the bioburden distribution and associated confidence level is a gamechanger for the development of bioburden allocations during mission design and will allow for tighter management of risk throughout spacecraft build. Thus, Empirical Bayes statistical approach was evaluated to estimate the microbial bioburden on spacecraft to mitigate the aforementioned mathematical concerns and provide a probabilistic bioburden distribution of the flight hardware surface. For application of this approach to performing bioburden calculations, a range of non-informative prior assumptions on hardware surfaces are explored for Bayesian analyses while informative priors using posterior distributions from prior assays are utilized for Empirical Bayes analyses. Several non-informative priors are currently under investigation to assess fitness including use of these priors to serve as a foundation to build off of NASA specification values or a basis of risk to account for unknowns during the integration and testing process. Informative priors under consideration are generated using sampled bioburden values from hardware originating within like processing environments (e.g. vendor cleaning process or similar assembly process), temporal spacecraft status events as a prediction for hardware cleanliness of future samples, and heritage system bioburden actuals to predict allocation for subsequent missions. Informative priors and probabilistic bioburden distributions are then validated using data sets from the Mars Exploration Rover, Mars Science Laboratory, and InSight missions. Using Empirical Bayes approach to generate a probabilistic bioburden distribution as demonstrated through mission use cases provides a valid approach for use in the end-to-end requirements verification process.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Bayesian Framework for Bioburden Density Estimation in Planetary Protection

To comply with the international planetary protection policy set forth by the Committee on Space Research and NASA Agency level requirements, spacecraft destined to biologically sensitive planetary bodies have to minimize terrestrial biological contamination. Analysis, testing and inspection are the standard forward verification activities that are used to demonstrate compliance with the biological contamination requirements. For testing of spacecraft surface areas, a swab or wipe sample is collected from surfaces prior to last access and subsequently processed in the lab using NASA Approved Planetary Protection Methods for Culture Based Assays. Raw data resulting from this assay is then statistically treated employing a mathematical paradigm stemming from the 1970’s Viking Lander Project to generate the bioburden density and total microbial bioburden present. This standard approach arbitrarily accounts for error and provides an upper conservative bound as it reports the maximum number of spores estimated to be present on flight hardware surfaces. A bioburden density estimate factors in the following variables: the observed bioburden count, representative volume processed, sampling efficiencies. Notably, to account for error in the approach, a 0 observed count is arbitrarily changed to a count of 1 for each hardware grouping. The data generated by spacecraft bioburden verification campaigns in the past have resulted in <80% of wipes and <90% of swabs containing a bioburden count of 0. As such, having a robust and well documented statistical approach for dealing with the probability of low incident rates is necessary to be able to estimate spacecraft bioburden. Being able to statistically describe the bioburden distribution and associated confidence level is a gamechanger for the development of bioburden allocations during mission design and will allow for tighter management of risk throughout spacecraft build. Thus, Empirical Bayes statistical approach was evaluated to estimate the microbial bioburden on spacecraft to mitigate the aforementioned mathematical concerns and provide a probabilistic bioburden distribution of the flight hardware surface. For application of this approach to performing bioburden calculations, a range of non-informative prior assumptions on hardware surfaces are explored for Bayesian analyses while informative priors using posterior distributions from prior assays are utilized for Empirical Bayes analyses. Several non-informative priors are currently under investigation to assess fitness including use of these priors to serve as a foundation to build off of NASA specification values or a basis of risk to account for unknowns during the integration and testing process. Informative priors under consideration are generated using sampled bioburden values from hardware originating within like processing environments (e.g. vendor cleaning process or similar assembly process), temporal spacecraft status events as a prediction for hardware cleanliness of future samples, and heritage system bioburden actuals to predict allocation for subsequent missions. Informative priors and probabilistic bioburden distributions are then validated using data sets from the Mars Exploration Rover, Mars Science Laboratory, and InSight missions. Using Empirical Bayes approach to generate a probabilistic bioburden distribution as demonstrated through mission use cases provides a valid approach for use in the end-to-end requirements verification process.

97 - MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Estimation of sensor measurement errors in reactor coolant systems using multi-sensor fusion

A nuclear power plant is typically instrumented with a variety of sensors to continually monitor its variables, and their sensor’s measurements may be used to assess the plant state and initiate safety actions, if needed. Errors in sensor measurements, due to factors such as calibration drifts, critically affect such state assessments. Here, we address a problem of estimating sensor errors using physics-informed machine learning methods that use measurements collected under known plant conditions. For a given sensor, we propose an information fusion method that uses measurements from other sensors to estimate its output assuming it is error-free and provides its difference from an actual measurement as an error estimate. We present the ensemble of trees and support vector machine fusers, and evaluate their performance using measurements collected over an emulated test loop of a pressurized water reactor. The plant variables are related to each other through the underlying physical laws under inertial constraints that place bounds on their derivatives, which analytically justify the applicability of machine learning methods for computing these fusers. Under twenty scenarios, we assess their sensor error estimates for pressure sensors of the heat exchanger of a reactor’s primary coolant system. Multiple types of errors are captured by both fusers under externally induced calibration drifts, blockages, minor leaks and air gaps in sensing lines, and electromagnetic interference; the root mean square error of the estimation of error is under 2.2% percent of the maximum measurement. We present generalization equations, in the framework of statistical learning theory, for these methods that characterize the confidence probability that the estimation error is bounded by a specified parameter in future test scenarios.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2020

Stability Analysis of Inline ZFP Compression for Floating-Point Data in Iterative Methods

Currently, the dominating constraint in many high performance computing applications is data capacity and bandwidth, in both internode communications and even moreso in intranode data motion. A new approach to address this limitation is to make use of data compression in the form of a compressed data array. Storing data in a compressed data array and converting to standard IEEE-754 types as needed during a computation can reduce the pressure on bandwidth and storage. However, repeated conversions (lossy compression and decompression) introduce additional approximation errors, which need to be shown to not significantly affect the simulation results. Here, we extend recent work that analyzed the error of a single use of compression and decompression of the ZFP compressed data array representation to the case of time-stepping and iterative schemes, where an advancement operator is repeatedly applied in addition to the conversions. We show that the accumulated error for iterative methods involving fixed-point and time evolving iterations is bounded under standard constraints. An upper bound is established on the number of additional iterations required for the convergence of stationary fixed-point iterations. An additional analysis of traditional forward and backward error of stationary iterative methods using ZFP compressed arrays is also presented. The results of several 1D, 2D, and 3D test problems are provided to demonstrate the correctness of the theoretical bounds.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Dynamical logical qubits in the Bacon-Shor code

The Bacon-Shor code is a quantum error correcting subsystem code composed of weight-2 check operators that admits a single logical qubit, and has distance 𝑑 on a 𝑑×𝑑 square lattice. We show that when viewed as a Floquet code, by choosing an appropriate measurement schedule of the check operators, it can additionally host several dynamical logical qubits. Specifically, we identify a period-4 measurement schedule of the check operators that preserves logical information between the instantaneous stabilizer groups. Such a schedule not only measures the usual stabilizers of the Bacon-Shor code, but also measures and promotes gauge operators of the parent subsystem code to additional temporary stabilizers that protect the dynamical logical qubits against errors. We show that the code distance of these Floquet-Bacon-Shor codes scales as Θ⁢(𝑑/√𝑘) on an 𝑛=𝑑×𝑑 lattice with 𝑘 dynamical logical qubits, along with the logical qubit of the parent subsystem code. Unlike the usual Bacon-Shor code, the Floquet-Bacon-Shor code family introduced here can therefore saturate the subsystem bound 𝑘⁢𝑑=𝑂⁡(𝑛). Moreover, several errors are shown to be self-corrected purely by the measurement schedule itself. This work provides insights into the design space for dynamical codes and expands the known approaches for constructing Floquet codes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2023

Vehicle Localization in 3D World Coordinates Using Single Camera at Traffic Intersection

Optimizing traffic control systems at traffic intersections can reduce the network-wide fuel consumption, as well as emissions of conventional fuel-powered vehicles. While traffic signals have been controlled based on predetermined schedules, various adaptive signal control systems have recently been developed using advanced sensors such as cameras, radars, and LiDARs. Among these sensors, cameras can provide a cost-effective way to determine the number, location, type, and speed of the vehicles for better-informed decision-making at traffic intersections. In this research, a new approach for accurately determining vehicle locations near traffic intersections using a single camera is presented. For that purpose, a well-known object detection algorithm called YOLO is used to determine vehicle locations in video images captured by a traffic camera. YOLO draws a bounding box around each detected vehicle, and the vehicle location in the image coordinates is converted to the world coordinates using camera calibration data. During this process, a significant error between the center of a vehicle’s bounding box and the real center of the vehicle in the world coordinates is generated due to the angled view of the vehicles by a camera installed on a traffic light pole. As a means of mitigating this vehicle localization error, two different types of regression models are trained and applied to the centers of the bounding boxes of the camera-detected vehicles. The accuracy of the proposed approach is validated using both static camera images and live-streamed traffic video. Based on the improved vehicle localization, it is expected that more accurate traffic signal control can be made to improve the overall network-wide energy efficiency and traffic flow at traffic intersections.

47 OTHER INSTRUMENTATION↗

DOE OSTI2020

FPDetect: Efficient Reasoning About Stencil Programs Using Selective Direct Evaluation

We present FPDetect, a low-overhead approach for detecting logical errors and soft errors affecting stencil computations without generating false positives. We develop an offline analysis that tightly estimates the number of floating-point bits preserved across stencil applications. This estimate rigorously bounds the values expected in the data space of the computation. Violations of this bound can be attributed with certainty to errors. FPDetect helps synthesize error detectors customized for user-specified levels of accuracy and coverage. FPDetect also enables overhead reduction techniques based on deploying these detectors coarsely in space and time. Experimental evaluations demonstrate the practicality of our approach.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Electroweak three-body decays in the presence of two- and three-body bound states

Recently, formalism has been derived for studying electroweak transition amplitudes for three-body systems both in infinite and finite volumes. The formalism provides exact relations that the infinite-volume amplitudes must satisfy, as well as a relationship between physical amplitudes and finite-volume matrix elements, which can be constrained from lattice QCD calculations. This formalism poses additional challenges when compared with the analogous well-studied two-body equivalent one, including the necessary step of solving integral equations of singular functions. In this work, we provide some non-trivial analytical and numerical tests on the aforementioned formalism. In particular, we consider a case where the three-particle system can have three-body bound states as well as bound states in the two-body subsystem. For kinematics below the three-body threshold, we demonstrate that the scattering amplitudes satisfy unitarity. We also check that for these kinematics the finite-volume matrix elements are accurately described by the formalism for two-body systems up to exponentially suppressed corrections. Finally, we verify that in the case of the three-body bound state, the finite-volume matrix element is equal to the infinite-volume coupling of the bound state, up to exponentially suppressed errors.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2023

Context-aware learning of hierarchies of low-fidelity models for multi-fidelity uncertainty quantification

Multi-fidelity Monte Carlo methods leverage low-fidelity and surrogate models for variance reduction to make tractable uncertainty quantification even when numerically simulating the physical systems of interest with high-fidelity models is computationally expensive. This work proposes a context-aware multi-fidelity Monte Carlo method that optimally balances the costs of training low-fidelity models with the costs of Monte Carlo sampling. It generalizes the previously developed context-aware bi-fidelity Monte Carlo method to hierarchies of multiple models and to more general types of low-fidelity models. When training low-fidelity models, the proposed approach takes into account the context in which the learned low-fidelity models will be used, namely for variance reduction in Monte Carlo estimation, which allows it to find optimal trade-offs between training and sampling to minimize upper bounds of the mean-squared errors of the estimators for given computational budgets. This is in stark contrast to traditional surrogate modeling and model reduction techniques that construct low-fidelity models with the primary goal of approximating well the high-fidelity model outputs and typically ignore the context in which the learned models will be used in upstream tasks. Further, the proposed context-aware multi-fidelity Monte Carlo method applies to hierarchies of a wide range of types of low-fidelity models such as sparse-grid and deep-network models. Numerical experiments with the gyrokinetic simulation code Gene show speedups of up to two orders of magnitude compared to standard estimators when quantifying uncertainties in small-scale fluctuations in confined plasma in fusion reactors. This corresponds to a runtime reduction from 72 days to four hours on one node of the Lonestar6 supercomputer at the Texas Advanced Computing Center.

42 ENGINEERING↗

DOE OSTI2025

Traceable random numbers from a non-local quantum advantage

The unpredictability of random numbers is fundamental to both digital security and applications that fairly distribute resources. However, existing random number generators have limitations—the generation processes cannot be fully traced, audited and certified to be unpredictable. The algorithmic steps used in pseudorandom number generators are auditable, but they cannot guarantee that their outputs were a priori unpredictable given knowledge of the initial seed. Device-independent quantum random number generators can ensure that the source of randomness was unknown beforehand, but the steps used to extract the randomness are vulnerable to tampering. Here we demonstrate a fully traceable random number generation protocol based on device-independent techniques. Our protocol extracts randomness from unpredictable non-local quantum correlations, and uses distributed intertwined hash chains to cryptographically trace and verify the extraction process. This protocol forms the basis for a public traceable and certifiable quantum randomness beacon that we have launched. Over the first 40 days of operation, we completed the protocol 7,434 out of 7,454 attempts—a success rate of 99.7%. Each time the protocol succeeded, the beacon emitted a pulse of 512 bits of traceable randomness. The bits are certified to be uniform with error multiplied by actual success probability bounded by 2−64. Further, the generation of certifiable and traceable randomness represents a public service that operates with an entanglement-derived advantage over comparable classical approaches.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Dynamic Power Network State Estimation with Asynchronous Measurements

The operation of distribution networks is becoming increasingly volatile, due to fast variations of renewables and, hence, net-loading conditions. To perform a reliable state estimation under these conditions, this paper considers the case where measurements from meters, phasor measurement units, and distributed energy resources are collected and processed in real time to produce estimates of the state at a fast time scale. Streams of measurements collected in real time and at heterogenous rates render the underlying processing asynchronous, and poses severe strains on workhorse state estimation algorithms. In this work, a real-time state estimation algorithm is proposed, where data are processed on the fly. Starting from a regularized least-squares model, and leveraging appropriate linear models, the proposed scheme boils down to a linear dynamical system where the state is updated based on the previous estimate and on the measurement gathered from a few available sensors. The estimation error is shown to be always bounded under mild condition. Numerical simulations are provided to corroborate the analytical findings.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2023

Vertical detachment energies of ammonia cluster anions using self-interaction-corrected methods

Systems with weakly bound extra electrons impose great challenges to semilocal density functional approximations (DFAs), which suffer from self-interaction errors. Small ammonia clusters are one such example of weakly bound anions where the extra electron is weakly bound. We applied two self-interaction correction (SIC) schemes, viz., the well-known Perdew–Zunger and the recently developed locally scaled SIC (LSIC) with the local spin density approximation (LSDA), Perdew–Burke–Ernzerhof (PBE) generalized gradient approximation (GGA), and the SCAN meta-GGA functionals to calculate the vertical detachment energies (VDEs) of small ammonia cluster anions (NH3)n–. Our results show that the LSIC significantly reduces the errors in calculations of VDE with LSDA and PBE-GGA functionals leading to better agreement with the reference values calculated with coupled cluster singles and doubles with perturbative triples [CCSD(T)]. Accurate prediction of VDE as an absolute of the highest occupied molecular orbital (HOMO) is challenging for DFAs. Our results show that VDEs estimated from the negative of HOMO eigenvalues with the LSIC-LSDA and Perdew–Zunger SIC-PBE are within 11 meV of the reference CCSD(T) results. Here, the LSIC method performs consistently well for the VDE estimates, from both the total energy differences and the absolute HOMO eigenvalues.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2024

Saturating the one-axis twisting quantum Cramér-Rao bound with a total spin readout

We show that the lowest quantum Cramér-Rao bound achievable in interferometry with a one-axis twisted spin coherent state is saturated by the asymptotic method of moments error of a protocol that uses one call to the one-axis twisting, one call to time-reversed one-axis twisting, and a final total spin measurement (i.e., a twist-untwist protocol). The result is derived by first showing that the metrological phase diagram for one-axis twisting is asymptotically characterized by a single quantum Fisher information value N(N + 1)/2 for all times, then constructing a twist-untwist protocol having a method of moments error that saturates this value. The case of finite-range one-axis twisting is similarly analyzed, and a simple functional form for the metrological phase diagram is found in both the short-range and long-range interaction regimes. Numerical evidence suggests that the finite-range analogues of twist-untwist protocols can exhibit a method of moments error that asymptotically saturates the lowest quantum Cramér-Rao bound achievable in interferometry with finite-range one-axis twisted spin coherent states for all interaction times.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Risk-Based Dispatch Bound Calculator

This calculator outputs time-varying lower and upper bounds (matrices), called dispatch bounds, for the controllable portions of the power injections at each node in a distribution network to guarantee that the voltage magnitudes stay within prescribed bounds with at least a given probability for any set of power injections that are within their dispatch bounds. The calculator is meant to be a tool for a central controller of a distribution network to set dispatch bounds for each node that allows each node to independently decide their actual power injection within their dispatch bound. The user can choose whether to assume the forecast errors of the uncontrollable power injections are gaussian or are worst-case (distributionally robust). The user can choose whether the dispatch bounds include the controllable reactive power or just the active power under a constant power factor assumption.

Comden, Joshua↗

DOE OSTI2021

Bias Characterization, Vertical Interpolation, and Horizontal Interpolation for Distributed Wind Siting Using Mesoscale Wind Resource Estimates

Much like their counterparts in utility-scale wind energy, developers of industrial, small-scale and distributed wind turbine deployments need to understand and accurately characterize the wind resource to properly assess the power generation and financial ramifications during siting and planning. National Renewable Energy Laboratory’s WIND (Wind Integration National Dataset) Toolkit (WTK) provides a best-in-class wind resource dataset generated using the Weather Research and Forecasting (WRF) model. This dataset includes parameters such as the wind speed, wind direction, and temperature at various heights, plus atmospheric stability near the surface. This data is available at 2-km spatial resolution and five-minute temporal resolution across 7 years, from 2007 to 2013 through a publicly accessible API interface. The Tools Assessing Performance (TAP) project seeks to extend this dataset to allow long term resource estimates and leverage it to better equip distributed wind equipment manufacturers, owner-operators, and installation professionals with better tools for practical siting applications. In this report, we present the results from our investigation within the TAP project focused on characterization of bias in WTK-based wind speed estimates and evaluation of vertical and horizontal interpolation techniques. We discuss the tradeoffs between different techniques and their combinations, as well as describe the lower bounds we determine for the studied validation errors. While the specific estimates we present are specific to WTK and the validation dataset we have chosen for this investigation (NREL's Wind Resource Meteorological Database), the overall analysis and the studied techniques are general enough to be applied to a broader set of wind datasets, both simulation-based and observational.

17 WIND ENERGY↗

DOE OSTI2025

Analysis of the Trusted Inertial Terrain-Aided Navigation Measurement Function

The trusted inertial terrain-aided navigation (TITAN) algorithm leverages an airborne vertical synthetic aperture radar to measure the range to the closest ground points along several prescribed iso-Doppler contours. These TITAN minimum-range, prescribed-Doppler measurements are the result of a constrained nonlinear optimization problem whose optimization function and constraints both depend on the radar position and velocity. Owing to the complexity of this measurement definition, analysis of the TITAN algorithm is lacking in prior work. This publication offers such an analysis, making the following three contributions: (1) an analytical solution to the TITAN constrained optimization measurement problem, (2) a derivation of the TITAN measurement function Jacobian, and (3) a derivation of the Cramér-Rao lower bound on the estimated position and velocity error covariance. These three contributions are verified via Monte Carlo simulations over synthetic terrain, which further reveal two remarkable properties of the TITAN algorithm: (1) the along-track positioning errors tend to be smaller than the cross-track positioning errors, and (2) the cross-track positioning errors are independent of the terrain roughness.

TITAN↗