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,027 records · Page 57

Time-Resolved Observations of Precipitation Structure and Storm Intensity with a Constellation of Smallsats: Level-1 Radiance Algorithm Theoretical Basis Document

This Algorithm Theoretical Basis Document (ATBD) describes the theoretical background of the TROPICS native radiance calibration algorithms. It also includes TROPICS payload characteristics and the algorithm’s ancillary data (i.e., data coming from sources other than the TROPICS Space Vehicle). Details of the native radiance (i.e., Level-1a antenna temperatures and Level-1b brightness temperatures) data product format can be found in the TROPICS Data User’s Guide. This ATBD information on the pre-launch testing completed to verify the algorithm. The TROPICS Data User’s Guide will contain the post-launch radiance validation.

TROPICS↗

Incremental triangulation by way of edge swapping and local optimization

This document is intended to serve as an installation, usage, and basic theory guide for the two dimensional triangulation software 'HARLEY' written for the Silicon Graphics IRIS workstation. This code consists of an incremental triangulation algorithm based on point insertion and local edge swapping. Using this basic strategy, several types of triangulations can be produced depending on user selected options. For example, local edge swapping criteria can be chosen which minimizes the maximum interior angle (a MinMax triangulation) or which maximizes the minimum interior angle (a MaxMin or Delaunay triangulation). It should be noted that the MinMax triangulation is generally only locally optical (not globally optimal) in this measure. The MaxMin triangulation, however, is both locally and globally optical. In addition, Steiner triangulations can be constructed by inserting new sites at triangle circumcenters followed by edge swapping based on the MaxMin criteria. Incremental insertion of sites also provides flexibility in choosing cell refinement criteria. A dynamic heap structure has been implemented in the code so that once a refinement measure is specified (i.e., maximum aspect ratio or some measure of a solution gradient for the solution adaptive grid generation) the cell with the largest value of this measure is continually removed from the top of the heap and refined. The heap refinement strategy allows the user to specify either the number of cells desired or refine the mesh until all cell refinement measures satisfy a user specified tolerance level. Since the dynamic heap structure is constantly updated, the algorithm always refines the particular cell in the mesh with the largest refinement criteria value. The code allows the user to: triangulate a cloud of prespecified points (sites), triangulate a set of prespecified interior points constrained by prespecified boundary curve(s), Steiner triangulate the interior/exterior of prespecified boundary curve(s), refine existing triangulations based on solution error measures, and partition meshes based on the Cuthill-McKee, spectral, and coordinate bisection strategies.

Wiltberger, N. Lyn↗

AMReX: a framework for block-structured adaptive mesh refinement

AMReX is a C++ software framework that supports the development of block-structured adaptive mesh refinement (AMR) algorithms for solving systems of partial differential equations (PDEs) with complex boundary conditions on current and emerging architectures. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving the local descriptions of different physical processes in complex multiphysics algorithms. Current AMReX-based application codes span a number of areas, including atmospheric modeling, astrophysics, combustion, cosmology, fluctuating hydrodynamics, multiphase flows, and particle accelerators. In particular, the AMReX-Astro GitHub repository holds a number of astrophysical modeling tools based on AMReX. The origins of AMReX trace back to the BoxLib software framework. AMReX supports a number of different time-stepping strategies and spatial discretizations. Solution strategies supported by AMReX range from level-by-level approaches (with or without subcycling in time) with multilevel synchronization to full-hierarchy approaches, and any combination thereof. User-defined kernels that operate on patches of data can be written in C++ or Fortran; there is also a Fortran-interface functionality which wraps the core C++ data structures and operations in Fortran wrappers so that an application code based on AMReX can be written entirely in Fortran.

97 MATHEMATICS AND COMPUTING↗

Two-level structural sparsity regularization for identifying lattices and defects in noisy images

