Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “range finding 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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Skyline based terrain matching

Skyline-based terrain matching, a new method for locating the vantage point of stereo camera or laser range-finding measurements on a global map previously prepared by satellite or aerial mapping is described. The orientation of the vantage is assumed known, but its translational parameters are determined by the algorithm. Skylines, or occluding contours, can be extracted from the sensory measurements taken by an autonomous vehicle. They can also be modeled from the global map, given a vantage estimate from which to start. The two sets of skylines, represented in cylindrical coordinates about either the true or the estimated vantage, are employed as 'features' or reference objects common to both sources of information. The terrain matching problem is formulated in terms of finding a translation between the respective representations of the skylines, by approximating the two sets of skylines as identical features (curves) on the actual terrain. The search for this translation is based on selecting the longest of the minimum-distance vectors between corresponding curves from the two sets of skylines. In successive iterations of the algorithm, the approximation that the two sets of curves are identical becomes more accurate, and the vantage estimate continues to improve. The algorithm was implemented and evaluated on a simulated terrain. Illustrations and examples are included.

Page, Lance A.↗
NASA NTRS1986

Multigrid method for a vortex breakdown simulation

An inviscid model for a steady axisymmetric flow with swirl was studied. The governing equation is a nonlinear elliptic equation which has more than one solution for a certain range of the swirl parameter. The physically interesting solutions have closed streamlines that look like vortex breakdown (bubble-like solutions). A multigrid method is used to find these solutions. Using an FMG algorithm (nested iteration), the problem is solved in just a few multigrid cycles.

Taasan, S.↗
NASA NTRS1995

Statistical properties of DNA sequences

We review evidence supporting the idea that the DNA sequence in genes containing non-coding regions is correlated, and that the correlation is remarkably long range--indeed, nucleotides thousands of base pairs distant are correlated. We do not find such a long-range correlation in the coding regions of the gene. We resolve the problem of the "non-stationarity" feature of the sequence of base pairs by applying a new algorithm called detrended fluctuation analysis (DFA). We address the claim of Voss that there is no difference in the statistical properties of coding and non-coding regions of DNA by systematically applying the DFA algorithm, as well as standard FFT analysis, to every DNA sequence (33301 coding and 29453 non-coding) in the entire GenBank database. Finally, we describe briefly some recent work showing that the non-coding sequences have certain statistical features in common with natural and artificial languages. Specifically, we adapt to DNA the Zipf approach to analyzing linguistic texts. These statistical properties of non-coding sequences support the possibility that non-coding regions of DNA may carry biological information.

Non-NASA Center↗
NASA NTRS1995

Statistical and linguistic features of DNA sequences

We present evidence supporting the idea that the DNA sequence in genes containing noncoding regions is correlated, and that the correlation is remarkably long range--indeed, base pairs thousands of base pairs distant are correlated. We do not find such a long-range correlation in the coding regions of the gene. We resolve the problem of the "non-stationary" feature of the sequence of base pairs by applying a new algorithm called Detrended Fluctuation Analysis (DFA). We address the claim of Voss that there is no difference in the statistical properties of coding and noncoding regions of DNA by systematically applying the DFA algorithm, as well as standard FFT analysis, to all eukaryotic DNA sequences (33 301 coding and 29 453 noncoding) in the entire GenBank database. We describe a simple model to account for the presence of long-range power-law correlations which is based upon a generalization of the classic Levy walk. Finally, we describe briefly some recent work showing that the noncoding sequences have certain statistical features in common with natural languages. Specifically, we adapt to DNA the Zipf approach to analyzing linguistic texts, and the Shannon approach to quantifying the "redundancy" of a linguistic text in terms of a measurable entropy function. We suggest that noncoding regions in plants and invertebrates may display a smaller entropy and larger redundancy than coding regions, further supporting the possibility that noncoding regions of DNA may carry biological information.

Non-NASA Center↗
NASA NTRS1981

An evaluation of ISOCLS and CLASSY clustering algorithms for forest classification in northern Idaho

