可变样本容量的质量控制图

本文根据Ｃｏｓｔａ的可变样本容量的ｘ＾－控制图的模型设计具有可变样本容量在ｘ＾～和Ｒ图,计算了在可变样本容量（ＶＳＳ）下发信号前的平均样本数和平均时间,并同固定样本容量（ＦＳＳ）和可变抽样区间（ＶＳＩ）的ｘ＾～和Ｒ图作比较。     

关于{P2, Ci| i≥3}-覆盖图

设 Ｇ是一个图,若对于 Ｇ的任意一边 Ｇ都有｛Ｐ_２,Ｃｉ｜ｉ－＞３｝－因子含有这条边,则称Ｇ是｛Ｐ_２,Ｃｉ｜ｉ－＞３｝－覆盖图．本文给出连通非二分图Ｇ是｛Ｐ２,Ｃｉ｜ｉ－＞３｝－覆盖图的充要条件为任给Ｓ■Ｖ（Ｇ）,Ｖ（Ｇ）≠Ｓ≠■有ｉ（Ｇ－Ｓ）＿＞｜Ｓ｜－１成立．     

关于｛P2,Ci│i≥3｝—覆盖图

设Ｇ是一个图,若对于Ｇ的任意一边Ｇ都有｛Ｐ２,Ｃｉ│ｉ≥３｝－因子含有这条边,则称Ｇ是｛Ｐ２,Ｃｉ│ｉ≥３｝－覆盖图。本文给出连通非二分图Ｇ是｛Ｐ２,Ｃｉ│ｉ≥３｝－覆盖图的充要条件为任给Ｓ包含于Ｖ（Ｇ）,Ｖ（Ｇ）≠Ｓ≠ф有ｉ（Ｇ－Ｓ）≤│Ｓ│－１成立。     

市场研究(Ⅰ):揭示竞争优势

ＳＡＳ系统提供了用于市场数据分析的许多方法，包括直观图示法和关联分析。这篇文章讨论直观图示法及其在ＳＡＳ系统中的实现。     

控制过程方差的CUSUMQ图及其性质

崔恒建．控制过程方差的ＣＵＳＵＭＱ图及其性质．数理统计与管理，１９９８，１７（４），３３～３８．Ｑｕｓｅｎｂｅｒｒｙ（１９９５）基于样本方差的标准化变换Φ－１［Ｈｎ－１（（ｎ－１）Ｓ２／σ２０）］提出了控制过程方差的累积和（ＣＵＳＵＭ）Ｑ控制图。本文我们描述了在控制过程方差变化中这种ＣＵＳＵＭＱ控制图的性质，并将控制图的设计方法用到单边及双边的ＣＵＳＵＭＱ图，说明它几乎是最优的。而且我们发现在控制过程方差的微小变化时，设计的ＣＵＳＵＭＱ图的性能要优于基于ｌｏｇ（Ｓ２）的ＣＵＳＵＭ和ＥＷＭＡ图     

两个图的积的S—不可收缩性

本文从组合角度明确给出了两个图的积是Ｓ－不可收缩的特征。     

Some results on domination number of products of graphs

ＳＯＭＥＲＥＳＵＬＴＳＯＮＤＯＭＩＮＡＴＩＯＮＮＵＭＢＥＲＯＦＰＲＯＤＵＣＴＳＯＦＧＲＡＰＨＳＳＨＡＮＥＲＦＡＮＧＳＵＮＬＩＡＮＧＡＮＤＫＡＮＧＬＩＹＩＮＧＡｂｓｔｒａｃｔ．ＬｅｔＧ＝（Ｖ,Ｅ）ｂｅａｓｉｍｐｌｅｇｒａｐｈ．ＡｓｕｂｓｅｔＤｏｆＶｉｓ...     

变换图的直径及Brualdi猜想

