Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “disjoint set”

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.

13 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Integer Sequences from Configurations in the Hausdorff Metric Geometry via Edge Covers of Bipartite Graphs

The Hausdorff metric provides a way to measure the distance between nonempty compact sets in $\mathbb{R}^N$, from which we can build a geometry of sets. This geometry is very different than the standard Euclidean geometry and provides many interesting results. In this paper we focus on line segments in this geometry, where pairs of disjoint sets $A$ and $B$ satisfying certain distance conditions have the property that there are exactly $m$ different sets on the line segment $\overline{AB}$ at every distance from $A$, where $m$ can assume many values different than one. We provide new families of sets that generate previously unrecorded integer sequences via these values of $m$ by connecting the values of $m$ to the number of edge coverings of a graph corresponding to the sets $A$ and $B$.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

A Code-Agnostic Driver Application for Coupled Neutronics and Thermal-Hydraulic Simulations

While the literature has numerous examples of Monte Carlo and computational fluid dynamics (CFD) coupling, most are hard-wired codes intended primarily for research rather than as standalone, general-purpose applications. In this work, we describe an open source application, ENRICO, that enables coupled neutronic and thermal-hydraulic simulations between multiple codes that can be chosen at runtime (as opposed to a coupling between two specific codes). The application has been designed such that the control flow logic, domain mapping, nonlinear fixed-point iteration, solution transfers, and convergence checks are all agnostic to the underlying physics solvers used. Special emphasis has also been placed on enabling efficient execution on distributed-memory computing environments. The transfer of solution fields between solvers is performed in memory rather than through filesystem I/O. Additionally, solvers can be configured to run on overlapping or disjoint sets of processes. To date, coupling with the OpenMC and Shift Monte Carlo codes, the Nek5000 CFD code, and a simplified heat diffusion and subchannel solver has been implemented in ENRICO. We present results for coupled simulations of a single light-water reactor fuel assembly based on the NuScale reactor using various combinations of the physics solvers. For this problem, the coupled simulations are shown to converge in about four Picard iterations. A comparison of the heat source and temperature distributions computed by ENRICO using OpenMC coupled with Nek5000 and Shift coupled with Nek5000 illustrates remarkable agreement between the codes.

42 ENGINEERING↗
DOE OSTI2021

Asynchronous and Load-Balanced Union-Find for Distributed and Parallel Scientific Data Visualization and Analysis

We present a novel distributed union-find algorithm that features asynchronous parallelism and k-d tree based load balancing for scalable visualization and analysis of scientific data. Applications of union-find include level set extraction and critical point tracking, but distributed union-find can suffer from high synchronization costs and imbalanced workloads across parallel processes. In this study, we prove that global synchronizations in existing distributed union-find can be eliminated without changing final results, allowing overlapped communications and computations for scalable processing. We also use a k-d tree decomposition to redistribute inputs, in order to improve workload balancing. We benchmark the scalability of our algorithm with up to 1,024 processes using both synthetic and application data. Here, we demonstrate the use of our algorithm in critical point tracking and super-level set extraction with high-speed imaging experiments and fusion plasma simulations, respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Polynomial chaos expansions on principal geodesic Grassmannian submanifolds for surrogate modeling and uncertainty quantification

In this work we introduce a manifold learning-based surrogate modeling framework for uncertainty quantification in high-dimensional stochastic systems. Our first goal is to perform data mining on the available simulation data to identify a set of low-dimensional (latent) descriptors that efficiently parameterize the response of the high-dimensional computational model. To this end, we employ Principal Geodesic Analysis on the Grassmann manifold of the response to identify a set of disjoint principal geodesic submanifolds, of possibly different dimension, that captures the variation in the data. Since operations on the Grassmann require the data to be concentrated, we propose an adaptive algorithm based on Riemannian K-means and the minimization of the sample Fréchet variance on the Grassmann manifold to identify “local” principal geodesic submanifolds that represent different system behavior across the parameter space. Polynomial chaos expansion is then used to construct a mapping between the random input parameters and the projection of the response on these local principal geodesic submanifolds. Here, the method is demonstrated on four test cases, a toy-example that involves points on a hypersphere, a Lotka-Volterra dynamical system, a continuous-flow stirred-tank chemical reactor system, and a two-dimensional Rayleigh-Bénard convection problem.

42 ENGINEERING↗
DOE OSTI2021

Dynamic Earthquake Triggering in Southern California in High Resolution: Intensity, Time Decay, and Regional Variability

