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,189 records · Page 66

Near Real-Time Probabilistic Damage Diagnosis Using Surrogate Modeling and High Performance Computing

This work investigates novel approaches to probabilistic damage diagnosis that utilize surrogate modeling and high performance computing (HPC) to achieve substantial computational speedup. Motivated by Digital Twin, a structural health management (SHM) paradigm that integrates vehicle-specific characteristics with continual in-situ damage diagnosis and prognosis, the methods studied herein yield near real-time damage assessments that could enable monitoring of a vehicle's health while it is operating (i.e. online SHM). High-fidelity modeling and uncertainty quantification (UQ), both critical to Digital Twin, are incorporated using finite element method simulations and Bayesian inference, respectively. The crux of the proposed Bayesian diagnosis methods, however, is the reformulation of the numerical sampling algorithms (e.g. Markov chain Monte Carlo) used to generate the resulting probabilistic damage estimates. To this end, three distinct methods are demonstrated for rapid sampling that utilize surrogate modeling and exploit various degrees of parallelism for leveraging HPC. The accuracy and computational efficiency of the methods are compared on the problem of strain-based crack identification in thin plates. While each approach has inherent problem-specific strengths and weaknesses, all approaches are shown to provide accurate probabilistic damage diagnoses and several orders of magnitude computational speedup relative to a baseline Bayesian diagnosis implementation.

Warner, James E.↗

Evolutionary reinforcement learning of dynamical large deviations

In this work, we show how to bound and calculate the likelihood of dynamical large deviations using evolutionary reinforcement learning. An agent, a stochastic model, propagates a continuous-time Monte Carlo trajectory and receives a reward conditioned upon the values of certain path-extensive quantities. Evolution produces progressively fitter agents, potentially allowing the calculation of a piece of a large-deviation rate function for a particular model and path-extensive quantity. For models with small state spaces, the evolutionary process acts directly on rates, and for models with large state spaces, the process acts on the weights of a neural network that parameterizes the model's rates. This approach shows how path-extensive physics problems can be considered within a framework widely used in machine learning.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multiple inflation and the WMAP 'glitches'. II. Data analysis and cosmological parameter extraction

Detailed analyses of the WMAP data indicate possible oscillatory features in the primordial curvature perturbation, which moreover appears to be suppressed beyond the present Hubble radius. Such deviations from the usual inflationary expectation of an approximately Harrison-Zeldovich spectrum are expected in the supergravity-based 'multiple inflation' model wherein phase transitions during inflation induce sudden changes in the mass of the inflaton, thus interrupting its slow roll. In a previous paper we calculated the resulting curvature perturbation and showed how the oscillations arise. Here we perform a Markov chain Monte Carlo fitting exercise using the 3-year WMAP data to determine how the fitted cosmological parameters vary when such a primordial spectrum is used as an input, rather than the usually assumed power-law spectrum. The concordance {lambda}CDM model is still a good fit when there is just a step in the spectrum. However, if there is a bump in the spectrum (due e.g. to two phase transitions in rapid succession), the precision cosmic microwave background data can be well fitted by a flat Einstein-de Sitter cosmology without dark energy. This however requires the Hubble constant to be h{approx_equal}0.44 which is lower than the locally measured value. To fit the Sloane Digital Sky Survey data on the power spectrum of galaxy clustering requires a {approx}10% component of hot dark matter, as would naturally be provided by 3 species of neutrinos of mass {approx}0.5 eV. This cold+hot dark matter model cannot however fit the position of the baryon acoustic peak in the luminous red galaxies redshift two-point correlation function. It may be possible to overcome these difficulties in an inhomogeneous Lemaitre-Tolman-Bondi cosmological model with a local void, which can potentially also account for the SN Ia Hubble diagram without invoking cosmic acceleration.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Learning an Eddy Viscosity Model Using Shrinkage and Bayesian Calibration: A Jet-in-Crossflow Case Study

