Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Markov process”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,243 records · Page 69

Model-Data for Joint Estimation of Biogeochemical Model Parameters from Multiple Experiments: A Bayesian Approach Applied to Mercury Methylation

This modeling archive supports the manuscript submitted for publication in the Environmental Modeling and Software. This study is supported by ORNL-SFA and IDEAS-Watershed. This study aims to improve calibration of complex biogeochemical models using datasets from multiple experiments targeting specific subprocesses. The proposed Bayesian joint-fitting scheme calibrates the entire biogeochemical model in one go using all the available datasets and estimate parameter uncertainties using Markov Chain Monte Carlo (MCMC). This allows for complete propagation of uncertainties and utilization of the information shared between different datasets. Mapping joint distribution of parameters guides model improvement by identifying null spaces in the parameter space. This archive contains files used to perform MCMC, post-process outputs and visualize results.

East Fork Poplar Creek↗

Evaluation methodologies for an advanced information processing system

The system concept and requirements for an Advanced Information Processing System (AIPS) are briefly described, but the emphasis of this paper is on the evaluation methodologies being developed and utilized in the AIPS program. The evaluation tasks include hardware reliability, maintainability and availability, software reliability, performance, and performability. Hardware RMA and software reliability are addressed with Markov modeling techniques. The performance analysis for AIPS is based on queueing theory. Performability is a measure of merit which combines system reliability and performance measures. The probability laws of the performance measures are obtained from the Markov reliability models. Scalar functions of this law such as the mean and variance provide measures of merit in the AIPS performability evaluations.

Schabowsky, R. S., Jr.↗

An FPGA-based hardware accelerator supporting sensitive sequence homology filtering with profile hidden Markov models

Abstract Background Sequence alignment lies at the heart of genome sequence annotation. While the BLAST suite of alignment tools has long held an important role in alignment-based sequence database search, greater sensitivity is achieved through the use of profile hidden Markov models (pHMMs). Here, we describe an FPGA hardware accelerator, called HAVAC, that targets a key bottleneck step (SSV) in the analysis pipeline of the popular pHMM alignment tool, HMMER. Results The HAVAC kernel calculates the SSV matrix at 1739 GCUPS on a $$\sim$$ ∼ $3000 Xilinx Alveo U50 FPGA accelerator card, $$\sim$$ ∼ 227× faster than the optimized SSV implementation in nhmmer . Accounting for PCI-e data transfer data processing, HAVAC is 65× faster than nhmmer’s SSV with one thread and 35× faster than nhmmer with four threads, and uses $$\sim$$ ∼ 31% the energy of a traditional high end Intel CPU. Conclusions HAVAC demonstrates the potential offered by FPGA hardware accelerators to produce dramatic speed gains in sequence annotation and related bioinformatics applications. Because these computations are performed on a co-processor, the host CPU remains free to simultaneously compute other aspects of the analysis pipeline.

59 BASIC BIOLOGICAL SCIENCES↗

Self-organized criticality in multi-pulse gamma-ray bursts

The variability in multi-pulse gamma-ray bursts (GRBs) may help to reveal the mechanism of underlying processes from the central engine. To investigate whether the self-organized criticality (SOC) phenomena exist in the prompt phase of GRBs, we statistically study the properties of GRBs with more than 3 pulses in each burst by fitting the distributions of several observed physical variables with a Markov Chain Monte Carlo approach, including the isotropic energy E iso , the duration time T, and the peak count rate P of each pulse. Our sample consists of 454 pulses in 93 GRBs observed by the CGRO/BATSE satellite. The best-fitting values and uncertainties for these power-law indices of the differential frequency distributions are: α$^{d}_{E}$ = 1.54±0.09, α$^{d}_{T}$ = 1.82±$^{+0.14}_{0.15}$ and α$^{d}_{P}$ = 2.09$^{+0.18}_{–0.19}$, while the power-law indices in the cumulative frequency distributions are: α$^{c}_{E}$ = 1.44$^{+0.08}_{–0.10}$, α$^{c}_{T}$ = 1.75$^{+0.141}_{–0.13}$ and α$^{c}_{P}$ = 1.99$^{+0.16}_{–0.19}$. We find that these distributions are roughly consistent with the physical framework of a Fractal-Diffusive, Self-Organized Criticality (FD-SOC) system with the spatial dimension S = 3 and the classical diffusion β=1. The results of this study support that the jet responsible for the GRBs should be magnetically dominated and magnetic instabilities (e.g., kink model, or tearing-model instability) lead the GRB emission region into the SOC state.

