A Note on Geometric Structures of Linear Ordered Orthogonal Arrays and (T,M,S)-Nets of Low Strength

The equivalent geometrical configurations of linear ordered orthogonal arrays are determined when their strengths are 3 and 4. Existence of such geometrical configurations is investigated. They are also useful in the study of (T, M, S)-nets.     

激光调Q CAI

从激光调Q速率方程出发,分析推导了激光调Q过程中,腔内光子数与工作物质内反转粒子数间的关系.再根据激光调Q的过程中,对腔Q值控制方式不同,将激光调Q技术分为:转镜调Q、声光调Q、电光调Q、饱和吸收调Q和脉冲透射式调Q.用C语言进行了激光调Q CAI软件的开发研制,获得了将文学、图形、动画和计算融为一体的,直观而生动地将调Q的理论和过程再现于屏幕的CAI课件.介绍了课件的内容、结构及其特点.     

PACKING PAIRS BY QUINTUPLES:THE CASE OF ZERO CONGRUENCE MOD 4

ＰＡＣＫＩＮＧＰＡＩＲＳＢＹＱＵＩＮＴＵＰＬＥＳ：ＴＨＥＣＡＳＥＯＦＺＥＲＯＣＯＮＧＲＵＥＮＣＥＭＯＤ４ＹＩＮＪＩＡＮＸＩＮＧＡｂｓｔｒａｃｔ：ＬｅｔＤ（ｖ）ｄｅｎｏｔｅｔｈｅｍａｘｉｍｕｍｎｕｍｂｅｒｏｆｑｕｉｎｔｕｐｌｅｓｏｆａｖ－ｓｅｔｏｆｐｏ...     

Rank, term rank, and chromatic number

Let G be a graph with a nonempty edge set, and with rank rk(G), term rank Rk(G), and chromatic number χ(G). We characterize Rk(G) as being the maximum number of colors in certain proper colorings of G. In particular, we observe that χ(G)Rk(G), with equality holding if and only if (besides isolated vertices) G is either complete or a star. For a twin-free graph G, we observe the bound and we show that this bound is sharp.     

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

Convergence Rates in the Law of Large Numbers under Sublinear Expectations

In this note, we study convergence rates in the law of large numbers for independent and identically distributed random variables under sublinear expectations. We obtain a strong L^p-convergence version and a strongly quasi sure convergence version of the law of large numbers.     

Upper Bounds to the Number of Vertices in a k-Critically n-Connected Graph

 Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set. Received: April 14, 2000 Final version received: May 8, 2001     

形式化语言在UMTS开发中的应用

由于3G协议规范的复杂性，3GPP方法论指导方针中鼓励使用标准的形式化语言来进行UMTS产品的设计、开发与测试。文中概要性地描述了UMTS的体系结构和在规范描述中用到的一些形式化语言的基本概念和特点，探讨了这些形式化语言在UMTS开发中的应用。使用形式化语言开发UMTS可以简化和改进测试程序，实现新产品与新标准的同步推出。     

RICE CONDITION NUMBERS OF CERTAIN CHARACTERISTIC SUBSPACES

This paper proposes the Rice condition numbers for invariant subspace, singular sub-spaces of a matrix and deflating subspaces of a regular matrix pair. The first-order perturbation estimations for these subspaces are derived by applying perturbation expansions of orthogonal projection operators.     

Sizes of Critical Graphs with Small Maximum Degrees

In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of Luo [6] and Y. Zhao [12].