Both the iterative self-organizing clustering system (ISOCLS) and the CLASSY algorithms were applied to forest and nonforest classes for one 1:24,000 quadrangle map of northern Idaho and the classification and mapping accuracies were evaluated with 1:30,000 color infrared aerial photography. Confusion matrices for the two clustering algorithms were generated and studied to determine which is most applicable to forest and rangeland inventories in future projects. In an unsupervised mode, ISOCLS requires many trial-and-error runs to find the proper parameters to separate desired information classes. CLASSY tells more in a single run concerning the classes that can be separated, shows more promise for forest stratification than ISOCLS, and shows more promise for consistency. One major drawback to CLASSY is that important forest and range classes that are smaller than a minimum cluster size will be combined with other classes. The algorithm requires so much computer storage that only data sets as small as a quadrangle can be used at one time.

Werth, L. F.↗
NASA NTRS1985

Cluster-cluster clustering

The cluster correlation function xi sub c(r) is compared with the particle correlation function, xi(r) in cosmological N-body simulations with a wide range of initial conditions. The experiments include scale-free initial conditions, pancake models with a coherence length in the initial density field, and hybrid models. Three N-body techniques and two cluster-finding algorithms are used. In scale-free models with white noise initial conditions, xi sub c and xi are essentially identical. In scale-free models with more power on large scales, it is found that the amplitude of xi sub c increases with cluster richness; in this case the clusters give a biased estimate of the particle correlations. In the pancake and hybrid models (with n = 0 or 1), xi sub c is steeper than xi, but the cluster correlation length exceeds that of the points by less than a factor of 2, independent of cluster richness. Thus the high amplitude of xi sub c found in studies of rich clusters of galaxies is inconsistent with white noise and pancake models and may indicate a primordial fluctuation spectrum with substantial power on large scales.

Barnes, J.↗
NASA NTRS2024

Maximizing the Volume of Collocated Data from Two Coordinated Suborbital Platforms

Suborbital (e.g., airborne) campaigns that carry advanced remote sensing and in situ payloads provide detailed observations of atmospheric processes, but can be challenging to use when it is necessary to geographically collocate data from multiple platforms that make repeated observations of a given geographic location at different altitudes. This study reports on a data collocation algorithm that maximizes the volume of collocated data from two coordinated suborbital platforms and demonstrates its value using data from the NASA Aerosol Cloud Meteorology Interactions Over the western Atlantic Experiment (ACTIVATE) suborbital mission. A robust data collocation algorithm is critical for the success of the ACTIVATE mission goal to develop new and improved remote sensing algorithms, and quantify their performance. We demonstrate the value of these collocated data to quantify the performance of a recently developed vertically resolved lidar + polarimeter–derived aerosol particle number concentration (Na ) product, resulting in a range-normalized mean absolute deviation (NMAD) of 9% compared to in situ measurements. We also show that this collocation algorithm increases the volume of collocated ACTIVATE data by 21% compared to using only nearest-neighbor finding algorithms alone. Additional to the benefits demonstrated within this study, the data files and routines produced by this algorithm have solved both the critical collocation and the collocation application steps for researchers who require collocated data for their own studies. This freely available and open-source collocation algorithm can be applied to future suborbital campaigns that, like ACTIVATE, use multiple platforms to conduct coordinated observations, e.g., a remote sensing aircraft together with in situ data collected from suborbital platforms.

Atmosphere↗
NASA NTRS2007

Interannual and Decadal Variability of Ocean Surface Latent Heat Flux as Seen from Passive Microwave Satellite Algorithms

