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,639 records · Page 91

Parametric State Space Structuring

Structured approaches based on Kronecker operators for the description and solution of the infinitesimal generator of a continuous-time Markov chains are receiving increasing interest. However, their main advantage, a substantial reduction in the memory requirements during the numerical solution, comes at a price. Methods based on the "potential state space" allocate a probability vector that might be much larger than actually needed. Methods based on the "actual state space", instead, have an additional logarithmic overhead. We present an approach that realizes the advantages of both methods with none of their disadvantages, by partitioning the local state spaces of each submodel. We apply our results to a model of software rendezvous, and show how they reduce memory requirements while, at the same time, improving the efficiency of the computation.

Ciardo, Gianfranco↗

Solving the master equation without kinetic Monte Carlo: Tensor train approximations for a CO oxidation model

In multiscale modeling of heterogeneous catalytic processes, one crucial point is the solution of a Markovian master equation describing the stochastic reaction kinetics. Usually, this is too high-dimensional to be solved with standard numerical techniques and one has to rely on sampling approaches based on the kinetic Monte Carlo method. In this study we break the curse of dimensionality for the direct solution of the Markovian master equation by exploiting the Tensor Train Format for this purpose. The performance of the approach is demonstrated on a first principles based, reduced model for the CO oxidation on the RuO{sub 2}(110) surface. We investigate the complexity for increasing system size and for various reaction conditions. The advantage over the stochastic simulation approach is illustrated by a problem with increased stiffness.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gaussian approximations for stochastic systems with delay: Chemical Langevin equation and application to a Brusselator system

We present a heuristic derivation of Gaussian approximations for stochastic chemical reaction systems with distributed delay. In particular, we derive the corresponding chemical Langevin equation. Due to the non-Markovian character of the underlying dynamics, these equations are integro-differential equations, and the noise in the Gaussian approximation is coloured. Following on from the chemical Langevin equation, a further reduction leads to the linear-noise approximation. We apply the formalism to a delay variant of the celebrated Brusselator model, and show how it can be used to characterise noise-driven quasi-cycles, as well as noise-triggered spiking. We find surprisingly intricate dependence of the typical frequency of quasi-cycles on the delay period.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. Although obtaining efficient wait-free algorithms has been a long-time goal for the theory community, most nonblocking commercial code is only lock-free. This article suggests a simple solution to this problem. We show that for a large class of lock-free algorithms, under scheduling conditions that approximate those found in commercial hardware architectures, lock-free algorithms behave as if they are wait-free. In other words, programmers can continue to design simple lock-free algorithms instead of complex wait-free ones, and in practice, they will get wait-free progress. Our main contribution is a new way of analyzing a general class of lock-free algorithms under a stochastic scheduler. Our analysis relates the individual performance of processes to the global performance of the system using Markov chain lifting between a complex per-process chain and a simpler system progress chain. We show that lock-free algorithms are not only wait-free with probability 1 but that in fact a general subset of lock-free algorithms can be closely bounded in terms of the average number of steps required until an operation completes. Here, to the best of our knowledge, this is the first attempt to analyze progress conditions, typically stated in relation to a worst-case adversary, in a stochastic model capturing their expected asymptotic behavior.

97 MATHEMATICS AND COMPUTING↗

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 functions at z = 4–8. We use deep Hubble Space Telescope imaging over the Cosmic Assembly Near-infrared Deep Extragalactic Legacy Survey/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{sup 6} Mpc{sup 3} over this epoch, allowing us to perform a robust search for faint (M{sub UV}=−18) and bright (M{sub UV}<−21) high-redshift galaxies. We select candidate galaxies using a well-tested photometric redshift technique with careful screening of contaminants, finding a sample of 7446 candidate galaxies at 3.5 < z < 8.5, with >1000 galaxies at z ≈ 6–8. We measure both a stepwise luminosity function for candidate galaxies in our redshift samples, and 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 candidate galaxies at z ⩾ 6. Our best-fit value of the characteristic magnitude M{sub UV}{sup ∗} is consistent with −21 at z ⩾ 5, which is different than that inferred based on previous trends at lower redshift, and brighter at ∼2σ significance than previous measures at z = 6 and 7. 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{sub UV}{sup ∗} is consistent with models where the impact of dust attenuation on the bright end of the luminosity function decreases at higher redshift, although 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){sup −4.3±0.5} at z > 4, which is consistent with observations at z ⩾ 9. Our observed luminosity functions are consistent with a reionization history that starts at z ≳ 10, completes at z > 6, and reaches a midpoint (x{sub H II} = 0.5) at 6.7 < z < 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, although consistent with recent estimates of bright z ∼ 10 galaxies.

