Search NASA⌕ Search

SEARCH · Search NASA

Results for “error vector”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Real space iterative reconstruction for vector tomography (RESIRE-V)

Tomography has had an important impact on the physical, biological, and medical sciences. To date, most tomographic applications have been focused on 3D scalar reconstructions. However, in some crucial applications, vector tomography is required to reconstruct 3D vector fields such as the electric and magnetic fields. Over the years, several vector tomography methods have been developed. Here, we present the mathematical foundation and algorithmic implementation of REal Space Iterative REconstruction for Vector tomography, termed RESIRE-V. RESIRE-V uses multiple tilt series of projections and iterates between the projections and a 3D reconstruction. Each iteration consists of a forward step using the Radon transform and a backward step using its transpose, then updates the object via gradient descent. Incorporating with a 3D support constraint, the algorithm iteratively minimizes an error metric, defined as the difference between the measured and calculated projections. The algorithm can also be used to refine the tilt angles and further improve the 3D reconstruction. To validate RESIRE-V, we first apply it to a simulated data set of the 3D magnetization vector field, consisting of two orthogonal tilt series, each with a missing wedge. Our quantitative analysis shows that the three components of the reconstructed magnetization vector field agree well with the ground-truth counterparts. We then use RESIRE-V to reconstruct the 3D magnetization vector field of a ferromagnetic meta-lattice consisting of three tilt series. Our 3D vector reconstruction reveals the existence of topological magnetic defects with positive and negative charges. We expect that RESIRE-V can be incorporated into different imaging modalities as a general vector tomography method. To make the algorithm accessible to a broad user community, we have made our RESIRE-V MATLAB source codes and the data freely available at https://github.com/minhpham0309/RESIRE-V.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Machine learning approaches for integrating multi-omics data to expand microbiome annotation

Preliminary: This final report corresponds to a grant (DE-SC0021216) that was awarded to the University of Montana. Mid-way through the grant period, I relocated from the University of Montana to the University of Arizona. The grant was ended at University of Montana in late 2022, with all efforts concluding on 08/26/22; the remaining funds supporting the project were relinquished by University of Montana, and were later awarded to University of Arizona under a new grant, with start date 04/01/23. This report focuses on results of research efforts at UMontana through 08/26/22. Results: We made progress in each of the three aims of the proposal. We released software that identifies and fills gaps in the annotation of metabolic proteins within bacterial genomes. We made substantial progress in developing software for alignment-based annotation of protein coding DNA, allowing for coding frameshifts caused by sequencing error. Finally, we made notable progress in developing AI methods (specifically: a neural embedding model) for identifying similarities between protein sequences based on amino-wise latent vectors. These efforts were supplemented by development of methods for protein modeling in support of predicting protein-drug binding activity, and by my leadership of a team in the NIH/DOE 2021 Petabyte-Scale Sequence Search hack-a-thon.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Data-Driven Approaches for Bead Geometry Prediction Via Melt Pool Monitoring

In the realm of additive manufacturing, the selection of process parameters to avoid over and under deposition entails a time-consuming and resource-intensive trial-and-error approach. Given the distinct characteristics of each part geometry, there is a pressing need for advancing real-time process monitoring and control to ensure consistent and reliable part dimensional accuracy. Here, this research shows that support vector regression (SVR) and convolutional neural network (CNN) models offer a promising solution for real-time process control due to the models’ abilities to recognize complex, non-linear patterns with high accuracy. A novel experiment was designed to compare the performance of SVR and CNN models to indirectly detect bead height from a coaxial image of a melt pool from a single-layer, single bead build. The study showed that both SVR and CNN models trained on melt pool data collected from a coaxial optical camera can accurately predict the bead height with a mean absolute percentage error of 3.67% and 3.68%, respectively.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Fast QSTS for Distributed PV Impact Studies Using Vector Quantization and Variable Time-Steps

As the penetration level of PV systems increases, utilities are in great need of methods to quickly and effectively analyze PV's impact on electric distribution systems. Compared to other conventional methods, quasi-static time-series (QSTS) based analysis has demonstrated its advantages of accurately capturing the impact of interest, e.g. control device operations, and min and max voltages. However, yearlong QSTS simulation with 1-second granularity is currently too computationally expensive for regular use. Therefore, vector quantization (VQ) and variable time-step (VTS) solution methods have been developed to accelerate QSTS simulation. This paper proposes the combination of VQ with VTS. We investigate the effectiveness of implementing VQ in combination with 2 VTS algorithms, predetermined time-step (PT) and VTS with backtrack downsampling (VTS-BD) to demonstrate a runtime reduction of 99.55% with error metrics below acceptable thresholds.

