Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Markov 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 1,675 records · Page 93

Exploring the Structure of the Bound Proton with Deeply Virtual Compton Scattering

In the past two decades, deeply virtual Compton scattering of electrons has been successfully used to advance our knowledge of the partonic structure of the free proton and investigate correlations between the transverse position and the longitudinal momentum of quarks inside the nucleon. Meanwhile, the structure of bound nucleons in nuclei has been studied in inclusive deep-inelastic lepton scattering experiments off nuclear targets, showing a significant difference in longitudinal momentum distribution of quarks inside the bound nucleon, known as the EMC effect. In this work, we report the first beam spin asymmetry (BSA) measurement of exclusive deeply virtual Compton scattering (DVCS) off a proton bound in $^4$He. The data used here were accumulated using a $6$ GeV longitudinally polarized electron beam incident on a pressurized $^4$He gaseous target placed within the CLAS spectrometer in Hall-B at the Thomas Jefferson National Accelerator Facility. Here, the azimuthal angle ($\phi$) dependence of the BSA was studied in a wide range of virtual photon and scattered proton kinematics. The $Q^2$, $x_B$, and t dependencies of the BSA on the bound proton are compared with those on the free proton. In the whole kinematical region of our measurements, the BSA on the bound proton is smaller by 20\% to 40\%, indicating possible medium modification of its partonic structure.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Noise-specific beating in the higher-level Ramsey curves of a transmon qubit

We report: in the higher levels of superconducting transmon devices and more generally charge sensitive devices, T 2 * measurements made in the presence of low-frequency time-correlated 1/f charge noise and quasiparticle-induced parity flips can give an underestimation of the total dephasing time. The charge variations manifest as beating patterns observed in the overlay of several Ramsey fringe curves and are reproduced with a phenomenological Ramsey curve model, which accounts for the charge variations. T 2 * dephasing times, which more accurately represent the total dephasing time, are obtained. The phenomenological model is compared with a Lindblad master equation model. Both models are found to be in agreement with one another and the experimental data. Finally, the phenomenological formulation enables a simple method in which the power spectral density for the low-frequency noise can be inferred from the overlay of several Ramsey curves.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Evolution of the Galaxy Rest-Frame Ultraviolet Luminosity Function Over the First Two Billion Years

We present a robust measurement and analysis of the rest-frame ultraviolet (UV) luminosity function at z = 4 to 8. We use deep Hubble Space Telescope imaging over the CANDELS/GOODS fields, the Hubble Ultra Deep Field and the Hubble Frontier Field deep parallel observations near the Abell 2744 and MACS J0416.1- 2403 clusters. The combination of these surveys provides an effective volume of 0.6-1.2 ×10(exp 6) Mpc(exp 3) over this epoch, allowing us to perform a robust search for bright (M(sub UV) less than −21) and faint (M(sub UV) = −18) galaxies. We select galaxies using a well-tested photometric redshift technique with careful screening of contaminants, finding a sample of 7446 galaxies at 3.5 less than z less than 8.5, with more than 1000 galaxies at z of approximately 6 - 8. We measure both a stepwise luminosity function for galaxies in our redshift samples, as well as a Schechter function, using a Markov Chain Monte Carlo analysis to measure robust uncertainties. At the faint end our UV luminosity functions agree with previous studies, yet we find a higher abundance of UV-bright galaxies at z of greater than or equal to 6. Our bestfit value of the characteristic magnitude M* is consistent with −21 at z of greater than or equal to 5, different than that inferred based on previous trends at lower redshift. At z = 8, a single power-law provides an equally good fit to the UV luminosity function, while at z = 6 and 7, an exponential cutoff at the bright-end is moderately preferred. We compare our luminosity functions to semi-analytical models, and find that the lack of evolution in M* is consistent with models where the impact of dust attenuation on the bright-end of the luminosity function decreases at higher redshift, though a decreasing impact of feedback may also be possible. We measure the evolution of the cosmic star-formation rate (SFR) density by integrating our observed luminosity functions to M(sub UV) = −17, correcting for dust attenuation, and find that the SFR density declines proportionally to (1 + z)((exp −4.3)(+/-)(0.5)) at z greater than 4, consistent with observations at z greater than or equal to 9. Our observed luminosity functions are consistent with a reionization history that starts at redshift of approximately greater than 10, completes at z greater than 6, and reaches a midpoint (x(sub HII) = 0.5) at 6.7 less than z less than 9.4. Finally, using a constant cumulative number density selection and an empirically derived rising star-formation history, our observations predict that the abundance of bright z = 9 galaxies is likely higher than previous constraints, though consistent with recent estimates of bright z similar to 10 galaxies.

