An upper bound on a ratio of variances

Several processes may be monitored in terms of their variances relative to each other by the maximum ratio of variances. Based on the observed value an upper confidence bound for the population value is derived and tables are supplied for its implementation. Such bounds may be used when the experimenter wishes to establish that the variances are "not too different". The usual testing of variances for equality is noticed to be inappropriate in such cases.     

The best subset of parameters in min-max linear regression

These Fortran-77 subroutines provide building blocks for Generalized Cross-Validation (GCV) (Craven and Wahba, 1979) calculations in data analysis and data smoothing including ridge regression (Golub, Heath, and Wahba, 1979), thin plate smoothing splines (Wahba and Wendelberger, 1980), deconvolution (Wahba, 1982d), smoothing of generalized linear models (O'sullivan, Yandell and Raynor 1986, Green 1984 and Green and Yandell 1985), and ill-posed problems (Nychka et al., 1984, O'sullivan and Wahba, 1985). We present some of the types of problems for which GCV is a useful method of choosing a smoothing or regularization parameter and we describe the structure of the subroutines.Ridge Regression: A familiar example of a smoothing parameter is the ridge parameter X in the ridge regression problem which we write.     

An Integral Bhattacharyya Type Bound for the Bayes Risk

In this article, some results are derived on stochastic comparisons of the residual and past lifetimes of an (n ? k + 1)-out-of-n system with dependent components. These findings generalize some recent results obtained on systems with independent components and provide some interesting results for a system with dependent components following an Archimedean copula. An illustrative example is provided.     

Bounds on expected generalized order statistics

We establish the upper nonpositive and all the lower bounds on the expectations of generalized order statistics based on a given distribution function with the finite mean and central absolute moment of a fixed order. We also describe the distributions for which the bounds are attained. The methods of deriving the lower nonpositive (upper nonnegative) and lower nonnegative (upper nonpositive) bounds are totally different. The first one, the greatest convex minorant method is the combination of the Moriguti and well-known Hölder inequalities and the latter one is based on the maximization of some norm on the properly chosen convex set. The paper completes the results of Cramer et al. [Evaluations of expected generalized order statistics in various scale units. Appl Math. 2002;29:285–295].     

A lower bound for the centred L 2-discrepancy on combined designs under the asymmetric factorials

The foldover is a useful technique in the construction of two-level factorial designs for follow-up experiments. To search an optimal foldover plans is an important issue. In this paper, for a set of asymmetric fractional factorials such as the original designs, a lower bound for centred L ₂-discrepancy of combined designs under a general foldover plan is obtained, which can be used as a benchmark for searching optimal foldover plans. All of our results are the extended ones of Ou et al. [Lower bounds of various discrepancies on combined designs, Metrika 74 (2011), pp. 109–119] for symmetric designs to asymmetric designs. Moreover, it also provides a theoretical justification for optimal foldover plans in terms of uniformity criterion.     

基于双层规划的反恐应急设施选址模型及算法

恐怖袭击常以人流密集地区的平民作为袭击目标，并存在突发性和随机性等特点，极易造成严重的袭击后果。通过反恐应急设施的合理布局可以缩短救援人员和物资的到达时间，从而减轻袭击后果。首先，对反恐应急设施选址问题进行描述，并将其构造为一类离散双层规划模型。其中，上层规划是关于政府选址的0-1规划问题，下层规划则是关于恐怖分子袭击目标选择的0-1规划问题。其次，结合模型和问题的特征设计算法，利用分支定界算法实现上层选址变量的隐枚举，同时通过下层问题的求解来确定上下界并判断是否满足分枝或剪枝的条件。最后，结合南疆地区的交通拓扑网络进行算例分析，结果证明有效的选址方案可以大大降低袭击损失。     

现代汉语词汇中的古语素义

现代汉语中存在大量古语素,由于语素义相互影响、词义变迁、古语词留存等原因,古语素义日渐陌生化。本文从古今汉语的实例出发,分析古语素的特征、类型,探讨古语素义陌生化的原因。     

二阶常微分方程边值问题

本文通过对非线性常微分方程两边边值问题：ｘ〃＝ｆ（ｔ,ｘ,ｘ’）,ｘ（０）＝Ａ,ｘ（１）＝Ｂ的解的先验估计,并利用Ｌｅｒａｙ－Ｓｃｈａｕｄｅｒ度理论讨论了解的存在性及唯一性。