Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Bounds”

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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Scalable Programming Workflows for Validation of Quantum Computers

Hybrid quantum-classical workflows have become standard methods for executing variational algorithms and other quantum simulation techniques, which are key applications for noisy intermediate scale quantum (NISQ) computers. Validating these simulations is an important task which helps gauge the progress of quantum computer development, and classical simulation can serve as a tool to this end. Both exact and more scalable approximate methods with quantifiable error bounds can be used in validation tasks where the applicable metrics include the distance from a calculable ground truth, the quality of an error model fit to data, etc. Here we present a library extension that includes methods for validation of quantum simulations based on scalable hybrid workflows executable on high performance computers. We provide examples that use approximate methods based on tensor networks and stabilizer simulators to bound the error of quantum simulations on NISQ hardware.

Nguyen, Thien↗
DOE OSTI2026

Capacities of Entanglement Distribution From a Central Source

Distribution of entanglement is an essential task in quantum information processing and the realization of quantum networks. In our work, we theoretically investigate the scenario where a central source prepares an N -partite entangled state and transmits each entangled subsystem to one of N receivers through noisy quantum channels. The receivers are then able to perform local operations assisted by unlimited classical communication to distill target entangled states from the noisy channel output. In this operational context, we define the EPR distribution capacity and the GHZ distribution capacity of a quantum channel as the largest rates at which Einstein-Podolsky-Rosen (EPR) states and Greenberger-Horne-Zeilinger (GHZ) states can be faithfully distributed through the channel, respectively. We establish lower and upper bounds on the EPR distribution capacity by connecting it with the task of assisted entanglement distillation. We also construct an explicit protocol consisting of a combination of a quantum communication code and a classical-post-processing-assisted entanglement generation code, which yields a simple achievable lower bound for generic channels. As applications of these results, we give an exact expression for the EPR distribution capacity over two erasure channels and bounds on the EPR distribution capacity over two generalized amplitude damping channels. We also bound the GHZ distribution capacity, which results in an exact characterization of the GHZ distribution capacity when the most noisy channel is a dephasing channel.

42 ENGINEERING↗
DOE OSTI2020

Method for estimating the density of high-level nuclear waste glass

A database of over 1100 silicate glass compositions and densities was compiled and used to evaluate the efficacy of an algorithm for estimating the density of silicate glass compositions. We sought to develop a parsimonious algorithm based on the additivity of partial molar volumes of individual oxide components weighted by their mole fraction in a glass composition. Bound molar volumes were used for oxides in which the density of the oxide bound in a glass matrix was previously determined. The bound molar volumes were known for oxides covering 97.5 mole percent of the database compositional space. The measured glass densities were plotted against the estimated glass densities and a linear regression yielded an R 2 adj. = 0.95 and a slope and intercept of approximately one and zero, respectively. This regression suggests that glass densities estimated by the algorithm, within analysis uncertainty, are equal to the measured densities of the glasses. In addition to the development of the density estimation, we corroborated many of the referenced bound molar volume data used in the parameterization of the estimation algorithm via linear regression of the individual partial molar volumes versus the inverse measured densities (specific volumes) of the glasses in the database.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

Modifying the Asynchronous Jacobi Method for Data Corruption Resilience

Moving scientific computation from high-performance computing (HPC) and cloud computing (CC) environments to devices on the edge, i.e., physically near instruments of interest, has received tremendous interest in recent years. Such edge computing environments can operate on data in situ, offering enticing benefits over data aggregation to HPC and CC facilities that include avoiding costs of transmission, increased data privacy, and real-time data analysis. Because of the inherent unreliability of edge computing environments, new fault-tolerant approaches must be developed before the benefits of edge computing can be realized. Motivated by algorithm-based fault tolerance, a variant of the asynchronous Jacobi (ASJ) method is developed that achieves resilience to data corruption by rejecting solution approximations from neighbor devices according to a bound derived from convergence theory. Numerical results on a two-dimensional Poisson problem show that the new rejection criterion, along with a novel approximation to the shortest path length on which the criterion depends, restores convergence for the ASJ variant in the presence of certain types data corruption. Numerical results are obtained for when the singular values in the analytic bound are approximated. Additional linear systems are also explored, one with a more dense sparsity pattern and one that includes advection. All results indicate that successful resilience to data corruption depends on whether the bound tightens fast enough to reject corrupted data before the iteration evolution deviates significantly from that predicted by the convergence theory defining the bound. This observation generalizes to future work on algorithm-based fault tolerance for other asynchronous algorithms, including upcoming approaches that leverage Krylov subspaces.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Gleipnir: toward practical error analysis for Quantum programs

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the (ρ,δ)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state ρ and its distance δ to the ideal state ρ. This predicate (ρ,δ) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the (ρ,δ)-diamond norm metric. Furthermore, our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