79 ASTRONOMY AND ASTROPHYSICS↗

A Review of Bayesian Networks for Spatial Data

We report Bayesian networks are a popular class of multivariate probabilistic models as they allow for the translation of prior beliefs about conditional dependencies between variables to be easily encoded into their model structure. Due to their widespread usage, they are often applied to spatial data for inferring properties of the systems under study and also generating predictions for how these systems may behave in the future. We review published research on methodologies for representing spatial data with Bayesian networks and also summarize the application areas for which Bayesian networks are employed in the modeling of spatial data. We find that a wide variety of perspectives are taken, including a GIS-centric focus on efficiently generating geospatial predictions, a statistical focus on rigorously constructing graphical models controlling for spatial correlation, as well as a range of problem-specific heuristics for mitigating the effects of spatial correlation and dependency arising in spatial data analysis. Special attention is also paid to potential future directions for integration of Bayesian networks with spatial processes.

97 MATHEMATICS AND COMPUTING↗

Channel capacities of an exactly solvable spin-star system

We calculate the entanglement-assisted and -unassisted channel capacities of an exactly solvable spin star system, which models the quantum dephasing channel. The capacities for this non-Markovian model exhibit a strong dependence on the coupling strengths of the bath spins with the system, the bath temperature, and the number of bath spins. For equal couplings and bath frequencies, the channel becomes periodically noiseless.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Orbit determination in the presence of unmodeled accelerations.

In the investigation discussed here, the unmodeled acceleration is approximated as a first-order stationary Gauss-Markov process which can be separated into a time wise correlated component and a purely random component. An extended form of the Kalman-Bucy filter is used to estimate the state and the unmodeled accelerations at each observation epoch. Applications of the estimation algorithm to simulated data and to tracking data obtained during the Apollo 10 and 11 missions indicate that a more accurate estimate of the state is obtained using the algorithm and that the estimated values of the unmodeled accelerations can be correlated with physical phenomena neglected by the mathematical model.

Tapley, B. D.↗

Toroidal magnetic field ripple in the presence of misaligned toroidal field coils on the COMPASS-U tokamak

Homogeneity of the toroidal magnetic field is a critical aspect of the tokamak fusion device. It is affected by the design of toroidal magnetic field coils and their manufacturing and assembly misalignments. The magnetic field of the COMPASS-U project is analysed using toroidal field ripple quantity. Here ANSYS modelling of bitter-plate-designed toroidal field coils is performed to prepare an accurate simplistic representation of the coils using a virtual current line. Toroidal field ripple is analysed using a Gaussian distribution of possible misalignments. The worst-case toroidal field ripple corresponding to the technical drawings only slightly exceeds the chosen limit of 0.5%.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Goal-oriented sensitivity analysis for lattice kinetic Monte Carlo simulations

In this paper we propose a new class of coupling methods for the sensitivity analysis of high dimensional stochastic systems and in particular for lattice Kinetic Monte Carlo (KMC). Sensitivity analysis for stochastic systems is typically based on approximating continuous derivatives with respect to model parameters by the mean value of samples from a finite difference scheme. Instead of using independent samples the proposed algorithm reduces the variance of the estimator by developing a strongly correlated-“coupled”- stochastic process for both the perturbed and unperturbed stochastic processes, defined in a common state space. The novelty of our construction is that the new coupled process depends on the targeted observables, e.g., coverage, Hamiltonian, spatial correlations, surface roughness, etc., hence we refer to the proposed method as goal-oriented sensitivity analysis. In particular, the rates of the coupled Continuous Time Markov Chain are obtained as solutions to a goal-oriented optimization problem, depending on the observable of interest, by considering the minimization functional of the corresponding variance. We show that this functional can be used as a diagnostic tool for the design and evaluation of different classes of couplings. Furthermore, the resulting KMC sensitivity algorithm has an easy implementation that is based on the Bortz–Kalos–Lebowitz algorithm's philosophy, where events are divided in classes depending on level sets of the observable of interest. Finally, we demonstrate in several examples including adsorption, desorption, and diffusion Kinetic Monte Carlo that for the same confidence interval and observable, the proposed goal-oriented algorithm can be two orders of magnitude faster than existing coupling algorithms for spatial KMC such as the Common Random Number approach. We also provide a complete implementation of the proposed sensitivity analysis algorithms, including various spatial KMC examples, in a supplementary MATLAB source code.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Using Classical Reliability Models and Single Event Upset (SEU) Data to Determine Optimum Implementation Schemes for Triple Modular Redundancy (TMR) in SRAM-Based Field Programmable Gate Array (FPGA) Devices

