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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Selection of high-redshift Lyman-Break Galaxies from broadband and wide photometric surveys

In this paper, we investigate the possibility of selecting high-redshift Lyman-Break Galaxies (LBG) using current and future broadband wide photometric surveys, such as the Ultraviolet Near Infrared Optical Northern Survey (UNIONS) or the Vera C. Rubin Legacy Survey of Space and Time (LSST), using a Random Forest algorithm. This work is conducted in the context of future large-scale structure spectroscopic surveys like DESI-II, the next phase of the Dark Energy Spectroscopic Instrument (DESI), which will start around 2029.We use deep imaging data from the Hyper Suprime Camera (HSC) and the Canada-France-Hawaii Telescope Large Area U-band Deep Survey (CLAUDS) on the COSMOS and XMM-LSS fields. To predict the selection performance of LBGs with image quality similar to UNIONS, we degrade the u,g,r,i and z bands to UNIONS depth.The Random Forest algorithm is trained with the u,g,r,i and z bands to classify LBGs in the 2.5 < z < 3.5 range.We find that fixing a target density budget of 1,100 deg$^{-2}$, the Random Forest approach gives a density of z > 2 targets of 873 deg$^{-2}$, and a density of 493 deg$^{-2}$ of confirmed LBGs after spectroscopic confirmation with DESI. This UNIONS-like selection was tested in a dedicated spectroscopic observation campaign of 1,000 targets with DESI on the COSMOS field, providing a safe spectroscopic sample with a mean redshift of 3. This sample is used to derive forecasts for DESI-II, assuming a sky coverage of 5,000 deg$^{2}$. We predict uncertainties on Alcock-Paczynski parameters α$_{⊥}$ and α$_{∥}$ to be 0.7% and 1% for 2.6 < z < 3.2, resulting in a potential 2% measurement of the dark energy fraction at high redshift. Additionally, we estimate the uncertainty in local non-Gaussianity and predict σ$_{fNL}$ ≈ 7, which would be comparable to the current best precision achieved by Planck. The latter forecast suggests that achieving the precision required to place stringent constraints on inflationary models (σ$_{fNL}$ ≈ 1) using spectroscopic galaxy surveys necessitates the development of a next-generation (Stage V) spectroscopic survey.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1997

Independent Analysis of the Space Station Node Modal Test Data

With complex structures, comparison of independently derived sets of experimental modal parameters is an excellent way to increase confidence in the results. This paper presents modal identification results using the Eigensystem Realization Algorithm (ERA) on frequency response functions from the modal test of the Space Station Resource Node. The Resource Node is the first U.S.-built structure for the International Space Station. The modal test was conducted by the NASA Marshall Space Flight Center (MSFC) in January 1997 for the Boeing Company, who designed and built the Node. The ERA-calculated parameters are compared with independent results obtained by the MSFC test team using commercial software. There was excellent correlation of mode shapes between the two sets of results for the first 21 vibration modes of the structure up to 35 Hz. From 35 to 50 Hz, about 60 percent of 25 additional modes had excellent correlation. Natural frequencies and damping factors of most modes agreed within 0.1 Hz and 0.2 percent, respectively.

Pappa, Richard S.↗
NASA NTRS1990

Representation of high frequency Space Shuttle data by ARMA algorithms and random response spectra

High frequency Space Shuttle lift-off data are treated by autoregressive (AR) and autoregressive-moving-average (ARMA) digital algorithms. These algorithms provide useful information on the spectral densities of the data. Further, they yield spectral models which lend themselves to incorporation to the concept of the random response spectrum. This concept yields a reasonably smooth power spectrum for the design of structural and mechanical systems when the available data bank is limited. Due to the non-stationarity of the lift-off event, the pertinent data are split into three slices. Each of the slices is associated with a rather distinguishable phase of the lift-off event, where stationarity can be expected. The presented results are rather preliminary in nature; it is aimed to call attention to the availability of the discussed digital algorithms and to the need to augment the Space Shuttle data bank as more flights are completed.

