SEARCH · Engineering Papers

Results for “hierarchical data”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗

DOE OSTI2021

Machine Learning Assisted Safety Modeling and Analysis of Advanced Reactors

With the advances in computational power and numerical methods, analysts can now rely on first-principle simulations to predict ultra-fine details in a variety of applications. Advances in machine learning (ML) have produced algorithms that can now learn high-level abstractions via hierarchical models. This project aims to leverage advances in ML techniques and the available high-resolution simulation data to develop a novel modeling and simulation (M\&S) methodology for reactor safety analysis. While application-agnostic ML techniques are available, complex physics constraints need to be incorporated into ML techniques to build ML-based closures for computationally efficient predictive simulations. This project intends to develop a physics-guided data-driven multi-scale methodology for M\&S of advanced reactors. The project focuses on thermal fluid (T/F) phenomena, which play major roles in advanced reactor safety. Specifically, we propose a data-driven coarse-mesh turbulence model based on local flow features for the transient analysis of thermal mixing and stratification in a sodium-cooled fast reactor (SFR). The model has a coarse-mesh setup to ensure computational efficiency, while it is trained by fine-mesh computational fluid dynamics (CFD) data with Reynolds-averaged Navier-Stokes (RANS) turbulence model to ensure accuracy. Three different neural networks are developed and tested for loss-of-flow transients in the hot pool of SFR, i.e. the densely connected convolutional neural network (DCNN), long-short-term-memory network based on proper orthogonal decomposition (POD-LSTM), and the DCNN informed by LSTM (DCNN-LSTM). The performances of these three neural networks are evaluated based on baseline models. The DCNN-LSTM model has been chosen for further hyperparameter optimization. Furthermore, based on a simplified two-dimensional case, uncertainty quantification (UQ) of the developed ML-based closure are investigated with three methods, i.e. Monte Carlo dropout, deep ensemble, and Bayesian neural network. The developed ML-based turbulent viscosity closure relation based on deep ensemble is then integrated into the system analysis module SAM and serves as a term in the conservation equations. Such a SAM-ML based procedure guarantees that the obtained results are consistent with the physical constraints of the thermal-fluid system. The SAM-ML simulation on the same loss-of-flow transient showed comparable accuracy with the CFD simulation but with a much coarser mesh setup. Last but not least, the ML-based closure improvement with the support of higher-fidelity data from large eddy simulation (LES) is discussed. As a first step towards this direction, a baseline LES simulation is performed to obtain comparable data with RANS results. Based on the early results, future investigation on further improving the ML-based closure is discussed. We believe the developed approach that combines scientific machine learning with nuclear system analysis code can benefit the advanced reactor community as more accurate safety analyses will better characterize reactor safety margins and reduce licensing efforts.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2020

Hierarchical Phenomena in Multicomponent Liquids: Simulation Methods, Analysis, Chemistry

Complex, multicomponent, solutions have often been studied solely through the lens of specific applications of interest. Yet advances to both simulation methodologies (enhanced sampling, etc.) and analysis techniques (network analysis algorithms and others), are creating a trove of data that reveal transcending characteristics across vast compositional phase space. This perspective discusses technical considerations of the reliable and accurate simulations of complex solutions, followed by the advances to analysis algorithms that elucidate coupling of different length and timescale behavior (hierarchical phenomena). The different manifestations of hierarchical phenomena are presented across an array of solution environments, emphasizing fundamental and ongoing science questions. With a more advanced molecular understanding in hand, a quintessential application (solvent extraction) is discussed, where significant opportunities exist to re-imagine the technical scope of an established technology.

Servis, Michael J.↗

DOE OSTI2022

A Hierarchical Local Electricity Market for a DER-rich Grid Edge

We report with increasing penetration of distributed energy resources (DER) in the distribution system, it is critical to design market structures that enable smooth integration of DERs. A hierarchical local electricity market (LEM) structure is proposed in this paper with a secondary market (SM) at the lower level representing secondary feeders and a primary market (PM) at the upper level, representing primary feeders, in order to effectively use DERs to increase grid efficiency and resilience. The lower level SM enforces budget, power balance, and flexibility constraints and accounts for costs related to consumers, such as their disutility, flexibility limits, and commitment reliability, while the upper level PM enforces grid physics constraints such as power balance and capacity limits, and also minimizes line losses. The hierarchical LEM is extensively evaluated using a modified IEEE-123 bus with high DER penetration, with each primary feeder consisting of at least three secondary feeders. Data from a GridLAB-D model is used to emulate realistic power injections and load profiles over the course of 24 hours. The performance of the LEM is illustrated by delineating the family of power-injection profiles across the primary and secondary feeders as well as corresponding local electricity tariffs that vary across the distribution grid. Through numerical simulations, the hierarchical LEM is shown to improve the efficiency of the market in terms of lowering overall costs, including both the distribution-level locational marginal prices (d-LMP) as well as retail tariffs paid by customers. Together, it represents an overall framework for a Distribution System Operator (DSO) who can provide the oversight for the entire LEM.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

