Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

Assessment of radar resolution requirements for soil moisture estimation from simulated satellite imagery

Radar simulations were performed at five-day intervals over a twenty-day period and used to estimate soil moisture from a generalized algorithm requiring only received power and the mean elevation of a test site near Lawrence, Kansas. The results demonstrate that the soil moisture of about 90% of the 20-m by 20-m pixel elements can be predicted with an accuracy of + or - 20% of field capacity within relatively flat agricultural portions of the test site. Radar resolutions of 93 m by 100 m with 23 looks or coarser gave the best results, largely because of the effects of signal fading. For the distribution of land cover categories, soils, and elevation in the test site, very coarse radar resolutions of 1 km by 1 km and 2.6 km by 3.1 km gave the best results for wet moisture conditions while a finer resolution of 93 m by 100 m was found to yield superior results for dry to moist soil conditions.

Ulaby, F. T.↗
NASA NTRS1983

Development of a Multilevel Optimization Approach to the Design of Modern Engineering Systems

A general algorithm is proposed which carries out the design process iteratively, starting at the top of the hierarchy and proceeding downward. Each subproblem is optimized separately for fixed controls from higher level subproblems. An optimum sensitivity analysis is then performed which determines the sensitivity of the subproblem design to changes in higher level subproblem controls. The resulting sensitivity derivatives are used to construct constraints which force the controlling subproblems into chosing their own designs so as to improve the lower levels subproblem designs while satisfying their own constraints. The applicability of the proposed algorithm is demonstrated by devising a four-level hierarchy to perform the simultaneous aerodynamic and structural design of a high-performance sailplane wing for maximum cross-country speed. Finally, the concepts discussed are applied to the two-level minimum weight structural design of the sailplane wing. The numerical experiments show that discontinuities in the sensitivity derivatives may delay convergence, but that the algorithm is robust enough to overcome these discontinuities and produce low-weight feasible designs, regardless of whether the optimization is started from the feasible space or the infeasible one.

Barthelemy, J. F. M.↗
NASA NTRS1982

Free vibration analysis of coupled fluid-structure systems

An efficient numerical technique for the eigenvalue solution in the free vibration analysis of compressible fluid-structure coupled systems is presented. The fluid is assumed to be compressible in nature and the incompressible problem is only a special case of the present generalized algorithm. A natural frequency analysis of the structure in the absence of any fluid is achieved by a combined Sturm sequence and inverse iteration technique that computes only the required eigenvalues and vectors. A special inverse iteration scheme is then developed for the coupled system that uses the computed eigenvalues as starting iteration values for convergence. Numerical results obtained by solving a number of standard test cases indicate the pattern of root convergence corresponding to various simplifying assumptions.

Gupta, K. K.↗
NASA NTRS1987

Diagnosis and sensor validation through knowledge of structure and function

The liquid oxygen expert system 'LES' is proposed as the first capable of diagnostic reasoning from sensor data, using model-based knowledge of structure and function to find the expected state of all system objects, including sensors. The approach is generally algorithmic rather than heuristic, and represents uncertainties as sets of possibilities. Functional relationships are inverted to determine hypothetical values for potentially faulty objects, and may include conditional functions not normally considered to have inverses.

Scarl, Ethan A.↗
NASA NTRS1988

The Use of Efficient Broadcast Protocols in Asynchronous Distributed Systems

Reliable broadcast protocols are important tools in distributed and fault-tolerant programming. They are useful for sharing information and for maintaining replicated data in a distributed system. However, a wide range of such protocols has been proposed. These protocols differ in their fault tolerance and delivery ordering characteristics. There is a tradeoff between the cost of a broadcast protocol and how much ordering it provides. It is, therefore, desirable to employ protocols that support only a low degree of ordering whenever possible. This dissertation presents techniques for deciding how strongly ordered a protocol is necessary to solve a given application problem. It is shown that there are two distinct classes of application problems: problems that can be solved with efficient, asynchronous protocols, and problems that require global ordering. The concept of a linearization function that maps partially ordered sets of events to totally ordered histories is introduced. How to construct an asynchronous implementation that solves a given problem if a linearization function for it can be found is shown. It is proved that in general the question of whether a problem has an asynchronous solution is undecidable. Hence there exists no general algorithm that would automatically construct a suitable linearization function for a given problem. Therefore, an important subclass of problems that have certain commutativity properties are considered. Techniques for constructing asynchronous implementations for this class are presented. These techniques are useful for constructing efficient asynchronous implementations for a broad range of practical problems.

