Engineering Papers⌕ Search

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.

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

At least 235 records · Page 13

On the quantification and efficient propagation of imprecise probabilities with copula dependence

This paper addresses the problem of quantification and propagation of uncertainties associated with dependence modeling when data for characterizing probability models are limited. Practically, the system inputs are often assumed to be mutually independent or correlated by a multivariate Gaussian distribution. However, this subjective assumption may introduce bias in the response estimate if the real dependence structure deviates from this assumption. In this work, we overcome this limitation by introducing a flexible copula dependence model to capture complex dependencies. Here, a hierarchical Bayesian multimodel approach is proposed to quantify uncertainty in dependence model-form and model parameters that result from small data sets. This approach begins by identifying, through Bayesian multimodel inference, a set of candidate marginal models and their corresponding model probabilities, and then estimating the uncertainty in the copula-based dependence structure, which is conditional on the marginals and their parameters. The overall uncertainties integrating marginals and copulas are probabilistically represented by an ensemble of multivariate candidate densities. A novel importance sampling reweighting approach is proposed to efficiently propagate the overall uncertainties through a computational model. Through an example studying the influence of constituent properties on the out-of-plane properties of transversely isotropic E-glass fiber composites, we show that the composite property with copula-based dependence model converges to the true estimate as data set size increases, while an independence or arbitrary Gaussian correlation assumption leads to a biased estimate.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Towards robust autonomous impedance spectroscopy analysis: A calibrated hierarchical Bayesian approach for electrochemical impedance spectroscopy (EIS) inversion

Distribution-based analyses, such as the distribution of relaxation times (DRT) and the distribution of diffusion times (DDT), present model-free alternatives to equivalent circuit modeling for analysis of electrochemical impedance spectroscopy (EIS) data. However, reconstructing such distributions from noisy impedance data is an ill-posed problem that must be solved with specialized inversion algorithms, requiring careful control and tuning. Furthermore, most inversion algorithms developed to date can only solve problems of limited complexity. Herein, we present a new hierarchical Bayesian method for EIS inversion, leveraging efficient algorithms for optimization and Hamiltonian Monte Carlo (HMC) sampling to solve models of arbitrary complexity. We overcome the challenge of ad-hoc parameter tuning by encoding intrinsic characteristics of the DRT and DDT into flexible prior distributions and “pre-calibrating” the model to simulated data. This approach is versatile, highly robust to noise, and provides quantitative estimates of both the error structure of the data and the uncertainty in the recovered distributions. The model is validated with simulated data to demonstrate accurate recovery of the DRT and the DDT. The method also shows promise for simultaneous recovery of multiple distributions, raising the intriguing possibility of semi-autonomous EIS analysis and ad-hoc model construction. Finally, the practical utility of the method is illustrated with experimental data. Throughout, we draw comparisons to several recently published EIS inversion methodologies.

36 MATERIALS SCIENCE↗

Hierarchical biota-level and taxonomic controls on the chemistry of fossil melanosomes revealed using synchrotron X-ray fluorescence

Fossil melanosomes, micron-sized granules rich in melanin in vivo, provide key information for investigations of the original coloration, taxonomy and internal anatomy of fossil vertebrates. Such studies rely, in part, on analysis of the inorganic chemistry of preserved melanosomes and an understanding of melanosome chemical taphonomy. The extent to which the preserved chemistry of fossil melanosomes is biased by biotic and abiotic factors is, however, unknown. Here we report the discovery of hierarchical controls on the inorganic chemistry of melanosomes from fossil vertebrates from nine biotas. The chemical data are dominated by a strong biota-level signal, indicating that the primary taphonomic control is the diagenetic history of the host sediment. This extrinsic control is superimposed by a biological, tissue-level control; tissue-specific chemical variation is most likely to survive in fossils where the inorganic chemistry of preserved melanosomes is distinct from that of the host sediment. Comparative analysis of our data for fossil and modern amphibians reveals that most fossil specimens show tissue-specific melanosome chemistries that differ from those of extant analogues, strongly suggesting alteration of original melanosome chemistry. Collectively, these findings form a predictive tool for the identification of fossil deposits with well-preserved melanosomes amenable to studies of fossil colour and anatomy.

59 BASIC BIOLOGICAL SCIENCES↗

Estimating the electric vehicle charging demand of multi-unit dwelling residents in the United States