Ocean surface turbulent fluxes are critical links in the climate system since they mediate energy exchange between the two fluid systems (ocean and atmosphere) whose combined heat transport determines the basic character of Earth's climate. Deriving physically-based latent and sensible heat fluxes from satellite is dependent on inferences of near surface moisture and temperature from coarser layer retrievals or satellite radiances. Uncertainties in these "retrievals" propagate through bulk aerodynamic algorithms, interacting as well with error properties of surface wind speed, also provided by satellite. By systematically evaluating an array of passive microwave satellite algorithms, the SEAFLUX project is providing improved understanding of these errors and finding pathways for reducing or eliminating them. In this study we focus on evaluating the interannual variability of several passive microwave-based estimates of latent heat flux starting from monthly mean gridded data. The algorithms considered range from those based essentially on SSM/I (e.g. HOAPS) to newer approaches that consider additional moisture information from SSM/T-2 or AMSU-B and lower tropospheric temperature data from AMSU-A. On interannual scales, variability arising from ENSO events and time-lagged responses of ocean turbulent and radiative fluxes in other ocean basins (as well as the extratropical Pacific) is widely recognized, but still not well quantified. Locally, these flux anomalies are of order 10-20 W/sq m and present a relevant "target" with which to verify algorithm performance in a climate context. On decadal time scales there is some evidence from reanalyses and remotely-sensed fluxes alike that tropical ocean-averaged latent heat fluxes have increased 5-10 W/sq m since the early 1990s. However, significant uncertainty surrounds this estimate. Our work addresses the origin of these uncertainties and provides statistics on time series of tropical ocean averages, regional space / time correlation analysis, and separation of contributions by variations in wind and near surface humidity deficit. Comparison to variations in reanalysis data sets is also provided for reference.

Robertson, Franklin R.↗
NASA NTRS2012

Fast Simulators for Satellite Cloud Optical Centroid Pressure Retrievals, 1. Evaluation of OMI Cloud Retrievals

The cloud Optical Centroid Pressure (OCP), also known as the effective cloud pressure, is a satellite-derived parameter that is commonly used in trace-gas retrievals to account for the effects of clouds on near-infrared through ultraviolet radiance measurements. Fast simulators are desirable to further expand the use of cloud OCP retrievals into the operational and climate communities for applications such as data assimilation and evaluation of cloud vertical structure in general circulation models. In this paper, we develop and validate fast simulators that provide estimates of the cloud OCP given a vertical profile of optical extinction. We use a pressure-weighting scheme where the weights depend upon optical parameters of clouds and/or aerosol. A cloud weighting function is easily extracted using this formulation. We then use fast simulators to compare two different satellite cloud OCP retrievals from the Ozone Monitoring Instrument (OMI) with estimates based on collocated cloud extinction profiles from a combination of CloudS at radar and MODIS visible radiance data. These comparisons are made over a wide range of conditions to provide a comprehensive validation of the OMI cloud OCP retrievals. We find generally good agreement between OMI cloud OCPs and those predicted by CloudSat. However, the OMI cloud OCPs from the two independent algorithms agree better with each other than either does with the estimates from CloudSat/MODIS. Differences between OMI cloud OCPs and those based on CloudSat/MODIS may result from undetected snow/ice at the surface, cloud 3-D effects, low altitude clouds missed by CloudSat, and the fact that CloudSat only observes a relatively small fraction of an OMI field-of-view.

Joiner, J.↗
NASA NTRS2018

Machine Learning Application to Atmospheric Chemistry Modeling

Atmospheric chemistry is a high-dimensionality, large-data problem and thus may be suited to machine-learning algorithms. We show here the potential of a random forest regression algorithm to replace the gas-phase chemistry solver in the GEOS-Chem chemistry model. In this proof-of-concept study, we used one month of model output to train random forest regression models to predict the concentrations of each long-lived chemical species after integration based upon the physical and chemical conditions before the chemical integration. The choice of prediction type has a strong impact on the skill of the regression model. We find best results from predicting the change in concentration for very long-lived species and the absolute concentration for shorter lived species. The skill of the machine learning algorithm is further improved by using a family approach for NO and NO2 rather than treating them independently.By replacing the numerical integrator with the random forest algorithm and running this model for one month, we find that the model is able to reproduce many of the features of the reference chemistry simulation. Replacing the integration methodology with a machine learning algorithm has the potential to be substantially faster. There are a wide range of applications for such an approach, e.g. to generate boundary conditions, for use in air quality forecasts or chemical data assimilation systems, etc.

Keller, Christoph A.↗
NASA NTRS2022

Intrinsic Dimensionality as a Metric for the Impact of Mission Design Parameters

