Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex computing”

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 937 records · Page 52

Vision-Aided Inertial Navigation

This document discloses, among other things, a system and method for implementing an algorithm to determine pose, velocity, acceleration or other navigation information using feature tracking data. The algorithm has computational complexity that is linear with the number of features tracked.

Roumeliotis, Stergios I.↗

Standardizing Microprocessor and GPU Radiation Test Approaches

Microprocessor, Graphics Processing Units (GPUs) and DDRx memory devices have emerged as promising next-generation technologies that enables both high performance processing and acceleration of complex algorithms for the latest challenges in human spaceflight, autonomous vehicles and artificial intelligence (AI). The feature sets of these devices offer exponential increases to throughput, calculation capability and system autonomy when compared to legacy flight systems. NASA's Electronic Part and Packaging (NEPP) Program has conducted an investigation into the radiation susceptibility of leading edge devices and process technologies by establishing standardized test approaches. Unlike most discrete devices, these require state of the art test systems to induce specific hardware activity similar to application software, thus allowing the characterization of failure modes within the system. To best characterize the tested part, NEPP eliminates variables that may impact device performance under radiation. Simplification of remaining system-level variables leads to an improved understanding of complex computational devices and their intended applications. The failure modes and error signatures that are recorded during testing are used to determine radiation sensitivity of the semiconductor process and the microcode architecture of the design. This presentation will discuss the test methodology that NASA Electronic Parts and Packaging (NEPP) is working to establish for its microprocessor, GPU and DDRx memory test programs to provide guidance on these devices and their underlying technology, in regards to their potential usage in future space flight systems.

GPU↗

Forming Aggregations using Virtual Sharding: Lessons Learned from Simple Scalable Storage (S3)

Data aggregation is the ability to combine separate datasets to form a single new logical dataset provides users with a powerful abstraction. The advantage of an aggregate dataset is that the users are freed from having to understand, and incorporate into their workflow, knowledge about the (ad hoc) organization of the constituent datasets. However, aggregating large numbers of files can be computationally complex with data server systems performing many repetitive operations. As part of the authors work on subsetting data stored on Amazon Web Service (AWS) Simple Storage Service (S3), we developed technology to read portions of otherwise monolithic data files. This enables the formation of virtual shards for user in subsetting data stored in HDF5 (hierarchical data format, version 5) files. This same tool can be used to form aggregations that combine data stored in many HDF5 files when those files are stored on S3. The nature of the virtual sharding and the algorithm that exploits it for subsetting is such that it can also be used for aggregation with the need for many of the repetitive operations required by the per file aggregation techniques. We will present timing information that demonstrates the flexibility of this approach. However, the lessons learned is that while this is a useful result in and of itself, these very same techniques can be applied in other contexts where data are stored in services and on media other than S3. For example, this same technique can be applied to data stored on spinning disk. Pushing the envelope for S3 forced a reexamination of our data access techniques which lead to unexpected positive benefits.

Gallagher, James↗

Validation of Kestrel IDDES Simulations for SLS Transition Analysis

Complex computational simulations are needed to support the Space Launch System (SLS) program, and the fidelity of the computational results must be defended. More specifically, a number of databases are produced for the transition phase of flight, which occurs after the rocket clears the tower but before reaching transonic speeds. In an effort to reduce computational uncertainty, many of the computational parameters were altered to determine the sensitivity of the results to the value of the parameter and then updating the best practice procedures. The baseline routines were developed over many years through the maturation of the SLS program, and this paper delivers a detailed discussion of these baseline results. This section is followed by demonstration of perturbing some of the more significant parameters, including time step and turbulence model, and concluded with a summary of the herein determined best practices for such analysis.

CFD↗

Exploring Sentinel-1 and Sentinel-2 diversity for Flood inundation mapping using deep learning