79 ASTRONOMY AND ASTROPHYSICS↗

Spatial estimation from remotely sensed data via empirical Bayes models

Multichannel satellite image data, available as LANDSAT imagery, are recorded as a multivariate time series (four channels, multiple passovers) in two spatial dimensions. The application of parametric empirical Bayes theory to classification of, and estimating the probability of, each crop type at each of a large number of pixels is considered. This theory involves both the probability distribution of imagery data, conditional on crop types, and the prior spatial distribution of crop types. For the latter Markov models indexed by estimable parameters are used. A broad outline of the general theory reveals several questions for further research. Some detailed results are given for the special case of two crop types when only a line transect is analyzed. Finally, the estimation of an underlying continuous process on the lattice is discussed which would be applicable to such quantities as crop yield.

Hill, J. R.↗

On identified predictive control

Self-tuning control algorithms are potential successors to manually tuned PID controllers traditionally used in process control applications. A very attractive design method for self-tuning controllers, which has been developed over recent years, is the long-range predictive control (LRPC). The success of LRPC is due to its effectiveness with plants of unknown order and dead-time which may be simultaneously nonminimum phase and unstable or have multiple lightly damped poles (as in the case of flexible structures or flexible robot arms). LRPC is a receding horizon strategy and can be, in general terms, summarized as follows. Using assumed long-range (or multi-step) cost function the optimal control law is found in terms of unknown parameters of the predictor model of the process, current input-output sequence, and future reference signal sequence. The common approach is to assume that the input-output process model is known or separately identified and then to find the parameters of the predictor model. Once these are known, the optimal control law determines control signal at the current time t which is applied at the process input and the whole procedure is repeated at the next time instant. Most of the recent research in this field is apparently centered around the LRPC formulation developed by Clarke et al., known as generalized predictive control (GPC). GPC uses ARIMAX/CARIMA model of the process in its input-output formulation. In this paper, the GPC formulation is used but the process predictor model is derived from the state space formulation of the ARIMAX model and is directly identified over the receding horizon, i.e., using current input-output sequence. The underlying technique in the design of identified predictive control (IPC) algorithm is the identification algorithm of observer/Kalman filter Markov parameters developed by Juang et al. at NASA Langley Research Center and successfully applied to identification of flexible structures.

Bialasiewicz, Jan T.↗

Transport coefficient approach for characterizing nonequilibrium dynamics in soft matter

Nonequilibrium states in soft condensed matter require a systematic approach to characterize and model materials, enhancing predictability and applications. Among the tools, X-ray photon correlation spectroscopy (XPCS) provides exceptional temporal and spatial resolution to extract dynamic insight into the properties of the material. However, existing models might overlook intricate details. We introduce an approach for extracting the transport coefficient, denoted as $J(t)$, from the XPCS studies. This coefficient is a fundamental parameter in nonequilibrium statistical mechanics and is crucial for characterizing transport processes within a system. Our method unifies the Green–Kubo formulas associated with various transport coefficients, including gradient flows, particle–particle interactions, friction matrices, and continuous noise. We achieve this by integrating the collective influence of random and systematic forces acting on the particles within the framework of a Markov chain. We initially validated this method using molecular dynamics simulations of a system subjected to changes in temperatures over time. Subsequently, we conducted further verification using experimental systems reported in the literature and known for their complex nonequilibrium characteristics. The results, including the derived $J(t)$ and other relevant physical parameters, align with the previous observations and reveal detailed dynamical information in nonequilibrium states. This approach represents an advancement in XPCS analysis, addressing the growing demand to extract intricate nonequilibrium dynamics. Further, the methods presented are agnostic to the nature of the material system and can be potentially expanded to hard condensed matter systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Radar-Based Bayesian Estimation of Ice Crystal Growth Parameters within a Microphysical Model

