Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Markov process”

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 973 records · Page 54

Uncertainty Quantification with MCMC method and BFBT Data

The reliability of predictions of the system codes is closely related to the validation of their physical models. For example, the accuracy of void fraction prediction in a Boiling Water Reactor (BWR) using TRACE code depends on the uncertainties of closure relations developed for the two-phase flow models. This work focus on quantifying the uncertainties of two physical models, interfacial drag model and subcooled boiling model, using Markov Chain Monte Carlo (MCMC) method and BFBT experimental benchmark data. We applied the MCMC and MLE algorithms to BFBT benchmark data and estimated the uncertainty distribution of two model parameters: subcooled boiling heat transfer coefficient and interfacial drag (bubbly/slug rod bundle) coefficient. These algorithms tend to give various estimation results. Despite the differences in these algorithms, we find that the estimation results are consistent. After obtaining the uncertainty estimates, we validated the uncertainty estimates by applying the estimated distributions of model parameters to TRACE prediction. The new predictions succeed in reducing the void fraction prediction error, but it is not possible to eliminate all prediction error. We are only adjusting two model parameters, and there exists uncertainties in all model parameters. Application of the algorithms to other physical models and experimental data will be helpful for future work. (authors)

42 ENGINEERING↗

Methodological approach to the sensitivity analysis of failure effects in modern digital I and C systems - 136

Modern I and C systems of nuclear power plants increasingly use digital equipment, software-based applications for I and C functions and different types and topologies of communication networks as well. The structure, operation and communication of digital safety-related I and C systems are strongly influenced by the implemented automatic fault detection and fault treatment procedures as barriers against failure propagation. Thus, these I and C systems can change their operating states automatically during the operation time, e.g. due to the detection and correction of certain failure types. Reasonably because of these dynamic properties of digital I and C systems the use of classical fault tree and event tree methods solely for the reliability analysis of modern I and C systems is less suitable. These methods basically apply static models and do not consider the temporal changes of the operating state of the I and C system or equipment appropriately. In this paper, a recently developed approach for the sensitivity analysis of digital I and C systems will be introduced that allows to investigate the dynamic behavior of such systems in cases of internal faults and to quantify the effects on the system reliability. The development and testing of the analysis methodology is carried out using models of generic I and C systems with different typical architectures of stepwise increased complexity. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Assessment of dynamic PRA techniques with industry average component performance data - 208

In the nuclear industry, risk monitors are intended to provide a point-in-time estimate of the system risk given the current plant configuration. Current risk monitors are limited in that they do not properly take into account the deteriorating states of plant equipment, which are unit-specific. Current approaches to computing risk monitors use probabilistic risk assessment (PRA) techniques, but the assessment is typically a snapshot in time. Living PRA models attempt to address limitations of traditional PRA models in a limited sense by including temporary changes in plant and system configurations. However, information on plant component condition is not considered. This often leaves risk monitors using living PRA models incapable of conducting evaluations with dynamic degradation scenarios evolving over time. There is a need to develop enabling approaches to solidify risk monitors to provide time- and condition-dependent risk by integrating traditional PRA models with condition monitoring and prognostic techniques. This paper presents an estimation of system risk evolution over time by integrating plant risk monitoring data with dynamic PRA methods that incorporate aging and degradation. Several online, nondestructive approaches have been developed for diagnosing plant component conditions in the nuclear industry, i.e., using a condition indication index, vibration analysis, current signatures, and operational history . In this work, the component performance measures at U.S. commercial nuclear power plants are incorporated within the dynamic PRA methodologies to provide better estimates of the probability of failures. Aging and degradation are modeled within the Level 1 PRA framework, are applied to several failure modes of pumps, and can be extended to a range of components, namely, valves, generators, batteries, and pipes. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Determining Physical Parameters of Shielded Uranium using Gamma Spectroscopy and the Differential Evolution Adaptive Metropolis (DREAM) Method

