经济预测中的Monte Carlo模拟及方差控制——以国际石油价格预测为例

从MDnte Carlo模拟的实现过程入手，首先通过对Monte Carlo方法原理的阐述来介绍该种方法。进一步结合具体的实例通过计算机进行模拟来解释Monte Carlo方法的具体实现过程。重点讨论在选择合理的数据生成过程的前提下，如何在Monte Carlo方法中减少模拟方差，从而提高估计精度，更好地应用这种方法来进行经济预测。     

Optimal scaling of Metropolis algorithms: Heading toward general target distributions

The authors provide an overview of optimal scaling results for the Metropolis algorithm with Gaussian proposal distribution. They address in more depth the case of high‐dimensional target distributions formed of independent, but not identically distributed components. They attempt to give an intuitive explanation as to why the well‐known optimal acceptance rate of 0.234 is not always suitable. They show how to find the asymptotically optimal acceptance rate when needed, and they explain why it is sometimes necessary to turn to inhomogeneous proposal distributions. Their results are illustrated with a simple example.     

A bayesian estimator for the dependence function of a bivariate extreme‐value distribution

Any continuous bivariate distribution can be expressed in terms of its margins and a unique copula. In the case of extreme‐value distributions, the copula is characterized by a dependence function while each margin depends on three parameters. The authors propose a Bayesian approach for the simultaneous estimation of the dependence function and the parameters defining the margins. They describe a nonparametric model for the dependence function and a reversible jump Markov chain Monte Carlo algorithm for the computation of the Bayesian estimator. They show through simulations that their estimator has a smaller mean integrated squared error than classical nonparametric estimators, especially in small samples. They illustrate their approach on a hydrological data set.     

一种LOG-MAP算法的改进迭代实现及其结构

对LOG-MAP算法进行了可并发性分析,利用可以完整接收一个N长符号传输帧的条件以及正向迭代和反向迭代中的固有对称性质,提出了LOG-MAP算法的一种修正迭代实现算法,其正向和反向迭代计算次数只需码长N的一半,故比标准LOG-MAP算法提高了一倍的处理速度,且没有空间开销的增加、同时,根据修正的迭代实现算法给出了相应的适于FPGA实现的双总线硬件结构的实现方案。     

以太网光桥的研究

根据有关网络技术和具体的实验,提出一种以太网光桥的实现方案,并对光桥的几个性能参数进行了分析讨论。     

Domains of convergence for the EM algorithm: a cautionary tale in a location estimation problem

The EM algorithm is a popular method for maximizing a likelihood in the presence of incomplete data. When the likelihood has multiple local maxima, the parameter space can be partitioned into domains of convergence, one for each local maximum. In this paper we investigate these domains for the location family generated by the t-distribution. We show that, perhaps somewhat surprisingly, these domains need not be connected sets. As an extreme case we give an example of a domain which consists of an infinite union of disjoint open intervals. Thus the convergence behaviour of the EM algorithm can be quite sensitive to the starting point.     

Bayesian analysis of outlier problems using divergence measures

A Bayesian approach is presented for detecting influential observations using general divergence measures on the posterior distributions. A sampling-based approach using a Gibbs or Metropolis-within-Gibbs method is used to compute the posterior divergence measures. Four specific measures are proposed, which convey the effects of a single observation or covariate on the posterior. The technique is applied to a generalized linear model with binary response data, an overdispersed model and a nonlinear model. An asymptotic approximation using Laplace method to obtain the posterior divergence is also briefly discussed.     

Pseudo–Modelling of Outliers for Estimation of Regression And Time Series Models

This paper documents situations where the variance inflation model for outliers has undesirable properties. The model is commonly used to accommodate outliers in a Bayesian analysis of regression and time series models. The alternative approach provided here does not suffer from these undesirable properties but gives inferences similar to those of the variance inflation model when this is appropriate. It can be used with regression, time series, and regression with correlated errors in a unified way, and adheres to the scientific principle that inference should be based on the data after obvious outliers have been discarded. Only one parameter is required for outliers; it is interpretable as the a priori willingness to remove observations from the analysis.     

改进的OBS长度自适应门限组装算法

现有OBS长度自适应组装算法的突发数据长度门限的选择虽然随着业务流的变化而变化,克服了固定长度门限算法输出的突发数据的突发性,但仍然没有考虑业务流的自相似特性,因此不能有效降低输出突发数据的自相似程度和分组阻塞率。针对这一问题,该文提出了一种改进的OBS长度自适应门限组装算法,能根据到达的网络业务流的自相似特性自适应地调整长度门限值。仿真结果表明:在相同的调度算法下,更能降低业务流的自相似性,分组阻塞率降低一个数量级。