Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “error propagation”

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

The CARE 3 Phase 3 Report: Test and Evaluation

CARE 3 (Computer-Aided Reliability Estimation, version three) is a computer program designed to help estimate the reliability of complex, redundant systems; although the program can model a wide variety of redundant structures, it was developed specifically for fault-tolerant avionics systems, systems distinguished by the need for extremely reliable performance since a system failure could well result in the loss of human life. CARE 3 further generalizes the class of system structures that can be modeled and greatly expands the coverage model to take into account such effects as intermittent and transient faults, latent faults, error propagation, etc. The initial test and evaluation of CARE 3 are reported.

Stiffler, J. J.↗

CARE 3 phase 2 report - mathematical description

CARE III (Computer-Aided Reliability Estimation, version three) a computer program designed to help estimate the reliability of complex, redundant systems is described. Although the program can model a wide variety of redundant structures, it was developed specifically for fault tolerant avionics systems. CARE III generalizes the class of system structures that can be modeled and greatly expands the coverage model to take into account such effects as intermittent and transient faults, latent faults, and error propagation.

Stiffler, J. J.↗

OSTA-1 lessons learned and recommendations for future payloads

Five remote sensing experiments, together with one air pollution and one bioengineering experiment, were incorporated into the first Space Shuttle scientific payload of the NASA Office of Space and Terrestrial Applications (OSTA-1). The instrument package, experimental procedures, and specialized personnel teams all performed satisfactorily. Attention is presently given to the lessons learned during the OSTA-1-incorporating mission, STS-2 of November 12, 1981. Payload test and integration teams should never take unfamiliar facilities for granted. Training, especially if it employs hands-on experience with full-scale mockups and mission simulations, is found to be highly effective. Ephemeris data is too important to trust to table-top calculators, since errors propagate in repeated calculations. Terminal access to an off-line computer is required.

Baldwin, R. R.↗

The measurement of the earth's radiation budget as a problem in information theory - A tool for the rational design of earth observing systems

The measurement of the earth's radiation budget has been chosen to illustrate the technique of objective system design. The measurement process is an approximately linear transformation of the original field of radiant exitances, so that linear statistical techniques may be employed. The combination of variability, measurement strategy, and error propagation is presently made with the help of information theory, as suggested by Kondratyev et al. (1975) and Peckham (1974). Covariance matrices furnish the quantitative statement of field variability.

Barkstrom, B. R.↗

Constructions for finite-state codes

A class of codes called finite-state (FS) codes is defined and investigated. These codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived from known upper bounds on the minimum distance of block codes. A general construction for FS codes is then given, based on the idea of partitioning a given linear block into cosets of one of its subcodes, and it is shown that in many cases the FS codes constructed in this way have a d sub free which is as large as possible. These codes are found without the need for lengthy computer searches, and have potential applications for future deep-space coding systems. The issue of catastropic error propagation (CEP) for FS codes is also investigated.

Pollara, F.↗

Numerical aspects of different Kalman filter implementations

A theoretical analysis is made of the error propagation due to numerical roundoff for four different Kalman filter implementations: the conventional Kalman filter, the square root covariance filter, the square root information filter, and the Chandrasekhar square root filter. An experimental analysis is performed to validate the new insights gained by the theoretical analysis.

Verhaegen, M.↗

Robust vector quantization for noisy channels

The paper briefly discusses techniques for making vector quantizers more tolerant to tranmsission errors. Two algorithms are presented for obtaining an efficient binary word assignment to the vector quantizer codewords without increasing the transmission rate. It is shown that about 4.5 dB gain over random assignment can be achieved with these algorithms. It is also proposed to reduce the effects of error propagation in vector-predictive quantizers by appropriately constraining the response of the predictive loop. The constrained system is shown to have about 4 dB of SNR gain over an unconstrained system in a noisy channel, with a small loss of clean-channel performance.

Demarca, J. R. B.↗

Neuromorphic learning of continuous-valued mappings in the presence of noise: Application to real-time adaptive control

The ability of feed-forward neural net architectures to learn continuous-valued mappings in the presence of noise is demonstrated in relation to parameter identification and real-time adaptive control applications. Factors and parameters influencing the learning performance of such nets in the presence of noise are identified. Their effects are discussed through a computer simulation of the Back-Error-Propagation algorithm by taking the example of the cart-pole system controlled by a nonlinear control law. Adequate sampling of the state space is found to be essential for canceling the effect of the statistical fluctuations and allowing learning to take place.

Troudet, Terry↗

Finite-state codes

A class of codes called finite-state (FS) codes is defined and investigated. The codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived. A general construction for FS codes is given, and it is shown that in many cases the FS codes constructed in this way have a free distance that is the largest possible. Catastrophic error propagation (CEP) for FS codes is also discussed. It is found that to avoid CEP one must solve the graph-theoretic problem of finding a uniquely decodable edge labeling of the state diagram.

Pollara, Fabrizio↗

New insights in the numerical reliability properties of existing Kalman filter implementations

