一类随机不动点定理及其特例

在随机拓扑度的基础上进一步研究了随机不动点问题,得到了若干新的随机不动点定理.作为特例,也给出了相应的确定性算子的边界不动点定理.     

随机非线性凝聚算子方程的随机解

利用随机拓扑度理论研究随机非线性凝聚算子,在一定条件下得到随机算子方程A（w,x）=μx的随机解和随机算子不动点的存在性,所得结论减弱了已知文献中相应定理的条件．     

关于三值R0命题逻辑系统的若干注记

在三值R0命题逻辑系统中证明了随机真度的MP、HS和交推理规则;提出了随机开放度,指出随机开放度与随机发散度是从两个不同的角度刻画了理论的相容程度,并得出对同一个理论而言,二者取值相等的结论.     

随机泛函分析中的锐角原理及应用(英文)

在随机泛函分析中证明了著名的锐角原理和随机一一映射定理,并且得到了若干新的结果．     

R0型命题逻辑系统的随机化

利用赋值集的随机化方法,在R0型n值命题逻辑系统和R0型模糊命题逻辑系统中提出了公式的随机真度和随机距离的概念,建立了随机度量空间.指出当取均匀概率时,随机真度就转化为计量逻辑学中的真度,从而建立了更一般的随机逻辑度量空间.     

关于任意非负随机序列随机和的一类随机偏差定理

本文引入任意随机变量序列随机极限对数似然比概念,作为任意相依随机序列联合分布与其边缘乘积分布“不相似”性的一种度量,利用构造新的密度函数方法来建立几乎处处收敛的上鞅,在适当的条件下,给出了任意受控随机序列的一类随机偏差定理.     

随机结构空间理论初探

提出了随机结构空间的概念，引出了随机拓扑空间、随机度量空间、随机赋范空间、随机内积空间、随机关系等随机数学结构的概念，初步研究了随机度量空间、随机赋范空间、随机内积空间的基本构造以及与概率度量空间、概率赋范空间、概率内积空间的关系。     

关于随机非线性算子的若干定理

本文利用随机拓扑度研究了随机凝聚算子的随机不动点定理和随机方程A(w,x)=μx的随机解,以及随机全连续算子的固有值和固有函数,得到若干新结果．     

随机度量理论及其应用在我国最近进展的综述

本旨在全面综述随机度量理论及其应用过去十年在我国发展过程中所获得的主要结果与思想方法,本由十节组成,第一节对我们工作的背景-概率度量空间与随机度量空间理论作一简单的介绍;第二节给出某些有关随机泛函分析及取值于抽象空间的可测函数的预备知识,第三节阐明随机泛函分析与原始随机度量理论（本称之为F-随机度量理论）的整体关系,主要结果是在随机元生成空间上给出自然且合理的随机度量与随机范数的构造,从而将随机元与随机算子理论的研究纳入随机度量理论框架,主要思想是将随机泛函分析视为随机度量空间体系上的分析学而统一地发展;从而形成了发展随机泛函分析的一个新的途径-空间随机化途径;除此之外,在本节我们也从随机过程理论的观点出发首次提出对应于随机度量理论原始版本的一种新的随机共轭空间理论（叫作F-随机共轭空间理论）,它的突出优点是能保持象随机过程的样本性质这样更精细的特性（本节由作的工作构成）,在第四节,基于作最近提出的随机度量理论的一个新的版本（本称之为E-随机度量理论）,从传统泛函分析的角度对过去已被发展起来的随机共轭空间理论（本称之为E-随机共轭空间理论）的基本结果进行系统整理并给以全新的处理（本节内容整体上由作最近的一篇论构成,也尤其提到朱林户等人的重要工作）,在本节我们也以相当的篇幅论述F-随机共轭空间理论与E-随机共轭空间理论的内在关系与本质差异,在下面紧跟的两节,致力于E-随机共轭空间理论深层次的结果,尤其突出了E-随机赋范模与传统的赋范空间、E-随机共轭空间与经典共轭空间之间的内在联系;在第五节给出了几类E-随机赋范模的E-随机共轭空间的表示定理（主要由作的工作,作与游兆水及林熙合作的工作,还有巩馥州与刘清荣合作的工作组成）,在六节给出完备E-随机赋范模为随机自反的特征化定理（主要由作及合作的工作组成）,尤其是第五及第六节中,我们给出随机度量理论在随机泛函分析及经典Banach空间中若干实质性的应用;第七节简要给出E-随机赋半范模及E-随机对偶系理论初步;第八节简单阐明随机度量理论与泛函分析的关系;第九节简单阐明了随机度量理论与概率度量空间理论的关系,最后在第十节结合随机度量理论,Banach空间理论及随机泛函分析对发展随机泛函分析的空间随机化途径的合理性与优越性作了进一步的分析。     

