Search NASA⌕ Search

SEARCH · Search NASA

Results for “probabilistic model”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS1975

Cratering and cosmogenic nuclides

A simple probabilistic model was constructed for the average value of a cosmogenic nuclide as a function of depth in a regolith. An arbitrary function was chosen for the size distribution of craters. The resulting integro-differential equation was found to reduce in limiting cases to the marching equation with a characteristic residence time and to the diffusion equation. The regolith diffusion constant is shown to be a simple integral of the cratering rate weighted by geometrical terms. This formal treatment provides a direct and general connection between cosmogenic nuclides and cratering rates and crater population in a simple analytical form. The validity of this model remains to be tested.

Blake, M. L.↗
NASA NTRS1979

Learning with imperfectly labeled patterns

The problem of learning in pattern recognition using imperfectly labeled patterns is considered. The performance of the Bayes and nearest neighbor classifiers with imperfect labels is discussed using a probabilistic model for the mislabeling of the training patterns. Schemes for training the classifier using both parametric and non parametric techniques are presented. Methods for the correction of imperfect labels were developed. To gain an understanding of the learning process, expressions are derived for success probability as a function of training time for a one dimensional increment error correction classifier with imperfect labels. Feature selection with imperfectly labeled patterns is described.

Chittineni, C. B.↗
NASA NTRS1982

Analysis of backward error recovery for concurrent processes with recovery blocks

