Search NASA⌕ Search

SEARCH · Search NASA

Results for “Adaptable”

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 1,603 records · Page 89

SU-G-BRA-12: Development of An Intra-Fractional Motion Tracking and Dose Reconstruction System for Adaptive Stereotactic Body Radiation Therapy in High-Risk Prostate Cancer

Purpose: A clinical trial on stereotactic body radiation therapy (SBRT) for high-risk prostate cancer is undergoing at our institution. In addition to escalating dose to the prostate, we have increased dose to intra-prostatic lesions. Intra-fractional prostate motion deteriorates well planned radiation dose, especially for the small intra-prostatic lesions. To solve this problem, we have developed a motion tracking and 4D dose-reconstruction system to facilitate adaptive re-planning. Methods: Patients in the clinical trial were treated with VMAT using four arcs and 10 FFF beam. KV triggered x-ray projections were taken every 3 sec during delivery to acquire 2D projections of 3D anatomy at the direction orthogonal to the therapeutic beam. Each patient had three implanted prostate markers. Our developed system first determined 2D projection locations of these markers and then 3D prostate translation and rotation via 2D/3D registration of the markers. Using delivery log files, our GPU-based Monte Carlo tool (goMC) reconstructed dose corresponding to each triggered image. The calculated 4D dose distributions were further aggregated to yield the delivered dose. Results: We first tested each module in our system. MC dose engine were commissioned to our treatment planning system with dose difference of <0.5%. For motion tracking, 1789 kV projections from 7 patients were acquired. The 2D marker location error was <1 mm. For 3D motion tracking, root mean square (RMS) errors along LR, AP, and CC directions were 0.26mm, 0.36mm, and 0.01mm respectively in simulation studies and 1.99mm, 1.37mm, and 0.22mm in phantom studies. We also tested the entire system workflow. Our system was able to reconstruct delivered dose. Conclusion: We have developed a functional intra-fractional motion tracking and 4D dose re-construction system to support our clinical trial on adaptive high-risk prostate cancer SBRT. Comprehensive evaluations have shown the capability and accuracy of our system.

60 APPLIED LIFE SCIENCES↗

WE-H-207B-04: Strategies for Adaptive RT

In recent years, steady progress has been made towards the implementation of MRI in external beam radiation therapy for processes ranging from treatment simulation to in-room guidance. Novel procedures relying mostly on MR data are currently implemented in the clinic. This session will cover topics such as (a) commissioning and quality control of the MR in-room imagers and simulators specific to RT, (b) treatment planning requirements, constraints and challenges when dealing with various MR data, (c) quantification of organ motion with an emphasis on treatment delivery guidance, and (d) MR-driven strategies for adaptive RT workflows. The content of the session was chosen to address both educational and practical key aspects of MR guidance. Learning Objectives: Good understanding of MR testing recommended for in-room MR imaging as well as image data validation for RT chain (e.g. image transfer, filtering for consistency, spatial accuracy, manipulation for task specific); Familiarity with MR-based planning procedures: motivation, core workflow requirements, current status, challenges; Overview of the current methods for the quantification of organ motion; Discussion on approaches for adaptive treatment planning and delivery. T. Stanescu - License agreement with Modus Medical Devices to develop a phantom for the quantification of MR image system-related distortions.; T. Stanescu, N/A.

60 APPLIED LIFE SCIENCES↗

TH-CD-202-10: Tumor Metabolic Control Probability & Dose Response Mapping for Adaptive Dose Painting by Number