Schmuck, Frank Bernhard↗
NASA NTRS1989

Doppler centroid estimation ambiguity for synthetic aperture radars

A technique for estimation of the Doppler centroid of an SAR in the presence of large uncertainty in antenna boresight pointing is described. Also investigated is the image degradation resulting from data processing that uses an ambiguous centroid. Two approaches for resolving ambiguities in Doppler centroid estimation (DCE) are presented: the range cross-correlation technique and the multiple-PRF (pulse repetition frequency) technique. Because other design factors control the PRF selection for SAR, a generalized algorithm is derived for PRFs not containing a common divisor. An example using the SIR-C parameters illustrates that this algorithm is capable of resolving the C-band DCE ambiguities for antenna pointing uncertainties of about 2-3 deg.

Chang, C. Y.↗
NASA NTRS1992

Mechanically verified hardware implementing an 8-bit parallel IO Byzantine agreement processor

Consider a network of four processors that use the Oral Messages (Byzantine Generals) Algorithm of Pease, Shostak, and Lamport to achieve agreement in the presence of faults. Bevier and Young have published a functional description of a single processor that, when interconnected appropriately with three identical others, implements this network under the assumption that the four processors step in synchrony. By formalizing the original Pease, et al work, Bevier and Young mechanically proved that such a network achieves fault tolerance. We develop, formalize, and discuss a hardware design that has been mechanically proven to implement their processor. In particular, we formally define mapping functions from the abstract state space of the Bevier-Young processor to a concrete state space of a hardware module and state a theorem that expresses the claim that the hardware correctly implements the processor. We briefly discuss the Brock-Hunt Formal Hardware Description Language which permits designs both to be proved correct with the Boyer-Moore theorem prover and to be expressed in a commercially supported hardware description language for additional electrical analysis and layout. We briefly describe our implementation.

Moore, J. Strother↗
NASA NTRS1991

Explanation-based generalization of partially ordered plans

Most previous work in analytic generalization of plans dealt with totally ordered plans. These methods cannot be directly applied to generalizing partially ordered plans, since they do not capture all interactions among plan operators for all total orders of such plans. We introduce a new method for generalizing partially ordered plans. This method is based on providing explanation-based generalization (EBG) with explanations which systematically capture the interactions among plan operators for all the total orders of a partially-ordered plan. The explanations are based on the Modal Truth Criterion which states the necessary and sufficient conditions for ensuring the truth of a proposition at any point in a plan, for a class of partially ordered plans. The generalizations obtained by this method guarantee successful and interaction-free execution of any total order of the generalized plan. In addition, the systematic derivation of the generalization algorithms from the Modal Truth Criterion obviates the need for carrying out a separate formal proof of correctness of the EBG algorithms.

Kambhampati, Subbarao↗
NASA NTRS1993

Time-variant analysis of rotorcraft systems dynamics - An exploitation of vector processors

In this paper a generalized algorithmic procedure is presented for handling constraints in mechanical transmissions. The latter are treated as multibody systems of interconnected rigid/flexible bodies. The constraint Jacobian matrices are generated automatically and suitably updated in time, depending on the geometrical and kinematical constraint conditions describing the interconnection between shafts or gears. The type of constraints are classified based on the interconnection of the bodies by assuming that one or more points of contact exist between them. The effects due to elastic deformation of the flexible bodies are included by allowing each body element to undergo small deformations. The procedure is based on recursively formulated Kane's dynamical equations of motion and the finite element method, including the concept of geometrical stiffening effects. The method is implemented on an IBM-3090-600j vector processor with pipe-lining capabilities. A significant increase in the speed of execution is achieved by vectorizing the developed code in computationally intensive areas. An example consisting of two meshing disks rotating at high angular velocity is presented. Applications are intended for the study of the dynamic behavior of helicopter transmissions.

