SOLVABILITY OF FORWARD-BACKWARD SDES AND THE NODAL SET OF HAMILTON-JACOBI-BELLMAN EQUATIONS

The solvability of a class of forward-backward stochastic differential equations (SDEs for short) over an arbitrarily prescribed time duration is studied. The authors design a stochastic relaxed control problem, with both drift and difftusion all being controlled, so that the solvability problem is converted to a problem of finding the nodal set of the viscosity solution to a certain Hamilton-Jacobi-Bellman equation. This method overcomes the fatal difficulty encountered in the traditional contraction mapping approach to the existence theorem of such SDEs.     

分段函数的分类及分离型分段函数与初等函数之间的关系

将分段函数划分为连结型分段函数 ,分离型分段函数和它们的组合形式三种类型 ,得到了分离型分段函数是初等函数的充分必要条件 ,完整地解决了分离型分段函数与初等函数之间的关系 ,并且给出了初等函数在其任一截取集上的限制函数 (截取函数 )仍然是初等函数的结果     

An Interval-Parameter Fuzzy Approach for Multiobjective Linear Programming Under Uncertainty

An interval-parameter fuzzy linear programming method (IFMOLP) is proposed in this study for multiple objective decision-making under uncertainty. As a hybrid of interval-parameter and fuzzy methodologies, the IFMOLP incorporates interval-parameter linear programming and fuzzy multiobjective programming approaches to form an integrated optimization system. The method inherits advantages of interval-parameter programming, and allows uncertainties and decision-makers’ aspirations to be effectively communicated into its programming processes and resulting solutions. Membership functions for both objectives and constraints are formulated to reflect uncertainties in different system components and their interrelationships. An interactive solution procedure has been developed based on solution approaches of the interval-parameter and fuzzy programming techniques, plus necessary measures for handling the multiobjective feature. A didactic example is provided in the paper to illustrate the detailed solution process. Possibilities of further improvements by seeking Pareto optimum and incorporating flexible preference within constraints are also discussed.     

仿紧集上的拟—似变分不等式

借助于文（１）中的结论研究了仿紧集上的拟－似变分不等式，统一和发展了文（２－６）中的相应结果。     

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.