Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 1,045 records · Page 58

Evaluation of passive microwave precipitation algorithms in wintertime midlatitude situations

The second intercomparison project of the Global Precipitation Climatology Project (GPCP) examined the estimation of midlatitude, cool-season precipitation. As part of that effort, the authors report here on the results of two microwave techniques, the Goddard scattering algorithm and the physical retrieval algorithm of Kummerow. Results from the estimation of instantaneous rain rate for five overpasses of the Special Sensor Microwave/Imager (SSM/I) are presented in a case study mode to illustrate both the strong and weak points of each technique. These five cases represent a sampling of the various types of precipitating systems observed. Results for the complete set of 20 swaths chosen by the United Kingdom Meteorological Office (UKMO) are then categorized by scatterplots and statistics of instantaneous radar versus microwave-estimated rain rate, rain no-rain contingency tables, and scatterplots of areal coverage of rainfall. Neither algorithm produced a good statistical correlation with the radar data, yet in general, both did well at determining rainy areas. Two reasons are suggested for the low correlation coefficients between both algorithms and the radar data. Time differences between the SSM/I overpass and the radar observations can occasionally account for some of the differences. The primary reason for the low correlations, however, appears to be the predominance of very light rain in the area of interest during the winter. Both algorithms are in good spatial agreement with the radar when the radar data are restricted to rates above 1 mm/h. When all radar rain rates are included, the radar areal coverage increases by as much as a factor of 10 in some cases. Because the Kummerow algorithm does not handle such low rain rates over land very well, and because the Goddard scattering algorithm uses 1 mm/h as the minimum reliably detectable rain rate, regimes that contain large areas of very light rain present inherent difficulties for these retrieval methods. Therefore, the proliferation of low rain rates observed during the experiment is the main contributor to low correlation coefficients and high root-mean-square differences. Mididentification of cold surface (e.g., snow cover) as precipitation was also a problem in several instances.

Negri, Andrew J.↗

Experience from the in-flight calibration of the Extreme Ultraviolet Explorer (EUVE) and Upper Atmosphere Research Satellite (UARS) fixed head star trackers (FHSTs)

Since the original post-launch calibration of the FHSTs (Fixed Head Star Trackers) on EUVE (Extreme Ultraviolet Explorer) and UARS (Upper Atmosphere Research Satellite), the Flight Dynamics task has continued to analyze the FHST performance. The algorithm used for inflight alignment of spacecraft sensors is described and the equations for the errors in the relative alignment for the simple 2 star tracker case are shown. Simulated data and real data are used to compute the covariance of the relative alignment errors. Several methods for correcting the alignment are compared and results analyzed. The specific problems seen on orbit with UARS and EUVE are then discussed. UARS has experienced anomalous tracker performance on an FHST resulting in continuous variation in apparent tracker alignment. On EUVE, the FHST residuals from the attitude determination algorithm showed a dependence on the direction of roll during survey mode. This dependence is traced back to time tagging errors and the original post launch alignment is found to be in error due to the impact of the time tagging errors on the alignment algorithm. The methods used by the FDF (Flight Dynamics Facility) to correct for these problems is described.

Lee, Michael↗

Research and Technology Challenges for Human Data Analysts in Future Safety Management Systems

Enabling new and novel concepts of operations for Advanced Air Mobility poses an important need to evolve current safety management systems (SMS) and is posited to be realized through advances in Machine Learning (ML) Data Sciences and Artificial Intelligence. The “In-time Aviation Safety Management System” (IASMS) concept of operations supports the need to evolve today’s SMS to become more tailorable, scalable, and interoperable in response to forecasted changes expected for the future airspace system. Key to IASMS is integration of proactive and predictive ML algorithms trained to provide “in time” detection and mitigation of hazards and emergent risks through new methods and novel data types. IASMS research and technology development includes human factors design considerations for these systems to include human-system teaming, innovations in human interfaces and management of complex digital data information, human-system interaction/model-based system engineering, and verification and validation for data assurance and trust.

Chad L Stephens↗

Benchmarking and Testing of Qualcomm Snapdragon System-on-Chip for JPL Space Applications and Missions