Here, this paper presents a regularized regression model with a two-level structural sparsity penalty applied to locate individual atoms in a noisy scanning transmission electron microscopy image (STEM). In crystals, the locations of atoms is symmetric, condensed into a few lattice groups. Therefore, by identifying the underlying lattice in a given image, individual atoms can be accurately located. We propose to formulate the identification of the lattice groups as a sparse group selection problem. Furthermore, real atomic scale images contain defects and vacancies, so atomic identification based solely on a lattice group may result in false positives and false negatives. To minimize error, model includes an individual sparsity regularization in addition to the group sparsity for a within-group selection, which results in a regression model with a two-level sparsity regularization. We propose a modification of the group orthogonal matching pursuit (gOMP) algorithm with a thresholding step to solve the atom finding problem. The convergence and statistical analyses of the proposed algorithm are presented. The proposed algorithm is also evaluated through numerical experiments with simulated images. The applicability of the algorithm on determination of atom structures and identification of imaging distortions and atomic defects was demonstrated using three real STEM images. In conclusion, we believe this is an important step toward automatic phase identification and assignment with the advent of genomic databases for materials.

36 MATERIALS SCIENCE↗

Algorithms in Diffraction Profile Analysis

This chapter introduces several approaches to crystallographic structure refinement from diffraction profile data including the Rietveld method, global optimization methods, and Bayesian modeling. First, the Rietveld method and related nonlinear least squares approaches to analyzing diffraction profiles are briefly discussed. We then review the most common algorithms within global optimization as alternative methods of structure solution: grid search, simulated annealing, and genetic algorithms. As the Rietveld method is the standard tool for analyzing diffraction profile data, we catalogue its challenges and limitations. A Bayesian approach to diffraction profile analysis is presented as an alternative, along with several sampling algorithms including Gibbs sampling, variants of Metropolis sampling, Hamiltonian Monte Carlo, and approximate Bayesian computing. These sampling algorithms are applied to the fitting of a neutron diffraction profile from a National Institute of Standards and Technology silicon standard reference material, and their results are compared.

Singh, Susheela↗

Vision guided landing of an an autonomous helicopter in hazardous terrain

Future robotic space missions will employ a precision soft-landing capability that will enable exploration of previously inaccessible sites that have strong scientific significance. To enable this capability, a fully autonomous onboard system that identifies and avoids hazardous features such as steep slopes and large rocks is required. Such a system will also provide greater functionality in unstructured terrain to unmanned aerial vehicles. This paper describes an algorithm for landing hazard avoidance based on images from a single moving camera. The core of the algorithm is an efficient application of structure from motion to generate a dense elevation map of the landing area. Hazards are then detected in this map and a safe landing site is selected. The algorithm has been implemented on an autonomous helicopter testbed and demonstrated four times resulting in the first autonomous landing of an unmanned helicopter in unknown and hazardous terrain.

Mars Landing↗

STILGAR End-of-Project Report