Purpose: Adaptive dose-painting-by-number (DPbN) requires a dose-response-mapping (DRM) obtained early in the treatment course. To obtain DRM, voxel-by-voxel tumor dose response needs to be quantified. Our recent study has demonstrated that voxel-by-voxel radio-sensitivity of patient tumor can be determined using tumor-metabolic-ratio measured early during the treatment using FDG-PET images. In this study, the measurements were utilized to construct tumor metabolic control probability (TMCP) and DRM for DPbN. Methods: FDG-PET/CT images of 18 HN cancer patients obtained pre- and weekly during the treatment were used. Spatial parametric images of tumor-metabolic-ratio (dSUV) were constructed following voxel-by-voxel deformable image registration. Each voxel value in dSUV was a function of baseline SUV and delivered dose. Utilizing all values of dSUV in the controlled tumor group at the last treatment week, a cut-off function between the baseline SUV and dSUV was formed, and applied in early treatment days on dSUV of all tumors to model the TMCP. At the treatment week k, TMCP was constructed with respect to the tumor voxel dSUV appeared at the week using the maximum likelihood estimation for all dose levels, and used for DRM construction. Results: TMCPs estimated in the week 2 & 3 have D{sub 50}=11.1∼47.6Gy; γ{sub 50}=0.55∼0.92 respectively with respect to dSUV=0.3∼1.2. The corresponding DRM between tumor voxel dSUV and the expected treatment dose has sigmoid shape. The expected treatment dose are 26∼40Gy (for 95% TMCP) for high sensitive tumor voxels with dSUV=0.3∼0.5; and 65∼110Gy for low sensitive tumor voxels with the dSUV>1.0 depending on the time of the estimation. Conclusion: TMCP can be constructed voxel-by-voxel in human tumor using multiple FDG-PET imaging obtained in early treatment days. TMCP provides a potential quantitative objective of tumor DRM for DPbN to plan the best dose, escalate or de-escalate, in tumor adaptively based on its own radio-sensitivity.

60 APPLIED LIFE SCIENCES↗

Mechanical morphotype switching as an adaptive response in mycobacteria

Invading microbes face a myriad of cidal mechanisms of phagocytes that inflict physical damage to microbial structures. How intracellular bacterial pathogens adapt to these stresses is not fully understood. Here, we report the discovery of a virulence mechanism by which changes to the mechanical stiffness of the mycobacterial cell surface confer refraction to killing during infection. Long-term time-lapse atomic force microscopy was used to reveal a process of “mechanical morphotype switching” in mycobacteria exposed to host intracellular stress. A “soft” mechanical morphotype switch enhances tolerance to intracellular macrophage stress, including cathelicidin. Both pharmacologic treatment, with bedaquiline, and a genetic mutant lacking uvrA modified the basal mechanical state of mycobacteria into a soft mechanical morphotype, enhancing survival in macrophages. Our study proposes microbial cell mechanical adaptation as a critical axis for surviving host-mediated stressors.

59 BASIC BIOLOGICAL SCIENCES↗

Leveraging data mining, active learning, and domain adaptation for efficient discovery of advanced oxygen evolution electrocatalysts

Developing advanced catalysts for acidic oxygen evolution reaction (OER) is crucial for sustainable hydrogen production. This study presents a multistage machine learning (ML) approach to streamline the discovery and optimization of complex multimetallic catalysts. Our method integrates data mining, active learning, and domain adaptation throughout the materials discovery process. Unlike traditional trial-and-error methods, this approach systematically narrows the exploration space using domain knowledge with minimized reliance on subjective intuition. Then, the active learning module efficiently refines element composition and synthesis conditions through iterative experimental feedback. The process culminated in the discovery of a promising Ru-Mn-Ca-Pr oxide catalyst. Our workflow also enhances theoretical simulations with domain adaptation strategy, providing deeper mechanistic insights aligned with experimental findings. By leveraging diverse data sources and multiple ML strategies, we demonstrate an efficient pathway for electrocatalyst discovery and optimization. This comprehensive, data-driven approach represents a paradigm shift and potentially benchmark in electrocatalysts research.

Science & Technology - Other Topics↗

Temperature-adaptive radiative coating for all-season household thermal regulation

The sky is a natural heat sink that has been extensively used for passive radiative cooling of households. A lot of focus has been on maximizing the radiative cooling power of roof coating in the hot daytime using static, cooling-optimized material properties. However, the resultant overcooling in cold night or winter times exacerbates the heating cost, especially in climates where heating dominates energy consumption. In this work, we approached thermal regulation from an all-season perspective by developing a mechanically flexible coating that adapts its thermal emittance to different ambient temperatures. The fabricated temperature-adaptive radiative coating (TARC) optimally absorbs the solar energy and automatically switches thermal emittance from 0.20 for ambient temperatures lower than 15°C to 0.90 for temperatures above 30°C, driven by a photonically amplified metal-insulator transition. Simulations show that this system outperforms existing roof coatings for energy saving in most climates, especially those with substantial seasonal variations.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Genetic Basis of Chromate Adaptation and the Role of the Pre-existing Genetic Divergence during an Experimental Evolution Study with Desulfovibrio vulgaris Populations

