Search NASA⌕ Search

SEARCH · Search NASA

Results for “Structural error”

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 1,297 records · Page 72
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Optical functions of uniaxial rutile and anatase (TiO 2 ) revisited

In this study, the optical functions of uniaxial rutile and anatase (TiO2) were determined from 200 to 850 nm (6.2 to 1.46 eV) using several of four optical techniques: (1) standard spectroscopic two-modulator generalized ellipsometry (2-MGE), (2) near-normal-incidence two-modulator generalized ellipsometry microscopy (2-MGEM), (3) Mueller matrix transmission of rutile, and (4) polarized transmission of rutile. The 2-MGE measurements yielded highly accurate values of the dielectric functions and error estimates from 1.46 to 6.2 eV, whereas the polarization-dependent transmission yielded more accurate values of the absorption coefficient below the band edge of rutile. The 2-MGEM also measured the diattenuation, which is related to the birefringence, and other parameters but at near-normal incidence at a single wavelength (577 nm).

36 MATERIALS SCIENCE↗
DOE OSTI2018

Sparse coding of pathology slides compared to transfer learning with deep neural networks

Background Histopathology images of tumor biopsies present unique challenges for applying machine learning to the diagnosis and treatment of cancer. The pathology slides are high resolution, often exceeding 1GB, have non-uniform dimensions, and often contain multiple tissue slices of varying sizes surrounded by large empty regions. The locations of abnormal or cancerous cells, which may constitute a small portion of any given tissue sample, are not annotated. Cancer image datasets are also extremely imbalanced, with most slides being associated with relatively common cancers. Since deep representations trained on natural photographs are unlikely to be optimal for classifying pathology slide images, which have different spectral ranges and spatial structure, we here describe an approach for learning features and inferring representations of cancer pathology slides based on sparse coding. Results We show that conventional transfer learning using a state-of-the-art deep learning architecture pre-trained on ImageNet (RESNET) and fine tuned for a binary tumor/no-tumor classification task achieved between 85% and 86% accuracy. However, when all layers up to the last convolutional layer in RESNET are replaced with a single feature map inferred via a sparse coding using a dictionary optimized for sparse reconstruction of unlabeled pathology slides, classification performance improves to over 93%, corresponding to a 54% error reduction. Conclusions We conclude that a feature dictionary optimized for biomedical imagery may in general support better classification performance than does conventional transfer learning using a dictionary pre-trained on natural images.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Kinematic Dependence of the Dilution Factor in the SpinQuest Experiment E1039 at Fermilab

Thirty years after the "Spin Crisis" began, there is still uncertainty surrounding the spin structure of the nucleon. SpinQuest Experiment E1039 at FermiLab will attempt to probe the internal transverse dynamics of the nucleon via Drell-Yan scattering of a 120 GeV proton beam from a polarized proton target to determine if the orbital angular momentum of the sea-quarks contributes to the overall spin of the nucleon. In order to understand a leading contribution to the overall systematic uncertainty in this experiment, a study was performed to calculate and evaluate the uncertainty in the dilution factor of the experimental target. This thesis catalogs that effort, highlights where it overlaps with other sources of systematic error, and suggests future work aimed at reducing the overall systematic error of the experiment.

Conover, Arthur↗
DOE OSTI2023

Importance of Dispersion in the Molecular Geometries of Mn(III) Spin-Crossover Complexes

The computational investigation of the molecular geometries of a pair of manganese(III) spin-crossover complexes is reported. For the geometry of the quintet high-spin state, density functionals significantly overestimate Mn–Namine bond distances, although the geometry for the triplet intermediate-spin state is well described. Here, comparisons with several wave function-based methods demonstrate that this error is due to the limited ability of commonly used density functionals to recover dispersion beyond a certain extent. Among the methods employed for geometry optimization, restricted open-shell Møller–Plesset perturbation theory (MP2) appropriately describes the high-spin geometry but results in a slightly shorter Mn–O distance in both spin states. On the other hand, extended multistate complete active space second-order perturbation theory (XMS-CASPT2) provides a good description of the geometry for the intermediate-spin state but also sufficiently recovers dispersion, performing well for the high-spin state. Despite the fact that the electronic structure of both spin states is dominated by one-electron configuration, XMS-CASPT2 offers a balanced approach, leading to molecular geometries with much better agreement with experiment than MP2 and DFT. A scan along the Mn–N amine bond demonstrates that for these complexes coupled cluster methods (i.e., DLPNO-CCSD(T)) also yield bond distances in agreement with experiment while multiconfiguration pair density functional theory (MC-PDFT) is unable to recover dispersion well enough, analogous to single-reference DFT.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

