Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimal algorithms”

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,423 records · Page 79

Feasibility of Multimodal Deformable Registration for Head and Neck Tumor Treatment Planning

Purpose: To investigate the feasibility of using deformable registration in clinical practice to fuse MR and CT images of the head and neck for treatment planning. Method and Materials: A state-of-the-art deformable registration algorithm was optimized, evaluated, and compared with rigid registration. The evaluation was based on manually annotated anatomic landmarks and regions of interest in both modalities. We also developed a multiparametric registration approach, which simultaneously aligns T1- and T2-weighted MR sequences to CT. This was evaluated and compared with single-parametric approaches. Results: Our results show that deformable registration yielded a better accuracy than rigid registration, without introducing unrealistic deformations. For deformable registration, an average landmark alignment of approximatively 1.7 mm was obtained. For all the regions of interest excluding the cerebellum and the parotids, deformable registration provided a median modified Hausdorff distance of approximatively 1 mm. Similar accuracies were obtained for the single-parameter and multiparameter approaches. Conclusions: This study demonstrates that deformable registration of head-and-neck CT and MR images is feasible, with overall a significanlty higher accuracy than for rigid registration.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

CRYSTAL CHEMISTRY OF THREE-COMPONENT WHITE DWARFS AND NEUTRON STAR CRUSTS: PHASE STABILITY, PHASE STRATIFICATION, AND PHYSICAL PROPERTIES

A systematic search for multicomponent crystal structures is carried out for five different ternary systems of nuclei in a polarizable background of electrons, representative of accreted neutron star crusts and some white dwarfs. Candidate structures are “bred” by a genetic algorithm and optimized at constant pressure under the assumption of linear response (Thomas–Fermi) charge screening. Subsequent phase equilibria calculations reveal eight distinct crystal structures in the T = 0 bulk phase diagrams, five of which are complicated multinary structures not previously predicted in the context of compact object astrophysics. Frequent instances of geometrically similar but compositionally distinct phases give insight into structural preferences of systems with pairwise Yukawa interactions, including and extending to the regime of low-density colloidal suspensions made in a laboratory. As an application of these main results, we self-consistently couple the phase stability problem to the equations for a self-gravitating, hydrostatically stable white dwarf, with fixed overall composition. To our knowledge, this is the first attempt to incorporate complex multinary phases into the equilibrium phase-layering diagram and mass–radius-composition dependence, both of which are reported for He–C–O and C–O–Ne white dwarfs. Finite thickness interfacial phases (“interphases”) show up at the boundaries between single-component body-centered cubic (bcc) crystalline regions, some of which have lower lattice symmetry than cubic. A second application—quasi-static settling of heavy nuclei in white dwarfs—builds on our equilibrium phase-layering method. Tests of this nonequilibrium method reveal extra phases that play the role of transient host phases for the settling species.

79 ASTRONOMY AND ASTROPHYSICS↗

Classification of dynamical Lie algebras generated by spin interactions on undirected graphs

Dynamical Lie algebras (DLAs) are a versatile tool for various topics that span from the expressibility-trainability of variational quantum algorithms (VQAs), to simulation of many body Hamiltonians. Quantum gates and most of the Hamiltonians of interest consist of local interactions; therefore, the analysis of all possible DLAs generated by 1- and 2-local operators is crucial for quantum simulation and VQAs on current hardware. Previously in [R. Wiersema et al ., npj Quantum Inf. 10 , 110 (2024)], we analyzed the DLAs on linear, circular and all-to-all topologies, and obtained results about their dimensions and algebraic structure. Here, in this work, we extend our analysis into any possible hardware topology and provide a classification of all DLAs generated by Pauli strings on any undirected interaction graph. Our results indicate that the DLAs depend solely on whether the connectivity or interaction graph is bipartite or not. In addition, we find that the non-trivial polynomially scaling DLAs appear only on 1D line or circle topologies, and all other DLAs have dimensions scaling exponentially with the system size. Together with the current VQA literature, our results imply that either the majority of VQAs are non-trainable, or we are yet to understand the role of DLAs on the trainability of VQAs.