In this paper, we demonstrate a statistical procedure for learning a high-order eddy viscosity model (EVM) from experimental data and using it to improve the predictive skill of a Reynolds-averaged Navier–Stokes (RANS) simulator. The method is tested in a three-dimensional (3D), transonic jet-in-crossflow (JIC) configuration. The process starts with a cubic eddy viscosity model (CEVM) developed for incompressible flows. It is fitted to limited experimental JIC data using shrinkage regression. The shrinkage process removes all the terms from the model, except an intercept, a linear term, and a quadratic one involving the square of the vorticity. The shrunk eddy viscosity model is implemented in an RANS simulator and calibrated, using vorticity measurements, to infer three parameters. The calibration is Bayesian and is solved using a Markov chain Monte Carlo (MCMC) method. A 3D probability density distribution for the inferred parameters is constructed, thus quantifying the uncertainty in the estimate. The phenomenal cost of using a 3D flow simulator inside an MCMC loop is mitigated by using surrogate models (“curve-fits”). A support vector machine classifier (SVMC) is used to impose our prior belief regarding parameter values, specifically to exclude nonphysical parameter combinations. The calibrated model is compared, in terms of its predictive skill, to simulations using uncalibrated linear and CEVMs. Finally, we find that the calibrated model, with one quadratic term, is more accurate than the uncalibrated simulator. The model is also checked at a flow condition at which the model was not calibrated.

42 ENGINEERING↗

Predicting Metabolic Reaction Networks with Perturbation-Theory Machine Learning (PTML) Models

Background: Checking the connectivity (structure) of complex Metabolic Reaction Networks(MRNs) models proposed for new microorganisms with promising properties is an importantgoal for chemical biology. Objective: In principle, we can perform a hand-on checking (Manual Curation). However, this is achallenging task due to the high number of combinations of pairs of nodes (possible metabolic reactions). Results: The CPTML linear model obtained using the LDA algorithm is able to discriminate nodes(metabolites) with the correct assignation of reactions from incorrect nodes with values of accuracy,specificity, and sensitivity in the range of 85-100% in both training and external validation dataseries. Methods: In this work, we used Combinatorial Perturbation Theory and Machine Learning techniquesto seek a CPTML model for MRNs >40 organisms compiled by Barabasis’ group. First, wequantified the local structure of a very large set of nodes in each MRN using a new class of node indexcalled Markov linear indices fk. Next, we calculated CPT operators for 150000 combinationsof query and reference nodes of MRNs. Last, we used these CPT operators as inputs of differentML algorithms. Conclusion: Meanwhile, PTML models based on Bayesian network, J48-Decision Tree and RandomForest algorithms were identified as the three best non-linear models with accuracy greaterthan 97.5%. The present work opens the door to the study of MRNs of multiple organisms usingPTML models.

Pharmacology & Pharmacy↗

Uncertainty Quantification of Hypothesis Testing for the Integrated Knowledge Engine

The Integrated Knowledge Engine (IKE) is a tool of Bayesian analysis, based on Bayesian Belief Networks or Bayesian networks for short. A Bayesian network is a graphical model (directed acyclic graph) that allows representing the probabilistic structure of many variables assuming a localized type of dependency called the Markov property. The Markov property in this instance makes any node or random variable to be independent of any non-descendant node given information about its parent. A direct consequence of this property is that it is relatively easy to incorporate new evidence and derive the appropriate consequences, which in general is not an easy or feasible task. Typically we use Bayesian networks as predictive models for a small subset of the variables, either the leave nodes or the root nodes. In IKE, since most applications deal with diagnostics, we are interested in predicting the likelihood of the root nodes given new observations on any of the children nodes. The root nodes represent the various possible outcomes of the analysis, and an important problem is to determine when we have gathered enough evidence to lean toward one of these particular outcomes. This document presents criteria to decide when the evidence gathered is sufficient to draw a particular conclusion or decide in favor of a particular outcome by quantifying the uncertainty in the conclusions that are drawn from the data. The material in this document is organized as follows: Section 2 presents briefly a forensics Bayesian network, and we explore evaluating the information provided by new evidence by looking first at the posterior distribution of the nodes of interest, and then at the corresponding posterior odds ratios. Section 3 presents a third alternative: Bayes Factors. In section 4 we finalize by showing the relation between the posterior odds ratios and Bayes factors and showing examples these cases, and in section 5 we conclude by providing clear guidelines of how to use these for the type of Bayesian networks used in IKE.

97 MATHEMATICS AND COMPUTING↗

Discrete generative diffusion models without stochastic differential equations: A tensor network approach