High-resolution space-based spectral imaging of the Earth's surface delivers critical information for monitoring changes in the Earth system as well as resource management and utilization. Orbiting spectrometers are built according to multiple design parameters, including ground sampling distance (GSD), spectral resolution, temporal resolution, and signal-to-noise ratio. Different applications drive divergent instrument designs, so optimization for wide-reaching missions is complex. The Surface Biology and Geology component of NASA's Earth System Observatory addresses science questions and meets applications needs across diverse fields, including terrestrial and aquatic ecosystems, natural disasters, and the cryosphere. The algorithms required to generate the geophysical variables from the observed spectral imagery each have their own inherent dependencies and sensitivities, and weighting these objectively is challenging. Here, we introduce intrinsic dimensionality (ID), a measure of information content, as an applications-agnostic, data-driven metric to quantify performance sensitivity to various design parameters. ID is computed through the analysis of the eigenvalues of the image covariance matrix, and can be thought of as the number of significant principal components. This metric is extremely powerful for quantifying the information content in high-dimensional data, such as spectrally resolved radiances and their changes over space and time. We find that the ID decreases for coarser GSD, decreased spectral resolution and range, less frequent acquisitions, and lower signal-to-noise levels. This decrease in information content has implications for all derived products. ID is simple to compute, providing a single quantitative standard to evaluate combinations of design parameters, irrespective of higher-level algorithms, products, applications, or disciplines.

Intrinsic dimensionality↗
NASA NTRS1984

A vectorized solution for incompressible flow

An algorithm is developed to obtain solutions to the unsteady Reynolds-averaged incompressible Navier-Stokes equations in general curvilinear coordinates on a vector processor. The governing equations are in nonconservative form with the velocity and pressure as dependent variables. Two momentum equations and the Poisson equation for pressure form a set of three governing equations for three flow field unknowns: u, v, and p. The governing equations and boundary conditions are expressed in terms of boundary-conforming curvilinear coordinates, and a checkerboard SOR iteration is used to solve the governing equations. Several possible sequences for a checkerboard SOR iteration are investigated for finding the best overall convergence rate. The efficiency and capability of the present algorithm was assessed using the example of an 18 percent thick NACA 66(3)018 airfoil at zero degree angle of attack for chord Reynolds number range 1000-40,000.

Patel, N. R.↗
NASA NTRS2021

The NANOGrav 12.5 Year Data Set: Monitoring Interstellar Scattering Delays

We extract interstellar scintillation parameters for pulsars observed by the NANOGrav radio pulsar timing program. Dynamic spectra for the observing epochs of each pulsar were used to obtain estimates of scintillation timescales, scintillation bandwidths, and the corresponding scattering delays using a stretching algorithm to account for frequency-dependent scaling. We were able to measure scintillation bandwidths for 28 pulsars at1500 MHz and 15 pulsars at 820 MHz. We examine scaling behavior for 17 pulsars and find power-law indices ranging from−0.7 to−3.6, though these may be biased shallow due to insufficient frequency resolution at lower frequencies. We were also able to measure scintillation timescales for six pulsars at 1500 MHz and seven pulsars at820 MHz. There is fair agreement between our scattering delay measurements and electron-density model predictions for most pulsars. We derive interstellar scattering-based transverse velocities assuming isotropic scattering and a scattering screen halfway between the pulsar and Earth. We also estimate the location of the scattering screens assuming proper motion and interstellar scattering-derived transverse velocities are equal. We find no correlations between variations in scattering delay and either variations in dispersion measure or flux density. For most pulsars for which scattering delays are measurable, we find that time-of-arrival uncertainties for a given epoch are larger than our scattering delay measurements, indicating that variable scattering delays are currently subdominant in our overall noise budget but are important for achieving precisions of tens of nanoseconds or less.

Jacob E Turner↗
NASA NTRS2020

A Modified Algorithm and Open-Source Computational Package for the Determination of Infrared Optical Constants Relevant to Astrophysics