Identification of flood water extent from satellite images has historically relied on either synthetic aperture radar (SAR) or multi-spectral (MS) imagery. MS sensors are limited to cloud free conditions, whereas SAR imagery is plagued by noise-like speckle. Prior studies that use combinations of MS and SAR data to overcome individual limitations of these sensors have not fully examined sensitivity of flood mapping performance to different combinations of SAR and MS derived spectral indices or band transformations in color space. This study explores the use of diverse bands of Sentinel 2 (S2) through well-established water indices and Sentinel 1 (S1) derived SAR imagery along with their combinations to assess their capability for generating accurate flood inundation maps. The robustness in performance of S-1 and S-2 band combinations was evaluated using 446 hand labeled flood inundation images spanning across 11 flood events from Sen1Floods11 dataset which are highly diverse in terms of land cover as well as location. A modified K-fold cross validation approach is used to evaluate the performance of 32 combinations of S1 and S2 bands using a fully connected deep convolutional neural network known as U-Net. Our results indicated that usage of elevation information has improved the capability of S1 imagery to produce more accurate flood inundation maps. Compared to a median F1 score of 0.62 when using only S1 bands, the combined use of S1 and elevation information led to an improved median F1 score of 0.73. Water extraction indices based on S2 bands have a statistically significant superior performance in comparison to S1. Among all the band combinations, HSV (Hue, Saturation, Value) transformation of S2 bands provides a median F1 score of 0.9, outperforming the commonly used water spectral indices owing to HSV’s transformation’s superior contrast distinguishing abilities. Additionally, U-Net algorithm was able to learn the relationship between raw S2 based water extraction indices and their corresponding raw S2 bands, but not of HSV owing to relatively complex computation involved in the latter. Results of the paper establishes important benchmarks for the extension of S1 and S2 data-based flood inundation mapping efforts over large spatial extents.

Goutam Konapala↗

Simultaneous Stoquasticity

Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo techniques. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation. This question has important implications for the complexity of simulating quantum annealing where quantum advantage is related to the stoquasticity of the Hamiltonians involved in the anneal. We find that for almost all problems no such unitary exists and show that the problem of determining the existence of such a unitary is equivalent to identifying if there is a solution to a system of polynomial (in)equalities in the matrix elements of the initial and transformed Hamiltonians. Solving such a system of equations is NP-hard. We highlight a geometric understanding of this problem in terms of a collection of generalized Bloch vectors.

Jacob Bringewatt↗

Simultaneous Stoquasticity

Stoquastic Hamiltonians play a role in the computational complexity of the local Hamiltonian problem as well as the study of classical simulability. In particular, stoquastic Hamiltonians can be straightforwardly simulated using Monte Carlo techniques. We address the question of whether two or more Hamiltonians may be made simultaneously stoquastic via a unitary transformation. This question has important implications for the complexity of simulating quantum annealing where quantum advantage is related to the stoquasticity of the Hamiltonians involved in the anneal. We find that for almost all problems no such unitary exists and show that the problem of determining the existence of such a unitary is equivalent to identifying if there is a solution to a system of polynomial (in)equalities in the matrix elements of the initial and transformed Hamiltonians. Solving such a system of equations is NP-hard. We highlight a geometric understanding of this problem in terms of a collection of generalized Bloch vectors.

Monte Carlo↗

A Comparison of Passive Microwave Emission Models for Estimating Brightness Temperature at L- and P-band Under Bare and Vegetated Soil Conditions

P-band radiometry has been demonstrated to have a deeper sensing depth than at L-band, making the consideration of multi-layer microwave interactions necessary. Additionally, the scattering and phase interference effects are different at P-band, requiring a re-consideration of the need for coherent models. However, the impact remains to be clarified, and understanding the validity and limitations of these models at both L-band and P-band is crucial for their refinement and application. Therefore, two general categories of microwave emission models, including two stratified coherent models (Njoku and Wilhite) and four incoherent models (conventional tau-omega model and three multi-layer models being zero-order, first-order, and incoherent solution), were intercompared for the first time on the same dataset. This evaluation utilized observations of L-band and P-band radiometry under different land cover conditions from a tower-based experiment in Victoria, Australia. Model estimations of brightness temperature (TB) were consistent with measurements, with the lowest root mean square error (RMSE) at P-band V-polarization under corn (2 K) and the highest RMSE at L-band H-polarization under bare soil (13 K). Coherent models performed slightly better than incoherent models under bare soil (3 K less RMSE), while the opposite was true under vegetated soil conditions (1 K less RMSE). Coherent and incoherent models showed maximum differences (3 K at P-band, 2 K at L-band), correlating strongly with soil moisture variations at 0-10 cm. Findings suggest that coherent and incoherent models perform similarly; thus, incoherent models may be preferable for estimating TB at L- and P-band due to reduced computational complexity.

