计算通信网络可靠性的分解技术

本文应用分离节点的概念将图分解成两个子图，使通信网络端对可靠性的成功函数简化为两个子网络的可靠性成功子函数，并且进一步导出由子网络不交化表示的原网络的不交化表达式，最后得到通信网络更简便更紧凑的端对可靠性表达式，此简化方法适用于任意系统可靠性的计算．     

模糊数四则运算的几何表示

本文利用空间解析几何方法对模糊数的四则运算给出了直观表示;并在几何直观分析的基础上,为模糊数的四则运算提出了一种比较简便可行的运算方法.     

无样地法在山东杂木林群落调查中的应用

采用与样方法（５００ｍ￣２）实测结果的比较，研究分析了无样地法的中心点四分法在山东落叶阔叶木林群落调查中的应用。结果表明：中心点四分法具有较高的精度和可靠性，同时又省时省力，适用山东落叶阔叶杂木林，并利用种——点数曲线确定山东落叶阔叶杂木林的最小点数为１０个。     

迷向向量的参数表示及其性质

给出了复向量空间中的迷向向量的一种参数表示,并由此获得了迷向向量的一些性质.     

Ekeland变分原理及其应用

本文将Ekeland变分原理作了推广，并将理论结果应用到正则约束最优化问题上．     

Extracting multiple layers from data having graph structures

Much data such as geometric image data and drawings have graph structures. Such data are called graph structured data. In order to manage efficiently such graph structured data, we need to analyze and abstract graph structures of such data. The purpose of this paper is to find knowledge representations which indicate plural abstractions of graph structured data. Firstly, we introduce a term graph as a graph pattern having structural variables, and a substitution over term graphs which is graph rewriting system. Next, for a graph G, we define a multiple layer (g, (θ1,…,θk)) of G as a pair of a term graph g and a list of k substitutions θ1,…,θk such that G can be obtained from g by applying substitutions θ1…,θk to g. In the same way, for a set S of graphs, we also define a multiple layer for S as a pair (D,Θ) of a set D of term graphs and a list Θ of substitutions. Secondly, for a graph G and a set S of graphs, we present effective algorithms for extracting minimal multiple layers of G and S which give us stratifying abstractions of G and S, respectively. Finally, we report experimental results obtained by applying our algorithms to both artificial data and drawings of power plants which are real world data.     

BCK—代数的两种扩张

给出了BCK-代数的两种扩张的方法。     

线粒体非标准密码表的进化稳定性

根据突变危险性极小化的方法,导出各物种线粒体非标准遗传密码表的总体突变危险性极小表,证明了各非标准遗传密码表是在一些约束条件下的总体突变危险性极小表,体现了分子进化遵循稳定性原理,并受冻结偶然性制约.     

A Theorem on Surface with Parallel Nondegenerate Minimal Section

本文给出了空间形式中具平行极小截面曲面的一个定理,从而将文献中相应结果推广到一般的m维空间形式中。     

复合限制

限制是一种基于极小化模型的非单调逻辑,本文首先提出一种相对限制形式——基于极大化模型的限制,继而给出结合极小与极大化模型的复合限制形式,并进一步讨论它们在形式化机器学习中归纳推理的应用.