Spanos, P. D.↗
NASA NTRSDate not supplied

Multigraph-based Routing in Delay Tolerant Networks: An Alternative to Contact Graph Routing

Satellites are leaving the realms of niche use, extending our day-to-day networked infrastructure to space – thereby forcing a generalization of network architectures. The Delay Tolerant Networking (DTN) protocol is being developed to give rise to this new Solar System Internet. Predominantly, DTNs in space use globally-distributed contact tables to compute routes. In this paper, we propose and analyze a novel optimized approach for route computations that improves upon traditional approaches. As the general DTN will always include some scheduled links, our new algorithm enables greater scalability and practicality of DTN routing. These contact tables include windows when two nodes can communicate and were classically organized into a contact graph, where the vertices represent contact opportunities. Because the complexity of a contact graph grows with the number of contacts, pathfinding on it does not scale. A new structure using multigraphs with the same data is proposed. We show that a multigraph-based approach, which we call contact multigraph routing, exhibits performance superior to routing based on contact graphs, allowing greater scaling to schedule-based routing. In this paper, the multigraph-based algorithm is detailed and a proof is included showing it outperforms the previous algorithm given the same input. Pseudocode is included, as are simulation results. We conclude with suggested future work.

Delay Tolerant Networking↗
NASA NTRS2023

User Guide for TROPICS Data Products

This document provides information for using the data products available from the “Time-Resolved Observations of Precipitation structure and storm Intensity with a Constellation of Smallsats” (TROPICS) mission. The TROPICS mission will produce a range of data products that will be available at the NASA Goddard Earth Sciences Data and Information Services Center (GES DISC). The data products will be produced at the TROPICS Data Processing Center (UW-M SSEC), and consist of Level-1 radiances (antenna and brightness temperatures), Level-2a unified resolution radiance, Level-2b Atmospheric Vertical Temperature Profiles (AVTP), Level-2b Atmospheric Vertical Moisture Profiles (AVMP), Level-2b Instantaneous Surface Rain Rate (ISRR), and Level-2b Tropical Cyclone (TC) intensity algorithms to estimate two primary variables: Minimum Sea Level Pressure (MSLP) and Maximum Sustained Winds (MSW). Two independent intensity estimation methods are included: 1) the Tropical Cyclone Intensity Estimate algorithm (TCIE) developed at the University of Wisconsin/CIMSS using native microwave brightness temperatures and 2) the Hurricane Intensity and Structure Algorithm (HISA) developed at Colorado State University/CIRA using microwave retrievals of temperature, moisture, and integrated quantities. In addition to MSW and MSLP, HISA also provides estimates of surface wind radii and 2D winds at standard pressure levels. TROPICS is adapting the NOAA STAR Microwave Integrated Retrieval System (MIRS) to retrieve the AVTP and AVMP data products. The ISRR algorithm uses the NASA Goddard Precipitation Retrieval and Profiling Scheme (PRPS).

TROPICS↗
NASA NTRS1994

Software reliability studies

There are many software reliability models which try to predict future performance of software based on data generated by the debugging process. Our research has shown that by improving the quality of the data one can greatly improve the predictions. We are working on methodologies which control some of the randomness inherent in the standard data generation processes in order to improve the accuracy of predictions. Our contribution is twofold in that we describe an experimental methodology using a data structure called the debugging graph and apply this methodology to assess the robustness of existing models. The debugging graph is used to analyze the effects of various fault recovery orders on the predictive accuracy of several well-known software reliability algorithms. We found that, along a particular debugging path in the graph, the predictive performance of different models can vary greatly. Similarly, just because a model 'fits' a given path's data well does not guarantee that the model would perform well on a different path. Further we observed bug interactions and noted their potential effects on the predictive process. We saw that not only do different faults fail at different rates, but that those rates can be affected by the particular debugging stage at which the rates are evaluated. Based on our experiment, we conjecture that the accuracy of a reliability prediction is affected by the fault recovery order as well as by fault interaction.

