Search NASA⌕ Search

SEARCH · Search NASA

Results for “Algorithms and data structure”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Close-mode identification performance of the ITD algorithm

Results of Monte Carlo numerical simulations conducted to study the close-mode performance of the Ibrahim Time-Domain (ITD) modal identification algorithm are presented. The ITD technique is a matrix eigensolution method for obtaining structural modal parameters directly from free-response test data without using the FFT. Thus, the well-known resolution and leakage limitations of the FFT procedure, that are particularly significant with short records, are avoided. As an example, one of several experimental data analyses where close modes have been accurately identified using very short records is shown. Although the identification scatter is found to increase as the square of reductions in frequency separation at small separations, the ability to differentiate modes spaced at fractions of the FFT resolution is substantiated.

Pappa, R. S.↗
NASA NTRS1989

The topology of large-scale structure. III - Analysis of observations

A recently developed algorithm for quantitatively measuring the topology of large-scale structures in the universe was applied to a number of important observational data sets. The data sets included an Abell (1958) cluster sample out to Vmax = 22,600 km/sec, the Giovanelli and Haynes (1985) sample out to Vmax = 11,800 km/sec, the CfA sample out to Vmax = 5000 km/sec, the Thuan and Schneider (1988) dwarf sample out to Vmax = 3000 km/sec, and the Tully (1987) sample out to Vmax = 3000 km/sec. It was found that, when the topology is studied on smoothing scales significantly larger than the correlation length (i.e., smoothing length, lambda, not below 1200 km/sec), the topology is spongelike and is consistent with the standard model in which the structure seen today has grown from small fluctuations caused by random noise in the early universe. When the topology is studied on the scale of lambda of about 600 km/sec, a small shift is observed in the genus curve in the direction of a 'meatball' topology.

Gott, J. Richard, III↗
NASA NTRS2009

NASA Biomedical Informatics Capabilities and Needs

To improve on-orbit clinical capabilities by developing and providing operational support for intelligent, robust, reliable, and secure, enterprise-wide and comprehensive health care and biomedical informatics systems with increasing levels of autonomy, for use on Earth, low Earth orbit & exploration class missions. Biomedical Informatics is an emerging discipline that has been defined as the study, invention, and implementation of structures and algorithms to improve communication, understanding and management of medical information. The end objective of biomedical informatics is the coalescing of data, knowledge, and the tools necessary to apply that data and knowledge in the decision-making process, at the time and place that a decision needs to be made.

Johnson-Throop, Kathy A.↗
DOE OSTI2026

Dynamic Transmission Line Switching Amid Wildfire-Prone Weather Under Decision-Dependent Uncertainty

During dry and windy seasons, environmental conditions significantly increase the risk of wildfires, exposing power grids to disruptions caused by transmission line failures. Wildfire propagation exacerbates grid vulnerability, potentially leading to prolonged power outages. To address this challenge, we propose a multistage optimization model that dynamically adjusts transmission grid topology in response to wildfire propagation, aiming to develop an optimal response policy. By accounting for decision-dependent uncertainty, where line survival probabilities depend on usage, we employ distributionally robust optimization to model uncertainty in line survival distributions. We adapt the stochastic nested decomposition algorithm and derive a deterministic upper bound for its finite convergence. To enhance computational efficiency, we exploit the Lagrangian dual problem structure for a faster generation of Lagrangian cuts. Using realistic data from the California transmission grid, we demonstrate the superior performance of dynamic response policies against two-stage alternatives through a comprehensive case study. In addition, after solving the multistage formulation, we construct easy-to-implement policies that significantly reduce computational burden while maintaining good performance in real-time deployment. History: Accepted by Russell Bent, Area Editor for Network Optimization: Algorithms and Applications. Funding: This work was supported by the U.S. Department of Energy, Office of Electricity [Grant DE-AC02-05CH11231]. The work of R. Jiang was supported in part by the U.S. National Science Foundation, Division of Electrical, Communications and Cyber Systems [Grant ECCS-1845980] and the U.S. Air Force Office of Scientific Research [Grant FA9550-23-1-0323]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2025.1210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2025.1210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .

Estrada-Garcia, Juan-Alberto↗
NASA NTRS1995

Fast Multipole Methods for Three-Dimensional N-body Problems