Algebraic structures↗

Validation of a deformable image registration technique for cone beam CT-based dose verification

Purpose: As radiation therapy evolves toward more adaptive techniques, image guidance plays an increasingly important role, not only in patient setup but also in monitoring the delivered dose and adapting the treatment to patient changes. This study aimed to validate a method for evaluation of delivered intensity modulated radiotherapy (IMRT) dose based on multimodal deformable image registration (DIR) for prostate treatments. Methods: A pelvic phantom was scanned with CT and cone-beam computed tomography (CBCT). Both images were digitally deformed using two realistic patient-based deformation fields. The original CT was then registered to the deformed CBCT resulting in a secondary deformed CT. The registration quality was assessed as the ability of the DIR method to recover the artificially induced deformations. The primary and secondary deformed CT images as well as vector fields were compared to evaluate the efficacy of the registration method and it’s suitability to be used for dose calculation. PLASTIMATCH, a free and open source software was used for deformable image registration. A B-spline algorithm with optimized parameters was used to achieve the best registration quality. Geometric image evaluation was performed through voxel-based Hounsfield unit (HU) and vector field comparison. For dosimetric evaluation, IMRT treatment plans were created and optimized on the original CT image and recomputed on the two warped images to be compared. The dose volume histograms were compared for the warped structures that were identical in both warped images. This procedure was repeated for the phantom with full, half full, and empty bladder. Results: The results indicated mean HU differences of up to 120 between registered and ground-truth deformed CT images. However, when the CBCT intensities were calibrated using a region of interest (ROI)-based calibration curve, these differences were reduced by up to 60%. Similarly, the mean differences in average vector field lengths decreased from 10.1 to 2.5 mm when CBCT was calibrated prior to registration. The results showed no dependence on the level of bladder filling. In comparison with the dose calculated on the primary deformed CT, differences in mean dose averaged over all organs were 0.2% and 3.9% for dose calculated on the secondary deformed CT with and without CBCT calibration, respectively, and 0.5% for dose calculated directly on the calibrated CBCT, for the full-bladder scenario. Gamma analysis for the distance to agreement of 2 mm and 2% of prescribed dose indicated a pass rate of 100% for both cases involving calibrated CBCT and on average 86% without CBCT calibration. Conclusions: Using deformable registration on the planning CT images to evaluate the IMRT dose based on daily CBCTs was found feasible. The proposed method will provide an accurate dose distribution using planning CT and pretreatment CBCT data, avoiding the additional uncertainties introduced by CBCT inhomogeneity and artifacts. This is a necessary initial step toward future image-guided adaptive radiotherapy of the prostate.

60 APPLIED LIFE SCIENCES↗

A PLATEAU IN THE PLANET POPULATION BELOW TWICE THE SIZE OF EARTH

We carry out an independent search of Kepler photometry for small transiting planets with sizes 0.5-8.0 times that of Earth and orbital periods between 5 and 50 days, with the goal of measuring the fraction of stars harboring such planets. We use a new transit search algorithm, TERRA, optimized to detect small planets around photometrically quiet stars. We restrict our stellar sample to include the 12,000 stars having the lowest photometric noise in the Kepler survey, thereby maximizing the detectability of Earth-size planets. We report 129 planet candidates having radii less than 6 R{sub E} found in three years of Kepler photometry (quarters 1-12). Forty-seven of these candidates are not in Batalha et al., which only analyzed photometry from quarters 1-6. We gather Keck HIRES spectra for the majority of these targets leading to precise stellar radii and hence precise planet radii. We make a detailed measurement of the completeness of our planet search. We inject synthetic dimmings from mock transiting planets into the actual Kepler photometry. We then analyze that injected photometry with our TERRA pipeline to assess our detection completeness for planets of different sizes and orbital periods. We compute the occurrence of planets as a function of planet radius and period, correcting for the detection completeness as well as the geometric probability of transit, R{sub *}/a. The resulting distribution of planet sizes exhibits a power law rise in occurrence from 5.7 R{sub E} down to 2 R{sub E} , as found in Howard et al. That rise clearly ends at 2 R{sub E} . The occurrence of planets is consistent with constant from 2 R{sub E} toward 1 R{sub E} . This unexpected plateau in planet occurrence at 2 R{sub E} suggests distinct planet formation processes for planets above and below 2 R{sub E} . We find that 15.1{sup +1.8}{sub -2.7}% of solar type stars-roughly one in six-has a 1-2 R{sub E} planet with P = 5-50 days.

