Search NASA⌕ Search

SEARCH · Search NASA

Results for “Markov Chain”

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

On reliable control system designs

A mathematical model for use in the design of reliable multivariable control systems is discussed with special emphasis on actuator failures and necessary actuator redundancy levels. The model consists of a linear time invariant discrete time dynamical system. Configuration changes in the system dynamics are governed by a Markov chain that includes transition probabilities from one configuration state to another. The performance index is a standard quadratic cost functional, over an infinite time interval. The actual system configuration can be deduced with a one step delay. The calculation of the optimal control law requires the solution of a set of highly coupled Riccati-like matrix difference equations. Results can be used for off-line studies relating the open loop dynamics, required performance, actuator mean time to failure, and functional or identical actuator redundancy, with and without feedback gain reconfiguration strategies.

Birdwell, J. D.↗

A general cratering-history model and its implications for the lunar highlands

Through analysis of a large number of Monte Carlo and Markov Chain simulations, a model for determining crater accumulation and crater obliteration histories has been derived. The model generally applies to populations of large craters. It predicts that the following relationships hold for subequilibrium-density crater populations: (1) the more negative the production function's exponent, alpha (N near D super alpha) the lower the crater density at which the population size-frequency distribution will significantly depart from its production function; (2) the more negative the production function's exponent, the less obliteration a crater population will sustain after a set number of impacts. Application of the model to the lunar highlands implies (1) the production function for the large craters is highly structured, resembling the observed size-frequency distribution and not the function N near D to the -2; (2) even the densely cratered highlands have not attained crater saturation or equilibrium. Direct simulations of the highlands' crater population supports the model's implications.

Woronow, A.↗

Numerical methods for problems involving the Drazin inverse

The objective was to try to develop a useful numerical algorithm for the Drazin inverse and to analyze the numerical aspects of the applications of the Drazin inverse relating to the study of homogeneous Markov chains and systems of linear differential equations with singular coefficient matrices. It is felt that all objectives were accomplished with a measurable degree of success.

Meyer, C. D., Jr.↗

Extensions to the classical calculation of the effect of mutual shadowing in diffuse reflection

The classical method for accounting for the mutual shadowing among closely packed particles in multiple scattering calculations is extended in the following ways. (1) By modeling the particle distribution by a Poisson process with a varying density parameter, a 'Van der Waals' type approximation allows extension to a greater fractional volume density, D. In this case it is only required that D squared be much less than 1 instead of D being much less than 1. (2) In the case that the particle distribution is not uniform the classical calculation may be weighted by the pair correlation function of the distribution. (3) The use of the Markov chain formalism for radiative transfer allows inclusion of the effect of shadowing for two orders of scattering. For conditions such as might apply in Saturn's rings, the inclusion of this effect makes less than a 0.1% difference in the calculated phase curves, compared to previous calculations which have included shadowing only in the first scattering. The latter are thus shown to be quite accurate.

Esposito, L. W.↗

Use of generalized population ratios to obtain Fe XV line intensities and linewidths at high electron densities

A generalized method for obtaining individual level population ratios is used to obtain relative intensities of extreme ultraviolet Fe XV emission lines in the range 284-500 A, which are density dependent for electron densities in the tokamak regime or higher. Four lines in particular are found to attain quite high intensities in the high-density limit. The same calculation provides inelastic contributions to linewidths. The method connects level populations and level widths through total probabilities t(ij), related to 'taboo' probabilities of Markov chain theory. The t(ij) are here evaluated for a real atomic system, being therefore of potential interest to random-walk theorists who have been limited to idealized systems characterized by simplified transition schemes.

Kastner, S. O.↗

Investigation of air transportation technology at Ohio University, 1980

Specific configurations of first and second order all digital phase locked loops were analyzed for both ideal and additive gaussian noise inputs. In addition, a design for a hardware digital phase locked loop capable of either first or second order operation was evaluated along with appropriate experimental data obtained from testing of the hardware loop. All parameters chosen for the analysis and the design of the digital phase locked loop were consistent with an application to an Omega navigation receiver although neither the analysis nor the design are limited to this application. For all cases tested, the experimental data showed close agreement with the analytical results indicating that the Markov chain model for first and second order digital phase locked loops are valid.

Mcfarland, R. H.↗

A tutorial on the CARE III approach to reliability modeling