Diffusion models (DMs) are a class of generative machine learning methods that sample a target distribution by transforming samples of a trivial (often Gaussian) distribution using a learned stochastic differential equation. In standard DMs, this is done by learning a “score function” that reverses the effect of adding diffusive noise to the distribution of interest. Here we consider the generalisation of DMs to lattice systems with discrete degrees of freedom, and where noise is added via Markov chain jump dynamics. We show how to use tensor networks (TNs) to efficiently define and sample such “discrete diffusion models” (DDMs) without explicitly having to solve a stochastic differential equation. We show the following: (i) by parametrising the data and evolution operators as TNs, the denoising dynamics can be represented exactly; (ii) the auto-regressive nature of TNs allows to generate samples efficiently and without bias; (iii) for sampling Boltzmann-like distributions, TNs allow to construct an efficient learning scheme that integrates well with Monte Carlo. We illustrate this approach to study the equilibrium of two models with non-trivial thermodynamics, the d = 1 constrained Fredkin chain and the d = 2 Ising model. Published by the American Physical Society 2025

Causer, Luke (ORCID:0000000194243473)↗

Semi-analytic models for the CANDELS survey: comparison of predictions for intrinsic galaxy properties

We compare the predictions of three independently developed semi-analytic galaxy formation models (SAMs) that are being used to aid in the interpretation of results from the CANDELS survey. These models are each applied to the same set of halo merger trees extracted from the 'Bolshoi' high-resolution cosmological N-body simulation and are carefully tuned to match the local galaxy stellar mass function using the powerful method of Bayesian Inference coupled with Markov Chain Monte Carlo or by hand. The comparisons reveal that in spite of the significantly different parameterizations for star formation and feedback processes, the three models yield qualitatively similar predictions for the assembly histories of galaxy stellar mass and star formation over cosmic time. Comparing SAM predictions with existing estimates of the stellar mass function from z = 0-8, we show that the SAMs generally require strong outflows to suppress star formation in low-mass halos to match the present-day stellar mass function, as is the present common wisdom. However, all of the models considered produce predictions for the star formation rates (SFRs) and metallicities of low-mass galaxies that are inconsistent with existing data. The predictions for metallicity-stellar mass relations and their evolution clearly diverge between the models. We suggest that large differences in the metallicity relations and small differences in the stellar mass assembly histories of model galaxies stem from different assumptions for the outflow mass-loading factor produced by feedback. Importantly, while more accurate observational measurements for stellar mass, SFR and metallicity of galaxies at 1 < z < 5 will discriminate between models, the discrepancies between the constrained models and existing data of these observables have already revealed challenging problems in understanding star formation and its feedback in galaxy formation. The three sets of models are being used to construct catalogs of mock galaxies on light cones that have the same geometry as the CANDELS survey, which should be particularly useful for quantifying the biases and uncertainties on measurements and inferences from the real observations.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimal interdiction of unreactive Markovian evaders

The network interdiction problem arises in a wide variety of areas including military logistics, infectious disease control and counter-terrorism. In the classical formulation one is given a weighted network G(N, E) and the task is to find b nodes (or edges) whose removal would maximally increase the least-cost path from a source node s to a target node r. In practical applications. G represenLs a transportation or activity network; node/edge removal is done by an agent, the 'interdictor' against another agent the 'evader' who wants to traverse G from s to t along the least-cost route. Our work is motivated by cases in which both agents have bounded rationality: e.g. when the authorities set up road blocks to catch bank robbers, neither party can plot its actions with full information about the other. We introduce a novel model of network interdiction in which the motion of (possibly) several evaders i. described by a Markov pr cess on G.We further suppose that the evaden; do not respond to interdiction decisions because of time, knowledge or computational constraint . We prove that this interdiction problem is NP-hard, like the classical formulation, but unlike the classical problem the objective function is submodular. This implies that the solution could be approximated within 1-lie using a greedy algorithm. Exploiting submodularity again. we demonstrate that a 'priority' (or 'lazy') evaluation algorithm can improve performance by orders of magnitude. Taken together, the results bring closer realistic solutions to the interdiction problem on global-scale networks.

99 GENERAL AND MISCELLANEOUS↗

Stochastic quantization for complex actions

We use the stochastic quantization method to study systems with complex valued path integral weights. We assume a Langevin equation with a memory kernel and Einstein's relations with colored noise. The equilibrium solution of this non-Markovian Langevin equation is analyzed. We show that for a large class of elliptic non-Hermitian operators acting on scalar functions on Euclidean space, which define different models in quantum field theory, converge to an equilibrium state in the asymptotic limit of the Markov parameter {tau}{yields}{infinity}. Moreover, as we expected, we obtain the Schwinger functions of the theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On decoupling the integrals of cosmological perturbation theory