79 ASTRONOMY AND ASTROPHYSICS↗

Transfer learning for analysis of collective and non-collective Thomson scattering spectra

Thomson scattering (TS) diagnostics provide reliable, minimally perturbative measurements of fundamental plasma parameters, such as electron density (⁠n e ) and electron temperature (⁠T e ⁠). Deep neural networks can provide accurate estimates of ⁠n e and T e when conventional fitting algorithms may fail, such as when TS spectra are dominated by noise, or when fast analysis is required for real-time operation. Although deep neural networks typically require large training sets, transfer learning can improve model performance on a target task with limited data by leveraging pre-trained models from related source tasks, where select hidden layers are further trained using target data. We present five architecturally diverse deep neural networks, pre-trained on synthetic TS data and adapted for experimentally measured TS data, to evaluate the efficacy of transfer learning in estimating n e and T e in both the collective and non-collective scattering regimes. We evaluate errors in n e and T e estimates as a function of training set size for models trained with and without transfer learning, and we observe decreases in model error from transfer learning when the training set contains ≲ 200 experimentally measured spectra.

Artificial neural networks↗

Phase retrieval of diffraction from highly strained crystals

An important application of phase retrieval methods is to invert coherent x-ray diffraction measurements to obtain real-space images of nanoscale crystals. The phase information is currently recovered from reciprocal-space amplitude measurements by the application of iterative projective algorithms that solve the nonlinear and nonconvex optimization problem. Various algorithms have been developed each of which apply constraints in real and reciprocal space on the reconstructed object. In general, these methods rely on experimental data that is oversampled above the Nyquist frequency. To date, support-based methods have worked well, but are less successful for highly strained structures, defined as those which contain (real-space) phase information outside the range of {+-}{pi}/2. As a direct result the acquired experimental data is, in general, inadvertently subsampled below the Nyquist frequency. In recent years, a new theory of 'compressive sensing' has emerged, which dictates that an appropriately subsampled (or compressed) signal can be recovered exactly through iterative reconstruction and various routes to minimizing the l{sub 1} norm or total variation in that signal. This has proven effective in solving several classes of convex optimization problems. Here we report on a 'density-modification' phase reconstruction algorithm that applies the principles of compressive sensing to solve the nonconvex phase retrieval problem for highly strained crystalline materials. The application of a nonlinear operator in real-space minimizes the l{sub 1} norm of the amplitude by a promotion-penalization (or 'propenal') operation that confines the density bandwidth. This was found to significantly aid in the reconstruction of highly strained nanocrystals. We show how this method is able to successfully reconstruct phase information that otherwise could not be recovered.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimization of groundwater artificial recharge systems using a genetic algorithm: a case study in Beijing, China

An optimization approach is used for the operation of groundwater artificial recharge systems in an alluvial fan in Beijing, China. The optimization model incorporates a transient groundwater flow model, which allows for simulation of the groundwater response to artificial recharge. The facilities’ operation with regard to recharge rates is formulated as a nonlinear programming problem to maximize the volume of surface water recharged into the aquifers under specific constraints. This optimization problem is solved by the parallel genetic algorithm (PGA) based on OpenMP, which could substantially reduce the computation time. To solve the PGA with constraints, the multiplicative penalty method is applied. In addition, the facilities’ locations are implicitly determined on the basis of the results of the recharge-rate optimizations. Two scenarios are optimized and the optimal results indicate that the amount of water recharged into the aquifers will increase without exceeding the upper limits of the groundwater levels. Optimal operation of this artificial recharge system can also contribute to the more effective recovery of the groundwater storage capacity.