The CARE 3 reliability model for aircraft avionics and control systems is described by utilizing a number of examples which frequently use state-of-the-art mathematical modeling techniques as a basis for their exposition. Behavioral decomposition followed by aggregration were used in an attempt to deal with reliability models with a large number of states. A comprehensive set of models of the fault-handling processes in a typical fault-tolerant system was used. These models were semi-Markov in nature, thus removing the usual restrictions of exponential holding times within the coverage model. The aggregate model is a non-homogeneous Markov chain, thus allowing the times to failure to posses Weibull-like distributions. Because of the departures from traditional models, the solution method employed is that of Kolmogorov integral equations, which are evaluated numerically.

Trivedi, K. S.↗

On the delay analysis of a TDMA channel with finite buffer capacity

The throughput performance of a TDMA channel with finite buffer capacity for transmitting data messages is considered. Each station has limited message buffer capacity and has Poisson message arrivals. Message arrivals will be blocked if the buffers are congested. Using the embedded Markov chain model, the solution procedure for the limiting system-size probabilities is presented in a recursive fashion. Numerical examples are given to demonstrate the tradeoffs between the blocking probabilities and the buffer sizing strategy.

Yan, T.-Y.↗

Control of a heterogeneous two-server exponential queueing system

A dynamic control policy known as 'threshold queueing' is defined for scheduling customers from a Poisson source on a set of two exponential servers with dissimilar service rates. The slower server is invoked in response to instantaneous system loading as measured by the length of the queue of waiting customers. In a threshold queueing policy, a specific queue length is identified as a 'threshold,' beyond which the slower server is invoked. The slower server remains busy until it completes service on a customer and the queue length is less than its invocation threshold. Markov chain analysis is employed to analyze the performance of the threshold queueing policy and to develop optimality criteria. It is shown that probabilistic control is suboptimal to minimize the mean number of customers in the system. An approximation to the optimum policy is analyzed which is computationally simple and suffices for most operational applications.

Larsen, R. L.↗

Design of the hybrid automated reliability predictor

The design of the Hybrid Automated Reliability Predictor (HARP), now under development at Duke University, is presented. The HARP approach to reliability prediction is characterized by a decomposition of the overall model into fault-occurrence and fault-handling sub-models. The fault-occurrence model is a non-homogeneous Markov chain which is solved analytically, while the fault-handling model is a Petri Net which is simulated. HARP provides automated analysis of sensitivity to uncertainties in the input parameters and in the initial state specifications. It then produces a predicted reliability band as a function of mission time, as well as estimates of the improvement (narrowing of the band) to be gained by a specified amount of reduction in uncertainty.

Geist, R.↗

Vector computer memory bank contention

A number of vector supercomputers feature very large memories. Unfortunately the large capacity memory chips that are used in these computers are much slower than the fast central processing unit (CPU) circuitry. As a result, memory bank reservation times (in CPU ticks) are much longer than on previous generations of computers. A consequence of these long reservation times is that memory bank contention is sharply increased, resulting in significantly lowered performance rates. The phenomenon of memory bank contention in vector computers is analyzed using both a Markov chain model and a Monte Carlo simulation program. The results of this analysis indicate that future generations of supercomputers must either employ much faster memory chips or else feature very large numbers of independent memory banks.

Bailey, D. H.↗

Computer simulation of surface and film processes

All the investigations which were performed employed in one way or another a computer simulation technique based on atomistic level considerations. In general, three types of simulation methods were used for modeling systems with discrete particles that interact via well defined potential functions: molecular dynamics (a general method for solving the classical equations of motion of a model system); Monte Carlo (the use of Markov chain ensemble averaging technique to model equilibrium properties of a system); and molecular statics (provides properties of a system at T = 0 K). The effects of three-body forces on the vibrational frequencies of triatomic cluster were investigated. The multilayer relaxation phenomena for low index planes of an fcc crystal was analyzed also as a function of the three-body interactions. Various surface properties for Si and SiC system were calculated. Results obtained from static simulation calculations for slip formation were presented. The more elaborate molecular dynamics calculations on the propagation of cracks in two-dimensional systems were outlined.

Tiller, W. A.↗

Vector computer memory bank contention

