Search NASA⌕ Search

SEARCH · Search NASA

Results for “Handling”

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 289 records · Page 16

A scoping study of far-SOL main-wall protection limiters for steady-state operation of compact pilot plant tokamaks

We present a novel method for handling steady-state heat fluxes incident on the main wall of pilot plant-scale magnetic fusion devices, based on the utilization of protection limiters in the far scrape-off layer (SOL). This method helps avoid large plasma-wall gaps, without excessively compromising blanket performance. We present an optimization algorithm for determining the appropriate size and scale of these protection limiters given (1) probability distributions of SOL plasma parameters and (2) assumed risk tolerance. As part of this optimization, we have developed an analytic description of parallel heat fluxes across limiter shadows, and an objective cost function (the ‘Far-SOL Marginal Cost’) to quantify the impact that different main-wall thermal management design choices have on reactor capital cost. Applying the model to a midscale fusion pilot plant concept shows that making use of far-SOL protection limiters can reduce capital costs on the order of $500 M, relative to naively increasing the plasma-wall gap. Our analysis demonstrates that the far-SOL power decay length is the highest-leverage plasma assumption for thermal loading of the first wall, and the primary cost driver for main wall thermal management. The relative cost efficiency of protection limiters increases as assumptions on the far-SOL heat flux become more pessimistic. The concepts described in this paper motivate the further development of far-SOL protection limiters as part of larger efforts to design economical core-edge-wall compatible solutions for a fusion pilot plant.

Design under uncertainty↗

Preliminary proof-of-concept of real-time divertor heat flux control from infrared cameras with nitrogen injection in the DIII-D tokamak

In future tokamak reactors like ITER and the Fusion Pilot Plant (FPP), real-time feedback control of heat flux to the plasma-facing components (PFC) will be critical for steady-state operation. This work presents the first experimental demonstration of real-time divertor heat flux estimation with infrared thermography and feedback control with impurity seeding on the DIII-D tokamak. The flexible infrastructure of the Plasma Control System (PCS) on DIII-D makes this new capability possible. The PCS software runs on a gateway computer system, and five real-time compute nodes. An array of low latency streaming digitizers from D-TACQ Solutions connects to these real-time computers to collect and process data, and send commands to actuators during plasma discharges. This system handles the signal IO from the tokamak and allows the PCS to utilize the diagnostic data necessary to perform control in real-time. Feedback control on heat flux was accomplished by feeding infrared camera data from the “Infrared TV” (IRTV) camera to a custom-developed User Datagram Protocol (UDP) server. This server transmits infrared data to a newly developed PCS algorithm that estimates the heat flux to PFC. Here, a proportional integral derivative (PID) controller minimizes the error between a heat flux reference and the real-time estimate by injecting nitrogen gas into the divertor.

Algorithm development↗

Optical diagnostic design for measuring the radiation front with a mid-leg pumped divertor on DIII-D

The design of an optical diagnostic system to localize the radiation front in a mid-leg pumped divertor configuration on DIII-D is presented. Divertor detachment is a key mechanism for handling power exhaust in tokamaks, and mid-leg pumping offers a promising approach to radiatively dissipate power while maintaining acceptable core performance. To predict the location of the radiation front and design a spectroscopic diagnostic to measure its position, a database of SOLPS-ITER simulations across a range of input powers and gas puffing rates representative of DIII-D operation was employed. These simulations provide self-consistent plasma backgrounds for a Cherab-Raysect synthetic diagnostic framework, which incorporates detailed tokamak geometry and physically accurate ray-tracing. Synthetic simulations of optical sightlines and viewing cone geometry were used to calculate line-integrated emission from the plasma, particularly of the C III 465 nm line, to serve as a proxy for the T e ≈ 7 − 10 eV temperature region associated with the onset and evolution of divertor detachment. Neutral deuterium emission is also evaluated for comparison. The synthetic diagnostic is used to assess the performance of existing DIII-D optical systems, including filterscopes and the Multichord Divertor Spectrometer, and to optimize line-of-sight placement within mechanical and installation constraints. The results provide quantitative guidance for diagnostic implementation on DIII-D and demonstrate the advantage of integrated synthetic diagnostics for divertor design studies and future advanced divertor concepts.

