Search NASA⌕ Search

SEARCH · Search NASA

Results for “interface algorithm”

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 361 records · Page 20

Space Network Control Conference on Resource Allocation Concepts and Approaches

The results are presented of the Space Network Control (SNC) Conference. In the late 1990s, when the Advanced Tracking and Data Relay Satellite System is operational, Space Network communication services will be supported and controlled by the SNC. The goals of the conference were to survey existing resource allocation concepts and approaches, to identify solutions applicable to the Space Network, and to identify avenues of study in support of the SNC development. The conference was divided into three sessions: (1) Concepts for Space Network Allocation; (2) SNC and User Payload Operations Control Center (POCC) Human-Computer Interface Concepts; and (3) Resource Allocation Tools, Technology, and Algorithms. Key recommendations addressed approaches to achieving higher levels of automation in the scheduling process.

Moe, Karen L.↗

Parallel computational fluid dynamics - Implementations and results

The present volume on parallel CFD discusses implementations on parallel machines, numerical algorithms for parallel CFD, and performance evaluation and computer science issues. Attention is given to a parallel algorithm for compressible flows through rotor-stator combinations, a massively parallel Euler solver for unstructured grids, a fast scheme to analyze 3D disk airflow on a parallel computer, and a block implicit multigrid solution of the Euler equations. Topics addressed include a 3D ADI algorithm on distributed memory multiprocessors, clustered element-by-element computations for fluid flow, hypercube FFT and the Fourier pseudospectral method, and an investigation of parallel iterative algorithms for CFD. Also discussed are fluid dynamics using interface methods on parallel processors, sorting for particle flow simulation on the connection machine, a large grain mapping method, and efforts toward a Teraflops capability for CFD.

Simon, Horst D.↗

Performance of the Microwave Anisotropy Probe AST-201 Star Trackers

The Microwave Anisotropy Probe (MAP) was launched to create a full-sky map of the cosmic microwave background. MAP incorporates two modified Lockheed Martin AST-201 (Autonomous Star Tracker) star trackers. The AST-201 employs an eight element radiation hardened lens assembly which is used to focus an image on a charge coupled device (CCD). The CCD image is then processed by a star identification algorithm which outputs a three-axis attitude. A CCD-shift algorithm called Time Delayed Integration (TDI) was also included in each star tracker. In order to provide some radiation effect filtering during MAP's three to five phasing loop passes through the Van Allen radiation belts, a simple pixel filtering scheme was implemented, rather than using a more complex, but more robust windowing algorithm. The trackers also include a fiber optic data interface. This paper details the ground testing that was accomplished on the MAP trackers.

Ward, David K.↗

NASA's Autonomous Formation Flying Technology Demonstration, Earth Observing-1(EO-1)

NASA's first autonomous formation flying mission, the New Millennium Program's (NMP) Earth Observing-1 (EO-1) spacecraft, recently completed its principal goal of demonstrating advanced formation control technology. This paper provides an overview of the evolution of an onboard system that was developed originally as a ground mission planning and operations tool. We discuss the Goddard Space Flight Center s formation flying algorithm, the onboard flight design and its implementation, the interface and functionality of the onboard system, and the implementation of a Kalman filter based GPS data smoother. A number of safeguards that allow the incremental phasing in of autonomy and alleviate the potential for mission-impacting anomalies from the on- board autonomous system are discussed. A comparison of the maneuvers planned onboard using the EO-1 autonomous control system to those from the operational ground-based maneuver planning system is presented to quantify our success. The maneuvers discussed encompass reactionary and routine formation maintenance. Definitive orbital data is presented that verifies all formation flying requirements.

Folta, David↗

GENOA-PFA: Progressive Fracture in Composites Simulated Computationally