The clustering of the SDSS-IV extended Baryon Oscillation Spectroscopic Survey DR14 quasar sample: structure growth rate measurement from the anisotropic quasar power spectrum in the redshift range 0.8 < z < 2.2

We analyse the clustering of the Sloan Digital Sky Survey IV extended Baryon Oscillation Spectroscopic Survey Data Release 14 quasar sample (DR14Q).We measure the redshift space distortions using the power-spectrum monopole, quadrupole, and hexadecapole inferred from 148 659 quasars between redshifts 0.8 and 2.2, covering a total sky footprint of 2112.9 deg 2 . We constrain the logarithmic growth of structure times the amplitude of dark matter density fluctuations, fσ 8 , and the Alcock–Paczynski dilation scales that allow constraints to be placed on the angular diameter distance D A (z) and the Hubble H(z) parameter. At the effective redshift of z eff = 1.52, fσ 8 (z eff ) = 0.420 ± 0.076, H(z eff ) = [162 ± 12] (r$fid\atop{s}$ /r s ) kms -1 Mpc -1 , and DA(z eff ) = [1.85 ± 0.11] × 10 3 (r s/ r$fid\atop{s}$) Mpc, where r s is the comoving sound horizon at the baryon drag epoch and the superscript ‘fid’ stands for its fiducial value. The errors take into account the full error budget, including systematics and statistical contributions. These results are in full agreement with the current Λ-Cold Dark Matter cosmological model inferred from Planck measurements. Finally, we compare our measurements with other eBOSS companion papers and find excellent agreement, demonstrating the consistency and complementarity of the different methods used for analysing the data.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Lipkin model on a quantum computer

Atomic nuclei are important laboratories for exploring and testing new insights into the universe, such as experiments to directly detect dark matter or explore properties of neutrinos. The targets of interest are often heavy, complex nuclei that challenge our ability to reliably model them (as well as quantify the uncertainty of those models) with classical computers. Hence there is great interest in applying quantum computation to nuclear structure for these applications. As an early step in this direction, especially with regards to the uncertainties in the relevant quantum calculations, we develop circuits to implement variational quantum eigensolver (VQE) algorithms for the Lipkin-Meshkov-Glick model, which is often used in the nuclear physics community as a testbed for many-body methods. Here, we present quantum circuits for VQE for two and three particles and discuss the construction of circuits for more particles. Implementing the VQE for a two-particle system on the IBM Quantum Experience, we identify initialization and two-qubit gates as the largest sources of error. We find that error mitigation procedures reduce the errors in the results significantly, but additional quantum hardware improvements are needed for quantum calculations to be sufficiently accurate to be competitive with the best current classical methods.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Iterative Learning Control for Video-rate Atomic Force Microscopy

We present a control scheme for video-rate atomic force microscopy with rosette pattern. The controller structure involves a feedback internal-model-based controller and a feedforward iterative learning controller. The iterative learning controller is designed to improve tracking performance of the feedback-controlled scanner by rejecting the repetitive disturbances arising from the system nonlinearities. We investigate the performance of two inversion techniques for constructing the learning filter. We conduct tracking experiments using a two-degree-of-freedom microelectromechanical system (MEMS) nanopositioner at frame rates ranging from 5 to 20 frames per second. Furthermore, the results reveal that the algorithm converges rapidly and the iterative learning controller significantly reduces both the transient and steady-state tracking errors. We acquire and report a series of high-resolution time-lapsed video-rate AFM images with the rosette pattern.

42 ENGINEERING↗
DOE OSTI2020

Algorithms for Efficient Reproducible Floating Point Summation

We define “reproducibility” as getting bitwise identical results from multiple runs of the same program, perhaps with different hardware resources or other changes that should not affect the answer. Many users depend on reproducibility for debugging or correctness. However, dynamic scheduling of parallel computing resources, combined with nonassociative floating point addition, makes reproducibility challenging even for summation, or operations like the BLAS. We describe a “reproducible accumulator” data structure (the “binned number”) and associated algorithms to reproducibly sum binary floating point numbers, independent of summation order. We use a subset of the IEEE Floating Point Standard 754-2008 and bitwise operations on the standard representations in memory. Our approach requires only one read-only pass over the data, and one reduction in parallel, using a 6-word reproducible accumulator (more words can be used for higher accuracy), enabling standard tiling optimization techniques. Summing n words with a 6-word reproducible accumulator requires approximately 9 n floating point operations (arithmetic, comparison, and absolute value) and approximately 3 n bitwise operations. The final error bound with a 6-word reproducible accumulator and our default settings can be up to 2 29 times smaller than the error bound for conventional (recursive) summation on ill-conditioned double-precision inputs.