Tao, Runzhou↗
DOE OSTI2022

Region-adaptive, Error-controlled Scientific Data Compression using Multilevel Decomposition

The increase of computer processing speed is significantly outpacing improvements in network and storage bandwidth, leading to the big data challenge in modern science, where scientific applications can quickly generate much more data than that can be transferred and stored. As a result, big scientific data must be reduced by a few orders of magnitude while the accuracy of the reduced data needs to be guaranteed for further scientific explorations. Moreover, scientists are often interested in some specific spatial/temporal regions in their data, where higher accuracy is required. The locations of the regions requiring high accuracy can sometimes be prescribed based on application knowledge, while other times they must be estimated based on general spatial/temporal variation. In this paper, we develop a novel multilevel approach which allows users to impose region-wise compression error bounds. Our method utilizes the byproduct of a multilevel compressor to detect regions where details are rich and we provide the theoretical underpinning for region-wise error control. With spatially varying precision preservation, our approach can achieve significantly higher compression ratios than single-error bounded compression approaches and control errors in the regions of interest.We conduct the evaluations on two climate use cases – one targeting small-scale, node features and the other focusing on long, areal features. For both use cases, the locations of the features were unknown ahead of the compression. By selecting approximately 16% of the data based on multi-scale spatial variations and compressing those regions with smaller error tolerances than the rest, our approach improves the accuracy of post-analysis by approximately 2 × compared to single-error-bounded compression at the same compression ratio. Using the same error bound for the region of interest, our approach can achieve an increase of more than 50% in overall compression ratio.

Gong, Qian↗
DOE OSTI2022

Online Learning and Pricing for Service Systems with Reusable Resources

We consider a price-based revenue management problem with finite reusable resources over a finite time horizon T. Customers arrive following a price-dependent Poisson process, and each customer requests one unit of c homogeneous reusable resources. If there is an available unit, the customer gets served within a price-dependent exponentially distributed service time; otherwise, the customer waits in a queue until the next available unit. In this paper, we assume that the firm does not know how the arrival and service rates depend on posted prices, and thus it makes adaptive pricing decisions in each period based only on past observations to maximize the cumulative revenue. Given a discrete price set with cardinality P, we propose two online learning algorithms, termed batch upper confidence bound (BUCB) and batch Thompson sampling (BTS), and prove that the cumulative regret upper bound is O˜(√PT) , which matches the regret lower bound. In establishing the regret, we bound the transient system performance upon price changes via a novel coupling argument, and also generalize bandits to accommodate subexponential rewards. Here, we also extend our approach to models with balking and reneging customers and discuss a continuous price setting. Our numerical experiments demonstrate the efficacy of the proposed BUCB and BTS algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Assessment of the MACCS Code Applicability for Nearfield Consequence Analysis

Three codes are used for comparisons in this report to evaluate the adequacy of MACCS in the nearfield, AERMOD, ARCON96 and QUIC. Test cases were developed to give a broad range of weather conditions, building dimensions and plume buoyancy. Based on the comparisons of MACCS with AERMOD, ARCON96 and QUIC across the test cases, the following observations are made: MACCS calculations configured with point-source, ground-level, nonbuoyant plumes provide nearfield results that bound the centerline, ground-level air concentrations from AERMOD, ARCON96, and QUIC. MACCS calculations with ground-level, nonbuoyant plumes that include the effects of the building wake (area source) provide nearfield results that bound the results from AERMOD and QUIC and the results from ARCON96 at distances >250 m. If using a point-source is too conservative and it is desired to bound the results from all three codes, another alternative is to use area source parameters in MACCS that are less than the standard values, i.e., an area source intermediate between the standard recommendation and a point source. All these options provide results from MACCS that are bounding for the test cases evaluated. Based on these observations, it appears that MACCS is adequate for use in nearfield calculations, given the correct parameterization.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2020

Opacity on NIF: Anchor 2 Iron (Level 2 Milestone 7118 Report)

