Search NASA⌕ Search

SEARCH · Search NASA

Results for “operator exponential”

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 19 records

Theoretical Studies of Spectroscopic Line Mixing in Remote Sensing Applications

The phenomenon of collisional transfer of intensity due to line mixing has an increasing importance for atmospheric monitoring. From a theoretical point of view, all relevant information about the collisional processes is contained in the relaxation matrix where the diagonal elements give half-widths and shifts, and the off-diagonal elements correspond to line interferences. For simple systems such as those consisting of diatom-atom or diatom-diatom, accurate fully quantum calculations based on interaction potentials are feasible. However, fully quantum calculations become unrealistic for more complex systems. On the other hand, the semi-classical Robert-Bonamy (RB) formalism, which has been widely used to calculate half-widths and shifts for decades, fails in calculating the off-diagonal matrix elements. As a result, in order to simulate atmospheric spectra where the effects from line mixing are important, semi-empirical fitting or scaling laws such as the ECS (Energy-Corrected Sudden) and IOS (Infinite-Order Sudden) models are commonly used. Recently, while scrutinizing the development of the RB formalism, we have found that these authors applied the isolated line approximation in their evaluating matrix elements of the Liouville scattering operator given in exponential form. Since the criterion of this assumption is so stringent, it is not valid for many systems of interest in atmospheric applications. Furthermore, it is this assumption that blocks the possibility to calculate the whole relaxation matrix at all. By eliminating this unjustified application, and accurately evaluating matrix elements of the exponential operators, we have developed a more capable formalism. With this new formalism, we are now able not only to reduce uncertainties for calculated half-widths and shifts, but also to remove a once insurmountable obstacle to calculate the whole relaxation matrix. This implies that we can address the line mixing with the semi-classical theory based on interaction potentials between molecular absorber and molecular perturber. We have applied this formalism to address the line mixing for Raman and infrared spectra of molecules such as N2, C2H2, CO2, NH3, and H2O. By carrying out rigorous calculations, our calculated relaxation matrices are in good agreement with both experimental data and results derived from the ECS model.

Formalism↗

On evaluating compliance with air pollution levels 'not to be exceeded more than once a year'

Under a sampling program operated in conformity with EPA guidelines, calculational procedures are described for estimating the corresponding ambient pollution level. The statistical independence of the data, the commutativity of expectation and exponential operations, and the statistical variability of the calculated results are quantitatively evaluated. It is shown that the recommended sampling frequencies of every third to every sixth day are inadequate in determining conformity when the standards are expressed as levels not to be exceeded more than once a year.

Neustadter, H. E.↗

Numerical methods for inviscid/viscous flows

A study of numerical schemes for solving viscous fluid flow problems with sizable regions of predominantly inviscid flow is presented. Difficulties associated with the familiar central difference approach for such problems were analyzed and alternative finite difference approaches employing windward concepts are presented. In addition, difference relations based on exponential operators were developed. All such schemes were demonstrated and evaluated through application to the case of Falkner Skan flow with blowing - a problem in which a sizable region of predominantly inviscid flow develops near the injection surface that traditionally causes numerical difficulty.

El-Mistikawy, T. M.↗

Exponential Formulae and Effective Operations

One of standard methods to predict the phenomena of squeezing consists in splitting the unitary evolution operator into the product of simpler operations. The technique, while mathematically general, is not so simple in applications and leaves some pragmatic problems open. We report an extended class of exponential formulae, which yield a quicker insight into the laboratory details for a class of squeezing operations, and moreover, can be alternatively used to programme different type of operations, as: (1) the free evolution inversion; and (2) the soft simulations of the sharp kicks (so that all abstract results involving the kicks of the oscillator potential, become realistic laboratory prescriptions).

Mielnik, Bogdan↗

Numerical method for boundary layers with blowing - The exponential box scheme