Inverse radiation transport is a well-established method for determining unknown parameters within a system that exhibits particle leakage. Two significant challenges of solving inverse transport problems are (1) to determine multiple unknowns without false convergence on local minima and (2) to be able to quantify uncertainty. It was recently demonstrated that the Differential Evolution Adaptive Metropolis (DREAM) method effectively meets both of these challenges. In Bledsoe's 2014 article, the DREAM method was only applied to numerical test cases in which measured data were simulated using MCNP. This paper provides results of research conducted at Oak Ridge National Laboratory (ORNL) in which DREAM was applied to two-dimensional inverse transport problems using real-world measurements. The DREAM method uses a Markov chain Monte Carlo (MCMC) method to obtain a posterior distribution of unknown parameters. In this application, the posterior distribution is determined by using a uniform prior distribution and a likelihood function. The goal of the inverse problem is to find the regions in which the likelihood function is at or near its maximum. In the traditional MCMC approach, a single Markov chain is employed. In practice, MCMC approaches have a high acceptance rate to solutions that are near the current point of sampling, but they exhibit slow convergence to solutions far from the sampling point. The DREAM algorithm was designed to alleviate this issue by initiating multiple Markov chains and using the differential evolution algorithm to generate trial points for each chain. Solving for the mass of radioactive material within a voluminous source is a challenging problem for gamma-ray spectroscopy. Inverse gamma-ray transport can supply a range of possible material compositions, but reducing the differences between predicted and actual measurements can lead to false results. DREAM is a rapid technique for determining the most likely solution for several unknown parameters in an inverse transport problem. This work applies DREAM to a series of gamma spectroscopy experiments performed at ORNL.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Application of Polynomial Chaos Expansion in One-Dimensional Inverse Transport Problems

In the problem of inverse radiation transport, measurements of particle leakages from radioactive source/shield systems are used to infer unknown parameters within the systems. This reconstruction can be accomplished by finding the physical parameters of the unknown system that minimize the difference between calculated detector responses and measured detector responses. The inverse transport solver should also propagate uncertainties from the detector responses to the reconstructed parameter values. Recently, the Differential Evolution Adaptive Metropolis (DREAM) method was shown to be a robust method for uncertainty quantification in inverse problems. The DREAM method uses the differential evolution algorithm to choose efficient steps in a Markov chain Monte Carlo (MCMC) simulation. Although the DREAM method has been shown to be more efficient than traditional MCMC approaches, it still requires thousands of transport computations to accurately quantify uncertainty. For the simple ray-tracing model, it was possible to perform these calculations in a reasonable amount of time (under an hour). However, inverse transport problems that require computationally-intensive transport solvers will need prohibitively long run times when using the DREAM method. A way to overcome the computational burden of the DREAM method is to perform surrogate modeling using the polynomial chaos expansion (PCE) approach. It was recently shown that the PCE method provides both accurate and computationally inexpensive uncertainty quantification in forward radiation source/shield problems. PCE was also recently applied to an inverse problem in nonlinear point reactor kinetics within a standard MCMC approach. PCE was first used with the DREAM method where it was applied to inverse problems in groundwater modeling.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Kriging-Based Inverse Uncertainty Quantification of BISON Fission Gas Release Model

Nuclear reactor fuel performance analysis studies the thermo-mechanical behavior of fuel rods and verify their compliance with safety criteria under both normal operation and accidental conditions. One of the major concerns in fuel performance analysis is the behavior of the fission gases xenon and krypton in uranium dioxide fuel, which significantly affect the thermo-mechanical performance of the nuclear fuel rods employed in current LWRs. Previously, the modeling of fission gas release (FGR) in nuclear fuel performance codes have been relying on empirical models which are not applicable beyond their range of calibration. Recently a more efficient and flexible physics-based FGR and swelling model that can describe a wider range of reactor operation conditions have been implemented in fuel performance code BISON. In this work, we performed Bayesian calibration to inversely quantify the uncertainties associated with the 5 tuning parameters in BISON FGR model, based on the time-dependent FGR measurement data from Riso-AN3 benchmark. It takes around 1 hour and 40 minutes for BISON to simulate the Riso-AN3 benchmark with a moderate mesh size using 32 processors. As hundreds of thousands of BISON simulations are needed during Markov Chain Monte Carlo (MCMC) sampling, running BISON directly is not a viable solution. Therefore we propose to use Kriging-based metamodels to replace BISON during MCMC sampling. Surrogate model is an approximation of the input/output relation of a computer code/model. It is also called metamodel, response surface, emulator. Surrogate models usually take much less computational time than the original model (like BISON) while maintaining the input/output relation of the original model to a desirable accuracy. Constructing the metamodels normally requires small number of executions of the original model. Once validated, metamodels can be used to perform uncertainty and sensitivity analysis, Bayesian calibration, optimization, etc.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Testing the Delayed Gamma Capability in MCNP6 - Paper 86