Galaxy↗

NONPARAMETRIC EMPIRICAL BAYES ESTIMATION THROUGH DECONVOLUTION IN PROBABILISTIC RISK ANALYSIS

The advent of Markov Chain Monte Carlo (MCMC) simulations and availability of open source software made full hierarchical Bayesian analysis tractable and a popular choice in parameter estimation for Probabilistic Risk Assessment (PRA). However, despite its theoretical attractiveness, the hierarchical Bayesian analysis is not without its problems. Two of the most prominent practical difficulties in applying hierarchical Bayes analysis in practice to analyze source-to-source variability, for example, is its sensitivity to the selection of the first-stage prior and dependence of the rate of convergence on the selection of the first-stage prior. The first-stage prior in hierarchical Bayesian analysis is usually assumed having a parametric form, often conjugate to the likelihood function (aleatory model). To facilitate convergence for hierarchical Bayes models, the first-stage prior is frequently set through empirical Bayes estimate, which can use available historical data to find the parameters of the first-stage prior. The paper discusses a new nonparametric empirical Bayes estimation and compare it to several well-known parametric estimates such as method of moments and maximum likelihood. The new nonparametric technique exploits the prior predictive distribution as integral equation and proceeds to solve it with respect to prior assuming the sampling data distribution and aleatory model are available. The discussion covers topics such as selection of aleatory model for future data, selection of regularization parameter, and density estimation for historical data. For comparison, the paper is using contrived as well as real-world data from utilities. Utilities data represent failure data with Poisson distribution used for aleatory model.

97 MATHEMATICS AND COMPUTING↗

An Ensemble-Based Smoother with Retrospectively Updated Weights for Highly Nonlinear Systems

Monte Carlo computational methods have been introduced into data assimilation for nonlinear systems in order to alleviate the computational burden of updating and propagating the full probability distribution. By propagating an ensemble of representative states, algorithms like the ensemble Kalman filter (EnKF) and the resampled particle filter (RPF) rely on the existing modeling infrastructure to approximate the distribution based on the evolution of this ensemble. This work presents an ensemble-based smoother that is applicable to the Monte Carlo filtering schemes like EnKF and RPF. At the minor cost of retrospectively updating a set of weights for ensemble members, this smoother has demonstrated superior capabilities in state tracking for two highly nonlinear problems: the double-well potential and trivariate Lorenz systems. The algorithm does not require retrospective adaptation of the ensemble members themselves, and it is thus suited to a streaming operational mode. The accuracy of the proposed backward-update scheme in estimating non-Gaussian distributions is evaluated by comparison to the more accurate estimates provided by a Markov chain Monte Carlo algorithm.

Monte Carlo↗

BAYESIAN MAGNETOHYDRODYNAMIC SEISMOLOGY OF CORONAL LOOPS

We perform a Bayesian parameter inference in the context of resonantly damped transverse coronal loop oscillations. The forward problem is solved in terms of parametric results for kink waves in one-dimensional flux tubes in the thin tube and thin boundary approximations. For the inverse problem, we adopt a Bayesian approach to infer the most probable values of the relevant parameters, for given observed periods and damping times, and to extract their confidence levels. The posterior probability distribution functions are obtained by means of Markov Chain Monte Carlo simulations, incorporating observed uncertainties in a consistent manner. We find well-localized solutions in the posterior probability distribution functions for two of the three parameters of interest, namely the Alfven travel time and the transverse inhomogeneity length scale. The obtained estimates for the Alfven travel time are consistent with previous inversion results, but the method enables us to additionally constrain the transverse inhomogeneity length scale and to estimate real error bars for each parameter. When observational estimates for the density contrast are used, the method enables us to fully constrain the three parameters of interest. These results can serve to improve our current estimates of unknown physical parameters in coronal loops and to test the assumed theoretical model.

79 ASTRONOMY AND ASTROPHYSICS↗

Hydrodynamic Characteristics of Coolant Tracts in High-Temperature Gas-Cooled Nuclear Reactor