In FY2020 we fulfilled the exit criteria of milestone 7118. We fielded iron opacity experiments at higher densities and temperatures approaching anchor 2 conditions and made good progress on overcoming the problems that we found. This report describes in detail the progress that has been made. We presented the results in a LANL seminar on August 10 and we gave two talks on our results to the National Opacity Workshop Series, one on July 9 and the other on September 14. Before discussing the anchor 2 measurements, we present an update of the NIF anchor 1 data. We did a new analysis of the anchor 1 data and compared the results to a series of calculations using the LANL ATOMIC code. Figures 1 and 2 compare the data with the best-fit to calculations. This result is significantly improved over the result published in Atoms. The differences are small for the iron quasi-continuum between 8-9.5 Å and for the Mg Heα and Lyα lines. The opacities near the centers of the iron bound-bound features also match fairly well in the 9.5-12.5 Å range. However, the opacity windows between the large iron bound-bound features are deeper in the Atomic predictions than the measurement. Furthermore, large discrepancies exist for the Mg He β, γ, and δ lines and for the short-wavelength quasicontinuum. The experiment and analysis refinements described below have set the stage for unraveling these discrepancies. Specifically, we can repeat the Anchor 1 experiments using improved backlighter, hohlraum, and spectrometers to obtain reduced backgrounds and better spectral resolution. Exploiting the AlMg calibration experiments and repeating the Anchor 1 measurements multiple times will enable formal and rigorous uncertainty determination. This well-defined path gives us confidence that high quality opacity data can be obtained on NIF.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2020

Neutrino oscillation phenomenology in the standard model and beyond

Over the last 20 years measurements of neutrino oscillation parameters have become very precise. In the standard neutrino oscillation picture most of the parameters are measured at the percent level. In this thesis we study neutrino oscillations in the standard picture and beyond. We analyze data from all types of neutrino oscillation experiments to obtain a global picture of neutrino oscillations. The remaining unknowns in the standard picture are the value of the CP-violating phase $\delta$, the octant of the atmospheric angle $\theta_{23}$ and the neutrino mass ordering. We discuss the current status of these unknowns and also comment on how well future experiments will do in measuring these quantities, where we discuss new facilities which will observe accelerator, atmossperic and reactor neutrinos. Using oscillation data it is possible to bound a possible violation of the CPT symmetry in the neutrino sector. This is done by performing a fit to neutrino and antineutrino oscillation data separately. We also address the capability of the future experiment DUNE to this scenario. We show that DUNE could improve some of the current bounds considerably. We discuss the sensitivity of DUNE together with the next generation reactor neutrino experiment JUNO to measure quasi-Dirac neutrino oscillations. We find that the future experiments will be able to bound the important quantities, mostly unbounded by current data. Finally, we discuss atmospheric neutrinos at the next generation neutrino telescope ORCA. We show that ORCA will put the best bounds on the invisible neutrino decay of $\nu_3$, coming from neutrino oscillation experiments. We also find that, a scenario like this would not affect the standard measurements of ORCA, namely the determination of the atmospheric neutrino oscillation parameters and the measurement of the neutrino mass ordering.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Multi-fidelity thermal modeling of laser powder bed additive manufacturing

Laser powder bed fusion (LPBF) Additive manufacturing (AM) has attracted interest as an agile method of building production metal parts to reduce design-build-test cycle times for systems. However, predicting part performance is difficult due to inherent process variabilities. This makes qualification challenging. Computational process models have attempted to address some of these challenges, including mesoscale, full physics models and reduced fidelity conduction models. The goal of this work is credible multi-fidelity modeling of the LPBF process by investigating methods for estimating the error between models of two different fidelities. Two methods of error estimation are investigated, adjoint-based error estimation and Bayesian calibration. Adjoint-based error estimation is found to effectively bounding the error between the two models, but with very conservative bounds, making predictions highly uncertain. Bayesian parameter calibration applied to conduction model heat source parameters is found to effectively bound the observed error between the models for melt pool morphology quantities of interest. However, the calibrations do not effectively bound the error in heat distribution.

36 MATERIALS SCIENCE↗
DOE OSTI2023

An Analysis of the Johnson-Lindenstrauss Lemma with the Bivariate Gamma Distribution

Probabilistic proofs of the Johnson-Lindenstrauss lemma imply that random projection can reduce the dimension of a data set and approximately preserve pairwise distances. If a distance being approximately preserved is called a success, and the complement of this event is called a failure, then such a random projection likely results in no failures. Assuming a Gaussian random projection, the lemma is proved by showing that the no-failure probability is positive using a combination of Bonferroni's inequality and Markov's inequality. This paper modifies this proof in two ways to obtain a greater lower bound on the no-failure probability. First, Bonferroni's inequality is applied to pairs of failures instead of individual failures. Second, since a pair of projection errors has a bivariate gamma distribution, this probability of a pair of successes is bounded using an inequality from [Jensen, 1969]. If n is the number of points to be embedded and μ is the probability of success, then this leads to an increase in the lower bound on the no-failure probability of $\frac{1}{2}$ ($\genfrac{}{}{0pt}{}{n}{2}$) (1- μ ) 2 is ($\genfrac{}{}{0pt}{}{n}{2}$) is even and $\frac{1}{2}$ (($\genfrac{}{}{0pt}{}{n}{2}$)-1) (1- μ ) 2 if ($\genfrac{}{}{0pt}{}{n}{2}$) is odd. For example, if n =10 5 points are to be embedded in k =10 4 dimensions with a tolerance of ϵ=0.1, then the improvement in the lower bound is on the order of 10 -14 . We also show that further improvement is possible if the inequality in [Jensen, 1969] extends to three successes, though we do not have a proof of this result.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2023

