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,243 records · Page 69

Bayesian Approach to the Joint Inversion of Gravity and Magnetic Data, with Application to the Ismenius Area of Mars

This viewgraph presentation reviews a Bayesian approach to the inversion of gravity and magnetic data with specific application to the Ismenius Area of Mars. Many inverse problems encountered in geophysics and planetary science are well known to be non-unique (i.e. inversion of gravity the density structure of a body). In hopes of reducing the non-uniqueness of solutions, there has been interest in the joint analysis of data. An example is the joint inversion of gravity and magnetic data, with the assumption that the same physical anomalies generate both the observed magnetic and gravitational anomalies. In this talk, we formulate the joint analysis of different types of data in a Bayesian framework and apply the formalism to the inference of the density and remanent magnetization structure for a local region in the Ismenius area of Mars. The Bayesian approach allows prior information or constraints in the solutions to be incorporated in the inversion, with the "best" solutions those whose forward predictions most closely match the data while remaining consistent with assumed constraints. The application of this framework to the inversion of gravity and magnetic data on Mars reveals two typical challenges - the forward predictions of the data have a linear dependence on some of the quantities of interest, and non-linear dependence on others (termed the "linear" and "non-linear" variables, respectively). For observations with Gaussian noise, a Bayesian approach to inversion for "linear" variables reduces to a linear filtering problem, with an explicitly computable "error" matrix. However, for models whose forward predictions have non-linear dependencies, inference is no longer given by such a simple linear problem, and moreover, the uncertainty in the solution is no longer completely specified by a computable "error matrix". It is therefore important to develop methods for sampling from the full Bayesian posterior to provide a complete and statistically consistent picture of model uncertainty, and what has been learned from observations. We will discuss advanced numerical techniques, including Monte Carlo Markov

data analysis↗

Cosmic Microwave Background Anisotropy Numerical Solution (CMBAns) I: An Introduction to $C_l$ Calculation

Cosmological Boltzmann codes are often used by researchers for calculating the CMB angular power spectra from different theoretical models, for cosmological parameter estimation, etc. Therefore, the accuracy of a Boltzmann code is of utmost importance. Different Markov Chain Monte Carlo based parameter estimation algorithms typically require 10^3 - 10^4 iterations of Boltzmann code. This makes the time complexity of such codes another critical factor. In the last two decades, several Boltzmann packages, such as CMBFAST, CAMB, CMBEasy, CLASS etc., have been developed. In this paper, we present a new cosmological Boltzmann code, CMBAns, that can be used for accurate calculation of the CMB power spectrum. At present, CMBAns is developed for a flat background matrix. It is mostly written in the C language. However, we borrowed the concept of class from C++. This gives researchers the flexibility to develop their own independent package based on CMBAns, without an in-depth understanding of the source code. We also develop multiple stand-alone facilities which can be directly compiled and run on a given parameter set. In this paper, we discuss all the mathematical formulation, approximation schemes, integration methods etc., that are used in CMBAns. The package will be made available through github for public use in the near future.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Crystal Orientation-Dependent Reactivity of Oxide Surfaces in Contact with Lithium Metal

Understanding ionic transport across interfaces between dissimilar materials and the intrinsic chemical stability of such interfaces is a fundamental challenge spanning many disciplines and is of particular importance for designing conductive and stable solid electrolytes for solid-state Li-ion batteries. In this work, we establish a surface science-based approach for assessing the intrinsic stability of oxide materials in contact with Li metal. Through a combination of experimental and computational insights, using Nb-doped SrTiO3 (Nb/STO) single crystals as a model system, we were able to understand the impact of crystallographic orientation and surface morphology on the extent of the chemical reactions that take place between surface Nb, Ti, and Sr upon reaction with Li. By expanding our approach to investigate the intrinsic stability of the technologically relevant, polycrystalline Nb-doped lithium lanthanum zirconium oxide (Li6.5La3Zr1.5Nb0.5O12) system, we found that this material reacts with Li metal through the reduction of Nb, similar to that observed for Nb/STO. These results clearly demonstrate the feasibility of our approach to assess the intrinsic (in)stability of oxide materials for solid-state batteries and point to new strategies for understanding the performance of such systems.