The potential for polarimetric Doppler radar measurements to improve predictions of ice microphysical processes within an idealized model–observational framework is examined. In an effort to more rigorously constrain ice growth processes (e.g., vapor deposition) with observations of natural clouds, a novel framework is developed to compare simulated and observed radar measurements, coupling a bulk adaptive-habit model of vapor growth to a polarimetric radar forward model. Bayesian inference on key microphysical model parameters is then used, via a Markov chain Monte Carlo sampler, to estimate the probability distribution of the model parameters. The statistical formalism of this method allows for robust estimates of the optimal parameter values, along with (non-Gaussian) estimates of their uncertainty. To demonstrate this framework, observations from Department of Energy radars in the Arctic during a case of pristine ice precipitation are used to constrain vapor deposition parameters in the adaptive habit model. The resulting parameter probability distributions provide physically plausible changes in ice particle density and aspect ratio during growth. A lack of direct constraint on the number concentration produces a range of possible mean particle sizes, with the mean size inversely correlated to number concentration. Consistency is found between the estimated inherent growth ratio and independent laboratory measurements, increasing confidence in the parameter PDFs and demonstrating the effectiveness of the radar measurements in constraining the parameters. Furthermore, the combined Doppler and polarimetric observations produce the highest-confidence estimates of the parameter PDFs, with the Doppler measurements providing a stronger constraint for this case.

54 ENVIRONMENTAL SCIENCES↗

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↗

Radar-Based Bayesian Estimation of Ice Crystal Growth Parameters within a Microphysical Model

The potential for polarimetric Doppler radar measurements to improve predictions of ice microphysical processes within an idealized model–observational framework is examined. In an effort to more rigorously constrain ice growth processes (e.g., vapor deposition) with observations of natural clouds, a novel framework is developed to compare simulated and observed radar measurements, coupling a bulk adaptive-habit model of vapor growth to a polarimetric radar forward model. Bayesian inference on key microphysical model parameters is then used, via a Markov chain Monte Carlo sampler, to estimate the probability distribution of the model parameters. The statistical formalism of this method allows for robust estimates of the optimal parameter values, along with (non-Gaussian) estimates of their uncertainty. To demonstrate this framework, observations from Department of Energy radars in the Arctic during a case of pristine ice precipitation are used to constrain vapor deposition parameters in the adaptive habit model. The resulting parameter probability distributions provide physically plausible changes in ice particle density and aspect ratio during growth. A lack of direct constraint on the number concentration produces a range of possible mean particle sizes, with the mean size inversely correlated to number concentration. Consistency is found between the estimated inherent growth ratio and independent laboratory measurements, increasing confidence in the parameter PDFs and demonstrating the effectiveness of the radar measurements in constraining the parameters. The combined Doppler and polarimetric observations produce the highest-confidence estimates of the parameter PDFs, with the Doppler measurements providing a stronger constraint for this case.

Robert S. Schrom↗

Calibration of a distributed flood forecasting model with input uncertainty using a Bayesian framework

In the process of calibrating distributed hydrological models, accounting for input uncertainty is important, yet challenging. In this study, we develop a Bayesian model to estimate parameters associated with a geomorphology‐based hydrological model (GBHM). The GBHM model uses geomorphic characteristics to simplify model structure and physically based methods to represent hydrological processes. We divide the observed discharge into low‐ and high‐flow data, and use the first‐order autoregressive model to describe their temporal dependence. We consider relative errors in rainfall as spatially distributed variables and estimate them jointly with the GBHM parameters. The joint posterior probability distribution is explored using Markov chain Monte Carlo methods, which include Metropolis‐Hastings, delay rejection adaptive Metropolis, and Gibbs sampling methods. We evaluate the Bayesian model using both synthetic and field data sets. The synthetic case study demonstrates that the developed method generally is effective in calibrating GBHM parameters and in estimating their associated uncertainty. The calibration ignoring input errors has lower accuracy and lower reliability compared to the calibration that includes estimation of the input errors, especially under model structure uncertainty. The field case study shows that calibration of GBHM parameters under complex field conditions remains a challenge. Although jointly estimating input errors and GBHM parameters improves the continuous ranked probability score and the consistency of the predictive distribution with the observed data, the improvement is incremental. To better calibrate parameters in a distributed model, such as GBHM here, we need to develop a more complex model and incorporate much more information.