The paper describes a new numerical scheme based on exponential difference operator concepts combined with Keller's (1968) box scheme approach to produce a stable second-order accurate finite-difference scheme for convection-diffusion problems arising in boundary layer flows in the presence of massive injection through a porous surface. The technique is demonstrated by application to the self-similar boundary layer equations with massive blowing at the surface.

El-Mistikawy, T. M.↗

Shot-noise in resistive-diode mixers and the attenuator noise model

The representation of a pumped exponential diode, operating as a mixer, by an equivalent lossy network, is reexamined. It is shown that the model is correct provided the network has ports for all sideband frequencies at which (real) power flow can occur between the diode and its embedding. The temperature of the equivalent network is eta/2 times the physical temperature of the diode. The model is valid only if the series resistance and nonlinear capacitance of the diode are negligible. Expressions are derived for the input and output noise temperature and the noise-temperature ratio of ideal mixers. Some common beliefs concerning noise-figure and noise-temperature ratio are shown to be incorrect.

Kerr, A. R.↗

Reducing a Knowledge-Base Search Space When Data Are Missing

This software addresses the problem of how to efficiently execute a knowledge base in the presence of missing data. Computationally, this is an exponentially expensive operation that without heuristics generates a search space of 1 + 2n possible scenarios, where n is the number of rules in the knowledge base. Even for a knowledge base of the most modest size, say 16 rules, it would produce 65,537 possible scenarios. The purpose of this software is to reduce the complexity of this operation to a more manageable size. The problem that this system solves is to develop an automated approach that can reason in the presence of missing data. This is a meta-reasoning capability that repeatedly calls a diagnostic engine/model to provide prognoses and prognosis tracking. In the big picture, the scenario generator takes as its input the current state of a system, including probabilistic information from Data Forecasting. Using model-based reasoning techniques, it returns an ordered list of fault scenarios that could be generated from the current state, i.e., the plausible future failure modes of the system as it presently stands. The scenario generator models a Potential Fault Scenario (PFS) as a black box, the input of which is a set of states tagged with priorities and the output of which is one or more potential fault scenarios tagged by a confidence factor. The results from the system are used by a model-based diagnostician to predict the future health of the monitored system.

James, Mark↗

Operations for Learning with Graphical Models

This paper is a multidisciplinary review of empirical, statistical learning from a graphical model perspective. Well-known examples of graphical models include Bayesian net- works, directed graphs representing a Markov chain, and undirected networks representing a Markov field. These graphical models are extended to model data analysis and empirical learning using the notation of plates. Graphical operations for simplifying and manipulating a problem are provided including decomposition, differentiation, and the manipulation of probability models from the exponential family. These operations adapt existing techniques from statistics and automatic differentiation to graphs. Two standard algorithm schemes for learning are reviewed in a graphical framework: Gibbs sampling and the expectation maximization algorithm. Some algorithms are developed in this graphical framework including a generalized version of linear regression, techniques for feed-forward networks, and learning Gaussian and discrete Bayesian networks from data. The paper concludes by sketching some implications for data analysis and summarizing some popular algorithms that fall within the framework presented. The main original contributions here are the decomposition techniques and the demonstration that graphical models provide a framework for understanding and developing complex learning algorithms.

Buntine, Wray L.↗

Logarithmic circuit with wide dynamic range

A circuit deriving an output voltage that is proportional to the logarithm of a dc input voltage susceptible to wide variations in amplitude includes a constant current source which forward biases a diode so that the diode operates in the exponential portion of its voltage versus current characteristic, above its saturation current. The constant current source includes first and second, cascaded feedback, dc operational amplifiers connected in negative feedback circuit. An input terminal of the first amplifier is responsive to the input voltage. A circuit shunting the first amplifier output terminal includes a resistor in series with the diode. The voltage across the resistor is sensed at the input of the second dc operational feedback amplifier. The current flowing through the resistor is proportional to the input voltage over the wide range of variations in amplitude of the input voltage.

Wiley, P. H.↗

