SEARCH · Search NASA

Results for “Recursion”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 649 records · Page 36

All sources NASA NTRS DOE OSTI

NASA NTRS1992

A data fusion algorithm for multi-sensor microburst hazard assessment

A recursive model-based data fusion algorithm for multi-sensor microburst hazard assessment is described. An analytical microburst model is used to approximate the actual windfield, and a set of 'best' model parameters are estimated from measured winds. The winds corresponding to the best parameter set can then be used to compute alerting factors such as microburst position, extent, and intensity. The estimation algorithm is based on an iterated extended Kalman filter which uses the microburst model parameters as state variables. Microburst state dynamic and process noise parameters are chosen based on measured microburst statistics. The estimation method is applied to data from a time-varying computational simulation of a historical microburst event to demonstrate its capabilities and limitations. Selection of filter parameters and initial conditions is discussed. Computational requirements and datalink bandwidth considerations are also addressed.

Wanke, Craig R.↗

NASA NTRS1992

Backward assembly planning with DFA analysis

An assembly planning system that operates based on a recursive decomposition of assembly into subassemblies is presented. The planning system analyzes assembly cost in terms of stability, directionality, and manipulability to guide the generation of preferred assembly plans. The planning in this system incorporates the special processes, such as cleaning, testing, labeling, etc., that must occur during the assembly. Additionally, the planning handles nonreversible, as well as reversible, assembly tasks through backward assembly planning. In order to decrease the planning efficiency, the system avoids the analysis of decompositions that do not correspond to feasible assembly tasks. This is achieved by grouping and merging those parts that can not be decomposable at the current stage of backward assembly planning due to the requirement of special processes and the constraint of interconnection feasibility. The invention includes methods of evaluating assembly cost in terms of the number of fixtures (or holding devices) and reorientations required for assembly, through the analysis of stability, directionality, and manipulability. All these factors are used in defining cost and heuristic functions for an AO* search for an optimal plan.

Lee, Sukhan↗

NASA NTRS1992

Formal verification of an oral messages algorithm for interactive consistency

The formal specification and verification of an algorithm for Interactive Consistency based on the Oral Messages algorithm for Byzantine Agreement is described. We compare our treatment with that of Bevier and Young, who presented a formal specification and verification for a very similar algorithm. Unlike Bevier and Young, who observed that 'the invariant maintained in the recursive subcases of the algorithm is significantly more complicated than is suggested by the published proof' and who found its formal verification 'a fairly difficult exercise in mechanical theorem proving,' our treatment is very close to the previously published analysis of the algorithm, and our formal specification and verification are straightforward. This example illustrates how delicate choices in the formulation of the problem can have significant impact on the readability of its formal specification and on the tractability of its formal verification.

Rushby, John↗

NASA NTRS1992

Approximation methods for stochastic petri nets

Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay equivalence often fails to converge, while flow equivalent aggregation can lead to potentially bad results if a strong dependence of the mean completion time on the interarrival process exists.

Jungnitz, Hauke Joerg↗

NASA NTRS1992

Possibility expectation and its decision making algorithm

The fuzzy integral has been shown to be an effective tool for the aggregation of evidence in decision making. Of primary importance in the development of a fuzzy integral pattern recognition algorithm is the choice (construction) of the measure which embodies the importance of subsets of sources of evidence. Sugeno fuzzy measures have received the most attention due to the recursive nature of the fabrication of the measure on nested sequences of subsets. Possibility measures exhibit an even simpler generation capability, but usually require that one of the sources of information possess complete credibility. In real applications, such normalization may not be possible, or even desirable. In this report, both the theory and a decision making algorithm for a variation of the fuzzy integral are presented. This integral is based on a possibility measure where it is not required that the measure of the universe be unity. A training algorithm for the possibility densities in a pattern recognition application is also presented with the results demonstrated on the shuttle-earth-space training and testing images.

Keller, James M.↗

NASA NTRS1992

Study and simulation of low rate video coding schemes

The semiannual report is included. Topics covered include communication, information science, data compression, remote sensing, color mapped images, robust coding scheme for packet video, recursively indexed differential pulse code modulation, image compression technique for use on token ring networks, and joint source/channel coder design.

Sayood, Khalid↗

NASA NTRS1993

Fault detection and isolation

Erroneous measurements in multisensor navigation systems must be detected and isolated. A recursive estimator can find fast growing errors; a least squares batch estimator can find slow growing errors. This process is called fault detection. A protection radius can be calculated as a function of time for a given location. This protection radius can be used to guarantee the integrity of the navigation data. Fault isolation can be accomplished using either a snapshot method or by examining the history of the fault detection statistics.