36 MATERIALS SCIENCE↗

Development of Unsteady Aerodynamic State-Space Models from CFD-Based Pulse Responses

A method for computing discrete-time state-space models of linearized unsteady aerodynamic behavior directly from aeroelastic CFD codes is presented. The method involves the treatment of CFD-based pulse responses as Markov parameters for use in a system identification /realization algorithm. Results are presented for the AGARD 445.6 Aeroelastic Wing with four aeroelastic modes at a Mach number of 0.96 using the EZNSS Euler/Navier-Stokes flow solver with aeroelastic capability. The System/Observer/Controller Identification Toolbox (SOCIT) algorithm, based on the Ho-Kalman realization algorithm, is used to generate 15th- and 32nd-order discrete-time state-space models of the unsteady aerodynamic response of the wing over the entire frequency range of interest.

Silva, Walter A.↗

Plug & play directed evolution of proteins with gradient-based discrete MCMC

Abstract A long-standing goal of machine-learning-based protein engineering is to accelerate the discovery of novel mutations that improve the function of a known protein. We introduce a sampling framework for evolving proteins in silico that supports mixing and matching a variety of unsupervised models, such as protein language models, and supervised models that predict protein function from sequence. By composing these models, we aim to improve our ability to evaluate unseen mutations and constrain search to regions of sequence space likely to contain functional proteins. Our framework achieves this without any model fine-tuning or re-training by constructing a product of experts distribution directly in discrete protein space. Instead of resorting to brute force search or random sampling, which is typical of classic directed evolution, we introduce a fast Markov chain Monte Carlo sampler that uses gradients to propose promising mutations. We conduct in silico directed evolution experiments on wide fitness landscapes and across a range of different pre-trained unsupervised models, including a 650 M parameter protein language model. Our results demonstrate an ability to efficiently discover variants with high evolutionary likelihood as well as estimated activity multiple mutations away from a wild type protein, suggesting our sampler provides a practical and effective new paradigm for machine-learning-based protein engineering.

59 BASIC BIOLOGICAL SCIENCES↗

Radiation Source Localization Using Surrogate Models Constructed from 3-D Monte Carlo Transport Physics Simulations

Recent research has focused on the development of surrogate models for radiation source localization in a simulated urban domain. We employ the Monte Carlo N-Particle (MCNP) code to provide high- delity simulations of radiation transport within an urban domain. The model is constructed to employ a source location (x, y, z) as input and return the estimated count rate for a set of speci ed detector locations. Because MCNP simulations are computationally expensive, we develop e cient and accurate surrogate models of the detector responses. We construct surrogate models using Gaussian processes (GP) and neural networks (NN) that we train and verify using the MCNP simulations. The trained surrogate models provide an e cient framework for Bayesian inference and experimental design. We employ Delayed Rejection Adaptive Metropolis (DRAM), a Markov Chain Monte Carlo (MCMC) algorithm, to infer the location and intensity of an unknown source. The DRAM results yield a posterior probability distribution for the source's location conditioned on the observed detector count rates. The posterior distribution exhibits regions of high and low probability within the simulated environment identifying potential source locations. In this manner, we can quantify the source location to within at least one of these regions of high probability in the considered cases. Employing these methods, we are able to reduce the space of potential source locations by at least 60%.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SDSS-IV MaStar: theoretical atmospheric parameters for the MaNGA stellar library