Three different methods of implementing recovery blocks (RB's). These are the asynchronous, synchronous, and the pseudo recovery point implementations. Pseudo recovery points so that unbounded rollback may be avoided while maintaining process autonomy are proposed. Probabilistic models for analyzing these three methods under standard assumptions in computer performance analysis, i.e., exponential distributions for related random variables were developed. The interval between two successive recovery lines for asynchronous RB's mean loss in computation power for the synchronized method, and additional overhead and rollback distance in case PRP's are used were estimated.

Shin, K. G.↗
NASA NTRS1984

A robust pseudo-inverse spectral filter applied to the Earth Radiation Budget Experiment (ERBE) scanning channels

Computer simulations of a least squares estimator operating on the ERBE scanning channels are discussed. The estimator is designed to minimize the errors produced by nonideal spectral response to spectrally varying and uncertain radiant input. The three ERBE scanning channels cover a shortwave band a longwave band and a ""total'' band from which the pseudo inverse spectral filter estimates the radiance components in the shortwave band and a longwave band. The radiance estimator draws on instantaneous field of view (IFOV) scene type information supplied by another algorithm of the ERBE software, and on a priori probabilistic models of the responses of the scanning channels to the IFOV scene types for given Sun scene spacecraft geometry. It is found that the pseudoinverse spectral filter is stable, tolerant of errors in scene identification and in channel response modeling, and, in the absence of such errors, yields minimum variance and essentially unbiased radiance estimates.

Avis, L. M.↗
NASA NTRS1984

Statistics and thermodynamics of fracture

A probabilistic model of the fracture processes unifying the phenomenological study of long term strength of materials, fracture mechanics and statistical approaches to fracture is briefly outlined. The general framework of irreversible thermodynamics is employed to model the deterministic side of the failure phenomenon. The stochastic calculus is used to account for thg failure mechanisms controlled by chance; particularly, the random roughness of fracture surfaces.

Chudnovsky, A.↗
NASA NTRS1986

Dynamic remapping decisions in multi-phase parallel computations

The effectiveness of any given mapping of workload to processors in a parallel system is dependent on the stochastic behavior of the workload. Program behavior is often characterized by a sequence of phases, with phase changes occurring unpredictably. During a phase, the behavior is fairly stable, but may become quite different during the next phase. Thus a workload assignment generated for one phase may hinder performance during the next phase. We consider the problem of deciding whether to remap a paralled computation in the face of uncertainty in remapping's utility. Fundamentally, it is necessary to balance the expected remapping performance gain against the delay cost of remapping. This paper treats this problem formally by constructing a probabilistic model of a computation with at most two phases. We use stochastic dynamic programming to show that the remapping decision policy which minimizes the expected running time of the computation has an extremely simple structure: the optimal decision at any step is followed by comparing the probability of remapping gain against a threshold. This theoretical result stresses the importance of detecting a phase change, and assessing the possibility of gain from remapping. We also empirically study the sensitivity of optimal performance to imprecise decision threshold. Under a wide range of model parameter values, we find nearly optimal performance if remapping is chosen simply when the gain probability is high. These results strongly suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change; precise quantification of the decision model parameters is not necessary.

Nicol, D. M.↗
NASA NTRS1987

Investigation of air transportation technology at Massachusetts Institute of Technology, 1984

Three projects sponsored by the Joint University Program at MIT are summarized. Two projects were focussed on the potential application of Loran-C in flying nonprecision approaches to general aviation runways, and the third project involved research on aircraft icing. In one Loran-C project, Aircraft Approach Guidance Using Relative Loran-C Navigation, the concept was flight tested. It used the difference in TD's from those of the touchdown point to simplify and speed navigation computer processing and took advantage of the short term accuracy of less than 100 feet for Loran-C. The goal of the project, Probabilistic Modelling of Loran-C Error for Nonprecision Approaches, was to develop a mathematical model which would predict the probability that an approach flown to a runway with a particular Loran-C receiver would fall within a given standard. The Aircraft Icing project focussed on measurement of droplet trajectories and droplet impingement/runback characteristics and measurement of real time ice accretion using ultrasonic pulse echo techniques.

Simpson, Robert W.↗
NASA NTRS1987

Optimal dynamic remapping of parallel computations

A large class of computations are characterized by a sequence of phases, with phase changes occurring unpredictably. The decision problem was considered regarding the remapping of workload to processors in a parallel computation when the utility of remapping and the future behavior of the workload is uncertain, and phases exhibit stable execution requirements during a given phase, but requirements may change radically between phases. For these problems a workload assignment generated for one phase may hinder performance during the next phase. This problem is treated formally for a probabilistic model of computation with at most two phases. The fundamental problem of balancing the expected remapping performance gain against the delay cost was addressed. Stochastic dynamic programming is used to show that the remapping decision policy minimizing the expected running time of the computation has an extremely simple structure. Because the gain may not be predictable, the performance of a heuristic policy that does not require estimnation of the gain is examined. The heuristic method's feasibility is demonstrated by its use on an adaptive fluid dynamics code on a multiprocessor. The results suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change. The results also suggest that this heuristic is applicable to computations with more than two phases.

Nicol, David M.↗
NASA NTRS1989

An improved correction algorithm for number density measurements made with the forward scattering spectrometer probe

A correction factor to the number density measured by the Forward Scattering Spectrometer Probe (FSSP) which compensates for dead time and coincidence errors was determined by calculating the probabilities of, and the average number of particles in, the six possible types of dead time and coincidence events. These probabilities and averages were calculated by means of a probabilistic model based on Poisson statistics. A Monte Carlo computer simulation of the FSSP operation was also carried out and the number density correction factor was compared with the Monte Carlo data. For an actual number density of 2000/cu cm, it was found that the measured number density was of the order of 300/cu cm.

Lock, James A.↗
NASA NTRS1989

The Space Station Freedom evolution-phase - Crew-EVA demand for robotic substitution by task primitive

Space Station Freedom represents a significant demand for automation and robotics services as substitutes for crew EVAs. Results are reported from a study aimed at identifying the demand for crew EVA and the crew-task primitive distributions derived for input to future robotic substitution studies. Generic EVA tasks are developed from historical EVA mission timelines, and a set of 70 task primitives defined. The generic task activities are partitioned into task setup, kernel, and tear-down, with standardized task times and frequencies. These standardized times are coupled with inputs from numerous mission data bases in a probabilistic simulation to obtain estimates of total crew-EVA task time demand by crew task primitive. The use of probabilistic model is found to be crucial for understanding, isolating, and addressing the large uncertainties in the EVA task kernels.

Smith, Jeffrey H.↗
NASA NTRS1990

An analysis of scatter decomposition

A formal analysis of a powerful mapping technique known as scatter decomposition is presented. Scatter decomposition divides an irregular computational domain into a large number of equal sized pieces, and distributes them modularly among processors. A probabilistic model of workload in one dimension is used to formally explain why, and when scatter decomposition works. The first result is that if correlation in workload is a convex function of distance, then scattering a more finely decomposed domain yields a lower average processor workload variance. The second result shows that if the workload process is stationary Gaussian and the correlation function decreases linearly in distance until becoming zero and then remains zero, scattering a more finely decomposed domain yields a lower expected maximum processor workload. Finally it is shown that if the correlation function decreases linearly across the entire domain, then among all mappings that assign an equal number of domain pieces to each processor, scatter decomposition minimizes the average processor workload variance. The dependence of these results on the assumption of decreasing correlation is illustrated with situations where a coarser granularity actually achieves better load balance.

Nicol, David M.↗
NASA NTRS1989

A Boltzmann machine for the organization of intelligent machines

In the present technological society, there is a major need to build machines that would execute intelligent tasks operating in uncertain environments with minimum interaction with a human operator. Although some designers have built smart robots, utilizing heuristic ideas, there is no systematic approach to design such machines in an engineering manner. Recently, cross-disciplinary research from the fields of computers, systems AI and information theory has served to set the foundations of the emerging area of the design of intelligent machines. Since 1977 Saridis has been developing an approach, defined as Hierarchical Intelligent Control, designed to organize, coordinate and execute anthropomorphic tasks by a machine with minimum interaction with a human operator. This approach utilizes analytical (probabilistic) models to describe and control the various functions of the intelligent machine structured by the intuitively defined principle of Increasing Precision with Decreasing Intelligence (IPDI) (Saridis 1979). This principle, even though resembles the managerial structure of organizational systems (Levis 1988), has been derived on an analytic basis by Saridis (1988). The purpose is to derive analytically a Boltzmann machine suitable for optimal connection of nodes in a neural net (Fahlman, Hinton, Sejnowski, 1985). Then this machine will serve to search for the optimal design of the organization level of an intelligent machine. In order to accomplish this, some mathematical theory of the intelligent machines will be first outlined. Then some definitions of the variables associated with the principle, like machine intelligence, machine knowledge, and precision will be made (Saridis, Valavanis 1988). Then a procedure to establish the Boltzmann machine on an analytic basis will be presented and illustrated by an example in designing the organization level of an Intelligent Machine. A new search technique, the Modified Genetic Algorithm, is presented and proved to converge to the minimum of a cost function. Finally, simulations will show the effectiveness of a variety of search techniques for the intelligent machine.

Moed, Michael C.↗
NASA NTRS1990

Optimal dynamic remapping of data parallel computations

A large class of data parallel computations is characterized by a sequence of phases, with phase changes occurring unpredictably. Dynamic remapping of the workload to processors may be required to maintain good performance. The problem considered, for which the utility of remapping and the future behavior of the workload are uncertain, arises when phases exhibit stable execution requirements during a given phase, but requirements change radically between phases. For these situations, a workload assignment generated for one phase may hinder performance during the next phase. This problem is treated formally for a probabilistic model of computation with at most two phases. The authors address the fundamental problem of balancing the expected remapping performance gain against the delay cost, and they derive the optimal remapping decision policy. The promise of the approach is shown by application to multiprocessor implementations of an adaptive gridding fluid dynamics program and to a battlefield simulation program.

Nicol, David M.↗
NASA NTRS1989

A probabilistic approach to crack instability

A probabilistic model of brittle fracture is examined with reference to two-dimensional problems. The model is illustrated by using experimental data obtained for 25 macroscopically identical specimens made of short-fiber-reinforced composites. It is shown that the model proposed here provides a predictive formalism for the probability distributions of critical crack depth, critical loads, and crack arrest depths. It also provides similarity criteria for small-scale testing.

Chudnovsky, A.↗
NASA NTRS1990

A methodology for evaluating the reliability and risk of structures under complex service environments

The theoretical basis and numerical implementation of NESSUS (Numerical Evaluation of Stochastic Structures Under Stress), a computer code for probabilistic structural analysis of aerospace components, are described, with an emphasis on the use of NESSUS for reliability and risk assessment. Topics addressed include the structure of probabilistic models of fatigue-crack initiation, risk/cost evaluation, fatigue-fracture analysis, and fatigue-crack initiation. Numerical results from typical applications are presented in graphs and briefly characterized. The usefulness of NESSUS predictions for establishing inspection and retirement schedules and for component certification is indicated.

Shiao, Michael C.↗
NASA NTRS1990

A Boltzmann machine for the organization of intelligent machines

A three-tier structure consisting of organization, coordination, and execution levels forms the architecture of an intelligent machine using the principle of increasing precision with decreasing intelligence from a hierarchically intelligent control. This system has been formulated as a probabilistic model, where uncertainty and imprecision can be expressed in terms of entropies. The optimal strategy for decision planning and task execution can be found by minimizing the total entropy in the system. The focus is on the design of the organization level as a Boltzmann machine. Since this level is responsible for planning the actions of the machine, the Boltzmann machine is reformulated to use entropy as the cost function to be minimized. Simulated annealing, expanding subinterval random search, and the genetic algorithm are presented as search techniques to efficiently find the desired action sequence and illustrated with numerical examples.

Moed, Michael C.↗
NASA NTRS1990

Computational technology for flight vehicles; Proceedings of the Symposium on Computational Technology on Flight Vehicles, Washington, DC, Nov. 5-7, 1990

The present conference on computational methods for aeronautics applications discusses topics in the fields of parallel computing, multidisciplinary computational methods, grid generation, visualization methods for CFD, probabilistic modeling, numerical simulations and methodologies for different flow regimes, computational strategies and adaptive methods in CFD, and computational strategies and dynamics and control. Attention is given to the MACH system-software kernel, a multidisciplinary approach to aeroelastic analysis, interactive grid generation with control points, interactive flow visualization using stream surfaces, numerical simulations of dynamic/aerodynamic interactions, implicit mathods for the Navier-Stokes equations, and the automatic phase-space analysis of dynamical systems.

Noor, Ahmed K.↗
NASA NTRS1992

NSTS Orbiter auxiliary power unit turbine wheel cracking risk assessment

The present investigation of turbine-wheel cracking problems in the hydrazine-fueled APU turbine wheel of the Space Shuttle Orbiter's Main Engines has indicated the efficacy of systematic probabilistic risk assessment in flight certification and safety resolution. Nevertheless, real crack-initiation and propagation problems do not lend themselves to purely analytical studies. The high-cycle fatigue problem is noted to generally be unsuited to probabilistic modeling, due to its extremely high degree of intrinsic scatter. In the case treated, the cracks appear to trend toward crack arrest in a low cycle fatigue mode, due to a detuning of the resonance model.

Cruse, T. A.↗