On evaluating compliance with air pollution levels not to be exceeded more than once per year

The adequacy is considered of currently practiced monitoring and data reduction techniques for assessing compliance with 24-hour Air Quality Standards (AQS) not to be exceeded more than once per year. The present situation for suspended particulates is discussed. The following conclusions are reached: (1) For typical less than daily sampling (i.e., 60 to 120 24-hour samples per year) the deviation from independence of the data set should not be substantial. (2) The interchange of exponentiation and expectation operations in the EPA data reduction model, underestimates the second highest level by about 4 to 8 percent for typical sigma values. (3) Estimates of the second highest pollution level have associated with them a large statistical variability arising from the finite size of the sample. The 0.95 confidence interval ranges from + or - 40 percent for 120 samples per year to + or - 84 percent for 30 samples per year. (4) The design value suggested by EPA for abatement and/or control planning purposes typically gives a margin of safety of 60 to 120 percent.

Neustadter, H. E.↗

The Challenges of Human-Autonomy Teaming

Machine intelligence is improving rapidly based on advances in big data analytics, deep learning algorithms, networked operations, and continuing exponential growth in computing power (Moores Law). This growth in the power and applicability of increasingly intelligent systems will change the roles humans, shifting them to tasks where adaptive problem solving, reasoning and decision-making is required. This talk will address the challenges involved in engineering autonomous systems that function effectively with humans in aeronautics domains.

artificial intelligence↗

The Challenges of Human-Autonomy Teaming

Machine intelligence is improving rapidly based on advances in big data analytics, deep learning algorithms, networked operations, and continuing exponential growth in computing power (Moores Law). This growth in the power and applicability of increasingly intelligent systems will change the roles humans, shifting them to tasks where adaptive problem solving, reasoning and decision-making is required. This talk will address the challenges involved in engineering autonomous systems that function effectively with humans in aeronautics domains.

Human-Autonomy teaming↗

Labeled trees and the efficient computation of derivations

The effective parallel symbolic computation of operators under composition is discussed. Examples include differential operators under composition and vector fields under the Lie bracket. Data structures consisting of formal linear combinations of rooted labeled trees are discussed. A multiplication on rooted labeled trees is defined, thereby making the set of these data structures into an associative algebra. An algebra homomorphism is defined from the original algebra of operators into this algebra of trees. An algebra homomorphism from the algebra of trees into the algebra of differential operators is then described. The cancellation which occurs when noncommuting operators are expressed in terms of commuting ones occurs naturally when the operators are represented using this data structure. This leads to an algorithm which, for operators which are derivations, speeds up the computation exponentially in the degree of the operator. It is shown that the algebra of trees leads naturally to a parallel version of the algorithm.

Grossman, Robert↗

Universal Decoder for PPM of any Order