The mission of the Domestic Nuclear Detection Office (DNDO) is to quickly and reliably detect unauthorized attempts to import or transport special nuclear material (SNM) for use against the United States. Developing detection equipment to meet this objective requires accurate simulation of both the detectable signature and detection mechanism. MCNP6 is capable of transporting the various types of radiation encountered in these scenarios; however, the accuracy of MCNP6 must be quantified such that we can be confident in the results of the simulations. Delayed gamma transport is one important component of these detection scenarios. Delayed gamma transport is defined as the combination of gamma emission from radioactive and subsequent transport through matter. MCNP always possessed the ability to emit delayed neutrons from fission; however, these delayed neutron spectra and intensity were functional fits and not directly sampled from the created fission products. Furthermore, there existed no method to emit the decay photons from radioactive fission products (or any radioactive nucleus) A delayed particle capability was initially added to MCNPX 2.6.A in 2005 to sample the radioactive fission product parents and emit decay particles resulting from the decay chain. At the point of capture, a residual nucleus is created and decayed using the CINDER90 depletion code. MCNP only sends CINDER90 a residual radioactive nucleus and not a flux (i.e. capture rate). As a result, the Bateman equations for the solution are coupled first order differential equations with constant coefficients. Theoretically, these equations could be solved analytically; however, CINDER90 employs a numerical Markov linear chain scheme to solve these equations. This paper addresses a more simplified approach to benchmarking in order to best assess: (1) whether or not deficiencies exist in the current methodology for certain types of decay chains; and (2) paths forward for improving the delayed particle emission capability. We utilize closed form analytic solutions to the granddaughter equations for particular sets of isotope systems to compare the accuracy of the delayed gamma capability in MCNP6. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Diagnosing undersampling in Monte Carlo eigenvalue and flux tally estimates - 14515

This study explored the impact of undersampling on the accuracy of tally estimates in Monte Carlo (MC) calculations. Steady-state MC simulations were performed for models of several critical systems with varying degrees of spatial and isotopic complexity, and the impact of undersampling on eigenvalue and fuel pin flux/fission estimates was examined. This study observed biases in MC eigenvalue estimates as large as several percent and biases in fuel pin flux/fission tally estimates that exceeded tens, and in some cases hundreds, of percent. This study also investigated five statistical metrics for predicting the occurrence of undersampling biases in MC simulations. Three of the metrics (the Heidelberger-Welch RHW, the Geweke Z-Score, and the Gelman-Rubin diagnostics) are commonly used for diagnosing the convergence of Markov chains, and two of the methods (the Contributing Particles per Generation and Tally Entropy) are new convergence metrics developed in the course of this study. These metrics were implemented in the KENO MC code within the SCALE code system and were evaluated for their reliability at predicting the onset and magnitude of undersampling biases in MC eigenvalue and flux tally estimates in two of the critical models. Of the five methods investigated, the Heidelberger-Welch RHW, the Gelman-Rubin diagnostics, and Tally Entropy produced test metrics that correlated strongly to the size of the observed undersampling biases, indicating their potential to effectively predict the size and prevalence of undersampling biases in MC simulations. (authors)

42 ENGINEERING↗

Particle transport in Markov stochastic mixtures with spatial gradients