Infrared (IR) telescopes, such as Spitzer and SOFIA, have revealed a rich variety of chemical species trapped in interstellar ices. The most fundamental parameters to be derived from observed IR spectra are the identity and abundance of each component. Several compounds have been conclusively or tentatively identified, but the band strengths and optical constants needed to derive accurate abundances for many of these are poorly constrained. We have developed a modified approach to the extraction of the real and imaginary parts of the refractive index (optical constants) of a thin film from a single transmission spectrum measured in the IR spectral range. Our algorithm is similar to those implemented by previous authors, with some major changes that yield results for strong absorptions where previous approaches fail: (1) an adaptive k-correction step size, (2) the use of a root-finding algorithm to obtain a more accurate k-correction at each iteration, and (3) a k-correction step that prevents non-physical results such as negative n-values that prevent convergence in the calculation algorithm. The algorithm is presented and described, with examples to show agreement with some existing results and improvements upon others. New optical-constants calculations for CH3OH, CO2, N2O, and CH4 are presented, and potential implications for the modeling of interstellar and planetary ice data from space telescopes are discussed. With the objective of being open-source and transparent, the full source code in the free Python programming language is made available along with the compiled version and the laboratory data used to produce the results shown.

Perry A. Gerakines↗
NASA NTRS1986

Approximate algorithms for partitioning and assignment problems

The problem of optimally assigning the modules of a parallel/pipelined program over the processors of a multiple computer system under certain restrictions on the interconnection structure of the program as well as the multiple computer system was considered. For a variety of such programs it is possible to find linear time if a partition of the program exists in which the load on any processor is within a certain bound. This method, when combined with a binary search over a finite range, provides an approximate solution to the partitioning problem. The specific problems considered were: a chain structured parallel program over a chain-like computer system, multiple chain-like programs over a host-satellite system, and a tree structured parallel program over a host-satellite system. For a problem with m modules and n processors, the complexity of the algorithm is no worse than O(mnlog(W sub T/epsilon)), where W sub T is the cost of assigning all modules to one processor and epsilon the desired accuracy.

Iqbal, M. A.↗
NASA NTRS2007

Analytical Approach for Estimating Preliminary Mass of ARES I Crew Launch Vehicle Upper Stage Structural Components

In January 2004, President Bush gave the National Aeronautics and Space Administration (NASA) a vision for Space Exploration by setting our sight on a bold new path to go back to the Moon, then to Mars and beyond. In response to this vision, NASA started the Constellation Program, which is a new exploration launch vehicle program. The primary mission for the Constellation Program is to carry out a series of human expeditions ranging from Low Earth Orbit to the surface of Mars and beyond for the purposes of conducting human exploration of space, as specified by the Vision for Space Exploration (VSE). The intent is that the information and technology developed by this program will provide the foundation for broader exploration activities as our operational experience grows. The ARES I Crew Launch Vehicle (CLV) has been designated as the launch vehicle that will be developed as a "first step" to facilitate the aforementioned human expeditions. The CLV Project is broken into four major elements: First Stage, Upper Stage Engine, Upper Stage (US), and the Crew Exploration Vehicle (CEV). NASA's Marshall Space Flight Center (MSFC) is responsible for the design of the CLV and has the prime responsibility to design the upper stage of the vehicle. The US is the second propulsive stage of the CLV and provides CEV insertion into low Earth orbit (LEO) after separation from the First Stage of the Crew Launch Vehicle. The fully integrated Upper Stage is a mix of modified existing heritage hardware (J-2X Engine) and new development (primary structure, subsystems, and avionics). The Upper Stage assembly is a structurally stabilized cylindrical structure, which is powered by a single J-2X engine which is developed as a separate Element of the CLV. The primary structure includes the load bearing liquid hydrogen (LH2) and liquid oxygen (LOX) propellant tanks, a Forward Skirt, the Intertank structure, the Aft Skirt and the Thrust Structure. A Systems Tunnel, which carries fluid and electrical power functions to other Elements of the CLV, is included as secondary structure. The MSFC has an overall responsibility for the integrated US element as well as structural design an thermal control of the fuel tanks, intertank, interstage, avionics, main propulsion system, Reaction Control System (RCS) for both the Upper Stage and the First Stage. MSFC's Spacecraft and Vehicle Department, Structural and Analysis Design Division is developing a set of predicted mass of these elements. This paper details the methodology, criterion and tools used for the preliminary mass predictions of the upper stage structural assembly components. In general, weight of the cylindrical barrel sections are estimated using the commercial code Hypersizer, whereas, weight of the domes are developed using classical solutions. HyperSizer is software that performs automated structural analysis and sizing optimization based on aerospace methods for strength, stability, and stiffness. Analysis methods range from closed form, traditional hand calculations repeated every day in industry to more advanced panel buckling algorithms. Margin-of-safety reporting for every potential failure provides the engineer with a powerful insight into the structural problem. Optimization capabilities include finding minimum weight panel or beam concepts, material selections, cross sectional dimensions, thicknesses, and lay-ups from a library of 40 different stiffened and sandwich designs and a database of composite, metallic, honeycomb, and foam materials. Multiple different concepts (orthogrid, isogrid, and skin stiffener) were run for multiple loading combinations of ascent design load with and with out tank pressure as well as proof pressure condition. Subsequently, selected optimized concept obtained from Hypersizer runs was translated into a computer aid design (CAD) model to account for the wall thickness tolerance, weld land etc for developing the most probable weight of the components. The flow diram summarizes the analysis steps used in developing these predicted mass.