ABSTRACT Perturbation theory (PT) is often used to model statistical observables capturing the translation and rotation-invariant information in cosmological density fields. PT produces higher order corrections by integration over linear statistics of the density fields weighted by kernels resulting from recursive solution of the fluid equations. These integrals quickly become high dimensional and naively require increasing computational resources the higher the order of the corrections. Here, we show how to decouple the integrands that often produce this issue, enabling PT corrections to be computed as a sum of products of independent 1D integrals. Our approach is related to a commonly used method for calculating multiloop Feynman integrals in quantum field theory, the Gegenbauer Polynomial x-Space Technique. We explicitly reduce the three terms entering the 2-loop power spectrum, formally requiring 9D integrations, to sums over successive 1D radial integrals. These 1D integrals can further be performed as convolutions, rendering the scaling of this method Nglog Ng with Ng the number of grid points used for each fast Fourier transform. This method should be highly enabling for upcoming large-scale structure redshift surveys where model predictions at an enormous number of cosmological parameter combinations will be required by Monte Carlo Markov Chain searches for the best-fitting values.

Slepian, Zachary↗

High-dimensional maximum-entropy phase space tomography

Reconstructing 4D or 6D phase space distributions from 1D or 2D measurements is a challenging inverse problem encountered in particle accelerators. Entropy maximization is an established method to incorporate prior information in the reconstruction, but it is typically infeasible in high-dimensional spaces. In this paper, I review two recent approaches to high-dimensional entropy maximization. The first approach utilizes differentiable simulations and a class of generative models known as normalizing flows, whereas the second approach employs the method of Lagrange multipliers and Markov Chain Monte Carlo (MCMC) sampling. My aim is to provide a short explanation of each method using a common notation. I conclude by mentioning several unsolved problems in phase space tomography.

Hoover, Austin [ORNL] (ORCID:0000000153136962)↗

Maximum a posteriori classification of multifrequency, multilook, synthetic aperture radar intensity data

We present a maximum a posteriori (MAP) classifier for classifying multifrequency, multilook, single polarization SAR intensity data into regions or ensembles of pixels of homogeneous and similar radar backscatter characteristics. A model for the prior joint distribution of the multifrequency SAR intensity data is combined with a Markov random field for representing the interactions between region labels to obtain an expression for the posterior distribution of the region labels given the multifrequency SAR observations. The maximization of the posterior distribution yields Bayes's optimum region labeling or classification of the SAR data or its MAP estimate. The performance of the MAP classifier is evaluated by using computer-simulated multilook SAR intensity data as a function of the parameters in the classification process. Multilook SAR intensity data are shown to yield higher classification accuracies than one-look SAR complex amplitude data. The MAP classifier is extended to the case in which the radar backscatter from the remotely sensed surface varies within the SAR image because of incidence angle effects. The results obtained illustrate the practicality of the method for combining SAR intensity observations acquired at two different frequencies and for improving classification accuracy of SAR data.

Rignot, E.↗

Optimal interdiction of unreactive Markovian evaders

The interdiction problem arises in a variety of areas including military logistics, infectious disease control, and counter-terrorism. In the typical formulation of network interdiction. the task of the interdictor is to find a set of edges in a weighted network such that the removal of those edges would increase the cost to an evader of traveling on a path through the network. Our work is motivated by cases in which the evader has incomplete information about the network or lacks planning time or computational power, e.g. when authorities set up roadblocks to catch bank robbers, the criminals do not know all the roadblock locations or the best path to use for their escape. We introduce a model of network interdiction in which the motion of one or more evaders is described by Markov processes on a network and the evaders are assumed not to react to interdiction decisions. The interdiction objective is to find a node or set. of size at most B, that maximizes the probability of capturing the evaders. We prove that similar to the classical formulation this interdiction problem is NP-hard. But unlike the classical problem our interdiction problem is submodular and the optimal solution can be approximated within 1-lie using a greedy algorithm. Additionally. we exploit submodularity to introduce a priority evaluation strategy that speeds up the greedy algorithm by orders of magnitude. Taken together the results bring closer the goal of finding realistic solutions to the interdiction problem on global-scale networks.

99 GENERAL AND MISCELLANEOUS↗

Cosmological Evidence Modelling: a new simulation-based approach to constrain cosmology on non-linear scales