Space applications are complex systems that require intricate trade analyses for optimum implementations. We focus on a subset of the trade process, using classical reliability theory and SEU data, to illustrate appropriate TMR scheme selection.

Field Programmable Gate Array (FPGA)↗

Lectures on statistical mechanics

Presented here is a transcription of the lecture notes from Professor Allan N. Kaufman’s graduate statistical mechanics course Physics 212A and 212B at the University of California Berkeley from the 1972–1973 academic year. 212A addressed equilibrium statistical mechanics with topics: fundamentals (micro-canonical and sub-canonical ensembles, adiabatic law and action conservation, fluctuations, pressure, and virial theorem), classical fluids and other systems (equation of state, deviations from ideality, virial coefficients and van der Waals potential, canonical ensemble and partition function, quasistatic evolution, grand-canonical ensemble and partition function, chemical potential, simple model of a phase transition, quantum virial expansion, numerical simulation of equations of state, and phase transition), chemical equilibrium (systems with multiple species and chemical reactions, law of mass action, Saha equation, chemical equilibrium including ionization and excited states), and long-range interactions (including Coulomb, dipole, and gravitational interactions, Debye–Hückel theory, and shielding). 212B addressed nonequilibrium statistical mechanics with topics: fundamentals (definitions: realizations, moments, characteristic function, and discrete variables), Brownian motion (Langevin equation, fluctuation–dissipation theorem, spatial diffusion, Boltzmann’s H-theorem), Liouville and Klimontovich equations, Landau equation (derivation, elaboration, and H-theorem, and irreversibility), Markov processes and Fokker–Planck equation (derivations of the Fokker–Planck equation and a master equation), linear response and transport theory (linear Boltzmann equation, linear response theory of Kubo and Mori, relation of entropy production to electrical conductivity, transport relations and coefficients, normal mode solutions of the transport equations, sketch of a generalized Langevin equation method for transport theory), and an introduction to nonequilibrium quantum statistical mechanics.

plasma dynamics↗

Nanoscale simulation of shale transport properties using the lattice Boltzmann method: Permeability and diffusivity

Here, porous structures of shales are reconstructed using the markov chain monte carlo (MCMC) method based on scanning electron microscopy (SEM) images of shale samples from Sichuan Basin, China. Characterization analysis of the reconstructed shales is performed, including porosity, pore size distribution, specific surface area and pore connectivity. The lattice Boltzmann method (LBM) is adopted to simulate fluid flow and Knudsen diffusion within the reconstructed shales. Simulation results reveal that the tortuosity of the shales is much higher than that commonly employed in the Bruggeman equation, and such high tortuosity leads to extremely low intrinsic permeability. Correction of the intrinsic permeability is performed based on the dusty gas model (DGM) by considering the contribution of Knudsen diffusion to the total flow flux, resulting in apparent permeability. The correction factor over a range of Knudsen number and pressure is estimated and compared with empirical correlations in the literature. We find that for the wide pressure range investigated, the correction factor is always greater than 1, indicating Knudsen diffusion always plays a role on shale gas transport mechanisms in the reconstructed shales. Specifically, we found that most of the values of correction factor fall in the slip and transition regime, with no Darcy flow regime observed.

36 MATERIALS SCIENCE↗

Fractional noise destroys or induces a stochastic bifurcation

Little seems to be known about the stochastic bifurcation phenomena of non-Markovian systems. Our intention in this paper is to understand such complex dynamics by a simple system, namely, the Black-Scholes model driven by a mixed fractional Brownian motion. The most interesting finding is that the multiplicative fractional noise not only destroys but also induces a stochastic bifurcation under some suitable conditions. So it opens a possible way to explore the theory of stochastic bifurcation in the non-Markovian framework.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An in-situ conductometric apparatus for physicochemical characterization of solutions and in-line monitoring of separation processes at elevated temperatures and pressures

Specific conductance and frequency-dependent resistance (impedance) data are widely utilized for understanding the physicochemical characteristics of aqueous and non-aqueous fluids and for evaluating the performance of chemical processes. However, the implementation of such an in-situ probe in high-temperature and high-pressure environments is not trivial. This work provides a description of both the hardware and software associated with implementing a parallel-type in-situ electrochemical sensor. The sensor can be used for in-line monitoring of thermal desalination processes and for impedance measurements in fluids at high temperature and pressure. Further, a comparison between the experimental measurements on the specific conductance in aqueous sodium chloride solutions and the conductance model demonstrate that the methodology yields reasonable agreement with both the model and literature data. A combination of hardware components, a software-based correction for experimental artifacts, and computational fluid dynamics (CFD) calculations used in this work provide a sound basis for implementing such in-situ electrochemical sensors to measure frequency-dependent resistance spectra.