Abstract Earthquake triggering by seismic waves has been recognized as a phenomenon for nearly 30 years. However, our ability to study dynamic triggering has been limited by our ability to capture the triggering stresses accurately and record the resultant earthquakes. Here we use full waveforms from a dense seismic network and a modern, high‐resolution seismic catalog to measure triggering in Southern California from 2008 to 2017 based on interevent time ratios. We find that the fractional seismicity rate change, which we term triggering intensity or triggerability, as a function of peak strain change for the period of ∼20 s due to distant earthquakes is monotonically increasing and compatible with earlier measurements made with a disjoint data set from 1984 to 2008. A triggering strain of 1 microstrain is equivalent to the local productivity generated by an M 1.8 earthquakes. This result implies that a prediction of seismicity rate changes can be made based on recorded ground shaking using the same formalism as currently used for aftershock prediction. For a teleseismic event, this small level of triggering occurs throughout the region and thus aggregates to a regional effect. We find that the triggering rate decays after the triggerer follows an Omori‐Utsu law, but at a much slower rate than a typical aftershock sequence. The slow decay rate suggests that an ancillary process such as creep or fluid flow must be part of dynamic triggering. The prevalence of triggering in areas of creep or fluid involvement reinforces this inference. A triggering cascade of secondary earthquakes is insufficient to explain the data.

Miyazawa, Masatoshi↗
DOE OSTI2020

Research Needs for Trusted Analytics in National Security Settings

As artificial intelligence, machine learning, and statistical modeling methods become commonplace in national security applications, the drive to create trusted analytics becomes increasingly important. The goal of this report is to identify areas of research that can provide the foundational understanding and technical prerequisites for the development and deployment of trusted analytics in national security settings. Our review of the literature covered several disjoint research communities, including computer science, statistics, human factors, and several branches of psychology and cognitive science, which tend not to interact with one another or cite each other's literatures. As a result, there exists no agreed-upon theoretical framework for understanding how various factors influence trust and no well-established empirical paradigm for studying these effects. This report therefore takes three steps. First, we define several key terms in an effort to provide a unifying language for trusted analytics and to manage the scope of the problem. Second, we outline an empirical perspective that identifies key independent, moderating, and dependent variables in assessing trusted analytics. Though not a substitute for a theoretical framework, the empirical perspective does support research and development of trusted analytics in the national security domain. Finally, we discuss several research gaps relevant to developing trusted analytics for the national security mission space.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2021

Entanglement types for two-qubit states with real amplitudes

We study the set of two-qubit pure states with real amplitudes and their geometrical representation in the three-dimensional sphere. In this representation, we show that the maximally entangled states—those locally equivalent to the Bell states—form two disjoint circles perpendicular to each other. We also show that taking the natural Riemannian metric on the sphere, the set of states connected by local gates are equidistant to this pair of circles. Moreover, the unentangled or so-called product states are π/4 units away to the maximally entangled states. This is, the unentangled states are the farthest away to the maximally entangled states. In this way, if we define two states to be equivalent if they are connected by local gates, we have that there are as many equivalent classes as points in the interval [0,π/4] with the point 0 corresponding to the maximally entangled states. The point π/4 corresponds to the unentangled states which geometrically are described by a torus. Finally, for every 0<d<π/4 the point d corresponds to a disjoint pair of torus. Finally, we also show how this geometrical interpretation allows to clearly see that any pair of two-qubit states with real amplitudes can be connected with a circuit that only has single-qubit gates and one controlled-Z gate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Deterministic High-Fidelity Neutronics Simulation of Pebble Bed Reactors Using Pebble Tracking Transport

The pebble tracking transport (PTT) algorithm offers a high-fidelity deterministic approach for neutron transport for pebble bed reactors (PBRs). This approach requires the mesh for the active-core region to consist exclusively of tetrahedral elements, where each node in the pebble-packing region represents a pebble centroid. This paper investigates the application of PTT for full-scale PBRs, considering both the isothermal and the temperature-dependent core conditions. Macroscopic cross sections are generated using Serpent 2 full-core eigenvalue simulations where pebbles are grouped into disjoint subsets using machine learning. To minimize the need for individual cross-section sets for each pebble in the core, K-means clustering is used to group pebbles by temperature and neutronic environment parameters. Here, we compare the multiplication factor and power rate distributions between PTT simulations using the Griffin reactor physics software and reference solutions from Serpent 2. Our analysis shows that a full-core, high-fidelity PTT calculation produces accurate results with minimal local (pebblewise) errors. Additionally, timing results indicate that PTT simulations converge rapidly on modern supercomputing platforms.

Griffin↗
DOE OSTI2026

Selective Amnesia using Contrastive Subnet Erasure for Class Level Unlearning in Vision Models