Amirouche, F. M. L.↗
NASA NTRS1993

Review and analysis of dense linear system solver package for distributed memory machines

A dense linear system solver package recently developed at the University of Texas at Austin for distributed memory machine (e.g. Intel Paragon) has been reviewed and analyzed. The package contains about 45 software routines, some written in FORTRAN, and some in C-language, and forms the basis for parallel/distributed solutions of systems of linear equations encountered in many problems of scientific and engineering nature. The package, being studied by the Computer Applications Branch of the Analysis and Computation Division, may provide a significant computational resource for NASA scientists and engineers in parallel/distributed computing. Since the package is new and not well tested or documented, many of its underlying concepts and implementations were unclear; our task was to review, analyze, and critique the package as a step in the process that will enable scientists and engineers to apply it to the solution of their problems. All routines in the package were reviewed and analyzed. Underlying theory or concepts which exist in the form of published papers or technical reports, or memos, were either obtained from the author, or from the scientific literature; and general algorithms, explanations, examples, and critiques have been provided to explain the workings of these programs. Wherever the things were still unclear, communications were made with the developer (author), either by telephone or by electronic mail, to understand the workings of the routines. Whenever possible, tests were made to verify the concepts and logic employed in their implementations. A detailed report is being separately documented to explain the workings of these routines.

Narang, H. N.↗
NASA NTRS1996

The Acoustic Influence of Cell Depth on the Rotordynamic Characteristics of Smooth-Rotor/Honeycomb-Stator Annular Gas Seals

A two-control volume is employed for honeycomb-stator/smooth-rotor seals, with a conventional control-volume used for the through flow and a 'capacitance accumulator' model for the honeycomb cells. The control volume for the honeycomb cells is shown to cause a dramatic reduction in the effective acoustic velocity of the main flow, dropping the lowest acoustic frequency into the frequency range of interest for rotordynamics. In these circumstances, the impedance functions for the seals can not be modeled with conventional (frequency-independent) stiffness, damping, and mass coefficients. More general transfer functions are required to account for the reaction forces, and calculated here as a lead-lag term for the direct force function and a lag term for the cross-coupled function. These first order functions are simple compared to transfer functions for magnetic bearings or foundations, For synchronous response to imbalance, they can be approximated by running-speed-dependent stiffness and damping coefficients in conventional rotordynamic codes. Correct predictions for stability and transient response will require more general algorithms, pressumably using a state-space format.

Childs, Dara W.↗
NASA NTRS1996

CFD Analysis of the 24-inch JIRAD Hybrid Rocket Motor

A series of multispecies, multiphase computational fluid dynamics (CFD) analyses of the 24-inch diameter joint government industry industrial research and development (JIRAD) hybrid rocket motor is described. The 24-inch JIRAD hybrid motor operates by injection of liquid oxygen (LOX) into a vaporization plenum chamber upstream of ports in the hydroxyl-terminated polybutadiene (HTPB) solid fuel. The injector spray pattern had a strong influence on combustion stability of the JIRAD motor so a CFD study was initiated to define the injector end flow field under different oxidizer spray patterns and operating conditions. By using CFD to gain a clear picture of the flow field and temperature distribution within the JIRAD motor, it is hoped that the fundamental mechanisms of hybrid combustion instability may be identified and then suppressed by simple alterations to the oxidizer injection parameters such as injection angle and velocity. The simulations in this study were carried out using the General Algorithm for Analysis of Combustion SYstems (GALACSY) multiphase combustion codes. GALACSY consists of a comprehensive set of droplet dynamic submodels (atomization, evaporation, etc.) and a computationally efficient hydrocarbon chemistry package built around a robust Navier-Stokes solver optimized for low Mach number flows. Lagrangian tracking of dispersed particles describes a closely coupled spray phase. The CFD cases described in this paper represent various levels of simplification of the problem. They include: (A) gaseous oxygen with combusting fuel vapor blowing off the walls at various oxidizer injection angles and velocities, (B) gaseous oxygen with combusting fuel vapor blowing off the walls, and (C) liquid oxygen with combusting fuel vapor blowing off the walls. The study used an axisymmetric model and the results indicate that the injector design significantly effects the flow field in the injector end of the motor. Markedly different recirculation patterns are observed in the vaporization chamber as the oxygen velocity and/or spray pattern is varied. The ability of these recirculation patterns to stabilize the diffusion flame above the surface of the solid fuel gives a plausible explanation for the experimentally determined combustion stability characteristics of the JIRAD motor, and suggests how combustion stability can be assured by modifications to the injector design.