Bernath, Greg↗

NASA NTRS1993

Axisymmetric deformations and stresses of unsymmetrically laminated composite cylinders in axial compression with thermally-induced preloading effects

This report documents an analytical study of the response of unsymmetrically laminated cylinders subjected to thermally-induced preloading effects and compressive axial load. Closed-form solutions are obtained for the displacements and intralaminar stresses and recursive relations for the interlaminar shear stress were obtained using the closed-form intralaminar stress solutions. For the cylinder geometries and stacking sequence examples analyzed, several important and as yet undocumented effects of including thermally-induced preloading in the analysis are observed. It should be noted that this work is easily extended to include uniform internal and/or external pressure loadings and the application of strain and stress failure theories.

Paraska, Peter J.↗

NASA NTRS1992

A proposed study of multiple scattering through clouds up to 1 THz

A rigorous computation of the electromagnetic field scattered from an atmospheric liquid water cloud is proposed. The recent development of a fast recursive algorithm (Chew algorithm) for computing the fields scattered from numerous scatterers now makes a rigorous computation feasible. A method is presented for adapting this algorithm to a general case where there are an extremely large number of scatterers. It is also proposed to extend a new binary PAM channel coding technique (El-Khamy coding) to multiple levels with non-square pulse shapes. The Chew algorithm can be used to compute the transfer function of a cloud channel. Then the transfer function can be used to design an optimum El-Khamy code. In principle, these concepts can be applied directly to the realistic case of a time-varying cloud (adaptive channel coding and adaptive equalization). A brief review is included of some preliminary work on cloud dispersive effects on digital communication signals and on cloud liquid water spectra and correlations.

Gerace, G. C.↗

NASA NTRS1993

Undecidability in macroeconomics

In this paper we study the difficulty of solving problems in economics. For this purpose, we adopt the notion of undecidability from recursion theory. We show that certain problems in economics are undecidable, i.e., cannot be solved by a Turing Machine, a device that is at least as powerful as any computational device that can be constructed. In particular, we prove that even in finite closed economies subject to a variable initial condition, in which a social planner knows the behavior of every agent in the economy, certain important social planning problems are undecidable. Thus, it may be impossible to make effective policy decisions. Philosophically, this result formally brings into question the Rational Expectations Hypothesis which assumes that each agent is able to determine what it should do if it wishes to maximize its utility. We show that even when an optimal rational forecast exists for each agency (based on the information currently available to it), agents may lack the ability to make these forecasts. For example, Lucas describes economic models as 'mechanical, artificial world(s), populated by ... interacting robots'. Since any mechanical robot can be at most as computationally powerful as a Turing Machine, such economies are vulnerable to the phenomenon of undecidability.

Chandra, Siddharth↗

NASA NTRS1992

Global synchronization algorithms for the Intel iPSC/860

In a distributed memory multicomputer that has no global clock, global processor synchronization can only be achieved through software. Global synchronization algorithms are used in tridiagonal systems solvers, CFD codes, sequence comparison algorithms, and sorting algorithms. They are also useful for event simulation, debugging, and for solving mutual exclusion problems. For the Intel iPSC/860 in particular, global synchronization can be used to ensure the most effective use of the communication network for operations such as the shift, where each processor in a one-dimensional array or ring concurrently sends a message to its right (or left) neighbor. Three global synchronization algorithms are considered for the iPSC/860: the gysnc() primitive provided by Intel, the PICL primitive sync0(), and a new recursive doubling synchronization (RDS) algorithm. The performance of these algorithms is compared to the performance predicted by communication models of both the long and forced message protocols. Measurements of the cost of shift operations preceded by global synchronization show that the RDS algorithm always synchronizes the nodes more precisely and costs only slightly more than the other two algorithms.

Seidel, Steven R.↗

NASA NTRS1992

Self-tuning multivariable pole placement control of a multizone crystal growth furnace

This paper presents the design and implementation of a multivariable self-tuning temperature controller for the control of lead bromide crystal growth. The crystal grows inside a multizone transparent furnace. There are eight interacting heating zones shaping the axial temperature distribution inside the furnace. A multi-input, multi-output furnace model is identified on-line by a recursive least squares estimation algorithm. A multivariable pole placement controller based on this model is derived and implemented. Comparison between single-input, single-output and multi-input, multi-output self-tuning controllers demonstrates that the zone-to-zone interactions can be minimized better by a multi-input, multi-output controller design. This directly affects the quality of crystal grown.