ABSTRACT We calculate the fundamental stellar parameters effective temperature, surface gravity, and iron abundance – Teff, log g, [Fe/H] – for the final release of the Mapping Nearby Galaxies at APO (MaNGA) Stellar Library (MaStar), containing 59 266 per-visit-spectra for 24 290 unique stars at intermediate resolution (R ∼ 1800) and high S/N (median = 96). We fit theoretical spectra from model atmospheres by both MARCS and BOSZ-ATLAS9 to the observed MaStar spectra, using the full spectral fitting code pPXF. We further employ a Bayesian approach, using a Markov Chain Monte Carlo (MCMC) technique to map the parameter space and obtain uncertainties. Originally in this paper, we cross match MaStar observations with Gaia photometry, which enable us to set reliable priors and identify outliers according to stellar evolution. In parallel to the parameter determination, we calculate corresponding stellar population models to test the reliability of the parameters for each stellar evolutionary phase. We further assess our procedure by determining parameters for standard stars such as the Sun and Vega and by comparing our parameters with those determined in the literature from high-resolution spectroscopy (APOGEE and SEGUE) and from lower resolution matching template (LAMOST). The comparisons, considering the different methodologies and S/N of the literature surveys, are favourable in all cases. Our final parameter catalogue for MaStar cover the following ranges: 2592 ≤ Teff ≤ 32 983 K; −0.7 ≤ log g ≤ 5.4 dex; −2.9 ≤ [Fe/H] ≤ 1.0 dex and will be available with the last SDSS-IV Data Release, in 2021 December.

79 ASTRONOMY AND ASTROPHYSICS↗

Bayesian Calibration of Stochastic Agent Based Model via Random Forest

Agent-based models (ABM) provide an excellent framework for modeling outbreaks and interventions in epidemiology by explicitly accounting for diverse individual interactions and environments. However, these models are usually stochastic and highly parametrized, requiring precise calibration for predictive performance. When considering realistic numbers of agents and properly accounting for stochasticity, this high-dimensional calibration can be computationally prohibitive. This paper presents a random forest-based surrogate modeling technique to accelerate the evaluation of ABMs and demonstrates its use to calibrate an epidemiological ABM named CityCOVID via Markov chain Monte Carlo (MCMC). The technique is first outlined in the context of CityCOVID's quantities of interest, namely hospitalizations and deaths, by exploring dimensionality reduction via temporal decomposition with principal component analysis (PCA) and via sensitivity analysis. The calibration problem is then presented, and samples are generated to best match COVID-19 hospitalization and death numbers in Chicago from March to June in 2020. Further, these results are compared with previous approximate Bayesian calibration (IMABC) results, and their predictive performance is analyzed, showing improved performance with a reduction in computation.

60 APPLIED LIFE SCIENCES↗

Confronting interacting dark radiation scenarios with cosmological data

Dark radiation (DR) is generally predicted in new physics scenarios that address fundamental puzzles of the Standard Model or tensions in the cosmological data. Cosmological data have the sensitivity to constrain not only the energy density of DR but also whether it is interacting. In this paper, we present a systematic study of five types of interacting DR (free-streaming, fluid, decoupling, instantaneous decoupling, and recoupling DR) and their impact on cosmological observables. We modify the Boltzmann hierarchy to describe all these types of interacting DR under the relaxation time approximation. We, for the first time, robustly calculate the collision terms for recoupling scalar DR and provide a better estimation of the recoupling transition redshift. We demonstrate the distinct features of each type of DR on the cosmic microwave background and matter power spectra. We perform Markov-chain Monte Carlo scans using the Planck 2018 data and baryon acoustic oscillation data. Assuming no new physics in the standard model neutrino sector, we find no statistically significant constraints on the couplings of DR, although there is a slight preference for the fluidlike limit of all the cases. In the case of instantaneous decoupling DR, this limit corresponds to a late transition redshift around recombination. Furthermore, the ΔN eff constraint varies marginally depending on the type of DR.

79 ASTRONOMY AND ASTROPHYSICS↗

CosmoSIS: A system for MC parameter estimation

CosmoSIS is a modular system for cosmological parameter estimation, based on Markov Chain Monte Carlo and related techniques. It provides a series of samplers, which drive the exploration of the parameter space, and a series of modules, which calculate the likelihood of the observed data for a given physical model, determined by the location of a sample in the parameter space. While CosmoSIS ships with a set of modules that calculate quantities of interest to cosmologists, there is nothing about the framework itself, nor in the Markov Chain Monte Carlo technique, that is specific to cosmology. Thus CosmoSIS could be used for parameter estimation problems in other fields, including HEP. This paper describes the features of CosmoSIS and show an example of its use outside of cosmology. Furthermore, it also discusses how collaborative development strategies differ between two different communities: that of HEP physicists, accustomed to working in large collaborations, and that of cosmologists, who have traditionally not worked in large groups.