We are developing computational tools for the simulations of three-dimensional flows past bodies undergoing arbitrary motions. High resolution viscous vortex methods have been developed that allow for extended simulations of two-dimensional configurations such as vortex generators. Our objective is to extend this methodology to three dimensions and develop a robust computational scheme for the simulation of such flows. A fundamental issue in the use of vortex methods is the ability of employing efficiently large numbers of computational elements to resolve the large range of scales that exist in complex flows. The traditional cost of the method scales as Omicron (N(sup 2)) as the N computational elements/particles induce velocities at each other, making the method unacceptable for simulations involving more than a few tens of thousands of particles. In the last decade fast methods have been developed that have operation counts of Omicron (N log N) or Omicron (N) (referred to as BH and GR respectively) depending on the details of the algorithm. These methods are based on the observation that the effect of a cluster of particles at a certain distance may be approximated by a finite series expansion. In order to exploit this observation we need to decompose the element population spatially into clusters of particles and build a hierarchy of clusters (a tree data structure) - smaller neighboring clusters combine to form a cluster of the next size up in the hierarchy and so on. This hierarchy of clusters allows one to determine efficiently when the approximation is valid. This algorithm is an N-body solver that appears in many fields of engineering and science. Some examples of its diverse use are in astrophysics, molecular dynamics, micro-magnetics, boundary element simulations of electromagnetic problems, and computer animation. More recently these N-body solvers have been implemented and applied in simulations involving vortex methods. Koumoutsakos and Leonard (1995) implemented the GR scheme in two dimensions for vector computer architectures allowing for simulations of bluff body flows using millions of particles. Winckelmans presented three-dimensional, viscous simulations of interacting vortex rings, using vortons and an implementation of a BH scheme for parallel computer architectures. Bhatt presented a vortex filament method to perform inviscid vortex ring interactions, with an alternative implementation of a BH scheme for a Connection Machine parallel computer architecture.

Koumoutsakos, P.↗
NASA NTRS1988

Arctic Sea ice studies with passive microwave satellite observations

The objectives of this research are: (1) to improve sea ice concentration determinations from passive microwave space observations; (2) to study the role of Arctic polynyas in the production of sea ice and the associated salinization of Arctic shelf water; and (3) to study large scale sea ice variability in the polar oceans. The strategy is to analyze existing data sets and data acquired from both the DMSP SSM/I and recently completed aircraft underflights. Special attention will be given the high resolution 85.5 GHz SSM/I channels for application to thin ice algorithms and processes studies. Analysis of aircraft and satellite data sets is expected to provide a basis for determining the potential of the SSM/I high frequency channels for improving sea ice algorithms and for investigating oceanic processes. Improved sea ice algorithms will aid the study of Arctic coastal polynyas which in turn will provide a better understanding of the role of these polynyas in maintaining the Arctic watermass structure. Analysis of satellite and archived meteorological data sets will provide improved estimates of annual, seasonal and shorter-term sea ice variability.

Cavalieri, D. J.↗
NASA NTRS1992

Improved interpretation of satellite altimeter data using genetic algorithms

Genetic algorithms (GA) are optimization techniques that are based on the mechanics of evolution and natural selection. They take advantage of the power of cumulative selection, in which successive incremental improvements in a solution structure become the basis for continued development. A GA is an iterative procedure that maintains a 'population' of 'organisms' (candidate solutions). Through successive 'generations' (iterations) the population as a whole improves in simulation of Darwin's 'survival of the fittest'. GA's have been shown to be successful where noise significantly reduces the ability of other search techniques to work effectively. Satellite altimetry provides useful information about oceanographic phenomena. It provides rapid global coverage of the oceans and is not as severely hampered by cloud cover as infrared imagery. Despite these and other benefits, several factors lead to significant difficulty in interpretation. The GA approach to the improved interpretation of satellite data involves the representation of the ocean surface model as a string of parameters or coefficients from the model. The GA searches in parallel, a population of such representations (organisms) to obtain the individual that is best suited to 'survive', that is, the fittest as measured with respect to some 'fitness' function. The fittest organism is the one that best represents the ocean surface model with respect to the altimeter data.

Messa, Kenneth↗
DOE OSTI2026

buhito

