Search NASA⌕ Search

SEARCH · Search NASA

Results for “Random systems”

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 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
NASA NTRS1971

Development of control systems for space shuttle vehicles. Volume 2: Appendixes

A launch phase random normal wind model is presented for delta wing, two-stage, space shuttle control system studies. Equations, data, and simulations for conventional launch studies are given as well as pitch and lateral equations and data for covariance analyses of the launch phase of MSFC vehicle B. Lateral equations and data for North American 130G and 134D are also included along with a high-altitude abort simulation.

Stone, C. R.↗
NASA NTRS1982

Assessment of the Shuttle Orbiter Thermal Protection System undensified tiles under mission dynamic loads

A description is provided of the results of a series of base driven random dynamic load tests of the Thermal Protection System (TPS). The results were used to insure the integrity of the undensified TPS prior to the first flight in the wing and mid-fuselage region. The number of specimens and the load ranges investigated were limited. Attention is given to the test specimens, the test procedure, a data analysis, and a discussion of the results. All specimens for both the wing and mid-fuselage regions survived an equivalent of 72 ascent missions and exhibited residual static strength greater than their original proof loads. These results indicate that the undensified tiles had sufficient strength to withstand ascent loads during the first flight.

Cooper, P. A.↗
NASA NTRS1990

Typical motions in multiple systems

In very old times, people counted - one, two, many. The author wants to show that they were right. Consider the motions of isolated bodies: (1) N = 1 - simple motion; (2) N = 2 - Keplerian orbits; and (3) N = 3 - this is the difficult problem. In general, this problem can be studied only by computer simulations. The author studied this problem over many years (see, e.g., Agekian and Anosova, 1967; Anosova, 1986, 1989 a,b). The principal result is that two basic types of dynamics take place in triple systems. The first special type is the stable hierarchical systems with two almost Keplerian orbits. The second general type is the unstable triple systems with complicated motions of the bodies. By random choice of the initial conditions, by the Monte-Carlo method, the stable systems comprised about approx. 10% of the examined cases; the unstable systems comprised the other approx. 90% of cases under consideration. In N greater than 3, the studies of dynamics of such systems by computer simulations show that we have in general also the motions roughly as at the cases 1 - 3 with the relative negative or positive energies of the bodies. In the author's picture, the typical trajectories of the bodies in unstable triple systems of the general type of dynamics are seen. Such systems are disrupted always after close triple approaches of the bodies. These approaches play a role like the gravitational slingshot. Often, the velocities of escapers are very large. On the other hand, the movie also shows the dynamical processes of a formation, dynamical evolution and disruption of the temporary wide binaries in triples and a formation of final hard massive binaries in the final evolution of triples.

Anosova, Joanna P.↗
NASA NTRS1993

Systems aspects of COBE science data compression

A general approach to compression of diverse data from large scientific projects has been developed and this paper addresses the appropriate system and scientific constraints together with the algorithm development and test strategy. This framework has been implemented for the COsmic Background Explorer spacecraft (COBE) by retrofitting the existing VAS-based data management system with high-performance compression software permitting random access to the data. Algorithms which incorporate scientific knowledge and consume relatively few system resources are preferred over ad hoc methods. COBE exceeded its planned storage by a large and growing factor and the retrieval of data significantly affects the processing, delaying the availability of data for scientific usage and software test. Embedded compression software is planned to make the project tractable by reducing the data storage volume to an acceptable level during normal processing.

Freedman, I.↗
DOE OSTI2024

Decision-making based on Markov decision process in integrated artificial reasoning framework—Part I: Theory

This paper presents a decision-making framework based on an integrated artificial reasoning framework and Markov decision process (MDP). The integrated artificial reasoning framework provides a physics-based approach that converts system information into state transition models, and the analysis result will be represented by the transition probabilities that can be used with an MDP to find a traceable and explainable optimal pathway. A dynamic Bayesian network (DBN) is well suited for representing the structure of an MDP. The causality information among process variables (or among subsystems) is mathematically represented in a DBN by the conditional probabilities of the node’s states provided different probabilities of the parent node’s states. To define node states in a physically understandable manner, we used multilevel flow modeling (MFM). An MFM follows the fundamental energy and mass conservation laws and supports the selection of process variables that represent the system of interest so that causal relations among process variables are properly captured. An MFM-based DBN supports developing state transition models in an MDP to capture the effect of process variables of system having physical relations. The operators of the target system can capture stochastic system dynamics as multiple subsystem state transitions based on their physical relations and uncertainties coming from component degradation or random failures. We analyzed a simplified exemplary system to illustrate an optimal operational policy using the suggested approach.

