Search NASA⌕ Search

SEARCH · Search NASA

Results for “task decomposition”

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 109 records · Page 6

Bundle Networks: Fiber Bundles, Local Trivializations, and a Generative Approach to Exploring Many-to-one Maps

Many-to-one maps are ubiquitous in machine learning, from the image recognition model that assigns a multitude of distinct images to the concept of ``cat'' to the time series forecasting model which assigns a range of distinct time-series to a single scalar regression value. While the primary use of such models is naturally to associate correct output to each input, in many problems it is also useful to be able to explore, understand, and sample from a model's fibers, which are the set of input values x such that f(x) = y, for fixed y in the output space. In this paper we show that popular generative architectures are ill-suited to such tasks. Motivated by this we introduce a novel generative architecture, a Bundle Network, based on the concept of a fiber bundle from (differential) topology. BundleNets exploit the idea of a local trivialization wherein a space can be locally decomposed into a product space that cleanly encodes the many-to-one nature of the map. By enforcing this decomposition in BundleNets and by utilizing state-of-the-art invertible components, investigating a network's fibers becomes natural.

Courts, Nicolas C.↗

Solving a Large Scale Thermal Radiation Problem Using an Interoperable Executive Library Framework on Petascale Supercomputers

We present a novel methodology to compute the transient thermal condi- tion of a set of objects in an open space environment. The governing energy equa- tion and the convective energy transfer are solved by the sparse iterative solvers. The average radiating energy on a set of surfaces is represented by a linear system of the radiosity equations, which is factorized by an out-of-core parallel Cholesky decomposition solver. The coupling and interplay of the direct radiosity solver us- ing GPUs and the CPU-based sparse solver are handled by a light weight software integrator called Interoperable Executive Library (IEL). IEL manages the distribu- tion of data and memory, coordinates communication among parallel processes, and also directs execution of the set of loosely coupled physics tasks as warranted by the thermal condition of the simulated object and its surrounding environment.

Wong, Kwai↗

Distance preserving machine learning for uncertainty aware accelerator capacitance predictions

Abstract Accurate uncertainty estimations are essential for producing reliable machine learning models, especially in safety-critical applications such as accelerator systems. Gaussian process models are generally regarded as the gold standard for this task; however, they can struggle with large, high-dimensional datasets. Combining deep neural networks with Gaussian process approximation techniques has shown promising results, but dimensionality reduction through standard deep neural network layers is not guaranteed to maintain the distance information necessary for Gaussian process models. We build on previous work by comparing the use of the singular value decomposition against a spectral-normalized dense layer as a feature extractor for a deep neural Gaussian process approximation model and apply it to a capacitance prediction problem for the High Voltage Converter Modulators in the Oak Ridge Spallation Neutron Source. Our model shows improved distance preservation and predicts in-distribution capacitance values with less than 1% error.

43 PARTICLE ACCELERATORS↗

Partial differential equations preconditioner resilient to soft and hard faults

We present a domain-decomposition-based preconditioner for the solution of partial differential equations (PDEs) that is resilient to both soft and hard faults. The algorithm reformulates the PDE as a sampling problem, followed by a solution update through data manipulation that is resilient to both soft and hard faults. This reformulation allows us to recast the problem as a set of independent tasks, and exploit data locality to reduce global communication. We discuss two different parallel implementations: (a) a single program multiple data (SPMD) version based on a one-to-one mapping between subdomain and MPI processes responsible for both state and computation; and (b) an asynchronous server–client implementation where all state information is held by the servers and clients are designed solely as computational units. We present a scalability comparison of both implementations under nominal conditions, showing efficiency within ~80% for up to 12,000 cores. We present a resilience analysis under different fault scenarios based on the server–client implementation. This framework provides resiliency to hard faults such that if a client crashes, it stops asking for work, and the servers simply distribute the work among all of the other clients alive. Erroneous subdomain solves (e.g. due to soft faults) appear as corrupted data, which is either rejected if that causes a task to fail, or is seamlessly filtered out during the regression stage through a suitable noise model. Three different types of faults are modeled: hard faults modeling nodes (or clients) crashing; soft faults occurring during the communication of the tasks between server and clients; and soft faults occurring during task execution. We demonstrate the resiliency of the approach for a 2D elliptic PDE, and explore the effect of the faults at various failure rates.

97 MATHEMATICS AND COMPUTING↗