54 ENVIRONMENTAL SCIENCES↗

Fault trees and imperfect coverage

A new algorithm is presented for solving the fault tree. The algorithm includes the dynamic behavior of the fault/error handling model but obviates the need for the Markov chain solution. As the state space is expanded in a breadth-first search (the same is done in the conversion to a Markov chain), the state's contribution to each future state is calculated exactly. A dynamic state truncation technique is also presented; it produces bounds on the unreliability of the system by considering only part of the state space. Since the model is solved as the state space is generated, the process can be stopped as soon as the desired accuracy is reached.

Dugan, Joanne B.↗

Inference of reaction rate parameters based on summary statistics from experiments

Here, we present the results of an application of Bayesian inference and maximum entropy methods for the estimation of the joint probability density for the Arrhenius rate para meters of the rate coefficient of the H 2 /O 2 -mechanism chain branching reaction H + O 2 → OH + O. Available published data is in the form of summary statistics in terms of nominal values and error bars of the rate coefficient of this reaction at a number of temperature values obtained from shock-tube experiments. Our approach relies on generating data, in this case OH concentration profiles, consistent with the given summary statistics, using Approximate Bayesian Computation methods and a Markov Chain Monte Carlo procedure. The approach permits the forward propagation of parametric uncertainty through the computational model in a manner that is consistent with the published statistics. A consensus joint posterior on the parameters is obtained by pooling the posterior parameter densities given each consistent data set. To expedite this process, we construct efficient surrogates for the OH concentration using a combination of Pad'e and polynomial approximants. These surrogate models adequately represent forward model observables and their dependence on input parameters and are computationally efficient to allow their use in the Bayesian inference procedure. We also utilize Gauss-Hermite quadrature with Gaussian proposal probability density functions for moment computation resulting in orders of magnitude speedup in data likelihood evaluation. Despite the strong non-linearity in the model, the consistent data sets all res ult in nearly Gaussian conditional parameter probability density functions. The technique also accounts for nuisance parameters in the form of Arrhenius parameters of other rate coefficients with prescribed uncertainty. The resulting pooled parameter probability density function is propagated through stoichiometric hydrogen-air auto-ignition computations to illustrate the need to account for correlation among the Arrhenius rate parameters of one reaction and across rate parameters of different reactions.

97 MATHEMATICS AND COMPUTING↗

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

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↗

Distributed memory parallel Markov random fields using graph partitioning

Markov random fields (MRF) based algorithms have attracted a large amount of interest in image analysis due to their ability to exploit contextual information about data. Image data generated by experimental facilities, though, continues to grow larger and more complex, making it more difficult to analyze in a reasonable amount of time. Applying image processing algorithms to large datasets requires alternative approaches to circumvent performance problems. Aiming to provide scientists with a new tool to recover valuable information from such datasets, we developed a general purpose distributed memory parallel MRF-based image analysis framework (MPI-PMRF). MPI-PMRF overcomes performance and memory limitations by distributing data and computations across processors. The proposed approach was successfully tested with synthetic and experimental datasets. Additionally, the performance of the MPI-PMRF framework is analyzed through a detailed scalability study. We show that a performance increase is obtained while maintaining an accuracy of the segmentation results higher than 98%. The contributions of this paper are: (a) development of a distributed memory MRF framework; (b) measurement of the performance increase of the proposed approach; (c) verification of segmentation accuracy in both synthetic and experimental, real-world datasets

97 MATHEMATICS AND COMPUTING↗

Cyote-attack Chain Estimator