The Subsurface Tunnel Imaging LeveraGed by Analysis of Rayleigh wave ellipticity (STILGAR) project demonstrated an integrated geophysical approach for detecting, locating, and characterizing underground structural changes using dense seismic arrays and advanced inversion techniques. Field campaigns were conducted at two operational mines—the Redmond salt mine (Utah) and Graymont Pleasant Gap limestone mine (Pennsylvania)—providing real-world testbeds for monitoring anthropogenic subsurface activity. At the Redmond salt mine, seismic interferometry combined with back-projection inversion successfully identified continuous, low-amplitude signals from mining operations. The approach differentiated stationary from migrating anthropogenic sources, captured daily operational cycles, and validated the potential of passive seismic monitoring for remote detection of underground activity. At the Graymont Pleasant Gap mine, two dense seismic deployments in the spring and fall of 2023 generated over 4 TB of high-resolution data. Key outcomes included the relocation of 199 underground and 8 surface explosions with accuracies within tens of meters and the development of a 3D P-wave velocity model using the triple-difference tomography algorithm (tomoTD) that resolved major structural features such as the mine entrance, low-velocity tunnels, and roof-collapse areas. Ambient noise cross-correlation and back-projection analyses revealed persistent sources linked to ongoing mining activity, whereas horizontal-to-vertical spectral ratio (HVSR) and ellipticity studies confirmed stable site responses across seasons and identified soil thickness trends consistent with regional erosional and depositional processes. Checkerboard and sensitivity tests further validated the robustness of the tomographic results. Overall, the findings emphasize that although significant progress has been made in subsurface imaging, further work is needed to enhance the detection and localization of underground structures. Accurate imaging requires higher frequencies, yet anthropogenic sources tend to dominate the seismic record at those frequencies, and high-frequency surface waves are affected by higher modes that complicate interpretation. The improved detection and localization of human-induced signals enabled detailed temporal and spatial mapping of daily mine operations, demonstrating the feasibility of continuous anthropogenic source monitoring. Sensitivity to signals from nontraditional sources, such as fan operations, highlights the broader applicability of this approach to other industrial environments in which continuous and impulsive signals are present. The field campaigns produced a substantial volume of high-quality seismic data, supporting the development and testing of new methods for seismic source characterization and subsurface imaging. Future deployments should include sensors capable of recording lower frequencies to probe deeper structures, increase bandwidth to enhance resolution and sensitivity to both shallow and deep targets, and collect additional large-scale datasets to refine imaging and source characterization techniques. Moreover, conducting 3D modeling studies of seismic wavefields at higher frequencies will provide a better understanding of wave scattering and cavity–wavefield interactions in complex underground environments. In conclusion, the STILGAR project demonstrated that integrated seismic monitoring can effectively characterize underground operations, capturing both natural and anthropogenic signals. The approaches developed provide a foundation for improved detection, localization, and imaging of subsurface structures and are directly transferable to broader industrial monitoring applications.

58 GEOSCIENCES↗

Optimal pattern distributions in Rete-based production systems

Since its introduction into the AI community in the early 1980's, the Rete algorithm has been widely used. This algorithm has formed the basis for many AI tools, including NASA's CLIPS. One drawback of Rete-based implementation, however, is that the network structures used internally by the Rete algorithm make it sensitive to the arrangement of individual patterns within rules. Thus while rules may be more or less arbitrarily placed within source files, the distribution of individual patterns within these rules can significantly affect the overall system performance. Some heuristics have been proposed to optimize pattern placement, however, these suggestions can be conflicting. This paper describes a systematic effort to measure the effect of pattern distribution on production system performance. An overview of the Rete algorithm is presented to provide context. A description of the methods used to explore the pattern ordering problem area are presented, using internal production system metrics such as the number of partial matches, and coarse-grained operating system data such as memory usage and time. The results of this study should be of interest to those developing and optimizing software for Rete-based production systems.

Scott, Stephen L.↗

Estimation of Boreal Forest Biomass Using Spaceborne SAR Systems

In this paper, we report on the use of a semiempirical algorithm derived from a two layer radar backscatter model for forest canopies. The model stratifies the forest canopy into crown and stem layers, separates the structural and biometric attributes of the canopy. The structural parameters are estimated by training the model with polarimetric SAR (synthetic aperture radar) data acquired over homogeneous stands with known above ground biomass. Given the structural parameters, the semi-empirical algorithm has four remaining parameters, crown biomass, stem biomass, surface soil moisture, and surface rms height that can be estimated by at least four independent SAR measurements. The algorithm has been used to generate biomass maps over the entire images acquired by JPL AIRSAR and SIR-C SAR systems. The semi-empirical algorithms are then modified to be used by single frequency radar systems such as ERS-1, JERS-1, and Radarsat. The accuracy. of biomass estimation from single channel radars is compared with the case when the channels are used together in synergism or in a polarimetric system.

Saatchi, Sassan↗

HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks

