Estimating rating transition probabilites with missing data

In this article we provide a rigorous treatment of one of the central statistical issues of credit risk management. GivenK-1 rating categories, the rating of a corporate bond over a certain horizon may either stay the same or change to one of the remainingK-2 categories; in addition, it is usually the case that the rating of some bonds is withdrawn during the time interval considered in the analysis. When estimating transition probabilities, we have thus to consider aK-th category, called withdrawal, which contains (partially) missing data. We show how maximum likelihood estimation can be performed in this setup; whereas in discrete time our solution gives rigorous support to a solution often used in applications, in continuous time the maximum likelihood estimator of the transition matrix computed by means of the EM algorithm represents a significant improvement over existing methods.     

许国璋语言论札记

语言学研究主要从事对有机体内部的研究和有机体与有机体之间的关系的研究。“许国璋论语言”对此作了哲学上的探索。他辩证地回答了符号的能指与所指的任意性问题 ;并就社会语言学和唯理语言学在理论上的分歧、价值、研究成果和应用作了更全面的论述与概括 ,对当前的语言学研究具有现实的指导意义和作用     

山西大学学生身体素质状况的跟踪研究

该文通过对山西大学在校学生 1992～ 1999年的素质状况的跟踪研究 ,针对显示出的问题提出相应对策 ,为改善大学生的身体素质提供科学依据     

基于需求不确定性的供应链库存控制研究

通过建立需求不确定性环境下供应链成员的独立存货成本模型,运用模拟退火法对该模型进行52周的仿真,求解存货最佳订购数量与最佳再订购点,从而比较出不同存货控制策略的供应链存货总成本及订单满足率的差异。     

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.