14 SOLAR ENERGY↗
DOE OSTI2020

An Exploratory Approach Using Regression and Machine Learning in the Analysis of Mass Absorption Cross Section of Black Carbon Aerosols: Model Development and Evaluation

Mass absorption cross-section of black carbon (MAC BC ) describes the absorptive cross-section per unit mass of black carbon, and is, thus, an essential parameter to estimate the radiative forcing of black carbon. Many studies have sought to estimate MAC BC from a theoretical perspective, but these studies require the knowledge of a set of aerosol properties, which are difficult and/or labor-intensive to measure. We therefore investigate the ability of seven data analytical approaches (including different multivariate regressions, support vector machine, and neural networks) in predicting MAC BC for both ambient and biomass burning measurements. Our model utilizes multi-wavelength light absorption and scattering as well as the aerosol size distributions as input variables to predict MAC BC across different wavelengths. We assessed the applicability of the proposed approaches in estimating MAC BC using different statistical metrics (such as coefficient of determination (R 2 ), mean square error (MSE), fractional error, and fractional bias). Overall, the approaches used in this study can estimate MAC BC appropriately, but the prediction performance varies across approaches and atmospheric environments. Based on an uncertainty evaluation of our models and the empirical and theoretical approaches to predict MAC BC , we preliminarily put forth support vector machine (SVM) as a recommended data analytical technique for use. We provide an operational tool built with the approaches presented in this paper to facilitate this procedure for future users.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2019

Forecasting district-scale energy dynamics through integrating building network and long short-term memory learning algorithm

With the development of data-driven techniques, building energy prediction on a district level has attracted increasing attention in recent years for revealing energy use patterns and reduction potentials. However, data acquisition in large building groups is difficult and adjacent buildings also interact with each other. To reduce data cost and incorporate the inter-building impact with the data-driven building energy model, this study proposes a deep learning predictive approach that fuses the building network model with a long short-term memory learning model for district-scale building energy modeling. The building network was constructed based on correlations between the energy use intensity of buildings, which can significantly reduce the computational complexity of the deep learning models for energy dynamic prediction. Five typical building groups with energy use data from 2015 to 2018 on two institutional campuses were selected to perform the validation experiment with TensorFlow. Based on the prediction error assessments, the results suggest that for total building energy use intensity prediction, the proposed model can achieve a mean absolute percentage error of 6.66% and a root mean square error of 0.36 kWh/m 2 , compared to 12.05% and 0.63 kWh/m 2 of the conventional artificial neural network model and to 11.06% and 0.89 kWh/m 2 for the support vector regression model.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Lossy compression of statistical data using quantum annealer

Abstract We present a new lossy compression algorithm for statistical floating-point data through a representation learning with binary variables. The algorithm finds a set of basis vectors and their binary coefficients that precisely reconstruct the original data. The optimization for the basis vectors is performed classically, while binary coefficients are retrieved through both simulated and quantum annealing for comparison. A bias correction procedure is also presented to estimate and eliminate the error and bias introduced from the inexact reconstruction of the lossy compression for statistical data analyses. The compression algorithm is demonstrated on two different datasets of lattice quantum chromodynamics simulations. The results obtained using simulated annealing show 3–3.5 times better compression performance than the algorithm based on neural-network autoencoder. Calculations using quantum annealing also show promising results, but performance is limited by the integrated control error of the quantum processing unit, which yields large uncertainties in the biases and coupling parameters. Hardware comparison is further studied between the previous generation D-Wave 2000Q and the current D-Wave Advantage system. Our study shows that the Advantage system is more likely to obtain low-energy solutions for the problems than the 2000Q.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Secure Wireless Communication Using Distributed Coherent Transmission and Spatial Signal Decomposition

