Search NASA⌕ Search

SEARCH · Search NASA

Results for “data distributions”

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

In situ multi-tier auto-ignition detection applied to dual-fuel combustion simulations

Here we use an anomaly detection methodology that is centered on analyzing fourth-order joint moments (co-kurtosis), particularly focusing on its application in auto-ignition of combustion problems with large numbers of species. Unsupervised anomaly detection is challenging to generalize across problem types and domains. A recent technique, centered on analyzing information in the fourth-order joint moment co-kurtosis, has shown promise, especially for high-dimensional scientific data. In this work we present developments to the co-kurtosis based anomaly detection method needed to make it effective and scalable for large-scale distributed scientific data, such as those generated by massively parallel simulations. An in situ co-kurtosis algorithm is employed as the anomaly detection method for identifying ignition kernels in simulations of turbulent combustion. Here, we extend an existing methodology which identifies regions of the domain where anomalies are present, and add another tier of anomaly detection where the individual samples contributing to the anomaly are identified. We apply this algorithm on-the-fly to a variety of turbulent reacting flow problems and compare it to the widely used (but significantly more expensive) chemical explosive mode analysis (CEMA). We demonstrate the ability of the method to detect and identify the onset of low and high temperature ignition which can be used for computational steering, as chemical and combustion anomalies occur intermittently at spatio-temporal locations unknown a priori. Finally, we apply our lightweight in situ algorithm to an exascale high-fidelity simulation with a total of 2.4 Trillion degrees of freedom, performed using an adaptive mesh refinement solver. Furthermore, through a scalability analysis, we show that the relative computational cost of this in-situ anomaly detection algorithm compared to an iteration of the reacting flow solver is negligible.

97 MATHEMATICS AND COMPUTING↗

Passive Neutron Instrumentation and Applications

This chapter presents a description of most of the instruments that are currently in use for the measurement of plutonium and uranium using passive methods (without an external source). This includes the acquisition electronics as well as Singles counting methods, coincidence counting methods and multiplicity counting methods. The Singles counting applications include the measurement of waste and curium bearing materials. The coincidence counting applications include bulk plutonium, bulk uranium, waste and holdup measurements and fresh fuel assemblies. The multiplicity application description includes advantages and disadvantages and multiplicity detector design. There is also a description of some non-3He systems. The chapter concludes with a description of additional concepts: neutron imagers, list-mode data analysis, distributed source term analysis, unattended monitoring and MCNP modeling for detector design.

Coincidence shift register↗

OpenSAMPL: An Open Source Library for Timing and Synchronization Measurements and Analytics

Today's power grid operators are implementing timing and synchronization solutions that provide resilience to Global Navigation Satellite System (GNSS) vulnerabilities. These vendor-specific solutions often come with additional software applications that are designed to monitor that vendor's synchronization performance data. However, resilient timing architectures often resulting in multi-vendor solutions, including approaches that blend terrestrial clocks with space-based subscription services. In such an environment, collecting, analyzing, and visualizing data from a variety of sources within a single platform was heretofore not possible. To address this need, the US Department of Energy's Center for Alternative Synchronization and Timing (CAST) developed OpenSAMPL, the Open Synchronized Analytics and Monitoring Platform, an open-source Python framework for processing, loading, and observing clock measurement data from distributed devices. OpenSAMPL enables the ingestion of diverse clock-probe sources into a scalable time-series database and applies robust analytics. OpenSAMPL currently supports two vendor data pipelines, and will be extended to more in the near future, enabling seamless monitoring of a variety of timing and synchronization devices in a common environment.

Grant, Josh [ORNL] (ORCID:0000000163475060)↗

Logarithmic Resilience Risk Metrics That Address the Huge Variations in Blackout Cost

Resilience risk metrics must address the customer cost of the largest blackouts of greatest impact. However, there are huge variations in blackout cost in observed distribution utility data that make it impractical to properly estimate the mean large blackout cost and the corresponding risk. These problems are caused by the heavy tail observed in the distribution of customer costs. To solve these problems, we propose resilience metrics that describe large blackout risk using the mean of the logarithm of the cost of large-cost blackouts, the slope index of the heavy tail, and the frequency of large-cost blackouts.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Measurement-Based Adaptive Voltage Regulation Method Considering Topology Changes

