Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized 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 1,189 records · Page 66

Analysis Method for Inelastic, Adhesively Bonded Joints with Anisotropic Adherends

A one-dimensional analysis method for evaluating adhesively bonded joints composed of anisotropic adherends and adhesives with nonlinear material behavior is presented in the proposed paper. The strain and resulting stress field in a general, bonded joint overlap are determined by using a variable-step, finite-difference solution algorithm to iteratively solve a system of first-order differential equations. Applied loading is given by a system of combined extensional, bending, and shear forces that are applied to the edge of the joint overlap. Adherends are assumed to behave as linear, cylindrically bent plates using classical laminated plate theory that includes the effects of first-order transverse shear deformation. Using the deformation theory of plasticity and a modified von-Mises yield criterion, inelastic material behavior is modeled in the adhesive layer. Results for the proposed method are verified against previous results from the literature and shown to be in excellent agreement. An additional case that highlights the effects of transverse shear deformation between similar adherends is also presented.

Smeltzer, Stanley S., III↗

Graupel and Snow Determination in Convection Using Dual-Wavelength Radar

Convective storms contain significant amounts of snow and graupel that each have different scattering properties for radar and radiometer remote sensing. TRMM TMI algorithms have relied heavily on radiative transfer calculations based on cloud model predicted microphysics information. In general, without in situ aircraft measurements, it is very difficult to separate snow and graupel using remote measurements. At the 94 GHZ frequency, snow is weakly attenuating while graupel is strongly attenuating. With a non-attenuating frequency such as X-band, one can distinguish Mie scattering from larger hydrometeors as well as attenuation from graupel. The presence of supercooled water will also cause attenuation of the 94 GHz radar signal, but this is mainly in convective updrafts. We will present preliminary results aimed at distinguishing snow from graupel using dual-wavelength (9.6 GHz, 94 GHz) measurements from aircraft overflights of convective storms in Florida. Measurements were made with the 9.6 GHz ER-2 Doppler Radar (EDOP) and the 94 GHz Cloud Radar System (CRS) over a number of different precipitation systems. Analysis of the vertical profiles at the two wavelengths provides information on snow and graupel regions, as well as supercooled water. The presentation will include examples from different cases and discussion of the results.

Heymsfield, Gerald↗

NASA's Potential Contributions for Remediation of Retention Ponds Using Solar Ultraviolet Radiation and Photocatalysis

