具有扩散的Lotka-Volterra系统的持续性

利用最大值原理结合上、下解的方法，讨论了一类具有扩散的竞争－捕食的Lotka-Volterra系统静态解的存在性与持续生存。     

一类图的特征多项式与匹配多项式

本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。     

基于CAPPFramework的CAPP系统的开发与应用

在国家863CIMS目标产品CAPPFramework系统的基础上，研究了面向对象的信息建模技术、信息模型驱动的所见即所得工艺设计技术、工作流技术．并在此基础上进行集成化、智能化计算机辅助工艺设计(CAPP)的应用与开发，实现了工艺设计的自动化，基本达到了在信息集成基础上的工艺设计与工艺信息管理一体化的目的，对企业的CAPP实施具有一定的参考价值．     

Enclosure results for quasilinear systems of variational inequalities

In this paper we consider systems of quasilinear elliptic variational inequalities, and prove the existence of minimal and maximal (in the set theoretical sense) solutions within some ordered interval of an appropriately defined pair of sub- and supersolutions. We show that the notion of sub- and supersolutions of variational inequalities introduced here is consistent with the usual notion of sub-supersolutions for (variational) equations. For weakly coupled quasimonotone systems of variational inequalities the existence of smallest and greatest solutions is proved.     

Mackey Theory for p-adic Lie Groups

This paper gives a p-adic analogue of the Mackey theory, which relates representations of a group of type G - H × t A to systems of imprimitivity.     

NO-2-I-体系双波长紫外分光光度法测定痕量亚硝酸根

在稀盐酸介质中,亚硝酸根氧化碘化钾的反应产物I-3在288nm和352nm处有两个强吸收峰.基于此建立了双波长紫外分光光度法测定痕量NO-2的新方法.该法简便、快速、选择性好,线性范围为0-0.4μg/mL,检出限为3.4×10-9g/mL.用于河水、井水、矿泉水中亚硝酸根的测定,结果令人满意.     

A note on the computational complexity of graph vertex partition

A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.     

A polynomial algorithm for one problem of guillotine cutting

We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem.     

On Polynomial Functions over Finite Commutative Rings

Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained.