Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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,207 records · Page 67

DTK C/Fortran Interface Development for NEAMS FSI Simulations

This report documents the development of DataTransferKit (DTK) C and Fortran interfaces for fluid-structure-interaction (FSI) simulations in NEAMS. In these simulations, the codes Nek5000 and Diablo are being coupled within the SHARP framework to study flow-induced vibration (FIV) in reactor steam generators. We will review the current Nek5000/Diablo coupling algorithm in SHARP and the current state of the solution transfer scheme used in this implementation. We will then present existing DTK algorithms which may be used instead to provide an improvement in both flexibility and scalability of the current SHARP implementation. We will show how these can be used within the current FSI scheme using a new set of interfaces to the algorithms developed by this work. These new interfaces currently expose the mesh-free solution transfer algorithms in DTK, a C++ library, and are written in C and Fortran to enable coupling of both Nek5000 and Diablo in their native Fortran language. They have been compiled and tested on Cooley, the test-bed machine for Mira at ALCF.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Tunable thermal conductivity via domain structure engineering in ferroelectric thin films: A phase-field simulation

Effective thermal conductivity as a function of domain structure is studied by solving the heat conduction equation using a spectral iterative perturbation algorithm in materials with inhomogeneous thermal conductivity distribution. Using this proposed algorithm, the experimentally measured effective thermal conductivities of domain-engineered {001} p- BiFeO 3 thin films are quantitatively reproduced. In conjunction with two other testing examples, this proposed algorithm is proven to be an efficient tool for interpreting the relationship between the effective thermal conductivity and micro-/domain-structures. By combining this algorithm with the phase-field model of ferroelectric thin films, the effective thermal conductivity for PbZr 1-x Ti x O 3 films under different composition, thickness, strain, and working conditions is predicted. It is shown that the chemical composition, misfit strain, film thickness, film orientation, and a Piezoresponse Force Microscopy tip can be used to engineer the domain structures and tune the effective thermal conductivity. Furthermore, we expect our findings will stimulate future theoretical, experimental and engineering efforts on developing devices based on the tunable effective thermal conductivity in ferroelectric nanostructures.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An Accelerated Clip Algorithm for Unstructured Meshes: A Batch-Driven Approach

The clip technique is a popular method for visualizing complex structures and phenomena within 3D unstructured meshes. Meshes can be clipped by specifying a scalar isovalue to produce an output unstructured mesh with its external surface as the isovalue. Similar to isocontouring, the clipping process relies on scalar data associated with the mesh points, including scalar data generated by implicit functions such as planes, boxes, and spheres, which facilitates the visualization of results interior to the grid. In this paper, we introduce a novel batch-driven parallel algorithm based on a sequential clip algorithm designed for high-quality results in partial volume extraction. Our algorithm comprises five passes, each progressively processing data to generate the resulting clipped unstructured mesh. The novelty lies in the use of fixed-size batches of points and cells, which enable rapid workload trimming and parallel processing, leading to a significantly improved memory footprint and run-time performance compared to the original version. On a 32-core CPU, the proposed batch-driven parallel algorithm demonstrates a run-time speed-up of up to 32.6x and a memory footprint reduction of up to 4.37x compared to the existing sequential algorithm. The software is currently available under an open-source license in the VTK visualization system.

Tsalikis, Spiros↗

A multi-algorithm approach for modeling coastal wetland eco-geomorphology