Abstract Early battery electric vehicle (EV) adopters can access home chargers for reliable charging. As the EV market grows, residents of multi-unit dwellings (MUDs) may face barriers in owning EVs and charging them without garage or parking availability. To investigate the mechanisms that can bridge existing disparities in home charging and station deployment, we characterized the travel behavior of MUD residents and estimated their EV residential charging demand. This study classifies the travel patterns of MUD residents by fusing trip diary data from the National Household Travel Survey and housing features from the American Housing Survey. A hierarchical agglomerative clustering method was used to cluster apartment complex residents’ travel profiles, considering attributes such as dwell time, daily vehicle miles traveled (VMT), income, and their residences’ US census division. We propose a charging decision model to determine the charging station placement demand in MUDs and the charging energy volume expected to be consumed, assuming that MUD drivers universally operate EVs in urban communities. Numerical experiments were conducted to gain insight into the charging demand of MUD residents in the US. We found that charging availability is indispensable for households that set out to meet 80% state of charge by the end of the day. When maintaining a 20% comfortable state of charge the entire day, the higher the VMT are, the greater the share of charging demand and the greater the energy use in MUD chargers. The upper-income group requires a greater share of MUD charging and greater daily kWh charged because of more VMT.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Hierarchical Gaussian process-based Bayesian optimization for materials discovery in high entropy alloy spaces

Bayesian optimization (BO) is a powerful and data-efficient method for iterative materials discovery and design, particularly valuable when prior knowledge is limited, underlying functional relationships are complex or unknown, and the cost of querying the materials space is significant. Traditional BO methodologies typically utilize conventional Gaussian Processes (cGPs) to model the relationships between material inputs and properties, as well as correlations within the input space. However, cGP-BO approaches often fall short in multi-objective optimization scenarios, where they are unable to fully exploit correlations between distinct material properties. Leveraging these correlations can significantly enhance the discovery process, as information about one property can inform and improve predictions about others. Here, this study addresses this limitation by employing advanced kernel structures to capture and model multi-dimensional property correlations through multi-task (MTGPs) or deep Gaussian Processes (DGPs), thus accelerating the discovery process. We demonstrate the effectiveness of MTGP-BO and DGP-BO in rapidly and robustly solving complex materials design challenges that occur within the context of complex multi-objective optimization over FCC FeCrNiCoCu high entropy alloy (HEA) spaces, where traditional cGP-BO approaches fail. Furthermore, we highlight how the differential costs associated with querying various material properties can be strategically leveraged to make the materials discovery process more cost-efficient.

36 MATERIALS SCIENCE↗

Finding Hidden Patterns in High Resolution Wind Flow Model Simulations

Wind flow data is critical in terms of investment decisions and policy making. High resolution data from wind flow model simulations serve as a supplement to the limited resource of original wind flow data collection. Given the large size of data, finding hidden patterns in wind flow model simulations are critical for reducing the dimensionality of the analysis. In this work, we first perform dimension reduction with two autoencoder models: the CNN-based autoencoder (CNN-AE) [1], and hierarchical autoencoder (HIER-AE) [2], and compare their performance with the Principal Component Analysis (PCA). We then investigate the super-resolution of the wind flow data. By training a Generative Adversarial Network (GAN) with 300 epochs, we obtained a trained model with 2× resolution enhancement. We compare the results of GAN with Convolutional Neural Network (CNN), and GAN results show finer structure as expected in the data field images. Also, the kinetic energy spectra comparisons show that GAN outperforms CNN in terms of reproducing the physical properties for high wavenumbers and is critical for analysis where high-wavenumber kinetics play an important role.

97 MATHEMATICS AND COMPUTING↗

Distributed Cross-Channel Hierarchical Aggregation for Foundation Models

Vision-based scientific foundation models hold significant promise for advancing scientific discovery and innovation. This potential stems from their ability to aggregate images from diverse sources—such as varying physical groundings or data acquisition systems—and to learn spatio-temporal correlations using transformer architectures. However, tokenizing and aggregating images can be compute-intensive, a challenge not fully addressed by current distributed methods. In this work, we introduce the Distributed Cross-Channel Hierarchical Aggregation (D-CHAG) approach designed for datasets with a large number of channels across image modalities. Our method is compatible with any model-parallel strategy and any type of vision transformer architecture, significantly improving computational efficiency. We evaluated D-CHAG on hyperspectral imaging and weather forecasting tasks. When integrated with tensor parallelism and model sharding, our approach achieved up to a 75% reduction in memory usage and more than doubled sustained throughput on up to 1,024 AMD GPUs on the Frontier Supercomputer.