Hoppa, Mary Ann↗
DOE OSTI2024

The CXSFIT spectral fitting code: Past, present and future

Magnetically confined plasma experiments generate a wealth of spectroscopic data. The first step toward extracting physical parameters is to fit a spectral model to the often complex spectra. The CXSFIT (Charge eXchange Spectroscopy FITting) spectral fitting code was originally developed for fitting charge exchange spectra on JET from the late 1980s onward and has been further developed over decades to keep up with the needs of the users. The primary use is to efficiently fit a large number of spectra with many constrained Gaussian spectral lines of which the physical parameters can be coupled in a user-friendly manner. More recent additions to the code include time-dependent couplings between parameters, flexible background subtraction, and a non-linear coupling scheme between fit parameters. The latter was a pre-requisite for implementing Zeeman and motional Stark effect multiplets in the library of spectral features. The ability to save and replay “fit recipes,” even when multiple iterations are required, has ensured the traceability of the results and is one of the keys to the longevity and success of the code. The code is also in use on other tokamaks (AUG, ST-40) and to fit data from other spectroscopic diagnostics on JET. In this paper, we document the current capabilities and philosophy behind the structure of the code, including some of the algorithms used to calculate spectral features numerically efficiently. We also provide an outline of how CXSFIT could be transferred into a framework that would be able to meet the spectral fitting requirements of future devices, such as ITER.

Delabie, Ephrem G.↗
DOE OSTI2024

Scalable Tensor Methods for Nonuniform Hypergraphs

While multilinear algebra appears natural for studying the multiway interactions modeled by hypergraphs, tensor methods for general hypergraphs have been stymied by theoretical and practical barriers. A recently proposed adjacency tensor is applicable to nonuniform hypergraphs, but is prohibitively costly to form and analyze in practice. We develop tensor times same vector (TTSV) algorithms for this tensor which improve complexity from $O(n^r)$ to a low-degree polynomial in $r$, where $n$ is the number of vertices and $r$ is the maximum hyperedge size. Our algorithms are implicit, avoiding formation of the order $r$ adjacency tensor. Here, we demonstrate the flexibility and utility of our approach in practice by developing tensor-based hypergraph centrality and clustering algorithms. We also show these tensor measures offer complementary information to analogous graph-reduction approaches on data, and are also able to detect higher-order structure that many existing matrix-based approaches provably cannot.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Hiperclust

This software leverages transfer learning to analyze atom probe tomography (APT) data. It is trained on synthetic data and then applies this knowledge to predict the optimal number of clusters for a given APT dataset. Initially, the software used preliminary clustering to estimate the general structure of the data. Based on this, it provides suggestions for key parameters like minimum cluster size and minimum number of points. These parameters are critical for algorithms like HDBSCAN, ensuring accurate cluster formation without the need for trial-and-error testing. The software runs on High-Performance computing (HPC) systems, enabling fast, scalable analysis of large APT datasets, ultimately saving time and improving the reliability of clustering outcomes.