We present a new approach to secure wireless communications using coherent distributed transmission of signals that are spatially decomposed between a two-element distributed antenna array. High-accuracy distributed coordination of microwave wireless systems supports the ability to transmit different parts of a signal from separate transmitters such that they combine coherently at a designated destination. In this article, we explore this concept using a two-element coherent distributed phased array where each of the two transmitters sends a separate component of a communication signal, where each symbol is decomposed into a sum of two pseudorandom signal vectors, the coherent summation of which yields the intended symbol. By directing the transmission to an intended receiver using distributed beamforming, the summation of the two vector components is largely confined to a spatial region at the destination receiver. We implement the technique in a $50−λ$ array operating at 3 GHz. We evaluate the symbol error rate (SER) in 2-D space through simulation and measurement, showing that the approach yields a spatially confined secure region where the information is recoverable (i.e., the received signal has low SER), and outside of which the information is unrecoverable (high SER). The proposed system is also compared against a traditional beamforming system where each node sends the same data. We validate experimentally that our approach achieves a low SER of 0.0082 at broadside and an SER above 0.25 at all other locations compared to a traditional beamforming approach that achieves a SER of 0 at all locations measured.

Engineering - Electronic and electrical engineerin↗
DOE OSTI2024

Quantum Complexity of the Kronecker Coefficients

Whether or not the Kronecker coefficients of the symmetric group count some set of combinatorial objects is a longstanding open question. In this work we show that a given Kronecker coefficient is proportional to the rank of a projector that can be measured efficiently using a quantum computer. In other words a Kronecker coefficient counts the dimension of the vector space spanned by the accepting witnesses of a QMA verifier, where QMA is the quantum analogue of NP . This implies that approximating the Kronecker coefficients to within a given relative error is not harder than a certain natural class of problems that captures the complexity of estimating thermal properties of quantum many-body systems. A second consequence is that deciding positivity of Kronecker coefficients is contained in QMA , complementing a recent NP -hardness result of Ikenmeyer, Mulmuley, and Walter. We obtain similar results for the related problem of approximating row sums of the character table of the symmetric group. Finally, we discuss an efficient quantum algorithm that approximates normalized Kronecker coefficients to inverse-polynomial additive error. Published by the American Physical Society 2024

Physics↗
DOE OSTI2022

Challenge Problem 1: Preliminary Model Development and Assessment of Flexible Heat Transfer Modeling Approaches

This report presents the modeling progress of a university consortium studying flexible modeling for turbulent heat transfer. In the context of advanced nuclear reactor design, where challenges include non-unity Prandtl fluids, free and mixed convection, and transitional flow, computational fluid dynamics methods are underutilized due to low confidence in modeling approaches and high computational cost. This report evaluates the performance of engineering CFD models in diabatic, buoyant turbulent flow. It finds that all turbulence models including several variants of the k-ε and k-ω models struggle to predict accurate turbulent momentum and heat transfer in such flows. The Nusselt numbers have been compared between the models and the DNS data, where calculations have been performed for each case and trends have shown a good agreement between DNS estimated Nusselt numbers and available correlations as well as experimental data. A novel DNS correlation for high Pr cases as they are transitioning from mixed convection to natural convection has been proposed. While Nusselt number errors relative to DNS range from 20% to 50%, the models capture similar trends to DNS with respect to Nusselt suppression and amplification under varying levels of buoyancy effect. This report also highlights model form error as a significant contributor to CFD predictions and proposes a framework for quantifying model error and improving confidence in CFD calculations. To improve the predictive capability of engineering CFD models, data-driven approaches for turbulence models are investigated. Theoretical frameworks based on the invariant tensor / vector basis neural networks for prediction of Reynolds stresses and turbulent heat fluxes are employed. The models are developed using direct numerical simulations data for forced convection flows of different fluids in vertical planar channel domain. The framework is implemented in spectral element solvers Nek5000 / nekRS and has shown a potential for future development and consideration of mixed convection flows.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2026

Efficient Simulation of Logical Magic State Preparation Protocols

Developing space- and time-efficient logical magic state preparation (MSP) protocols will likely be an essential step toward building a large-scale fault-tolerant quantum computer. Motivated by this need, we introduce a scalable method for simulating logical MSP protocols under the standard circuit-level noise model. When applied to protocols based on code-switching, magic state cultivation, and magic state distillation, our method yields a complexity polynomial in (i) the number of qubits and (ii) the nonstabilizerness, e.g., stabilizer rank or Pauli rank, of the target encoded magic state. The efficiency of our simulation method is rooted in a curious fact: every circuit-level Pauli error in these protocols propagates to a Clifford error at the end. This property is satisfied by a large family of protocols, including those that repeatedly measure a transversal Clifford that squares to a Pauli. We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements. Our work enables practical simulation of logical MSP protocols without resorting to approximations or resource-intensive state-vector simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Occupancy prediction through machine learning and data fusion of environmental sensing and Wi-Fi sensing in buildings