Markov decision process↗
NASA NTRS1981

Parametric Analytical Studies for the Nonlinear Dynamic Response of the Tile/Pad Space Shuttle Thermal Protection System

The studies examined for imposed sinusoidal and random motions of the shuttle skin and/or applied tile pressure. Studies are performed using the computer code DYNOTA which takes into account the highly nonlinear stiffening hysteresis and viscous behavior of the pad joining the tile to the shuttle skin. Where available, experimental data are used to confirm the validity of the analysis. Both analytical and experimental studies reveal that the system resonant frequency is very high for low amplitude oscillations but decreases rapidly to a minimum value with increasing amplitude.

Edighoffer, H.↗
NASA NTRS1965

Principles of communication engineering.

Textbook on communication engineering emphasizing random processes, information and detection theory, statistical communication theory, applications, etc

COMMUNICATION THEORY↗
DOE OSTI2022

A modified electrolyte non-random two-liquid model with analytical expression for excess enthalpy: Application to the MEA-H 2 O-CO 2 system

We report accurate thermodynamic properties of electrolyte systems are critical for the design and operation of many chemical processes. A comprehensive description of the thermodynamic framework for multi-electrolyte mixed solvent systems is presented, where the parameter structure of the symmetric electrolyte-Non-Random Two Liquid (e-NRTL) model is reformulated and a thermodynamically consistent and analytically derived formulation for the excess enthalpy is developed from the e-NRTL model. The refined parameter structure of the e-NRTL model avoids numerical singularities of the analytical formulation for the excess enthalpy in the absence of ionic species and extends the derived excess enthalpy formulation to non-electrolyte systems. The thermodynamic framework is demonstrated for the MEA-H 2 O-CO 2 case study using experimental data on thermodynamic quantities for the binary MEA-H 2 O system and the ternary MEA-H 2 O-CO 2 system. The model is implemented in Pyomo and will be available for release in the Institute for the Design of Advanced Energy Systems (IDAES) computational platform.

Monoethanolamine↗
NASA NTRS1984

Uniform apparent contrast noise: A picture of the noise of the visual contrast detection system

A picture which is a sample of random contrast noise is generated. The noise amplitude spectrum in each region of the picture is inversely proportional to spatial frequency contrast sensitivity for that region, assuming the observer fixates the center of the picture and is the appropriate distance from it. In this case, the picture appears to have approximately the same contrast everywhere. To the extent that contrast detection thresholds are determined by visual system noise, this picture can be regarded as a picture of the noise of that system. There is evidence that, at different eccentricities, contrast sensitivity functions differ only by a magnification factor. The picture was generated by filtering a sample of white noise with a filter whose frequency response is inversely proportional to foveal contrast sensitivity. It was then stretched by a space-varying magnification function. The picture summmarizes a noise linear model of detection and discrimination of contrast signals by referring the model noise to the input picture domain.

Ahumada, A. J., Jr.↗
NASA NTRS1986

Optimal partitioning of random programs across two processors

The optimal partitioning of random distributed programs is discussed. It is concluded that the optimal partitioning of a homogeneous random program over a homogeneous distributed system either assigns all modules to a single processor, or distributes the modules as evenly as possible among all processors. The analysis rests heavily on the approximation which equates the expected maximum of a set of independent random variables with the set's maximum expectation. The results are strengthened by providing an approximation-free proof of this result for two processors under general conditions on the module execution time distribution. It is also shown that use of this approximation causes two of the previous central results to be false.

Nicol, D. M.↗
NASA NTRS1989

Optimal partitioning of random programs across two processors

The optimal partitioning of random-distributed programs is discussed. It is concluded that the optimal partitioning of a homogeneous random program over a homogeneous distributed system either assigns all modules to a single processor, or distributes the modules as evenly as possible among all processors. The analysis rests heavily on the approximation which equates the expected maximum of a set of independent random variables with the set's maximum expectation. The results are strengthened by providing an approximation-free proof of this result for two processors under general conditions on the module execution time distribution. It is also shown that use of this approximation causes two of the previous central results to be false.

Nicol, David M.↗
NASA NTRS1974

On the quadratic sampled-data regulator with unstable random disturbances