Extracting accurate cosmological information from galaxy–galaxy and galaxy–matter correlation functions on non-linear scales (${\lesssim } 10 \, h^{-1}{\rm {Mpc}}$) requires cosmological simulations. Additionally, one has to marginalize over several nuisance parameters of the galaxy–halo connection. However, the computational cost of such simulations prohibits naive implementations of stochastic posterior sampling methods like Markov chain Monte Carlo (MCMC) that would require of order $\mathcal {O}(10^6)$ samples in cosmological parameter space. Several groups have proposed surrogate models as a solution: a so-called emulator is trained to reproduce observables for a limited number of realizations in parameter space. Afterwards, this emulator is used as a surrogate model in an MCMC analysis. In this work, we demonstrate a different method called Cosmological Evidence Modelling (CEM). First, for each simulation, we calculate the Bayesian evidence marginalized over the galaxy–halo connection by repeatedly populating the simulation with galaxies. We show that this Bayesian evidence is directly related to the posterior probability of cosmological parameters. Finally, we build a physically motivated model for how the evidence depends on cosmological parameters as sampled by the simulations. We demonstrate the feasibility of CEM by using simulations from the Aemulus simulation suite and forecasting cosmological constraints from BOSS CMASS measurements of redshift-space distortions. Our analysis includes exploration of how galaxy assembly bias affects cosmological inference. Overall, CEM has several potential advantages over the more common approach of emulating summary statistics, including the ability to easily marginalize over highly complex models of the galaxy–halo connection and greater accuracy, thereby reducing the number of simulations required.

79 ASTRONOMY AND ASTROPHYSICS↗

Constraining the evolution of the CMB temperature with SZ measurements from Planck data

The CMB temperature-redshift relation, T{sub CMB}(z)=T{sub 0}(1+z), is a key prediction of the standard cosmology but is violated in many non-standard models. Constraining possible deviations from this law is an effective way to test the ΛCDM paradigm and to search for hints of new physics. We have determined T{sub CMB}(z), with a precision up to 3%, for a subsample (103 clusters) of the Planck SZ cluster catalog, at redshifts in the range 0.01–0.94, using measurements of the spectrum of the Sunyaev-Zel'dovich (SZ) effect obtained from Planck temperature maps at frequencies from 70 to 353 GHz. The method adopted to provide individual determinations of T{sub CMB}(z) at cluster redshift relies on the use of SZ intensity change, Δ I{sub SZ}(ν) at different frequencies and on a Monte Carlo Markov chain approach. By applying this method to the sample of 103 clusters, we limit possible deviations of the form T{sub CMB}(z)=T{sub 0}(1+z){sup 1−β} to be β= 0.012 ± 0.016, at 1σ uncertainty, consistent with the prediction of the standard model. Combining these measurements with previously published results, we get β=0.013±0.011.

79 ASTRONOMY AND ASTROPHYSICS↗

REFINED SYSTEM PARAMETERS AND TTV STUDY OF TRANSITING EXOPLANETARY SYSTEM HAT-P-20

We report new photometric observations of the transiting exoplanetary system HAT-P-20, obtained using CCD cameras at Yunnan Observatories and Ho Koon Nature Education cum Astronomical Centre, China, from 2010 to 2013, and Observatori Ca l’Ou, Sant Marti Sesgueioles, Spain, from 2013 to 2015. The observed data are corrected for systematic errors according to the coarse de-correlation and SYSREM algorithms, so as to enhance the signal of the transit events. In order to consistently model the star spots and transits of this exoplanetary system, we develop a highly efficient tool STMT based on the analytic models of Mandel and Agol and Montalto et al. The physical parameters of HAT-P-20 are refined by homogeneously analyzing our new data, the radial velocity data, and the earlier photometric data in the literature with the Markov chain Monte Carlo technique. New radii and masses of both host star and planet are larger than those in the discovery paper due to the discrepancy of the radius among K-dwarfs between predicted values by standard stellar models and empirical calibration from observations. Through the analysis of all available mid-transit times calculated with the normal model and spotted model, we conclude that the periodic transit timing variations in these transit events revealed by employing the normal model are probably induced by spot crossing events. From the analysis of the distribution of occulted spots by HAT-P-20b, we constrain the misaligned architecture between the planetary orbit and the spin of the host star.

79 ASTRONOMY AND ASTROPHYSICS↗