Occupancy information is crucial to building facility design, operation, and energy efficiency. Many studies propose the use of environmental sensors (such as carbon dioxide, air temperature, and relative humidity sensors) and radio-frequency sensors (Wi-Fi networks) to monitor, assess, and predict occupancy information for buildings. As many methods have been developed and a variety of sensory data sources are available, establishing a proper selection of model and data source is critical to the successful implementation of occupancy prediction systems. This study compared three popular machine learning algorithms, including k-nearest neighbors (kNN), support vector machine (SVM), and artificial neural network (ANN), combined with three data sources, including environmental data, Wi-Fi data, and fused data, to optimize the occupancy models’ performance in various scenarios. Three error measurement metrics, the mean average error (MAE), mean average percentage error (MAPE), and root mean squared error (RMSE), have been employed to compare the models’ accuracies. Examined with an on-site experiment, the results suggest that the ANN-based model with fused data has the best performance, while the SVM model is more suitable with Wi-Fi data. The results also indicate that, comparing with independent data sources, the fused data set does not necessarily improve model accuracy but shows a better robustness for occupancy prediction.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2026

Representativity error scaling of models of the high temperature test facility

Error scaling is a critical step toward the validation of modeling capabilities for high-temperature gas-cooled reactors (HTGRs). Extensive effort is being made to bring HTGRs into the validation basis of numerous thermal-hydraulics codes. Here, this paper demonstrates how systems-level codes can be leveraged to perform error scaling analyses between an experimental facility and a plant-to-be facility. Specifically, we focus on two conduction cooldown experiments from the High Temperature Test Facility (HTTF) and the General Atomics 350 MW th modular high-temperature gas-cooled reactor (MHTGR-350). The error scaling methodology employed in this study is representativity, which in the context of this work was used to quantify how well experiments captured the physics of the plant facility by comparing sensitivity vectors between the two facilities. In addition, two different RELAP5–3D models of the HTTF were included in the comparison to determine if modeling methodologies notably impact the representativity results. The key figures of merit are the maximum block temperature and the coolant outlet temperature. The time-dependent maximum block temperature had a low representativity of below 0.1 for both models across both transients. The coolant outlet temperature had a higher representativity of around 0.6 for both models during the pressurized conduction cooldown, but it was below 0.2 for the depressurized conduction cooldown. Overall, the HTTF experiments were not representative of the transients in the MHTGR-350. However, these results can play a significant role in informing future potential experiments for HTGR systems that iterate on what the HTTF accomplished.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2020

Improved determination of the 𝛽−‾‾𝜈𝑒 angular correlation coefficient 𝑎 in free neutron decay with the 𝑎⁢SPECT spectrometer

We report on a precise measurement of the electron-antineutrino angular correlation (𝑎 coefficient) in free neutron beta decay from the 𝑎⁢SPECT experiment. The 𝑎 coefficient is inferred from the recoil energy spectrum of the protons which are detected in 4⁢𝜋 by the 𝑎⁢SPECT spectrometer using magnetic adiabatic collimation with an electrostatic filter. Data are presented from a 100-day run at the Institut Laue Langevin in 2013. The sources of systematic errors are considered and included in the final result. We obtain 𝑎=−0.10430⁢(84) which is the most precise measurement of the neutron 𝑎 coefficient to date. From this, the ratio of axial vector to vector coupling constants is derived giving |𝜆|=1.2677⁢(28).

Beck, Marcus↗
DOE OSTI2021

Rodeo Algorithm for Quantum Computing