This paper proposes an online adaptive data-driven distributed energy resource (DER) dispatch optimization method for voltage control considering topology changes. By using a local sensitivity factor (LSF)-enabled voltage control, traditional DER control can be reformulated into a linear programming (LP) problem, leading to faster computation speeds. Power injection alteration and topology changes are two common operational changes in the distribution network that can affect the LSF and voltage control performance. To address this issue, a robust estimation method is developed to adjust the sensitivity matrix at each time step for the time-varying power injection changes. When topology changes occur, only the allocated predominant LSF submatrices are updated based on measurement data, allowing for a fast adaptation to the system reconfiguration. Results obtained from a real distribution feeder in Southern California demonstrate its robustness as compared to traditional volt-var control and constant LSF matrix dispatch control methods.

DERs↗

Investigating the ecological fallacy through sampling distributions constructed from finite populations

Correlation coefficients and linear regression values computed from group averages can differ from correlation coefficients and linear regression values computed using individual scores. This observation known as the ecological fallacy often assumes that all the individual scores are available from a population. In many situations, one must use a sample from the larger population. In such cases, the computed correlation coefficient and linear regression values will depend on the sample that is chosen and the underlying sampling distribution. The sampling distribution of correlation coefficients and linear regression values for group averages will be identical to the sampling distribution for individuals for normally distributed variables for random samples drawn from infinitely large continuous distributions. However, data that is acquired in practice is often acquired when sampling without replacement from a finite population. Our objective is to demonstrate through Monte Carlo simulations that the sampling distributions for correlation and linear regression will also be similar for individuals and group averages when sampling without replacement from normally distributed variables. These simulations suggest that when a random sample from a population is selected, the correlation coefficients and linear regression values computed from individual scores will not be more accurate in estimating the entire population values compared to samples when group averages are used as long as the sample size is the same.

97 MATHEMATICS AND COMPUTING↗

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

IM3 + EPRI Data Center Load Projections

This dataset contains scenarios of hourly total electricity demand with and without projected loads from data centers over the period 2022-2040. The root projections without data center demands are identical to those documented in Burleyson et al. 2024. In short, those projections encompass hourly electricity demands for 54 Balancing Authorities (BAs) in the United States across a range of eight of weather and socioeconomic scenarios. Refer to the root dataset and accompanying publication, Burleyson et al. 2025, for information about how those projections were generated. For this derivative dataset we used the base loads from the following scenarios: rcp45hotter_ssp3 rcp45hotter_ssp5 rcp85hotter_ssp3 rcp85hotter_ssp5 The root load projections did not reflect the drastic expansion of data centers that has occurred in the last several years to support artificial intelligence and cloud computing. To reflect growth in data center demand, a second set of load projections were created in which we layered in additional data center load projections based on the data center load growth scenarios described in a 2024 report by the Electric Power Research Institute (EPRI): "Powering Intelligence: Analyzing Artificial Intelligence and Data Center Energy Consumption". The EPRI projections from the report are included in this dataset (EPRI_2024_Projections.xlsx). That report contained annual state-level data center load projections for four year-over-year growth rates for data center demands: Low (3.71% annual growth) Moderate (5% annual growth) High (10% annual growth) Higher (15% annual growth) To homogenize the load projections with and without data centers we had to get them to a common scale. The first step was to take the EPRI annual state-level data center energy consumption values and convert them to 8760-hr loads for each year. We did that by assuming a flat (e.g., not weather- or time-sensitive) load profile and distributing the data center loads in each state evenly across all hours in a year. From there the loads were downscaled from the state-level to the county-level using 2019 county-level populations as weights. Finally, the county-level hourly data center loads were summed to the BA-level using the county-to-BA mapping underpinning the root load projections. The net result is 16 (4 weather and socioeconomic scenarios crossed with 4 data center load growth scenarios) unique load projections for the period 2022-2040. The file format follows that of the root dataset with a single additional column "Scaled_TELL_BA_Load_with_DC_MWh" that contains the hourly loads with the added data center loads for a given BA-year-scenario combination. Please refer to the readme file in the root dataset for more information on the file format.