58 GEOSCIENCES↗

Nonlinear multiobjective and dynamic real-time predictive optimization for optimal operation of baseload power plants under variable renewable energy

Considering the increase of disruptive variable renewable energy penetration into the power grid, this article focuses on the investigation of a multiobjective and dynamic real-time optimization framework to address the cycling of large-scale power plants under renewable penetration. In this framework, a parallelized particle swarm optimization step is first performed to generate feasible initial points. Then, a multiobjective and dynamic real-time optimization formulation generates optimal trajectories. Further, the benefit of predictive capability is investigated for the dynamic component, which introduces the novel nonlinear multiobjective and dynamic real-time predictive optimization approach. Two multiobjective formulations to obtain Pareto front optimal in real time are explored: the modified Tchebycheff-based weighted metric and ϵ-constraint methods. Economic and environmental objectives are considered in this study. A novel topical discussion on the intersection of dynamic real-time optimization with model predictive control is also presented. The developed framework is successfully applied to a baseload coal-fired power plant with postcombustion CO 2 capture. Results indicate that the approach can be deployed for a large-scale system if automatic differentiation, model reduction, and parallelization are adopted to improve computational tractability, with computational improvement up to 120-folds after performing these steps. Finally, market and carbon policies showed an impact on the optimal compromise between the objectives with an additional 63 ton of CO 2 captured under favorable market conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Resolution-adapted recombination of structural features significantly improves sampling in restraint-guided structure calculation

Recent work has shown that NMR structures can be determined by integrating sparse NMR data with structure prediction methods such as Rosetta. The experimental data serve to guide the search for the lowest energy state towards the deep minimum at the native state which is frequently missed in Rosetta de novo structure calculations. However, as the protein size increases, sampling again becomes limiting; for example, the standard Rosetta protocol involving Monte Carlo fragment insertion starting from an extended chain fails to converge for proteins over 150 amino acids even with guidance from chemical shifts (CS-Rosetta) and other NMR data. The primary limitation of this protocol—that every folding trajectory is completely independent of every other—was recently overcome with the development of a new approach involving resolution-adapted structural recombination (RASREC). Here we describe the RASREC approach in detail and compare it to standard CS-Rosetta. We show that the improved sampling of RASREC is essential in obtaining accurate structures over a benchmark set of 11 proteins in the 15-25 kDa size range using chemical shifts, backbone RDCs and H N -H N NOE data; in a number of cases the improved sampling methodology makes a larger contribution than incorporation of additional experimental data. Experimental data are invaluable for guiding sampling to the vicinity of the global energy minimum, but for larger proteins, the standard Rosetta fold-from-extended-chain protocol does not converge on the native minimum even with experimental data and the more powerful RASREC approach is necessary to converge to accurate solutions.

59 BASIC BIOLOGICAL SCIENCES↗

Network Community Detection on Small Quantum Computers

In recent years, a number of quantum computing devices with small numbers of qubits have become available. A hybrid quantum local search (QLS) approach that combines a classical machine and a small quantum device to solve problems of practical size is presented. Herein, the proposed approach is applied to the network community detection problem. QLS is hardware-agnostic and easily extendable to new quantum computing devices as they become available. It is demonstrated to solve the 2-community detection problem on graphs of sizes of up to 410 vertices using the 16-qubit IBM quantum computer and D-Wave 2000Q, and compare their performance with the optimal solutions. The results herein demonstrate that QLS performs similarly in terms of quality of the solution and the number of iterations to convergence on both types of quantum computers and it is capable of achieving results comparable to state-of-the-art solvers in terms of quality of the solution including reaching the optimal solutions.

97 MATHEMATICS AND COMPUTING↗

