论文部分内容阅读
集合(决策支持系统) 的差别系统是被 Levenstein 为同步为代码的构造在 1971 介绍的组合配置。在这份报纸，我们在场由使用的集合的差别系统的二种构造拆散差别家庭和一个专辑分别地差别集合打字。作为后果，最佳的决策支持系统的新无限的班被获得。
Constructions of optimal difference systems of sets
【摘 要】
：
集合(决策支持系统) 的差别系统是被 Levenstein 为同步为代码的构造在 1971 介绍的组合配置。在这份报纸，我们在场由使用的集合的差别系统的二种构造拆散差别家庭和一个专辑
【机 构】
：
SchoolofSciences,CollegeofMathematicsandInformationScience
【出 处】
：
中国科学：数学英文版
【发表日期】
：
2011年1期
【基金项目】
：
This work was supported by National Natural Science Foundation of China （Grant Nos. 10771051, 10831002）. The authors are grateful to the referees for their careful reading of the original version of t
其他文献
We consider a modified Markov branching process incorporating with both state-independent immigration-migration and resurrection. The effect of state-independen
Multivariate failure time data arise frequently in survival analysis.A commonly used tech-nique is the working independence estimator for marginal hazard models
在这份报纸，我们为旋转 c Dirac-Witten 操作员的特征值得到最佳的更低的界限。这些估计作为分级的弯曲，使不安的 Yamabe 操作员的第一个特征值和 spinorial 精力动量张肌以吝
Rosenthal type inequalities for asymptotically almost negatively associated random variables and app
In this paper, we establish some Rosenthal type inequalities for maximum partial sums of asymptotically almost negatively associated random variables, which ext
We consider a singular perturbation problem which describes 2D Darcy-Stokes flow.An H(div)-conforming rectangular element,DS-R14,is proposed and analyzed frst.T
This article considers a semiparametric varying-coefficient partially linear regression model.The semiparametric varying-coefficient partially linear regression
Let r 3, n r and π = (d1, d2, . . . , dn) be a graphic sequence. If there exists a simple graph G on n vertices having degree sequence π such that G contains
Using the framework of formal theory of partial differential equations, we consider a method of computation of the bi-Hilbert polynomial (i.e. Hilbert polynomia
In this note we first briefly review some recent progress in the study of the circular β ensemble on the unit circle,where β 】 0 is a model parameter.In the
A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G.The clique-transversal number,denoted Tc(G),is the minimum