This paper is concerned with the design of a digital controller, optimizing a quadratic cost function, for a linear system subjected to plant disturbance. The disturbance is viewed as a Gaussian random process generated by a linear system which may be unstable. It is shown that the optimal control consists of the sum of two terms: the optimal control when no disturbance is present and a term depending on the estimates of the disturbance. Necessary and sufficient conditions for the convergence of the gain matrices is given.

Halyo, N.↗
NASA NTRS1982

A high speed implementation of the random decrement algorithm

The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.

Kiraly, L. J.↗
NASA NTRS1983

A high-speed implementation of the random decrement algorithm

The algorithm is useful for measuring net system damping levels in stochastic processes and for the development of equivalent linearized system response models. The algorithm works by summing together all subrecords which occur after predefined threshold level is crossed. The random decrement signature is normally developed by scanning stored data and adding subrecords together. The high speed implementation of the random decrement algorithm exploits the digital character of sampled data and uses fixed record lengths of 2(n) samples to greatly speed up the process. The contributions to the random decrement signature of each data point was calculated only once and in the same sequence as the data were taken. A hardware implementation of the algorithm using random logic is diagrammed and the process is shown to be limited only by the record size and the threshold crossing frequency of the sampled data. With a hardware cycle time of 200 ns and 1024 point signature, a threshold crossing frequency of 5000 Hertz can be processed and a stably averaged signature presented in real time.

Kiraly, L. J.↗
DOE OSTI2021

Sketching Algorithms in Distributed Systems

In this position paper, we discuss exciting recent advancements in sketching algorithms applied to distributed systems. That is, we look at randomized algorithms that simultaneously reduce the data dimensionality, offer potential privacy benefits, while maintaining verifiably high levels of algorithm accuracy and performance in multi-node computational setups. We look at next steps and discuss the applicability to real systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Multi-beam range imager for autonomous operations

For space operations from the Space Station Freedom the real time range imager will be very valuable in terms of refuelling, docking as well as space exploration operations. For these applications as well as many other robotics and remote ranging applications, a small potable, power efficient, robust range imager capable of a few tens of km ranging with 10 cm accuracy is needed. The system developed is based on a well known pseudo-random modulation technique applied to a laser transmitter combined with a novel range resolution enhancement technique. In this technique, the transmitter is modulated by a relatively low frequency of an order of a few MHz to enhance the signal to noise ratio and to ease the stringent systems engineering requirements while accomplishing a very high resolution. The desired resolution cannot easily be attained by other conventional approaches. The engineering model of the system is being designed to obtain better than 10 cm range accuracy simply by implementing a high precision clock circuit. In this paper we present the principle of the pseudo-random noise (PN) lidar system and the results of the proof of experiment.

Marzwell, Neville I.↗
DOE OSTI2022

GANISP: A GAN-Assisted Importance Splitting Probability Estimator

Designing manufacturing processes with high yield and strong reliability relies on effective methods for rare event estimation. Genealogical importance splitting reduces the variance of rare event probability estimators by iteratively selecting and replicating realizations that are headed towards a rare event. The replication step is difficult when applied to deterministic systems where the initial conditions of the offspring realizations need to be modified. Typically, a random perturbation is applied to the offspring to differentiate their trajectory from the parent realization. However, this random perturbation strategy may be effective for some systems while failing for others, preventing variance reduction in the probability estimate. This work seeks to address this limitation using a generative model such as a Generative Adversarial Network (GAN) to generate perturbations that are consistent with the attractor of the dynamical system. The proposed GAN-assisted Importance SPlitting method (GANISP) improves the variance reduction for the system targeted. An implementation of the method is available in a companion repository (https://github.com/NREL/GANISP).

generative adversarial network↗
DOE OSTI2022

GANISP: A GAN-Assisted Importance Splitting Probability Estimator: Preprint

To reduce the variance of rare event probability estimator, genealogical importance splitting marches towards a rare event by iteratively selecting and replicating realizations that are headed towards a rare event. The replication step is made difficult when applied to deterministic systems as the initial conditions of the offspring realizations need to be modified. Typically, a random perturbation is applied to the offspring to differentiate their trajectory from the parent realization. It is shown that a random perturbation strategy may be effective for some systems but may also fail for others, thereby preventing variance reduction in the probability estimate. To address this limitation, it is proposed to use a generative model such as a Generative Adversarial Network (GAN) to generate perturbations that are consistent with the attractor of the dynamical system. The GAN-assisted Importance SPlitting method (GANISP) improves the variance reduction for the system targeted. An implementation of the method is available in a companion repository (https://github.com/NREL/GANISP).

generative adversarial network↗