How real-time cosmology can distinguish between different anisotropic models

We present a new analysis on how to distinguish between isotropic and anisotropic cosmological models based on tracking the angular displacements of a large number of distant quasars over an extended period of time, and then performing a multipole-vector decomposition of the resulting displacement maps. We find that while the GAIA mission operating at its nominal specifications does not have sufficient angular resolution to resolve anisotropic universes from isotropic ones using this method within a reasonable timespan of ten years, a next-generation GAIA-like survey with a resolution ten times better should be equal to the task. Distinguishing between different anisotropic models is however more demanding. Keeping the observational timespan to ten years, we find that the angular resolution of the survey will need to be of order 0.1 μas in order for certain rotating anisotropic models to produce a detectable signature that is also unique to models of this class. However, should such a detection become possible, it would immediately allow us to rule out large local void models.

79 ASTRONOMY AND ASTROPHYSICS↗

ExaTN

A challenging scientific problem that will benefit from exascale computing is predictive simulation of two- and three-dimensional quantum many-body Hamiltonians in condensed matter physics, together with the related strong entanglement problems in quantum chemistry and quantum computing. Efficient numerical simulations will require new insights into wavefunction compression algorithms that scale on extremely heterogeneous HPC architectures. To address this need, we propose to develop a scalable math library of parallel multi-linear algebraic numerical primitives for hierarchical tensor compression. Our library will subsequently be used for building an efficient, performance-portable HPC framework for simulating strongly correlated quantum systems. In particular, our will will be the first to deliver a massively parallel implementation of the multiscale entanglement renormalization ansatz (MERA), a hierarchical tensor decomposition quantum scheme capable of expressing local expectation values of strongly entangled higher-dimensional quantum systems efficiently. To address the extreme complexity and high computational cost of such schemes, we will automate their parallel implementation by delivering an integrated software framework, ExaTN (Exascale Tensor Networks), that will process hierarchical tensor representations on exascale HPC systems via an asymchronous task-based programming model. As a specific application, our framework will provide scientists with a capability of simulating strongly entangled quantum systems, thus positioning ORNL as a strategic leader in modeling of strongly correlated materials.

McCaskey, AlexanderJ↗

FleCSPH notes

FleCSI is a compile-time con gurable framework designed to support multi-physics application development. As such, FleCSI provides a very general set of infrastructure design patterns that can be specialized and extended to suit the needs of a broad variety of solver and data requirements. FleCSI currently supports multi-dimensional mesh topology, geometry, and adjacency information, as well as n-dimensional hashed-tree data structures, graph partitioning interfaces, and dependency closures. FleCSI introduces a functional programming model with control, execution, and data abstractions that are consistent both with MPI and with state-of-the-art, task-based runtimes such as Legion and Charm++. The abstraction layer insulates developers from the underlying runtime, while allowing support for multiple runtime systems including conventional models like asynchronous MPI. The intent is to provide developers with a concrete set of user-friendly programming tools that can be used now, while allowing exibility in choosing runtime implementations and optimization that can be applied to future architectures and runtimes. FleCSI's control and execution models provide formal nomenclature for describing poorly understood concepts such as kernels and tasks. FleCSI's data model provides a low-buy-in approach that makes it an attractive option for many application projects, as developers are not locked into particular layouts or data structure representations. FleCSI currently provides a parallel but not distributed implementation of Binary, Quad and Oct-tree topology. This implementation is base on space lling curves domain decomposition, the Morton order. The current FleCSI version requires the implementation of a driver and a specialization driver. The role of the specialization driver is to provide the data distribution. This feature is not complete in FleCSI code and we provide it. The next step will be to incorporate it directly from FleCSPH to FleCSI as we reach a good level of performance. Then the driver represent the general execution of the resolution without worrying of the data locality and communications. As FleCSI is an On-Development code the structure may change in the future and we keep track of these changes in FleCSPH.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Radioisotope identification method for poorly resolved gamma-ray spectrum of nuclear security concern