A validation of the hydrodynamic characteristics of the coolant loop of a high-temperature gas-cooled reactor at low power in a power-generating facility using a turbo-machine conversion in a Brayton cycle is given. The validation is accomplished using diagnostics of models of a coolant loop, numerical modeling of the hydrodynamics, heat-and-mass transfer in models with more accurate three-dimensional CFD codes. Relations for ensuring tangential uniformity of the coolant velocity distribution near the core shell and at the entry into the distributing manifold are obtained. A distributing manifold geometry securing a uniform coolant flow distribution over core cooling tracts at low hydraulic resistance is proposed. Data are obtained on the velocity and temperature distributions in fuel pins spaced by a wire winding.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

GraMeR: Gra ph Me ta R einforcement learning for multi-objective influence maximization

Influence maximization (IM) is a combinatorial problem of identifying a subset of seed nodes in a network (graph), which when activated, provide a maximal spread of influence in the network for a given diffusion model and a budget for seed set size. IM has numerous applications such as viral marketing, epidemic control, sensor placement and other network-related tasks. However, its practical uses are limited due to the computational complexity of current algorithms. Recently, deep reinforcement learning has been leveraged to solve IM in order to ease the computational burden. However, there are serious limitations in current approaches, including narrow IM formulation that only consider influence via spread and ignore self-activation, low scalability to large graphs, and lack of generalizability across graph families leading to a large running time for every test network. In this work, we address these limitations through a unique approach that involves: (1) Formulating a generic IM problem as a Markov decision process that handles both intrinsic and influence activations; (2)incorporating generalizability via meta-learning across graph families. There are previous works that combine deep reinforcement learning with graph neural network, but this work solves a more realistic IM problem and incorporates generalizability across graphs via meta reinforcement learning. Extensive experiments are carried out in various standard networks to validate performance of the proposed Graph Meta Reinforcement learning (GraMeR) framework. Finally, the results indicate that GraMeR is multiple orders faster and generic than conventional approaches when applied on small to medium scale graphs.

97 MATHEMATICS AND COMPUTING↗

Practical reliability and uncertainty quantification in complex systems : final report.

The purpose of this project was to investigate the use of Bayesian methods for the estimation of the reliability of complex systems. The goals were to find methods for dealing with continuous data, rather than simple pass/fail data; to avoid assumptions of specific probability distributions, especially Gaussian, or normal, distributions; to compute not only an estimate of the reliability of the system, but also a measure of the confidence in that estimate; to develop procedures to address time-dependent or aging aspects in such systems, and to use these models and results to derive optimal testing strategies. The system is assumed to be a system of systems, i.e., a system with discrete components that are themselves systems. Furthermore, the system is 'engineered' in the sense that each node is designed to do something and that we have a mathematical description of that process. In the time-dependent case, the assumption is that we have a general, nonlinear, time-dependent function describing the process. The major results of the project are described in this report. In summary, we developed a sophisticated mathematical framework based on modern probability theory and Bayesian analysis. This framework encompasses all aspects of epistemic uncertainty and easily incorporates steady-state and time-dependent systems. Based on Markov chain, Monte Carlo methods, we devised a computational strategy for general probability density estimation in the steady-state case. This enabled us to compute a distribution of the reliability from which many questions, including confidence, could be addressed. We then extended this to the time domain and implemented procedures to estimate the reliability over time, including the use of the method to predict the reliability at a future time. Finally, we used certain aspects of Bayesian decision analysis to create a novel method for determining an optimal testing strategy, e.g., we can estimate the 'best' location to take the next test to minimize the risk of making a wrong decision about the fitness of a system. We conclude this report by proposing additional fruitful areas of research.

97 MATHEMATICS AND COMPUTING↗

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.↗

Data free inference with processed data products

Here, we consider the context of probabilistic inference of model parameters given error bars or confidence intervals on model output values, when the data is unavailable. We introduce a class of algorithms in a Bayesian framework, relying on maximum entropy arguments and approximate Bayesian computation methods, to generate consistent data with the given summary statistics. Once we obtain consistent data sets, we pool the respective posteriors, to arrive at a single, averaged density on the parameters. This approach allows us to perform accurate forward uncertainty propagation consistent with the reported statistics.

97 MATHEMATICS AND COMPUTING↗

State Space Truncation with Quantified Errors for Accurate Solutions to Discrete Chemical Master Equation