GENOA-PFA is a commercial version of the Composite Durability Structural Analysis (CODSTRAN) computer program that simulates the progression of damage ultimately leading to fracture in polymer-matrix-composite (PMC) material structures under various loading and environmental conditions. GENOA-PFA offers several capabilities not available in other programs developed for this purpose, making it preferable for use in analyzing the durability and damage tolerance of complex PMC structures in which the fiber reinforcements occur in two- and three-dimensional weaves and braids. GENOA-PFA implements a progressive-fracture methodology based on the idea that a structure fails when flaws that may initially be small (even microscopic) grow and/or coalesce to a critical dimension where the structure no longer has an adequate safety margin to avoid catastrophic global fracture. Damage is considered to progress through five stages: (1) initiation, (2) growth, (3) accumulation (coalescence of propagating flaws), (4) stable propagation (up to the critical dimension), and (5) unstable or very rapid propagation (beyond the critical dimension) to catastrophic failure. The computational simulation of progressive failure involves formal procedures for identifying the five different stages of damage and for relating the amount of damage at each stage to the overall behavior of the deteriorating structure. In GENOA-PFA, mathematical modeling of the composite physical behavior involves an integration of simulations at multiple, hierarchical scales ranging from the macroscopic (lamina, laminate, and structure) to the microscopic (fiber, matrix, and fiber/matrix interface), as shown in the figure. The code includes algorithms to simulate the progression of damage from various source defects, including (1) through-the-thickness cracks and (2) voids with edge, pocket, internal, or mixed-mode delaminations.

Murthy, Pappu L. N.↗

IMAGESEER - IMAGEs for Education and Research

IMAGESEER is a new Web portal that brings easy access to NASA image data for non-NASA researchers, educators, and students. The IMAGESEER Web site and database are specifically designed to be utilized by the university community, to enable teaching image processing (IP) techniques on NASA data, as well as to provide reference benchmark data to validate new IP algorithms. Along with the data and a Web user interface front-end, basic knowledge of the application domains, benchmark information, and specific NASA IP challenges (or case studies) are provided.

Le Moigne, Jacqueline↗

Hazard Boresight Relative Navigation for Safe Lunar Landing

Hazard Boresight Relative Navigation greatly simplifies Hazard Detection and Avoidance methodologies by providing a common interface between the Hazard DEM, the Safe Site Selection Algorithm, the size of the landing ellipse, the divert distance and the Guidance targeting algorithm. After the Safe Site is selected from the DEM, Hazard Boresight Relative Navigation will replace the original planet target with the boresight target. The location of the safe site relative to the boresight is sent back to GNC for the divert maneuver.

Stephen R. Steffes↗

An Advanced Synchronized Time Digital Grid Twin Testbed for Relay Misoperation Analysis of Electrical Fault Type Detection Algorithms

Distributed energy resources and the number of relays are expected to rise in modern electrical grids; consequently, relay misoperations are also expected to grow. Relays can detect electrical fault types using an internal algorithm and can display the result using light indicators on the front of the relay. However, some relays’ internal algorithms for predicting types of electrical faults could be improved. This study assesses a relay’s external and internal algorithms with an Advanced Synchronized Time Digital Grid Twin (ASTDGT) testbed with paired relays. A misoperation relay analysis focused on measuring the accuracy of using the boundary admittance (the external algorithm) versus the set-default (the internal algorithm) relay method to determine the electrical fault types was performed. In this study, the internal and external relay algorithms were assessed with a synchronized time digital grid twin testbed using a real-time simulator. This testbed evaluated two sets of logic at the same time with the digital grid twin and paired relays in the loop. Different types of electrical faults were simulated, and the relays’ recorded events and electrical fault light indicator states were collected from the human–machine interfaces. This ASTDGT testbed with paired relays successfully evaluated the relay algorithm misoperations. The boundary admittance method had an accuracy of 100% for line-to-line, line-to-ground, and line-to-line ground faults.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Machine Learning Applied to a Variable Charge Atomistic Model for Cu/Hf Binary Alloy Oxide Heterostructures [Machine Learning a Variable Charge Atomistic Model for Cu/Hf Binary Alloy Oxide Heterostructures]