Gamma-ray signal can be used as a fingerprint for radioisotope identification. In the context of radioactive and nuclear materials security at the border control point, the detection task can present a significant challenge due to various constraints such as the limited measurement time, the shielding conditions, and the noise interference. This study proposes a novel method to identify the signal of one or several radioisotopes from a poorly resolved gamma-ray spectrum. In this method, the noise component in the raw spectrum is reduced by the wavelet decomposition approach, and the removal of the continuum background is performed using the baseline determination algorithm. Finally, the identification of radioisotope is completed using the matrix linear regression method. The proposed method has been verified by experiments using the poorly resolved gamma-ray signals from various scenarios including single source, mixing of natural uranium with five of the most common industrial radioactive sources (57Co, 60Co, 133Ba, 137Cs, and 241Am). The preliminary results show that the proposed algorithm is comparable with the commercial method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simplified Predictive Models for CO 2 Sequestration Performance Assessment: Research Topical Report on Task #4 - Reduced-Order Method (ROM) Based Models

Reduced-order models provide a means for greatly accelerating the detailed simulations that will be required to manage CO 2 storage operations. In this work, we investigate the use of one such method, POD-TPWL, which has previously been shown to be effective in oil reservoir simulation problems. This method combines trajectory piecewise linearization (TPWL), in which the solution to a new (test) problem is represented through a linearization around the solution to a previously-simulated (training) problem, with proper orthogonal decomposition (POD), which enables solution states to be expressed in terms of a relatively small number of parameters. We describe the application of POD-TPWL for CO 2 -water systems simulated using a compositional procedure. Stanford’s Automatic Differentiation-based General Purpose Research Simulator (AD-GPRS) performs the full-order training simulations and provides the output (derivative matrices and system states) required by the POD-TPWL method. A new POD-TPWL capability introduced in this work is the use of horizontal injection wells that operate under rate (rather than bottom-hole pressure) control. Simulation results are presented for CO 2 injection into a synthetic aquifer and into a simplified model of the Mount Simon formation. Test cases involve the use of time-varying well controls that differ from those used in training runs. Results of reasonable accuracy are consistently achieved for relevant well quantities. Runtime speedups of around a factor of 370 relative to full- order AD-GPRS simulations are achieved, though the preprocessing needed for POD-TPWL model construction corresponds to the computational requirements for about 2.3 full-order simulation runs. A preliminary treatment for POD-TPWL modeling in which test cases differ from training runs in terms of geological parameters (rather than well controls) is also presented. Results in this case involve only small differences between training and test runs, though they do demonstrate that the approach is able to capture basic solution trends. The impact of some of the detailed numerical treatments within the POD-TPWL formulation is considered in an Appendix.

Mishra, Srikanta↗

Build Optimization Software Tools (BOOST) v2.0.0

Build Optimization Software Tools (BOOST) accelerate the design of DNA, RNA and protein sequences for their synthesis and assembly in an automated and scalable fashion. The BOOST Juggler automates the following two design tasks: - Reverse-Translation of protein sequences into DNA sequences - Codon Juggling of DNA sequences The BOOST Polisher provides the following design tasks: - The Verification of DNA sequences against DNA synthesis constraints - The Modification of DNA sequences in case they violate any DNA synthesis constraint In addition, the BOOST Polisher can be instructed to verify and modify DNA sequences against sequence patterns, such as restriction sites. The BOOST Partitioner supports both Gibson/chewback and Yeast assembly (also known as Transformation-Associated Recombination, or TAR) methods when performing the decomposition of large sequences that exceed the maximum length of DNA synthesis into synthesizable building blocks. The Partitioner can be instructed to find building blocks with appropriate overlap sequences, making their assembly into the complete construct more efficient. BOOST Workflows enable, in a customized fashion, the execution of the Juggler, Polisher, and Partitioner tools on a batch of sequences.

Sharkey, Michael↗

Identifying human failure events (HFEs) for external hazard probabilistic risk assessment

In recent years, several advancements in nuclear power plant (NPP) probabilistic risk assessment (PRA) have been driven by increased understanding of external hazards, plant response, and uncertainties. However, major sources of uncertainty associated with external hazard PRA remain. One important source is how risk-significant human actions that are carried out to enable plant response and recovery from natural hazards cause the close coupling of physical impacts on plants and overall plant risk during these hazard events. This makes human reliability and human-plant interactions important elements to consider in resolving PRA gaps in external hazards. One of the challenges in considering human response in external hazard probabilistic risk assessment (XHPRA) is that most existing human reliability analysis (HRA) models were not developed for assessing actions outside the control room (termed ex-control room actions) and hazard response. To support this new scope, HRA models will need to be developed or modified to support identification of human activities, causal factors, and uncertainties inherent in external hazard response, thereby providing insights regarding event timing and physical event conditions as they relate to human performance. In this study, there are two main objectives: (1) evaluate the applicability of an existing cognitive-based HRA method, Phoenix, to ex-control room actions, and (2) identify sources of uncertainty to be characterized or reduced in order to make this method suitable for XHPRA. The first step of such work is performed by assessing the suitability of existing HRA methods to support identifying human failure events (HFEs) for human response to flooding hazards. These HFEs are human actions or inactions that are involved in human responses to flooding hazards and could contribute to the loss of a critical function for the plant in the scenario being examined. Here, in this work, decomposition analyses using the cognitive-based Phoenix HRA model are used to identify HFEs. The Phoenix method was found to be suitable for analyzing ex-control room actions as well as identifying specific HFEs and underlying crew failure modes (CFMs). However, the method's suitability for use in ex-control room actions would benefit from expanding the available CFMs to accommodate a larger variety of physical and communication tasks.