As some space missions become more challenging due to new environments, greater distances, or more limited size, weight, and power (SWaP) constraints, spacecraft avionics must adapt to allow the spacecraft to be more autonomous and agile---eliminating the Spacecraft-Earth-Spacecraft feedback loop whenever possible. Prime examples of such missions include Aerobots (such as Ingenuity with extremely low SWaP constraints and demanding signal/image processing during flight) and landers in possibly hostile environments (such as a Europa lander mission, with limited communication capacity, high latency, and constrained power budget). To address these challenges, JPL worked with Qualcomm to demonstrate the use of their Snapdragon 801 system-on-chip (SoC) onboard the Ingenuity Helicopter on Mars. The Qualcomm Snapdragon SoC contains various subsystems, including an ARM cluster, a Graphics processing unit, a Digital Signal Processing subsystem, a Neural Processing Engine, Image Signal Processing subsystem, among others. Since the success of Ingenuity, JPL is continuing to work with Qualcomm to address other applications of the Snapdragon SoC technology. This includes the deployment of two 855 Snapdragon development boards onboard the International Space Station (ISS) for successful in-situ benchmarking of applications in space (beyond those tested on Ingenuity). In this paper, we will examine the performance of various applications that have been identified to benefit from greater onboard computational capability. These applications include (among others): machine vision algorithms that are expected to be critical in autonomous entry-descent-and-landing scenarios and real-time Aerobot flight navigation; Hyperspectral compression algorithms; Synthetic Aperture Radar Processing along with various instrument processing algorithms. We discuss how the infusion of Qualcomm's Snapdragon SoC is capable of enabling missions that may not have been able to achieve their goals with traditional flight computing. In addition, we also show that for some algorithms, the software implementation on the Snapdragon SoC outperforms traditional FPGA implementations.

Cretu, Vlad↗

Efficient Preconditioning of a High-Order Solver for Multiple Physics

This work addresses preconditioning approaches for an implicit high-order solver frame-work applied to multiple physics. The solver is based on a space-time spectral element method and matrix-free Newton-Krylov solver developed at NASA over the recent years. Within this context, most preconditioning methods are impractical, as the computational time and memory requirements scale poorly with increasing polynomial orders. To improve computational efficiency, we first describe a novel entity-based Block Jacobi preconditioner for the continuous-Galerkin solution of the linear-elasticity and linear-shell equations. Second, we introduce a multigrid algorithm to further reduce time-to-solution on stiff cases arising from continuous-and discontinuous-Galerkin discretizations. Results obtained on relevant single-physics reference solutions, demonstrate the feasibility of the methods, paving the way for high-order solutions of fully coupled multi-physics problems.

STMD↗

Fast Query-Optimized Kernel-Machine Classification

A recently developed algorithm performs kernel-machine classification via incremental approximate nearest support vectors. The algorithm implements support-vector machines (SVMs) at speeds 10 to 100 times those attainable by use of conventional SVM algorithms. The algorithm offers potential benefits for classification of images, recognition of speech, recognition of handwriting, and diverse other applications in which there are requirements to discern patterns in large sets of data. SVMs constitute a subset of kernel machines (KMs), which have become popular as models for machine learning and, more specifically, for automated classification of input data on the basis of labeled training data. While similar in many ways to k-nearest-neighbors (k-NN) models and artificial neural networks (ANNs), SVMs tend to be more accurate. Using representations that scale only linearly in the numbers of training examples, while exploring nonlinear (kernelized) feature spaces that are exponentially larger than the original input dimensionality, KMs elegantly and practically overcome the classic curse of dimensionality. However, the price that one must pay for the power of KMs is that query-time complexity scales linearly with the number of training examples, making KMs often orders of magnitude more computationally expensive than are ANNs, decision trees, and other popular machine learning alternatives. The present algorithm treats an SVM classifier as a special form of a k-NN. The algorithm is based partly on an empirical observation that one can often achieve the same classification as that of an exact KM by using only small fraction of the nearest support vectors (SVs) of a query. The exact KM output is a weighted sum over the kernel values between the query and the SVs. In this algorithm, the KM output is approximated with a k-NN classifier, the output of which is a weighted sum only over the kernel values involving k selected SVs. Before query time, there are gathered statistics about how misleading the output of the k-NN model can be, relative to the outputs of the exact KM for a representative set of examples, for each possible k from 1 to the total number of SVs. From these statistics, there are derived upper and lower thresholds for each step k. These thresholds identify output levels for which the particular variant of the k-NN model already leans so strongly positively or negatively that a reversal in sign is unlikely, given the weaker SV neighbors still remaining. At query time, the partial output of each query is incrementally updated, stopping as soon as it exceeds the predetermined statistical thresholds of the current step. For an easy query, stopping can occur as early as step k = 1. For more difficult queries, stopping might not occur until nearly all SVs are touched. A key empirical observation is that this approach can tolerate very approximate nearest-neighbor orderings. In experiments, SVs and queries were projected to a subspace comprising the top few principal- component dimensions and neighbor orderings were computed in that subspace. This approach ensured that the overhead of the nearest-neighbor computations was insignificant, relative to that of the exact KM computation.