Alloy oxide heterostructures are essential for a wide variety of energy applications, including anticorrosion coatings, bifunctional catalysis, energy storage, as well as emerging platforms for multilevel nonvolatile memory and neuromorphic devices. The key role played by oxide composition, density, and stoichiometry in governing electrochemical reactions, interface structure, and ionic transport in alloy oxides remains largely unknown. This is primarily due to the lack of variable charge interatomic potential models that can adequately describe the various atomic/ionic interactions in alloy oxides within a unified framework. Here, we introduce a charge transfer ionic potential (CTIP) model for Cu/Hf/O alloy system and demonstrate its ability to accurately capture the complex potential energy surface owing to dynamically varying interactions, including metallic (Cu/Hf), ionic (Cu/Hf/Ox), mixed environment (interfaces). We leverage supervised machine learning methods powered by genetic algorithms coupled with local simplex optimization to efficiently navigate through a high-dimensional parameter space and identify an optimum set of an independent set of CTIP parameters. We train our model against an extensive first-principles based data set that includes lattice constants, cohesive energies, equations of state, and elastic constants of various experimentally observed polymorphs of hafnia, copper oxide, hafnium, as well as copper. Our machine-learned CTIP model captures the structure, elastic properties, thermodynamics, and energetic ordering of various polymorphs. It also accurately predicts the surface properties of both oxides and their metals. To demonstrate the suitability of our CTIP model for investigating dynamic processes, we employed it to identify the atomistic scale mechanisms associated with the initial nanoscale oxidation and surface oxide growth on Cu-doped hafnia surfaces. Here, our machine-learned CTIP model can be used to probe the dynamic response of Cu/Hf/O alloy interfaces subjected to external stimuli (e.g., electric field, pressure, temperature, strain, etc.) and a variety of atomistic phenomena including the dynamics of switching in emerging neuromorphic platforms.

36 MATERIALS SCIENCE↗

A method of testing attitude control systems during the development phase

A technique, utilized on the Space Telescope Program, and used for testing satellite attitude pointing and control systems during the engineering and development phases is presented. The technique verifies the hardware models used in design phase computer simulations, verifies the interface between the flight hardware and flight software, and uncovers hardware/software switching or mode logic problems. The testing is accomplished in two phases: a dynamic hardware simulator phase using hardware electronic simulators and an electronic vehicle motion simulator; and a second real hardware phase utilizing engineering model gyros and reaction wheels on an airbearing table. Both phases use an engineering model of the flight computer, flight algorithms and software, and a breadboard data management and computer hardware interface for timing simulations. The purpose of each test and the test phases are described, and examples of closed loop test results for both attitude hold and maneuvering models are given.

Besonis, A.↗

Injecting Errors for Testing Built-In Test Software

Two algorithms have been conceived to enable automated, thorough testing of Built-in test (BIT) software. The first algorithm applies to BIT routines that define pass/fail criteria based on values of data read from such hardware devices as memories, input ports, or registers. This algorithm simulates effects of errors in a device under test by (1) intercepting data from the device and (2) performing AND operations between the data and the data mask specific to the device. This operation yields values not expected by the BIT routine. This algorithm entails very small, permanent instrumentation of the software under test (SUT) for performing the AND operations. The second algorithm applies to BIT programs that provide services to users application programs via commands or callable interfaces and requires a capability for test-driver software to read and write the memory used in execution of the SUT. This algorithm identifies all SUT code execution addresses where errors are to be injected, then temporarily replaces the code at those addresses with small test code sequences to inject latent severe errors, then determines whether, as desired, the SUT detects the errors and recovers

Gender, Thomas K.↗

GrainGNN: A dynamic graph neural network for predicting 3D grain microstructure