Tsaris, Aristeidis (aris) [ORNL] (ORCID:0000000277↗

Distributed Augmentation, Hypersweeps, and Branch Decomposition of Contour Trees for Scientific Exploration

Contour trees describe the topology of level sets in scalar fields and are widely used in topological data analysis and visualization. A main challenge of utilizing contour trees for large-scale scientific data is their computation at scale using highperformance computing. To address this challenge, recent work has introduced distributed hierarchical contour trees for distributed computation and storage of contour trees. However, effective use of these distributed structures in analysis and visualization requires subsequent computation of geometric properties and branch decomposition to support contour extraction and exploration. In this work, we introduce distributed algorithms for augmentation, hypersweeps, and branch decomposition that enable parallel computation of geometric properties, and support the use of distributed contour trees as query structures for scientific exploration. Finally, we evaluate the parallel performance of these algorithms and apply them to identify and extract important contours for scientific visualization.

97 MATHEMATICS AND COMPUTING↗

Hyperspectral remote sensing-based plant community map for region around NGEE-Arctic intensive research watersheds at Seward Peninsula, Alaska, 2017-2019

Using airborne hyperspectral remote sensing data from NASA Airborne Visible-Infrared Imaging Spectrometer- Next Generation (AVIRIS-NG) platforms in a region near NGEE-Arctic intensive watersheds at Seward peninsula of Alaska, high resolution (5m) maps of plant community distribution were developed and included in this data collected. AVIRIS-NG data collected over 2017-2019 period were used to develop deep neural networks, trained using vegetation plot observations collected at NGEE-Arctic watersheds at Kougarok, Council and Teller. A hierarchical vegetation classification scheme consisting of six classes at Level I, and 16 classes at Level II contained in two .txt files were used to developed the plant community maps for the region. Two geospatial raster data files (.tif) at both thematic levels are shared in this data collection. Data files in this collection use Alaska Albers Equal Area projection. Readme files available in three formats (*.html, *.md, *.pdf) and one *.png visualization map.The Next-Generation Ecosystem Experiments: Arctic (NGEE Arctic), was a research effort to reduce uncertainty in Earth System Models by developing a predictive understanding of carbon-rich Arctic ecosystems and feedbacks to climate. NGEE Arctic was supported by the Department of Energy's Office of Biological and Environmental Research.The NGEE Arctic project had two field research sites: 1) located within the Arctic polygonal tundra coastal region on the Barrow Environmental Observatory (BEO) and the North Slope near Utqiagvik (Barrow), Alaska and 2) multiple areas on the discontinuous permafrost region of the Seward Peninsula north of Nome, Alaska.Through observations, experiments, and synthesis with existing datasets, NGEE Arctic provided an enhanced knowledge base for multi-scale modeling and contributed to improved process representation at global pan-Arctic scales within the Department of Energy's Earth system Model (the Energy Exascale Earth System Model, or E3SM), and specifically within the E3SM Land Model component (ELM).

54 ENVIRONMENTAL SCIENCES↗

FilDReaMS: II. Application to the analysis of the relative orientations between filaments and the magnetic field in four Herschel fields

Context. Both simulations and observations of the interstellar medium show that the study of the relative orientations between filamentary structures and the magnetic field can bring new insight into the role played by magnetic fields in the formation and evolution of filaments and in the process of star formation. Aims. We provide a first application of FilDReaMS, the new method presented in the companion paper to detect and analyze filaments in a given image. The method relies on a template that has the shape of a rectangular bar with variable width. Our goal is to investigate the relative orientations between the detected filaments and the magnetic field. Methods. We apply FilDReaMS to a small sample of four Herschel fields (G210, G300, G82, G202) characterized by different Galactic environments and different evolutionary stages. First, we look for the most prevalent bar widths, and we examine the networks formed by filaments of different bar widths as well as their hierarchical organization. Second, we compare the filament orientations to the magnetic field orientation inferred from Planck polarization data and, for the first time, we study the statistics of the relative orientation angle as functions of both spatial scale and H2 column density. Results. We find preferential relative orientations in the four Herschel fields: small filaments with low column densities tend to be slightly more parallel than perpendicular to the magnetic field; in contrast, large filaments, which all have higher column densities, are oriented nearly perpendicular (or, in the case of G202, more nearly parallel) to the magnetic field. In the two nearby fields (G210 and G300), we observe a transition from mostly parallel to mostly perpendicular relative orientations at an H 2 column density ≃ 1.1 × 10 21 cm -2 and 1.4 × 10 21 cm -2 , respectively, consistent with the results of previous studies. Conclusions. Our results confirm the existence of a coupling between magnetic fields at cloud scales and filaments at smaller scale. They also illustrate the potential of combining Herschel and Planck observations, and they call for further statistical analyses with our dedicated method.

79 ASTRONOMY AND ASTROPHYSICS↗

An experimentally informed design process for future inertial confinement fusion facilities

The achievement of ignition in the laboratory has renewed interest in defining the requirements for a future high-gain inertial confinement fusion (ICF) facility. Our best chance of predicting future ICF performance is with 3-D radiation hydrodynamic simulations that have been benchmarked against experimental data, but their high computational cost is prohibitive for use in practical design studies. We introduce a hierarchical approach where 3-D simulations are tuned to match experimental measurements and used to train 3-D degradation models in 1-D simulations allowing for accurate predictions over the entire OMEGA direct-drive database. A genetic algorithm was used in combination with the trained 1-D simulations to search for optimal direct-drive implosion designs at driver energies ranging from 20 kJ to 10 MJ. As the fidelity of 3-D codes improves, this approach will provide a viable experimentally informed tool for defining the next ICF facility.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

HangulFonts v1.0.0

The software creates the Hangul Fonts data set.The Hangul Fonts Datasets consists of all possible blocks for each font along with a set of labels and features for each block which are common across all fonts. We provide scripts to render each block and font into an image and store them together in an HDF5 file for each font and fontsize specified. Each font has 11,172 possible blocks and we have curated 35 fonts for a total of 391,020 possible images. The spoken consonants and vowel correspond to a set of "initial", "medial", and "final" labels for each block with 19, 21, and 28 classes respectively. In addition, each block can also be assigned a hierarchy label based on the block geometry. Finally, the individual glyphs (atoms) are composed across the initial, medial, and final locations along with potential scalings, translations, or rotations. These features of the data set make it uniquely positioned in the deep representation learning field because of its compositionally and hierarchical organization, while retaining diverse types of variation in the realizations.

Bouchard, Kristofer↗

Neural network potentials with effective charge separation for non-equilibrium dynamics of ionic solids: a ZnO case study

Developing neural network potentials (NNPs) accurate under non-equilibrium dynamics is challenging, as such systems require extensive sampling beyond equilibrium phases. Here we construct high-fidelity NNPs for zinc oxide (ZnO), a polymorphic ionic solid, using density functional theory (DFT) reference data. To efficiently capture transitional configurations, we combine enhanced-sampling molecular dynamics with empirical potentials, data distillation, and pretraining on short-range atomic energies (A-Train), followed by transfer learning with DFT-relabeled datasets. This hierarchical approach improves transferability across polymorphs and stress states. We further introduce effective charge separation, treating long-range Coulombic terms analytically while short-range residual interactions are learned by the NNP. The optimal effective charges fall in the range 0.5–1.0 q e , consistent with dielectric-screened values derived from formal charges but distinct from Bader estimates. Motivated by this observation, we propose a simple data-driven protocol in which effective charges are optimized by comparing DFT reference energies with explicit Coulomb calculations, without additional NNP training. This strategy improves accuracy and transferability in DFT-level predictions of energies, forces, and stress. Together, these results provide a practical charge-selection framework for robust NNP development in ionic solids, enabling reliable simulation of polymorphic phase transformations and non-equilibrium dynamics.

Chemistry↗

Predictions of rhizosphere microbiome dynamics with a genome-informed and trait-based energy budget model

Abstract Soil microbiomes are highly diverse, and to improve their representation in biogeochemical models, microbial genome data can be leveraged to infer key functional traits. By integrating genome-inferred traits into a theory-based hierarchical framework, emergent behaviour arising from interactions of individual traits can be predicted. Here we combine theory-driven predictions of substrate uptake kinetics with a genome-informed trait-based dynamic energy budget model to predict emergent life-history traits and trade-offs in soil bacteria. When applied to a plant microbiome system, the model accurately predicted distinct substrate-acquisition strategies that aligned with observations, uncovering resource-dependent trade-offs between microbial growth rate and efficiency. For instance, inherently slower-growing microorganisms, favoured by organic acid exudation at later plant growth stages, exhibited enhanced carbon use efficiency (yield) without sacrificing growth rate (power). This insight has implications for retaining plant root-derived carbon in soils and highlights the power of data-driven, trait-based approaches for improving microbial representation in biogeochemical models.

59 BASIC BIOLOGICAL SCIENCES↗

Early Battery Performance Prediction for Mixed Use Charging Profiles Using Hierarchal Machine Learning

A key step limiting how fast batteries can be deployed is the time necessary to provide evaluation and validation of performance. Using data analysis approaches, such as machine learning, the validation process can be accelerated. However, questions on the validity of projecting models trained on limited data or simple cycling profiles, such as constant current cycling, to real-world scenarios with complex loads remains. Here, we present the ability to predict performance with less than 1.2% mean absolute percent error when trained on cells aged using complex electric vehicle discharge profiles, and either AC Level 2 charge or DC Fast charge profiles, using only the first 45 cycles, namely 5% of the total testing time. While error is low across the projections, this study also highlights that battery lifetime analysis using only cycling data may not extrapolate safely to certain real-world conditions due to the impact of calendar degradation.

25 ENERGY STORAGE↗

DICER: Data Intensive Computing Environment and Runtime for Evaluating Unprecedented Scale of Geospatial-Temporal Human Mobility Data

With the significant increase in sources and volume of human mobility data through commercial data vendors as well as microsimulation of cities, the scale of geospatial-temporal data to analyze and assess for mobility characterization has grown to the level of Big Data. There are mobility related commercial organizations deploying scalable computing, but often the system architecture, workflow, and intermediate processing components are not fully disclosed in relevant scope. Current research literature has a notable lack of studies demonstrating architectures and workflows for human mobility analytics that are implemented on a TeraByte scale of geospatial-temporal data. In this context, this paper presents a hyperscale-level system solution named DICER (Data Intensive Computing Environment and Runtime) for processing and analytics of geospatial-temporal data at big data scale. Although the cluster computing architecture of DICER with Apache Spark job running on Kubernetes cluster is not new, there are innovations in the workflow, hierarchical processing logic, and a wide range of intermediate preprocessing and mobility metrics calculation. We have performed case studies to validate the effectiveness of DICER system solution by performing detailed analytics and assessment of human mobility microsimulation output at three different scopes and scale, including a usecase with 16.97 TeraByte and 259.2 Billion rows of data. In addition, we have presented another case study of utilizing DICER to perform the same mobility processing and comparative analytics on large-scale commercially available geospatial-temporal data. All these case studies validate the efficiency and usefulness of DICER in computing population mobility characteristics from geospatial-temporal trajectory data at an unprecedented scale (not only just data volume, but also combination of: number of user entities, temporal frequency, spatial resolution, data duration).

De, Debraj↗

From natural language to control signals: a conceptual framework for semantic channel finding in complex experimental infrastructure

Modern experimental platforms such as particle accelerators, fusion devices, telescopes, and industrial process control systems expose tens to hundreds of thousands of control and diagnostic channels, accumulated over decades of hardware evolution. Operators and AI systems alike depend on informal expert knowledge, inconsistent naming conventions, and scattered documentation to locate the signals required for monitoring, troubleshooting, and automated control, creating a persistent bottleneck for reliability, scalability, and emerging language-model-driven interfaces. We formalize semantic channel finding, the task of mapping natural-language intent to concrete control-system signals, as a general problem in complex experimental infrastructure, and introduce a four-paradigm conceptual framework to guide architecture selection based on facility-specific data regimes. The paradigms span (i) direct in-context lookup over small, curated channel dictionaries, (ii) constrained hierarchical navigation through structured trees, (iii) interactive agent exploration using iterative reasoning and tool-based database queries, and (iv) ontology-grounded semantic search that decouples channel meaning from facility-specific naming conventions. We demonstrate the practical feasibility of each paradigm through proof-of-concept implementations at four operational facilities spanning two orders of magnitude in scale: from compact free-electron lasers to large synchrotron light sources, operating under diverse control-system architectures ranging from clean hierarchical naming schemes to legacy environments with decades of heterogeneous conventions. Where evaluated against expert-curated operational queries, these instantiations achieve 90%–97% accuracy, validating the framework’s applicability across real-world deployment scenarios. To accelerate adoption across the broader scientific and industrial control-system community, we release open-source, plug-and-play implementations of all three interactive paradigms-direct lookup, hierarchical navigation, and middle-layer exploration-within the Osprey framework, together with tools for channel database generation, interactive testing, and minimal-configuration deployment. This work establishes semantic channel finding as a foundational capability for human-centric and agentic AI interfaces at large-scale facilities, providing both a systematic framework for architecture design and practical resources to enable adoption without building custom infrastructure from scratch.

channel finding↗

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↗