Chemist: A Domain-Specific Language by Chemists for Chemists

Managing the complexity of quantum chemistry (QC) software is key to ensuring it remains accessible, maintainable, and reusable. Noticeably missing from the QC ecosystem are modules targeting bottleneck routines. Here we argue that this is likely due to the difficulty in defining interfaces for such modules. To that end, we introduce the open-source, publicly available Chemist library https://github.com/NWChemEx/Chemist. Chemist is a domain-specific language targeting the QC domain. Chemist has been developed focusing on performance and user-friendliness. Using Chemist, QC tasks are defined using familiar domain concepts such as molecules, wave functions, and operators. The domain objects are hierarchical to ensure a systematic encapsulation of information. Key features of Chemist include: extensibility, the ability to alias existing data, and the ability to succinctly define many common QC tasks. The usefulness of Chemist is demonstrated by discussing the interface of NWChemEx’s Fock build module and by showcasing a proof-of-concept self-consistent field algorithm containing uncertainty propagation.

Algorithms↗

DOE OSTI2025

Chemist

Chemist is a domain-specific language targeting the QC domain. Chemist has been developed focusing on performance and user-friendliness. Using Chemist, QC tasks are defined using familiar domain concepts such as molecules, wave functions, and operators. The domain objects are hierarchical to ensure a systematic encapsulation of information. Key features of Chemist include: extensibility, the ability to alias existing data, and the ability to succinctly define many common QC tasks.