Cherab↗

Efficient distributed continual learning for steering experiments in real-time

Deep learning has emerged as a powerful method for extracting valuable information from large volumes of data. However, when new training data arrives continuously (i.e., is not fully available from the beginning), incremental training suffers from catastrophic forgetting (i.e., new patterns are reinforced at the expense of previously acquired knowledge). Training from scratch each time new training data becomes available would result in extremely long training times and massive data accumulation. Rehearsal-based continual learning has shown promise for addressing the catastrophic forgetting challenge, but research to date has not addressed performance and scalability. To fill this gap, we propose an approach based on a distributed rehearsal buffer that efficiently complements data-parallel training on multiple GPUs to achieve high accuracy, short runtime, and scalability. It leverages a set of buffers (local to each GPU) and uses several asynchronous techniques for updating these local buffers in an embarrassingly parallel fashion, all while handling the communication overheads necessary to augment input minibatches using unbiased, global sampling. We further propose a generalization of rehearsal buffers to support both classification and generative learning tasks, as well as more advanced rehearsal strategies (notably Dark Experience Replay, leveraging knowledge distillation). We illustrate this approach with a real-life HPC streaming application from the domain of ptychographic image reconstruction. Furthermore, we run extensive experiments on up to 128 GPUs of the ThetaGPU supercomputer to compare our approach with baselines representative of training-from-scratch (the upper bound in terms of accuracy) and incremental training (the lower bound). Results show that rehearsal-based continual learning achieves a top-5 validation accuracy close to the upper bound, while simultaneously exhibiting a runtime close to the lower bound.

Asynchronous data management↗

A survey on checkpointing strategies: Should we always checkpoint à la Young/Daly?

The Young/Daly formula provides an approximation of the optimal checkpointing period for a parallel application executing on a supercomputing platform. It was originally designed to handle fail-stop errors for preemptible tightly-coupled applications, but has been extended to other application and resilience frameworks. Here, we provide some background and survey various scenarios to assess the usefulness and limitations of the formula, both for preemptible applications and workflow applications represented as a graph of tasks. We also discuss scenarios with uncertainties, and extend the study to silent errors. We exhibit cases where the optimal period is of a different order than that dictated by the Young/Daly formula, and finally we explain how checkpointing can be further combined with replication.

97 MATHEMATICS AND COMPUTING↗

CG-Kit: Code Generation Toolkit for performant and maintainable variants of source code applied to Flash-X hydrodynamics simulations

CG-Kit is a new Code Generation tool-Kit that we have developed as a part of the solution for portability and maintainability for multiphysics computing applications. The development of CG-Kit is rooted in the urgent need created by the shifting landscape of high-performance computing platforms and the algorithmic complexities of a particular large-scale multiphysics application: Flash-X. To efficiently use computing resources on a heterogeneous node, an application must have a map of computation to resources and a mechanism to move the data and computation to the resources according to the map. Most existing performance portability solutions are focussed on abstracting the expression of computations so that a unified source code can be specialized to run on different resources. However, such an approach is insufficient for a code like Flash-X, which has a multitude of code components that can be assembled in various permutations and combinations to form different instances of applications. Similar challenges apply to any code that has composability, where a single specified way of apportioning work among devices may not be optimal. Additionally, use cases arise where the optimal control flow of computation may differ for different devices while the underlying numerics remain identical. This combination leads to unique challenges including handling an existing large code base in Fortran and/or C/C++, subdivision of code into a great variety of units supporting a wide range of physics and numerical methods, different parallelization techniques for distributed and shared memory systems and accelerator devices, and heterogeneity of computing platforms requiring coexisting variants of parallel algorithms. All of these challenges demand that scientific software developers apply existing knowledge about domain applications, algorithms, and computing platforms to determine custom abstractions and granularity for code generation. There is a critical lack of tools to tackle those problems. CG-Kit is designed to fill this gap by providing a user with the ability to express their desired control flow and computation-to-resource map in the form a pseudocode-like recipe. It consists of standalone tools that can be combined into highly specific and, we argue, highly effective portability and maintainability toolchains. Here we present the design of our new tools: parametrized source trees, control flow graphs, and recipes. The tools are implemented in Python. They are agnostic to the programming language of the source code targeted for code generation. In conclusion, we demonstrate the capabilities of the toolkit with two examples, first, multithreaded variants of the basic AXPY operation, and second, variants of parallel algorithms within a hydrodynamics solver, called Spark, from Flash-X that operates on block-structured adaptive meshes.