The convergence properties of Kalman filter algorithms are investigated analytically. A theoretical error analysis is performed on four types of algorithms, as defined by Anderson and Moore (1979): (1) a conventional Kalman filter, (2) a square-root (SR) covariance filter, (3) the Chandrasekhar SR filter, and (4) an SR information filter. The derivations are given in detail, and numerical results for the flight-path reconstruction problem studied by Verhaegen (1987) are presented in tables and graphs. It is shown that error propagation in algorithms (1) and (2) is sensitive to the condition number of the innovation-signal covariance matrix and the spectral norm of the filter state-transition matrix, whereas other parameters are dominant in (3) and (4). Filter (2) is found to be the most reliable for the class of problems studied.

Verhaegen, M. H.↗

Neuromorphic learning of continuous-valued mappings from noise-corrupted data. Application to real-time adaptive control

The ability of feed-forward neural network architectures to learn continuous valued mappings in the presence of noise was demonstrated in relation to parameter identification and real-time adaptive control applications. An error function was introduced to help optimize parameter values such as number of training iterations, observation time, sampling rate, and scaling of the control signal. The learning performance depended essentially on the degree of embodiment of the control law in the training data set and on the degree of uniformity of the probability distribution function of the data that are presented to the net during sequence. When a control law was corrupted by noise, the fluctuations of the training data biased the probability distribution function of the training data sequence. Only if the noise contamination is minimized and the degree of embodiment of the control law is maximized, can a neural net develop a good representation of the mapping and be used as a neurocontroller. A multilayer net was trained with back-error-propagation to control a cart-pole system for linear and nonlinear control laws in the presence of data processing noise and measurement noise. The neurocontroller exhibited noise-filtering properties and was found to operate more smoothly than the teacher in the presence of measurement noise.

Troudet, Terry↗

Neural-Network Simulator

F77NNS (FORTRAN 77 Neural Network Simulator) computer program simulates popular back-error-propagation neural network. Designed to take advantage of vectorization when used on computers having this capability, also used on any computer equipped with ANSI-77 FORTRAN Compiler. Problems involving matching of patterns or mathematical modeling of systems fit class of problems F77NNS designed to solve. Program has restart capability so neural network solved in stages suitable to user's resources and desires. Enables user to customize patterns of connections between layers of network. Size of neural network F77NNS applied to limited only by amount of random-access memory available to user.

Mitchell, Paul H.↗

Input/output system identification - Learning from repeated experiments

The paper describes three approaches and possible variations for the determination of the Markov parameters for forced response data using general inputs. It is shown that, when the parameters in the solution procedure are bootstrapped, the results can be obtained very efficiently, but the errors propagate throughout all parameters. By arranging the data in a different form and using singular value decomposition, the resulting identified parameters are more accurate, in the least number of successive experiments, at the expense of a large matrix singular value decomposition. When a recursive procedure is employed, the calculations can be performed very efficiently, but the number of repetitions of the experiments is much greater for a given accuracy than for any of the previous approaches. An alternative formulation is proposed to combine the advantages of each of the approaches.

Juang, Jer-Nan↗

Space-Time Neural Networks

Concept of space-time neural network affords distributed temporal memory enabling such network to model complicated dynamical systems mathematically and to recognize temporally varying spatial patterns. Digital filters replace synaptic-connection weights of conventional back-error-propagation neural network.

Villarreal, James A.↗

Modelling default and likelihood reasoning as probabilistic reasoning

A probabilistic analysis of plausible reasoning about defaults and about likelihood is presented. Likely and by default are in fact treated as duals in the same sense as possibility and necessity. To model these four forms probabilistically, a qualitative default probabilistic (QDP) logic and its quantitative counterpart DP are derived that allow qualitative and corresponding quantitative reasoning. Consistency and consequent results for subsets of the logics are given that require at most a quadratic number of satisfiability tests in the underlying propositional logic. The quantitative logic shows how to track the propagation error inherent in these reasoning forms. The methodology and sound framework of the system highlights their approximate nature, the dualities, and the need for complementary reasoning about relevance.

Buntine, Wray↗

Modelling default and likelihood reasoning as probabilistic

A probabilistic analysis of plausible reasoning about defaults and about likelihood is presented. 'Likely' and 'by default' are in fact treated as duals in the same sense as 'possibility' and 'necessity'. To model these four forms probabilistically, a logic QDP and its quantitative counterpart DP are derived that allow qualitative and corresponding quantitative reasoning. Consistency and consequence results for subsets of the logics are given that require at most a quadratic number of satisfiability tests in the underlying propositional logic. The quantitative logic shows how to track the propagation error inherent in these reasoning forms. The methodology and sound framework of the system highlights their approximate nature, the dualities, and the need for complementary reasoning about relevance.

Buntine, Wray↗

Lidar Measurement of Stratospheric Ozone at Hohenpeissenberg: an Improved Evaluation Method

In 1987, the schedule of long-term ozone monitoring at the Meteorological Observatory Hohenpeissenberg was extended by operational DIAL measurements. A detailed description of the system is given in earlier works. An improved evaluation method will be described, which allows the calculation of stratospheric ozone distribution up to 50 km. A good balance between precision and range resolution is achieved. The evaluation begins with the calculation of the relative error for each channel in accordance with the Poisson distribution. During the following evaluation an error calculation is performed according to the Gaussian error propagation. After normalization of the backscatter profiles to count per shot and kilometer, an empirical function is applied to correct non-linearities of the photomultipliers.

Vandersee, W.↗