Search NASA⌕ Search

SEARCH · Search NASA

Results for “higher accuracy”

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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

A Morphological Model to Separate Resolved–Unresolved Sources in the DESI Legacy Surveys: Application in the LS4 Alert Stream

Separating resolved and unresolved sources in large imaging surveys is a fundamental step to enable downstream science, such as searching for extragalactic transients in wide-field time-domain surveys. Here we present our method to effectively separate point sources from the resolved, extended sources in the Dark Energy Spectroscopic Instrument (DESI) Legacy Surveys (LS). We develop a supervised machine learning model based on the Gradient Boosting algorithm XGBoost. The features input to the model are purely morphological and are derived from the tabulated LS data products. We train the model using ∼2 × 10 5 LS sources in the COSMOS field with HST morphological labels and evaluate the model performance on LS sources with spectroscopic classification from the DESI Data Release 1 (∼2 × 10 7 objects) and the Sloan Digital Sky Survey Data Release 17 (∼3 × 10 6 objects), as well as on ∼2 × 10 8 Gaia stars. A significant fraction of LS sources are not observed in every LS filter, and we therefore build a “Hybrid” model as a linear combination of two XGBoost models, each containing features combining aperture flux measurements from the “blue” (gr) and “red” (iz) filters. The Hybrid model shows a reasonable balance between sensitivity and robustness, and achieves higher accuracy and flexibility compared to the LS morphological typing. With the Hybrid model, we provide classification scores for ∼3 × 10 9 LS sources, making this the largest ever machine learning catalog separating resolved and unresolved sources. The catalog has been incorporated into the real-time pipeline of the La Silla Schmidt Southern Survey (LS4), enabling the identification of extragalactic transients within the LS4 alert stream.

astrostatistics↗
DOE OSTI2024

Correlation of the L-mode density limit with edge collisionality

The "density limit'' is one of the fundamental bounds on tokamak operating space, and is commonly estimated via the empirical Greenwald scaling. This limit has garnered renewed interest in recent years as it has become clear that ITER and many tokamak pilot plant concepts must operate near or above the widely-used Greenwald limit to achieve their objectives. Evidence has also grown that the Greenwald scaling - in its remarkable simplicity - may not capture the full complexity of the disruptive density limit. In this study, we assemble a multi-machine database to quantify the effectiveness of the Greenwald limit as a predictor of the L-mode density limit and identify alternative stability metrics. We find that a two-parameter dimensionless boundary in the plasma edge, $\nu_{*\rm, edge}^{\rm limit} = 3.0 \beta_{T,{\rm edge}}^{-0.4}$, achieves significantly higher accuracy (true negative rate of 97.7\% at a true positive rate of 95\%) than the Greenwald limit (true negative rate 86.1\% at a true positive rate of 95\%) across a multi-machine dataset including metal- and carbon-wall tokamaks (AUG, C-Mod, DIII-D, and TCV). The collisionality boundary presented here can be applied for density limit avoidance in current devices and in ITER, where it can be measured and responded to in real time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Deep unsupervised learning using spike-timing-dependent plasticity

Abstract Spike-timing-dependent plasticity (STDP) is an unsupervised learning mechanism for spiking neural networks that has received significant attention from the neuromorphic hardware community. However, scaling such local learning techniques to deeper networks and large-scale tasks has remained elusive. In this work, we investigate a Deep-STDP framework where a rate-based convolutional network, that can be deployed in a neuromorphic setting, is trained in tandem with pseudo-labels generated by the STDP clustering process on the network outputs. We achieve 24.56% higher accuracy and 3.5 × faster convergence speed at iso-accuracy on a 10-class subset of the Tiny ImageNet dataset in contrast to a k -means clustering approach.

Lu, Sen↗
DOE OSTI2022

Photometric redshift estimation of galaxies in the DESI Legacy Imaging Surveys