We study concept-level forgetting in pretrained vision models: removing an entire semantic category so the system no longer recognizes that object in unseen images and contexts, rather than merely forgetting specific training examples. Prior work either applies blunt global projections or fine-tunes parameters, which can introduce collateral damage to unrelated features, add compute, and become unstable as forgetting strength increases. We introduce Contrastive Subnet Erasure (CSE), a training-free, encoder-centric edit that targets a compact set of channels most responsible for the class and attenuates them in a calibrated manner. The modification is algebraically folded into the subsequent layer, yielding no inference-time overhead and leaving task heads unchanged. To evaluate whether forgetting generalizes beyond the data used to specify the class, we introduce a cross dataset protocol in which the class is defined on a source dataset and performance is measured on a disjoint target dataset drawn from a different distribution with no shared images. This setup tests whether the model still fails to recognize the object when it looks different or appears in new scenes, and it helps avoid overfitting to patterns in the source dataset. Across CIFAR 10, CIFAR 100, and ImageNet under this protocol, CSE achieves stronger forgetting of the target class while better preserving non target utility than existing baselines in both single class and multi class settings. Overall, CSE provides a simple, stable, and deployment-ready mechanism for class-level unlearning in vision.

Kotevska, Olivera [ORNL] (ORCID:0000000316772243)↗
DOE OSTI2021

The Atacama Cosmology Telescope: Probing the baryon content of SDSS DR15 galaxies with the thermal and kinematic Sunyaev-Zel’dovich effects

We present high signal-to-noise measurements (up to 12$\sigma$) of the average thermal Sunyaev Zel'dovich (tSZ) effect from optically selected galaxy groups and clusters and estimate their baryon content within a 2.1$^\prime$ radius aperture. Sources from the Sloan Digital Sky Survey (SDSS) Baryon Oscillation Spectroscopic Survey (BOSS) DR15 catalog overlap with 3,700 sq. deg. of sky observed by the Atacama Cosmology Telescope (ACT) from 2008 to 2018 at 150 and 98 GHz (ACT DR5), and 2,089 sq. deg. of internal linear combination component-separated maps combining ACT and $\it{Planck}$ data (ACT DR4). The corresponding optical depths, $\bar{\tau}$, which depend on the baryon content of the halos, are estimated using results from cosmological hydrodynamic simulations assuming an AGN feedback radiative cooling model. We estimate the mean mass of the halos in multiple luminosity bins, and compare the tSZ-based $\bar{\tau}$ estimates to theoretical predictions of the baryon content for a Navarro-Frenk-White profile. We do the same for $\bar{\tau}$ estimates extracted from fits to pairwise baryon momentum measurements of the kinematic Sunyaev-Zel'dovich effect (kSZ) for the same data set obtained in a companion paper. We find that the $\bar{\tau}$ estimates from the tSZ measurements in this work and the kSZ measurements in the companion paper agree within $1\sigma$ for two out of the three disjoint luminosity bins studied, while they differ by 2-3$\sigma$ in the highest luminosity bin. The optical depth estimates account for one third to all of the theoretically predicted baryon content in the halos across luminosity bins. Potential systematic uncertainties are discussed. The tSZ and kSZ measurements provide a step towards empirical Compton-$\bar{y}$-$\bar{\tau}$ relationships to provide new tests of cluster formation and evolution models.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

ITeM: Independent temporal motifs to summarize and compare temporal networks

We report networks are a fundamental and flexible way of representing various complex systems. Many domains such as communication, citation, procurement, biology, social media, and transportation can be modeled as a set of entities and their relationships. Temporal networks are a specialization of general networks where every relationship occurs at a discrete time. The temporal evolution of such networks is as important to understand as the structure of the entities and relationships. We present the Independent Temporal Motif (ITeM) to characterize temporal graphs from different domains. ITeMs can be used to model the structure and the evolution of the graph. In contrast to existing work, ITeMs are edge-disjoint directed motifs that measure the temporal evolution of ordered edges within the motif. For a given temporal graph, we produce a feature vector of ITeM frequencies and the time it takes to form the ITeM instances. We apply this distribution to measure the similarity of temporal graphs. We show that ITeM has higher accuracy than other motif frequency-based approaches. We define various ITeM-based metrics that reveal salient properties of a temporal network. We also present importance sampling as a method to efficiently estimate the ITeM counts. We present a distributed implementation of the ITeM discovery algorithm using Apache Spark and GraphFrame. We evaluate our approach on both synthetic and real temporal networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A proposed framework for the development and qualitative evaluation of West Nile virus models and their application to local public health decision-making