This Candidate Solution uses NASA Earth science research on atmospheric ozone and aerosols data (1) to help improve the prediction capabilities of water runoff models that are used to estimate runoff pollution from retention ponds, and (2) to understand the pollutant removal contribution and potential of photocatalytically coated materials that could be used in these ponds. Models (the EPA's SWMM and the USGS SLAMM) exist that estimate the release of pollutants into the environment from storm-water-related retention pond runoff. UV irradiance data acquired from the satellite mission Aura and from the OMI Surface UV algorithm will be incorporated into these models to enhance their capabilities, not only by increasing the general understanding of retention pond function (both the efficacy and efficiency) but additionally by adding photocatalytic materials to these retention ponds, augmenting their performance. State and local officials who run pollution protection programs could then develop and implement photocatalytic technologies for water pollution control in retention ponds and use them in conjunction with existing runoff models. More effective decisions about water pollution protection programs could be made, the persistence and toxicity of waste generated could be minimized, and subsequently our natural water resources would be improved. This Candidate Solution is in alignment with the Water Management and Public Health National Applications.

Underwood, Lauren W.↗

The Canadian Experiment for Freeze/Thaw in 2012 or 2013 CanEx-FT12 or FT13

General objectives of the experiment are: Pre-launch Calibration/Validation of SMAP Freeze/Thaw products and retrieval algorithms and rehearsal for Soil Moisture Active-Passive (SMAP) post launch validation. The basis of the radar freeze-thaw measurement is the large shift in dielectric constant and backscatter (dB) between predominantly frozen & thawed conditions. The Dielectric constant of liquid water varies with frequency, whereas that of pure ice is constant

permafrost↗

Autonomous rock detection for Mars terrain

In this paper we introduce a general framework for an image based autonomous rock detection process for Martian terrain. A rock detection algorithm, based on this framework, is described and demonstrated on examples of real Mars Rover data. An attempt is made to produce a system that is independent of parameters to ease on-board implementation for real time in-situ operation.

rock↗

Assessment of the Accuracy and Consistency of Cloud Property Retrievals from Passive Radiometers with Varying Spectral Information

Over the past few decades, space-based passive radiometers have been used to study the spatial distribution of clouds and some of their basic properties. Modern radiometers have significantly higher spatial resolution and collect more spectral information (i.e., have more spectral bands) than early instruments, and these advances have allowed researchers to characterize cloud physical and microphysical properties with greater detail. There is significant interest in utilizing as much of the existing satellite record as possible to study global and regional changes in cloud occurrence and distribution as well as the associated changes in reflected shortwave and outgoing longwave fluxes. Cloud property retrieval algorithms such as the NASA Satellite Cloud Optical and Radiative Property System (SatCORPS) have traditionally utilized as much spectral information as possible in order to maximize the accuracy of the retrievals. However, changes to the retrieval algorithm over time in order to take advantage of progressively more spectral information results in inconsistencies in cloud properties which in turn results in inconsistencies with products derived from these properties. It is not possible to implement modern state-of-the-art algorithms to earlier instruments which lack diverse spectral information, but many instruments since the early 2000s generally have approximately similar spectral bands in the visible (~0.65 microns), longwave infrared (~11 microns), and in many cases, the midwave infrared (~3.8 microns) and water vapor absorption (~6.7 microns), portions of the electromagnetic spectrum. Different versions of SatCORPS have been implemented with either the full set of spectral information collected by imagers such as GOES-16 and MODIS or with a reduced set of spectral bands in order to be more consistent with past imagers that lack such diverse spectral information. This study uses independent cloud property retrievals from the Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) to assess the accuracy of the retrievals (e.g., cloud fraction, thermodynamic phase, altitude) from the different retrieval methods and to demonstrate the advantages and disadvantages of using a reduced set of common spectral bands in order to achieve temporal and spatial consistency across different instruments.

Christopher R. Yost↗

Use of non-spherical gravity harmonics for relative motion GN/C (category 2)

Detailed analysis of the Automatic Rendezvous and Capture problem indicate a need for three different regions of mathematical description for the GN&C algorithms: (1) multi-vehicle orbital mechanics to the rendezvous interface point, i.e., within 100 nm; (2) relative motion solutions (such as Clohessy-Wiltshire type) from the far-field to the near-field interface, i.e., within 1 nm and; (3) close proximity motion - the near-field motion where the relative differences in the gravitational and orbit inertial accelerations can be neglected from the equations of motion. Limit boundaries to these regions can be precisely defined by further analysis and will be functions of the tracking measurement accuracies and the computer resources available for the solution of the algorithms. This paper analyzes the relative motion in Regions 2 and 3 above and present the derivation and discussion of the general case of non-spherical gravitational perturbed relative motion. Mathematical deviations from the numerically integrated spherical gravity case and solutions from the Clohessy-Wiltshire equations are presented in the analysis. Based upon this preliminary analysis, it is recommended that further efforts be used to assess the relative position and velocity differences in Region 2 due to non-spherical gravity harmonics and that viable GN&C algorithms be developed to include these gravity perturbations (especially the effects of the first gravity harmonic, J2).

Henderson, David M.↗

Application of Machine Learning Algorithms to the Study of Noise Artifacts in Gravitational-Wave Data