Markov geometries are a prototype class of stochastic media that are widely used to model complex disordered systems. In a series of recent works, we have shown that spatially homogeneous (but possibly non-isotropic) Poisson tessellations can be conveniently used in order to generate three-dimensional realizations of Markov media and thus characterize the features of particle transport e.g. in fragmented fuel elements following severe nuclear accidents or Rayleigh-Taylor turbulent mixing for inertial confinement fusion. In this paper we show that Poisson tessellations can be extended to take into account the presence of spatial gradients, which commonly occur in real-world applications due to material stratification. For this purpose, we will provide an explicit construction of spatially-non-homogeneous Poisson tessellations, fully characterize their statistical properties, and finally illustrate the behaviour of particle transport in such random media. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A Markov Model for Assessing the Reliability of a Digital Feedwater Control System

A Markov approach has been selected to represent and quantify the reliability model of a digital feedwater control system (DFWCS). The system state, i.e., whether a system fails or not, is determined by the status of the components that can be characterized by component failure modes. Starting from the system state that has no component failure, possible transitions out of it are all failure modes of all components in the system. Each additional component failure mode will formulate a different system state that may or may not be a system failure state. The Markov transition diagram is developed by strictly following the sequences of component failures (i.e., failure sequences) because the different orders of the same set of failures may affect the system in completely different ways. The formulation and quantification of the Markov model, together with the proposed FMEA (Failure Modes and Effects Analysis) approach, and the development of the supporting automated FMEA tool are considered the three major elements of a generic conceptual framework under which the reliability of digital systems can be assessed.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Behavior Detection using Confidence Intervals of Hidden Markov Models

Markov models are commonly used to analyze real-world problems. Their combination of discrete states and stochastic transitions is suited to applications with deterministic and stochastic components. Hidden Markov Models (HMMs) are a class of Markov model commonly used in pattern recognition. Currently, HMMs recognize patterns using a maximum likelihood approach. One major drawback with this approach is that data observations are mapped to HMMs without considering the number of data samples available. Another problem is that this approach is only useful for choosing between HMMs. It does not provide a criteria for determining whether or not a given HMM adequately matches the data stream. In this work, we recognize complex behaviors using HMMs and confidence intervals. The certainty of a data match increases with the number of data samples considered. Receiver Operating Characteristic curves are used to find the optimal threshold for either accepting or rejecting a HMM description. We present one example using a family of HMM's to show the utility of the proposed approach. A second example using models extracted from a database of consumer purchases provides additional evidence that this approach can perform better than existing techniques.

97 MATHEMATICS AND COMPUTING↗

Quantum theory of open systems based on stochastic differential equations of generalized Langevin (non-Wiener) type

It is shown that the effective Hamiltonian representation, as it is formulated in author's papers, serves as a basis for distinguishing, in a broadband environment of an open quantum system, independent noise sources that determine, in terms of the stationary quantum Wiener and Poisson processes in the Markov approximation, the effective Hamiltonian and the equation for the evolution operator of the open system and its environment. General stochastic differential equations of generalized Langevin (non-Wiener) type for the evolution operator and the kinetic equation for the density matrix of an open system are obtained, which allow one to analyze the dynamics of a wide class of localized open systems in the Markov approximation. The main distinctive features of the dynamics of open quantum systems described in this way are the stabilization of excited states with respect to collective processes and an additional frequency shift of the spectrum of the open system. As an illustration of the general approach developed, the photon dynamics in a single-mode cavity without losses on the mirrors is considered, which contains identical intracavity atoms coupled to the external vacuum electromagnetic field. For some atomic densities, the photons of the cavity mode are 'locked' inside the cavity, thus exhibiting a new phenomenon of radiation trapping and non-Wiener dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Operations and support cost modeling using Markov chains