Biological networks capture structural or functional properties of relevant entities such as molecules, proteins or genes. Characteristic examples are gene expression networks or protein–protein interaction networks, which hold information about functional affinities or structural similarities. Such networks have been expanding in size due to increasing scale and abundance of biological data. While various clustering algorithms have been proposed to find highly connected regions, Markov Clustering (MCL) has been one of the most successful approaches to cluster sequence similarity or expression networks. Despite its popularity, MCL’s scalability to cluster large datasets still remains a bottleneck due to high running times and memory demands. In this paper, we present High-performance MCL (HipMCL), a parallel implementation of the original MCL algorithm that can run on distributed-memory computers. We show that HipMCL can efficiently utilize 2000 compute nodes and cluster a network of ~70 million nodes with ~68 billion edges in ~2.4 h. By exploiting distributed-memory environments, HipMCL clusters large-scale networks several orders of magnitude faster than MCL and enables clustering of even bigger networks. Finally, HipMCL is based on MPI and OpenMP and is freely available under a modified BSD license.

59 BASIC BIOLOGICAL SCIENCES↗

A computational model to generate simulated three-dimensional breast masses

Purpose: To develop algorithms for creating realistic three-dimensional (3D) simulated breast masses and embedding them within actual clinical mammograms. The proposed techniques yield high-resolution simulated breast masses having randomized shapes, with user-defined mass type, size, location, and shape characteristics. Methods: The authors describe a method of producing 3D digital simulations of breast masses and a technique for embedding these simulated masses within actual digitized mammograms. Simulated 3D breast masses were generated by using a modified stochastic Gaussian random sphere model to generate a central tumor mass, and an iterative fractal branching algorithm to add complex spicule structures. The simulated masses were embedded within actual digitized mammograms. The authors evaluated the realism of the resulting hybrid phantoms by generating corresponding left- and right-breast image pairs, consisting of one breast image containing a real mass, and the opposite breast image of the same patient containing a similar simulated mass. The authors then used computer-aided diagnosis (CAD) methods and expert radiologist readers to determine whether significant differences can be observed between the real and hybrid images. Results: The authors found no statistically significant difference between the CAD features obtained from the real and simulated images of masses with either spiculated or nonspiculated margins. Likewise, the authors found that expert human readers performed very poorly in discriminating their hybrid images from real mammograms. Conclusions: The authors’ proposed method permits the realistic simulation of 3D breast masses having user-defined characteristics, enabling the creation of a large set of hybrid breast images containing a well-characterized mass, embedded within real breast background. The computational nature of the model makes it suitable for detectability studies, evaluation of computer aided diagnosis algorithms, and teaching purposes.

60 APPLIED LIFE SCIENCES↗

Formulation of numerical procedures for dynamic analysis of spinning structures

The paper presents the descriptions of recently developed numerical algorithms that prove to be useful for the solution of the free vibration problem of spinning structures. First, a generalized procedure for the computation of nodal centrifugal forces in a finite element owing to any specified spin rate is derived in detail. This is followed by a description of an improved eigenproblem solution procedure that proves to be economical for the free vibration analysis of spinning structures. Numerical results are also presented which indicate the efficacy of the currently developed procedures.

Gupta, K. K.↗

Crystal Structure Prediction of Binary Alloys via Deep Potential

Predicting crystal structure has been a challenging problem in physics and materials science for a long time. A reliable energy calculation engine combined with an efficient global search algorithm, such as particle swarm optimization algorithm or genetic algorithm, is needed to conduct crystal structure prediction. In recent years, machine learning-based interatomic potential energy surface models have been proposed, potentially allowing us to perform crystal structure prediction for systems with the accuracy of density functional theory (DFT) and the speed of empirical force fields. In this paper, we employ a previously developed Deep Potential model to predict the intermetallic compound of the aluminum–magnesium system, and find six meta-stable phases with negative or nearly zero formation energy. In particular, Mg 12 Al 8 shows excellent ductility and Mg 5 Al 27 has a high Young's modulus. Based on our benchmark results, we propose a relatively robust structure screening criterion that selects potentially stable structures from the Deep Potential-based convex hull and performs DFT refinement. By using this criterion, the computational cost needed to construct the convex hull with ab initio accuracy can be dramatically reduced.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Detection and Characterization of Extrasolar Planets through Mean-motion Resonances. II. The Effect of the Planet’s Orbital Eccentricity on Debris Disk Structures