The sensitivity of searches for astrophysical transients in data from the Laser Interferometer Gravitationalwave Observatory (LIGO) is generally limited by the presence of transient, non-Gaussian noise artifacts, which occur at a high-enough rate such that accidental coincidence across multiple detectors is non-negligible. Furthermore, non-Gaussian noise artifacts typically dominate over the background contributed from stationary noise. These "glitches" can easily be confused for transient gravitational-wave signals, and their robust identification and removal will help any search for astrophysical gravitational-waves. We apply Machine Learning Algorithms (MLAs) to the problem, using data from auxiliary channels within the LIGO detectors that monitor degrees of freedom unaffected by astrophysical signals. Terrestrial noise sources may manifest characteristic disturbances in these auxiliary channels, inducing non-trivial correlations with glitches in the gravitational-wave data. The number of auxiliary-channel parameters describing these disturbances may also be extremely large; high dimensionality is an area where MLAs are particularly well-suited. We demonstrate the feasibility and applicability of three very different MLAs: Artificial Neural Networks, Support Vector Machines, and Random Forests. These classifiers identify and remove a substantial fraction of the glitches present in two very different data sets: four weeks of LIGO's fourth science run and one week of LIGO's sixth science run. We observe that all three algorithms agree on which events are glitches to within 10% for the sixth science run data, and support this by showing that the different optimization criteria used by each classifier generate the same decision surface, based on a likelihood-ratio statistic. Furthermore, we find that all classifiers obtain similar limiting performance, suggesting that most of the useful information currently contained in the auxiliary channel parameters we extract is already being used. Future performance gains are thus likely to involve additional sources of information, rather than improvements in the MLAs themselves.

gravitational-wave data↗

A homotopy algorithm for synthesizing robust controllers for flexible structures via the maximum entropy design equations

One well known deficiency of LQG compensators is that they do not guarantee any measure of robustness. This deficiency is especially highlighted when considering control design for complex systems such as flexible structures. There has thus been a need to generalize LQG theory to incorporate robustness constraints. Here we describe the maximum entropy approach to robust control design for flexible structures, a generalization of LQG theory, pioneered by Hyland, which has proved useful in practice. The design equations consist of a set of coupled Riccati and Lyapunov equations. A homotopy algorithm that is used to solve these design equations is presented.

Collins, Emmanuel G., Jr.↗

Enhancing a Simple MODIS Cloud Mask Algorithm for the Landsat Data Continuity Mission

The presence of clouds in images acquired by the Landsat series of satellites is usually an undesirable, but generally unavoidable fact. With the emphasis of the program being on land imaging, the suspended liquid/ice particles of which clouds are made of fully or partially obscure the desired observational target. Knowing the amount and location of clouds in a Landsat scene is therefore valuable information for scene selection, for making clear-sky composites from multiple scenes, and for scheduling future acquisitions. The two instruments in the upcoming Landsat Data Continuity Mission (LDCM) will include new channels that will enhance our ability to detect high clouds which are often also thin in the sense that a large fraction of solar radiation can pass through them. This work studies the potential impact of these new channels on enhancing LDCM's cloud detection capabilities compared to previous Landsat missions. We revisit a previously published scheme for cloud detection and add new tests to capture more of the thin clouds that are harder to detect with the more limited arsenal channels. Since there are no Landsat data yet that include the new LDCM channels, we resort to data from another instrument, MODIS, which has these bands, as well as the other bands of LDCM, to test the capabilities of our new algorithm. By comparing our revised scheme's performance against the performance of the official MODIS cloud detection scheme, we conclude that the new scheme performs better than the earlier scheme which was not very good at thin cloud detection.

Wilson, Michael J.↗

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗

Flux-split algorithms for flows with non-equilibrium chemistry and vibrational relaxation

The present consideration of numerical computation methods for gas flows with nonequilibrium chemistry thermodynamics gives attention to an equilibrium model, a general nonequilibrium model, and a simplified model based on vibrational relaxation. Flux-splitting procedures are developed for the fully-coupled inviscid equations encompassing fluid dynamics and both chemical and internal energy-relaxation processes. A fully coupled and implicit large-block structure is presented which embodies novel forms of flux-vector split and flux-difference split algorithms valid for nonequilibrium flow; illustrative high-temperature shock tube and nozzle flow examples are given.

Grossman, B.↗

Precipitation and Latent Heating Distributions from Satellite Passive Microwave Radiometry: Evaluation of Estimates Using Independent Data - Part 2

