指数级数的增长性和值分布

本文研究了随机狄里克莱级数 在随机变量序列{Xn}独立（可不同分布）以及满足等条件时的增长性以及值分布,得到了一些新的结果.     

A Bayesian Adjustment for Covariate Misclassification with Correlated Binary Outcome Data

Estimated associations between an outcome variable and misclassified covariates tend to be biased when the methods of estimation that ignore the classification error are applied. Available methods to account for misclassification often require the use of a validation sample (i.e. a gold standard). In practice, however, such a gold standard may be unavailable or impractical. We propose a Bayesian approach to adjust for misclassification in a binary covariate in the random effect logistic model when a gold standard is not available. This Markov Chain Monte Carlo (MCMC) approach uses two imperfect measures of a dichotomous exposure under the assumptions of conditional independence and non-differential misclassification. A simulated numerical example and a real clinical example are given to illustrate the proposed approach. Our results suggest that the estimated log odds of inpatient care and the corresponding standard deviation are much larger in our proposed method compared with the models ignoring misclassification. Ignoring misclassification produces downwardly biased estimates and underestimate uncertainty.     

几类循环图的分数染色数

通过构造几类图的最大独立集,给出了它们的分数染色数的下界;再通过构造具有该下界值的分数染色,给出了这几类循环图的分数染色数的上界,于是就确定了它们的分数染色数.     

WEIGHTED SUMS OF NEGATIVELY ASSOCIATED RANDOM VARIABLES

In this paper, we establish strong laws for weighted sums of negatively associated (NA) random variables which have a higher‐order moment condition. Some results of Bai Z.D. & Cheng P.E. (2000) [Marcinkiewicz strong laws for linear statistics. Statist. and Probab. Lett. 43, 105–112,] and Sung S.K. (2001) [Strong laws for weighted sums of i.i.d. random variables, Statist. and Probab. Lett. 52, 413–419] are sharpened and extended from the independent identically distributed case to the NA setting. Also, one of the results of Li D.L. et al. (1995) [Complete convergence and almost sure convergence of weighted sums of random variables. J. Theoret. Probab. 8, 49–76,] is complemented and extended.     

On Block Updating in Markov Random Field Models for Disease Mapping

Gaussian Markov random field (GMRF) models are commonly used to model spatial correlation in disease mapping applications. For Bayesian inference by MCMC, so far mainly single-site updating algorithms have been considered. However, convergence and mixing properties of such algorithms can be extremely poor due to strong dependencies of parameters in the posterior distribution. In this paper, we propose various block sampling algorithms in order to improve the MCMC performance. The methodology is rather general, allows for non-standard full conditionals, and can be applied in a modular fashion in a large number of different scenarios. For illustration we consider three different applications: two formulations for spatial modelling of a single disease (with and without additional unstructured parameters respectively), and one formulation for the joint analysis of two diseases. The results indicate that the largest benefits are obtained if parameters and the corresponding hyperparameter are updated jointly in one large block. Implementation of such block algorithms is relatively easy using methods for fast sampling of Gaussian Markov random fields ( Rue, 2001 ). By comparison, Monte Carlo estimates based on single-site updating can be rather misleading, even for very long runs. Our results may have wider relevance for efficient MCMC simulation in hierarchical models with Markov random field components.     

服务行业排队论问题分析

本文运用排队论理论对服务行业的排队现象进行了分析,较好的解决了问题。面对加入WTO,企业应把提高顾客满意度放在首位,以获得长期竞争优势。     

An affine‐invariant multivariate sign test for cluster correlated data

The author presents a multivariate location model for cluster correlated observations. He proposes an affine‐invariant multivariate sign statistic for testing the value of the location parameter. His statistic is an adaptation of that proposed by Randles (2000). The author shows, under very mild conditions, that his test statistic is asymptotically distributed as a chi‐squared random variable under the null hypothesis. In particular, the test can be used for skewed populations. In the context of a general multivariate normal model, the author obtains values of his test's Pitman asymptotic efficiency relative to another test based on the overall average. He shows that there is an improvement in the relative performance of the new test as soon as intra‐cluster correlation is present Even in the univariate case, the new test can be very competitive for Gaussian data. Furthermore, the statistic is easy to compute, even for large dimensional data. The author shows through simulations that his test performs well compared to the average‐based test. He illustrates its use with real data.     

Any complete preference structure without circuit admits an interval representation

This article proves that all complete preference structures where the strict preference relation (P) has no circuit admit a representation by intervals of the real line; the rule for deciding whether an interval is indifferent or preferred to another is less straightforward than for interval orders: strict preference is indeed compatible with a certain degree of overlapping of intervals, the allowed degree being specified by means of a so-called tolerance function.     

Sampling from spatial databases

This paper deals with techniques for obtaining random point samples from spatial databases. We seek random points from a continuous domain (usually ²) which satisfy a spatial predicate that is represented in the database as a collection of polygons. Several applications of spatial sampling (e.g. environmental monitoring, agronomy, forestry, etc) are described. Sampling problems are characterized in terms of two key parameters: coverage (selectivity), and expected stabbing number (overlap). We discuss two fundamental approaches to sampling with spatial predicates, depending on whether we sample first or evaluate the predicate first. The approaches are described in the context of both quadtrees and R-trees, detailing the sample first, acceptance/rejection tree, and partial area tree algorithms. A sequential algorithm, the one-pass spatial reservoir algorithm is also described. The relative performance of the various sampling algorithms is compared and choice of preferred algorithms is suggested. We conclude with a short discussion of possible extensions.