Hexavalent chromium [Cr(VI)] is a common environmental pollutant. However, little is known about the genetic basis of microbial evolution under Cr(VI) stress and the influence of the prior evolution histories on the subsequent evolution under Cr(VI) stress. In this study, Desulfovibrio vulgaris Hildenborough (DvH), a model sulfate-reducing bacterium, was experimentally evolved for 600 generations. By evolving the replicate populations of three genetically diverse DvH clones, including ancestor (AN, without prior experimental evolution history), non-stress-evolved EC3-10, and salt stress-evolved ES9-11, the contributions of adaptation, chance, and pre-existing genetic divergence to the evolution under Cr(VI) stress were able to be dissected. Significantly decreased lag phases under Cr(VI) stress were observed in most evolved populations, while increased Cr(VI) reduction rates were primarily observed in populations evolved from EC3-10 and ES9-11. The pre-existing genetic divergence in the starting clones showed strong influences on the changes in lag phases, growth rates, and Cr(VI) reduction rates. Additionally, the genomic mutation spectra in populations evolved from different starting clones were significantly different. A total of 14 newly mutated genes obtained mutations in at least two evolved populations, suggesting their importance in Cr(VI) adaptation. An in-frame deletion mutation of one of these genes, the chromate transporter gene DVU0426, demonstrated that it played an important role in Cr(VI) tolerance. Overall, our study identified potential key functional genes for Cr(VI) tolerance and demonstrated the important role of pre-existing genetic divergence in evolution under Cr(VI) stress conditions.

54 ENVIRONMENTAL SCIENCES↗

MADNESS: A Multiresolution, Adaptive Numerical Environment for Scientific Simulation

MADNESS (multiresolution adaptive numerical environment for scientific simulation) is a high-level software environment for solving integral and differential equations in many dimensions that uses adaptive and fast harmonic analysis methods with guaranteed precision based on multiresolution analysis and separated representations. Underpinning the numerical capabilities is a powerful petascale parallel programming environment that aims to increase both programmer productivity and code scalability. This paper describes the features and capabilities of MADNESS and briefly discusses some current applications in chemistry and several areas of physics.

00A72↗

In-memory integration of existing software components for parallel adaptive unstructured mesh workflows

Unstructured mesh methods, like finite elements and finite volumes, support the effective analysis of complex physical behaviors modeled by partial differential equations over general threedimensional domains. The most reliable and efficient methods apply adaptive procedures with a-posteriori error estimators that indicate where and how the mesh is to be modified. Although adaptive meshes can have two to three orders of magnitude fewer elements than a more uniform mesh for the same level of accuracy, there are many complex simulations where the meshes required are so large that they can only be solved on massively parallel systems.

97 MATHEMATICS AND COMPUTING↗

Machine and Application Aware Partitioning for Adaptive Mesh Refinement Applications. In: HPDC '17 Proceedings of the 26th International Symposium on High-Performance Parallel and Distributed Computing

Load balancing and partitioning are critical when it comes to parallel computations. Popular partitioning strategies based on space filling curves focus on equally dividing work. The partitions produced are independent of the architecture or the application. Given the ever-increasing relative cost of data movement and increasing heterogeneity of our architectures, it is no longer sufficient to only consider an equal partitioning of work. Minimizing communication costs are equally if not more important. Our hypothesis is that an unequal partitioning that minimizes communication costs significantly can scale and perform better than conventional equal-work partitioning schemes. This tradeoff is dependent on the architecture as well as the application. We validate our hypothesis in the context of a finite-element computation utilizing adaptive mesh-refinement. Our central contribution is a new partitioning scheme that minimizes the overall runtime of subsequent computations by performing architecture and application-aware non-uniform work assignment in order to decrease time to solution, primarily by minimizing data-movement. We evaluate our algorithm by comparing it against standard space-filling curve based partitioning algorithms and observing time-to-solution as well as energy-to-solution for solving Finite Element computations on adaptively refined meshes. We demonstrate excellent scalability of our new partition algorithm up to $262,144$ cores on ORNL's Titan and demonstrate that the proposed partitioning scheme reduces overall energy as well as time-to-solution for application codes by up to 22.0%.

Fernando, Milinda↗