Mazzoni, Dominic↗

Aeroelastic optimization of a helicopter rotor

Structural optimization of a hingeless rotor is investigated to reduce oscillatory hub loads while maintaining aeroelastic stability in forward flight. Design variables include spanwise distribution of nonstructural mass, chordwise location of blade center of gravity and blade bending stiffnesses (flap, lag and torsion). A comprehensive aeroelastic analysis of rotors, based on a finite element method in space and time, is linked with optimization algorithms to perform optimization of rotor blades. Sensitivity derivatives of blade response, hub loads, and eigenvalues with respect to the design variables are derived using a direct analytical approach, and constitute an integral part of the basic blade response and stability analyses. This approach reduces the computation time substantially; an 80 percent reduction of CPU time to achieve an optimum solution, as compared to the widely adopted finite difference approach. Through stiffness and nonstructural mass distributions, a 60-90 percent reduction in all six 4/rev hub loads is achieved for a four-bladed soft-inplane rotor.

Lim, Joon W.↗

Graph-Based Dynamic Assignment Of Multiple Processors

Algorithm-to-architecture mapping model (ATAMM) is strategy minimizing time needed to periodically execute graphically described, data-driven application algorithm on multiple data processors. Implemented as operating system managing flow of data and dynamically assigns nodes of graph to processors. Predicts throughput versus number of processors available to execute given application algorithm. Includes rules ensuring application algorithm represented by graph executed periodically without deadlock and in shortest possible repetition time. ATAMM proves useful in maximizing effectiveness of parallel computing systems.

Hayes, Paul J.↗

Real-time processor for the Danish airborne SAR

A real-time processor for the Danish high-resolution SAR is presented in terms of its functional performance, algorithm, architecture, and implementation. The real-time processor is mainly intended to assist the operator in using the SAR system, but since the processor has been designed to produce high-quality images, it is expected to make off-line processing superfluous in many cases. The range-Doppler algorithm is adopted and supplemented with an extensive motion compensation, considering the special conditions related to the real-time strip mapping of large scenes. The processor is a pipeline of about 20 elements interconnected by a dedicated data path and a control bus. Only three different types of elements are involved: a programmable signal processing element, a multipurpose memory element, and a multipurpose interface element. The prototypes of these three elements have been tested with satisfactory results.

Dall, J.↗

Estimating Uncertainty in GPCP and TRMM Multi-Satellite Precipitation Estimates

One of the high-priority problems in satellite precipitation estimation is developing algorithms for estimating the errors in precipitation retrievals by individual sensors and subsequent multi-satellite combinations. Classically, we distinguish between "random" and "bias" errors, which do and do not, respectively average to zero over a "big enough" time/space sample. The current operational GPCP and TRMM multi-satellite algorithms are nearly unique in estimating random error for the monthly precipitation estimates from individual sensor systems (including gauge), following Huffman, and then making multi-sensor combinations. No routinely operational global precipitation produces estimates of bias error. Subsequently, a similar scheme has been followed to provide random error estimates for the Multi-satellite Precipitation Analysis (MPA) being computed in real time and after real time for TRMM. The Huffman algorithm for random error is briefly reviewed, including a discussion of the limitations imposed on the algorithm by standard monthly precipitation data sets. Starting from a very simple theoretical treatment of the histogram of precipitation samples in a month, an equation is developed that depends on the estimated average precipitation rate for the month, the number of samples in the month, and two constants. The constants are set separately for each source of precipitation estimate (such as "raingauge") by calibration at selected ground sites. We discuss recent work validating the random error estimates to highlight the successes and limitations of this first-generation approach. We then consider what information is needed from the individual sensor algorithms to facilitate additional accuracy in the estimation of random errors across the time/space span of climate regimes which a global estimation system must handle. In addition, the thorny issue of estimating bias is raised. Finally, the role of error estimates (and the qualitative errors!) in creating combinations of precipitation estimates from different individual sensors is discussed. This issue is particularly important when fine scales in space and time are being considered, say the 0.25 x 0.25-deg 3-hourly estimates in the MPA.