We propose GrainGNN, a surrogate model for the evolution of polycrystalline grain structure under rapid solidification conditions in metal additive manufacturing. High fidelity simulations of solidification microstructures are typically performed using multicomponent partial differential equations (PDEs) with moving interfaces. The inherent randomness of the PDE initial conditions (grain seeds) necessitates ensemble simulations to predict microstructure statistics, e.g., grain size, aspect ratio, and crystallographic orientation. Here, currently such ensemble simulations are prohibitively expensive and surrogates are necessary.In GrainGNN, we use a dynamic graph to represent interface motion and topological changes due to grain coarsening. We use a reduced representation of the microstructure using hand-crafted features; we combine pattern finding and altering graph algorithms with two neural networks, a classifier (for topological changes) and a regressor (for interface motion). Both networks have an encoder-decoder architecture; the encoder has a multi-layer transformer long-short-term-memory architecture; the decoder is a single layer perceptron.We evaluate GrainGNN by comparing it to high-fidelity phase field simulations for in-distribution and out-of-distribution grain configurations for solidification under laser power bed fusion conditions. GrainGNN results in 80%–90% pointwise accuracy; and nearly identical distributions of scalar quantities of interest (QoI) between phase field and GrainGNN simulations compared using Kolmogorov-Smirnov test. GrainGNN's inference speedup (PyTorch on single x86 CPU) over a high-fidelity phase field simulation (CUDA on a single NVIDIA A100 GPU) is 150×–2000× for 100-initial grain problem. Further, using GrainGNN, we model the formation of 11,600 grains in 220 seconds on a single CPU core.

36 MATERIALS SCIENCE↗

Comparison of Staggered Grid Finite Difference Schemes for Ultrasound Simulation in Curving Composites

The optimization of ultrasonic nondestructive evaluation (NDE) simulation tools for composites has the potential to reduce both individual part inspection time and overall certification time for composite parts and structures. Inspection guidance based on simulation provides increased confidence in the veracity of inspection results in addition to time reductions. This paper outlines ongoing work targeted to advance this objective through the use of finite difference (FD) simulation techniques formulated for composite structures with realistic geometries. Two staggered grid explicit FD schemes which show promise for this purpose are assessed: the Lebedev FD scheme and the rotated staggered grid (RSG) FD scheme. Algorithmic points which provide challenges for complex geometries are addressed, in particular handling of traction free surfaces and bi-material interfaces present at lamina boundaries. Code execution time estimates are performed as well to guide feasible domain sizes relative to algorithm choice and available hardware. Three test cases are simulated: a delaminated plate, a cylinder, and a triclinic lamina. These tests demonstrate that the Lebedev FD scheme needs additional work to handle inter-laminar interfaces and traction free boundaries in the presence of stair-stepping approximations. In contrast, the simple structure of the RSG unit cell makes it more straightforward to construct a 3D simulation technique for curved composite laminates.

Frankforter, Erik↗

Dimensionally Aligned Signal Projection Algorithms Library

Dimensionally aligned signal projection (DASP) algorithms are used to analyze fast Fourier transforms (FFTs) and generate visualizations that help focus on the harmonics for specific signals. At a high level, these algorithms extract the FFT segments around each harmonic frequency center, and then align them in equally sized arrays ordered by increasing distance from the base frequency. This allows for a focused view of the harmonic frequencies, which, among other use cases, can enable machine learning algorithms to more easily identify salient patterns. This work seeks to provide an effective open-source implementation of the DASP algorithms proposed by Vann et al. (2018) as well as functionality to help explore and test how these algorithms work with an interactive dashboard and signal-generation tool. The DASP library is implemented in Python and contains four types of algorithms for implementing these feature engineering techniques: fixed harmonically aligned signal projection (HASP), decimating HASP, interpolating HASP, and frequency aligned signal projection (FASP). Each algorithm returns a numerical array, which can be visualized as an image. The HASP algorithms are variations of the algorithms originally presented by Vann et al. (2018). For consistency, FASP, which is the terminology used for the short-time Fourier transform (STFT), has been implemented as part of the library to provide a similar interface to the STFT of the raw signal. Additionally, the library contains an algorithm to generate artificial signals with basic customizations such as the base frequency, sample rate, duration, number of harmonics, noise, and number of signals. Finally, the library provides multiple interactive visualizations, each of which is implemented using IPyWidgets and works in a Jupyter environment. A dashboard-style visualization is provided, which contains some common signal-processing visual components (signal, FFT, spectogram) updating in unison with the HASP functions (see Figure 1 below). Separate from the dashboard, an independent visualization is provided for each of the DASP algorithms as well as for the artifical signal generator. These visualizations are included in the library to aid in developing an intuitive understanding how the algorithms are affected by different input signals and parameter selections.