Structures observed in debris disks may be caused by gravitational interaction with planetary or stellar companions. These perturbed disks are often thought to indicate the presence of planets and offer insights into the properties of both the disk and the perturbing planets. Gaps in debris disks may indicate a planet physically present within the gap, but such gaps can also occur away from the planet’s orbit at mean-motion resonances (MMRs), and this is the focus of our interest here. We extend our study of planet–disk interaction through MMRs, presented in an earlier paper, to systems in which the perturbing planet has moderate orbital eccentricity, a common occurrence in exoplanetary systems. In particular, a new result is that the 3:1 MMR becomes distinct at higher eccentricity, while its effects are absent for circular planetary orbits. We also only consider gravitational interaction with a planetary body of at least 1 M {sub J}. Our earlier work shows that even a 1 Earth mass planet can theoretically open an MMR gap; however, given the narrow gap that can be opened by a low-mass planet, its observability would be questionable. We find that the widths, locations, and shapes of two prominent structures, the 2:1 and 3:1 MMRs, could be used to determine the mass, semimajor axis, and eccentricity of the planetary perturber and present an algorithm for doing so. These MMR structures can be used to narrow the position and even determine the planetary properties (such as mass) of any inferred but as-yet-unseen planets within a debris disk. We also briefly discuss the implications of eccentric disks on brightness asymmetries and their dependence on the wavelengths with which these disks are observed.

79 ASTRONOMY AND ASTROPHYSICS↗

Development and application of optimum sensitivity analysis of structures

The research focused on developing an algorithm applying optimum sensitivity analysis for multilevel optimization. The research efforts have been devoted to assisting NASA Langley's Interdisciplinary Research Office (IRO) in the development of a mature methodology for a multilevel approach to the design of complex (large and multidisciplinary) engineering systems. An effort was undertaken to identify promising multilevel optimization algorithms. In the current reporting period, the computer program generating baseline single level solutions was completed and tested out.

Barthelemy, J. F. M.↗

Tracing the efficient curve for multi-objective control-structure optimization

A recently developed active set algorithm for tracing parameterized optima is adapted to multiobjective optimization. The algorithm traces a path of Kuhn-Tucker points using homotopy curve tracking techniques, and is based on identifying and maintaining the set of active constraints. Second order necessary optimality conditions are used to determine nonoptimal stationary points on the path. In the bi-objective optimization case the algorithm is used to trace the curve of efficient solution (Pareto optima). As an example, the algorithm is applied to the simultaneous minimization of the weight and control force of a ten-bar truss with two collocated sensors and actuators, with some interesting results.

Rakowska, J.↗

Hybrid detection of lung nodules on CT scan images

Purpose: The diversity of lung nodules poses difficulty for the current computer-aided diagnostic (CAD) schemes for lung nodule detection on computed tomography (CT) scan images, especially in large-scale CT screening studies. We proposed a novel CAD scheme based on a hybrid method to address the challenges of detection in diverse lung nodules. Methods: The hybrid method proposed in this paper integrates several existing and widely used algorithms in the field of nodule detection, including morphological operation, dot-enhancement based on Hessian matrix, fuzzy connectedness segmentation, local density maximum algorithm, geodesic distance map, and regression tree classification. All of the adopted algorithms were organized into tree structures with multi-nodes. Each node in the tree structure aimed to deal with one type of lung nodule. Results: The method has been evaluated on 294 CT scans from the Lung Image Database Consortium (LIDC) dataset. The CT scans were randomly divided into two independent subsets: a training set (196 scans) and a test set (98 scans). In total, the 294 CT scans contained 631 lung nodules, which were annotated by at least two radiologists participating in the LIDC project. The sensitivity and false positive per scan for the training set were 87% and 2.61%. The sensitivity and false positive per scan for the testing set were 85.2% and 3.13%. Conclusions: The proposed hybrid method yielded high performance on the evaluation dataset and exhibits advantages over existing CAD schemes. We believe that the present method would be useful for a wide variety of CT imaging protocols used in both routine diagnosis and screening studies.

60 APPLIED LIFE SCIENCES↗