Huffman, G. J.↗

Modeling and measurement of error propagation in a multimodule computing system

An error propagation model has been developed for multimodule computing systems in which the main parameters are the distribution functions of error propagation times. A digraph model is used to represent a multimodule computing system, and error propagation in the system is modeled by general distributions of error propagation times between all pairs of modules. Two algorithms are developed to compute systematically and efficiently the distributions of error propagation times. Experiments are also conducted to measure the distributions of error propagation times with the fault-tolerant microprocessor (FTMP). Statistical analysis of experimental data shows that the error propagation times in FTMP do not follow a well-known distribution, thus justifying the use of general distributions in the present model.

Shin, Kang G.↗

Scheduling message processing for reducing rollback propagation

Traditional checkpointing and rollback recovery techniques for parallel systems have typically assumed the communication pattern is specified by program behavior. In this paper we exploit the property that the communication pattern can often be changed at run-time without affecting program correctness. A scheduling algorithm for message processing and its implementation for reducing rollback propagation are described. The algorithm incorporates a user-transparent prioritized scheme based upon the run-time communication and checkpointing history. Communication trace-driven simulation for several parallel programs written in the Chare Kernel language demonstrates that the probability of rollback propagation can be reduced at the cost of slight additional performance degradation.

Wang, Yi-Min↗

Practical Aspects of Real-Time Modeling for the Learn-To-Fly Concept

Practical aspects of autonomous onboard real-time modeling for the NASA Learn-to-Fly concept are examined using flight data from two subscale test aircraft. A practical real-time global nonlinear aerodynamic modeling method is developed and explained, along with the multiple-input excitation needed for effective real-time modeling. Critical issues for integrating real-time global nonlinear aerodynamic modeling and local linear modeling with the real-time learning adaptive control and guidance elements of the Learn-to-Fly algorithm are identified and discussed. Real-time modeling results from NASA Learn-to-Fly flight demonstrations are presented and evaluated using model fit metrics and prediction tests.

Morelli, Eugene A.↗

Latest Development in Radiative Transfer Models and Retrieval Algorithms Using Principal Components

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.

PCRTM↗

Robustness of adaptive control algorithms in the presence of unmodeled dynamics

This paper reports the outcome of an exhaustive analytical and numerical investigation of stability and robustness properties of a wide class of adaptive control algorithms in the presence of unmodeled dynamics and output disturbances. The class of adaptive algorithms considered are those commonly referred to as model-reference adaptive control algorithms, self-tuning controllers, and dead-beat adaptive controllers; they have been developed for both continuous-time systems and discrete-time systems. The existing adaptive control algorithms have been proven to be globally asymptotically stable under certain assumptions, the key ones being (1) that the number of poles and zeroes of the unknown plant are known, and (2) that the primary performance criterion is related to good command following. These theoretical assumptions are too restrictive from an engineering point of view. Real plants always contain unmodeled high-frequency dynamics and small delays, and hence no upper bound on the number of the plant poles and zeroes exists. Also real plants are always subject to unmeasurable output additive disturbances, although these may be guide small. Hence, it is important to critically examine the stability robustness properties of the existing adaptive algorithms when some of the theoretical assumptions are removed; in particular, their stability and performance properties in the presence of unmodeled dynamics and output disturbances. Previously announced in STAR as N83-16061

Rohrs, C. E.↗

The formation of protostellar disks. I - 1 M(solar)

Hydrodynamical calculations of the collapse of an axisymmetric, rotating one solar mass protostellar cloud, including the effects of radiative transfer and radiative acceleration but without magnetic fields, are presented. The results include calculations of infrared protostellar spectra as a function of time and viewing angle. A numerical algorithm involving explicit nested grids is used to resolve the region of initial disk formation and at the same time to include the outer regions in the calculation. The central part of the protostar is modeled approximately. Initial conditions are systematically varied to investigate their influence on the evolution and final configuration of central star plus circumstellar disk. The initial state for the standard case is a centrally condensed molecular cloud core of one solar mass with a mean density of 8 x 10 exp -18 g/cu cm and a specific angular momentum at the outer edge of 7 x 10 exp 20 sq cm/s. The collapse is followed for 8 x 10 exp 4 yr, at which point 0.45 solar mass is contained in a rapidly rotating central object and most of the remainder in a surrounding equilibrium disk. The stability of this final structure is qualitatively analyzed.