Richard, Ryan [Ames Laboratory (AMES), Ames, IA (U↗

DOE OSTI2023

Hierarchical reconstruction of 3D well-connected porous media from 2D exemplars using statistics-informed neural network

The relationships between porous microstructures and transport properties are of fundamental importance in various scientific and engineering applications. Due to the intricacy, stochasticity and heterogeneity of porous media, reliable characterization and modeling of transport properties often require a complete dataset of internal microstructure samples. However, it is often an unbearable cost to acquire sufficient 3D digital microstructures by purely using microscopic imaging systems. Herein this paper presents a machine learning-based technique to hierarchically reconstruct 3D well-connected porous microstructures from one isotropic or several anisotropic low-cost 2D exemplar(s). To compactly characterize the large-scale microstructural features, a Gaussian image pyramid is built for each 2D exemplar. Local morphology patterns are collected from the Gaussian image pyramids, and then they serve as the training data to embed the 2D morphological statistics into feed-forward neural networks at multiple length levels. By using a specially-developed morphology integration scheme, the 3D morphological statistics at different levels can be inferred from the statistics-informed neural networks. Gibbs sampling is adopted to hierarchically reconstruct 3D microstructures by using multi-level 3D morphological statistics, where the large-scale, regional and local morphological patterns are statistically generated and successively added to the same 3D random field. The proposed method is tested on a series of porous media with distinct morphologies, and the statistical equivalence between the reconstructed and the real microstructures is systematically evaluated by comparing morphological descriptors and transport properties. The results demonstrate that the proposed 2D-to-3D microstructure reconstruction method is a universal and efficient approach to generating morphologically and physically realistic samples of porous media.

42 ENGINEERING↗

DOE OSTI2021

Resource selection functions based on hierarchical generalized additive models provide new insights into individual animal variation and species distributions

Habitat selection studies are designed to generate predictions of species distributions or inference regarding general habitat associations and individual variation in habitat use. Such studies frequently involve either individually indexed locations gathered across limited spatial extents and analyzed using resource selection functions (RSFs) or spatially extensive locational data without individual resolution typically analyzed using species distribution models. Both analytical methodologies have certain desirable features, but analyses that combine individual- and population-level inference with flexible non-linear functions may provide improved predictions while accounting for individual variation. Here, we describe how RSFs can be fit using hierarchical generalized additive models (HGAMs) using widely available software, providing a means to explore individual variation in habitat associations and to generate species distribution maps. We used GPS tracking data from golden eagles Aquila chrysaetos from across eastern North America with four environmental predictors to generate monthly distribution models. We considered three model structures that assumed different amounts of individual variation in the functional relationship between predictors and habitat use and used k-fold cross-validation to compare model performance. Models accounting for individual variability in shape and smoothness of functional responses performed best. Eagles exhibited the least amount of individual variation in response to land cover variables during winter months, with most individuals more closely adhering to the population-level trend. During the summer months, eagles exhibited more substantial individual variation in shape and smoothness of the functional relationships, suggesting some need to account for individual variation in eagle habitat use for both inferential and predictive purposes, during this time of year. Because they allow users to blend flexible functions with random effects structures and are well-supported by a variety of software platforms, we believe that HGAMs provide a useful addition to the suite of analyses used for modeling habitat associations or predicting species distributions.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2024

Remote Sensing and GIS data at 1km-grid over Chesapeake Bay used in “He et al. 2024, Effects of spatial variability in vegetation phenology, climate, landcover, biodiversity, topography, and soil property on soil respiration across a coastal ecosystem”

The package contains the data layers used in “He et al. 2024, Effects of spatial variability in vegetation phenology, climate, landcover, biodiversity, topography, and soil property on soil respiration across a coastal ecosystem”. The study aims to use multi-source remote sensing and GIS datasets to investigate the spatial heterogeneity and identify spatial zones with similar environmental characteristics and understand the primary driving factors affecting soil respiration within sub-ecosystems of the coastal ecosystem. We employed unsupervised hierarchical clustering analysis to identify spatial regions with distinct environmental characteristics, then determined the main driving factors using Random Forest regression and SHapley Additive exPlanations (SHAP). Spatial data layers include soil respiration, kernel Normalized Difference Vegetation Index (kNDVI) computed from Harmonized Landsat 8 and Sentinel-2 time series, climate variables from the Daymet dataset, land cover, biodiversity, topographical metrics, soil property, and tidal elevation.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

VWC-BERT: Scaling Vulnerability–Weakness–Exploit Mapping on Modern AI Accelerators

Defending cybersystems needs accurate mapping of software and hardware vulnerabilities to generalized descriptions of weaknesses, and weaknesses to exploits. These mappings enable cyber defenders to build plans for effective defense and assessment of potential risks to a cybersystem. With close to 170k vulnerabilities, manual mapping is not a feasible option. However, automated mapping is challenging due to limited training data, computational intractability, and limitations in computational natural language processing. Tools based on breakthroughs in Transformer-based language models have been demonstrated to classify vulnerabilities with high accuracy. We make three key contributions in this paper: (1) We present a new framework, \VWCBERT, that augments the Transformer-based hierarchical multi-class classification framework of Das et al. (\textsc{V2W-BERT}) with the ability to map weaknesses to exploits. (2) We implement \VWCBERT~ on modern AI accelerator platforms using two data parallel techniques for the pre-training phase and demonstrate nearly linear speedups across NVIDIA and Graphcore accelerator platforms. We observe nearly linear speedups for up to 16 V100 and 8 A100 GPUs, and about 3.4$\times$ speedup for A100 relative to V100 GPUs. We also observe excellent speedups on Graphcore, with $5.7\times$ speedup on 128 IPUs relative to 16 IPUs. Enabled by scaling, we also demonstrate higher accuracy using a larger language model, RoBERTa-Large. We show up to 87\% accuracy for strict and up to 98\% accuracy for relaxed classification. (3) We develop a novel parallel link manager for the link prediction phase and demonstrate up to 21$\times$ speedup with 16 V100 GPUs relative to one V100 GPU, and thus reducing the runtime from 2.5 hours to 10 minutes. We believe that generalizability and scalability of \VWCBERT~ will benefit both the theoretical development and practical deployment of novel cyberdefense solutions and vulnerability classification.

Das, Siddhartha Shankar↗

DOE OSTI2022

Enabling Modular Autonomous Feedback‐Loops in Materials Science through Hierarchical Experimental Laboratory Automation and Orchestration

Abstract Materials acceleration platforms (MAPs) operate on the paradigm of integrating combinatorial synthesis, high‐throughput characterization, automatic analysis, and machine learning. Within a MAP, one or multiple autonomous feedback loops may aim to optimize materials for certain functional properties or to generate new insights. The scope of a given experiment campaign is defined by the range of experiment and analysis actions that are integrated into the experiment framework. Herein, the authors present a method for integrating many actions within a hierarchical experimental laboratory automation and orchestration (HELAO) framework. They demonstrate the capability of orchestrating distributed research instruments that can incorporate data from experiments, simulations, and databases. HELAO interfaces laboratory hardware and software distributed across several computers and operating systems for executing experiments, data analysis, provenance tracking, and autonomous planning. Parallelization is an effective approach for accelerating knowledge generation provided that multiple instruments can be effectively coordinated, which the authors demonstrate with parallel electrochemistry experiments orchestrated by HELAO. Efficient implementation of autonomous research strategies requires device sharing, asynchronous multithreading, and full integration of data management in experimental orchestration, which to the best of the authors’ knowledge, is demonstrated for the first time herein.

36 MATERIALS SCIENCE↗

DOE OSTI2026

Weak Lensing Mass Calibration of the ACT DR5 Galaxy Clusters with the DES Year 3 Weak Lensing Data

We use weak gravitational lensing measurements from Year 3 Dark Energy Survey data to calibrate the masses of 443 galaxy clusters selected via the Sunyaev-Zel'dovich effect from Atacama Cosmology Telescope Data Release 5 maps of the cosmic microwave background. We incorporate redshift and SZ measurements for individual clusters into a hierarchical model for the stacked lensing signals and perform Bayesian analyses to constrain the hydrostatic mass bias of the clusters. Our treatment of systematic uncertainties includes a prescription for measuring and accounting for the weak lensing boost factor, consideration of a miscentering effect, as well as marginalization over uncertainties in the source galaxy photometric redshift distributions and shear calibration. The resultant constraints on the normalization of the mass-observable relation have a precision of approximately 7%, with the mean WL halo mass of M $_{500c}$ = 5.4 × 10$^{14}$ M $_{⊙}$. We measure the bias between the true cluster mass and the mass estimated from the SZ signal based on an X-ray-calibrated scaling relation assuming hydrostatic equilibrium, to be 1 - b = 0.74$^{+0.06}$ $_{-0.05}$ over the full sample. When splitting the clusters into high (z = 0.43-0.70) and low (z = 0.15-0.43) redshift bins, we measure 1 - b = 0.58$^{+0.06}$ $_{-0.05}$ and 0.81$^{+0.08}$ $_{-0.06}$, respectively. When introducing additional freedom in redshift and mass to the hydrostatic bias model, we find that 1 - b decreases with redshift (with the power law of -1.8$^{+0.5}$ $_{-0.6}$, 99.95% confidence), consistent with findings from other recent studies, while we do not find any significant trend in mass. We also demonstrate that our result is robust against various systematics such as a scale cut, priors on baryonic and miscentering parameters, and degree of scatter in mass-observable relation. The weak-lensing mass calibration presented in this study will be a useful tool for using the ACT clusters as probes of astrophysics, and as a step towards using their abundance as a cosmological probe.

Shin, T. [Carnegie Mellon U.] (ORCID:0000000263895↗

DOE OSTI2020

Cluster Difference Imaging Photometric Survey. II. TOI 837: A Young Validated Planet in IC 2602

We report the discovery of TOI 837b and its validation as a transiting planet. We characterize the system using data from the NASA Transiting Exoplanet Survey Satellite mission, the ESA Gaia mission, ground-based photometry from El Sauce and ASTEP400, and spectroscopy from CHIRON, FEROS, and Veloce. We find that TOI 837 is a T = 9.9 mag G0/F9 dwarf in the southern open cluster IC 2602. The star and planet are therefore 35$_{-5}^{+11}$ million years old. Combining the transit photometry with a prior on the stellar parameters derived from the cluster color–magnitude diagram, we find that the planet has an orbital period of 8.3 days and is slightly smaller than Jupiter (R p =0.77$_{-0.07}^{+0.09}$ R Jup ). From radial velocity monitoring, we limit M p sin i to less than 1.20 M Jup (3σ). The transits either graze or nearly graze the stellar limb. Grazing transits are a cause for concern, as they are often indicative of astrophysical false-positive scenarios. Our follow-up data show that such scenarios are unlikely. Our combined multicolor photometry, high-resolution imaging, and radial velocities rule out hierarchical eclipsing binary scenarios. Background eclipsing binary scenarios, though limited by speckle imaging, remain a 0.2% possibility. TOI 837b is therefore a validated adolescent exoplanet. The planetary nature of the system can be confirmed or refuted through observations of the stellar obliquity and the planetary mass. Such observations may also improve our understanding of how the physical and orbital properties of exoplanets change in time.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2022

Reverse-mode differentiation in arbitrary tensor network format: with application to supervised learning.

This paper describes an efficient reverse-mode differentiation algorithm for contraction operations of tensor networks that may have arbitrary and unconventional network topologies. The approach leverages the tensor contraction tree of Evenbly and Pfeifer (2014), which provides an instruction set for the contraction sequence of a network. We show that this tree can be efficiently leveraged for differentiation of a full tensor network contraction using a recursive scheme that exploits (1) the bilinear property of contraction and (2) the property that trees have single path from root to leaves. While differentiation of tensor-tensor contraction is already possible in most automatic differentiation packages, we show that exploiting these two additional properties in the specific context of contraction sequences can improve efficiency. Following a description of the algorithm and computational complexity analysis, we investigate its utility for gradient-based supervised learning for low-rank function recovery and for fitting real-world unstructured datasets. We demonstrate improved performance over alternating least-squares optimization approaches and the capability to handle heterogeneous and arbitrary tensor network formats. When compared to alternating minimization algorithms, we find that the gradient-based approach requires a smaller oversampling ratio (number of samples compared to number model parameters) for recovery. This increased efficiency extends to fitting unstructured data of varying dimensionality and when employing a variety of tensor network formats. Here, we show improved learning using the hierarchical Tucker method over the tensor-train in high-dimensional settings on a number of benchmark problems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Efficient Network Partitioning: Application for Decentralized State Estimation in Power Distribution Grids: Preprint

Increase in the proliferation of DERs requires real-time situational awareness for efficient grid operations. State estimation plays an important role for real time control and management of the power grid. As the sensing infrastructure grows, aggregating and handling high volumes of data at a centralized location is extremely difficult. To address this challenge, this paper first proposes a novel and efficient hierarchical spectral clustering-based network partition algorithm followed by a decentralized compressive sensing (DCS) based state estimation. The applicability of the proposed network partitioning algorithm is tested on IEEE-123 bus, IEEE-8500 node, and a 6204-node distribution network. The results shows that the proposed approach efficiently divides the network into multiple sub-networks with the minimum edge connections among the neighbors. Then, we perform DCS-based state estimation on the 6204-node distribution network after dividing the network into 18 optimal partitions. Simulation results show that DCS-based state estimation recovers the system states with high accuracy and low complexity.

ADMM↗

DOE OSTI2021

hippynn Python Package

hippynn is a python package for defining, training, and applying neural networks to atomistic systems. In particular, it focuses on Hierarchical Interacting Particle Neural Networks (HIP-NNs), a deep learning architecture for atomistic systems. HIP-NNs take input data describing the properties of atomistic systems (often generated using ab-initio quantum mechanics) to learn fast and accurate models. A trained HIP-NN can predict potential energy surfaces, atomic charges, and more. hippynn uses PyTorch for portable high-performance code, including both CPU and GPU support. hippynn allows for extensive customization, including user-defined models and loss functions, to facilitate future research into extensions of HIP-NN as well as other atomistic deep learning models.

Lubbers, Nicolas↗

DOE OSTI2020

A Comprehensive System of Energy Intensity Indicators for the U.S.: Methods, Data and Key Trends

This report describes a comprehensive system of energy intensity indicators for the United States that has been developed for the Department of Energy’s Office of Energy Efficiency and Renewable Energy (EERE) over the past decade. This system of indicators is hierarchical in nature, beginning with detailed indexes of energy intensity for various sectors of the economy, which are ultimately aggregated to an overall energy intensity index for the economy as a whole. The aggregation of energy intensity indexes to higher levels in the hierarchy is performed with a version of the Log Mean Divisia index (LMDI) method. Based upon the data and methods in the system of indicators, the economy-wide energy intensity index shows a decline of about 16% in 2014 relative to a 1985 base year. Discussion of energy intensity indicators for each of the broad end-use sectors of the economy—residential, commercial, industrial, and transportation—is presented in the report. An analysis of recent changes in the efficiency of electricity generation in the U.S. is also included. A detailed appendix describes the data sources and methodology behind the energy intensity indicators for each sector.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

DOE OSTI2020

A Comprehensive System of Energy Intensity Indicators for the U.S.: Methods, Data and Key Trends

29 ENERGY PLANNING, POLICY, AND ECONOMY↗