SOLUTION OF A RESEARCH PROBLEM

ＳＯＬＵＴＩＯＮＯＦＡＲＥＳＥＡＲＣＨＰＲＯＢＬＥＭＷＵＳＨＩＱＵＡＮ（巫世权）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮａｔｉｏｎａｌＵｎｉｖｅｒｓｉｔｙｏｆＴｅｃｈｎｏｌｏｇｙ，Ｃｈａｎｇｓｈａ４１００７３，Ｃｈｉｎａ）Ａｂｓｔｒａｃｔ...     

用AHP法建立教学质量评估体系

以AHP为理论基础,结合Delphi方法,对高校教师教学质量评估体系进行尝试性建构。通过构建结构→个体判断→群判断处理→量化指标体系生成的分步操作,来达到科学、民主、公正、客观的评价目标。     

On the Asymptotics of Eigenvalues of an Analytical Pencil of Operators

We study the asymptotic behavior of eigenvalues of a perturbed pencil of operators in Banach spaces. We prove theorems on branching of an isolated eigenvalue into a finite number of simple eigenvalues. In addition, we deduce conditions for obtaining the asymptotics of a given form.     

模糊度定义的不一致性及其理论分析

指出模糊度定义的不一致性，并通过实例进行验证；从理论上分析模糊度定义的不一致性产生的原因，指出当模糊度理论在图像处理中应用时模糊度定义的不一致性可能会产生的影响；给出一个比较合理的模糊度定义。文中提出的问题是在工程应用过程中发现的新问题，所做的工作也只是初步的。     

煤矸石堆积问题的电费计算

本文设计了一种矸石堆的成堆方法 :在堆积若干年之后 ,后移一定距离重新堆积并将之前的矸石堆覆盖 ,这一方法在文 [1 ]的基础上使电费的值继续减少 ,并计算了两次成堆情况下不同出矸率对应的电费值 .     

图表示范畴的两个子范畴

引进图表示范畴的两个子范畴,研究它们的同调性质。     

The diffeomorphic types of the complements of arrangements in ??3 II

For any arrangement of hyperplanes in ℂℙ³, we introduce the soul of this arrangement. The soul, which is a pseudo-complex, is determined by the combinatorics of the arrangement of hyperplanes. In this paper, we give a sufficient combinatoric condition for two arrangements of hyperplanes to be diffeomorphic to each other. In particular we have found sufficient conditions on combinatorics for the arrangement of hyperplanes whose moduli space is connected. This generalizes our previous result on hyperplane point arrangements in ℂℙ³. This work was partially supported by NSA grant and NSF grant     

On the location of critical points of polynomials

Given a polynomial of degree and with at least two distinct roots let . For a fixed root we define the quantities and . We also define and to be the corresponding minima of and as runs over . Our main results show that the ratios and are bounded above and below by constants that only depend on the degree of . In particular, we prove that , for any polynomial of degree .

     

On the location of fixed points on pairs of spaces

Let f: (X, A)→(X, A) be an admissible selfmap of a pair of metrizable ANR's. A Nielsen number of the complement Ñ(f; X, A) and a Nielsen number of the boundary ñ(f; X, A) are defined. Ñ(f; X, A) is a lower bound for the number of fixed points on C1(X - A) for all maps in the homotopy class of f. It is usually possible to homotope f to a map which is fixed point free on Bd A, but maps in the homotopy class of f which have a minimal fixed point set on X must have at least ñ(f; X, A) fixed points on Bd A. It is shown that for many pairs of compact polyhedra these lower bounds are the best possible ones, as there exists a map homotopic to f with a minimal fixed point set on X which has exactly Ñ(f; X - A) fixed points on C1(X−A) and ñ(f; X, A) fixed points on Bd A. These results, which make the location of fixed points on pairs of spaces more precise, sharpen previous ones which show that the relative Nielsen number N(f; X, A) is the minimum number of fixed points on all of X for selfmaps of (X, A), as well as results which use Lefschetz fixed point theory to find sufficient conditions for the existence of one fixed point on C1(X−A).     

Capability of Crossed Modules of Lie Algebras

In this paper, we introduce the concept of capability for crossed modules of Lie algebras, which is a generalization of capability in Lie algebras and groups. By using a special central ideal of a crossed module, we give a sufficient condition for the capability of a crossed module of Lie algebras. Also, we will extend the five-term exact sequence on homology of crossed modules of Lie algebras one term further and study the connection between the capability of crossed modules and this sequence. Finally, we study the relation between the capability and the center of a cover of a crossed module.     

Existence of an Angular Density of Roots of Entire Functions of Order Zero

We obtain sufficient conditions for the set of roots of an entire function of order zero of strongly regular growth to possess an angular density.     

About the Notion of Semiring of Sets

We introduce a generalized notion of semiring and prove that all known properties that semirings have according to the old definition are preserved.     

A Note on the Theorems of Church-Turing and Trachtenbrot

We sketch proofs of the theorems of Church-Turing and Trachtenbrot using a semi-monomorphic axiomatization. Mathematics Subject Classification : 03B10, 03B25.     

A note on exponent of convergence of zeros of entire functions

If f(z) is an entire function with ρ ₁ > 0 as its exponent of convergence of zeros and if 0 ≤ α < ρ ₁, then we prove the existence of entire functions each having α as its exponent of convergence of zeros.      

Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

Lovász and Schrijver (SIAM J. Optim. 1:166–190, 1991) have constructed semidefinite relaxations for the stable set polytope of a graph G = (V,E) by a sequence of lift-and-project operations; their procedure finds the stable set polytope in at most α(G) steps, where α(G) is the stability number of G. Two other hierarchies of semidefinite bounds for the stability number have been proposed by Lasserre (SIAM J. Optim. 11:796–817, 2001; Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, pp 293–303, 2001) and by de Klerk and Pasechnik (SIAM J. Optim. 12:875–892), which are based on relaxing nonnegativity of a polynomial by requiring the existence of a sum of squares decomposition. The hierarchy of Lasserre is known to converge in α(G) steps as it refines the hierarchy of Lovász and Schrijver, and de Klerk and Pasechnik conjecture that their hierarchy also finds the stability number after α(G) steps. We prove this conjecture for graphs with stability number at most 8 and we show that the hierarchy of Lasserre refines the hierarchy of de Klerk and Pasechnik.      

The Siegel norm,the length function and character values of finite groups

In this paper we present some new results on the connection between the Siegel norm, the length function and irreducible character values of finite groups. In addition, we provide algorithms to compute the length of a cyclotomic integer and the set of cyclotomic integers with Siegel norm bounded by a given positive real number.     

Optimal-order quadratic interpolation in vertices of unstructured triangulations

We study the problem of Lagrange interpolation of functions of two variables by quadratic polynomials under the condition that nodes of interpolation are vertices of a triangulation. For an extensive class of triangulations we prove that every inner vertex belongs to a local six-tuple of vertices which, used as nodes of interpolation, have the following property: For every smooth function there exists a unique quadratic Lagrange interpolation polynomial and the related local interpolation error is of optimal order. The existence of such six-tuples of vertices is a precondition for a successful application of certain post-processing procedures to the finite-element approximations of the solutions of differential problems. This work was supported by the grant GA ČR 103/05/0292.     

定时与定数截尾试验参模的建立与参数估计

对寿命试验建立起定时与定数截尾参数模型.考虑定时截尾产品失效数的随机性引入修偏项,应用随机跟随修偏估计方法;对定数截尾考虑数据信息的不完全性,按抽样多少探讨出最佳线性与简单线性无偏估计方法,并给出数据分析结果.