Yorke, Harold W.↗

Vectorized Rebinning Algorithm for Fast Data Down-Sampling

A vectorized rebinning (down-sampling) algorithm, applicable to N-dimensional data sets, has been developed that offers a significant reduction in computer run time when compared to conventional rebinning algorithms. For clarity, a two-dimensional version of the algorithm is discussed to illustrate some specific details of the algorithm content, and using the language of image processing, 2D data will be referred to as "images," and each value in an image as a "pixel." The new approach is fully vectorized, i.e., the down-sampling procedure is done as a single step over all image rows, and then as a single step over all image columns. Data rebinning (or down-sampling) is a procedure that uses a discretely sampled N-dimensional data set to create a representation of the same data, but with fewer discrete samples. Such data down-sampling is fundamental to digital signal processing, e.g., for data compression applications.

Dean, Bruce↗

The Collection 6 'dark-target' MODIS Aerosol Products

Aerosol retrieval algorithms are applied to Moderate resolution Imaging Spectroradiometer (MODIS) sensors on both Terra and Aqua, creating two streams of decade-plus aerosol information. Products of aerosol optical depth (AOD) and aerosol size are used for many applications, but the primary concern is that these global products are comprehensive and consistent enough for use in climate studies. One of our major customers is the international modeling comparison study known as AEROCOM, which relies on the MODIS data as a benchmark. In order to keep up with the needs of AEROCOM and other MODIS data users, while utilizing new science and tools, we have improved the algorithms and products. The code, and the associated products, will be known as Collection 6 (C6). While not a major overhaul from the previous Collection 5 (C5) version, there are enough changes that there are significant impacts to the products and their interpretation. In its entirety, the C6 algorithm is comprised of three sub-algorithms for retrieving aerosol properties over different surfaces: These include the dark-target DT algorithms to retrieve over (1) ocean and (2) vegetated-dark-soiled land, plus the (3) Deep Blue (DB) algorithm, originally developed to retrieve over desert-arid land. Focusing on the two DT algorithms, we have updated assumptions for central wavelengths, Rayleigh optical depths and gas (H2O, O3, CO2, etc.) absorption corrections, while relaxing the solar zenith angle limit (up to 84) to increase pole-ward coverage. For DT-land, we have updated the cloud mask to allow heavy smoke retrievals, fine-tuned the assignments for aerosol type as function of season location, corrected bugs in the Quality Assurance (QA) logic, and added diagnostic parameters such as topographic altitude. For DT-ocean, improvements include a revised cloud mask for thin-cirrus detection, inclusion of wind speed dependence in the retrieval, updates to logic of QA Confidence flag (QAC) assignment, and additions of important diagnostic information. At the same time as we have introduced algorithm changes, we have also accounted for upstream changes including: new instrument calibration, revised land-sea masking, and changed cloud masking. Upstream changes also impact the coverage and global statistics of the retrieved AOD. Although our responsibility is to the DT code and products, we have also added a product that merges DT and DB product over semi-arid land surfaces to provide a more gap-free dataset, primarily for visualization purposes. Preliminary validation shows that compared to surface-based sunphotometer data, the C6, Level 2 (along swath) DT-products compare at least as well as those from C5. C6 will include new diagnostic information about clouds in the aerosol field, including an aerosol cloud mask at 500 m resolution, and calculations of the distance to the nearest cloud from clear pixels. Finally, we have revised the strategy for aggregating and averaging the Level 2 (swath) data to become Level 3 (gridded) data. All together, the changes to the DT algorithms will result in reduced global AOD (by 0.02) over ocean and increased AOD (by 0.02) over land, along with changes in spatial coverage. Changes in calibration will have more impact to Terras time series, especially over land. This will result in a significant reduction in artificial differences in the Terra and Aqua datasets, and will stabilize the MODIS data as a target for AEROCOM studie

Aerosol retrieval algorithms↗