The discrete chemical master equation (dCME) provides a general framework for studying stochasticity in mesoscopic reaction networks. Since its direct solution rapidly becomes intractable due to the increasing size of the state space, truncation of the state space is necessary for solving most dCMEs. It is therefore important to assess the consequences of state space truncations so errors can be quantified and minimized. Here we describe a novel method for state space truncation. By partitioning a reaction network into multiple molecular equivalence groups (MEGs), we truncate the state space by limiting the total molecular copy numbers in each MEG. We further describe a theoretical framework for analysis of the truncation error in the steady-state probability landscape using reflecting boundaries. By aggregating the state space based on the usage of a MEG and constructing an aggregated Markov process, we show that the truncation error of a MEG can be asymptotically bounded by the probability of states on the reflecting boundary of the MEG. Furthermore, truncating states of an arbitrary MEG will not undermine the estimated error of truncating any other MEGs. We then provide an overall error estimate for networks with multiple MEGs. To rapidly determine the appropriate size of an arbitrary MEG, we also introduce an a priori method to estimate the upper bound of its truncation error. This a priori estimate can be rapidly computed from reaction rates of the network, without the need of costly trial solutions of the dCME. As examples, we show results of applying our methods to the four stochastic networks of (1) the birth and death model, (2) the single gene expression model, (3) the genetic toggle switch model, and (4) the phage lambda bistable epigenetic switch model. We demonstrate how truncation errors and steady-state probability landscapes can be computed using different sizes of the MEG(s) and how the results validate our theories. Overall, the novel state space truncation and error analysis methods developed here can be used to ensure accurate direct solutions to the dCME for a large number of stochastic networks.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Uncertainty quantification of CO₂ saturation estimated from electrical resistance tomography data at the Cranfield site

A parametric bootstrap approach is presented for uncertainty quantification (UQ) of CO₂ saturation derived from electrical resistance tomography (ERT) data collected at the Cranfield, Mississippi (USA) carbon sequestration site. There are many sources of uncertainty in ERT-derived CO₂ saturation, but we focus on how the ERT observation errors propagate to the estimated CO₂ saturation in a nonlinear inversion process. Our UQ approach consists of three steps. We first estimated the observational errors from a large number of reciprocal ERT measurements. The second step was to invert the pre-injection baseline data and the resulting resistivity tomograph was used as the prior information for nonlinear inversion of time-lapse data. We assigned a 3% random noise to the baseline model. Finally, we used a parametric bootstrap method to obtain bootstrap CO₂ saturation samples by deterministically solving a nonlinear inverse problem many times with resampled data and resampled baseline models. Then the mean and standard deviation of CO₂ saturation were calculated from the bootstrap samples. We found that the maximum standard deviation of CO₂ saturation was around 6% with a corresponding maximum saturation of 30% for a data set collected 100 days after injection began. There was no apparent spatial correlation between the mean and standard deviation of CO₂ saturation but the standard deviation values increased with time as the saturation increased. The uncertainty in CO₂ saturation also depends on the ERT reciprocal error threshold used to identify and remove noisy data and inversion constraints such as temporal roughness. Five hundred realizations requiring 3.5 h on a single 12-core node were needed for the nonlinear Monte Carlo inversion to arrive at stationary variances while the Markov Chain Monte Carlo (MCMC) stochastic inverse approach may expend days for a global search. This indicates that UQ of 2D or 3D ERT inverse problems can be performed on a laptop or desktop PC.

58 GEOSCIENCES↗

THE HALO MASS FUNCTION FROM EXCURSION SET THEORY. II. THE DIFFUSING BARRIER

In excursion set theory, the computation of the halo mass function is mapped into a first-passage time process in the presence of a barrier, which in the spherical collapse model is a constant and in the ellipsoidal collapse model is a fixed function of the variance of the smoothed density field. However, N-body simulations show that dark matter halos grow through a mixture of smooth accretion, violent encounters, and fragmentations, and modeling halo collapse as spherical, or even as ellipsoidal, is a significant oversimplification. In addition, the very definition of what is a dark matter halo, both in N-body simulations and observationally, is a difficult problem. We propose that some of the physical complications inherent to a realistic description of halo formation can be included in the excursion set theory framework, at least at an effective level, by taking into account that the critical value for collapse is not a fixed constant {delta}{sub c}, as in the spherical collapse model, nor a fixed function of the variance {sigma} of the smoothed density field, as in the ellipsoidal collapse model, but rather is itself a stochastic variable, whose scatter reflects a number of complicated aspects of the underlying dynamics. Solving the first-passage time problem in the presence of a diffusing barrier we find that the exponential factor in the Press-Schechter mass function changes from exp{l_brace}-{delta}{sup 2}{sub c}/2{sigma}{sup 2{r_brace}} to exp{l_brace}-a{delta}{sup 2}{sub c}/2{sigma}{sup 2{r_brace}}, where a = 1/(1 + D{sub B}) and D{sub B} is the diffusion coefficient of the barrier. The numerical value of D{sub B} , and therefore the corresponding value of a, depends among other things on the algorithm used for identifying halos. We discuss the physical origin of the stochasticity of the barrier and, from recent N-body simulations that studied the properties of the collapse barrier, we deduce a value D{sub B} {approx_equal} 0.25. Our model then predicts a {approx_equal} 0.80, in excellent agreement with the exponential fall off of the mass function found in N-body simulations, for the same halo definition. Combining this result with the non-Markovian corrections computed in Paper I of this series, we derive an analytic expression for the halo mass function for Gaussian fluctuations and we compare it with N-body simulations.

