Bayesian Markov chain Monte Carlo inversion for anisotropy of PP-and PS-wave in weakly anisotropic and heterogeneous media

A single set of vertically aligned cracks embedded in a purely isotropic background may be con- sidered as a long-wavelength effective transversely iso- tropy （HTI） medium with a horizontal symmetry axis. The crack-induced HTI anisotropy can be characterized by the weakly anisotropic parameters introduced by Thomsen. The seismic scattering theory can be utilized for the inversion for the anisotropic parameters in weakly aniso- tropic and heterogeneous HTI media. Based on the seismic scattering theory, we first derived the linearized PP- and PS-wave reflection coefficients in terms of P- and S-wave impedances, density as well as three anisotropic parameters in HTI media. Then, we proposed a novel Bayesian Mar- kov chain Monte Carlo inversion method of PP- and PS- wave for six elastic and anisotropic parameters directly. Tests on synthetic azimuthal seismic data contaminated by random errors demonstrated that this method appears more accurate, anti-noise and stable owing to the usage of the constrained PS-wave compared with the standards inver- sion scheme taking only the PP-wave into account.

SEMI-BLIND CHANNEL ESTIMATION OF MULTIPLE-INPUT/MULTIPLE-OUTPUT SYSTEMS BASED ON MARKOV CHAIN MONTE CARLO METHODS

This paper addresses the issues of channel estimation in a Multiple-Input/Multiple-Output (MIMO) system. Markov Chain Monte Carlo (MCMC) method is employed to jointly estimate the Channel State Information (CSI) and the transmitted signals. The deduced algorithms can work well under circumstances of low Signal-to-Noise Ratio (SNR). Simulation results are presented to demonstrate their effectiveness.

Potential-Decomposition Strategy in Markov Chain Monte Carlo Sampling Algorithms

We introduce the potential-decomposition strategy （PDS）, which can be used in Markov chain Monte Carlo sampling algorithms. PDS can be designed to make particles move in a modified potential that favors diffusion in phase space, then, by rejecting some trial samples, the target distributions can be sampled in an unbiased manner. Furthermore, if the accepted trial samples are insumcient, they can be recycled as initial states to form more unbiased samples. This strategy can greatly improve efficiency when the original potential has multiple metastable states separated by large barriers. We apply PDS to the 2d Ising model and a double-well potential model with a large barrier, demonstrating in these two representative examples that convergence is accelerated by orders of magnitude.

AN IMPROVED MARKOV CHAIN MONTE CARLO METHOD FOR MIMO ITERATIVE DETECTION AND DECODING

Recently, a new soft-in soft-out detection algorithm based on the Markov Chain Monte Carlo (MCMC) simulation technique for Multiple-Input Multiple-Output (MIMO) systems is proposed, which is shown to perform significantly better than their sphere decoding counterparts with relatively low complexity. However, the MCMC simulator is likely to get trapped in a fixed state when the channel SNR is high, thus lots of repetitive samples are observed and the accuracy of A Posteriori Probability (APP) estimation deteriorates. To solve this problem, an improved version of MCMC simulator, named forced-dispersed MCMC algorithm is proposed. Based on the a posteriori variance of each bit, the Gibbs sampler is monitored. Once the trapped state is detected, the sample is dispersed intentionally according to the a posteriori variance. Extensive simulation shows that, compared with the existing solution, the proposed algorithm enables the markov chain to travel more states, which ensures a near-optimal performance.

Weighted Markov chains for forecasting and analysis in Incidence of infectious diseases in jiangsu Province,China

This paper first applies the sequential cluster method to set up the classification standard of infectious disease incidence state based on the fact that there are many uncertainty characteristics in the incidence course.Then the paper presents a weighted Markov chain,a method which is used to predict the future incidence state.This method assumes the standardized self-coefficients as weights based on the special characteristics of infectious disease incidence being a dependent stochastic variable.It also analyzes the characteristics of infectious diseases incidence via the Markov chain Monte Carlo method to make the long-term benefit of decision optimal.Our method is successfully validated using existing incidents data of infectious diseases in Jiangsu Province.In summation,this paper proposes ways to improve the accuracy of the weighted Markov chain,specifically in the field of infection epidemiology.