harmonics↗

NWGraph: A Library of Generic Graph Algorithms and Data Structures in C++20

The C++ Standard Library is a valuable collection of generic algorithms and data structures that improves the usability and reliability of C++ software. Graph algorithms and data structures are notably absent from the standard library, and previous attempts to fill this gap have not gained widespread adoption. In this paper we show that the richness of graph algorithms and data structures can in fact be captured by straightforward composition of existing C++ mechanisms. Generic programming is algorithm-oriented. Accordingly, we apply a systematic approach to analyzing a broad set of graph algorithms, “lift” unnecessary constraints from them, and organize the resulting set of minimal common type requirements, i.e., concepts, for defining their interfaces. By using the newly available ranges and concepts in C++20, the type requirements for generic graph algorithms can be succinctly expressed. The generic algorithms and data structures resulting from our analysis are realized in NWGraph, in a modern, composable, and extensible C++ library.

graphs and networks, programming language, C++20↗

The Suomi National Polar-Orbiting Partnership (SNPP): Continuing NASA Research and Applications

The Suomi National Polar-orbiting Partnership (SNPP) satellite was successfully launched into a polar orbit on October 28, 2011 carrying 5 remote sensing instruments designed to provide data to improve weather forecasts and to increase understanding of long-term climate change. SNPP provides operational continuity of satellite-based observations for NOAA's Polar-orbiting Operational Environmental Satellites (POES) and continues the long-term record of climate quality observations established by NASA's Earth Observing System (EOS) satellites. In the 2003 to 2011 pre-launch timeframe, NASA's SNPP Science Team assessed the adequacy of the operational Raw Data Records (RDRs), Sensor Data Records (SDRs), and Environmental Data Records (EDRs) from the SNPP instruments for use in NASA Earth Science research, examined the operational algorithms used to produce those data records, and proposed a path forward for the production of climate quality products from SNPP. In order to perform these tasks, a distributed data system, the NASA Science Data Segment (SDS), ingested RDRs, SDRs, and EDRs from the NOAA Archive and Distribution and Interface Data Processing Segments, ADS and IDPS, respectively. The SDS also obtained operational algorithms for evaluation purposes from the NOAA Government Resource for Algorithm Verification, Independent Testing and Evaluation (GRAVITE). Within the NASA SDS, five Product Evaluation and Test Elements (PEATEs) received, ingested, and stored data and performed NASA's data processing, evaluation, and analysis activities. The distributed nature of this data distribution system was established by physically housing each PEATE within one of five Climate Analysis Research Systems (CARS) located at either at a NASA or a university institution. The CARS were organized around 5 key EDRs directly in support of the following NASA Earth Science focus areas: atmospheric sounding, ocean, land, ozone, and atmospheric composition products. The PEATES provided the system level interface with members of the NASA SNPP Science Team and other science investigators within each CARS. A sixth Earth Radiation Budget CARS was established at NASA Langley Research Center (NASA LaRC) to support instrument performance, data evaluation, and analysis for the SNPP Clouds and the Earth's Radiant Budget Energy System (CERES) instrument. Following the 2011 launch of SNPP, spacecraft commissioning, and instrument activation, the NASA SNPP Science Team evaluated the operational RDRs, SDRs, and EDRs produced by the NOAA ADS and IDPS. A key part in that evaluation was the NASA Science Team's independent processing of operational RDRs and SDRs to EDRs using the latest NASA science algorithms. The NASA science evaluation was completed in the December 2012 to April 2014 timeframe with the release of a series of NASA Science Team Discipline Reports. In summary, these reports indicated that the RDRs produced by the SNPP instruments were of sufficiently high quality to be used to create data products suitable for NASA Earth System science and applications. However, the quality of the SDRs and EDRs were found to vary greatly when considering suitability for NASA science. The need for improvements in operational algorithms, adoption of different algorithmic approaches, greater monitoring of on-orbit instrument calibration, greater attention to data product validation, and data reprocessing were prominent findings in the reports. In response to these findings, NASA, in late 2013, directed the NASA SNPP Science Team to use SNPP instrument data to develop data products of sufficiently high quality to enable the continuation of EOS time series data records and to develop innovative, practical applications of SNPP data. This direction necessitated a transition of the SDS data system from its pre-launch assessment mode to one of full data processing and production. To do this, the PEATES, which served as NASA's data product testing environment during the prelaunch and early on-orbit periods, were transitioned to Science Investigator-led Processing Systems (SIPS). The distributed data architecture was maintained in this new system by locating the SIPS at the same institutions at which the CARS and PEATES were located. The SIPS acquire raw SNPP instrument Level 0 (i.e. RDR) data over the full SNPP mission from the NOAA ADS and IDPS through the NASA SDS Data Distribution and Depository Element (SD3E). The SIPS process those data into NASA Level 1, Level 2, and global, gridded Level 3 standard products using peer-reviewed algorithms provided by members of the NASA Science Team. The SIPS work with the NASA SNPP Science Team in obtaining enhanced, refined, or alternate real-time algorithms to support the capabilities of the Direct Readout Laboratory (DRL). All data products, algorithm source codes, coefficients, and auxiliary data used in product generation are archived in an assigned NASA Distributed Active Archive Center (DAAC).