A recently developed algorithm for demodulation and decoding of a pulse-position- modulation (PPM) signal is suitable as a basis for designing a single hardware decoding apparatus to be capable of handling any PPM order. Hence, this algorithm offers advantages of greater flexibility and lower cost, in comparison with prior such algorithms, which necessitate the use of a distinct hardware implementation for each PPM order. In addition, in comparison with the prior algorithms, the present algorithm entails less complexity in decoding at large orders. An unavoidably lengthy presentation of background information, including definitions of terms, is prerequisite to a meaningful summary of this development. As an aid to understanding, the figure illustrates the relevant processes of coding, modulation, propagation, demodulation, and decoding. An M-ary PPM signal has M time slots per symbol period. A pulse (signifying 1) is transmitted during one of the time slots; no pulse (signifying 0) is transmitted during the other time slots. The information intended to be conveyed from the transmitting end to the receiving end of a radio or optical communication channel is a K-bit vector u. This vector is encoded by an (N,K) binary error-correcting code, producing an N-bit vector a. In turn, the vector a is subdivided into blocks of m = log2(M) bits and each such block is mapped to an M-ary PPM symbol. The resultant coding/modulation scheme can be regarded as equivalent to a nonlinear binary code. The binary vector of PPM symbols, x is transmitted over a Poisson channel, such that there is obtained, at the receiver, a Poisson-distributed photon count characterized by a mean background count nb during no-pulse time slots and a mean signal-plus-background count of ns+nb during a pulse time slot. In the receiver, demodulation of the signal is effected in an iterative soft decoding process that involves consideration of relationships among photon counts and conditional likelihoods of m-bit vectors of coded bits. Inasmuch as the likelihoods of all the m-bit vectors of coded bits mapping to the same PPM symbol are correlated, the best performance is obtained when the joint mbit conditional likelihoods are utilized. Unfortunately, the complexity of decoding, measured in the number of operations per bit, grows exponentially with m, and can thus become prohibitively expensive for large PPM orders. For a system required to handle multiple PPM orders, the cost is even higher because it is necessary to have separate decoding hardware for each order. This concludes the prerequisite background information. In the present algorithm, the decoding process as described above is modified by, among other things, introduction of an lbit marginalizer sub-algorithm. The term "l-bit marginalizer" signifies that instead of m-bit conditional likelihoods, the decoder computes l-bit conditional likelihoods, where l is fixed. Fixing l, regardless of the value of m, makes it possible to use a single hardware implementation for any PPM order. One could minimize the decoding complexity and obtain an especially simple design by fixing l at 1, but this would entail some loss of performance. An intermediate solution is to fix l at some value, greater than 1, that may be less than or greater than m. This solution makes it possible to obtain the desired flexibility to handle any PPM order while compromising between complexity and loss of performance.

Moision, Bruce E.↗

Expressions Module for the Satellite Orbit Analysis Program

The Expressions Module is a software module that has been incorporated into the Satellite Orbit Analysis Program (SOAP). The module includes an expressions- parser submodule built on top of an analytical system, enabling the user to define logical and numerical variables and constants. The variables can capture output from SOAP orbital-prediction and geometric-engine computations. The module can combine variables and constants with built-in logical operators (such as Boolean AND, OR, and NOT), relational operators (such as >, <, or =), and mathematical operators (such as addition, subtraction, multiplication, division, modulus, exponentiation, differentiation, and integration). Parentheses can be used to specify precedence of operations. The module contains a library of mathematical functions and operations, including logarithms, trigonometric functions, Bessel functions, minimum/ maximum operations, and floating- point-to-integer conversions. The module supports combinations of time, distance, and angular units and has a dimensional- analysis component that checks for correct usage of units. A parser based on the Flex language and the Bison program looks for and indicates errors in syntax. SOAP expressions can be built using other expressions as arguments, thus enabling the user to build analytical trees. A graphical user interface facilitates use.

Edmonds, Karina↗

A scheduling and resource management system for space applications

Every spacecraft, whether in orbit around the earth or an a deep space flight, has at its disposal limited amounts of the resources for it to accomplish its mission. Activity scheduling is currently a costly, human intensive task which requires a great deal of expertise. It belongs to a class of problems whose complexity increases exponentially with the number of operations. NASA has in the past accomplished this task by using a great deal of manpower, a large number of negotiating sessions, interminable bouts of phone tag, and mountains of paperwork. Lately the situation has improved with the introduction of automated scheduling techniques, but these to date still require expert involvement and fall short in some important ways. A prototype activity scheduler, MAESTRO, is introduced which is capable of meeting the needs of many NASA missions, eventually to include the Space Station. The approach to resource constrained scheduling is first discussed, then the intended domain for MAESTRO is described along with its design and current capabilities. A description of planned enhancements and revisions to the systems is also presented.

Britt, Daniel L.↗

Hardware Implementation of Serially Concatenated PPM Decoder