Soil moisture profile↗

An Efficient Filter for Measurements Corrupted with Cauchy Noise

This paper present a new sequential filter for state estimation using measurements corrupted with Cauchy noise. The new filter retains the familiar structure of the Kalman filter and is computationally efficient. In addition, it does not exhibit computational complexity which grows or varies in time like existing methods. These results are based upon a nearly 50 year old result by Masreliez in which the conditional mean estimator is approximated via linearization of the measurement predictive density. This work derives the new filter, provides discussion regarding practical implementation, and present Monte Carlo analyses to validate and assess the new filter's performance.

James S McCabe↗

FRAAME Version 1.0 User Manual

The code for Forced Response Aeromechanics Analysis in a MATLAB-based (The MathWorks, Inc.) Environment (FRAAME Version 1.0) was developed for internal use in aeromechanics efforts undertaken at the NASA Glenn Research Center for computing turbomachine component forced response and Goodman diagrams via modal summation method. The main working script (FRAAMEv1.m) allows users to input case-specific manual inputs while the triple-nested loop invokes functions to compute forced response per blade, per nodal diameter, and per mode. Secondly, forced response values are applied to modal stresses to compute complex Von Mises stress values and generate Goodman diagrams per blade, per nodal diameter, and per mode using a linear modal summation method. Currently, this code functions in the Windows (Microsoft Corporation) operating system using MATLAB Version R2023a, but it can be adapted for use in the Linux (Linus Torvalds) operating system by changing the appropriate file path structure in the main script, as well as functions that call external results files.

Aeromechanics↗

Using Machine Learning to Estimate Surface-Level SO2 Concentrations from Satellite-Based Measurements

Sulfur dioxide (SO2) is a criteria air pollutant due to its contributions to aerosol formation, rainfall acidification, and harm to human health. The placement of air quality monitoring sites is typically biased towards urban areas, leaving large areas with very limited monitoring data. The Ozone Monitoring Instrument (OMI) has been used to provide estimates of SO2 vertical column densities (VCDs) globally at spatial resolution of 10s of kms once per day. OMI SO2 VCDs have been previously used to estimate surface SO2 concentrations using chemical transport model (CTM) simulations. The CTMs use estimated emissions and assimilated meteorological data, and simulate the chemical and physical processes that determine the vertical profile of SO2, which can be used to derive a ratio between the surface concentrations and VCDs. These models are complex, computationally expensive, and have large uncertainties in the simulated surface-to-VCD ratio due to biases in emissions and relatively coarse resolution. Machine learning techniques are comparatively easier to use, much less computationally expensive to use after training, and can produce more accurate estimations of surface concentrations than the CTM-based method. The interpretation of machine learning models often poses challenges, and in some cases, non-physical variables unrelated to SO2 are used as predictors. In this work, we create an artificial neural network (ANN) to relate OMI retrievals and archived GEOS-FP boundary layer heights to surface SO2 concentrations from the ChinaHighAirPollutants ChinaHighSO2 dataset (CHAP; Wei et al., 2023) on a seasonal average timescale from 2013-2018. Our model only utilizes five variables that are directly relevant to the satellite retrieval, lifetime, and spatial distribution of SO2. The model was trained on 16 seasons (four of each) with independent validation (one of each season) and testing datasets (one of each season) to avoid overfitting. Our ANN generates surface SO2 concentrations that are sensitive (slope = 0.51) and consistent (r = 0.74) with the CHAP data, but are underpredicted by an average of 1.2 ppbv with a mean absolute error of 2.2 ppbv. These results are better than recent studies utilizing the CTM method. To our knowledge, this is the best performing machine learning model that only uses physical variables to predict surface SO2. Our work demonstrates that a carefully constructed, simple ML model can accurately estimate surface-based SO2 concentrations from satellite VCD measurements, and this technique has future promise to expend to newer, higher resolution satellites and other air pollutants.