FAST CONVERGENT MONTE CARLO RECEIVER FOR OFDM SYSTEMS

The paper investigates the problem of the design of an optimal Orthogonal Fre- quency Division Multiplexing (OFDM) receiver against unknown frequency selective fading. A fast convergent Monte Carlo receiver is proposed. In the proposed method, the Markov Chain Monte Carlo (MCMC) methods are employed for the blind Bayesian detection without channel es- timation. Meanwhile, with the exploitation of the characteristics of OFDM systems, two methods are employed to improve the convergence rate and enhance the efficiency of MCMC algorithms. One is the integration of the posterior distribution function with respect to the associated channel parameters, which is involved in the derivation of the objective distribution function; the other is the intra-symbol differential coding for the elimination of the bimodality problem resulting from the presence of unknown fading channels. Moreover, no matrix inversion is needed with the use of the orthogonality property of OFDM modulation and hence the computational load is significantly reduced. Computer simulation results show the effectiveness of the fast convergent Monte Carlo receiver.

Arriving at estimates of a rate and state fault friction model parameter using Bayesian inference and Markov chain Monte Carlo

The critical slip distance in rate and state model for fault friction in the study of potential earthquakes can vary wildly from micrometers to few me-ters depending on the length scale of the critically stressed fault.This makes it incredibly important to construct an inversion framework that provides good estimates of the critical slip distance purely based on the observed ac-celeration at the seismogram.To eventually construct a framework that takes noisy seismogram acceleration data as input and spits out robust estimates of critical slip distance as the output,we first present the performance of the framework for synthetic data.The framework is based on Bayesian inference and Markov chain Monte Carlo methods.The synthetic data is generated by adding noise to the acceleration output of spring-slider-damper idealization of the rate and state model as the forward model.

基于NEATM和WISE数据的小尺寸近地小行星物理特性研究

小行星是太阳系中广泛分布的金属或岩石天体,直径从米级跨越到几百公里.它们蕴含了太阳系早期的信息,同时也可能会与地球轨道相交且撞击地球,因此研究小行星的物理参数、物质成分和表面性质对于了解太阳系行星的形成演化和近地天体防御具有重要意义.以国际小行星中心(Minor Planet Center,MPC)获取直径D<160 m的小尺寸近地小行星共67颗作为研究对象,其中包含部分潜在威胁小行星(Potentially Hazardous Asteroids,PHA).基于NEATM(Near-Earth Asteroid Thermal Model),使用广域红外巡天望远镜(Wide-field Infrared Survey Explorer,WISE)的观测数据,利用反射光模型对太阳反射光进行了修正,使用动力学模型计算WISE观测历元的小行星轨道数据,计算了这67颗小尺寸近地小行星的直径和反照率.拟合过程采用马尔科夫链蒙特卡洛(Markov Chain Monte Carlo,MCMC)方法,与WISE的研究结果和MPC的数据进行了比较分析,给出了其分类特征.研究为小行星的观测和理论提供了有力的支持,可以更好地了解近地小行星的特征和演化.

Statistical Inversion Based on Nonlinear Weighted Anisotropic Total Variational Model and Its Application in Electrical Impedance Tomography

Electrical impedance tomography (EIT) aims to reconstruct the conductivity distribution using the boundary measured voltage potential. Traditional regularization based method would suffer from error propagation due to the iteration process. The statistical inverse problem method uses statistical inference to estimate unknown parameters. In this article, we develop a nonlinear weighted anisotropic total variation (NWATV) prior density function based on the recently proposed NWATV regularization method. We calculate the corresponding posterior density function, i.e., the solution of the EIT inverse problem in the statistical sense, via a modified Markov chain Monte Carlo (MCMC) sampling. We do numerical experiment to validate the proposed approach.

A Probabilistic Description of the Impact of Vaccine-Induced Immunity in the Dynamics of COVID-19 Transmission