A prototype decoder for a serially concatenated pulse position modulation (SCPPM) code has been implemented in a field-programmable gate array (FPGA). At the time of this reporting, this is the first known hardware SCPPM decoder. The SCPPM coding scheme, conceived for free-space optical communications with both deep-space and terrestrial applications in mind, is an improvement of several dB over the conventional Reed-Solomon PPM scheme. The design of the FPGA SCPPM decoder is based on a turbo decoding algorithm that requires relatively low computational complexity while delivering error-rate performance within approximately 1 dB of channel capacity. The SCPPM encoder consists of an outer convolutional encoder, an interleaver, an accumulator, and an inner modulation encoder (more precisely, a mapping of bits to PPM symbols). Each code is describable by a trellis (a finite directed graph). The SCPPM decoder consists of an inner soft-in-soft-out (SISO) module, a de-interleaver, an outer SISO module, and an interleaver connected in a loop (see figure). Each SISO module applies the Bahl-Cocke-Jelinek-Raviv (BCJR) algorithm to compute a-posteriori bit log-likelihood ratios (LLRs) from apriori LLRs by traversing the code trellis in forward and backward directions. The SISO modules iteratively refine the LLRs by passing the estimates between one another much like the working of a turbine engine. Extrinsic information (the difference between the a-posteriori and a-priori LLRs) is exchanged rather than the a-posteriori LLRs to minimize undesired feedback. All computations are performed in the logarithmic domain, wherein multiplications are translated into additions, thereby reducing complexity and sensitivity to fixed-point implementation roundoff errors. To lower the required memory for storing channel likelihood data and the amounts of data transfer between the decoder and the receiver, one can discard the majority of channel likelihoods, using only the remainder in operation of the decoder. This is accomplished in the receiver by transmitting only a subset consisting of the likelihoods that correspond to time slots containing the largest numbers of observed photons during each PPM symbol period. The assumed number of observed photons in the remaining time slots is set to the mean of a noise slot. In low background noise, the selection of a small subset in this manner results in only negligible loss. Other features of the decoder design to reduce complexity and increase speed include (1) quantization of metrics in an efficient procedure chosen to incur no more than a small performance loss and (2) the use of the max-star function that allows sum of exponentials to be computed by simple operations that involve only an addition, a subtraction, and a table lookup. Another prominent feature of the design is a provision for access to interleaver and de-interleaver memory in a single clock cycle, eliminating the multiple clock-cycle latency characteristic of prior interleaver and de-interleaver designs.

Moision, Bruce↗

Windage Power Loss in Gas Foil Bearings and the Rotor-Stator Clearance of High Speed Generators Operating in High Pressure Environments

Closed Brayton Cycle (CBC) and Closed Supercritical Cycle (CSC) engines are prime candidates to convert heat from a reactor into electric power for robotic space exploration and habitation. These engine concepts incorporate a permanent magnet starter/generator mounted on the engine shaft along with the requisite turbomachinery. Successful completion of the long-duration missions currently anticipated for these engines will require designs that adequately address all losses within the machine. The preliminary thermal management concept for these engine types is to use the cycle working fluid to provide the required cooling. In addition to providing cooling, the working fluid will also serve as the bearing lubricant. Additional requirements, due to the unique application of these microturbines, are zero contamination of the working fluid and entirely maintenance-free operation for many years. Losses in the gas foil bearings and within the rotor-stator gap of the generator become increasingly important as both rotational speed and mean operating pressure are increased. This paper presents the results of an experimental study, which obtained direct torque measurements on gas foil bearings and generator rotor-stator gaps. Test conditions for these measurements included rotational speeds up to 42,000 revolutions per minute, pressures up to 45 atmospheres, and test gases of nitrogen, helium, and carbon dioxide. These conditions provided a maximum test Taylor number of nearly one million. The results show an exponential rise in power loss as mean operating density is increased for both the gas foil bearing and generator windage. These typical "secondary" losses can become larger than the total system output power if conventional design paradigms are followed. A nondimensional analysis is presented to extend the experimental results into the CSC range for the generator windage.

Bruckner, Robert J.↗