Burleyson, Casey [Pacific Northwest National Labor↗

Transferable predictions of energetic and structural properties for refractory solid solution alloys across chemical compositions

We present a data-efficient approach to train graph neural networks (GNNs) on density functional theory (DFT) data for accurate and transferable predictions of energetic and structural properties of refractory solid solution alloys in the niobium-tantalum-vanadium (Nb-Ta-V) chemical space. We start by training the GNN model only on DFT data that describes refractory binary alloys niobium-tantalum (Nb-Ta), niobium-vanadium (Nb-V), and tantalum-vanadium (Ta-V) to predict formation enthalpy and root mean squared displacement. Once trained, the GNN predictions are tested on DFT data describing refractory ternary alloys Nb-Ta-V. While, unsurprisingly, direct transferability from binary to ternary is not sufficiently accurate, augmenting the training with only 1% of the available ternary data (uniformly distributed across the entire range of chemical compositions) improves significantly the quality of the GNN predictions. For comparison, we assess the transferability in the opposite direction by training GNN models on ternary Nb-Ta-V data and making predictions on binaries Nb-Ta, Nb-V, and Ta-V, which exhibits notably higher predictive errors. The proposed methodology, which favors transferability from lower-component to higher-component alloys, offers an efficient path towards avoiding the curse of dimensionality incurred when collecting DFT data for discovery and design of multi-component disordered alloys.

Density functional theory calculations↗

Tensor decompositions for count data that leverage stochastic and deterministic optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the maximum likelihood estimator (MLE) of the Poisson CPD model. Here, this work presents two new algorithms that extend state-of-the-art local methods for Poisson CPD. Hybrid GCP-CPAPR combines Generalized Canonical Decomposition (GCP) with stochastic optimization and CP Alternating Poisson Regression (CPAPR), a deterministic algorithm, to increase the probability of converging to the MLE over either method used alone. Restarted CPAPR with SVDrop uses a heuristic based on the singular values of the CPD model unfoldings to identify convergence toward optimizers that are not the MLE and restarts within the feasible domain of the optimization problem, thus reducing overall computational cost when using a multi-start strategy. We provide empirical evidence that indicates our approaches outperform existing methods with respect to converging to the Poisson CPD MLE.

CPAPR↗

Harnessing Machine Learning and Data Fusion for Accurate Undocumented Well Identification in Satellite Images

This study utilizes satellite data to detect undocumented oil and gas wells, which pose significant environmental concerns, including greenhouse gas emissions. Three key findings emerge from the study. Firstly, the problem of imbalanced data is addressed by recommending oversampling techniques like Rotation–GaussianBlur–Solarization data augmentation (RGS), the Synthetic Minority Over-Sampling Technique (SMOTE), or ADASYN (an extension of SMOTE) over undersampling techniques. The performance of borderline SMOTE is less effective than that of the rest of the oversampling techniques, as its performance relies heavily on the quality and distribution of data near the decision boundary. Secondly, incorporating pre-trained models trained on large-scale datasets enhances the models’ generalization ability, with models trained on one county’s dataset demonstrating high overall accuracy, recall, and F1 scores that can be extended to other areas. This transferability of models allows for wider application. Lastly, including persistent homology (PH) as an additional input improves performance for in-distribution testing but may affect the model’s generalization for out-of-distribution testing. A careful consideration of PH’s impact on overall performance and generalizability is recommended. Overall, this study provides a robust approach to identifying undocumented oil and gas wells, contributing to the acceleration of a net-zero economy and supporting environmental sustainability efforts.

SMOTE↗

Constraining the Stellar-to-Halo Mass Relation with Galaxy Clustering and Weak Lensing from DES Year 3 Data

We develop a framework to study the relation between the stellar mass of a galaxy and the total mass of its host dark matter halo using galaxy clustering and galaxy-galaxy lensing measurements. We model a wide range of scales, roughly from $\sim 100 \; {\rm kpc}$ to $\sim 100 \; {\rm Mpc}$, using a theoretical framework based on the Halo Occupation Distribution and data from Year 3 of the Dark Energy Survey (DES) dataset. The new advances of this work include: 1) the generation and validation of a new stellar mass-selected galaxy sample in the range of $\log M_\star/M_\odot \sim 9.6$ to $\sim 11.5$; 2) the joint-modeling framework of galaxy clustering and galaxy-galaxy lensing that is able to describe our stellar mass-selected sample deep into the 1-halo regime; and 3) stellar-to-halo mass relation (SHMR) constraints from this dataset. In general, our SHMR constraints agree well with existing literature with various weak lensing measurements. We constrain the free parameters in the SHMR functional form $\log M_\star (M_h) = \log(εM_1) + f\left[ \log\left( M_h / M_1 \right) \right] - f(0)$, with $f(x) \equiv -\log(10^{αx}+1) + δ[\log(1+\exp(x))]^γ/ [1+\exp(10^{-x})]$, to be $\log M_1 = 11.506^{+0.325}_{-0.404}$, $\log ε= -1.632^{+0.306}_{-0.181}$, $α= -1.638^{+0.108}_{-0.099}$, $γ= 0.596^{+0.251}_{-0.210}$ and $δ= 3.810^{+2.045}_{-1.811}$. The inferred average satellite fraction is within $\sim 5-35\%$ for our fiducial results and we do not see any clear trends with redshift or stellar mass. Furthermore, we find that the inferred average galaxy bias values follow the generally expected trends with stellar mass and redshift. Our study is the first SHMR in DES in this mass range, and we expect the stellar mass sample to be of general interest for other science cases.

