Poisson bounds for moments of shot noise processes

Starting from general moment formulas for shot noise processes (v(t)), for which a simple proof is given by means of the CAMPBELL theorem concerning marked point pro¬cesses, and using certain monotonicity property, bounds are obtained for E[v(t)]² resp. for the variance Var v(t) under the additional assumption that the intershot times are inde¬pendent random variables with distribution having the property 1SFBXJE (NWTJE)     

Ranked-Set-Sample-Based Tests for Normal and Exponential Means

We consider the problems of testing a normal mean and an exponential mean under the median ranked set sampling (MRSS) scheme. The tests based on MRSS outperform those based on the usual ranked-set samples. In addition, through heuristic arguments we postulate working formulas for computing cut-off points for RSS-based and MRSS-based tests, respectively. Our simulation studies indicate these formulas perform surprisingly well, even for small samples, and solve the task of computation for large samples.     

Regression models for Boolean random sets

In this paper we consider the regression problem for random sets of the Boolean-model type. Regression modeling of the Boolean random sets using some explanatory variables are classified according to the type of these variables as propagation, growth or propagation-growth models. The maximum likelihood estimation of the parameters for the propagation model is explained in detail for some specific link functions using three methods. These three methods of estimation are also compared in a simulation study.     

从初始数据到模糊数据的转化公式

提出从单值数据到模糊数据的转化公式的定义和一些转化公式.提出从区间值数据到模糊数据的转化公式的定义和一些转化公式.这些定义和转化公式它们对模糊集的应用是有益的.     

关于阶数为奇数的布尔矩阵行空间的基数

设Bn表示所有的n阶布尔矩阵的集合，R（A）表示A∈Bn的行空间，|R（A）|表示R（A）的基数，m、n为正整数．本文证明：（1）m∈[1，46]，存在A∈B7，使得|R（A）|＝m；（2）当n≥9为奇数时，则m∈[1，22＋22＋…＋23]，存在A∈Bn，使得|R（A）|＝m．     

On the Estimation of Integrated Covariance Functions of Stationary Random Fields

Abstract.  For stationary vector-valued random fields on     the asymptotic covariance matrix for estimators of the mean vector can be given by integrated covariance functions. To construct asymptotic confidence intervals and significance tests for the mean vector, non-parametric estimators of these integrated covariance functions are required. Integrability conditions are derived under which the estimators of the covariance matrix are mean-square consistent. For random fields induced by stationary Boolean models with convex grains, these conditions are expressed by sufficient assumptions on the grain distribution. Performance issues are discussed by means of numerical examples for Gaussian random fields and the intrinsic volume densities of planar Boolean models with uniformly bounded grains.     

王家台秦简《归藏》与先秦文学——兼证其年代早于《易经》

秦简《归藏》的筮辞可以分为两种基本类型:“叙事型”和“隐喻型”。它们都蕴含有明显的贞卜“程序”,如前者中的“卜亓邦尚毋有咎”和后者中的“黄鸟”。筮辞中“程序”的存在暗示《归藏》与古老的口头传统密切相关:“叙述型筮辞”承续了前代的某些筮占口语,“隐喻型筮辞”则继承了原始歌谣的某些语词。从两种筮辞反映的不同思维特质上看,秦简《归藏》的产生年代应早于《易经》。《易》、《诗》等先秦经典文本与秦简《归藏》,甚至其它出土贞卜筮辞有着某种程度的直接亲缘关联,值得进一步探寻。     

On the choice of the number of blocks with the incremental EM algorithm for the fitting of normal mixtures

The EM algorithm is a popular method for parameter estimation in situations where the data can be viewed as being incomplete. As each E-step visits each data point on a given iteration, the EM algorithm requires considerable computation time in its application to large data sets. Two versions, the incremental EM (IEM) algorithm and a sparse version of the EM algorithm, were proposed recently by Neal R.M. and Hinton G.E. in Jordan M.I. (Ed.), Learning in Graphical Models, Kluwer, Dordrecht, 1998, pp. 355–368 to reduce the computational cost of applying the EM algorithm. With the IEM algorithm, the available n observations are divided into B (B n) blocks and the E-step is implemented for only a block of observations at a time before the next M-step is performed. With the sparse version of the EM algorithm for the fitting of mixture models, only those posterior probabilities of component membership of the mixture that are above a specified threshold are updated; the remaining component-posterior probabilities are held fixed. In this paper, simulations are performed to assess the relative performances of the IEM algorithm with various number of blocks and the standard EM algorithm. In particular, we propose a simple rule for choosing the number of blocks with the IEM algorithm. For the IEM algorithm in the extreme case of one observation per block, we provide efficient updating formulas, which avoid the direct calculation of the inverses and determinants of the component-covariance matrices. Moreover, a sparse version of the IEM algorithm (SPIEM) is formulated by combining the sparse E-step of the EM algorithm and the partial E-step of the IEM algorithm. This SPIEM algorithm can further reduce the computation time of the IEM algorithm.     

方剂·偏方·药文学——传统中医药文化三题

中医药的方剂、偏方和古代的药文学,是传统中医文化的三个特有现象,其中蕴含着因人而异、因时而变的个性化治疗思想,“悬壶济世救苍生”的公众精神以及儒医不分、文医联姻的人文精神,这表明古代中医属人文型人才。传统中医药学的个性化、公众性和人文性,对当前我国医药事业的改革与发展具有重要的意义。