buhito is a Python library for graph analysis and machine learning. Graphs can represent networks with objects as nodes and their relationships as edges. buhito focuses on graphlet methods that study graphs through enumerating their component subgraphs to enable interpretable and fast models of complex systems. The package provides tools for different algorithmic designs for computing, analyzing, and applying graphlets to research problems such as machine learning, data compression, and anomaly detection in graph-structured data. A central feature is performing decomposition data analysis on graphs for machine learning models. Implemented in Python and built upon open-source scientific libraries such as NetworkX, NumPy, and SciPy, buhito provides high-performance methods for researchers exploring the mathematical and computational foundations of graphlet analysis applicable to systems of different sizes.

Pimonova, Yulia↗
NASA NTRS1987

Real-time operational planning for the U.S. air traffic system

This paper describes an integrated planning model for the U.S. air traffic system. The approach incorporates the dual objectives of monitoring collision risk while minimizing transportation costs. Specialized solution algorithms exploit the underlying structure of the model - especially for large-scale examples. The proposed formulation is tested with real-world data for the Indianapolis control sector. Additional experiments with a CRAY X-MP/24 supercomputer show that a full-scale model can be solved under real time conditions. Despite these advances, additional work is required in developing a practical system. Suggestions are made for combining advances in computer graphics and mathematical modeling.

Mulvey, John M.↗
NASA NTRS1991

Global lightning studies

The global lightning signatures were analyzed from the DMSP Optical Linescan System (OLS) imagery archived at the National Snow and Ice Data Center. Transition to analysis of the digital archive becomes available and compare annual, interannual, and seasonal variations with other global data sets. An initial survey of the quality of the existing film archive was completed and lightning signatures were digitized for the summer months of 1986 to 1987. The relationship is studied between: (1) global and regional lightning activity and rainfall, and (2) storm electrical development and environment. Remote sensing data sets obtained from field programs are used in conjunction with satellite/radar/lightning data to develop and improve precipitation estimation algorithms, and to provide a better understanding of the co-evolving electrical, microphysical, and dynamical structure of storms.

Goodman, Steven J.↗
NASA NTRS2004

Reduced-Order Modeling and Wavelet Analysis of Turbofan Engine Structural Response Due to Foreign Object Damage (FOD) Events

The development of a wavelet-based feature extraction technique specifically targeting FOD-event induced vibration signal changes in gas turbine engines is described. The technique performs wavelet analysis of accelerometer signals from specified locations on the engine and is shown to be robust in the presence of significant process and sensor noise. It is envisioned that the technique will be combined with Kalman filter thermal/health parameter estimation for FOD-event detection via information fusion from these (and perhaps other) sources. Due to the lack of high-frequency FOD-event test data in the open literature, a reduced-order turbofan structural model (ROM) was synthesized from a finite element model modal analysis to support the investigation. In addition to providing test data for algorithm development, the ROM is used to determine the optimal sensor location for FOD-event detection. In the presence of significant noise, precise location of the FOD event in time was obtained using the developed wavelet-based feature.

Turso, James↗
NASA NTRS2006

Probabilistic Classification Using Elemental Abundance Distributions and Lossless Image Compression in Apollo 17 Lunar Dust Samples from Mare Serenitatis