Algorithmic portability↗

Time-Varying Output Delay Compensation-A Model-Free Approach and its Application on Cooperative On-Ramp Merging

This paper presents a model-free approach to compensate for time-varying output delay in networked control systems. The proposed architecture combines a model-free observer and the Smith predictor. The model-free observer estimates the current state while handling modeling errors and uncertainties of the system. The Smith predictor moves the effect of time delay outside the control closed-loop using the estimated delayed output and the actual output of the plant. The proposed method is applied to a cooperative on-ramp merging problem. First, an ultra-local model predictive control is implemented to provide a computationally efficient online speed planner agnostic to the vehicle dynamics. After that, a model-free observer is designed to estimate the current state. Finally, the proposed architecture is tested against a time-varying output delay with an upper bound of 200 milliseconds. The results demonstrate the effectiveness of the proposed method with improved tracking of intervehicle distance.

Waleed khan, Muhammad [The University of Texas at ↗

A phase-field diffraction model for thermo-hydro-mechanical propagating fractures

This paper introduces a novel diffraction based thermo-hydraulic–mechanical (THM) model for fracture propagation using a phase-field fracture (PFF) approach. The key innovation of the THM-PFF model lies in its integrated treatment of four solution variables—displacements, phase-field, pressure, and temperature—each governed by a combination of conservation of momentum (mechanics problem), a variational inequality (constrained minimization problem), mass conservation (pressure problem), and energy conservation (temperature problem). This leads to a new formulation of a coupled variational inequality system. A major advancement is the development of an extended fixed-stress algorithm, where displacements, phase-field, pressures, and temperatures are solved in a staggered sequence. An important aspect of this work is the global coupling of pressures and temperatures across the domain using diffraction systems, with diffraction coefficients defined by material parameters weighted by the diffusive phase-field variable. To ensure robust local mass conservation, we employ enriched Galerkin finite elements (EG) for both pressure and temperature diffraction equations. By enriching the continuous Galerkin basis functions with discontinuous piecewise constants, EG accurately represents solution and parameter discontinuities while preserving local mass and energy conservation—crucial aspects for THM problems and realistic behavior. Moreover, the use of a predictor–corrector local mesh adaptivity scheme is employed, allowing the model to handle small phase-field length-scale parameters while maintaining high numerical accuracy and reasonable computational cost. Furthermore, these new model and algorithmic developments represent significant advances in the field and have been substantiated through rigorous numerical tests.

Diffraction systems↗

Leveraging large language models to automate the identification of healthcare access barriers for veterans

Objective: To develop and evaluate an automated system for identifying healthcare barriers focusing on transportation issues in veterans’ clinical notes using large language models (LLMs) and to assess the impact of different prompting strategies on classification performance and explanation consistency. Methods: We developed a hybrid system combining pattern matching for templated notes with LLM analysis for free-text notes. Using 2000 manually annotated clinical notes, we compared four prompting strategies (dual-role short, dual-role long, analysis-first, analysis-only) across Mistral-7B and Llama-3.1 models. We evaluated classification performance using standard metrics and assessed explanation consistency through embedding similarity analysis. Results: The analysis-first strategy achieved superior performance, with Mistral-7B reaching an F1 score of 0.914, outperforming traditional machine learning approaches (GBM: 0.786, BERT: 0.811). LLMs demonstrated higher explanation consistency within models (mean cosine similarity 0.887–0.908) compared to cross-model similarities (0.767–0.872). Pattern matching successfully handled 6.7% of templated notes deterministically. Mistral-7B showed greater internal consistency but higher abstention rates compared to Llama-3.1. Conclusion: Requiring LLMs to analyze evidence before classification improves both accuracy and explanation consistency for identifying transportation barriers in clinical notes. This approach enables automated barrier detection at scale while providing clinically relevant explanations, supporting both population-level healthcare planning and individual patient care decisions.

Healthcare access barriers↗

CFD unified approach under Eulerian–Lagrangian framework for methanol and gasoline direct injection sprays in evaporative and flash boiling conditions

Innovative synthetic fuels for advanced propulsion systems, such as methanol and ammonia, and synthetic blended fuels (E00, E10, and E30), known for their high volatility, are often injected directly into combustion chambers. It follows that Eulerian–Lagrangian spray models need to accurately capture the spray collapse as a consequence of flash boiling onset and be capable of proficiently handling the preferential evaporation of multi-component fuels in evaporative scenarios. So, we performed the assessment of an Eulerian–Lagrangian CFD code for simulating methanol and E00 gasoline blend sprays in both early and late injection conditions involving flash boiling conditions and preferential evaporation. The adoption of an effervescent breakup model and of a non-equilibrium phase transition model for the discrete phase allows the adoption of a setup that is almost completely free from specific constant tuning, especially for what concerns the breakup model. We validated the simulations using experimental PLV maps of methanol and E00 sprays issued from the ECN Spray M injector. The results highlight a significantly different morphology of the methanol spray compared to the E00 one under late injection conditions. Under stratified combustion, low-volatile fuels are likely to be ignited first, and the flame propagates toward the high-volatile fuels. In conclusion, the spray collapse was also correctly reproduced, inducing the presence of a low-pressure zone and modifying the spray morphology.

E00↗

A non-isothermal breakage-damage model for plastic-bonded granular materials incorporating temperature, pressure, and rate dependencies

Plastic-bonded granular materials (PBM) are widely used in industrial sectors, including building construction, abrasive applications, and defense applications such as plastic-bonded explosives. The mechanical behavior of PBM is highly nonlinear, irreversible, rate dependent, and temperature sensitive governed by various micromechanical attributions such as grain crushing and binder damage. This paper presents a thermodynamically consistent, microstructure-informed constitutive model to capture these characteristic behaviors of PBM. Key features of the model include a breakage internal variable to upscale the grain-scale information to the continuum level and to predict grain size evolution under mechanical loading. In addition, a damage internal state variable is introduced to account for the damage, deterioration, and debonding of the binder matrix upon loading. Temperature is taken as a fundamental external state variable to handle non-isothermal loading paths. The proposed model is able to capture with good accuracy several important aspects of the mechanical properties of PBM, such as pressure-dependent elasticity, pressure-dependent yield strength, brittle-to-ductile transition, temperature dependency, and rate dependency in the post-yielding regime. Furthermore, the model is validated against multiple published datasets obtained from confined and unconfined compression tests, covering various PBM compositions, confining pressures, temperatures, and strain rates.

Breakage↗

A hereditary integral, transient network approach to modeling permanent set and viscoelastic response in polymers

An efficient numerical framework is presented for modeling viscoelasticity and permanent set of polymers. It is based on the hereditary integral form of transient network theory, in which polymer chains belong to distinct networks each with different natural equilibrium states. Chains continually detach from previously formed networks and reattach to new networks in a state of zero stress. The free energy of these networks is given in terms of the deformation gradient relative to the configuration at which the network was born . A decomposition of the kernel for various free energies allows for a recurrence relationship to be established, bypassing the need to integrate over all time history. The technique is established for both highly compressible and nearly incompressible materials through the use of neo-Hookean, Blatz–Ko, Yeoh, and Ogden-Hill material models. Multiple examples are presented showing the ability to handle rate-dependent response and residual strains under complex loading histories.

Finite element method↗

Mapping wall-to-wall fractional cover of Arctic tundra plant functional types in Alaska using 20-m spatial resolution satellite imagery and harmonized plot observations

Estimates of fractional cover (fCover) across given land surfaces are used to assess, and often model, vegetation composition and diversity, which are crucial for understanding the health and functioning of terrestrial ecosystems. Remote sensing provides a useful means for scaling local, plot-measured fCover estimates to regional scales. Leveraging a recently synthesized and harmonized plot database, this study generated wall-to-wall maps of fCover for six Alaskan-Arctic plant functional types (PFT), including non-vascular plants, forbs, graminoids, and deciduous and evergreen shrubs, using 20-m satellite data (Sentinel-1, Sentinel-2, ArcticDEM) using a machine learning regression approach, specifically the random forest (RF) algorithm, which is well-suited for handling nonlinear relationships and high-dimensional satellite datasets. This study additionally addressed the spatio-temporal inconsistencies e.g., sampling scale, plot size, and collection year in plot measured fCover by adopting a multivariate outlier detection approach—Cook’s distance—to identify high-quality plots for model training and validation. Our approach achieves high accuracy (R 2 = 0.59–0.93, root mean squared errors = 0.02–0.10 for all PFTs) between plot-observed and satellite-derived fCover when using high-quality plot samples. The mapped fCover characterizes the spatial patterns of different PFTs across the tundra biome at a 20-m resolution, providing key information needed for improved representation of Arctic tundra vegetation in terrestrial biosphere models to better understand climate-vegetation feedback across the Arctic tundra.

Arctic tundra↗

An alcove at the acetyl-CoA synthase nickel active site is required for productive substrate CO binding and anaerobic carbon fixation

One of the seven natural CO 2 fixation pathways, the anaerobic Wood-Ljungdahl pathway (WLP) is unique in generating CO as a metabolic intermediate, operating through organometallic intermediates, and in conserving (versus utilizing) net ATP. The key enzyme in the WLP is acetyl-CoA synthase (ACS), which uses an active site [2Ni-4Fe-4S] cluster (A-cluster), a CO tunnel, and an organometallic (Ni-CO, Ni-methyl, and Ni-acetyl) reaction sequence to generate acetyl-CoA. Here, we reveal that an alcove, which interfaces the tunnel and the A-cluster, is essential for CO 2 fixation and autotrophic growth by the WLP. In vitro spectroscopy, kinetics, binding, and in vivo growth experiments reveal that a Phe229A substitution at one wall of the alcove decreases CO affinity thirty-fold and abolishes autotrophic growth; however, a F229W substitution enhances CO binding 80-fold. Our results indicate that the structure of the alcove is exquisitely tuned to concentrate CO near the A-cluster; protect ACS from CO loss during catalysis, provide a haven for inhibitory CO, and stabilize the tetrahedral coordination at the Nip site where CO binds. The directing, concentrating, and protective effects of the alcove explain the inability of F209A to grow autotrophically. The alcove also could help explain current controversies over whether ACS binds CO and methyl through a random or ordered mechanism. Our work redefines what we historically refer to as the metallocenter "active site". The alcove is so crucial for enzymatic function that we propose it is part of the active site. The community should now look for such alcoves in all "gas handling" metalloenzymes.

bacterial metabolism↗

A collision-based hybrid method for the BGK equation

In this article, we apply the collision-based hybrid method introduced by Hauck and McClarren to the Boltzmann equation with the BGK operator and a hyperbolic scaling. An implicit treatment of the source term is used to handle stiffness associated with the BGK operator. Although it helps the numerical scheme become stable with a large time step size, it is still not obvious to achieve the desired order of accuracy due to the relationship between the size of the spatial cell and the mean free path. Without asymptotic preserving property, a very restricted grid size is required to resolve the mean free path, which is not practical. Our approaches are based on the noncollision-collision decomposition of the BGK equation. We introduce the arbitrary order of nodal discontinuous Galerkin (DG) discretization in space with a semi-implicit time-stepping method; we employ the backward Euler time integration for the uncollided equation and the 2nd order predictor-corrector scheme for the collided equation, i.e., both source terms in uncollided and collided equations are treated implicitly and only streaming term in the collided equation is solved explicitly. This improves the computational efficiency without the complexity of the numerical implementation. Numerical results are presented for various Knudsen numbers to present the effectiveness and accuracy of our hybrid method. Also, we compare the solutions of the hybrid and non-hybrid schemes.

97 MATHEMATICS AND COMPUTING↗

Capturing thin structures in VOF simulations with two-plane reconstruction

A novel interface reconstruction strategy for volume of fluid (VOF) methods is introduced that represents the liquid-gas interface as two planes that co-exist within a single computational cell. In comparison to the piecewise linear interface calculation (PLIC), this new algorithm greatly improves the accuracy of the reconstruction, in particular when dealing with thin structures such as films. The placement of the two planes requires the solution of a non-linear optimization problem in six dimensions, which has the potential to be overly expensive. Further, an efficient solution to this optimization problem is presented here that exploits two key ideas: an algorithm for extracting multiple plane orientations from transported surface data, and an efficient and mass-conserving distance-finding algorithm that accounts for two planes with arbitrary orientation. Additionally, a simple and robust strategy is presented to accurately represent the surface tension forces produced at the interface of subgrid-thickness films. The performance of this new VOF reconstruction is demonstrated on several test cases that illustrate the capability to handle arbitrarily thin films.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neural chaos: A spectral stochastic neural operator

Building surrogate models for operators with uncertainty quantification capabilities is essential for many engineering applications where randomness–such as variability in material properties, boundary conditions, and initial conditions–is unavoidable. Polynomial Chaos Expansion (PCE) is widely recognized as a go-to method for constructing stochastic surrogates in both intrusive and non-intrusive ways, and it has recently been used in the context of operator learning. However, its application becomes challenging for complex or high-dimensional processes, as achieving accuracy requires higher-order polynomials, which can increase computational demand and/or the risk of overfitting. Furthermore, PCE requires specialized treatments to manage random variables that are not independent, and these treatments may be problem-dependent or may fail with increasing complexity. Here, in this work, we adopt the same formalism as the spectral expansion used in PCE; however, we replace the classical polynomial basis functions with neural network (NN) basis functions to leverage their expressivity. To achieve this, we propose an algorithm that identifies NN-parameterized basis functions in a purely data-driven manner, without any prior assumptions about the joint distribution of the random variables involved, whether independent or dependent, or about their marginal distributions. The proposed algorithm identifies each NN-parameterized basis function sequentially, ensuring they are orthogonal with respect to the data distribution. The basis functions are constructed directly on the joint stochastic variables without requiring a tensor product structure or assuming independence of the random variables. This approach may offer greater flexibility for complex stochastic models, while simplifying implementation compared to the tensor product structures typically used in PCE to handle random vectors. This is particularly advantageous given the current state of open-source packages, where building and training neural networks can be done with just a few lines of code and extensive community support. We demonstrate the effectiveness of the proposed scheme through several numerical examples of varying complexity and provide comparisons with classical PCE.

Polynomial chaos expansion↗

A fourth order sharp immersed method for the incompressible Navier-Stokes equations with stationary and moving boundaries and interfaces

We propose a fourth order Navier-Stokes solver based on the immersed interface method (IIM), for flow problems with stationary and one-way coupled moving boundaries and interfaces. Our algorithm employs a Runge-Kutta-based projection method that maintains high-order temporal accuracy in both velocity and pressure for steady and unsteady velocity boundary conditions. Fourth order spatial accuracy is achieved through a novel fifth order IIM discretization scheme for the advection term, as well as existing high-order interface-corrected finite difference schemes for the other differential operators. Using a set of manufactured flow problems with stationary and moving boundaries, we demonstrate fourth order convergence of velocity and pressure in the infinity norm, both inside the domain and on the immersed boundaries. The solver’s performance is further validated through a range of practical flow simulations, highlighting its efficiency over a second order scheme. Finally, we showcase the ability of our immersed discretization scheme to handle interface-coupled multiphysics problems by solving a conjugate heat transfer problem with multiple immersed solids. Overall, the proposed approach robustly combines the efficiency of high order discretization schemes with the flexibility of immersed discretizations for flow problems with complex, moving boundaries and interfaces.

42 ENGINEERING↗