Tang, Yalei [Idaho National Laboratory (INL), Idah↗
DOE OSTI2024

BeyondFingerprinting: AI-guided discovery of robust materials & processes

BeyondFingerprinting was a 2021-2024 Sandia Grand Challenge LDRD exploring the potential to develop new resilient materials and manufacturing processes by taking an artificial-intelligence (AI)-guided approach that integrates human-subject-matter expertise with algorithms enriched with physics-based constraints to unearth process-structure-property correlations. Such algorithms, trained on high-throughput experiments and simulations, are shown to serve as surrogate models that efficiently detect key “fingerprints” in materials data, prognose material performance, and guide effective process improvements. To accelerate broader adoption across mission areas, this AI-guided approach was demonstrated with three complex process-centric exemplars: electroplating, physical vapor deposition, and laser powder bed fusion. Together, these exemplars impact nearly every hardware component relevant to DOE and NNSA national security missions.

36 MATERIALS SCIENCE↗
NASA NTRS1976

An algorithm to compute the sequency ordered Walsh transform

A fast sequency-ordered Walsh transform algorithm is presented; this sequency-ordered fast transform is complementary to the sequency-ordered fast Walsh transform introduced by Manz (1972) and eliminating gray code reordering through a modification of the basic fast Hadamard transform structure. The new algorithm retains the advantages of its complement (it is in place and is its own inverse), while differing in having a decimation-in time structure, accepting data in normal order, and returning the coefficients in bit-reversed sequency order. Applications include estimation of Walsh power spectra for a random process, sequency filtering and computing logical autocorrelations, and selective bit reversing.

Larsen, H.↗
NASA NTRS1978

Trends and techniques for space base electronics

A system was developed for depositing aluminum and aluminum alloys by the D.C. sputtering technique. This system which was designed for a high level of cleanliness and ion monitoring the deposition parameters during film preparation is ready for studying the deposition and annealing parameters upon double level metal preparation. The finite element method was studied for use in the computer modeling of two dimensional MOS transistor structures. An algorithm was developed for implementing a computer study which is based upon the finite difference method. The program was modified and used to calculate redistribution data for boron and phosphorous which had been predeposited by ion implantation with range and straggle conditions typical of those used at MSFC. Data were generated for 111 oriented SOS films with redistribution in N2, dry O2 and steam ambients. Data are given showing both two dimensional effects and the evolution of the junction depth, sheet resistance and integrated dose with redistribution time.

Gassaway, J. D.↗
NASA NTRS1987

Automating the parallel processing of fluid and structural dynamics calculations

The NASA Lewis Research Center is actively involved in the development of expert system technology to assist users in applying parallel processing to computational fluid and structural dynamic analysis. The goal of this effort is to eliminate the necessity for the physical scientist to become a computer scientist in order to effectively use the computer as a research tool. Programming and operating software utilities have previously been developed to solve systems of ordinary nonlinear differential equations on parallel scalar processors. Current efforts are aimed at extending these capabilities to systems of partial differential equations, that describe the complex behavior of fluids and structures within aerospace propulsion systems. This paper presents some important considerations in the redesign, in particular, the need for algorithms and software utilities that can automatically identify data flow patterns in the application program and partition and allocate calculations to the parallel processors. A library-oriented multiprocessing concept for integrating the hardware and software functions is described.

Arpasi, Dale J.↗
NASA NTRS1987

Automating the parallel processing of fluid and structural dynamics calculations

The NASA Lewis Research Center is actively involved in the development of expert system technology to assist users in applying parallel processing to computational fluid and structural dynamic analysis. The goal of this effort is to eliminate the necessity for the physical scientist to become a computer scientist in order to effectively use the computer as a research tool. Programming and operating software utilities have previously been developed to solve systems of ordinary nonlinear differential equations on parallel scalar processors. Current efforts are aimed at extending these capabilties to systems of partial differential equations, that describe the complex behavior of fluids and structures within aerospace propulsion systems. This paper presents some important considerations in the redesign, in particular, the need for algorithms and software utilities that can automatically identify data flow patterns in the application program and partition and allocate calculations to the parallel processors. A library-oriented multiprocessing concept for integrating the hardware and software functions is described.

Arpasi, Dale J.↗
NASA NTRS1995

A structured multi-block solution-adaptive mesh algorithm with mesh quality assessment

The dynamic solution adaptive grid algorithm, DSAGA3D, is extended to automatically adapt 2-D structured multi-block grids, including adaption of the block boundaries. The extension is general, requiring only input data concerning block structure, connectivity, and boundary conditions. Imbedded grid singular points are permitted, but must be prevented from moving in space. Solutions for workshop cases 1 and 2 are obtained on multi-block grids and illustrate both increased resolution of and alignment with the solution. A mesh quality assessment criteria is proposed to determine how well a given mesh resolves and aligns with the solution obtained upon it. The criteria is used to evaluate the grid quality for solutions of workshop case 6 obtained on both static and dynamically adapted grids. The results indicate that this criteria shows promise as a means of evaluating resolution.

Ingram, Clint L.↗
NASA NTRS1996

A General-Purpose Optimization Engine for Multi-Disciplinary Design Applications

A general purpose optimization tool for multidisciplinary applications, which in the literature is known as COMETBOARDS, is being developed at NASA Lewis Research Center. The modular organization of COMETBOARDS includes several analyzers and state-of-the-art optimization algorithms along with their cascading strategy. The code structure allows quick integration of new analyzers and optimizers. The COMETBOARDS code reads input information from a number of data files, formulates a design as a set of multidisciplinary nonlinear programming problems, and then solves the resulting problems. COMETBOARDS can be used to solve a large problem which can be defined through multiple disciplines, each of which can be further broken down into several subproblems. Alternatively, a small portion of a large problem can be optimized in an effort to improve an existing system. Some of the other unique features of COMETBOARDS include design variable formulation, constraint formulation, subproblem coupling strategy, global scaling technique, analysis approximation, use of either sequential or parallel computational modes, and so forth. The special features and unique strengths of COMETBOARDS assist convergence and reduce the amount of CPU time used to solve the difficult optimization problems of aerospace industries. COMETBOARDS has been successfully used to solve a number of problems, including structural design of space station components, design of nozzle components of an air-breathing engine, configuration design of subsonic and supersonic aircraft, mixed flow turbofan engines, wave rotor topped engines, and so forth. This paper introduces the COMETBOARDS design tool and its versatility, which is illustrated by citing examples from structures, aircraft design, and air-breathing propulsion engine design.

Patnaik, Surya N.↗
NASA NTRS2003

Investigation of Spectral Lag and Epeak as Joint Luminosity Indicators in GRBs

Models for gamma-ray bursts which invoke jetted, colliding shells would appear to have at least two determinants for luminosity, e.g., observer viewing angle and Lorentz factor, or possibly shell mass. The latter two internal physical parameters may vary from pulse to pulse within a burst, and such variation might be reflected in evolution of observables such as spectral lag and peak in the spectral energy distribution. We analyze bright BATSE bursts using the 16-channel medium energy resolution (MER) data, with time resolutions of 16 and 64 ms, measuring spectral lags and peak energies for significant pulse structures within a burst, identified using a Bayesian block algorithm. We then explore correlations between the measured parameters and total flux for the individual pulse structures.

White, Nicholas E.↗
NASA NTRS2000

Computer simulation of ion channel gating: the M(2) channel of influenza A virus in a lipid bilayer

The transmembrane fragment of the influenza virus M(2) protein forms a homotetrameric channel that transports protons. In this paper, we use molecular dynamics simulations to help elucidate the mechanism of channel gating by four histidines that occlude the channel lumen in the closed state. We test two competing hypotheses. In the "shuttle" mechanism, the delta nitrogen atom on the extracellular side of one histidine is protonated by the incoming proton, and, subsequently, the proton on the epsilon nitrogen atom is released on the opposite side. In the "water-wire" mechanism, the gate opens because of electrostatic repulsion between four simultaneously biprotonated histidines. This allows for proton transport along the water wire that penetrates the gate. For each system, composed of the channel embedded in a hydrated phospholipid bilayer, a 1.3-ns trajectory was obtained. It is found that the states involved in the shuttle mechanism, which contain either single-protonated histidines or a mixture of single-protonated histidines plus one biprotonated residue, are stable during the simulations. Furthermore, the orientations and dynamics of water molecules near the gate are conducive to proton transfer. In contrast, the fully biprotonated state is not stable. Additional simulations show that if only two histidines are biprotonated, the channel deforms but the gate remains closed. These results support the shuttle mechanism but not the gate-opening mechanism of proton gating in M(2).

NASA Center ARC↗