97 MATHEMATICS AND COMPUTING↗

Bayesian probability of agreement for comparing the similarity of response surfaces

For a variety of linear and generalized linear models, there may be interest in evaluating whether the expected response values in two different populations are sufficiently similar to be considered practically equivalent. The probability of agreement has been introduced as a strategy for quantifying the similarity between two groups. We propose a Bayesian version of the probability of agreement to quantify the similarity between linear and generalized linear response surfaces. The proposed methodology is based on Markov chain Monte Carlo estimation and it allows for an intuitive interpretation based directly on population parameters. As demonstrated, the methodology can be flexibly applied to a variety of different models. We illustrate its use with three examples for which the response depends on predictor variables through a linear, logistic, or Poisson regression model. The computation associated with this approach has been automated with a freely available R Shiny app.

97 MATHEMATICS AND COMPUTING↗

Diffusion growth mechanism of penta-twinned Ag nanocrystals from decahedral seeds

Crystals with penta-twinned structures can be produced from diverse fcc metals, but the mechanisms that control the final product shapes are still not well understood. By using the theory of absorbing Markov chains to account for the growth of penta-twinned decahedral seeds via atom deposition and surface diffusion, we predicted the formation of various types of products: decahedra, nanorods, and nanowires. We showed that the type of product depends on the morphology of the seed and that small differences between various seed morphologies can lead to significantly different products. For the case of uncapped decahedra seeds, we compared predictions from our model to nanowire morphologies obtained in two different experiments and obtained favorable agreement. Finally, possible extensions of our model are indicated.

36 MATERIALS SCIENCE↗

Network Modeling of Complex Data Sets

We demonstrate a selection of network and machine learning techniques useful in the analysis of complex datasets, including 2-way similarity networks, Markov clustering, enrichment statistical networks, FCROS differential analysis, and random forests. We demonstrate each of these techniques on the Populus trichocarpa gene expression atlas.

Jones, Piet C.↗

Decoherence and dissipation of a quantum harmonic oscillator coupled to two-level systems

We derive and analyze the Born-Markov master equation for a quantum harmonic oscillator interacting with a bath of independent two-level systems. This hitherto virtually unexplored model plays a fundamental role as one of the four 'canonical' system-environment models for decoherence and dissipation. To investigate the influence of further couplings of the environmental spins to a dissipative bath, we also derive the master equation for a harmonic oscillator interacting with a single spin coupled to a bosonic bath. Our models are experimentally motivated by quantum-electromechanical systems and micron-scale ion traps. Decoherence and dissipation rates are found to exhibit temperature dependencies significantly different from those in quantum Brownian motion. In particular, the systematic dissipation rate for the central oscillator decreases with increasing temperature and goes to zero at zero temperature, but there also exists a temperature-independent momentum-diffusion (heating) rate.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sampling graphs with a prescribed joint degree distribution using Markov Chains.

One of the most influential results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent work has shown that while these generative models do have the right degree distribution, they are not good models for real life networks due to their differences on other important metrics like conductance. We believe this is, in part, because many of these real-world networks have very different joint degree distributions, i.e. the probability that a randomly selected edge will be between nodes of degree k and l. Assortativity is a sufficient statistic of the joint degree distribution, and it has been previously noted that social networks tend to be assortative, while biological and technological networks tend to be disassortative. We suggest that the joint degree distribution of graphs is an interesting avenue of study for further research into network structure. We provide a simple greedy algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov Chain method for sampling them. We also show that the state space of simple graphs with a fixed degree distribution is connected via endpoint switches. We empirically evaluate the mixing time of this Markov Chain by using experiments based on the autocorrelation of each edge.

99 GENERAL AND MISCELLANEOUS↗

Persistence and memory timescales in root‐zone soil moisture dynamics