Systems for future missions will be selected with life cycle costs (LCC) as a primary evaluation criterion. This reflects the current realization that only systems which are considered affordable will be built in the future due to the national budget constaints. Such an environment calls for innovative cost modeling techniques which address all of the phases a space system goes through during its life cycle, namely: design and development, fabrication, operations and support; and retirement. A significant portion of the LCC for reusable systems are generated during the operations and support phase (OS). Typically, OS costs can account for 60 to 80 percent of the total LCC. Clearly, OS costs are wholly determined or at least strongly influenced by decisions made during the design and development phases of the project. As a result OS costs need to be considered and estimated early in the conceptual phase. To be effective, an OS cost estimating model needs to account for actual instead of ideal processes by associating cost elements with probabilities. One approach that may be suitable for OS cost modeling is the use of the Markov Chain Process. Markov chains are an important method of probabilistic analysis for operations research analysts but they are rarely used for life cycle cost analysis. This research effort evaluates the use of Markov Chains in LCC analysis by developing OS cost model for a hypothetical reusable space transportation vehicle (HSTV) and suggests further uses of the Markov Chain process as a design-aid tool.

Unal, Resit↗

A Markov framework for generalized post-event systems recovery modeling: From single to multihazards

State-dependent models can be used to represent the system recovery process as a series of stochastic transitions from lower to higher functional states. However, the applications of these models have been limited in scope and there is a lack of a generalized recovery modeling framework. A generalized framework would permit a robust forecasting of systems and system-of-systems recovery under multiple hazards, and more broadly, would contribute to community disaster preparedness. This paper develops a generalized post hazard-event recovery modeling framework based on state-dependent Markov-type processes. We then apply the proposed framework to solve a spectrum of problems that range from hind-casting single-system recovery following a single hazard event to forecasting post-event trajectories under multiple hazards and modeling the recovery of a system-of-systems. First, Markov chains are used to hind-cast the observed recovery for a portfolio of buildings affected by the 2014 South Napa, California, earthquake. Next, Markov processes are used to formulate a parametric post hazard-event recovery model, which can be updated using Bayesian statistics when relevant datasets become available. Semi-Markov processes are then used to develop a more general model of single hazard recovery, which accounts for the intensity of the loading and level of damage caused by the event. Semi-Markov processes with non-renewal features are then used to account for multihazard interactions in a post-event recovery model, and applied to a case study that involves a community in Charleston, South Carolina. Lastly, Markov-type processes are combined with Bayesian networks to model the recovery of residential, commercial, educational, and industrial buildings (system-of-systems) following a hazard event. Overall, these applications demonstrate the versatility of the Markov framework towards handling recovery problems with varying levels of complexity.

42 ENGINEERING↗

Application of Simulated Annealing and Related Algorithms to TWTA Design

Simulated Annealing (SA) is a stochastic optimization algorithm used to search for global minima in complex design surfaces where exhaustive searches are not computationally feasible. The algorithm is derived by simulating the annealing process, whereby a solid is heated to a liquid state and then cooled slowly to reach thermodynamic equilibrium at each temperature. The idea is that atoms in the solid continually bond and re-bond at various quantum energy levels, and with sufficient cooling time they will rearrange at the minimum energy state to form a perfect crystal. The distribution of energy levels is given by the Boltzmann distribution: as temperature drops, the probability of the presence of high-energy bonds decreases. In searching for an optimal design, local minima and discontinuities are often present in a design surface. SA presents a distinct advantage over other optimization algorithms in its ability to escape from these local minima. Just as high-energy atomic configurations are visited in the actual annealing process in order to eventually reach the minimum energy state, in SA highly non-optimal configurations are visited in order to find otherwise inaccessible global minima. The SA algorithm produces a Markov chain of points in the design space at each temperature, with a monotonically decreasing temperature. A random point is started upon, and the objective function is evaluated at that point. A stochastic perturbation is then made to the parameters of the point to arrive at a proposed new point in the design space, at which the objection function is evaluated as well. If the change in objective function values (Delta)E is negative, the proposed new point is accepted. If (Delta)E is positive, the proposed new point is accepted according to the Metropolis criterion: rho((Delta)f) = exp((-Delta)E/T), where T is the temperature for the current Markov chain. The process then repeats for the remainder of the Markov chain, after which the temperature is decremented and the process repeats. Eventually (and hopefully), a near-globally optimal solution is attained as T approaches zero. Several exciting variants of SA have recently emerged, including Discrete-State Simulated Annealing (DSSA) and Simulated Tempering (ST). The DSSA algorithm takes the thermodynamic analogy one step further by categorizing objective function evaluations into discrete states. In doing so, many of the case-specific problems associated with fine-tuning the SA algorithm can be avoided; for example, theoretical approximations for the initial and final temperature can be derived independently of the case. In this manner, DSSA provides a scheme that is more robust with respect to widely differing design surfaces. ST differs from SA in that the temperature T becomes an additional random variable in the optimization. The system is also kept in equilibrium as the temperature changes, as opposed to the system being driven out of equilibrium as temperature changes in SA. ST is designed to overcome obstacles in design surfaces where numerous local minima are separated by high barriers. These algorithms are incorporated into the optimal design of the traveling-wave tube amplifier (TWTA). The area under scrutiny is the collector, in which it would be ideal to use negative potential to decelerate the spent electron beam to zero kinetic energy just as it reaches the collector surface. In reality this is not plausible due to a number of physical limitations, including repulsion and differing levels of kinetic energy among individual electrons. Instead, the collector is designed with multiple stages depressed below ground potential. The design of this multiple-stage collector is the optimization problem of interest. One remaining problem in SA and DSSA is the difficulty in determining when equilibrium has been reached so that the current Markov chain can be terminated. It has been suggested in recent literature that simulating the thermodynamic properties opecific heat, entropy, and internal energy from the Boltzmann distribution can provide good indicators of having reached equilibrium at a certain temperature. These properties are tested for their efficacy and implemented in SA and DSSA code with respect to TWTA collector optimization.