79 ASTRONOMY AND ASTROPHYSICS↗

Learning infinite-horizon average-reward restless multi-action bandits via index awareness

We consider the online restless bandits with average-reward and multiple actions, where the state of each arm evolves according to a Markov decision process (MDP), and the reward of pulling an arm depends on both the current state of the corresponding MDP and the action taken. Since finding the optimal control is typically intractable for restless bandits, existing learning algorithms are often computationally expensive or with a regret bound that is exponential in the number of arms and states. In this paper, we advocate \textit{index-aware reinforcement learning} (RL) solutions to design RL algorithms operating on a much smaller dimensional subspace by exploiting the inherent structure in restless bandits. Specifically, we first propose novel index policies to address dimensionality concerns, which are provably optimal. We then leverage the indices to develop two low-complexity index-aware RL algorithms, namely, (i) GM-R2MAB, which has access to a generative model; and (ii) UC-R2MAB, which learns the model using an upper confidence style online exploitation method. We prove that both algorithms achieve a sub-linear regret that is only polynomial in the number of arms and states. A key differentiator between our algorithms and existing ones stems from the fact that our RL algorithms contain a novel exploitation that leverages our proposed provably optimal index policies for decision-makings.

Xiong, Guojun↗

Weak Necessary and Sufficient Stochastic Maximum Principle for Markovian Regime-Switching Diffusion Models

In this paper we prove a weak necessary and sufficient maximum principle for Markovian regime switching stochastic optimal control problems. Instead of insisting on the maximum condition of the Hamiltonian, we show that 0 belongs to the sum of Clarke’s generalized gradient of the Hamiltonian and Clarke’s normal cone of the control constraint set at the optimal control. Under a joint concavity condition on the Hamiltonian and a convexity condition on the terminal objective function, the necessary condition becomes sufficient. We give four examples to demonstrate the weak stochastic maximum principle.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized quantum kinetic expansion: Time scale separation between intra-cluster and inter-cluster kinetics

For a general two-cluster network, a new methodology of the cluster-based generalized quantum kinetic expansion (GQKE) is developed in the matrix formalism under two initial conditions: the local cluster equilibrium and system-bath factorized states. For each initial condition, the site population evolution follows exactly a distinct closed equation, where all the four terms involved are systematically expanded over inter-cluster couplings. For the system-bath factorized initial state, the numerical investigation of the two models, a biased (2, 1)-site system and an unbiased (2, 2)-site system, verifies the reliability of the GQKE and the relevance of higher-order corrections. The time-integrated site-to-site rates and the time evolution of site population reveal the time scale separation between intra-cluster and inter-cluster kinetics. The population evolution of aggregated clusters can be quantitatively described by the approximate cluster Markovian kinetics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Magnetic field sensing beyond the standard quantum limit under the effect of decoherence

Entangled states can potentially be used to outperform the standard quantum limit by which every classical sensor is bounded. However, entangled states are very susceptible to decoherence, and so it is not clear whether one can really create a superior sensor to classical technology via a quantum strategy which is subject to the effect of realistic noise. This paper presents an investigation of how a quantum sensor composed of many spins is affected by independent dephasing. We adopt general noise models including non-Markovian effects, and in these noise models the performance of the sensor depends crucially on the exposure time of the sensor to the field. We have found that, by choosing an appropriate exposure time within the non-Markovian time region, an entangled sensor does actually beat the standard quantum limit. Since independent dephasing is one of the most typical sources of noise in many systems, our results suggest a practical and scalable approach to beating the standard quantum limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