47 OTHER INSTRUMENTATION↗

Information distribution in distributed microprocessor based flight control systems

This paper presents an optimal control theory that accounts for variable time intervals in the information distribution to control effectors in a distributed microprocessor based flight control system. The theory is developed using a linear process model for the aircraft dynamics and the information distribution process is modeled as a variable time increment process where, at the time that information is supplied to the control effectors, the control effectors know the time of the next information update only in a stochastic sense. An optimal control problem is formulated and solved that provides the control law that minimizes the expected value of a quadratic cost function. An example is presented where the theory is applied to the control of the longitudinal motions of the F8-DFBW aircraft. Theoretical and simulation results indicate that, for the example problem, the optimal cost obtained using a variable time increment Markov information update process where the control effectors know only the past information update intervals and the Markov transition mechanism is almost identical to that obtained using a known uniform information update interval.

Montgomery, R. C.↗

MOOSE ProbML: Parallelized probabilistic machine learning and uncertainty quantification for computational energy applications

Here, this paper presents the development and demonstration of massively parallel probabilistic machine learning (ML) and uncertainty quantification (UQ) capabilities within the Multiphysics Object-Oriented Simulation Environment (MOOSE), an open-source computational platform for parallel finite element and finite volume analyses. In addressing the computational expense and uncertainties inherent in complex multiphysics simulations, this paper integrates Gaussian process (GP) variants, active learning, Bayesian inverse UQ, adaptive forward UQ, Bayesian optimization, evolutionary optimization, and Markov chain Monte Carlo (MCMC) within MOOSE. It also elaborates on the interaction among key MOOSE systems — Sampler, MultiApp, Reporter, and Surrogate — in enabling these capabilities. The modularity offered by these systems enables development of a multitude of probabilistic ML and UQ algorithms in MOOSE. Example code demonstrations include parallel active learning and parallel Bayesian inference via active learning. The impact of these developments is illustrated through five applications relevant to computational energy applications: UQ of nuclear fuel fission product release, using parallel active learning Bayesian inference; very rare events analysis in nuclear microreactors using active learning; advanced manufacturing process modeling using multi-output GPs (MOGPs) and dimensionality reduction; fluid flow using deep GPs (DGPs); and tritium transport model parameter optimization for fusion energy, using batch Bayesian optimization. These capabilities are part of the MOOSE framework.

97 - MATHEMATICS AND COMPUTING↗

Probing Physics beyond the Standard Model through Combined Analyses of Next-generation Type Ia Supernova, Cosmic Microwave Background, and Baryon Acoustic Oscillation Surveys

Observations of Type Ia supernovae (SNe Ia), which probe the late Universe, together with baryon acoustic oscillations (BAO) and the cosmic microwave background (CMB), which probe the intermediate and early epochs, provide complementary constraints on the expansion history of the Universe. In this work, we forecast constraints on dark energy and other extensions to the standard cosmological model by combining the SN Ia sample expected from the Vera C. Rubin Observatory’s Legacy Survey of Space and Time (LSST), data from current and forthcoming CMB surveys, and BAO measurements from the Dark Energy Spectroscopic Instrument (DESI). For the CMB, we use temperature, polarization, and lensing power spectra (TT/EE/TE/ϕϕ) from the South Pole Telescope, the planned Advanced Simons Observatory, and a CMB-S4–like experiment. We derive constraints on ΛCDM and its extensions involving the dark energy equation-of-state parameters (w 0 , w a ) and the sum of neutrino masses ∑m ν using a Markov Chain Monte Carlo (MCMC) sampling framework. We find that the LSST Year 3 SN Ia sample can improve upon the DES Year 5 dark energy constraints by a factor of 2−2.5×, with the gains driven primarily by the significantly higher SN Ia density in the LSST sample. Similarly, DESI-DR3 shows up to a 1.8× improvement on dark energy parameters over DR2, driven largely by the substantial increase in the low-redshift sample. Combining CMB with LSST-Y3-SN Ia and DESI-DR3-BAO yields σ(w 0 ) = 0.028 and σ(w a ) = 0.11 for w 0 w a CDM cosmology with the results being largely independent of the CMB dataset. The constraints weaken by 10%–30% when freeing ∑m ν and spatial curvature. Moreover, the joint analysis of the three datasets can enable a 2σ–3σ detection of ∑m ν .

Raghunathan, Srinivasan [University of California;↗