Computer Science↗
DOE OSTI2020

The GGCMI Phase 2 emulators: global gridded crop model responses to changes in CO 2 , temperature, water, and nitrogen (version 1.0)

Statistical emulation allows combining advantageous features of statistical and process-based crop models for understanding the effects of future climate changes on crop yields. We describe here the development of emulators for nine process-based crop models and five crops using output from the Global Gridded Model Intercomparison Project (GGCMI) Phase 2. The GGCMI Phase 2 experiment is designed with the explicit goal of producing a structured training dataset for emulator development that samples across four dimensions relevant to crop yields: atmospheric carbon dioxide (CO2) concentrations, temperature, water supply, and nitrogen inputs (CTWN). Simulations are run under two different adaptation assumptions: that growing seasons shorten in warmer climates, and that cultivar choice allows growing seasons to remain fixed. The dataset allows emulating the climatological-mean yield response of all models with a simple polynomial in mean growing-season values. Climatological-mean yields are a central metric in climate change impact analysis; we show here that they can be captured without relying on interannual variations. In general, emulation errors are negligible relative to differences across crop models or even across climate model scenarios; errors become significant only in some marginal lands where crops are not currently grown. We demonstrate that the resulting GGCMI emulators can reproduce yields under realistic future climate simulations, even though the GGCMI Phase 2 dataset is constructed with uniform CTWN offsets, suggesting that the effects of changes in temperature and precipitation distributions are small relative to those of changing means. The resulting emulators therefore capture relevant crop model responses in a lightweight, computationally tractable form, providing a tool that can facilitate model comparison, diagnosis of interacting factors affecting yields, and integrated assessment of climate impacts.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2022

Initial ASME code rule analysis on Simple and Full assessment