Radke, Eric M.↗

Identification of hot water end-use process of electric water heaters from energy measurements

This paper presents an algorithm for the identification of parameters for a stochastic hot water end-use process that drives a homogeneous population of thermostatically controlled electric water heaters (EWH). Usually, only metered interval consumption data (kWh) is collected and the hot water end-use process is unobservable to utility and aggregators. However, the availability of EWHs for demand response (DR) is closely coupled with the hot water end-use process. In this context, the hot water end-use process is modeled as a two-state Markov chain (Use / No use), which causes the thermostatic ON-OFF switching process to behave as a Markov renewal process (MRP). A set of first passage-time problems is developed to obtain the moments of the transition probability densities of the MRP. These problems are addressed by establishing a system of coupled partial differential equations characterizing the temperature evolution of the EWH population. A key quantity in the methodology for estimating the parameters is the total time an EWH is ON within a period of interest. It is referred to as the total busy time. Total busy time in this approach is a random variable for which analytical expressions of the moments are developed as a function of the metered window length. The latter expressions become the basis of a hot water demand model identification algorithm which is validated using agent-based simulations of EWHs.

42 ENGINEERING↗

Metrics for Labeled Markov Systems

Partial Labeled Markov Chains are simultaneously generalizations of process algebra and of traditional Markov chains. They provide a foundation for interacting discrete probabilistic systems, the interaction being synchronization on labels as in process algebra. Existing notions of process equivalence are too sensitive to the exact probabilities of various transitions. This paper addresses contextual reasoning principles for reasoning about more robust notions of "approximate" equivalence between concurrent interacting probabilistic systems. The present results indicate that:We develop a family of metrics between partial labeled Markov chains to formalize the notion of distance between processes. We show that processes at distance zero are bisimilar. We describe a decision procedure to compute the distance between two processes. We show that reasoning about approximate equivalence can be done compositionally by showing that process combinators do not increase distance. We introduce an asymptotic metric to capture asymptotic properties of Markov chains; and show that parallel composition does not increase asymptotic distance.

Desharnais, Josee↗

A model of interaction between anticorruption authority and corruption groups

The paper provides a model of interaction between anticorruption unit and corruption groups. The main policy functions of the anticorruption unit involve reducing corrupt practices in some entities through an optimal approach to resource allocation and effective anticorruption policy. We develop a model based on Markov decision-making process and use Howard’s policy-improvement algorithm for solving an optimal decision strategy. We examine the assumption that corruption groups retaliate against the anticorruption authority to protect themselves. This model was implemented through stochastic game.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