We have previously outlined a strategy for the detection of fossils [Storrie-Lombardi and Hoover, 2004] and extant microbial life [Storrie-Lombaudi and Hoover, 20051 during robotic missions to Mars using co-registered structural and chemical signatures. Data inputs included image lossless compression indices to estimate relative textural complexity and elemental abundance distributions. Two exploratory classification algorithms (principal component analysis and hierarchical cluster analysis) provide an initial tentative classification of all targets. Nonlinear stochastic neural networks are then trained to produce a Bayesian estimate of algorithm classification accuracy. The strategy previously has been successful in distinguishing regions of biotic and abiotic alteration of basalt glass from unaltered samples. [Storrie-Lombardi and Fisk, 2004; Storrie-Lombardi and Fisk, 2004] Such investigations of abiotic versus biotic alteration of terrestrial mineralogy on Earth are compromised by .the difficulty finding mineralogy completely unaffected by the ubiquitous presence of microbial life on the planet. The renewed interest in lunar exploration offers an opportunity to investigate geological materials that may exhibit signs of aqueous alteration, but are highly unlikely to contain contaminating biological weathering signatures. We here present an extension of our earlier data set to include lunar dust samples obtained during the Apollo 17 mission. Apollo 17 landed in the Taurus-Littrow Valley in Mare Serenitatis. Most of the rock samples from this region of the lunar highlands are basalts comprised primarily of plagioclase and pyroxene and selected examples of orange and black volcanic glass. SEM images and elemental abundances (C6, N7, O8, Na11, Mg12, Al13, Si14, P15, S16, Cll7, K19, Ca20, Fe26) for a series of targets in the lunar dust samples are compared to the extant cyanobacteria, fossil trilobites, Orgueil meteorite, and terrestrial basalt targets previously discussed. The data set provides a first step in producing a quantitative probabilistic methodology for geobiological analysis of returned lunar samples or in situ exploration.

Storrie-Lombardi, Michael C.↗
NASA NTRS2021

Colorado Front Range Disasters: Understanding the Impact of Forest Management on the Cameron Peak and CalWood Fire

Along the Colorado Front Range, forest management has gained significant attention due to uncharacteristically large fires that burned late in 2020. The Cameron Peak Fire (largest in Colorado recorded history) and the CalWood Fire collectively burned an estimated 219,019 acres from August through December of 2020. Project partners at the Coalition for the Poudre River Watershed, Colorado State Forest Service, Ben Delatour Scout Ranch, The Nature Conservancy, Colorado Forest Restoration Institute, and Colorado State University were interested in understanding the effectiveness of previous forest treatments in reducing burn severity within the Cameron Peak Fire and the CalWood Fire. We first collated a forest treatment dataset from pre-existing datasets by reclassifying over 29,000 treatments, which occurred across the Northern Colorado Front Range between 1970-2020. Secondly, we mapped three burn severity indices using Landsat 8 OLI and Sentinel-2 MSI Earth observations and compared them to soil burn severity field data. Thirdly, a total of 35 topographic, disturbance, forest structure, and treatment predictor variables were generated across the fires. Finally, we assessed relationships between these predictor variables and burn severity using the random forest algorithm. Model results indicate that the primary drivers of burn severity were elevation and distance to treatment edge for the Cameron Peak Fire and fire area and forest canopy cover for the CalWood Fire. Further analysis of these variables paired with field data is necessary to understand the relationship between burn severity and treatments to guide future restoration efforts, improve forest resiliency, and mitigate fire risks.

Neal Swayze↗
NASA NTRS1984

Region-based modeling algorithms for remotely-sensed data

Five algorithms being developed for performing region-based modeling operations on classified remotely-sensed images are described. The first algorithm converts images from standard grid structure into topological grid structure, while the remaining algorithms act upon topologically grid-structured images to perform region-based relabelling, overlaying, distance searching, and neighborhood scanning operations. The use of precomputed topological information, through the use of topological grid structure, makes region-based algorithms highly accessible to earth scientists.

Goldberg, M.↗
NASA NTRS2007

Automated Recognition of 3D Features in GPIR Images

A method of automated recognition of three-dimensional (3D) features in images generated by ground-penetrating imaging radar (GPIR) is undergoing development. GPIR 3D images can be analyzed to detect and identify such subsurface features as pipes and other utility conduits. Until now, much of the analysis of GPIR images has been performed manually by expert operators who must visually identify and track each feature. The present method is intended to satisfy a need for more efficient and accurate analysis by means of algorithms that can automatically identify and track subsurface features, with minimal supervision by human operators. In this method, data from multiple sources (for example, data on different features extracted by different algorithms) are fused together for identifying subsurface objects. The algorithms of this method can be classified in several different ways. In one classification, the algorithms fall into three classes: (1) image-processing algorithms, (2) feature- extraction algorithms, and (3) a multiaxis data-fusion/pattern-recognition algorithm that includes a combination of machine-learning, pattern-recognition, and object-linking algorithms. The image-processing class includes preprocessing algorithms for reducing noise and enhancing target features for pattern recognition. The feature-extraction algorithms operate on preprocessed data to extract such specific features in images as two-dimensional (2D) slices of a pipe. Then the multiaxis data-fusion/ pattern-recognition algorithm identifies, classifies, and reconstructs 3D objects from the extracted features. In this process, multiple 2D features extracted by use of different algorithms and representing views along different directions are used to identify and reconstruct 3D objects. In object linking, which is an essential part of this process, features identified in successive 2D slices and located within a threshold radius of identical features in adjacent slices are linked in a directed-graph data structure. Relative to past approaches, this multiaxis approach offers the advantages of more reliable detections, better discrimination of objects, and provision of redundant information, which can be helpful in filling gaps in feature recognition by one of the component algorithms. The image-processing class also includes postprocessing algorithms that enhance identified features to prepare them for further scrutiny by human analysts (see figure). Enhancement of images as a postprocessing step is a significant departure from traditional practice, in which enhancement of images is a preprocessing step.

Park, Han↗
DOE OSTI2026

Simplex‐based model for nanoparticle grain identification in four‐dimensional scanning transmission electron microscopy data

Grain identification in polycrystalline nanoparticles, for example, determining which crystal phases are present at each spatial location, is fundamental to materials characterisation. This is particularly challenging when grains overlap extensively, as commonly occurs in four-dimensional scanning transmission electron microscopy (4D-STEM) datasets. We propose a simplex-based model (SBM) in which each simplex vertex represents the diffraction pattern (DP) of a pure grain, and the simplex edges and interior represent overlapping grains. Our SBM grain identification algorithm operates on the Bragg disk (BD) data matrix distilled from the 4D-STEM data to identify the grain membership at each scan position, together with a BD feature matrix whose columns represent the DPs for each constituent grain, which is important for identifying the crystal structure of each grain. We solve the model using a two-stage algorithm. In Stage 1, we adapt a linear mixing algorithm to estimate an initial BD feature matrix whose columns represent DPs of potentially overlapping grains. Our Stage 2 algorithm incorporates sparsity considerations to transform the initial BD feature matrix so that its columns represent DPs of pure grains. Using simulated datasets with various grain configurations, we demonstrate that SBM recovers both the BD feature matrix and membership maps more accurately than existing methods, even when a grain lacks any pure region and completely overlaps with other grains.

4D-STEM segmentation↗
DOE OSTI2025

Tactical Analysis for Calculating Contextual Risk at Boundaries: Summary of Laboratory Directed Research & Development Effort

The Tactical Analysis for Calculating Contextual Risk at Boundaries (TACCRAB) tool is an innovative digital twin (DT) platform and automated risk algorithm designed to transform operational decision-making in structured screening environments, with an initial focus on Southern Border Land Ports of Entry (POEs). The invention provides integration points for advanced artificial intelligence, predictive modeling, and real-time data analysis to produce a comprehensive risk management tool that enables proactive, data-informed security strategies. The core inventive features of TACCRAB center on its unique risk algorithm, which dynamically calculates contextual risk by synthesizing historical data, near real-time streaming data from the checkpoints themselves, and AI-generated predictions. Unlike traditional risk assessment methods, TACCRAB utilizes a DT to provide comprehensive operational insights, allowing stakeholders to visualize, simulate, and optimize checkpoint configurations with unprecedented speed and contextual awareness. TACCRAB's key innovation lies in its ability to combine multiple complex inputs - including technology detection probabilities, resource availability, screening pathway characteristics, and threat actor behavioral patterns - into a unified risk calculation and update these inputs based on changing operational and environmental conditions. By leveraging a DT that continuously updates and learns from linked data, TACCRAB can suggest adaptive mitigation strategies that minimize risk while maintaining operational efficiency. Particularly novel is the platform's approach to decision support, which goes beyond static risk assessment. The DT provides dynamic metrics such as wait times, resource allocation effectiveness, and potential emerging threat scenarios, enabling users to view sophisticated, relevant what-if simulations and optimize checkpoint operations in near real-time. The system's architecture allows for generalized application across different screening environments, such as secure facilities, ports of entry, and soft targets, making it a versatile tool for security and operational management. The invention distinguishes itself through its comprehensive integration of predictive modeling, AI-driven pattern discovery, and user-friendly interface design. By combining these elements, TACCRAB transforms complex risk data into actionable insights, supporting decision-makers at various organizational levels - from booth agents making split-second screening decisions to checkpoint managers optimizing the day's resource allocation to strategic planners managing long-term investments.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
NASA NTRS1991

Identification and control of NASA's ACES structures

Results are presented of identification and control experiments on NASA's ACES structure at the Marshall Space Flight Center. The models used for controller design were obtained from identification experiments employing the algorithm Q-Markov cover. The OVC algorithm used for control design produces a controller minimizing the control energy of the closed-loop system, subject to inequality constraints on each of the output variances. The identified model matches the experimental data for the ACES structure reasonably well. The line of sight pointing errors of the structure are substantially reduced by the controllers.

Liu, K.↗