Error-controlled, progressive, and adaptable retrieval of scientific data with multilevel decomposition

Extreme-scale simulations and high-resolution instruments have been generating an increasing amount of data, which poses significant challenges to not only data storage during the run, but also post-processing where data will be repeatedly retrieved and analyzed for a long period of time. The challenges in satisfying a wide range of post-hoc analysis needs while minimizing the I/O overhead caused by inappropriate and/or excessive data retrieval should never be left unmanaged. In this paper, we propose a data refactoring, compressing, and retrieval framework capable of 1) fine-grained data refactoring with regard to precision; 2) incrementally retrieving and recomposing the data in terms of various error bounds; and 3) adaptively retrieving data in multi-precision and multi-resolution with respect to different analysis. With the progressive data re-composition and the adaptable retrieval algorithms, our framework significantly reduces the amount of data retrieved when multiple incremental precision are requested and/or the downstream analysis time when coarse resolution is used. Experiments show that the amount of data retrieved under the same progressively requested error bound using our framework is 64% less than that using state-of-the-art single-error-bounded approaches. Parallel experiments with up to 1, 024 cores and ~ 600 GB data in total show that our approach yields 1.36× and 2.52× performance over existing approaches in writing to and reading from persistent storage systems, respectively.

Liang, Xin↗

CEAZ: Accelerating Parallel I/O Via Hardware-Algorithm Co-Designed Adaptive Lossy Compression

As supercomputers continue to grow to exa-scale, the amount of data that needs to be saved or transmitted is exploding. To this end, many previous works have studied using error-bounded lossy compressors to reduce the data size and improve the I/O performance. However, little work has been done for effectively offloading lossy compression onto FPGA-based SmartNICs to reduce the compression overhead. In this paper, we propose a hardware-algorithm co-design of efficient and adaptive lossy compressor for scientific data on FPGAs (called CEAZ) to accelerate parallel I/O. Our contribution is fourfold: (1) We propose an efficient Huffman coding approach that can adaptively update Huffman codewords online based on codewords generated offline (from a variety of representative scientific datasets). (2) We derive a theoretical analysis to support a precise control of compression ratio under an error-bounded compression mode, enabling accurate offline Huffman codewords generation. This also help us create a fixed-ratio compression mode for consistent throughput. (3) We develop an efficient compression pipeline by adopting cuSZ’s dual-quantization algorithm to our hardware use case. (4) We evaluate CEAC on five real-world datasets with both a single FPGA board and 256 nodes from Bridges2 supercomputer. Experiments show that CEAZ outperforms the second-best FPGA-based lossy compressor by 2× of throughput and 9.6× of compression ratio. It also improves MPI_File_write and MPI_Gather throughputs by up to 32.7× and 31.4×, respectively.

Zhang, Chengming↗

JANUS: Resilient and Adaptive Data Transmission for Enabling Timely and Efficient Cross-Facility Scientific Workflows

In modern science, the growing complexity of large-scale scientific projects has led to an increasing reliance on cross-facility scientific workflows, where resources and expertise from multiple institutions and geographic locations are leveraged to accelerate scientific discovery. These workflows often require transmitting huge amounts of scientific data through wide-area networks. Although high-speed networks like ESnet and transfer services such as Globus have improved data mobility, several challenges remain. The sheer volume of data can overwhelm network bandwidth, widely used transport protocols such as TCP suffer from inefficiencies due to retransmissions triggered by packet loss, and existing fault-tolerance mechanisms like erasure coding introduce substantial overhead. In this paper, we propose Janus, a resilient and adaptable data transmission approach designed for cross-facility scientific workflows. Unlike traditional TCP-based methods, Janus leverages UDP, integrates erasure coding for fault tolerance, and combines it with error-bounded lossy compression to reduce overhead. This novel design allows users to balance data transmission time and accuracy, optimizing transfer performance based on specific scientific requirements. Additionally, Janus dynamically adjusts erasure coding parameters in response to real-time network conditions, ensuring efficient data transfers even in fluctuating environments. We develop optimization models for determining ideal configurations and implement adaptive data transfer protocols to enhance reliability. Through extensive simulations and real-network experiments, we demonstrate that Janus significantly improves transfer efficiency while maintaining data fidelity.