ABSTRACT The accurate estimation of photometric redshifts plays a crucial role in accomplishing science objectives of the large survey projects. Template-fitting and machine learning are the two main types of methods applied currently. Based on the training set obtained by cross-correlating the DESI Legacy Imaging Surveys DR9 galaxy catalogue and the SDSS DR16 galaxy catalogue, the two kinds of methods are used and optimized, such as eazy for template-fitting approach and catboost for machine learning. Then, the created models are tested by the cross-matched samples of the DESI Legacy Imaging Surveys DR9 galaxy catalogue with LAMOST DR7, GAMA DR3, and WiggleZ galaxy catalogues. Moreover, three machine learning methods (catboost, Multi-Layer Perceptron, and Random Forest) are compared; catboost shows its superiority for our case. By feature selection and optimization of model parameters, catboost can obtain higher accuracy with optical and infrared photometric information, the best performance ($\rm MSE=0.0032$, σNMAD = 0.0156, and $O=0.88{{\ \rm per\ cent}}$) with g ≤ 24.0, r ≤ 23.4, and z ≤ 22.5 is achieved. But eazy can provide more accurate photometric redshift estimation for high redshift galaxies, especially beyond the redshift range of training sample. Finally, we finish the redshift estimation of all DESI Legacy Imaging Surveys DR9 galaxies with catboost and eazy, which will contribute to the further study of galaxies and their properties.

Astronomy & Astrophysics↗
DOE OSTI2023

MultiCAM: a multivariable framework for connecting the mass accretion history of haloes with their properties

ABSTRACT Models that connect galaxy and halo properties often summarize a halo’s mass accretion history (MAH) with a single value and use this value as the basis for predictions. However, a single-value summary fails to capture the complexity of MAHs and information can be lost in the process. We present MultiCAM, a generalization of traditional abundance matching frameworks, which can simultaneously connect the full MAH of a halo with multiple halo and/or galaxy properties. As a first case study, we apply MultiCAM to the problem of connecting dark matter halo properties to their MAHs in the context of a dark matter-only simulation. While some halo properties, such as concentration, are more strongly correlated to the early-time mass growth of a halo, others, like the virial ratio, have stronger correlations with late-time mass growth. This highlights the necessity of considering the impact of the entire MAH on halo properties. For most of the halo properties we consider, we find that MultiCAM models that use the full MAH achieve higher accuracy than conditional abundance matching models that use a single epoch. We also demonstrate an extension of MultiCAM that captures the covariance between predicted halo properties. This extension provides a baseline model for applications where the covariance between predicted properties is important.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2025

Ancilla-entangling Floquet kicks for accelerating quantum algorithms

Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and thus places an annealing rate bottleneck for high success probability. Here, in this study, we accelerate quantum simulation using digital multiqubit gates that entangle primary system qubits with ancillary qubits. The practical benefits originate from tuning the ancillary gauge degrees of freedom to enhance the quantum algorithm's original functionality in the system registry. For simple but nontrivial short-ranged, infinite long-ranged transverse-field Ising models, and the hydrogen molecule model after qubit encoding, we show improvement in the time to solution by one hundred percent but with higher accuracy through exact state-vector numerical simulation in a digital-analog setting. The findings are further supported by time-averaged Hamiltonian theory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Autoregressive Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation

The theory of open quantum systems lays the foundation for a substantial part of modern research in quantum science and engineering. Rooted in the dimensionality of their extended Hilbert spaces, the high computational complexity of simulating open quantum systems calls for the development of strategies to approximate their dynamics. In this Letter, we present an approach for tackling open quantum system dynamics. Using an exact probabilistic formulation of quantum physics based on positive operator-valued measure, we compactly represent quantum states with autoregressive neural networks; such networks bring significant algorithmic flexibility due to efficient exact sampling and tractable density. We further introduce the concept of string states to partially restore the symmetry of the autoregressive neural network and improve the description of local correlations. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator using a forward-backward trapezoid method and find the steady state via a variational formulation. Our approach is benchmarked on prototypical one-dimensional and two-dimensional systems, finding results which closely track the exact solution and achieve higher accuracy than alternative approaches based on using Markov chain Monte Carlo method to sample restricted Boltzmann machines. Our Letter provides general methods for understanding quantum dynamics in various contexts, as well as techniques for solving high-dimensional probabilistic differential equations in classical setups.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Driver Distraction Behavior Detection using a Vision Transformer Model based on Transfer Learning Strategy

Driver distraction behavior is one of the critical factors in traffic accidents. Thus, advanced driver state detection system has become the focus in the field of intelligent vehicle. However, in practical applications, insufficient samples of driving distraction behaviors bring great challenges to training a personalized behavior distraction detection model for a specific driver. To this end, a novel transformer model based on a transfer learning strategy is proposed in this paper to accurately recognize driver distraction behavior. Inspired by the effect of the transformer network in visual recognition, we firstly present a transformer behavior distraction detection system to identify the behavior categories that cause driver distraction. Then, for the specific driving dataset in practical application scenarios, the transfer learning strategy is introduced into the driver distraction detection model to further train the general transformer network. The effectiveness of the transformer based on the transfer learning strategy is validated compared with other traditional deep learning methods. The results show that the proposed detection method has better generalization ability and higher accuracy.

