SEARCH · Engineering Papers
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.
This paper discusses a compact, fast, parallel multiplication scheme of the generation-reduction type using generalized Dadda-type pseudoadders for reduction and m x m multipliers for generation. The implications of present and future LSI are considered, a partitioning algorithm is presented, and the results obtained for a 24 x 24-bit implementation are discussed.
A concept for automatic terminal area guidance, comprising two modes of operation, was developed and evaluated in flight tests. In the predictive mode, fuel efficient approach trajectories are synthesized in fast time. In the tracking mode, the synthesized trajectories are reconstructed and tracked automatically. An energy rate performance model derived from the lift, drag, and propulsion system characteristics of the aircraft is used in the synthesis algorithm. The method optimizes the trajectory for the initial aircraft position and wind and temperature profiles encountered during each landing approach. The design theory and the results of simulations and flight tests using the Augmentor Wing Jet STOL Research Aircraft are described.
This report is an extension of earlier work (Part 1) which provided practical adaptive techniques for the efficient noiseless coding of a broad class of data sources characterized by only partially known and varying statistics (JPL Publication 79-22). The results here, while still claiming such general applicability, focus primarily on the noiseless coding of image data. A fairly complete and self-contained treatment is provided. Particular emphasis is given to the requirements of the forthcoming Voyager II encounters of Uranus and Neptune. Performance evaluations are supported both graphically and pictorially. Expanded definitions of the algorithms in Part 1 yield a computationally improved set of options for applications requiring efficient performance at entropies above 4 bits/sample. These expanded definitions include as an important subset, a somewhat less efficient but extremely simple "FAST' compressor which will be used at the Voyager Uranus encounter. Additionally, options are provided which enhance performance when atypical data spikes may be present.
Computational method developed to model return signals of ground-mapping radar system for use in simulations where terrain is polygonal form commonly used with computer-generated imagery (CGI). Approach involves fast rejection of polygons not visible to radar return. Technique used to determine which objects in scene visible from specified vantage point and also to determine movements of robot arms avoiding obstacles. Test circles used in algorithm quickly rejects terrain features not traversed by radar line of sight. If circle does not cross line of sight, then all mountains in it rejected.
The Voyager Plasma Science (PLS) modulator calibration (MVM) data analysis was undertaken in order to check the correctness of the fast A/D converter formulas that connect low voltage monitor signals (MV) with digital outputs (DN), to determine the proportionality constants between the actual modulator grid potential (V) and the monitor voltage (MV), and to establish an algorithm to link the digitized readouts (DN) with the actual grid potential (V). The analysis results are surprising in that the derived conversion constants deviate by fairly significant amounts from their nominal values. However, it must be kept in mind that the test results which were used for analysis may be very imprecise. Even if it is assumed that the test result errors are very large, they do no appear to be capable to account for all discrepancies between the theoretical expectations and the results of the analysis. Measurements with the flight spare instrument appear to be the only means of investigating these effects further.
The transmission zeros of a large space structure can be computed by the general-purpose algorithm of A. Emami-Naeini and P. Van Dooren (1982). However, careful use of the special form of the equations of motion of structural dynamics leads to a new method that is about twice as fast as theirs when applied to a damped structure, and at least 60 times as fast for an undamped one.
The problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems is addressed. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. Polynomial exact and approximate algorithms are described for this class that are better than any of the previously reported algorithms. The approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic take can then be carried out using fast search techniques.
Finned missile design entails accurate and computationally fast numerical techniques for predicting viscous flows over complex lifting configurations at small to moderate angles of attack and over Mach 3 to 15; these flows are often characterized by strong embedded shocks, so that numerical algorithms are also required to capture embedded shocks. The recent real-gas Flux Vector Splitting technique is here extended to investigate the Mach 3 flow over a typical finned missile configuration with/without side fin deflections. Elliptic grid-generation techniques for Mach 15 flows are shown to be inadequate for Mach 3 flows over finned configurations and need to be modified. Fin-deflection studies indicate that even small amounts of missile fin deflection can substantially modify vehicle aerodynamics. This 3D parabolized Navier-Stokes scheme is also extended into an efficient embedded algorithm for studying small axially separated flow regions due to strong fin and control surface deflections.
Earth and Space Science often involve the comparison, fusion, and integration of multiple types of remotely sensed data at various temporal, radiometric, and spatial resolutions. Results of this integration may be utilized for global change analysis, global coverage of an area at multiple resolutions, map updating or validation of new instruments, as well as integration of data provided by multiple instruments carried on multiple platforms, e.g. in spacecraft constellations or fleets of planetary rovers. Our focus is on developing methods to perform fast, accurate and automatic image registration and fusion. General methods for automatic image registration are being reviewed and evaluated. Various choices for feature extraction, feature matching and similarity measurements are being compared, including wavelet-based algorithms, mutual information and statistically robust techniques. Our work also involves studies related to image fusion and investigates dimension reduction and co-kriging for application-dependent fusion. All methods are being tested using several multi-sensor datasets, acquired at EOS Core Sites, and including multiple sensors such as IKONOS, Landsat-7/ETM+, EO1/ALI and Hyperion, MODIS, and SeaWIFS instruments. Issues related to the coregistration of data from the same platform (i.e., AIRS and MODIS from Aqua) or from several platforms of the A-train (i.e., MLS, HIRDLS, OMI from Aura with AIRS and MODIS from Terra and Aqua) will also be considered.
The project called High-Speed On-Board Data Processing for Science Instruments (HOPS) has been funded by NASA Earth Science Technology Office (ESTO) Advanced Information Systems Technology (AIST) program during April, 2012 â€" April, 2015. HOPS is an enabler for science missions with extremely high data processing rates. In this three-year effort of HOPS, Active Sensing of CO2 Emissions over Nights, Days, and Seasons (ASCENDS) and 3-D Winds were of interest in particular. As for ASCENDS, HOPS replaces time domain data processing with frequency domain processing while making the real-time on-board data processing possible. As for 3-D Winds, HOPS offers real-time high-resolution wind profiling with 4,096-point fast Fourier transform (FFT). HOPS is adaptable with quick turn-around time. Since HOPS offers reusable user-friendly computational elements, its FPGA IP Core can be modified for a shorter development period if the algorithm changes. The FPGA and memory bandwidth of HOPS is 20 GB/sec while the typical maximum processor-to-SDRAM bandwidth of the commercial radiation tolerant high-end processors is about 130-150 MB/sec. The inter-board communication bandwidth of HOPS is 4 GB/sec while the effective processor-to-cPCI bandwidth of commercial radiation tolerant high-end boards is about 50-75 MB/sec. Also, HOPS offers VHDL cores for the easy and efficient implementation of ASCENDS and 3-D Winds, and other similar algorithms. A general overview of the 3-year development of HOPS is the goal of this presentation.
The Wind spacecraft has yielded several decades of high-resolution magnetic field data, a large fraction of which displays small-scale structures. In particular, the solar wind is full of wavelike fluctuations that appear in both the field magnitude and its components. The nature of these fluctuations can be tied to the properties of other structures in the solar wind, such as shocks, that have implications for the time evolution of the solar wind. As such, having a large collection of wave events would facilitate further study of the effects that these fluctuations have on solar wind evolution. Given the large volume of magnetic field data available, machine learning is the most practical approach to classifying the myriad small-scale structures observed. To this end, a subset of Wind data is labeled and used as a training set for a multi-branch 1D convolutional neural network aimed at classifying circularly polarized wave modes. Using this algorithm, a preliminary statistical study of one year of data is performed, yielding about 300,000 wave intervals out of about 5,000,000 solar wind intervals. The wave intervals come about more often in the fast solar wind and at higher temperatures, and the number of waves per day is highly periodic. This machine learning-based approach to wave detection has the potential to be a powerful, inexpensive way to catalog waves throughout decades of spacecraft data.
The evolution of the power grid has brought increasing deployment of advance metering infrastructure, penetration of intelligent electronic devices, and integration of physical power system components with information and communications technologies. With the fast-expanding connectivity, cyber vulnerabilities arise due to the use of internet-based communication systems. These systems are targets of cyber-intrusions which attempt to disturb the normal power system functions. Traditional intrusion detection algorithms have been developed without an explicit model of the cyber components. In this paper, an algorithm to detect false data injections in the power system is proposed considering both cyber and physical models of the power system. The algorithm is based on an Adaptive Neuro Fuzzy Inference System (ANFIS) which collects information from state variables of the cyber-physical system to meet the performance requirements of the grid. Simulations of the proposed approach using the IEEE 13-bus test system validate the effectiveness of this artificial intelligence-based algorithm.
Remote sensing of global ocean color is a valuable tool for understanding the ecology and biogeochemistry of the worlds oceans, and provides critical input to our knowledge of the global carbon cycle and the impacts of climate change. Ocean polarized reflectance contains information about the constituents of the upper ocean euphotic zone, such as colored dissolved organic matter (CDOM), sediments, phytoplankton, and pollutants. In order to retrieve the information on these constituents, remote sensing algorithms typically rely on radiative transfer models to interpret water color or remote-sensing reflectance; however, this can be resource-prohibitive for operational use due to the extensive CPU time involved in radiative transfer solutions. In this work, we report a fast model based on machine learning techniques, called Neural Network Reflectance Prediction Model (NNRPM), which can be used to predict ocean bidirectional polarized reflectance given inherent optical properties of ocean waters. This supervised model is trained using a large volume of data derived from radiative transfer simulations for coupled atmosphere and ocean systems using the successive order of scattering technique (SOS-CAOS). The performance of the model is validated against another large independent test dataset generated from SOS-CAOS. The model is able to predict both polarized and unpolarized reflectances with an absolute error (AE) less than 0.004 for 99% of test cases. We have also shown that the degree of linear polarization (DoLP) for unpolarized incident light can be predicted with an AE less than 0.002 for 99% of test cases. In general, the simulation time of SOS-CAOS depends on optical depth, and required accuracy. When comparing the average speeds of the NNRPM against the SOS-CAOS model for the same parameters, we see that the NNRPM is able to predict the Ocean BRDF 6000 times faster than SOS-CAOS. Both ultraviolet and visible wavelengths are included in the model to help differentiate between dissolved organic material and chlorophyll in the study of the open ocean and the coastal zone. The incorporation of this model into the retrieval algorithm will make the retrieval process more efficient, and thus applicable for operational use with global satellite observations.
The radiative transfer model (RTMs) has a wide range of applications in satellite remote sensing and atmospheric radiation applications. However, millions of line-by-line (LBL) radiative transfer calculations at fine monochromatic frequencies are needed in order to properly calculate spectral contributions of water vapor and trace gases in the atmosphere in infrared and solar spectral regions. Therefore, fast and accurate RTMs are needed to efficiently process large amount of satellite data. A Principal Component-based Radiative Transfer Model (PCRTM) was first developed in 2004 at NASA Langley Research Centre to fulfil this need. By using PC-compression, one can reduce the data dimension significantly while maintaining original information content. The PCRTM can directly compute PC-scores and their derivatives with respect to retrieved parameters. The PCRTM can simulate the top-of-atmosphere (TOA) radiance or reflectance spectra from 0.250 µm (400000 cm-1) to 2000 µm (50 cm-1) with several orders of magnitude faster speed as compared to a LBL RTM. It is also extremely accurate compared to LBL RTM benchmarks (0.03 K RMS error in IR and 0.05% in solar). The PCRTM model has been developed for hyperspectral sensors such as AIRS, CrIS, IASI, NAST-I, SHIS, FIRST, and CLARREO-IR in thermal IR spectral region and CLARREO-Solar, CPF, TEMPO, EMIT, OMI, and SCIAMACHY in solar spectral region. The PCRTM accuracy has been demonstrated via RTM intercomparisons and with real satellite observations from AIRS, CrIS, IASI, SCHIAMACHY, and EMIT etc. In this presentation, we will describe two PCRTM-based inversion algorithms to retrieve atmospheric temperature, water vapor, and trace gas profiles, as well as cloud and surface properties from hyperspectral sounders such as AIRS, CrIS, IASI, and NAST-I. The first one is called Single Fieldof-view Sounder Atmospheric Product (SiFSAP) algorithm. It provides L2 products with 9-times higher area spatial resolution as compared to current cloud-clearing sounder algorithms. The SiFSAP L2 and L3 products are available at NASA's Goddard Earth Sciences Data and Information Services Center (GES DISC) for public access. The second inversion algorithm is called Climate Fingerprinting Atmospheric Product (ClimFiSP) algorithm. It is designed to produce high quality climate products (trends, anomalies, daily, and monthly profiles of temperature, water vapor, traces, clouds, and surface properties) from multiple satellite sensors such AIRS on Aqua and CrIS on multiple satellites. This product will be available at NASA GES DISC later this year. The PCRTMbased high fidelity simulators for CLARREO and CPF have been used for sensor performance trade studies, algorithm development, and inter-satellite calibrations. We have also used PCRTM generated TOA radiance spectra to train an AI-based algorithm and successfully retrieved cloud properties from EMIT solar hyperspectral imagers.
This paper describes the Dynamic Mode Decomposition (DMD) of the pressures on the scale model of the Space Launch System (SLS) Block 1 cargo vehicle with the Unsteady Pressure-Sensitive Paint (uPSP) measurements, which were collected in the Ascent Transient Aerodynamics Tests with the Unitary Plan Wind Tunnel 11-by-11-foot Transonic Wind Tunnel in September 2019 at NASA Ames Research Center. The work described in this paper is a part of NASA’s development of a new state-of-the-art uPSP capability in production wind tunnels. The conventional DMD algorithm is based on the Singular Value Decomposition (SVD) of the data matrix. For the matrix of the uPSP measurements of the SLS ATAT, the number of rows is equal to the number of nodes in the grid of the scale model, and the number of columns is equal to the number of frames in the videos taken with 4 Phantom high-speed cameras. In this paper, it is verified that, for the time series with zero mean value, the DMD is equivalent to the decomposition with the Discrete Fourier Transform (DFT). Considering the uPSP is mainly used in the assessment of the unsteady, aerodynamic phenomena, the DMD of the uPSP measurements can be implemented in two steps: (1) subtract the mean value from the uPSP measurement on each of the grid nodes; (2) apply the Fast Fourier Transform (FFT) on the resulting zero-mean time series. The DMD of the uPSP measurements with FFT has two advantages: (1) the computational complexity of FFT is O(N*logN), where N is the length of the time series; (2) compared to the SVD-based DMD algorithm, the DMD with FFT can be easily implemented in parallel processing. A sample matrix of uPSP measurements, at the size of 341 grid nodes and 128 frames, is generated. Figures 1 and 2 show the eigenvalues and the ratios of the eigenvectors, respectively, of the sample matrix, without and with the mean value removed on each of the grid nodes, computed with the SVD-based DMD and the FFT. The figures demonstrate the equivalence of the SVD-based DMD and the decomposition with DFT/FFT for the time series with zero mean value. The results of DMD of the uPSP measurements of the SLS ATAT in September 2019 are presented in the paper. The DMD modes at different frequencies are shown, the aerodynamic phenomena (e.g. shockwave and vortex shedding) are demonstrated and the correlation of the DMD modes with the test configuration parameter (e.g., the Mach Number) is discussed. Figure 3 shows a software tool to visualize the DMD modes. The code to implement the algorithm described in this paper was written in C, with libraries of FFTW for FFT and MPI/OpenMP for parallel processing, and executed on the NASA Pleiades supercomputer. Funding for this research was provided by the NASA Aerosciences Evaluation and Test Capabilities Project.
Non-volatile main memory (NVRAM) technologies provide an attractive set of features for large-scale graph analytics, including byte-addressability, low idle power, and improved memory-density. NVRAM systems today have an order of magnitude more NVRAM than traditional memory (DRAM). NVRAM systems could therefore potentially allow very large graph problems to be solved on a single machine, at a modest cost. However, a significant challenge in achieving high performance is in accounting for the fact that NVRAM writes can be much more expensive than NVRAM reads. In this paper, we propose an approach to parallel graph analytics using the Parallel Semi-Asymmetric Model (PSAM), in which the graph is stored as a read-only data structure (in NVRAM), and the amount of mutable memory is kept proportional to the number of vertices. Similar to the popular semi-external and semi-streaming models for graph analytics, the PSAM approach assumes that the vertices of the graph fit in a fast read-write memory (DRAM), but the edges do not. In NVRAM systems, our approach eliminates writes to the NVRAM, among other benefits. To experimentally study this new setting, we develop Sage, a parallel semi-asymmetric graph engine with which we implement provably-efficient (and often work-optimal) PSAM algorithms for over a dozen fundamental graph problems. We experimentally study Sage using a 48--core machine on the largest publicly-available real-world graph (the Hyperlink Web graph with over 3.5 billion vertices and 128 billion edges) equipped with Optane DC Persistent Memory, and show that Sage outperforms the fastest prior systems designed for NVRAM. Importantly, we also show that Sage nearly matches the fastest prior systems running solely in DRAM, by effectively hiding the costs of repeatedly accessing NVRAM versus DRAM.
In this work, we propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial state, significantly improving upon prior estimates that suggested exponential scaling with inverse temperature. We prove that fast mixing at low temperature for the two-dimensional toric code can be achieved by augmenting local jump operators with simple global jump operators, which enable efficient transitions between logical sectors. To establish tight lower bounds on the spectral gap, we introduce a new reduction method that eventually maps the problem to estimating the spectral gap of a perturbed graph Laplacian on a stair graph. Our proof also shows that the Lindblad dynamics with a digitally implemented low-temperature local Davies generator is able to efficiently drive the quantum state toward the ground state manifold.
In this work, we present a fast and approximate multifrontal solver for large-scale sparse linear systems arising from finite-difference, finite-volume or finite-element discretization of high-frequency wave equations. The proposed solver leverages the butterfly algorithm and its hierarchical matrix extension for compressing and factorizing large frontal matrices via graph-distance guided entry evaluation or randomized matrix-vector multiplication-based schemes. Complexity analysis and numerical experiments demonstrate $\mathcal{O}(N\log^2 N)$ computation and $\mathcal{O}(N)$ memory complexity when applied to an $N\times N$ sparse system arising from 3D high-frequency Helmholtz and Maxwell problems.