Rainfall rate estimates from space-borne k&ents are generally accepted as reliable by a majority of the atmospheric science commu&y. One-of the Tropical Rainfall Measuring Mission (TRh4M) facility rain rate algorithms is based upon passive microwave observations fiom the TRMM Microwave Imager (TMI). Part I of this study describes improvements in the TMI algorithm that are required to introduce cloud latent heating and drying as additional algorithm products. Here, estimates of surface rain rate, convective proportion, and latent heating are evaluated using independent ground-based estimates and satellite products. Instantaneous, OP5resolution estimates of surface rain rate over ocean fiom the improved TMI algorithm are well correlated with independent radar estimates (r approx. 0.88 over the Tropics), but bias reduction is the most significant improvement over forerunning algorithms. The bias reduction is attributed to the greater breadth of cloud-resolving model simulations that support the improved algorithm, and the more consistent and specific convective/stratiform rain separation method utilized. The bias of monthly, 2.5 deg. -resolution estimates is similarly reduced, with comparable correlations to radar estimates. Although the amount of independent latent heating data are limited, TMI estimated latent heating profiles compare favorably with instantaneous estimates based upon dual-Doppler radar observations, and time series of surface rain rate and heating profiles are generally consistent with those derived from rawinsonde analyses. Still, some biases in profile shape are evident, and these may be resolved with: (a) additional contextual information brought to the estimation problem, and/or; (b) physically-consistent and representative databases supporting the algorithm. A model of the random error in instantaneous, 0.5 deg-resolution rain rate estimates appears to be consistent with the levels of error determined from TMI comparisons to collocated radar. Error model modifications for non-raining situations will be required, however. Sampling error appears to represent only a fraction of the total error in monthly, 2S0-resolution TMI estimates; the remaining error is attributed to physical inconsistency or non-representativeness of cloud-resolving model simulated profiles supporting the algorithm.

Yang, Song↗

Immunity-Based Aircraft Fault Detection System

In the study reported in this paper, we have developed and applied an Artificial Immune System (AIS) algorithm for aircraft fault detection, as an extension to a previous work on intelligent flight control (IFC). Though the prior studies had established the benefits of IFC, one area of weakness that needed to be strengthened was the control dead band induced by commanding a failed surface. Since the IFC approach uses fault accommodation with no detection, the dead band, although it reduces over time due to learning, is present and causes degradation in handling qualities. If the failure can be identified, this dead band can be further A ed to ensure rapid fault accommodation and better handling qualities. The paper describes the application of an immunity-based approach that can detect a broad spectrum of known and unforeseen failures. The approach incorporates the knowledge of the normal operational behavior of the aircraft from sensory data, and probabilistically generates a set of pattern detectors that can detect any abnormalities (including faults) in the behavior pattern indicating unsafe in-flight operation. We developed a tool called MILD (Multi-level Immune Learning Detection) based on a real-valued negative selection algorithm that can generate a small number of specialized detectors (as signatures of known failure conditions) and a larger set of generalized detectors for unknown (or possible) fault conditions. Once the fault is detected and identified, an adaptive control system would use this detection information to stabilize the aircraft by utilizing available resources (control surfaces). We experimented with data sets collected under normal and various simulated failure conditions using a piloted motion-base simulation facility. The reported results are from a collection of test cases that reflect the performance of the proposed immunity-based fault detection algorithm.

Dasgupta, D.↗

Automatic voice recognition using traditional and artificial neural network approaches

The main objective of this research is to develop an algorithm for isolated-word recognition. This research is focused on digital signal analysis rather than linguistic analysis of speech. Features extraction is carried out by applying a Linear Predictive Coding (LPC) algorithm with order of 10. Continuous-word and speaker independent recognition will be considered in future study after accomplishing this isolated word research. To examine the similarity between the reference and the training sets, two approaches are explored. The first is implementing traditional pattern recognition techniques where a dynamic time warping algorithm is applied to align the two sets and calculate the probability of matching by measuring the Euclidean distance between the two sets. The second is implementing a backpropagation artificial neural net model with three layers as the pattern classifier. The adaptation rule implemented in this network is the generalized least mean square (LMS) rule. The first approach has been accomplished. A vocabulary of 50 words was selected and tested. The accuracy of the algorithm was found to be around 85 percent. The second approach is in progress at the present time.

Botros, Nazeih M.↗

Design of infrasound-detection system via adaptive LMSTDE algorithm