三值R_0命题逻辑系统中理论的随机发散度

在三值R_0命题逻辑系统中,给出了随机相似度和随机逻辑伪距离的基本性质.然后在随机逻辑度量空间中提出了理论的随机发散度,指出全体原子公式之集在随机逻辑度量空间中未必是全发散的,其是否全发散取决于给定的随机数序的分布.     

An algebraic certificate for Budan’s theorem

The existing algorithms to construct the real closure of an ordered field involve very high complexities. These algorithms are based on Sturm’s theorem which we suspect to be one reason for the complexities since all known proofs of Sturm’s theorem use Rolle’s theorem which is problematic in a constructive context.Therefore we propose to replace the use of Sturm’s theorem by Budan’s theorem. In this paper we present as a first step in this direction an algebraic certificate for Budan’s theorem. An algebraic certificate is a certain kind of proof of a statement. In particular, it is an algorithm which produces, from an arbitrary data in the premise of the statement, explicit (in)equalities which express the conclusion.     

关于图的导出森林独立系统

本文研究图的导出森林独立系统.在这个独立系统中,独立集是指导出子图不含圈的点子集.文中证明了图G的导出森林独立系统是拟阵当且仅当G是块森林.文中同时给出了在强弦图上求最大导出森林的多项式算法.     

Approximation of the eigenvalues of a fourth order differential equation with non-smooth coefficients

The eigenvalues of a fourth order, generalized eigenvalue problem in one dimension, with non-smooth coefficients are approximated by a finite element method, introduced in an earlier work by the author and A. Lutoborski, in the context of a similar source problem with non-smooth coefficients. Error estimates for the approximate eigenvalues and eigenvectors are obtained, showing a better performance of this method, when applied to eigenvalue approximation, compared to a standard finite element method with arbitrary mesh.     

关于Fuzzy度量点式刻画的一点注记

本文中重新定义由一个点式Ｆｕｚｚｙｐ．ｑ．度量ｄ所诱导的Ｆｕｚｚｙｐ．ｑ．度量｛Ｄｒ｜ｒ＞０｝（代替［１］中的相关重域映射族）．在新的定义下，点式Ｆｕｚｚｙｐ．ｑ．（ｐ．）度量与Ｆｕｚｚｙｐ．ｐ．（ｐ．）度量之间有令人满意的──对应关系．     

Performance bounds on multiprocessor scheduling strategies for statically allocated programs

In multiprocessors with static allocation of processes to processors, scheduling can be done locally for each processor. The scheduling strategy may have dramatic effect on the execution time of a parallel program. It is an NP-hard problem to find an optimal schedule, and very little is known of how close the heuristic solutions get.The major result here is a theorem stating that if certain program parameters, which can be obtained from an execution of the program on a single-processor, are known, the execution time of the optimal schedule can be calculated within a factor equal to the largest number of border processes on one processor. Border processes are processes which communicate with other processors. The program parameters are obtained using a previously developed tool.Due to the generality of this theorem, the proof is rather complex because it has to cover a large range of situations. The theorem itself, however, is easy to apply, making it possible to compare the performance of different scheduling strategies with the optimal case. The proof also gives important hints on how to design efficient scheduling algorithms for statically allocated programs.     

AHP在师范院校毕业生质量评价中的应用

陶凤梅，杨启昌．ＡＨＰ在师范院校毕业生质量评价中的应用．数理统计与管理，１９９８，１７（４），４～９．本文介绍了运用带概率条件的层次分析法确定师范院校毕业生质量综合评价中各评价指标重要度的方法，建立了师范院校毕业生质量综合评价层次结构     

A Geometrical Proof of Shiota's Theorem on a Conjecture of S. P. Novikov

We give a new proof of Shiota's theorem on Novikov's consecture, which states that the K.P. equation characters Jacobians among all indecomposable principally polarized abelian varieties.     

Thinking and Turing's test

The questions raised by A. M. Turing in his paper on thought and machines are discussed. Human thought is considered in turn as a concept of normal language usage, as a basic concept of psychology, and as the basis of intellectual activity. It is concluded that neither of these notions of thought identifies something specific that a human being can or cannot do. The imitation game proposed by Turing for deciding whether a machine can think is found to result from an arbitrary empoverishment of the channel of communication between the interrogator and the item under investigation. Turing's notions of thinking are shown to lead to logical difficulties. An alternative view of consciousness, that would place it beyond the reach of any finite test, is finally discussed.     

The paradox of trees in type theory

We show how to represent a paradox similar to Russell's paradox in Type Theory withW-types and a type of all types, and how to use this in order to represent a fixed-point operator in such a theory. It is still open whether such a construction is possible without theW-type.This research was partly supported by ESPIRIT Basic Research Action Logical Frameworks.