A number of vector supercomputers feature very large memories. Unfortunately the large capacity memory chips that are used in these computers are much slower than the fast central processing unit (CPU) circuitry. As a result, memory bank reservation times (in CPU ticks) are much longer than on previous generations of computers. A consequence of these long reservation times is that memory bank contention is sharply increased, resulting in significantly lowered performance rates. The phenomenon of memory bank contention in vector computers is analyzed using both a Markov chain model and a Monte Carlo simulation program. The results of this analysis indicate that future generations of supercomputers must either employ much faster memory chips or else feature very large numbers of independent memory banks.

Bailey, David H.↗

Statistics and dynamics of persistent anomalies

Persistent anomalies with recurrent spatial patterns play an important role in the atmosphere's low-frequency variability. A connection between statistical and dynamical methods of description and prediction of persistent anomalies is established by computing and analyzing the empirical orthogonal functions (EOFs) in a simple deterministic model, on the one hand, and in Southern Hemisphere geopotential heights, on the other. The dynamical model is governed by the fully nonlinear, equivalent-barotropic vorticity equation on the sphere, with simplified forcing, dissipation and topography. The Southern Hemisphere data consist in gridded daily maps of 500 mb heights from June 1972 to July 1983. Two types of persistent anomalies appear in this time series, both having a strong wavenumber-three component; they differ by the value of the constant phase of this wave and by the strength of the wavenumber-one component. The first two EOFs bear a striking resemblance to these two patterns. It is concluded that the dynamical interpretation of EOFs is their pointing from the time mean to the most populated regions of the system's phase space. Pursuing this interpretation, a Markov-chain formulation of transitions from one persistent anomaly regime to another is introduced, and the implications for long-range forecasting are discussed.

Mo, Kingtse C.↗

Probabilistic modeling of solar power systems

The author presents a probabilistic approach based on Markov chain theory to model stand-alone photovoltaic power systems and predict their long-term service performance. The major advantage of this approach is that it allows designers and developers of these systems to analyze the system performance as well as the battery subsystem performance in the long run and determine the system design requirements that meet a specified service performance level. The methodology presented is illustrated by using data for a radio repeater system for the Boston, Massachusetts, location.

Safie, Fayssal M.↗

Load sharing in distributed real-time systems with state-change broadcasts

A decentralized dynamic load-sharing (LS) method based on state-change broadcasts is proposed for a distributed real-time system. Whenever the state of a node changes from underloaded to fully loaded and vice versa, the node broadcasts this change to a set of nodes, called a buddy set, in the system. The performance of the method is evaluated with both analytic modeling and simulation. It is modeled first by an embedded Markov chain for which numerical solutions are derived. The model solutions are then used to calculate the distribution of queue lengths at the nodes and the probability of meeting task deadlines. The analytical results show that buddy sets of 10 nodes outperform those of less than 10 nodes, and the incremental benefit gained from increasing the buddy set size beyond 15 nodes is insignificant. These and other analytical results are verified by simulation. The proposed LS method is shown to meet task deadlines with a very high probability.

Shin, Kang G.↗

Solving problems by interrogating sets of knowledge systems: Toward a theory of multiple knowledge systems

The main purpose is to develop a theory for multiple knowledge systems. A knowledge system could be a sensor or an expert system, but it must specialize in one feature. The problem is that we have an exhaustive list of possible answers to some query (such as what object is it). By collecting different feature values, in principle, it should be possible to give an answer to the query, or at least narrow down the list. Since a sensor, or for that matter an expert system, does not in most cases yield a precise value for the feature, uncertainty must be built into the model. Also, researchers must have a formal mechanism to be able to put the information together. Researchers chose to use the Dempster-Shafer approach to handle the problems mentioned above. Researchers introduce the concept of a state of recognition and point out that there is a relation between receiving updates and defining a set valued Markov Chain. Also, deciding what the value of the next set valued variable is can be phrased in terms of classical decision making theory such as minimizing the maximum regret. Other related problems are examined.

Dekorvin, Andre↗

A numerical model of the Uranian dust rings

The present numerical simulations of the Uranian rings discovered by Voyager 2 indicate that they may be the visible component of low optical depth moonlet belts made up of 10 to 100,000 cm objects; these objects would serve as the sources of dust, via both micrometeoroid bombardment and the collisional release of ejecta. It is proposed that the dust bands are generated by continuous ejection and reabsorption of micron-scale regolith material within the hypothesized moolet belts, and it is noted that numerical simulations of such a system in a Markov-chain formalism can reproduce Uranian dust ring characteristics.

Colwell, Joshua E.↗