Abstract The memory timescale that characterizes root‐zone soil moisture remains the dominant measure in seasonal forecasts of land‐climate interactions. This memory is a quasi‐deterministic timescale associated with the losses (e.g., evapotranspiration) from the soil column and is often interpreted as persistence in soil moisture states. Persistence, however, represents a distribution of time periods where soil moisture resides above or below some prescribed threshold and is therefore inherently probabilistic. Using multiple soil moisture data sets collected at high resolution (subhourly) across different biomes and climates, this paper explores the differences, underlying dynamics, and relative importance of memory and persistence timescales in root‐zone soil moisture. A first‐order Markov process, commonly used to interpret soil moisture fluctuations derived from climate simulations, is also used as a reference model. Persistence durations of soil moisture below the plant water‐stress level (chosen as the threshold), and the temporal spectrum of upcrossings and downcrossings of this threshold, are compared to the memory timescale and spectrum of the full time series, respectively. The results indicate that despite the differences between meteorological drivers, the spectrum of threshold‐crossings is similar across sites, and follows a unique relation with that of the full soil moisture series. The distribution of persistence times exhibits an approximate stretched exponential type and reflects a likelihood of exceeding the memory at all sites. However, the rainfall counterpart of these distributions shows that persistence of dry atmospheric periods is less likely at sites with long soil moisture memory. The cluster exponent, a measure of the density of threshold‐crossings in a time frame, reveals that the clustering tendency in rainfall events (on‐off switches) does not translate directly to clustering in soil moisture. This is particularly the case in climates where rainfall and evapotranspiration are out of phase, resulting in less ordered (more independent) persistence in soil moisture than in rainfall.

Ghannam, Khaled↗

Characterizing the gravitational wave signature from cosmic string cusps

Cosmic strings are predicted to form kinks that travel along the string, and cusps, where a small region of the string moves at close to the speed of light. These disturbances are radiated away as highly beamed gravitational waves that produce a burst like pulse as the cone of emission sweeps past an observer. Gravitational wave detectors such as the Laser Interferometer Space Antenna (LISA) and the Laser Interferometer Gravitational wave Observatory (LIGO) will be capable of detecting these bursts for a wide class of string models. Such a detection would illuminate the fields of string theory, cosmology, and relativity. Here, we develop template based Markov chain Monte Carlo (MCMC) techniques that can efficiently detect and characterize the signals from cosmic string cusps. We estimate how well the signal parameters can be recovered by the advanced LIGO-Virgo network and the LISA detector using a combination of MCMC and Fisher matrix techniques. We also consider joint detections by the ground- and space-based instruments. We show that a parallel tempered MCMC approach can detect and characterize the signals from cosmic string cusps, and we demonstrate the utility of this approach on simulated data from the third round of mock LISA data challenges.

39↗

Sythesis of MCMC and Belief Propagation

Markov Chain Monte Carlo (MCMC) and Belief Propagation (BP) are the most popular algorithms for computational inference in Graphical Models (GM). In principle, MCMC is an exact probabilistic method which, however, often suffers from exponentially slow mixing. In contrast, BP is a deterministic method, which is typically fast, empirically very successful, however in general lacking control of accuracy over loopy graphs. In this paper, we introduce MCMC algorithms correcting the approximation error of BP, i.e., we provide a way to compensate for BP errors via a consecutive BP-aware MCMC. Our framework is based on the Loop Calculus (LC) approach which allows to express the BP error as a sum of weighted generalized loops. Although the full series is computationally intractable, it is known that a truncated series, summing up all 2-regular loops, is computable in polynomial-time for planar pair-wise binary GMs and it also provides a highly accurate approximation empirically. Motivated by this, we first propose a polynomial-time approximation MCMC scheme for the truncated series of general (non-planar) pair-wise binary models. Our main idea here is to use the Worm algorithm, known to provide fast mixing in other (related) problems, and then design an appropriate rejection scheme to sample 2-regular loops. Furthermore, we also design an efficient rejection-free MCMC scheme for approximating the full series. The main novelty underlying our design is in utilizing the concept of cycle basis, which provides an efficient decomposition of the generalized loops. In essence, the proposed MCMC schemes run on transformed GM built upon the non-trivial BP solution, and our experiments show that this synthesis of BP and MCMC outperforms both direct MCMC and bare BP schemes.

97 MATHEMATICS AND COMPUTING↗