Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Real numbers”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Fault tolerance in space-based digital signal processing and switching systems: Protecting up-link processing resources, demultiplexer, demodulator, and decoder

Fault tolerance features in the first three major subsystems appearing in the next generation of communications satellites are described. These satellites will contain extensive but efficient high-speed processing and switching capabilities to support the low signal strengths associated with very small aperture terminals. The terminals' numerous data channels are combined through frequency division multiplexing (FDM) on the up-links and are protected individually by forward error-correcting (FEC) binary convolutional codes. The front-end processing resources, demultiplexer, demodulators, and FEC decoders extract all data channels which are then switched individually, multiplexed, and remodulated before retransmission to earth terminals through narrow beam spot antennas. Algorithm based fault tolerance (ABFT) techniques, which relate real number parity values with data flows and operations, are used to protect the data processing operations. The additional checking features utilize resources that can be substituted for normal processing elements when resource reconfiguration is required to replace a failed unit.

Redinbo, Robert↗
NASA NTRS1996

Software For Multivariate Bayesian Classification

PHD general-purpose classifier computer program. Uses Bayesian methods to classify vectors of real numbers, based on combination of statistical techniques that include multivariate density estimation, Parzen density kernels, and EM (Expectation Maximization) algorithm. By means of simple graphical interface, user trains classifier to recognize two or more classes of data and then use it to identify new data. Written in ANSI C for Unix systems and optimized for online classification applications. Embedded in another program, or runs by itself using simple graphical-user-interface. Online help files makes program easy to use.

Saul, Ronald↗
NASA NTRS1994

Noise Analysis of Spatial Phase coding in analog Acoustooptic Processors

Optical beams can carry information in their amplitude and phase; however, optical analog numerical calculators such as an optical matrix processor use incoherent light to achieve linear operation. Thus, the phase information is lost and only the magnitude can be used. This limits such processors to the representation of positive real numbers. Many systems have been devised to overcome this deficit through the use of digital number representations, but they all operate at a greatly reduced efficiency in contrast to analog systems. The most widely accepted method to achieve sign coding in analog optical systems has been the use of an offset for the zero level. Unfortunately, this results in increased noise sensitivity for small numbers. In this paper, we examine the use of spatially coherent sign coding in acoustooptical processors, a method first developed for digital calculations by D. V. Tigin. This coding technique uses spatial coherence for the representation of signed numbers, while temporal incoherence allows for linear analog processing of the optical information. We show how spatial phase coding reduces noise sensitivity for signed analog calculations.

Gary, Charles K.↗
NASA NTRS2001

Distribution functions of probabilistic automata

Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) < x }. Utilizing the fixed-point semantics (denotational semantics), extended to probabilistic computations, we investigate the distribution functions of probabilistic automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.

Denotational semantics↗
NASA NTRS2001

Real Automation in the Field

We provide a package of strategies for automation of non-linear arithmetic in PVS. In particular, we describe a simplication procedure for the field of real numbers and a strategy for cancellation of common terms.

Munoz, Cesar↗
NASA NTRS1998

A Polynomial Time, Numerically Stable Integer Relation Algorithm