Esaulov, Vladislav [Georgia State University, Atla↗

Adapting CLUTCH methodology to multigroup TSUNAMI-3D for eigenvalue sensitivity calculations

The sensitivity of the eigenvalue to uncertainties in nuclear data and its evaluation are important for nuclear criticality safety. TSUNAMI-3D sequences within the SCALE code system offer several options to the user community for calculating eigenvalue sensitivity coefficients with multigroup (MG) and continuous energy (CE) 3D transport capabilities. TSUNAMI-3D sequences implement the adjoint-based perturbation theory with MG KENO code, the Contributon Linked eigenvalue sensitivity/Uncertainty estimation via Track length importance CHaracterization (CLUTCH) method with CE KENO code, and the Iterated Fission Probability (IFP) method with CE KENO and Shift codes. Each method has benefits and limitations depending on the problem that is run. The work presented here aims to adapt the CLUTCH method, which enables the Contributon method's mesh-free, memory-efficient approach for calculating adjoint-weighted tallies for sensitivity calculations, to the MG TSUNAMI-3D sequence. This application would eliminate the explicit adjoint KENO calculation, as well as the memory-consuming mesh flux moment tallies required by the conventional MG TSUNAMI-3D. Smaller memory footprints in the CLUTCH methodology and relatively shorter runtimes in MG KENO transport can make MG TSUNAMI-3D a viable method for some complex problems. Moreover, this adaptation allows MG sensitivity calculations with Shift, ORNL's next-generation high-performance Monte Carlo transport code, which currently does not offer any sensitivity capabilities with MG particle transport simulations. Initial implementation of the new MG TSUNAMI-3D sequence and its preliminary results with a selected critical benchmark experiment in the Verified, Archived Library of Inputs and Data (VALID) are presented in this study.

KENO↗

Xavier: High-Performance X-Drop Adaptive Banded Pairwise Alignment (Xavier) v1.0

Pairwise sequence alignment is one of the most compute-intense challenges for the analysis of genomics data and it can account for more than 90% of the runtime depending on the application. Despite the effort to reduce the computational cost introducing heuristics such as banded and x-drop alignment, the performance of state-of-the-art software is often unsatisfactory for long sequences. Recent advances in single-molecule sequencing technologies keep increasing the length of the sequences to align at the cost of higher error rates b ranging from 5% to 15% b, emphasizing the need for fast and accurate software. Our long-read alignment software, named Xavier, computes high-performance x-drop adaptive banded pairwise alignment exploiting instruction-level parallelism via Single-Instruction-Multiple-Data (SIMD) operations. Xavier uses a narrow bandwidth that appreciably improves performance reducing the search space for the optimal alignment. In our experiment, the adaptive mechanism enables Xavier to find the optimal alignment between related sequences even when the error rate is as high as 50%. Xavier achieves speed-up up to 5X over competitor software when enabling the x-drop termination and up to 415X when disabling it, with negligible accuracy loss.

Guidi, Giulia↗

Deep Lynx MOOSE Adapter

The Deep Lynx MOOSE Adapter connects the Deep Lynx data warehouse with any MOOSE executable. The Adapter can receive events from Deep Lynx and will take incoming data to format a template input file for the MOOSE executable. Returns from the MOOSE run are sent back to Deep Lynx for use by other applications.

Browning, JerenM↗

Deep-Lynx-ML-Adapter

The Deep Lynx Machine Learning (ML) Adapter is a generic adapter that programmatically runs the ML as continuous data is received. Then, Jupyter Notebooks can be customized according to the project for pre-processing the data, building the machine learning models, prediction analysis of incoming data using an existing model, and forecasting anomalies / failures of the physical asset.

Wilsdon, KatherineN↗

Adaptive Self Tuning

The AST software includes numeric methods to 1) adjust STA/LTA signal detector trigger level (TL) values and 2) filter detections for a network of sensors. AST adapts TL values to the current state of the environment by leveraging cooperation within a neighborhood of sensors. The key metric that guides the dynamic tuning is consistency of each sensor with its nearest neighbors: TL values are automatically adjusted on a per station basis to be more or less sensitive to produce consistent agreement of detections in its neighborhood. The AST algorithm adapts in near real-time to changing conditions in an attempt to automatically self-tune a signal detector to identify (detect) only signals from events of interest.

Peterson, Matthew↗