A proposed solution to an aviation safety problem is based on passive detection of turbulent weather phenomena through their infrasonic emission. This thesis describes a system design that is adequate for detection and bearing evaluation of infrasounds. An array of four sensors, with the appropriate hardware, is used for the detection part. Bearing evaluation is based on estimates of time delays between sensor outputs. The generalized cross correlation (GCC), as the conventional time-delay estimation (TDE) method, is first reviewed. An adaptive TDE approach, using the least mean square (LMS) algorithm, is then discussed. A comparison between the two techniques is made and the advantages of the adaptive approach are listed. The behavior of the GCC, as a Roth processor, is examined for the anticipated signals. It is shown that the Roth processor has the desired effect of sharpening the peak of the correlation function. It is also shown that the LMSTDE technique is an equivalent implementation of the Roth processor in the time domain. A LMSTDE lead-lag model, with a variable stability coefficient and a convergence criterion, is designed.

Khalaf, C. S.↗

Efficient Web Services Policy Combination

Large-scale Web security systems usually involve cooperation between domains with non-identical policies. The network management and Web communication software used by the different organizations presents a stumbling block. Many of the tools used by the various divisions do not have the ability to communicate network management data with each other. At best, this means that manual human intervention into the communication protocols used at various network routers and endpoints is required. Developing practical, sound, and automated ways to compose policies to bridge these differences is a long-standing problem. One of the key subtleties is the need to deal with inconsistencies and defaults where one organization proposes a rule on a particular feature, and another has a different rule or expresses no rule. A general approach is to assign priorities to rules and observe the rules with the highest priorities when there are conflicts. The present methods have inherent inefficiency, which heavily restrict their practical applications. A new, efficient algorithm combines policies utilized for Web services. The method is based on an algorithm that allows an automatic and scalable composition of security policies between multiple organizations. It is based on defeasible policy composition, a promising approach for finding conflicts and resolving priorities between rules. In the general case, policy negotiation is an intractable problem. A promising method, suggested in the literature, is when policies are represented in defeasible logic, and composition is based on rules for non-monotonic inference. In this system, policy writers construct metapolicies describing both the policy that they wish to enforce and annotations describing their composition preferences. These annotations can indicate whether certain policy assertions are required by the policy writer or, if not, under what circumstances the policy writer is willing to compromise and allow other assertions to take precedence. Meta-policies are specified in defeasible logic, a computationally efficient non-monotonic logic developed to model human reasoning. One drawback of this method is that at one point the algorithm starts an exhaustive search of all subsets of the set of conclusions of a defeasible theory. Although the propositional defeasible logic has linear complexity, the set of conclusions here may be large, especially in real-life practical cases. This phenomenon leads to an inefficient exponential explosion of complexity. The current process of getting a Web security policy from combination of two meta-policies consists of two steps. The first is generating a new meta-policy that is a composition of the input meta-policies, and the second is mapping the meta-policy onto a security policy. The new algorithm avoids the exhaustive search in the current algorithm, and provides a security policy that matches all requirements of the involved metapolicies.

Vatan, Farrokh↗

Numerical solution of the incompressible Navier-Stokes equations

The current work is initiated in an effort to obtain an efficient, accurate, and robust algorithm for the numerical solution of the incompressible Navier-Stokes equations in two- and three-dimensional generalized curvilinear coordinates for both steady-state and time-dependent flow problems. This is accomplished with the use of the method of artificial compressibility and a high-order flux-difference splitting technique for the differencing of the convective terms. Time accuracy is obtained in the numerical solutions by subiterating the equations in psuedo-time for each physical time step. The system of equations is solved with a line-relaxation scheme which allows the use of very large pseudo-time steps leading to fast convergence for steady-state problems as well as for the subiterations of time-dependent problems. Numerous laminar test flow problems are computed and presented with a comparison against analytically known solutions or experimental results. These include the flow in a driven cavity, the flow over a backward-facing step, the steady and unsteady flow over a circular cylinder, flow over an oscillating plate, flow through a one-dimensional inviscid channel with oscillating back pressure, the steady-state flow through a square duct with a 90 degree bend, and the flow through an artificial heart configuration with moving boundaries. An adequate comparison with the analytical or experimental results is obtained in all cases. Numerical comparisons of the upwind differencing with central differencing plus artificial dissipation indicates that the upwind differencing provides a much more robust algorithm, which requires significantly less computing time. The time-dependent problems require on the order of 10 to 20 subiterations, indicating that the elliptical nature of the problem does require a substantial amount of computing effort.

Rogers, Stuart E.↗