Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Probabilistic models”

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 289 records · Page 16
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Low-energy Electron-track Imaging for a Liquid Argon Time-projection-chamber Telescope Concept Using Probabilistic Deep Learning

The GammaTPC is an MeV-scale single-phase liquid argon time-projection-chamber gamma-ray telescope concept with a novel dual-scale pixel-based charge-readout system. It promises to enable a significant improvement in sensitivity to MeV-scale gamma rays over previous telescopes. The novel pixel-based charge readout allows for imaging of the tracks of electrons scattered by Compton interactions of incident gamma rays. The two primary contributors to the accuracy of a Compton telescope in reconstructing an incident gamma-ray’s original direction are its energy and position resolution. In this work, we focus on using deep learning to optimize the reconstruction of the initial position and direction of electrons scattered in Compton interactions, including using probabilistic models to estimate predictive uncertainty. We show that the deep-learning models are able to predict locations of Compton scatters of MeV-scale gamma rays from simulated 500 μm pixel-based data to better than 1 mm rms error and are sensitive to the initial direction of the scattered electron. We compare and contrast different deep-learning uncertainty estimation algorithms for reconstruction applications. Additionally, we show that event-by-event estimates of the uncertainty of the locations of the Compton scatters can be used to select those events that were reconstructed most accurately, leading to improvement in locating the origin of gamma-ray sources on the sky.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

CSP Design Study for Sandia National Laboratories and Kirtland Air Force Base

This report provides a design study to produce 100% carbon-free electricity for Sandia NM and Kirtland Air Force Base (KAFB) using concentrating solar power (CSP). CSP plant designs of 50 MW and 100 MW are assessed to meet the electricity needs of Sandia NM and/or KAFB. Probabilistic modeling is performed to evaluate inherent uncertainties in performance and cost parameters on total construction costs and the levelized cost of electricity. Estimated annual electricity production was ~200 – 300 GWh for the 50 MW plant and ~400 – 700 GWh for the 100 MW plant. The overnight construction costs ranged between ~$300M - $400M for the 50 MW CSP plant and between ~$500M - $800M for the 100 MW CSP plant. The heliostat field was the most significant subsystem cost, followed by the thermal energy storage, power cycle, and fixed operation and maintenance costs. Other considerations such as land availability and permitting, funding options, and interconnections are discussed.

Ho, Clifford K.↗
NASA NTRS1965

On time changes in a digraph.

Probabilistic model for analyzing changes through time in binary dyadic relation on finite set of points

PROBABILITY THEORY↗
NASA NTRS1975

The probability of a correct output from a combinational circuit

The paper discusses two methods to evaluate the signal reliability of the output of logical circuits. It is known that faults present in a circuit will not always cause the output of the circuit to be incorrect. The first method evaluates the contribution of each fault to the reliability of the circuit and requires the enumeration of the behavior of each fault in the entire fault set. The use of McCluskey and Clegg's characterization of faulty networks by evaluating the functional equivalence classes of the network is a way to reduce the amount of computation involved. The second method uses a probabilistic model of logical circuits and consists of straightforward operations which can easily be automated. The method also yields the signal reliability and has the capability of very easily specifying the individual fault probabilities of all the circuit lines independently.

Ogus, R. C.↗
NASA NTRS1974

Mixing of the lunar regolith

A probabilistic model for mixing and turnover rates for the lunar regolith due to meteoritic impact is presented and evaluated using results from laboratory impact experiments and estimated meteoritic fluxes. The upper millimeter of the lunar surface is shown to be the primary mixing zone in the regolith and an important source for impact melts and vapors. Below this 'mixing layer' the rate of mixing and turnover decreases very rapidly with increasing depth, consistent with well-preserved stratigraphy and resident times deduced from deep drill core tube samples.

Gault, D. E.↗
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.↗