Fang, Zhenwu↗
DOE OSTI2024

Hybrid Approaches for Data Reduction of Spatiotemporal Scientific Applications

Scientists conduct large-scale simulations to compute derived quantities from primary data. Thus, it is crucial that data compression techniques maintain bounded errors on these derived quantities or quantities of interest (QOI). For many spatiotemporal applications, these QOIs are binary in nature and represent presence or absence of a physical phenomenon. In this work, we propose to use a hybrid approah for differential compression for such applications. We use a neural network (NN) approach to determine regions-of-interest (ROIs) where the binary QOIs are going to be prevalent. This is then used with traditional approaches that compress at a lower level (and higher accuracy) for these ROIs as compared to other regions.

Li, Xiao↗
DOE OSTI2021

PMU-data-driven Event Classification in Power Transmission Grids

This paper presents an event classification in transmission grids. The convolutional neural network (CNN)-based classifier is proposed to capture the temporal similarity of time-synchronized data stream from phasor measurement units (PMUs). The proposed CNN is trained using Bayesian optimization to search for the best hyperparameters. The effectiveness of the proposed event classification is validated through the real-world dataset from the U.S. transmission grids. This dataset includes line outage, transformer outage, frequency, and oscillation events. The validation process also includes different PMU outputs, such as voltage magnitude, phase angle, current magnitude, frequency, and rate of change of frequency (ROCOF). The results show that ROCOF gives the best classification performance compared to other PMU outputs. In addition, it is shown that the classifier trained with a larger dataset has higher accuracy. Moreover, the superiority of the proposed method is validated through comparison with other state-of-the-art classification methods.

Niazazari, Iman↗
DOE OSTI2020

Probabilistic Power Consumption Modeling for Commercial Buildings Using Logistic Regression Markov Chain

The total energy consumed by buildings takes up to 40% of U.S. energy use, in which a large portion is contributed by commercial buildings. Building performance optimization is desirable but requires accurate building models with uncertainties taken into account. This paper proposes a novel probabilistic modeling method using Logistic Regression Markov Chain (LRMC). The LRMC model enhances the performance of traditional Markov Chain (MC) models by adopting time-variant transition matrices calibrated using logistic regression with exogenous inputs. Compared with existing building models, the proposed model produces accurate multi-step modeling results with full probability distribution. The proposed probabilistic building model is tested using actual commercial building measurements and modeling performance is evaluated with two probabilisitc metrics. The results show that the LRMC model has higher accuracy than traditional MC model and Logistic Regression (LR) model in that it yields lower error scores under both evaluation metrics.

Building modeling↗
DOE OSTI2020

Model-Free Data Authentication for Cyber Security in Power Systems

With the development and wide deployment of measurement equipment, data can be automatically measured and visualized for situation awareness in power systems. However, the cyber security of power systems is also threated by data spoofing attacks. This letter proposed a measurement data source authentication (MDSA) algorithm based on feature extraction techniques including ensemble empirical mode decomposition (EEMD) and fast Fourier transform (FFT), and machine learning for real-time measurement data classification. Compared with previous work, the proposed algorithm can achieve higher accuracy of MDSA using a shorter window of data from closely located synchrophasor measurement sensors.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

A Data-driven Approach for Predicting Nepheline Crystallization in High-Level Waste Glasses

High-level waste (HLW) glasses with high aluminum content are prone to nepheline crystallization during the slow canister cooling that is experienced during large-scale production. Due to its detrimental effects on glass durability, nepheline precipitation must be avoided; however, developing robust, predictive models for nepheline crystallization behavior in HLW glasses is difficult due to their compositional complexity. Using overly conservative constraints to predict nepheline formation can limit the waste loading to lower than the achievable capacity. In this study, a robust data-driven model using five compositional features has been developed to predict nepheline formation. The analysis of the model and the data show that there is an overlap, instead of a distinct compositional boundary, between glasses that form and do not form nepheline. As a result, the model’s predictive accuracy is not the same throughout the feature space and instead is dependent on the location of the glass composition in the dimensionally reduced feature space.

Sargin, Irmak↗
DOE OSTI2024

S-OPT: A Points Selection Algorithm for Hyper-Reduction in Reduced Order Models