Multilevel techniques for compression and reduction of scientific data—the univariate case

We present a multilevel technique for the compression and reduction of univariate data and give an optimal complexity algorithm for its implementation. A hierarchical scheme offers the flexibility to produce multiple levels of partial decompression of the data so that each user can work with a reduced representation that requires minimal storage whilst achieving the required level of tolerance. The algorithm is applied to the case of turbulence modelling in which the datasets are traditionally not only extremely large but inherently non-smooth and, as such, rather resistant to compression. Here, we decompress the data for a range of relative errors, carry out the usual analysis procedures for turbulent data, and compare the results of the analysis on the reduced datasets to the results that would be obtained on the full dataset. The results obtained demonstrate the promise of multilevel compression techniques for the reduction of data arising from large scale simulations of complex phenomena such as turbulence modelling.

97 MATHEMATICS AND COMPUTING↗

Semi-automatic Methods for Airway and Adjacent Vessel Measurement in Bronchiectasis Patterns in Lung HRCT Images of Cystic Fibrosis Patients

Airway and vessel characterization of bronchiectasis patterns in lung high-resolution computed tomography (HRCT) images of cystic fibrosis (CF) patients is very important to compute the score of disease severity. We propose a hybrid and evolutionary optimized threshold and model-based method for characterization of airway and vessel in lung HRCT images of CF patients. First, the initial model of airway and vessel is obtained using the enhanced threshold-based method. Then, the model is fitted to the actual image by optimizing its parameters using particle swarm optimization (PSO) evolutionary algorithm. The experimental results demonstrated the outperformance of the proposed method over its counterpart in R-squared, mean and variance of error, and run time. Moreover, the proposed method outperformed its counterpart for airway inner diameter/vessel diameter (AID/VD) and airway wall thickness/vessel diameter (AWT/VD) biomarkers in R-squared and slope of regression analysis.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Fast Multilevel Solvers for a Class of Discrete Fourth Order Parabolic Problems

In this paper, we study fast iterative solvers for the solution of fourth order parabolic equations discretized by mixed finite element methods. We propose to use consistent mass matrix in the discretization and use lumped mass matrix to construct efficient preconditioners. We provide eigenvalue analysis for the preconditioned system and estimate the convergence rate of the preconditioned GMRes method. Furthermore, we show that these preconditioners only need to be solved inexactly by optimal multigrid algorithms. Our numerical examples indicate that the proposed preconditioners are very efficient and robust with respect to both discretization parameters and diffusion coefficients. We also investigate the performance of multigrid algorithms with either collective smoothers or distributive smoothers when solving the preconditioner systems.

97 MATHEMATICS AND COMPUTING↗

Characterizing and Modeling Cloud Applications/Jobs on a Google Data Center

In this paper, we characterize and model Google applications and jobs, based on a 1-month Google trace from a large-scale Google data center. We address four contributions: (1) we compute the valuable statistics about task events and resource utilization for Google applications, based on various types of resources and execution types; (2) we analyze the classification of applications via a K-means clustering algorithm with optimized number of sets, based on task events and resource usage; (3) we study the correlation of Google application properties and running features (e.g., job priority and scheduling class); (4) we finally build a model that can simulate Google jobs/tasks and dynamic events, in accordance with Google trace. Experiments show that the tasks simulated based on our model exhibit fairly analogous features with those in Google trace. 95+ % of tasks' simulation errors are 20 %, confirming a high accuracy of our simulation model.

Di, Sheng↗

Distributed out-of-memory NMF on CPU/GPU architectures