42 ENGINEERING↗

Nanoscopic Imaging of Self-Propelled Ultrasmall Catalytic Nanomotors

Ultrasmall nanomotors (<100 nm) are highly desirable nanomachines for their size-specific advantages over their larger counterparts in applications spanning nanomedicine, directed assembly, active sensing, and environmental remediation. While there are extensive studies on motors larger than 100 nm, the design and understanding of ultrasmall nanomotors have been scant due to the lack of high-resolution imaging of their propelled motions with orientation and shape details resolved. Here, we report the imaging of the propelled motions of catalytically powered ultrasmall nanomotors─hundreds of them─at the nanometer resolution using liquid-phase transmission electron microscopy. These nanomotors are Pt nanoparticles of asymmetric shapes (“tadpoles” and “boomerangs”), which are colloidally synthesized and observed to be fueled by the catalyzed decomposition of NaBH4 in solution. Statistical analysis of the orientation and position trajectories of fueled and unfueled motors, coupled with finite element simulation, reveals that the shape asymmetry alone is sufficient to induce local chemical concentration gradient and self-diffusiophoresis to act against random Brownian motion. Our work elucidates the colloidal design and fundamental forces involved in the motions of ultrasmall nanomotors, which hold promise as active nanomachines to perform tasks in confined environments such as drug delivery and chemical sensing.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

IR spectral assignments for the hydrated excess proton in liquid water

The local environmental sensitivity of infrared (IR) spectroscopy to a hydrogen-bonding structure makes it a powerful tool for investigating the structure and dynamics of excess protons in water. Although of significant interest, the line broadening that results from the ultrafast evolution of different solvated proton-water structures makes the assignment of liquid-phase IR spectra a challenging task. In this paper, we apply a normal mode analysis using density functional theory of thousands of proton-water clusters taken from reactive molecular dynamics trajectories of the latest generation multistate empirical valence bond proton model (MS-EVB 3.2). These calculations are used to obtain a vibrational density of states and IR spectral density, which are decomposed on the basis of solvated proton structure and the frequency dependent mode character. Decompositions are presented on the basis of the proton sharing parameter δ, often used to distinguish Eigen and Zundel species, the stretch and bend character of the modes, the mode delocalization, and the vibrational mode symmetry. We find there is a wide distribution of vibrational frequencies spanning 1200-3000 cm -1 for every local proton configuration, with the region 2000-2600 cm -1 being mostly governed by the distorted Eigen-like configuration. Finally, we find a continuous red shift of the special-pair O∙∙∙H + ∙∙∙O stretching frequency, and an increase in the flanking water bending intensity with decreasing δ. Also, we find that the flanking water stretch mode of the Zundel-like species is strongly mixed with the flanking water bend, and the special pair proton oscillation band is strongly coupled with the bend modes of the central H 5 O 2 + moiety.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Nonnegative tensor decomposition with custom clustering for microphase separation of block copolymers

High–dimensional datasets are becoming ubiquitous in many applications and therefore unsupervised tensor methods to interrogate them are needed. Here, we report a new unsupervised machine learning (ML) approach (NTFk) based on nonnegative tensor factorization integrated with a custom k–means clustering. We demonstrate the ability of NTFk to extracting temporal and spatial features of phase separation of copolymers as they are modeled by self–consistent field theory. Microphase separation of block copolymers has been extensively studied both experimentally and theoretically. However, the interpretation of computer simulations and/or experimental data, representing temporal and spatial changes of molecular species concentration is still a challenging task. Thus, extracting the phase diagram from simulations or experimental data as well as the interpretation of data requires discernment of the model/experimental parameters (such as, temperature, concentrations, the number of molecular species and the interaction between species) impact on the microphase separation process. An attractive and unique aspect of the introduced ML method is that it ensures the nonnegativity of the extracted latent features. Nonnegativity is an essential constraint needed to obtain interpretable and sparse latent features that are parts–based representation of the data. The custom clustering in NTFk serves to estimate the number of latent features in the data.

