Computing the dimension ofN-free ordered sets is NP-complete

We show that the problem of deciding whether anN-free ordered set has dimension at most 3 is NP-complete.Both authors supported by Office of Naval Research contract N00014-85K-0494.     

Julia sets of permutable Holomorphic maps

Let f and g be two permutable transcendental holomorphic maps in the plane. We shall discuss the dynamical properties of f, g and f o g and prove, among other things, that if either f has no wandering domains or f is of bounded type, then the Julia sets of f and f(g) coincide. Dedicated to Professor Sheng GONG on the occasion of his 75th birthday     

Polynomial expansion of basis sets: Alternatives to fully optimized exponents

Alternatives based on polynomial expansions of gaussian basis set exponents are introduced and evaluated. The formulas presented here outperform methods based upon the even-tempered formula or combinations of it. They closely match the performance of other methods based upon larger polynomial expansions of the logarithm of the exponents using the same or one less parameter per orbital angular symmetry.     

环同态象的结构

本文对一类较为特殊的环给出商环分类的一种方法，为进一步研究商环的性质提供了较为直观的模型。     

嵌入式系统在机器人控制中的应用

简要介绍嵌入式系统的概念，技术特点及分类。着重阐述嵌入式开发在机器人控制中的应用。     

创建绿色饭店引导绿色消费

介绍了绿色饭店的定义、绿色饭店的实质以及我国绿色饭店的发展.阐述了我国在创建绿色饭店,引导绿色消费需做出努力的几个环节.     

Caristi 不动点定理的推广及应用

本文推广了古典的Garisti不动点定理,作为应用,古典的Ekeland变分原理得到了推广,并且证明了推广的Garisti不动点定理和推广的Ekeland变分原理是等价的．     

关于Menger图的几种运算

设Ｇ是一个简单连通图，若分离Ｇ的余一独立集Ｓ的最小点数等于连接Ｓ的点之间的内部不相交路的最大个数，则称Ｇ是Ｍｅｎｇｅｒ图。我们考虑了图的几种运算并给出了运算后的图是Ｍｅｎｇｅｒ图的条件。     

线性空间上凸函数若干等价命题

本文在线性空间中的凸集上定义一种导数.应用于研究凸函数,得到了凸函数的若干等价命题.     

The Maximal Closed Classes of Unary Functions in p-Valued Logic

In many-valued logic the decision of functional completeness is a basic and important problem, and the thorough solution to this problem depends on determining all maximal closed sets in the set of many-valued logic functions. It includes three famous problems, i.e., to determine all maximal closed sets in the set of the total, of the partial and of the unary many-valued logic functions, respectively. The first two problems have been completely solved ([1], [2], [8]), and the solution to the third problem boils down to determining all maximal subgroups in the k-degree symmetric group S_k, which is an open problem in the finite group theory. In this paper, all maximal closed sets in the set of unary p-valued logic functions are determined, where p is a prime. Mathematics Subject Classification: 03B50, 20B35.