Let x = (x1, x2...,xn be a vector of real numbers. X is said to possess an integer relation if there exist integers a(sub i) not all zero such that a1x1 + a2x2 + ... a(sub n)Xn = 0. Beginning in 1977 several algorithms (with proofs) have been discovered to recover the a(sub i) given x. The most efficient of these existing integer relation algorithms (in terms of run time and the precision required of the input) has the drawback of being very unstable numerically. It often requires a numeric precision level in the thousands of digits to reliably recover relations in modest-sized test problems. We present here a new algorithm for finding integer relations, which we have named the "PSLQ" algorithm. It is proved in this paper that the PSLQ algorithm terminates with a relation in a number of iterations that is bounded by a polynomial in it. Because this algorithm employs a numerically stable matrix reduction procedure, it is free from the numerical difficulties, that plague other integer relation algorithms. Furthermore, its stability admits an efficient implementation with lower run times oil average than other algorithms currently in Use. Finally, this stability can be used to prove that relation bounds obtained from computer runs using this algorithm are numerically accurate.

Ferguson, Helaman R. P.↗
NASA NTRS2004

Lattice Duality: The Origin of Probability and Entropy

Bayesian probability theory is an inference calculus, which originates from a generalization of inclusion on the Boolean lattice of logical assertions to a degree of inclusion represented by a real number. Dual to this lattice is the distributive lattice of questions constructed from the ordered set of down-sets of assertions, which forms the foundation of the calculus of inquiry-a generalization of information theory. In this paper we introduce this novel perspective on these spaces in which machine learning is performed and discuss the relationship between these results and several proposed generalizations of information theory in the literature.

Knuth, Kevin H.↗
NASA NTRS2005

The GPM Common Calibrated Brightness Temperature Product

The Global Precipitation Measurement (GPM) project will provide a core satellite carrying the GPM Microwave Imager (GMI) and will use microwave observations from a constellation of other satellites. Each partner with a satellite in the constellation will have a calibration that meets their own requirements and will decide on the format to archive their brightness temperature (Tb) record in GPM. However, GPM multi-sensor precipitation algorithms need to input intercalibrated Tb's in order to avoid differences among sensors introducing artifacts into the longer term climate record of precipitation. The GPM Common Calibrated Brightness Temperature Product is intended to address this problem by providing intercalibrated Tb data, called "Tc" data, where the "c" stands for common. The precipitation algorithms require a Tc file format that is both generic and flexible enough to accommodate the different passive microwave instruments. The format will provide detailed information on the processing history in order to allow future researchers to have a record of what was done. The format will be simple, including the main items of scan time, latitude, longitude, and Tc. It will also provide spacecraft orientation, spacecraft location, orbit, and instrument scan type (cross-track or conical). Another simplification is to store data in real numbers, avoiding the ambiguity of scaled data. Finally, units and descriptions will be provided in the product. The format is built on the concept of a swath, which is a series of scans that have common geolocation and common scan geometry. Scan geometry includes pixels per scan, sensor orientation, scan type, and incidence angles. The Tc algorithm and data format are being tested using the pre-GPM Precipitation Processing System (PPS) software to generate formats and 1/0 routines. In the test, data from SSM/I, TMI, AMSR-E, and WindSat are being processed and written as Tc products.

Stout, John↗
NASA NTRS2018

A Formally Verified Floating-Point Implementation of the Compact Position Reporting Algorithm

The Automatic Dependent Surveillance-Broadcast (ADS-B) system allows aircraft to communicate their current state, including position and velocity information, to other aircraft in their vicinity and to ground stations. The Compact Position Reporting (CPR) algorithm is the ADS-B module responsible for the encoding and decoding of aircraft positions. CPR is highly sensitive to computer arithmetic since it heavily relies on functions that are intrinsically unstable such as floor and modulo. In this paper, a formally-verified double-precision floating-point implementation of the CPR algorithm is presented. The verification proceeds in three steps. First, an alternative version of CPR, which reduces the floating-point rounding error is proposed. Then, the Prototype Verification System (PVS) is used to formally prove that the ideal real-number counterpart of the improved algorithm is mathematically equivalent to the standard CPR definition. Finally, the static analyzer Frama-C is used to verify that the double-precision implementation of the improved algorithm is correct with respect to its operational requirement. The alternative algorithm is currently being considered for inclusion in the revised version of the ADS-B standards document as the reference implementation of the CPR algorithm.

Laura Titolo↗
NASA NTRS2010

TPSAS-NF1676L-9990-DND

PVS (Prototype Veri cation System)1 is an interactive environment for the specification and verification of systems. PVS provides a strongly typed specification language, which is based on Higher-Order Logic. The type system of PVS supports: sub-typing, dependent-types, abstract data types, parametric types, records, unions, and tuples. The PVS theorem prover includes decision procedures for a variety of theories such as linear arithmetic, propositional logic, and temporal logic. This seminar will provide a gentle introduction to the basic and advanced features of PVS, including: theory interpretations, real number proving, batch proving, rapid prototyping, and strategy development. All these features are illustrated with simple examples and exercises.

César Muñoz↗
NASA NTRSDate not supplied

PRECiSA: a static analysis tool for floating-point programs

This presentation introduces PRECiSA, a static analysis framework for analyzing floating-point programs. PRECiSA computes round-off error bounds for a class of floating-point programs, and produces a formal proof certificate of the correctness of these bounds. PRECiSA also has the capability of generating C code which is instrumented to detect unstable branching conditions from a real-number algorithm specification.

Floating-point↗
NASA NTRS1983

Explanation of the hypersonic longitudinal stability problem: Lessons learned

Inviscid and viscous CFD codes have been applied to a modified Space Shuttle orbiter geometry to investigate differences between preflight aerodynamic predictions and aerodynamic data from hypersonic reentry flight. Flow field solutions were obtained for wind tunnel conditions and flight conditions to assess Mach number, real-gas, and viscous effects on the reentry aerodynamics of the orbiter. Based on the CFD studies, a methodology model has been developed to (1) extrapolate wind tunnel data to flight conditions and (2) calculate a DCM for use with the Aerodynamic Design Data Book. Comparisons are made with selected flight data. Results of the study indicate that the differences between flight and pre-STS-1 predictions of hypersonic pitching moment are primarily due the to Mach number and real-gas effects.

Griffith, B. J.↗
NASA NTRS1989

Hypersonic blunt body computations including real gas effects

Various second-order explicit and implicit TVD shock-capturing methods, a generalization of Roe's approximate Riemann solver, and a generalized flux-vector splitting scheme are used to study two-dimensional hypersonic real-gas flows. Special attention is given to the identification of some of the elements and parameters which can affect the convergence rate for high Mach numbers or real gases, but have negligible effect for low Mach numbers, for cases involving steady-state inviscid blunt flows. Blunt body calculations at Mach numbers of greater than 15 are performed to treat real-gas effects, and impinging shock results are obtained to test the treatment of slip surfaces and complex structures. Even with the addition of improvements, the convergence rate of algorithms in the hypersonic flow regime is found to be generally slower for a real gas than for a perfect gas.

Montagne, J.-L.↗
NASA NTRS1992

Clustering of noisy image data using an adaptive neuro-fuzzy system

Identification of outliers or noise in a real data set is often quite difficult. A recently developed adaptive fuzzy leader clustering (AFLC) algorithm has been modified to separate the outliers from real data sets while finding the clusters within the data sets. The capability of this modified AFLC algorithm to identify the outliers in a number of real data sets indicates the potential strength of this algorithm in correct classification of noisy real data.

Pemmaraju, Surya↗
NASA NTRS1988

High-resolution shock-capturing schemes for inviscid and viscous hypersonic flows

The development of robust, accurate, and efficient implicit shock-capturing schemes for multidimensional compressible Navier-Stokes equations in the hypersonic and real gas flow regimes is presently undertaken by extending a class of implicit total variation-diminishing (TVD) schemes suitable for transonic and supersonic, multidimensional Euler and Navier-Stokes equations to hypersonic computations. Numerical aspects of TVD schemes are identified which affect the convergence rate for hypersonic Mach numbers and real gas flows, but which have a negligible effect on low Mach number or perfect gas flows.

Yee, H. C.↗
NASA NTRS1988

Hypersonic blunt body computations including real gas effects

The recently developed second-order explicit and implicit total variation diminishing (TVD) shock-capturing methods of the Harten and Yee, Yee, and van Leer types in conjunction with a generalized Roe's approximate Riemann solver of Vinokur and the generalized flux-vector splittings of Vinokur and Montagne for two-dimensional hypersonic real gas flows are studied. A previous study on one-dimensional unsteady problems indicated that these schemes produce good shock-capturing capability and that the state equation does not have a large effect on the general behavior of these methods for a wide range of flow conditions for equilibrium air. The objective of this paper is to investigate the applicability and shock resolution of these schemes for two-dimensional steady-state hypersonic blunt body flows. The main contribution of this paper is to identify some of the elements and parameters which can affect the convergence rate for high Mach numbers or real gases but have negligible effect for low Mach number cases for steady-state inviscid blunt body flows.

Montagne, J.-L.↗
NASA NTRS1989

High Reynolds number tests of the CAST-10-2/DOA 2 transonic airfoil at ambient and cryogenic temper ature conditions

The transonic airfoil CAST 10-2/DOA 2 was investigated in several major transonic wind tunnels at Reynolds numbers ranging from Re=1.3 x 10(exp 6) to 45 x 10(exp 6) at ambient and cryogenic temperature conditions. The main objective was to study the degree and extent of the effects of Reynolds number on both the airfoil aerodynamic characteristics and the interference effects of various model-wind-tunnel systems. The initial analysis of the CAST 10-2 airfoil results revealed appreciable real Reynolds number effects on this airfoil and showed that wall interference can be significantly affected by changes in Reynolds number thus appearing as true Reynolds number effects.

Stanewsky, E.↗