Aggarwal, Pravin↗
NASA NTRS2001

Global Positioning System Satellite Selection Method

The satellite selection method as utilized by the spaceborne Global Positioning System receiver provides navigational solutions and is designed for use in low Earth orbit. The satellite selection method is a robust algorithm that can be used a GPS receiver to select appropriate GPS satellites for use in calculating point solutions or attitude solutions. The method is takes into account the difficulty of finding a particular GPS satellite phase code, especially when the search range in greatly increased due to Doppler shifts introduced into the carrier frequency. The method starts with an update of the antenna pointing and spacecraft vectors to determine the antenna backplane direction. Next, the GPS satellites that will potentially be in view of the antenna are ranked on a list, whereby the list is generated based on the estimated attitude and position of each GPS satellite. Satellites blocked by the Earth are not entered on this list. A second list is created, whereby the GPS satellites are ranked according to their desirability for use in attitude determination. GPS satellites are ranked according to their orthogonality to the antenna backplane, and according to geometric dilution of precision considerations. After the lists are created, the channels of the spaceborne GPS receiver are assigned to various GPS satellites for acquisition and lock. Preliminary Doppler frequencies for searching are assigned to the various channels.

Frederick A Niles↗
NASA NTRS1994

A combined algorithm for minimum time slewing of flexible spacecraft

The use of Pontryagin's Maximum Principle for the large-angle slewing of large flexible structures usually results in the so-called two-point boundary-value problem (TPBVP), in which many requirements (e.g., minimum time, small flexible amplitude, and limited control powers, etc.) must be satisfied simultaneously. The successful solution of this problem depends largely on the use of an efficient numerical computational algorithm. There are many candidate algorithms available for his problem (e.g., quasilinearization, gradient, and shooting, etc.). In this paper, a proposed algorithm, which combines the quasilinearization method with a time shortening technique and a shooting method, is applied to the minimum-time, three-dimensional, and large-angle maneuver of flexible spacecraft, particularly the orbiting Spacecraft Control Laboratory Experiment (SCOLE) configuration. Theoretically, the nonlinear TPBVP can be solved only through the shooting method to find the 'exact' switching times for the bang-bang controls. However, computationally, a suitable guess for the missing initial costates is crucial because the convergence range of the unknown initial costates is usually narrow, especially for systems with high dimensions and when a multi-bang-bang control strategy is needed. On the other hand, the problems of near minimum time attitude maneuver of general rigid spacecraft and fast slewing of flexible spacecraft have been examined by the authors through a numerical approach based on the quasilinearization algorithm with a time shortening technique. Computational results have demonstrated its broad convergence range and insensitivity to initial costate choices. Consequently, a combined approach is naturally suggested here to solve the minimum time slewing problem. That is, in the computational process, the quasilinearization method is used first to obtain a near minimum time solution. Then, the acquired converged initial costates from the quasilinearization approach are transformed (tailored) to and used as the initial costate guess for starting the shooting method. Finally, the shooting method takes over the remaining calculations until the minimum-time solution converges. The nonlinear equations of motion of the SCOLE are formulated by using Lagrange's equations, with the mast modeled as a continuous beam subject to three-dimensional deformations. The numerical results will be presented and some related computational issues will also be discussed.

Bainum, P. M.↗