West Nile virus (WNV) is a globally distributed mosquito-borne virus of great public health concern. The number of WNV human cases and mosquito infection patterns vary in space and time. Many statistical models have been developed to understand and predict WNV geographic and temporal dynamics. However, these modeling efforts have been disjointed with little model comparison and inconsistent validation. In this paper, we describe a framework to unify and standardize WNV modeling efforts nationwide. WNV risk, detection, or warning models for this review were solicited from active research groups working in different regions of the United States. A total of 13 models were selected and described. The spatial and temporal scales of each model were compared to guide the timing and the locations for mosquito and virus surveillance, to support mosquito vector control decisions, and to assist in conducting public health outreach campaigns at multiple scales of decision-making. Our overarching goal is to bridge the existing gap between model development, which is usually conducted as an academic exercise, and practical model applications, which occur at state, tribal, local, or territorial public health and mosquito control agency levels. The proposed model assessment and comparison framework helps clarify the value of individual models for decision-making and identifies the appropriate temporal and spatial scope of each model. This qualitative evaluation clearly identifies gaps in linking models to applied decisions and sets the stage for a quantitative comparison of models. Specifically, whereas many coarse-grained models (county resolution or greater) have been developed, the greatest need is for fine-grained, short-term planning models (m–km, days–weeks) that remain scarce. We further recommend quantifying the value of information for each decision to identify decisions that would benefit most from model input.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

High-dimensional Data-driven Energy optimization for Multi-Modal Transit Agencies (HD-EMMA) (Final Technical Report)

Public bus transit services in the U.S. are responsible for at least 19.7 million metric tons of CO 2 emission annually. Electric vehicles (EVs) can have a much lower environmental impact than comparable internal combustion engine vehicles (ICEVs), especially in urban areas. Unfortunately, EVs are also much more expensive than ICEVs. As a result, many public transit agencies can afford only mixed fleets of transit vehicles, consisting of EVs, hybrids (HEVs), and ICEVs. Transit agencies that operate such mixed fleets of vehicles face a challenging optimization problem: these agencies need to decide which vehicles are assigned to serving which transit trips. Since the advantage of EVs over ICEVs varies depending on the route and time of day (e.g., the benefit of EVs is higher in slower traffic with frequent stops and lower on highways), the assignment can have a significant effect on energy use and, hence, environmental impact. Through this project, we have developed reference data about energy collections and constructed a set of machine learning models that can accurately predict the energy consumption for the whole fleet at the level of each trip. We have used these models to develop a scheduling and assignment strategy that can rotate the different vehicle types across the transit agencies’ routes. The optimization algorithm ensures that the vehicles are matched to trips considering weather patterns, expected congestion, and road gradients to minimize the overall energy usage. We list the key observations from our project for other practitioners below. Details are available in the report, and the list of source code and our publications are included in the appendix. 1. We have demonstrated the feasibility of collecting, merging and analyzing large volumes of high-resolution real-world telemetry data from a mixed vehicle fleet. To mitigate the inherent noise of the recorded GPS points, the team developed an algorithm that filters data and maps the points onto a street. The algorithm considers previous and subsequent location measurements and different characteristics of nearby streets to determine how likely the vehicle travels on them. Then, the team segmented the time series into disjoint contiguous samples based on adjacent road segments and repeated the outlier detection and removal. For each data point, the team added features corresponding to elevation changes within the samples, weather features, such as temperature, and traffic data, such as speed ratio between actual speed and free-flow speed. 2. We have developed two forms of machine learning models that be used to understand and analyze the energy operations of a mixed vehicle transit fleet. The micro prediction model provides estimates of instantaneous energy prediction for all types of buses (diesel, hybrid, and electric). Such a model is important in evaluating the energy impacts of real-time bus operation strategies, but it is challenging due to diversified driving cycles of transit buses. The model can help the drivers understand the impact of their driving behaviors and short-term congestions. The macro prediction models estimate average energy consumption across the whole trip considering the features: distance traveled, various road-type features, elevation change, day of the week, time of day, various weather features (temperature, humidity, etc.), and traffic features (speed ratio and jam factor). 3. We have demonstrated that it is possible to transfer the machine learning models we have developed in this project to other teams and cities by using inductive transfer learning. We also showed that the performance of the macro energy prediction models can be improved using a multi-task learning approach where the learning parameters are shared between the models being developed for different vehicle types. The advantage of this approach is improved learning performance as the models can exploit common spatio-temporal and environmental characteristics. 4. Finally, we have developed trip and vehicle assignment and scheduling algorithms that use the energy prediction models and develop a trip to vehicle type (diesel, electric, hybrid) assignment for the whole operation to reduce overall emissions and cost. We have shown through simulations that the proposed algorithms can save $\$$ 48,910 in energy costs and 175 metric tons of CO 2 emission annually for CARTA.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