While projection-based reduced order models can reduce the dimension of full order solutions, the resulting reduced models may still contain terms that scale with the full order dimension. Hyper-reduction techniques are sampling-based methods that further reduce this computational complexity by approximating such terms with a much smaller dimension. The goal of this work is to introduce the points selection algorithm developed by Shin and Xiu as a hyper-reduction method. The selection algorithm was originally proposed as a stochastic collocation method for uncertainty quantification. Since the algorithm aims at maximizing a quantity $\mathcal{S}$ that measures both the column orthogonality and the determinant, we refer to the algorithm as S-OPT. Numerical examples are provided to demonstrate the performance of S-OPT and to compare its performance with a gappy proper orthogonal decomposition (POD) algorithm. Here, we found that using the S-OPT algorithm is shown to predict the full order solutions with higher accuracy than gappy POD especially when the number of sampling points is small, although we note that S-OPT shows slow asymptotic convergence with respect to the number of samples for some applications, e.g., Lagrangian hydrodynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Symmetry reduction of tensor networks in many-body theory: I. Automated symbolic evaluation of SU(2) algebra

Abstract The ongoing progress in (nuclear) many-body theory is accompanied by an ever-rising increase in complexity of the underlying formalisms used to solve the stationary Schrödinger equation. The associated working equations at play in state-of-the-art ab initio nuclear many-body methods can be analytically reduced with respect to angular-momentum, i.e. SU (2), quantum numbers whenever they are effectively employed in a symmetry-restricted context. The corresponding procedure constitutes a tedious and error-prone but yet an integral part of the implementation of those many-body frameworks. Indeed, this symmetry reduction is a key step to advance modern simulations to higher accuracy since the use of symmetry-adapted tensors can decrease the computational complexity by orders of magnitude. While attempts have been made in the past to automate the (anti-) commutation rules linked to Fermionic and Bosonic algebras at play in the derivation of the working equations, there is no systematic account to achieve the same goal for their symmetry reduction. In this work, the first version of an automated tool performing graph-theory-based angular-momentum reduction is presented. Taking the symmetry-unrestricted expressions of a generic tensor network as an input, the code provides their angular-momentum-reduced form in an error-safe way in a matter of seconds. Several state-of-the-art many-body methods serve as examples to demonstrate the generality of the approach and to highlight the potential impact on the many-body community.

Tichai, A.↗
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 OSTI2025

Advancing Quantum Many-Body GW Calculations on Exascale Supercomputing Platforms

Advanced ab initio materials simulations face growing challenges as increasing systems and phenomena complexity requires higher accuracy, driving up computational demands. Quantum many-body GW methods are state-of-the-art for treating electronic excited states and couplings but often hindered due to the costly numerical complexity. Here, we present innovative implementations of advanced GW methods within the BerkeleyGW package, enabling large-scale simulations on Frontier and Aurora exascale platforms. Our approach demonstrates exceptional versatility for complex heterogeneous systems with up to 17,574 atoms, along with achieving true performance portability across GPU architectures. We demonstrate excellent strong and weak scaling to thousands of nodes, reaching double-precision core-kernel performance of 1.069 ExaFLOP/s on Frontier (9,408 nodes) and 707.52 PetaFLOP/s on Aurora (9,600 nodes), corresponding to 59.45% and 48.79% of peak, respectively. Our work demonstrates a breakthrough in utilizing exascale computing for quantum materials simulations, delivering unprecedented predictive capabilities for rational designs of future quantum technologies.

Zhang, Benran [University of Southern California, ↗
DOE OSTI2021

Critical Parameter Identification of Fuel-Cell Models Using Sensitivity Analysis

Numerical modeling has been a vital tool in proton-exchange-membrane fuel-cell (PEMFC) analysis; however, the predictive capabilities of these models depend on the input physical parameters, several of which are either not experimentally measured or have large scatter in measured values. This article presents an uncertainty propagation-based sensitivity analysis to identify the model parameters that impact the model predictions most. A comprehensive 2-D membrane electrode assembly (MEA) model is used to perform local sensitivity analysis at multiple operating conditions, which encompass the range of environments and operating conditions a cell can encounter. While at lower humidities, cathode kinetics and membrane-ohmic-loss related parameters are crucial, gas transport and porous-media saturation behavior are more important at humidified conditions. Several of these findings are different from previous studies presented in literature. Identifying the crucial parameters helps focus future material and cell optimization studies as well as experimental studies to quantify these parameters with higher accuracy.

25 ENERGY STORAGE↗