97 MATHEMATICS AND COMPUTING↗

Spinning metasurface stack for spectro-polarimetric thermal imaging

Spectro-polarimetric imaging in the long-wave infrared (LWIR) region plays a crucial role in applications from night vision and machine perception to trace gas sensing and thermography. However, the current generation of spectro-polarimetric LWIR imagers suffers from limitations in size, spectral resolution, and field of view (FOV). While meta-optics-based strategies for spectro-polarimetric imaging have been explored in the visible spectrum, their potential for thermal imaging remains largely unexplored. In this work, we introduce an approach for spectro-polarimetric decomposition by combining large-area stacked meta-optical devices with advanced computational imaging algorithms. The co-design of a stack of spinning dispersive metasurfaces along with compressive sensing and dictionary learning algorithms allows simultaneous spectral and polarimetric resolution without the need for bulky filter wheels or interferometers. Our spinning-metasurface-based spectro-polarimetric stack is compact (<10×10×10cm) and robust, and it offers a wide field of view (20.5°). We show that the spectral resolving power of our system substantially enhances performance in machine learning tasks such as material classification, a challenge for conventional panchromatic thermal cameras. Our approach represents a significant advance in the field of thermal imaging for a wide range of applications including heat-assisted detection and ranging (HADAR).

Optics↗

Tropical Cyclone Super Resolution using conditional diffusion denoising probabilistic model from mesoscale simulation to LES

Accurate modeling of tropical cyclone wind fields is essential for the design, risk assessment, and operational planning of offshore energy infrastructure. While mesoscale simulations are widely used thanks to their computational efficiency, they lack the necessary resolution to capture key features such as wind shear and veer profiles as well as the distribution turbulent kinetic energy (TKE). High-fidelity large-eddy simulation (LES) models on the other hand, can resolve turbulent structures and provide a more accurate representation of the complex wind field, albeit at a higher computational cost. To address this modeling gap, we introduce a two-part generative framework to enhance the resolution and physics-capturing ability of mesoscale simulations. First, a reduced-order model based on Karhunen–Loève (KL) decomposition is used to extract dominant spatial modes from one-dimensional mean wind profiles. A multilayer perceptron (MLP) is trained to map mesoscale mode weights to their LES counterparts, enabling accurate reconstruction of vertical velocity profiles. Second, a conditional Diffusion Denoising Probabilistic Model (DDPM) is developed to super-resolve coarse and low-fidelity mesoscale velocity fields, recovering fine-scale turbulence structures and stress distributions. The framework is evaluated across different tropical cyclone intensity categories defined by the Saffir–Simpson scale and demonstrates strong performance in both interpolation and extrapolation tasks. The generated fields accurately reproduce spatial coherence, stress distributions, and spectral energy characteristics observed in LES data. By bridging the fidelity gap between mesoscale and LES outputs, this approach offers a scalable, data-driven solution for enhancing the representation of tropical cyclone wind fields, enabling more robust offshore energy infrastructure systems design in tropical-cyclone-prone areas.

17 WIND ENERGY↗

HiPACE++: A portable, 3D quasi-static particle-in-cell code

Modeling plasma accelerators is a computationally challenging task and the quasi-static particle-in-cell algorithm is a method of choice in a wide range of situations. In this work, we present the first performance-portable, quasi-static, three-dimensional particle-in-cell code HiPACE++. By decomposing all the computation of a 3D domain in successive 2D transverse operations and choosing appropriate memory management, HiPACE++ demonstrates orders-of-magnitude speedups on modern scientific GPUs over CPU-only implementations. The 2D transverse operations are performed on a single GPU, avoiding time-consuming communications. The longitudinal parallelization is done through temporal domain decomposition, enabling near-optimal strong scaling from 1 to 512 GPUs. HiPACE++ is a modular, open-source code enabling efficient modeling of plasma accelerators from laptops to state-of-the-art supercomputers.

97 MATHEMATICS AND COMPUTING↗