SO2, air quality, OMI, machine learning↗

Experimentally Determined Interfacial Area Between Immiscible Fluids in Porous Media

When multiple fluids flow through a porous medium, the interaction between the fluid interfaces can be of great importance. While this is widely recognized in practical applications, numerical models often disregard interactios between discrete fluid phases due to the computational complexity. And rightly so, for this level of detail is well beyond most extended Darcy Law relationships. A new model of two-phase flow including the interfacial area has been proposed by Hassarizadeh and Gray based upon thermodynamic principles. A version of this general equation set has been implemented by Nessner and Hassarizadeh. Many of the interfacial parameters required by this equation set have never been determined from experiments. The work presented here is a description of how the interfacial area, capillary pressure, interfacial velocity and interfacial permeability from two-phase flow experiments in porous media experiments can be used to determine the required parameters. This work, while on-going, has shown the possibility of digitizing images within translucent porous media and identifying the location and behavior of interfaces under dynamic conditions. Using the described methods experimentally derived interfacial functions to be used in larger scale simulations are currently being developed. In summary, the following conclusions can be drawn: (1) by mapping a pore-throat geometry onto an image of immiscible fluid flow, the saturation of fluids and the individual interfaces between the fluids can be identified; (2) the resulting saturation profiles of the low velocity drainage flows used in this study are well described by an invasion percolation fractal scaling; (3) the interfacial area between fluids has been observed to increase in a linear fashion during the initial invasion of the non-wetting fluid; and (4) the average capillary pressure within the entire cell and representative elemental volumes were observed to plateau after a small portion of the volume was invaded.

58 GEOSCIENCES↗

Parallel k-Means Clustering for Quantitative Ecoregion Delineation Using Large Data Sets

Identification of geographic ecoregions has long been of interest to environmental scientists and ecologists for identifying regions of similar ecological and environmental conditions. Such classifications are important for predicting suitable species ranges, for stratification of ecological samples, and to help prioritize habitat preservation and remediation efforts. Hargrove and Hoffman (1999, 2009) have developed geographical spatio-temporal clustering algorithms and codes and have successfully applied them to a variety of environmental science domains, including ecological regionalization; environmental monitoring network design; analysis of satellite-, airborne-, and ground-based remote sensing, and climate model-model and model-measurement intercomparison. With the advances in state-of-the-art satellite remote sensing and climate models, observations and model outputs are available at increasingly high spatial and temporal resolutions. Long time series of these high resolution datasets are extremely large in size and growing. Analysis and knowledge extraction from these large datasets are not just algorithmic and ecological problems, but also pose a complex computational problem. This paper focuses on the development of a massively parallel multivariate geographical spatio-temporal clustering code for analysis of very large datasets using tens of thousands processors on one of the fastest supercomputers in the world.

54 ENVIRONMENTAL SCIENCES↗

Hybrid Surface Mesh Adaptation for Climate Modeling

Solution-driven mesh adaptation is becoming quite popular for spatial error control in the numerical simulation of complex computational physics applications, such as climate modeling. Typically, spatial adaptation is achieved by element subdivision (h adaptation) with a primary goal of resolving the local length scales of interest. A second, less-popular method of spatial adaptivity is called "mesh motion" (r adaptation); the smooth repositioning of mesh node points aimed at resizing existing elements to capture the local length scales. This paper proposes an adaptation method based on a combination of both element subdivision and node point repositioning (rh adaptation). By combining these two methods using the notion of a mobility function, the proposed approach seeks to increase the flexibility and extensibility of mesh motion algorithms while providing a somewhat smoother transition between refined regions than is produced by element subdivision alone. Further, in an attempt to support the requirements of a very general class of climate simulation applications, the proposed method is designed to accommodate unstructured, polygonal mesh topologies in addition to the most popular mesh types.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable time series change detection for biomass monitoring using gaussian process