The recent outbreak of COVID-19 has caused millions of deaths worldwide and a huge societal and economic impact in virtually all countries. A large variety of mathematical models to describe the dynamics of COVID-19 transmission have been reported. Among them, Bayesian probabilistic models of COVID-19 transmission dynamics have been very efficient in the interpretation of early data from the beginning of the pandemic, helping to estimate the impact of non-pharmacological measures in each country, and forecasting the evolution of the pandemic in different potential scenarios. These models use probability distribution curves to describe key dynamic aspects of the transmission, like the probability for every infected person of infecting other individuals, dying or recovering, with parameters obtained from experimental epidemiological data. However, the impact of vaccine-induced immunity, which has been key for controlling the public health emergency caused by the pandemic, has been more challenging to describe in these models, due to the complexity of experimental data. Here we report different probability distribution curves to model the acquisition and decay of immunity after vaccination. We discuss the mathematical background and how these models can be integrated in existing Bayesian probabilistic models to provide a good estimation of the dynamics of COVID-19 transmission during the entire pandemic period.

Active Kriging-Based Adaptive Importance Sampling for Reliability and Sensitivity Analyses of Stator Blade Regulator

The reliability and sensitivity analyses of stator blade regulator usually involve complex characteristics like highnonlinearity,multi-failure regions,and small failure probability,which brings in unacceptable computing efficiency and accuracy of the current analysismethods.In this case,by fitting the implicit limit state function(LSF)with active Kriging(AK)model and reducing candidate sample poolwith adaptive importance sampling(AIS),a novel AK-AIS method is proposed.Herein,theAKmodel andMarkov chainMonte Carlo(MCMC)are first established to identify the most probable failure region(s)(MPFRs),and the adaptive kernel density estimation(AKDE)importance sampling function is constructed to select the candidate samples.With the best samples sequentially attained in the reduced candidate samples and employed to update the Kriging-fitted LSF,the failure probability and sensitivity indices are acquired at a lower cost.The proposed method is verified by twomulti-failure numerical examples,and then applied to the reliability and sensitivity analyses of a typical stator blade regulator.Withmethods comparison,the proposed AK-AIS is proven to hold the computing advantages on accuracy and efficiency in complex reliability and sensitivity analysis problems.

Minimizing transmission loss using inspired ant colony optimization and Markov Chain Monte Carlo in underwater WSN environment

In Underwater Wireless Sensor Networks(UWSNs),the most important challenging issues are propagation delay,high error probability,high latency,high communication cost,limited bandwidth,limited memory,low packet delivery ratio,and transmission loss.In our proposed work,the various efforts are taken to minimize the propagation delay and transmission loss during data transmission in an underwater environment.A hybrid mechanism is implemented to improve energy efficiency for faster data transmission in underwater WSN.In the underwater environment of acoustic channel condition,propagation delay and transmission loss lead to high complexity in accessing the information and also it is difficult to obtain the Channel Status Information(CSI).To address this problem,Ant Colony Optimization(ACO)routing with Markov Chain Monte Carlo(MCMC)algorithm is used and to capture the transmission loss in the MCMC approach,CSI Forecast Prediction(FP)algorithm is used.The experimental simulations are evaluated by utilizing the performance evaluation metrics such as Transmission Loss,Probability Density Function,Average Delay and Throughput.From the simulation results it is evident that the proposed algorithm,ACO-MCMC has recorded the minimum transmission loss,increase in probability density function,minimum average delay and maximum throughput of the network when compared to the existing algorithms.

Dynamic Spatio-Temporal Modeling in Disease Mapping

Spatio-temporal models are valuable tools for disease mapping and understanding the geographical distribution of diseases and temporal dynamics. Spatio-temporal models have been proven empirically to be very complex and this complexity has led many to oversimply and model the spatial and temporal dependencies independently. Unlike common practice, this study formulated a new spatio-temporal model in a Bayesian hierarchical framework that accounts for spatial and temporal dependencies jointly. The spatial and temporal dependencies were dynamically modelled via the matern exponential covariance function. The temporal aspect was captured by the parameters of the exponential with a first-order autoregressive structure. Inferences about the parameters were obtained via Markov Chain Monte Carlo (MCMC) techniques and the spatio-temporal maps were obtained by mapping stable posterior means from the specific location and time from the best model that includes the significant risk factors. The model formulated was fitted to both simulation data and Kenya meningitis incidence data from 2013 to 2019 along with two covariates;Gross County Product (GCP) and average rainfall. The study found that both average rainfall and GCP had a significant positive association with meningitis occurrence. Also, regarding geographical distribution, the spatio-temporal maps showed that meningitis is not evenly distributed across the country as some counties reported a high number of cases compared with other counties.