Batur, C.↗

NASA NTRS1991

Adaptive control of Space Station during nominal operations with CMGs

An adaptive control approach is investigated for the Space Station. The main components of the adaptive controller are the parameter identification scheme, the control gain calculation, and the control law. The control law is the Space Station baseline control law. The control gain calculation is based on linear quadratic regulator theory with eigenvalue placement in a vertical strip. The parameter identification scheme is a real-time recursive extended Kalman filter which estimates the inertias and also provides an estimate of the unmodeled disturbances due to the aerodynamic torques and to the nonlinear effects. An analysis of the inertia estimation problem suggests that it is possible to compute accurate estimates of the Space Station inertias during nominal CMG (control moment gyro) operations. The closed-loop adaptive control law is shown to be capable of stabilizing the Space Station after large inertia changes. Results are presented for the pitch axis.

Bishop, R. H.↗

NASA NTRS1992

Adaptive control of Space Station with control moment gyros

An adaptive approach to Space Station attitude control is investigated. The main components of the controller are the parameter identification scheme, the control gain calculation, and the control law. The control law is a full-state feedback space station baseline control law. The control gain calculation is based on linear-quadratic regulator theory with eigenvalues placement in a vertical strip. The parameter identification scheme is a recursive extended Kalman filter that estimates the inertias and also provides an estimate of the unmodeled disturbances due to the aerodynamic torques and to the nonlinear effects. An analysis of the inertia estimation problem suggests that it is possible to estimate Space Station inertias accurately during nominal control moment gyro operations. The closed-loop adaptive control law is shown to be capable of stabilizing the Space Station after large inertia changes. Results are presented for the pitch axis.

Bishop, Robert H.↗

NASA NTRS1992

Classification with spatio-temporal interpixel class dependency contexts

A contextual classifier which can utilize both spatial and temporal interpixel dependency contexts is investigated. After spatial and temporal neighbors are defined, a general form of maximum a posterior spatiotemporal contextual classifier is derived. This contextual classifier is simplified under several assumptions. Joint prior probabilities of the classes of each pixel and its spatial neighbors are modeled by the Gibbs random field. The classification is performed in a recursive manner to allow a computationally efficient contextual classification. Experimental results with bitemporal TM data show significant improvement of classification accuracy over noncontextual pixelwise classifiers. This spatiotemporal contextual classifier should find use in many applications of remote sensing, especially when the classification accuracy is important.

Jeon, Byeungwoo↗

NASA NTRS1992

Vision-based range estimation using helicopter flight data

Pilot aiding during low-altitude flight depends on the ability to detect and locate obstacles near the helicopter's intended flightpath. Computer-vision-based methods provide one general approach for obstacle detection and range estimation. Several algorithms have been developed for this purpose, but have not been tested with actual flight data. This paper presents results obtained using helicopter flight data with a feature-based range estimation algorithm. A method for recursively estimating range using a Kalman filter with a monocular sequence of images and knowledge of the camera's motion is described. The helicopter flight experiment and one of four resulting datasets is briefly discussed. Finally the performance of the range estimation algorithm is explored based on comparison of the range estimates with true range measurements collected during the flight experiment.

Smith, Phillip N.↗

NASA NTRS1993

A parallelizable load balancing algorithm

We present a parallelizable load balancing algorithm for grid-based problems that employs a give and take concept among neighboring subdomains. The algorithm is found to converge very quickly to almost perfect load balance while minimizing the surface-to-volume ratio of the domains. The algorithm can be used for problems whose volume cost grows nonlinearly with the number of elements, because it measures continuously the computational cost to be incurred for each subdomain. This is an advantage over most algorithms currently in use (e.g., recursive subdivision), which assume a linear relationship between the computational cost and the number of elements.

Loehner, Rainald↗

NASA NTRS1992

Vision-based range estimation using helicopter flight data

Pilot aiding during low-altitude flight depends on the ability to detect and locate obstacles near the helicopter's intended flightpath. Computer-vision-based methods provide one general approach for obstacle detection and range estimation. Several algorithms have been developed for this purpose, but have not been tested with actual flight data. This paper presents results obtained using helicopter flight data with a feature-based range estimation algorithm. A method for recursively estimating range using a Kalman filter with a monocular sequence of images and knowledge of the camera's motion is described. The helicopter flight experiment and four resulting datasets are discussed. Finally the performance of the range estimation algorithm is explored in detail based on comparison of the range estimates with true range measurements collected during the flight experiment.

Smith, Phillip N.↗