remote sensing↗

A mass-transfer particle-tracking method for simulating transport with discontinuous diffusion coefficients

The problem of a spatially discontinuous diffusion coefficient (D(x)) is one that may be encountered in hydrogeologic systems due to natural geological features or as a consequence of numerical discretization of flow properties. To date, mass-transfer particle-tracking (MTPT) methods, a family of Lagrangian methods in which diffusion is jointly simulated by random walk and diffusive mass transfers, have been unable to solve this problem. This manuscript presents a new mass-transfer (MT) algorithm that enables MTPT methods to accurately solve the problem of discontinuous D(x). To achieve this, we derive a semi-analytical solution to the discontinuous D(x) problem by employing a predictor-corrector approach, and we use this semi-analytical solution as the weighting function in a reformulated MT algorithm. Furthermore, this semi-analytical solution is generalized for cases with multiple 1D interfaces as well as for 2D cases, including a 2 × 2 tiling of 4 subdomains that corresponds to a numerically-generated diffusion field. The solutions generated by this new mass-transfer algorithm closely agree with an analytical 1D solution or, in more complicated cases, trusted numerical results, demonstrating the success of our proposed approach.

42 ENGINEERING↗

A Pattern Based Algorithmic Autotuner for Graph Processing on GPUs

This paper presents Gswitch, a pattern-based algorithmic autotuning system that dynamically switches to the suitable optimization variants with negligible overhead. Its novelty is a small set of algorithmic patterns that enables configurable assembling of algorithm variants. The fast transition of Gswitch is based on a machine learning model trained from 644 real graphs from the network repository. In addition, Gswitch provides succinct programming interface which hides all low-level tuning details. We evaluate Gswitch for typical graph algorithms (BFS, CC, PR, SSSP, and BC) on Nvidia Kepler and Pascal GPUs. The results show that Gswitch runs up to 10× faster than the best configuration of the state-of-the-art programmable GPU-based graph processing libraries on ten representative graphs. Gswitch wins on 92.4% cases of 644 graph data which is the largest dataset evaluation reported to date.

HPC, graph algorithms, GPUs, auto tuning↗