Attack Chain Estimator (ACE) Application Overview The Attack Chain Estimator (ACE) Application is a sophisticated tool designed for the ingestion, classification, sequencing, and enrichment of cybersecurity threat reports. This application leverages advanced machine learning models and extensive historical data to provide comprehensive insights into cyber threats, specifically targeting Industrial Control Systems (ICS). Purpose The primary functions of the ACE Application include: Ingestion of Cybersecurity Threat Reporting: Capable of ingesting text-based threat reports in markdown or text file format. Supports ingestion of structured data from other sources in STIX/JSON format. Classification of Report’s Text-Based Events: Utilizes a DeBERTa classifier, specifically trained on cybersecurity data, to map the events to MITRE ATT&CK for ICS Tactics and Techniques. Classification is performed using multiple Jupyter notebooks and machine learning workflows hosted as FastAPI microservices: regex_data deberta_base_35_train_hft_classifier_mlflow.ipynb hft_regex_classifier_mlflow.ipynb param_train_hft_classifier_mlflow.ipynb regex_tactic_tech.ipynb Ordering of Tactics, Techniques, and Observable Events: Sequences the identified tactics, techniques, and events to form a coherent attack chain. Enrichment with Historical Attack Chain Details: Enhances the attack chain with details from historical attacks using a Markov model developed from CyOTE Precursor Analysis Report data. The Markov model is available as a FastAPI endpoint for seamless integration. Enrichment with Adversary Emulation Capabilities Data: Integrates adversary emulation capabilities data using MITRE Caldera for OT adversary abilities UUIDs. Export of Output Files: Provides options to export the enriched attack chain in JSON or CSV formats. Routing of Output to Other Applications: Facilitates routing of output to various platforms and applications, including: Threat Intelligence Platforms COREII Scout for Threat Intelligence Analysis COREII Modeling and Simulation for Adversary Emulation Technical Description The ACE Application is an advanced cybersecurity tool designed to provide detailed threat analysis and sequence generation. It is built on a robust architecture that integrates natural language processing, machine learning, and historical data modeling. Key Components: Data Ingestion Module: Handles the input of threat reports and data from various formats, ensuring flexibility in data sources. Classification Engine: Employs DeBERTa-based classifiers hosted as FastAPI microservices to analyze and classify threat report events in accordance with the MITRE ATT&CK framework for ICS. Sequence Generator: Orders the classified events into a logical attack chain, providing clear insight into the sequence of tactics and techniques used in the threat. Enrichment Engine: Integrates historical data and adversary emulation capabilities to enhance the attack chain with valuable context and additional details. The historical data enrichment is powered by a Markov model, which is available as a FastAPI endpoint. Export and Routing Module: Facilitates the export of the enriched attack chain in multiple formats and routes the output to designated applications for further analysis or emulation.

Paul, Tony [Idaho National Laboratory (INL), Idaho↗

End-to-end learning of multiple sequence alignments with differentiable Smith–Waterman

Abstract Motivation Multiple sequence alignments (MSAs) of homologous sequences contain information on structural and functional constraints and their evolutionary histories. Despite their importance for many downstream tasks, such as structure prediction, MSA generation is often treated as a separate pre-processing step, without any guidance from the application it will be used for. Results Here, we implement a smooth and differentiable version of the Smith–Waterman pairwise alignment algorithm that enables jointly learning an MSA and a downstream machine learning system in an end-to-end fashion. To demonstrate its utility, we introduce SMURF (Smooth Markov Unaligned Random Field), a new method that jointly learns an alignment and the parameters of a Markov Random Field for unsupervised contact prediction. We find that SMURF learns MSAs that mildly improve contact prediction on a diverse set of protein and RNA families. As a proof of concept, we demonstrate that by connecting our differentiable alignment module to AlphaFold2 and maximizing predicted confidence, we can learn MSAs that improve structure predictions over the initial MSAs. Interestingly, the alignments that improve AlphaFold predictions are self-inconsistent and can be viewed as adversarial. This work highlights the potential of differentiable dynamic programming to improve neural network pipelines that rely on an alignment and the potential dangers of optimizing predictions of protein sequences with methods that are not fully understood. Availability and implementation Our code and examples are available at: https://github.com/spetti/SMURF. Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