ASME & ASTM codes present simple and full assessment methodologies to qualify nuclear grade graphite components. This report explains the theory behind the statistical portion of the codes and describes the issues discussed in a 2020 workshop in the simple assessment, as well as the full assessment. The methodology for the full assessment was developed by Hindley []. He used a validation methodology to match the experimental average failure load of test specimens from several geometries to the calculated 50% POF load to tune the grouping criteria parameters based on an RMSE penalty function. The grouping criteria consists of a minimum volume to satisfy the weakest link theory of the Weibull distribution and a minimum stress range parameter. Hindley’s work found a minimum link volume of 10 times the grain size and a stress range parameter of 7% [satisfy the validation requirements. Several studies found that the link volume of 10 times the grain size was not satisfactory for the volume grouping criteria for graphite grades with fine grains. ASME 2021 code adopted a new volume grouping criteria based on fracture toughness for calculation of the process zone volume. However, errors were found in the ASME 2021 code process zone volume equation and the question is now open as to what volume grouping criteria is satisfactory. This report presents results from sensitivity studies that were done to evaluate the volume grouping criteria effect on the full assessment POF. This report also presents results from sensitivity studies on other aspects of the code that affect the POF, the mesh size and the choice of the Weibull threshold parameter. All three sensitivity studies: the volume grouping criteria, the mesh size, and the threshold parameter choice are found to affect the component qualification decision for components of structural reliability class 1 (SRC-1). The sensitivity analysis results are presented in the body of the report for NBG-18, which is the same grade of graphite as Hindley used in his thesis. Results from NBG-17, IG-110, 2114, and PCEA are presented in the Appendix. For NBG-18, it was found that increasing the threshold increases the POF, finer meshes result in higher POFs, and that smaller link volume requirements lead to higher POFs (which is inconsistent with Hindley’s findings). This report proposes a new validation study similar to Hindley’s []. The purpose of the new validation study is to tune the threshold, mesh size and grouping criteria based on results from multiple grades of graphite, including finer grain graphites T220 (1-3 microns) and NG-CT-50 (5 microns). The test specimens will be broken at 3 labs, such that we can measure between lab measurement variability, with at least 5 test specimens per lab such that the within lab uncertainty can also be measured. Hindley’s validation method tried matching the average experimental load with the median. The future study will attempt to match failures at lower percentiles, which would be closer to the SRC POF limit. We are currently looking into what geometries make sense and the best method to measure multi-axial stress states. These design decisions are still being set.

36 MATERIALS SCIENCE↗
DOE OSTI2016

The effectiveness of pretreatment physics plan review for detecting errors in radiation therapy

Purpose: The pretreatment physics plan review is a standard tool for ensuring treatment quality. Studies have shown that the majority of errors in radiation oncology originate in treatment planning, which underscores the importance of the pretreatment physics plan review. This quality assurance measure is fundamentally important and central to the safety of patients and the quality of care that they receive. However, little is known about its effectiveness. The purpose of this study was to analyze reported incidents to quantify the effectiveness of the pretreatment physics plan review with the goal of improving it. Methods: This study analyzed 522 potentially severe or critical near-miss events within an institutional incident learning system collected over a three-year period. Of these 522 events, 356 originated at a workflow point that was prior to the pretreatment physics plan review. The remaining 166 events originated after the pretreatment physics plan review and were not considered in the study. The applicable 356 events were classified into one of the three categories: (1) events detected by the pretreatment physics plan review, (2) events not detected but “potentially detectable” by the physics review, and (3) events “not detectable” by the physics review. Potentially detectable events were further classified by which specific checks performed during the pretreatment physics plan review detected or could have detected the event. For these events, the associated specific check was also evaluated as to the possibility of automating that check given current data structures. For comparison, a similar analysis was carried out on 81 events from the international SAFRON radiation oncology incident learning system. Results: Of the 356 applicable events from the institutional database, 180/356 (51%) were detected or could have been detected by the pretreatment physics plan review. Of these events, 125 actually passed through the physics review; however, only 38% (47/125) were actually detected at the review. Of the 81 events from the SAFRON database, 66/81 (81%) were potentially detectable by the pretreatment physics plan review. From the institutional database, three specific physics checks were particularly effective at detecting events (combined effectiveness of 38%): verifying the isocenter (39/180), verifying DRRs (17/180), and verifying that the plan matched the prescription (12/180). The most effective checks from the SAFRON database were verifying that the plan matched the prescription (13/66) and verifying the field parameters in the record and verify system against those in the plan (23/66). Software-based plan checking systems, if available, would have potential effectiveness of 29% and 64% at detecting events from the institutional and SAFRON databases, respectively. Conclusions: Pretreatment physics plan review is a key safety measure and can detect a high percentage of errors. However, the majority of errors that potentially could have been detected were not detected in this study, indicating the need to improve the pretreatment physics plan review performance. Suggestions for improvement include the automation of specific physics checks performed during the pretreatment physics plan review and the standardization of the review process.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Density Matrix Implementation of the Fermi–Löwdin Orbital Self-Interaction Correction Method

The Fermi–Löwdin orbital self-interaction correction (FLOSIC) method effectively provides a transformation from canonical orbitals to localized Fermi–Löwdin orbitals which are used to remove the self-interaction error in the Perdew–Zunger (PZ) framework. This transformation is solely determined by a set of points in space, called Fermi–Löwdin descriptors (FODs), and the occupied canonical orbitals or the density matrix. In this work, we provide a detailed workflow for the implementation of the FLOSIC method for removal of self-interaction error in DFT calculations in an orbital-by-orbital basis that takes advantage of the unitary invariant nature of the FLOSIC method. In this way, it is possible to cast the self-consistent energy minimization at fixed FODs in the same manner than standard Kohn–Sham with one additional term in the Kohn–Sham Hamiltonian that introduces the PZ self-interaction correction. Each energy minimization iteration is divided in two substeps, one for the density matrix and one for the FODs. Expressions for the effective Kohn–Sham matrix and FOD gradients are provided such that its implementation is suitable for most electronic structure codes. Here, we analyze the convergence characteristics of the algorithm and present applications for the evaluation of NMR shielding constants and real-time time-dependent DFT simulations based on the Liouville–von Neumann equation to calculate excitation energies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Autonomous reinforcement learning agent for chemical vapor deposition synthesis of quantum materials

Abstract Predictive materials synthesis is the primary bottleneck in realizing functional and quantum materials. Strategies for synthesis of promising materials are currently identified by time-consuming trial and error and there are no known predictive schemes to design synthesis parameters for materials. We use offline reinforcement learning (RL) to predict optimal synthesis schedules, i.e., a time-sequence of reaction conditions like temperatures and concentrations, for the synthesis of semiconducting monolayer MoS 2 using chemical vapor deposition. The RL agent, trained on 10,000 computational synthesis simulations, learned threshold temperatures and chemical potentials for onset of chemical reactions and predicted previously unknown synthesis schedules that produce well-sulfidized crystalline, phase-pure MoS 2 . The model can be extended to multi-task objectives such as predicting profiles for synthesis of complex structures including multi-phase heterostructures and can predict long-time behavior of reacting systems, far beyond the domain of molecular dynamics simulations, making these predictions directly relevant to experimental synthesis.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Machine learning assisted prediction of the Young’s modulus of compositionally complex alloys

We identify compositionally complex alloys (CCAs) that offer exceptional mechanical properties for elevated temperature applications by employing machine learning (ML) in conjunction with rapid synthesis and testing of alloys for validation to accelerate alloy design. The advantages of this approach are scalability, rapidity, and reasonably accurate predictions. ML tools were implemented to predict Young’s modulus of refractory-based CCAs by employing different ML models. Our results, in conjunction with experimental validation, suggest that average valence electron concentration, the difference in atomic radius, a geometrical parameter λ and melting temperature of the alloys are the key features that determine the Young’s modulus of CCAs and refractory-based CCAs. The Gradient Boosting model provided the best predictive capabilities (mean absolute error of 6.15 GPa) among the models studied. Our approach integrates high-quality validation data from experiments, literature data for training machine-learning models, and feature selection based on physical insights. It opens a new avenue to optimize the desired materials property for different engineering applications.

36 MATERIALS SCIENCE↗
DOE OSTI2017

In silico evidence for sequence-dependent nucleosome sliding

Significance The dynamic compaction of DNA into chromatin is essential for gene expression. Errors during compaction are associated with numerous diseases. Several molecular factors are known to affect chromatin dynamics, but their relative importance and the interplay between them are poorly understood. A detailed molecular model is used here to examine chromatin dynamics at the level of its most fundamental building block, namely the nucleosome. Nucleosome dynamics are demonstrated to be encoded in the DNA sequence itself, and key fundamental factors are uncovered that can significantly alter these dynamics at the molecular level. The results serve to complete a hitherto unavailable description of nucleosome dynamics by introducing previously unappreciated molecular processes, with the potential to influence macroscopic chromatin structure and genetics.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2017

Spectral partitioning with blends of eigenvectors

We report many common methods for data analysis rely on linear algebra. We provide new results connecting data analysis error to numerical accuracy in the context of spectral graph partitioning. We provide pointwise convergence guarantees so that spectral blends (linear combinations of eigenvectors) can be employed to solve data analysis problems with confidence in their accuracy. We apply this theory to an accessible model problem, the ring of cliques, by deriving the relevant eigenpairs and finding necessary and sufficient solver tolerances. Analysis of the ring of cliques provides an upper bound on eigensolver tolerances for graph partitioning problems. These results bridge the gap between linear algebra based data analysis methods and the convergence theory of iterative approximation methods. These results explain how the combinatorial structure of a problem can be recovered much faster than numerically accurate solutions to the associated linear algebra problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A General Spatiotemporal Imputation Framework for Missing Sensor Data

Many applications from precision agriculture, environmental monitoring and transportation networks rely on data collected across space and time over a large geographic area. Missing data poses a significant challenge for any data-driven inference and control tasks. Data imputation or the estimation of missing data can help fill these gaps by utilizing inherent spatial relationships and temporal patterns. A variety of spatiotemporal imputation models have been developed to address missing data in spatiotemporal datasets. However, these classical methods rely on the assumption that the underlying data follows a smooth trend and fail to provide accurate estimates when there is a large number of missing points in the data. Even though there are machine learning driven tensor completion approaches such as convolutional neural network based tensor completion (CoSTCo) that capture the non-linear relationships in the dataset, the transductive nature makes the algorithm less scalable. Thus, existing approaches for estimating the missing information do not effectively capture all dimensions of the spatiotemporal data structure, resulting in erroneous predictions and poor performance. The main contributions of this paper are: (1) We propose a novel inductive framework (G-LSTM) for missing data imputation that integrates a graph neural network with LSTMs to effectively capture both spatial and temporal dependencies. (2) Experimental results on a traffic dataset demonstrate that the proposed GNN integrated with an LSTM framework achieves improved imputation and maintains steady performance even when there are extreme missing conditions in comparison with the state-of-the-art imputation framework (i.e, CoSTCo). (3) The simulation results on a traffic network show up to 69% reduction in mean absolute error and 61% reduction in root mean square error when compared to CoSTCo.

Tharzeen, Aabila↗
DOE OSTI2025

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