Liang, Pak-Yan↗
NASA NTRS1997

A Comparison of Soil Moisture Retrieval Models Using SIR-C Measurements over the Little Washita River Watershed

Six SIR-C L-band measurements over the Little Washita River watershed in Chickasha, Oklahoma during 11-17 April 1994 have been analyzed for studying the change of soil moisture in the region. Two algorithms developed recently for estimation of moisture content in bare soil were applied to these measurements and the results were compared with those sampled on the ground. There is a good agreement between the values of soil moisture estimated by either one of the algorithms and those measured from ground sampling for bare or sparsely vegetated fields. The standard error from this comparison is on the order of 0.05-0.06 cu cm/cu cm, which is comparable to that expected from a regression between backscattering coefficients and measured soil moisture. Both algorithms provide a poor estimation of soil moisture or fail to give solutions to areas covered with moderate or dense vegetation. Even for bare soils the number of pixels that bear no numerical solution from the application of either one of the two algorithms to the data is not negligible. Results from using one of these algorithms indicate that the fraction of these pixels becomes larger as the bare soils become drier. The other algorithm generally gives a larger fraction of these pixels when the fields are vegetation-covered. The implication and impact of these features are discussed in this article.

Wang, J. R.↗
NASA NTRS2003

Evaluation of Genetic Algorithm Concepts Using Model Problems: Multi-Objective Optimization - Part 2

A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of simple model problems. Several new features including a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. Results indicate that the genetic algorithm optimization approach is flexible in application and extremely reliable, providing optimal results for all optimization problems attempted. The binning algorithm generally provides pareto front quality enhancements and moderate convergence efficiency improvements for most of the model problems. The gene-space transformation procedure provides a large convergence efficiency enhancement for problems with non-convoluted pareto fronts and a degradation in efficiency for problems with convoluted pareto fronts. The most difficult problems --multi-mode search spaces with a large number of genes and convoluted pareto fronts-- require a large number of function evaluations for GA convergence, but always converge.

Holst, Terry L.↗
NASA NTRS2004

Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

Holst, Terry L.↗
NASA NTRS2005

Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

A genetic algorithm approach suitable for solving multi-objective problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding Pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the Pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide Pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

Holst, Terry L.↗
NASA NTRS2004

HiRes: super-resolution for the Spitzer Space Telescope

We present a description of hires, a super-resolution program based upon the Richardson-Lucy algorithm, generalized to the case of redundant coverage, with higher order optical image distortion, implemented for the Sptizer Space Telescope.

image restoration↗
NASA NTRS2010

Lidar Ratios for Dust Aerosols Derived From Retrievals of CALIPSO Visible Extinction Profiles Constrained by Optical Depths from MODIS-Aqua and CALIPSO/CloudSat Ocean Surface Reflectance Measurements

CALIPSO's (Cloud Aerosol Lidar Infrared Pathfinder Satellite Observations) analysis algorithms generally require the use of tabulated values of the lidar ratio in order to retrieve aerosol extinction and optical depth from measured profiles of attenuated backscatter. However, for any given time or location, the lidar ratio for a given aerosol type can differ from the tabulated value. To gain some insight as to the extent of the variability, we here calculate the lidar ratio for dust aerosols using aerosol optical depth constraints from two sources. Daytime measurements are constrained using Level 2, Collection 5, 550-nm aerosol optical depth measurements made over the ocean by the MODIS (Moderate Resolution Imaging Spectroradiometer) on board the Aqua satellite, which flies in formation with CALIPSO. We also retrieve lidar ratios from night-time profiles constrained by aerosol column optical depths obtained by analysis of CALIPSO and CloudSat backscatter signals from the ocean surface.

Young, Stuart A.↗