统计递归集的Hausdorff测度的上、下界

给出了由随机压缩算子生成的统计递归集的Ｈａｕｓｄｏｒｆ测度上、下界的估计．也就是说,在一些条件下,找出了Ｋ（ω）∩∞ｎ＝１∪ｉ∈Ｎｎ（ω）ｆ（ω）ｎ,ｉ（Ｅ）的α－维Ｈａｕｓｄｏｒｆ测度的上、下界,其中｛ｆｎ,ｉ,１≤ｉ,ｎ＜∞｝是一族随机压缩算子,｛Ｎｎ（ω）,ｎ≥１｝是一族可数的随机指标集．     

一种完备完全分配格上矩阵方程的求解方法

模糊理论已经在决策、模式识别、故障诊断、过程控制等许多方面得到了广泛应用，在这些应用问题求解中往往要遇到求解模糊关系方程。本文从完备完全分配格的角度给出了一种求解模糊关系方程极小解的完备解法，并用计算机实现了提出的算法，为实际问题求解计算机化打下了基础。     

Three point covers with bad reduction

We study Galois covers of the projective line branched at three points with bad reduction to characteristic , under the condition that strictly divides the order of the Galois group. As an application of our results, we prove that the field of moduli of such a cover is at most tamely ramified at .

     

Types in reductive -adic groups: The Hecke algebra of a cover

In this paper, is a non-Archimedean local field and is the group of -points of a connected reductive algebraic group defined over . Also, is an irreducible representation of a compact open subgroup of , the pair being a type in . The pair is assumed to be a cover of a type in a Levi subgroup of . We give conditions, generalizing those of earlier work, under which the Hecke algebra is the tensor product of a canonical image of and a sub-algebra , for a compact open subgroup of containing .

     

Are covering (enveloping) morphisms minimal?

We prove that for certain classes of modules such that direct sums of -covers ( -envelopes) are -covers ( -envelopes), -covering ( -enveloping) homomorphisms are always right (left) minimal. As a particular case we see that over noetherian rings, essential monomorphisms are left minimal. The same type of results are given when direct products of -covers are -covers. Finally we prove that over commutative noetherian rings, any direct product of flat covers of modules of finite length is a flat cover.     

多功能锅盖的设计和实现

随着工作节奏的加快,做饭时往往不能只注意正在烧的锅,以至于经常发生淤锅、烧干等问题,酿成的事故屡见不鲜。本文通过在锅盖和燃气灶进气端加装一定的电子装置给出了一种经济、方便的解决方案。     

The structure of matrices with a maximum multiplicity eigenvalue

There is remarkable and distinctive structure among Hermitian matrices, whose graph is a given tree T and that have an eigenvalue of multiplicity that is a maximum for T. Among such structure, we give several new results: (1) no vertex of T may be “neutral”; (2) neutral vertices may occur if the largest multiplicity is less than the maximum; (3) every Parter vertex has at least two downer branches; (4) removal of a Parter vertex changes the status of no other vertex; and (5) every set of Parter vertices forms a Parter set. Statements (3), (4) and (5) are also not generally true when the multiplicity is less than the maximum. Some of our results are used to give further insights into prior results, and both the review of necessary background and the development of new structural lemmas may be of independent interest.     

Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs

This paper presents a new class of valid inequalities for the single-item capacitated lot sizing problem with step-wise production costs (LS-SW). Constant sized batch production is carried out with a limited production capacity in order to satisfy the customer demand over a finite horizon. A new class of valid inequalities we call mixed flow cover, is derived from the existing integer flow cover inequalities by a lifting procedure. The lifting coefficients are sequence independent when the batch sizes (V) and the production capacities (P) are constant and when V divides P. When the restriction of the divisibility is removed, the lifting coefficients are shown to be sequence independent. We identify some cases where the mixed flow cover inequalities are facet defining. We propose a cutting plane algorithm for different classes of valid inequalities introduced in the paper. The exact separation algorithm proposed for the constant capacitated case runs in polynomial time. Computational results show the efficiency of the new class mixed flow cover compared to the existing methods.     

S-SUPERFLUOUS AND S-ESSENTIAL HOMOMORPHISMS

Let R be a ring and S a class of R-modules. S-superfluous epimorphisms and S-essential monomorphisms are introduced and studied in this article. As appli-cations, some new characterizations of yon Neumann regular rings and perfect rings are given. Finally, these notions are also used to study minimal homomorphisms.     

The distribution of the domination number of class cover catch digraphs for non-uniform one-dimensional data

For two or more classes of points in R^d with d≥1, the class cover catch digraphs (CCCDs) can be constructed using the relative positions of the points from one class with respect to the points from one or all of the other classes. The CCCDs were introduced by Priebe et al. [C.E. Priebe, J.G. DeVinney, D.J. Marchette, On the distribution of the domination number of random class catch cover digraphs. Statistics and Probability Letters 55 (2001) 239-246] who investigated the case of two classes, X and Y. They calculated the exact (i.e., finite sample) distribution of the domination number of the CCCDs based on X points relative to Y points both of which were uniformly distributed on a bounded interval. We investigate the distribution of the domination number of the CCCDs based on data from non-uniform X points on an interval with end points from Y. Then we extend these calculations for multiple Y points on bounded intervals.