顶凌覆盖节水增产技术研究

通过1998年、2000年的试验研究，系统分析了顶凌覆盖技术在高寒区节水增温保温、增产增收的机理及其应用效果。提出该技术可以缓解低温干旱特别是春旱对农业生产的困扰，是一项可以抗旱保春播增产增收的实用技术，在高寒地区具有较高的推广价值。     

多维随机大与SNBU多维寿命分布类

本文从多维随机序──随机大入手，定义了多维寿命分布类ＳＮＢＵ，证明了该定义与文［１］中的定义等价，研究了其部分性质。     

一个增算子不动点定理及其在Banach 空间非线性方程的应用

给出了Banach空间的一个增算子不动点定理,将这一定理应用到Banach空间的积分-微分方程,给出了一类积分-微分方程的连续可微最大解和连续可微最小解的存在性定理.     

Bounds to optimal burn‐in and optimal work size

Burn‐in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, we consider the problem of determining the optimal burn‐in time and optimal work size maximizing the long‐run average amount of work saved per time unit in the computer applications. Assuming that the underlying lifetime distribution of the computer has an initially decreasing or/and eventually increasing failure rate function, an upper bound for the optimal burn‐in time is derived for each fixed work size and a uniform (with respect to the burn‐in time) upper bound for the optimal work size is also obtained. Furthermore, it is shown that a non‐trivial lower bound for the optimal burn‐in time can be derived if the underlying lifetime distribution has a large initial failure rate. Copyright © 2005 John Wiley & Sons, Ltd.     

A Fixed Point Theorem for Multi—valued Composite Increasing Operators

Ａ　Ｆｉｘｅｄ　Ｐｏｉｎｔ　Ｔｈｅｏｒｅｍ　ｆｏｒ　Ｍｕｌｔｉ－ｖａｌｕｅｄ　Ｃｏｍｐｏｓｉｔｅ　Ｉｎｃｒｅａｓｉｎｇ　ＯｐｅｒａｔｏｒｓＬｉＦｅｎｇｙｏｕ（李凤友）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，Ｔｉａｎｊｉｎ＇ＮｏｒｍａｌＵｎｉ...     

铁路主要干线提速有关问题的研究

在对列车提速的必要性、原则和有限目标进行论述的基础上，就列车提速对运输技术设备的要求和运输组织方面的若干问题进行了初步探讨，分析了多速度客货列车混跑时，不同速度配比的组合方案对线路通过能力的影响，为干线提速的方案选定提供了基础     

Level of nodes in increasing trees revisited

Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size n ≥ j. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that n − j is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007     

FIXED POINTS AND COUPLED FIXED POINTS FOR INCREASING OPERATORS WITH APPLICMIONS TO DIFFERENTIAL INCLUSIONS IN BANACH SPACES

ＦＩＸＥＤＰＯＩＮＴＳＡＮＤＣＯＵＰＬＥＤＦＩＸＥＤＰＯＩＮＴＳＦＯＲＩＮＣＲＥＡＳＩＮＧＯＰＥＲＡＴＯＲＳＷＩＴＨＡＰＰＬＩＣＭＩＯＮＳＴＯＤＩＦＦＥＲＥＮＴＩＡＬＩＮＣＬＵＳＩＯＮＳＩＮＢＡＮＡＣＨＳＰＡＣＥＳＺＨＡＮＧＳＨＩＳＨＥＮＧＡＮＤＨＵ...     

一类非连续算子不动点存在的充分必要条件

文章证明了不加连续条件的一类凹算子存在不动点的充分必要条件     

Minimax Theorems Involving Two Functions and Strictly Monotone Transformations of Their Values

Two two-function minimax theorems are proved.The concavity-convexity conditions of the twofunctions involve strictly monotone transformations and mixing of the values of the two functions,and aredescribed by the inequalities as upward and weakly downward conditions.