Model-based quantification of margins and uncertainties in metal additive manufacturing for process design and qualification

Laser powder bed fusion (LPBF) Additive Manufacturing (AM) has the potential to enable the production of components with novel designs and material properties unachievable otherwise. However, process repeatability is a challenge, making qualification ill-defined and greatly reducing the utility of what could be an important manufacturing technology. In this work, a combination of modeling, uncertainty quantification (UQ), and experimentation are used in an effort to predict and bound the range of possible outcomes of the LPBF process. Quantities of interest predicted are melt pool dimensions, microstructure features, and mechanical distortions. A combination of high fidelity thermal-fluid models, microstructure growth models, and reduced fidelity, rapid thermal and mechanical models are used. Uncertainty propagation techniques are used to predict probability distributions of quantities of interest from estimates of process uncertainties. Repeated experiments are done to quantify observed probability distributions and compared to predicted distributions to determine if predictions are precise and accurate. Novel modeling methods are microstrucutre characterization techniques are also discussed. It is found that high fidelity models do a generally good job bounding experimentally observed melt pool morphologies for both bead-on-plate and powder bed cases. Microstructure models are able to bound a number of experimentally observed microstructure statistics, but with low precision due to challenges with calibrating the microstructure growth model parameters. A developed modified inherent strain distortion model does not accurately predict observed distortions. A lumped laser distortion model shows promise in being both accurately and precisely bounding observed outcomes from the deflection comb build, but requires further evaluation on more builds and geometries.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Energy storage and coherence in closed and open quantum batteries

We study the role of coherence in closed and open quantum batteries. We obtain upper bounds to the work performed or energy exchanged by both closed and open quantum batteries in terms of coherence. Specifically, we show that the energy storage can be bounded by the Hilbert-Schmidt coherence of the density matrix in the spectral basis of the unitary operator that encodes the evolution of the battery. We also show that an analogous bound can be obtained in terms of the battery's Hamiltonian coherence in the basis of the unitary operator by evaluating their commutator. We apply these bounds to a 4-state quantum system and the anisotropic XY Ising model in the closed system case, and the Spin-Boson model in the open case.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Provably accurate simulation of gauge theories and bosonic systems

Quantum many-body systems involving bosonic modes or gauge fields have infinite-dimensional local Hilbert spaces which must be truncated to perform simulations of real-time dynamics on classical or quantum computers. To analyze the truncation error, we develop methods for bounding the rate of growth of local quantum numbers such as the occupation number of a mode at a lattice site, or the electric field at a lattice link. Our approach applies to various models of bosons interacting with spins or fermions, and also to both abelian and non-abelian gauge theories. We show that if states in these models are truncated by imposing an upper limit Λ on each local quantum number, and if the initial state has low local quantum numbers, then an error at most ϵ can be achieved by choosing Λ to scale polylogarithmically with ϵ − 1 , an exponential improvement over previous bounds based on energy conservation. For the Hubbard-Holstein model, we numerically compute a bound on Λ that achieves accuracy ϵ , obtaining significantly improved estimates in various parameter regimes. We also establish a criterion for truncating the Hamiltonian with a provable guarantee on the accuracy of time evolution. Building on that result, we formulate quantum algorithms for dynamical simulation of lattice gauge theories and of models with bosonic modes; the gate complexity depends almost linearly on spacetime volume in the former case, and almost quadratically on time in the latter case. We establish a lower bound showing that there are systems involving bosons for which this quadratic scaling with time cannot be improved. By applying our result on the truncation error in time evolution, we also prove that spectrally isolated energy eigenstates can be approximated with accuracy ϵ by truncating local quantum numbers at Λ = polylog ( ϵ − 1 ) .

Tong, Yu↗
DOE OSTI2023

Structural analysis and functional evaluation of the disordered ß–hexosyltransferase region from Hamamotoa (Sporobolomyces) singularis