Coastal wetlands play an important role in the global water and biogeochemical cycles. Climate change makes it more difficult for these ecosystems to adapt to the fluctuation in sea levels and other environmental changes. Given the importance of eco-geomorphological processes for coastal wetland resilience, many eco-geomorphology models differing in complexity and numerical schemes have been developed in recent decades. However, their divergent estimates of the response of coastal wetlands to climate change indicate that substantial structural uncertainties exist in these models. To investigate the structural uncertainty of coastal wetland eco-geomorphology models, we developed a multi-algorithm model framework of eco-geomorphological processes, such as mineral accretion and organic matter accretion, within a single hydrodynamics model. The framework is designed to explore possible ways to represent coastal wetland eco-geomorphology in Earth system models and reduce the related uncertainties in global applications. We tested this model framework at three representative coastal wetland sites: two saltmarsh wetlands (Venice Lagoon and Plum Island Estuary) and a mangrove wetland (Hunter Estuary). Through the model–data comparison, we showed the importance of using a multi-algorithm ensemble approach for more robust predictions of the evolution of coastal wetlands. We also found that more observations of mineral and organic matter accretion at different elevations of coastal wetlands and evaluation of the coastal wetland models at different sites in diverse environments can help reduce the model uncertainty.

58 GEOSCIENCES↗

On the Robustness of Network Community Structure Under Addition of Edges

Communities represent important functional modules in networked systems. A key goal in preserving such communities is understanding their robustness under perturbations. Previous research has studied the impact of node removals and edge removals on the community structure. However, the impact of edge additions on the robustness of the community structure is relatively unknown. Edge additions or false positive edges may simulate measurement errors or external exceptional events that threaten the functionality of networked systems. Here, we study the impact of edge additions on the community structure using Lancichinetti-Fortunato-Radicchi (LFR) benchmark networks. We show that, for a fixed network size, the impact of edge additions is greater on networks with initially weak community structure than on networks with strongly clustered structures. In addition, we find that the perception of the impact is also dependent on the community detection algorithm used to uncover communities. In particular, we found that modularity-based methods such as Leiden and Louvain are less affected than information-theoretic and message passing-based methods such as Infomap and Label Propagation. Our results demonstrate that edge addition can (a) significantly impact the community structure of networks based on their initial conditions, and (b) the perception of the impact is dependent on the community detection algorithm used. We describe limitations, open challenges, and how this methodology can inform the design of resilient networked systems under edge additions.

97 MATHEMATICS AND COMPUTING↗

Two-dimensional phase cartography for high-harmonic spectroscopy

Extremely nonlinear spectroscopy based on high-order-harmonic generation has become a powerful investigation method for attosecond dynamics in gas and solid targets. In particular, the phase of harmonic emission was shown to carry profound insight into atomic and molecular structure and dynamics. However, current techniques offer phase measurements only along specific directions, thus providing partial characterization. Here we report on a new approach combining optical and quantum interferometers measuring along two dimensions the intensity and phase of harmonic emission from aligned molecules in the exact same experimental conditions. This two-dimensional cartography technique measures the phase with no arbitrary offset and no uncertainty on its sign. Measurements along different dimensions can be combined in two ways: either a single mapping or a redundant mapping allowing high-precision phase recovery using a Shack–Hartmann-like algorithm. We demonstrate both methods in a nitrogen test case, which allows disentangling structural and dynamical effects. Two-dimensional phase cartography paves the way to high-resolution high-harmonic spectroscopy for applications such as quantum orbital tomography and attosecond charge migration in molecules.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

WE-G-18A-04: 3D Dictionary Learning Based Statistical Iterative Reconstruction for Low-Dose Cone Beam CT Imaging