Biomass monitoring, specifically detecting changes in the biomass or vegetation of a geographical region, is vital for studying the carbon cycle of the system and has significant implications in the context of understanding climate change and its impacts. Recently, several time series change detection methods have been proposed to identify land cover changes in temporal profiles (time series) of vegetation collected using remote sensing instruments. In this paper, we adapt Gaussian process regression to detect changes in such time series in an online fashion. While Gaussian process (GP) has been widely used as a kernel based learning method for regression and classification, their applicability to massive spatio-temporal data sets, such as remote sensing data, has been limited owing to the high computational costs involved. In this paper we address the scalability aspect of GP based time series change detection. Specifically, we exploit the special structure of the covariance matrix generated for GP analysis to come up with methods that can efficiently estimate the hyper-parameters associated with GP as well as identify changes in the time series while requiring a memory footprint which is linear in the size of input data, as compared to traditional method which involves solving a linear system of equations for the Choleksy decomposition of the quadratic sized covariance matrix. Experimental results show that our proposed method achieves significant speedups, as high as 1000, when processing long time series, while maintaining a small memory footprint. To further improve the computational complexity of the proposed method, we provide a parallel version which can concurrently process multiple input time series using the same set of hyper-parameters. The parallel version exploits the natural parallelization potential of the serial algorithm and is shown to perform significantly better than the serial version, with speedups as high as 10. Finally, we demonstrate the effectiveness of the proposed change detection method in identifying changes in Normalized Difference Vegetation Index (NDVI) data. Moreover, we show that the scalable solution is able to process NDVI data for the entire Iowa region significantly faster than the standard method.

Chandola, Varun↗

Numerical Solution of 3D Poisson-Nernst-Planck Equations Coupled with Classical Density Functional Theory for Modeling Ion and Electron Transport in a Confined Environment

We have developed efficient numerical algorithms for the solution of 3D steady-state Poisson-Nernst-Planck equations (PNP) with excess chemical potentials described by the classical density functional theory (cDFT). The coupled PNP equations are discretized by finite difference scheme and solved iteratively by Gummel method with relaxation. The Nernst-Planck equations are transformed into Laplace equations through the Slotboom transformation. Algebraic multigrid method is then applied to efficiently solve the Poisson equation and the transformed Nernst-Planck equations. A novel strategy for calculating excess chemical potentials through fast Fourier transforms is proposed which reduces computational complexity from O(N2) to O(NlogN) where N is the number of grid points. Integrals involving Dirac delta function are evaluated directly by coordinate transformation which yields more accurate result compared to applying numerical quadrature to an approximated delta function. Numerical results for ion and electron transport in solid electrolyte for Li ion batteries are shown to be in good agreement with the experimental data and the results from previous studies.

Meng, Da↗

GPU Accelerated Event Detection Algorithm

Smart grid external require new algorithmic approaches as well as parallel formulations. One of the critical components is the prediction of changes and detection of anomalies within the power grid. The state-of-the-art algorithms are not suited to handle the demands of streaming data analysis. (i) need for events detection algorithms that can scale with the size of data, (ii) need for algorithms that can not only handle multi dimensional nature of the data, but also model both spatial and temporal dependencies in the data, which, for the most part, are highly nonlinear, (iii) need for algorithms that can operate in an online fashion with streaming data. The GAEDA code is a new online anomaly detection techniques that take into account spatial, temporal, multi-dimensional aspects of the data set. The basic idea behind the proposed approach is to (a) to convert a multi-dimensional sequence into a univariate time series that captures the changes between successive windows extracted from the original sequence using singular value decomposition (SVD), and then (b) to apply known anomaly detection techniques for univariate time series. A key challenge for the proposed approach is to make the algorithm scalable to huge datasets by adopting techniques from perturbation theory, incremental SVD analysis. We used recent advances in tensor decomposition techniques which reduce computational complexity to monitor the change between successive windows and detect anomalies in the same manner as described above. Therefore we propose to develop the parallel solutions on many core systems such as GPUs, because these algorithms involve lot of numerical operations and are highly data-parallelizable.

Source record↗