Zacharegkas, G. [Argonne; Chicago U., KICP] (ORCID↗

Modeling the Effect of the Heliospheric Magnetic Field on Cosmic Ray Muon Shadows

Shadows cast in the cosmic ray (CR) muon sky by the Sun were located using muon data from the MINOS far detector in Northern Minnesota. The shadows were observed independently across three time periods; near solar minimum, near solar maximum, and over the entire 13 year span of the data. A distribution of muon positions for each shadow was then sampled to simulate CR motions near the Sun using the Parker spiral model of the Heliospheric Magnetic Field (HMF) and a dipole model of the Geomagnetic Field (GMF). The resulting particle distributions were then compared to their position with respect to the Sun. Results show that the Parker spiral model is most consistent with the solar minimum shadow and least consistent with the solar maximum shadow, as expected. The simple Parker spiral is more consistent with the data for a harder CR spectrum than is actually present, indicating the need for a more detailed HMF model. Plausible modifications to the Parker spiral model which would affect the overall shift of the Sun's CR shadow are discussed.

Adamson, P. [Fermilab]↗

Development of Real-Time High-Density Pulsar Data Transmission and Processing for Grid Synchronization

Taking advantage of the extreme stability of the pulsar period, it can serve as the timing source for grid synchronization to compensate for the timing drift instigated by the loss of GPS signal. Nevertheless, the real-time transmission and processing of the pulsar data suffer from its high-frequency data rate, varying from megahertz to gigahertz, resulting in reduced computing speed and increased time delay. To mitigate this issue, the hardware and software frameworks are implemented for the high-density pulsar data transmission and processing for grid synchronization in this research. Initially, the high-density pulsar data is transferred using open-source software. The complementary duty cycle timing module is designed to coordinate the operation of the dual-channel high-speed interface and software. Subsequently, the multiple-threading is applied to the receiving, parsing, and splicing pulsar data. Next, the pulsar signal extraction method is implemented based on the polyphase filterbank and time of arrival estimation. Ultimately, real-time performance verification experiments are carried out for different components under two hardware platforms. Finally, the results demonstrate that only 0.482 s is required for processing 4 Gigabyte data through multiple-threading, which is 3.8 times faster than the single thread. The pulsar signal extraction can also be executed within 707 ms for 4.8 seconds of data, thereby indicating that real-time requirements can be met.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Collaborative: in situ visual analytics technologies for extreme scale combustion simulations

This project aims to drastically enhance the usability of in situ analysis and visualization for extreme-scale scientific simulations. Current exascale computing capabilities promise to offer greater predictive ability of simulations and to further push the frontiers of science and technology. However, to validate the simulation output at extreme scale, examine the modeled phenomena, and discover previously unknowns from the output data, the output must be reduced or transformed in situ as it is being generated during the simulation such that the amount of data to examine and store is kept to a minimum. Such in situ approaches allow us to process and analyze the data and any embedded geometry to an extent that would be prohibitively expensive, if not impossible, to perform as a post hoc task. While in situ processing has been demonstrated to be a feasible and promising approach, its full potential has not yet been leveraged. In this project, we have developed comprehensive enhancements to in situ technology based on probability distributions in data. Our research focuses on jointly developing new ways of interacting with massive statistical samples while creatively utilizing new state-of-the-art computational resources to push the boundaries of in situ exploration. Moreover, we have developed new time-dependent techniques to enable previously unattainable capabilities in areas such as intelligent simulation steering and precise feature identification. We have experimentally studied our design and implementation at NERSC and OLCF, and are able to leverage existing in situ infrastructures whenever possible. While the exemplar in this project is combustion, many other fields for which turbulent transport is important, e.g., fusion, climate, astrophysics among others, encounter similar issues as simulations scale up to the exascale. This project shows its potential to generate high impact on DOE missions since the resulting technology promises to improve scientists’ ability to rapidly and correctly interpret and tune extreme-scale simulations, leading to new scientific understanding and advancements.

97 MATHEMATICS AND COMPUTING↗

BSDF Data generation for daylight applications: A call for international standardization

Standardized methods for generating angle-dependent, bidirectional, solar-optical properties for complex fenestration systems do not exist, which means that energy and daylight evaluations in building performance simulations often suffer from major inaccuracies. This position paper provides an overview of state-of-the-art data-driven methods for characterizing light scattering properties of fenestration materials and blind systems (e.g. fabrics, metal slats, patterned glazing), validation via laboratory, simulation and field tests, and salient issues in support of standardization of such methods via the International Standardization Organization (ISO). The ISO standard is intended to provide the fundamental underpinnings for recently mandated daylight standards that rely on bidirectional scattering distribution function data for climate-based daylight modelling and building performance simulations.

Geisler-Moroder, D.↗

Efficient First-Order Algorithms for Large-Scale, Non-Smooth Maximum Entropy Models with Application to Wildfire Science

Maximum entropy (MaxEnt) models are a class of statistical models that use the maximum entropy principle to estimate probability distributions from data. Due to the size of modern data sets, MaxEnt models need efficient optimization algorithms to scale well for big data applications. State-of-the-art algorithms for MaxEnt models, however, were not originally designed to handle big data sets; these algorithms either rely on technical devices that may yield unreliable numerical results, scale poorly, or require smoothness assumptions that many practical MaxEnt models lack. In this paper, we present novel optimization algorithms that overcome the shortcomings of state-of-the-art algorithms for training large-scale, non-smooth MaxEnt models. Our proposed first-order algorithms leverage the Kullback–Leibler divergence to train large-scale and non-smooth MaxEnt models efficiently. For MaxEnt models with discrete probability distribution of n elements built from samples, each containing m features, the stepsize parameter estimation and iterations in our algorithms scale on the order of O(mn) operations and can be trivially parallelized. Moreover, the strong ℓ1 convexity of the Kullback–Leibler divergence allows for larger stepsize parameters, thereby speeding up the convergence rate of our algorithms. To illustrate the efficiency of our novel algorithms, we consider the problem of estimating probabilities of fire occurrences as a function of ecological features in the Western US MTBS-Interagency wildfire data set. Our numerical results show that our algorithms outperform the state of the art by one order of magnitude and yield results that agree with physical models of wildfire occurrence and previous statistical analyses of wildfire drivers.

Physics↗

Voltage Calculations in Secondary Distribution Networks via Physics-Inspired Neural Network Using Smart Meter Data

The increasing penetration of distributed energy resources (DERs) leads to voltage issues across distribution networks, necessitating voltage calculations by utilities. Electric model-free voltage calculation offers an enticing solution. However, most researches mainly focus on primary distribution networks ignoring secondary distribution networks and commonly overlook extreme voltage case calculations, which require the model’s extrapolation abilities. Here, in addressing the gaps, this paper presents a customized physics-inspired neural network (PINN) model, the structure of which is inspired by the derived coupled power flow model of primary-secondary distribution networks. To ensure precision and rapid convergence, a crafted training framework for the PINN model is proposed. The PINN’s “structure-mimetic” design enables superior extrapolation for unseen scenarios and enhances physical information awareness. We demonstrate this through two applications: hosting capacity analysis and customer-transformer connectivity. The effectiveness and advantages of the proposed PINN model are validated on two public testing systems and one utility distribution feeder model.

Distribution network↗