设Ｒ＝（ｒ１，ｒ２…ｒｍ）及 Ｓ＝（Ｓ１，Ｓ２，…，Ｓｎ）为两个正整数向量，满足Σｍｉ＝１ｒｉ＝Σｎｊ＝１ｓｊ＝ Ｋ．记Ｇ（Ｒ，Ｓ）为（０，１）－矩阵类 Ｕ（Ｒ，Ｓ）的变换图．Ｂｒｕａｌｄｉ在文山中给出了 Ｇ（Ｒ，Ｓ）的直径厂（Ｇ（Ｒ，Ｓ））的一个上界：ｍｎ／２－１，并猜想Ｄ（Ｇ（Ｒ，Ｓ））≤ｍｎ／４．本文通过对有向图围长的研究得到了Ｄ（Ｇ（Ｒ，Ｓ））的一个新的上界：１／２ｍｎ－１／６ｔ（ｔ－１）（４ｔ＋１），其中Ｔ＝　　．     

无限循环图的同构和自同构

本文证明了两个有限度的无限有向循环图Ｄ（Ｓ）和Ｄ（Ｔ）同构当且仅当Ｔ＝±Ｓ另外，还确定了有限度的无限（有向）循环图的全自同构群     

关于图的积的Domination数

关于图的积的Ｄｏｍｉｎａｔｉｏｎ数康丽英，单而芳（石家庄铁道学院基础部石家庄０５００４３）（石家庄师专数学系石家庄０５００４１）关键词：图；θ－图；Ｄｏｍｉｎａｔｉｎｇ集ＡＭＳ（１９９１）主题分类：０５Ｃ３５．本文所讨论的图均为无环、无重边的有限简单...     

计算机辅助实现控制图的缺陷分析

本文讨论怎样用 SAS系统“实现控制图的自动分析。包括控制图分析的概述 ,控制图缺陷如何按严重程度分类 ;怎样用 SAS系统分析缺陷状况 ,并讨论利用 SAS/ QC模块提供的执行程序来增加可分析的缺陷种类     

模糊质量概念下的一类累积和质量控制图

基于模糊随机变量概念,利用随机变量和模糊度相结合的方法描述模糊质量数据。得到了一类在独立模糊观测条件下关于LR型模糊质量数据情形的一元累积和质量控制图。     

Estimating a survival function with incomplete cause-of-death data

We propose a random censorship model which permits uncertainty in the cause of death assessments for a subset of the subjects in a survival experiment. A nonparametric maximum likelihood approach and a “self-consistency” approach are considered. The solution sets corresponding to both approaches are found. They are infinite and identical. Only some of the solutions are consistent; i.e., the MLEs and self-consistent estimators are not consistent in general. Two estimates are thus proposed and their asymptotic properties are studied. It is shown that both estimates are strongly consistent and converge to Gaussian processes. The covariance structures of these Gaussian processes are derived.     

Depth notions for orthogonal regression

Global depth, tangent depth and simplicial depths for classical and orthogonal regression are compared in examples, and properties that are useful for calculations are derived. The robustness of the maximum simplicial depth estimates is shown in examples. Algorithms for the calculation of depths for orthogonal regression are proposed, and tests for multiple regression are transferred to orthogonal regression. These tests are distribution free in the case of bivariate observations. For a particular test problem, the powers of tests that are based on simplicial depth and tangent depth are compared by simulations.     

On covering mappings on solenoids

Covering mappings on the dyadic solenoid are studied. Some results stated by Zhou Youcheng (2000) are discussed in a more detailed way by indicating certain inaccuracies in their proofs. These are either corrected or supplemented, or else suitable counterexamples are constructed. Some open questions are asked and connections with related results are considered.

     

Enumeration of point-determining graphs

Point-determining graphs are graphs in which no two vertices have the same neighborhoods, co-point-determining graphs are those whose complements are point-determining, and bi-point-determining graphs are those both point-determining and co-point-determining. Bicolored point-determining graphs are point-determining graphs whose vertices are properly colored with white and black. We use the combinatorial theory of species to enumerate these graphs as well as the connected cases.     

Games with vector payoffs

Two-person games are defined in which the payoffs are vectors. Necessary and sufficient conditions for optimal mixed strategies are developed, and examples are presented.     

关于(余)反射的等价性和可扩张性及其应用

该文研究了（余）反射的等价性和可扩张性及应用，得到的主要结果如下：(1) 余反射余代数范畴和反射代数范畴是等价的．(2) 反射和余反射都具有可扩张性．使用这些结果可以用来推广和化简［1-4］中部分结论