We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $\ [E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by a suppression factor δ, the required computational effort scales as $\ O[|\log \delta|/(p \epsilon)]$, where p s the squared overlap of the initial state with the target eigenvector. The method, which we call the rodeo algorithm, uses auxiliary qubits to control the time evolution of the Hamiltonian minus some tunable parameter E . In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors, the method can also compute the full spectrum of the Hamiltonian. We illustrate the performance with several examples. For energy eigenvalue determination with error $\epsilon$, the computational scaling is $\ O[(\log \epsilon)^2/(p \epsilon)]$. For eigenstate preparation, the computational scaling is $\ O(\log \Delta/p)$, where $\Delta$ is the magnitude of the orthogonal component of the residual vector. The speed for eigenstate preparation is exponentially faster than that for phase estimation or adiabatic evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Designing Monte Carlo Simulation and an Optimal Machine Learning to Optimize and Model Space Missions

This paper investigates applying artificial intelligence (AI) algorithms to attitude control system of satellites to optimally tune the controller using high performance computing. This methodology is applied to the Virtual Telescope for X-ray Observation mission, which is a precise formation of two separate spacecraft observing multiple objects in the space in the X-ray domain. The mission is divided into phases based on the instrumentation and the mission goal. To reach an stable precise formation robust to stochastic slew and slew rate (i.e., Euler angles and angular velocities) in a minimal constrained time T , consumed energy of the attitude control system, denoted as E, and root-mean-square state error of attitude control system, denoted as e, are minimized. Monte-Carlo simulation is used for the sensitivity analysis of optimization and designing a controller. Deep neural networks (DNN), Gaussian processes (GP), and support vector regression (SVR) learn this optimization as a surrogate model, while their hyperparameters are optimized in a novel approach. THETA supercomputer at Argonne Leadership Computing Facility (ALCF) is used for optimizing the hyperparameters of DNN. The surrogate model meets the requirements of the mission, and it shows a better performance over the optimization and Monte-Carlo. The optimal DNN can satisfy the mission requirements e and T while reducing E for 90% compared to the other given methods.

42 ENGINEERING↗
DOE OSTI2025

Ground state energy and magnetization curve of a frustrated magnetic system from real-time evolution on a digital quantum processor

Models of interacting many-body quantum systems that may realize new exotic phases of matter, notably quantum spin liquids, are challenging to study using even state-of-the-art classical methods such as tensor network simulations. Quantum computing provides a promising route for overcoming these difficulties to find ground states, dynamics, and more. In this paper, we argue that recently developed hybrid quantum-classical algorithms based on real-time evolution are promising methods for solving a particularly important model in the search for spin liquids, the antiferromagnetic Heisenberg model on the two-dimensional kagome lattice. We show how to construct efficient quantum circuits to implement time evolution for the model and to evaluate key observables on the quantum computer, and we argue that the method has favorable scaling with increasing system size. We then restrict to a 12-spin star plaquette from the kagome lattice and a related 8-spin system, and we give an empirical demonstration on these small systems that the hybrid algorithms can efficiently find the ground state energy and the magnetization curve. For these demonstrations, we use four levels of approximation: exact state vectors, exact state vectors with statistical noise from sampling, noisy classical emulators, and (for the 8-spin system only) real quantum hardware, specifically the Quantinuum H1-1 processor; for the noisy simulations and hardware demonstration, we also employ error mitigation strategies based on the symmetries of the Hamiltonian. Our results strongly suggest that these hybrid algorithms present a promising direction for studying quantum spin liquids and more generally for resolving important unsolved problems in condensed matter theory and beyond.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Machine Learning-Based Identification of the Interface Regions for Coupling Local and Nonlocal Models

Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. However, the coupling process can be challenging, requiring expertise to identify the interface between local and nonlocal regions. Here, this study introduces a machine learning-based approach to automatically detect the regions in which the local and nonlocal models should be used. The method uses loading functions evaluated at grid points to decide the model selection at those points. Training of the networks is based on datasets provided by classes of loading functions for which reference coupling configurations are computed using accurate coupled solutions, where accuracy is measured in terms of the relative error between the solution to the coupling approach and the solution to the nonlocal model. We study two approaches that vary in data structure. The first, the full-domain input data approach, uses the entire load vector and outputs a complete label vector, performing a global classification. The second, a window-based approach, processes loads into windows and addresses the problem as a node-wise classification where each window's central point is classified individually. The classification problems are solved via deep learning algorithms based on convolutional neural networks. The performance of these approaches is studied on one-dimensional numerical examples using F1-scores and accuracy metrics. Notably, the windowing approach achieves an accuracy of 0.96 and an F1-score of 0.97, highlighting its potential to automate coupling processes effectively and enhance computational efficiency in material science applications.

97 MATHEMATICS AND COMPUTING↗