DSMC: Fast direct simulation Monte Carlo solver for the Boltzmann equation by Multi-Chain Markov Chain and multicore programming

Direct Simulation Monte Carlo(DSMC)solves the Boltzmann equation with large Knudsen number.The Boltzmann equation generally consists of three terms:the force term,the diffusion term and the collision term.While the first two terms of the Boltzmann equation can be discretized by numerical methods such as the finite volume method,the third term can be approximated by DSMC,and DSMC simulates the physical behaviors of gas molecules.However,because of the low sampling efficiency of Monte Carlo Simulation in DSMC,this part usually occupies large portion of computational costs to solve the Boltzmann equation.In this paper,by Markov Chain Monte Carlo(MCMC)and multicore programming,we develop Direct Simulation Multi-Chain Markov Chain Monte Carlo(DSMC3):a fast solver to calculate the numerical solution for the Boltzmann equation.Computational results show that DSMC3 is significantly faster than the conventional method DSMC.

On Stochastic Error and Computational Efficiency of the Markov Chain Monte Carlo Method

InMarkov ChainMonte Carlo(MCMC)simulations,thermal equilibria quantities are estimated by ensemble average over a sample set containing a large number of correlated samples.These samples are selected in accordance with the probability distribution function,known from the partition function of equilibrium state.As the stochastic error of the simulation results is significant,it is desirable to understand the variance of the estimation by ensemble average,which depends on the sample size(i.e.,the total number of samples in the set)and the sampling interval(i.e.,cycle number between two consecutive samples).Although large sample sizes reduce the variance,they increase the computational cost of the simulation.For a given CPU time,the sample size can be reduced greatly by increasing the sampling interval,while having the corresponding increase in variance be negligible if the original sampling interval is very small.In this work,we report a few general rules that relate the variance with the sample size and the sampling interval.These results are observed and confirmed numerically.These variance rules are derived for theMCMCmethod but are also valid for the correlated samples obtained using other Monte Carlo methods.The main contribution of this work includes the theoretical proof of these numerical observations and the set of assumptions that lead to them.

Multilevel Markov Chain Monte Carlo Method for High-Contrast Single-Phase Flow Problems

In this paper we propose a general framework for the uncertainty quantification of quantities of interest for high-contrast single-phase flow problems.It is based on the generalized multiscale finite element method(GMsFEM)and multilevel Monte Carlo(MLMC)methods.The former provides a hierarchy of approximations of different resolution,whereas the latter gives an efficient way to estimate quantities of interest using samples on different levels.The number of basis functions in the online GMsFEM stage can be varied to determine the solution resolution and the computational cost,and to efficiently generate samples at different levels.In particular,it is cheap to generate samples on coarse grids but with low resolution,and it is expensive to generate samples on fine grids with high accuracy.By suitably choosing the number of samples at different levels,one can leverage the expensive computation in larger fine-grid spaces toward smaller coarse-grid spaces,while retaining the accuracy of the final Monte Carlo estimate.Further,we describe a multilevel Markov chain Monte Carlo method,which sequentially screens the proposal with different levels of approximations and reduces the number of evaluations required on fine grids,while combining the samples at different levels to arrive at an accurate estimate.The framework seamlessly integrates the multiscale features of the GMsFEM with the multilevel feature of the MLMC methods following the work in[26],and our numerical experiments illustrate its efficiency and accuracy in comparison with standard Monte Carlo estimates.

Conditional autoregressive negative binomial model for analysis of crash count using Bayesian methods