Hamamotoa (Sporobolomyces) singularis codes for an industrially important membrane bound ß-hexosyltransferase (BHT), (BglA, UniprotKB: Q564N5) that has applications in the production of natural fibers such as galacto-oligosaccharides (GOS) and natural sugars found in human milk. When heterologously expressed by Komagataella phaffii GS115, BHT is found both membrane bound and soluble secreted into the culture medium. In silico structural predictions and crystal structures support a glycosylated homodimeric enzyme and the presence of an intrinsically disordered region (IDR) with membrane binding potential within its novel N-terminal region (1–110 amino acids). Additional in silico analysis showed that the IDR may not be essential for stable homodimerization. Thus, we performed progressive deletion analyses targeting segments within the suspected disordered region, to determine the N-terminal disorder region’s impact on the ratio of membrane-bound to secreted soluble enzyme and its contribution to enzyme activity. The ratio of the soluble secreted to membrane-bound enzyme shifted from 40% to 53% after the disordered N-terminal region was completely removed, while the specific activity was unaffected. Furthermore, functional analysis of each glycosylation site found within the C-terminal domain revealed reduced total secreted protein activity by 58%–97% in both the presence and absence of the IDR, indicating that glycosylation at all four locations is required by the host for the secretion of active enzyme and independent of the removed disordered N-terminal region. Overall, the data provides evidence that the disordered region only partially influences the secretion and membrane localization of BHT.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

PhytoOracle: Scalable, modular phenomics data processing pipelines

As phenomics data volume and dimensionality increase due to advancements in sensor technology, there is an urgent need to develop and implement scalable data processing pipelines. Current phenomics data processing pipelines lack modularity, extensibility, and processing distribution across sensor modalities and phenotyping platforms. To address these challenges, we developed PhytoOracle (PO), a suite of modular, scalable pipelines for processing large volumes of field phenomics RGB, thermal, PSII chlorophyll fluorescence 2D images, and 3D point clouds. PhytoOracle aims to ( i ) improve data processing efficiency; ( ii ) provide an extensible, reproducible computing framework; and ( iii ) enable data fusion of multi-modal phenomics data. PhytoOracle integrates open-source distributed computing frameworks for parallel processing on high-performance computing, cloud, and local computing environments. Each pipeline component is available as a standalone container, providing transferability, extensibility, and reproducibility. The PO pipeline extracts and associates individual plant traits across sensor modalities and collection time points, representing a unique multi-system approach to addressing the genotype-phenotype gap. To date, PO supports lettuce and sorghum phenotypic trait extraction, with a goal of widening the range of supported species in the future. At the maximum number of cores tested in this study (1,024 cores), PO processing times were: 235 minutes for 9,270 RGB images (140.7 GB), 235 minutes for 9,270 thermal images (5.4 GB), and 13 minutes for 39,678 PSII images (86.2 GB). These processing times represent end-to-end processing, from raw data to fully processed numerical phenotypic trait data. Repeatability values of 0.39-0.95 (bounding area), 0.81-0.95 (axis-aligned bounding volume), 0.79-0.94 (oriented bounding volume), 0.83-0.95 (plant height), and 0.81-0.95 (number of points) were observed in Field Scanalyzer data. We also show the ability of PO to process drone data with a repeatability of 0.55-0.95 (bounding area).

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Advancing Tassel Detection and Counting: Annotation and Algorithms

Tassel counts provide valuable information related to flowering and yield prediction in maize, but are expensive and time-consuming to acquire via traditional manual approaches. High-resolution RGB imagery acquired by unmanned aerial vehicles (UAVs), coupled with advanced machine learning approaches, including deep learning (DL), provides a new capability for monitoring flowering. In this article, three state-of-the-art DL techniques, CenterNet based on point annotation, task-aware spatial disentanglement (TSD), and detecting objects with recursive feature pyramids and switchable atrous convolution (DetectoRS) based on bounding box annotation, are modified to improve their performance for this application and evaluated for tassel detection relative to Tasselnetv2+. The dataset for the experiments is comprised of RGB images of maize tassels from plant breeding experiments, which vary in size, complexity, and overlap. Results show that the point annotations are more accurate and simpler to acquire than the bounding boxes, and bounding box-based approaches are more sensitive to the size of the bounding boxes and background than point-based approaches. Overall, CenterNet has high accuracy in comparison to the other techniques, but DetectoRS can better detect early-stage tassels. The results for these experiments were more robust than Tasselnetv2+, which is sensitive to the number of tassels in the image.

54 ENVIRONMENTAL SCIENCES↗