We propose an efficient distributed out-of-memory implementation of the non-negative matrix factorization (NMF) algorithm for heterogeneous high-performance-computing systems. The proposed implementation is based on prior work on NMFk, which can perform automatic model selection and extract latent variables and patterns from data. In this work, we extend NMFk by adding support for dense and sparse matrix operation on multi-node, multi-GPU systems. The resulting algorithm is optimized for out-of-memory problems where the memory required to factorize a given matrix is greater than the available GPU memory. Memory complexity is reduced by batching/tiling strategies, and sparse and dense matrix operations are significantly accelerated with GPU cores (or tensor cores when available). Input/output latency associated with batch copies between host and device is hidden using CUDA streams to overlap data transfers and compute asynchronously, and latency associated with collective communications (both intra-node and inter-node) is reduced using optimized NVIDIA Collective Communication Library (NCCL) based communicators. Benchmark results show significant improvement, from 32X to 76x speedup, with the new implementation using GPUs over the CPU-based NMFk. Good weak scaling was demonstrated on up to 4096 multi-GPU cluster nodes with approximately 25,000 GPUs when decomposing a dense 340 Terabyte-size matrix and an 11 Exabyte-size sparse matrix of density 10 -6 .

97 MATHEMATICS AND COMPUTING↗

From PINNs to PIKANs: recent advances in physics-informed machine learning

Physics-Informed Neural Networks (PINNs) have emerged as a key tool in Scientific Machine Learning since their introduction in 2017, enabling the efficient solution of ordinary and partial differential equations using sparse measurements. Over the past few years, significant advancements have been made in the training and optimization of PINNs, covering aspects such as network architectures, adaptive refinement, domain decomposition, and the use of adaptive weights and activation functions. A notable recent development is the Physics-Informed Kolmogorov-Arnold Networks (PIKANS), which leverage a representation model originally proposed by Kolmogorov in 1957, offering a promising alternative to traditional PINNs. In this review, we provide a comprehensive overview of the latest advancements in PINNs, focusing on improvements in network design, feature expansion, optimization techniques, uncertainty quantification, and theoretical insights. We also survey key applications across a range of fields, including biomedicine, fluid and solid mechanics, geophysics, dynamical systems, heat transfer, chemical engineering, and beyond. Lastly, we review computational frameworks and software tools developed by both academia and industry to support PINN research and applications.

Kolmogorov-Arnold networks↗

Refining water and carbon fluxes modeling in terrestrial ecosystems via plant hydraulics integration

Plant hydraulics substantially affects terrestrial water and carbon cycles by modulating water transport and carbon assimilation. Despite improved drought simulations in certain ecosystems through their integration into land surface models (LSMs), the broader application of plant hydraulics in diverse ecosystems and hydroclimates is still underexplored. Here, in this study, we implemented the recently developed Noah-Multiparameterization Land Surface Model (Noah-MP LSM) equipped with a plant hydraulics scheme (Noah-MP-PHS) across 40 FLUXNET sites globally. Employing the Shuffled Complex Evolution-University of Arizona (SCE-UA) auto-calibration algorithm, we optimized key plant hydraulics parameters for these sites spanning eight vegetation types in both arid and humid climates. Noah-MP-PHS significantly improves the simulation of evapotranspiration (ET) and gross primary production (GPP) by better representing atmospheric and soil water stress compared to traditional soil hydraulic schemes (SHSs, such as Noah and CLM). The augmented Noah-MP-PHS models reduce surface flux overestimation and underestimation, exhibiting an average increase of 0.14 and 0.15 in Kling-Gupta Efficiency (KGE) compared to Noah and CLM, respectively. The explicit consideration of plant capacitance in PHS reveals substantial deep-layer and nocturnal root water uptake especially under dry conditions. We employed eXplainable Machine learning (XML) to quantify the model’s relative sensitivity to newly introduced leaf-, stem and root-related parameters in PHS. The sensitivity analysis reveals a rise in root parameter importance and a decline in leaf and stem parameters as conditions shift from humid to arid. These findings indicate that as aridity states vary, the most influential parameters affecting surface fluxes variation may change in parameter calibration for PHS applications. Our findings underscore the importance of incorporating plant hydraulics into LSMs to enhance simulations of terrestrial water and carbon dynamics. These findings are crucial for understanding ecosystem responses to global climate changes and guide the broader application of PHS at larger scales.

54 ENVIRONMENTAL SCIENCES↗