In order to improve crash occurrence models to account for the influence of various contributing factors, a conditional autoregressive negative binomial （CAR-NB） model is employed to allow for overdispersion （tackled by the NB component）, unobserved heterogeneity and spatial autocorrelation （captured by the CAR process）, using Markov chain Monte Carlo methods and the Gibbs sampler. Statistical tests suggest that the CAR-NB model is preferred over the CAR-Poisson, NB, zero-inflated Poisson, zero-inflated NB models, due to its lower prediction errors and more robust parameter inference. The study results show that crash frequency and fatalities are positively associated with the number of lanes, curve length, annual average daily traffic （AADT） per lane, as well as rainfall. Speed limit and the distances to the nearest hospitals have negative associations with segment-based crash counts but positive associations with fatality counts, presumably as a result of worsened collision impacts at higher speed and time loss during transporting crash victims.

Modulation classification of MPSK signals based on nonparametric Bayesian inference

A nonparametric Bayesian method is presented to classify the MPSK （M-ary phase shift keying） signals. The MPSK signals with unknown signal noise ratios （SNRs） are modeled as a Gaussian mixture model with unknown means and covariances in the constellation plane, and a clustering method is proposed to estimate the probability density of the MPSK signals. The method is based on the nonparametric Bayesian inference, which introduces the Dirichlet process as the prior probability of the mixture coefficient, and applies a normal inverse Wishart （NIW） distribution as the prior probability of the unknown mean and covariance. Then, according to the received signals, the parameters are adjusted by the Monte Carlo Markov chain （MCMC） random sampling algorithm. By iterations, the density estimation of the MPSK signals can be estimated. Simulation results show that the correct recognition ratio of 2/4/8PSK is greater than 95% under the condition that SNR 〉5 dB and 1 600 symbols are used in this method.

Bayesian Reliability Modeling and Assessment Solution for NC Machine Tools under Small-sample Data

Although Markov chain Monte Carlo（MCMC） algorithms are accurate, many factors may cause instability when they are utilized in reliability analysis; such instability makes these algorithms unsuitable for widespread engineering applications. Thus, a reliability modeling and assessment solution aimed at small-sample data of numerical control（NC） machine tools is proposed on the basis of Bayes theories. An expert-judgment process of fusing multi-source prior information is developed to obtain the Weibull parameters＇ prior distributions and reduce the subjective bias of usual expert-judgment methods. The grid approximation method is applied to two-parameter Weibull distribution to derive the formulas for the parameters＇ posterior distributions and solve the calculation difficulty of high-dimensional integration. The method is then applied to the real data of a type of NC machine tool to implement a reliability assessment and obtain the mean time between failures（MTBF）. The relative error of the proposed method is 5.8020×10-4 compared with the MTBF obtained by the MCMC algorithm. This result indicates that the proposed method is as accurate as MCMC. The newly developed solution for reliability modeling and assessment of NC machine tools under small-sample data is easy, practical, and highly suitable for widespread application in the engineering field; in addition, the solution does not reduce accuracy.

Hierarchical Bayesian Calibration and On-line Updating Method for Influence Coefficient of Automatic Dynamic Balancing Machine

Measurement error of unbalance＇s vibration response plays a crucial role in calibration and on-line updating of influence coefficient（IC）. Focusing on the two problems that the moment estimator of data used in calibration process cannot fulfill the accuracy requirement under small sample and the disturbance of measurement error cannot be effectively suppressed in updating process, an IC calibration and on-line updating method based on hierarchical Bayesian method for automatic dynamic balancing machine was proposed. During calibration process, for the repeatedly-measured data obtained from experiments with different trial weights, according to the fact that measurement error of each sensor had the same statistical characteristics, the joint posterior distribution model for the true values of the vibration response under all trial weights and measurement error was established. During the updating process, information obtained from calibration was regarded as prior information, which was utilized to update the posterior distribution of IC combined with the real-time reference information to implement online updating. Moreover, Gibbs sampling method of Markov Chain Monte Carlo（MCMC） was adopted to obtain the maximum posterior estimation of parameters to be estimated. On the independent developed dynamic balancing testbed, prediction was carried out for multiple groups of data through the proposed method and the traditional method respectively, the result indicated that estimator of influence coefficient obtained through the proposed method had higher accuracy; the proposed updating method more effectively guaranteed the measurement accuracy during the whole producing process, and meantime more reasonably compromised between the sensitivity of IC change and suppression of randomness of vibration response.