化工系统可靠性的故障树模型及瓶颈部位的确定

本文简介了故障树分析法的基本概念和原理,并以合成氨系统中间歇催化转化工序为例,讨论了以甲烷转化率为树的顶事件,建立了该工序的故障树模型,得到了该树的全部最小割集和顶事件发生故障的概率。借助“重要度”概念对众多的故障模式进行辨识,可以确定出该工序的可靠性瓶颈部位。对化工系统的可靠性分析、预测和加强薄弱环节的管理,可提供一个有效的方法。     

关于社会发展观的思考

科学的发展观是社会发展的正确描述,是制定社会发展宏观模式的理论依据。传统的发展观源于牛顿经典力学方法论,具有极为浓厚的单线决定论色彩,有必要以多途径、多线式的进化树发展机制所取代,这有助于中国现代化道路的正确选择和对中国命运的思考。     

Analysis of emptiness (lacunarity) as a measure of the degree of space filling and of the internal structure of a set

The study presents a comparative evaluation of emptiness (lacunarity) in model structures with different types of inhomogeneity of dispersed particle distributions. The research on emptiness (lacunarity) as a measure of the degree of space filling and, at the same time, of the internal characterization of a set has been based on the optimal covering and gliding-box methods.     

基于回路配置的平面机构运动链绘制新方法及其计算机实现

提出了一种根据平面机构运动链的邻接矩阵绘制草图的新方法,它首先借助运动链简图的广度优先生成树求得图的基本回路,然后将回路标准化后按照排序规则进行排序,最后依据排序后的回路自动绘制出运动链简图;还将该方法与已有的方法进行了比较和分析,并通过应用实例验证了这种方法的有效性和完备性,最后还给出了相应的计算机原型系统实现。     

On-line construction of suffix trees

An on-line algorithm is presented for constructing the suffix tree for a given string in time linear in the length of the string. The new algorithm has the desirable property of processing the string symbol by symbol from left to right. It always has the suffix tree for the scanned part of the string ready. The method is developed as a linear-time version of a very simple algorithm for (quadratic size) suffixtries. Regardless of its quadratic worst case this latter algorithm can be a good practical method when the string is not too long. Another variation of this method is shown to give, in a natural way, the well-known algorithms for constructing suffix automata (DAWGs).This research was supported by the Academy of Finland and by the Alexander von Humboldt Foundation (Germany).     

产品报价系统的模式和算法设计

本文讨论了产品报价系统的关系模式设计方法，给出了用二维表表示ＡＯＶ网的逆拓扑排序和按后根次序遍历树的算法。     

一种从结构化源程序导出PAD图的方法

本文讨论一种从结构化源程序导出ＰＡＤ图的方法，该方法可用于程序理解和维护，以求有效地保持ＰＡＤ文档与结构化源程序之间的一致。     

苹果树根系吸水研究方法的讨论

介绍了根系吸水模型研究现状;对建立苹果树根系吸水模型所需要的植株蒸腾量、棵间蒸发量、根系密度、土壤含水量等的测定方法进行了探讨．分析了苹果树与作物根系吸水的不同之处．介绍了热脉冲技术测定苹果树蒸腾量、微型蒸渗仪(microlysimeter)测定棵间蒸发量、剖面法测定根系密度、TDR测土壤含水率的技术;最后,探讨了建立苹果树根系吸水模型应注意的具体问题,并进一步提出了利用空间随机场理论研究整个苹果园中苹果树的根系吸水模型的观点,即：将苹果园中的各个苹果树看作小扰动的空间随机变量,然后利用空间随机场理论研究整个苹果园中苹果树的根系吸水情况。     

通信网中节点重要性的评价方法

提出了一种对通信网中节点重要性进行评价的方法,并给出了简洁的归一化解析表达式。通过比较生成树的数目,可以判断图中任意数目的两组节点的相对重要性。从图中去掉节点以及相关联的链路后,所得到的图对应的生成树数目越少,则表明该组节点越重要。实验结果表明,该方法计算简单,更为精确地反映基于网络拓扑的节点重要性。     

Generalization of a Suffix Tree for RNA Structural Pattern Matching

In molecular biology, it is said that two biological sequences tend to have similar properties if they have similar three-dimensional structures. Hence, it is very important to find not only similar sequences in the string sense, but also structurally similar sequences from databases. In this paper we propose a new data structure that is a generalization of a parameterized suffix tree (p-suffix tree for short) introduced by Baker. We call it the structural suffix tree or s-suffix tree for short. The s-suffix tree can be used for finding structurally related patterns of RNA or single-stranded DNA. Furthermore, we propose an O(n(log|| + log||)) on-line algorithm for constructing it, where n is the sequence length, || is the size of the normal alphabet, and || is that of the alphabet called parameter, which is related to the structure of the sequence. Our algorithm achieves linear time when it is used to analyze RNA and DNA sequences. Furthermore, as an algorithm for constructing the p-suffix tree, it is the first on-line algorithm, though the computing bound of our algorithm is the same as that of Kosarajus best-known algorithm. The results of computational experiments using actual RNA and DNA sequences are also given to demonstrate our algorithms practicality.