Purpose: To develop a 3D dictionary learning based statistical reconstruction algorithm on graphic processing units (GPU), to improve the quality of low-dose cone beam CT (CBCT) imaging with high efficiency. Methods: A 3D dictionary containing 256 small volumes (atoms) of 3x3x3 voxels was trained from a high quality volume image. During reconstruction, we utilized a Cholesky decomposition based orthogonal matching pursuit algorithm to find a sparse representation on this dictionary basis of each patch in the reconstructed image, in order to regularize the image quality. To accelerate the time-consuming sparse coding in the 3D case, we implemented our algorithm in a parallel fashion by taking advantage of the tremendous computational power of GPU. Evaluations are performed based on a head-neck patient case. FDK reconstruction with full dataset of 364 projections is used as the reference. We compared the proposed 3D dictionary learning based method with a tight frame (TF) based one using a subset data of 121 projections. The image qualities under different resolutions in z-direction, with or without statistical weighting are also studied. Results: Compared to the TF-based CBCT reconstruction, our experiments indicated that 3D dictionary learning based CBCT reconstruction is able to recover finer structures, to remove more streaking artifacts, and is less susceptible to blocky artifacts. It is also observed that statistical reconstruction approach is sensitive to inconsistency between the forward and backward projection operations in parallel computing. Using high a spatial resolution along z direction helps improving the algorithm robustness. Conclusion: 3D dictionary learning based CBCT reconstruction algorithm is able to sense the structural information while suppressing noise, and hence to achieve high quality reconstruction. The GPU realization of the whole algorithm offers a significant efficiency enhancement, making this algorithm more feasible for potential clinical application. A high zresolution is preferred to stabilize statistical iterative reconstruction. This work was supported in part by NIH(1R01CA154747-01), NSFC((No. 61172163), Research Fund for the Doctoral Program of Higher Education of China (No. 20110201110011), China Scholarship Council.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

FAST-PT II: an algorithm to calculate convolution integrals of general tensor quantities in cosmological perturbation theory

Cosmological perturbation theory is a powerful tool to predict the statistics of large-scale structure in the weakly non-linear regime, but even at 1-loop order it results in computationally expensive mode-coupling integrals. Here we present a fast algorithm for computing 1-loop power spectra of quantities that depend on the observer's orientation, thereby generalizing the FAST-PT framework (McEwen et al., 2016) that was originally developed for scalars such as the matter density. This algorithm works for an arbitrary input power spectrum and substantially reduces the time required for numerical evaluation. We apply the algorithm to four examples: intrinsic alignments of galaxies in the tidal torque model; the Ostriker-Vishniac effect; the secondary CMB polarization due to baryon flows; and the 1-loop matter power spectrum in redshift space. Code implementing this algorithm and these applications is publicly available at https://github.com/JoeMcEwen/FAST-PT.

79 ASTRONOMY AND ASTROPHYSICS↗

Characterizing magnetized plasmas with dynamic mode decomposition

Accurate and efficient plasma models are essential to understand and control experimental devices. Existing magnetohydrodynamic or kinetic models are nonlinear and computationally intensive and can be difficult to interpret, while often only approximating the true dynamics. In this work, data-driven techniques recently developed in the field of fluid dynamics are leveraged to develop interpretable reduced-order models of plasmas that strike a balance between accuracy and efficiency. In particular, dynamic mode decomposition (DMD) is used to extract spatio-temporal magnetic coherent structures from the experimental and simulation datasets of the helicity injected torus with steady inductive (HIT-SI) experiment. Three-dimensional magnetic surface probes from the HIT-SI experiment are analyzed, along with companion simulations with synthetic internal magnetic probes. A number of leading variants of the DMD algorithm are compared, including the sparsity-promoting and optimized DMD. Optimized DMD results in the highest overall prediction accuracy, while sparsity-promoting DMD yields physically interpretable models that avoid overfitting. These DMD algorithms uncover several coherent magnetic modes that provide new physical insights into the inner plasma structure. These modes were subsequently used to discover a previously unobserved three-dimensional structure in the simulation, rotating at the second injector harmonic. Finally, using data from probes at experimentally accessible locations, DMD identifies a resistive kink mode, a ubiquitous instability seen in magnetized plasmas.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

SU-F-J-84: Comparison of Quantitative Deformable Image Registration Evaluation Tools: Application to Prostate IGART

Purpose: Errors in displacement vector fields (DVFs) generated by Deformable Image Registration (DIR) algorithms can give rise to significant uncertainties in contour propagation and dose accumulation in Image-Guided Adaptive Radiotherapy (IGART). The purpose of this work is to assess the accuracy of two DIR algorithms using a variety of quality metrics for prostate IGART. Methods: Pelvic CT images were selected from an anonymized database of nineteen prostate patients who underwent 8–12 serial scans during radiotherapy. Prostate, bladder, and rectum were contoured on 34 image-sets for three patients by the same physician. The planning CT was deformably-registered to daily CT using three variants of the Small deformation Inverse Consistent Linear Elastic (SICLE) algorithm: Grayscale-driven (G), Contour-driven (C, which utilizes segmented structures to drive DIR), combined (G+C); and also grayscale ITK demons (Gd). The accuracy of G, C, G+C SICLE and Gd registrations were evaluated using a new metric Edge Gradient Distance to Agreement (EGDTA) and other commonly-used metrics such as Pearson Correlation Coefficient (PCC), Dice Similarity Index (DSI) and Hausdorff Distance (HD). Results: C and G+C demonstrated much better performance at organ boundaries, revealing the lowest HD and highest DSI, in prostate, bladder and rectum. G+C demonstrated the lowest mean EGDTA (1.14 mm), which corresponds to highest registration quality, compared to G and C DVFs (1.16 and 2.34 mm). However, demons DIR showed the best overall performance, revealing lowest EGDTA (0.73 mm) and highest PCC (0.85). Conclusion: As expected, both C- and C+G SICLE more accurately reproduce manually-contoured target datasets than G-SICLE or Gd using HD and DSI metrics. In general, the Gd appears to have difficulty reproducing large daily position and shape changes in the rectum and bladder. However, Gd outperforms SICLE in terms of EGDTA and PCC metrics, possibly at the expense of topological quality of the estimated DVFs.

60 APPLIED LIFE SCIENCES↗

Improving the Concrete Crack Detection Process via a Hybrid Visual Transformer Algorithm

Inspections of concrete bridges across the United States represent a significant commitment of resources, given their biannual mandate for many structures. With a notable number of aging bridges, there is an imperative need to enhance the efficiency of these inspections. This study harnessed the power of computer vision to streamline the inspection process. Our experiment examined the efficacy of a state-of-the-art Visual Transformer (ViT) model combined with distinct image enhancement detector algorithms. We benchmarked against a deep learning Convolutional Neural Network (CNN) model. These models were applied to over 20,000 high-quality images from the Concrete Images for Classification dataset. Traditional crack detection methods often fall short due to their heavy reliance on time and resources. This research pioneers bridge inspection by integrating ViT with diverse image enhancement detectors, significantly improving concrete crack detection accuracy. Notably, a custom-built CNN achieves over 99% accuracy with substantially lower training time than ViT, making it an efficient solution for enhancing safety and resource conservation in infrastructure management. These advancements enhance safety by enabling reliable detection and timely maintenance, but they also align with Industry 4.0 objectives, automating manual inspections, reducing costs, and advancing technological integration in public infrastructure management.

42 ENGINEERING↗

Time-periodic steady-state solution of fluid-structure interaction and cardiac flow problems through multigrid-reduction-in-time

In this study, a time-periodic MGRIT algorithm is proposed as a means to reduce the time-to-solution of numerical algorithms by exploiting the time periodicity inherent to many applications in science and engineering. The time-periodic MGRIT algorithm is applied to a variety of linear and nonlinear single- and multiphysics problems that are periodic-in-time. It is demonstrated that the proposed parallel-in-time algorithm can obtain the same time-periodic steady-state solution as sequential time-stepping. It is shown that the required number of MGRIT iterations can be estimated a priori and that the new MGRIT variant can significantly and consistently reduce the time-to-solution compared to sequential time-stepping, irrespective of the number of dimensions, linear or nonlinear PDE models, single-physics or coupled problems and the employed computing resources. The numerical experiments demonstrate that the time-periodic MGRIT algorithm enables a greater level of parallelism yielding faster turnaround, and thus, facilitating more complex and more realistic problems to be solved.

97 MATHEMATICS AND COMPUTING↗

SU-E-T-106: An Institutional Review of Using Commercially Available Software to Evaluate Treatment Plan Quality for Various Treatment Sites and Beam Deliveries

Purpose: Use Sun Nuclear Quality Reports™ with PlanIQ™ to evaluate different treatment delivery techniques for various treatment sites. Methods: Fifteen random patients with different treatment sites were evaluated. These include the Head/Neck, prostate, pelvis, lung, esophagus, axilla, bladder and abdomen. Initially, these sites were planned on the Pinnacle {sup 3} V9.6 treatment planning system and utilized nine 6MV step-n-shoot IMRT fields. The RT plan, dose and structure sets were sent to Quality Reports™ where a DVH was recreated and the plans were compared to a unique Plan Algorithm for each treatment site. Each algorithm has its own plan quality metrics and objectives, which include the PTV coverage, PTV maximum dose, the prescription dose outside the target, doses to the critical structures, and the global maximum dose and its location. Each plan was scored base on meeting each objective. Plans may have been reoptimized and reevaluated with Quality Reports™ based on the initial score. PlanIQ™ was used to evaluate if any objective not met was achievable or difficult to obtain. A second plan using VMAT delivery was created for each patient and scored with Quality Reports™. Results: There were a wide range of scores for the different treatment sites with some scoring better for IMRT plans and some better for the VMAT deliveries. The variation in the scores could be attributed to the treatment site, location, and shape of the target. Most deliveries were chosen for the VMAT due to the short treatment times and quick patient throughput with acceptable plan scores. Conclusion: The tools are provided for both physician and dosimetrist to objectively evaluate the use of VMAT delivery versus the step-n-shoot IMRT delivery for various sites. PlanIQ validates if objectives can be met. For the physicist, a concise pass/fail report is created for plan evaluation.

60 APPLIED LIFE SCIENCES↗

TH-C-18A-02: Machine Learning and STAPLE Based Simultaneous Longitudinal Segmentation of Bone and Marrow Structures From Dual Energy CT

Purpose: To develop a fully-automatic longitudinal bone and marrow segmentation method in the pelvic region from dual energy computed tomography (DECT). Methods: We developed a two-step automatic bone and marrow segmentation method for simultaneous longitudinal evaluation of patients with metastatic bone disease using dual energy CT (DECT). Our approach transforms the DECT images into a multi-material decomposition (MMD) model that represents the voxels as a mixture of multiple materials. A support vector machine (SVM) was trained using a single scan. In the first step of the longitudinal segmentation the trained SVM model detects bone and marrow structures on all available longitudinal scans. Segmentation is further refined through active contour segmentation. In the second step, the segmentations from the individual scans are merged by employing the simultaneous truth and performance level estimation (STAPLE) algorithm. The scans are registered using affine and deformable registration. We found that our approach improves the segmentation in all the scans under reliable registration performance between the same scans. Improving registration was not under the scope of this work. Results: We applied our approach to segment bone and marrow in DECT scans in the pelvic regions for multiple patients. Each patient had three to five follow up scans. All the patients in the analysis had artificial metal prostheses which introduced challenges for the registration. Our algorithm achieved reasonable accurate segmentation despite the presence of metal artifacts and high-density oral contrast in neighboring structures. Our approach obtained an overall segmentation accuracy of 80% using DICE metric. Conclusion: We developed a two-step automatic longitudinal segmentation technique for bone and marrow region structures in the pelvic areas from dual energy CT. Our approach achieves robust segmentation despite the presence of confounding structures with similar intensities as the bone and marrow regions due to uptake of oral contrast and metal artifacts.

60 APPLIED LIFE SCIENCES↗

Characterization of zinc oxide thin film using atomic force microscopy and optimized X-ray reflectivity by genetic algorithm

For the nanostructured thin films, the study of surface physical parameters is often of crucial importance. For example, the transport properties of ZnO thin film are strongly affected by the geometry of this film. In this study sol—gel ZnO thin film was spin coated on glass substrate. The inverse problem of thin film characterization is formulated as a parameter identification problem in which a set of parameters corresponding to the thin film property can be found by minimizing fitness functions formulated using theoretical and experimental X-ray reflectivity. Atomic force microscopy (AFM) measurements used as an independent procedure for extracting structural parameters of the film and accurate interpretation of X-ray reflectivity data. After applying Fractal calculations on the AFM measured data the Genetic algorithm (GA) method was applied for extracting other important structural parameters. Optimization of specular X-ray reflectivity by GA method gives information along the depth such as thickness, roughness, and electron density profile of layers in the film.

36 MATERIALS SCIENCE↗

Machine Learning Assisted Synthesis of Metal–Organic Nanocapsules

Herein, we report machine learning algorithms by training data sets from a set of both successful and failed experiments for studying the crystallization propensity of metal–organic nanocapsules (MONCs). Among a variety of studied machine learning algorithms, XGBoost affords the highest prediction accuracy of >90%. The derived chemical feature scores that determine importance of reaction parameters from the XGBoost model assist to identify synthesis parameters for successfully synthesizing new hierarchical structures of MONCs, showing superior performance to a well-trained chemist. This work demonstrates that the machine learning algorithms can assist the chemists to faster search for the optimal reaction parameters from many experimental variables, whose features are usually hidden in the high-dimensional space.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Calculation of contact angles at triple phase boundary in solid oxide fuel cell anode using the level set method

A level set method is applied to characterize the three dimensional structures of nickel, yttria stabilized zirconia and pore phases in solid oxide fuel cell anode reconstructed by focused ion beam-scanning electron microscope. A numerical algorithm is developed to evaluate the contact angles at the triple phase boundary based on interfacial normal vectors which can be calculated from the signed distance functions defined for each of the three phases. Furthermore, surface tension force is estimated from the contact angles by assuming the interfacial force balance at the triple phase boundary. The average contact angle values of nickel, yttria stabilized zirconia and pore are found to be 143°–156°, 83°–138° and 82°–123°, respectively. The mean contact angles remained nearly unchanged after 100 hour operation. However, the contact angles just after reduction are different for the cells with different sintering temperatures. In addition, standard deviations of the contact angles are very large especially for yttria stabilized zirconia and pore phases. The calculated surface tension forces from mean contact angles were close to the experimental values found in the literature. Slight increase of surface tensions of nickel/pore and nickel/yttria stabilized zirconia were observed after operation. Present data are expected to be used not only for the understanding of the degradation mechanism, but also for the quantitative prediction of the microstructural temporal evolution of solid oxide fuel cell anode. - Highlights: • A level set method is applied to characterize the 3D structures of SOFC anode. • A numerical algorithm is developed to evaluate the contact angles at the TPB. • Surface tension force is estimated from the contact angles. • The average contact angle values are found to be 143o-156o, 83o-138o and 82o-123o. • Present data are expected to understand degradation and predict evolution of SOFC.

36 MATERIALS SCIENCE↗

Session Introduction: Graph Representations and Algorithms in Biomedicine

Connectivity is a fundamental property of biological systems: on the cellular level, proteins interact with each other to form protein-protein interaction networks (PPIs); on the organism level, neurons are arranged in a network; and on a community-level, species can have complex relationships with one another that drive the development and balance of an ecosystem. Graphs, representations of systems consisting of entities as vertices and their connections as edges, are a useful structure to characterize many such systems. Such models can be used to understand biological systems that naturally have a network structure, including PPIs, biological neurons, and ecosystems. In today’s information age, graph representations and algorithms (often in combination with machine learning techniques) are used to organize massive amounts of related data, much of which may be heterogeneous or unstructured, and identify patterns that represent novel biological insights. PSB’s 2023 session “Graph Representations and algorithms in Biomedicine,” encompasses modern developments in graph theory and its applications to various fields of biomedicine. This session includes a wide range of research - knowledge graphs built from text-mined health data, heterogeneous networks using multi-omic databases, and graphs refined to represent uncertainty or improve memory usage.

Chrisman, Brianna S.↗