工程失败的路径及风险源因素的FTA分析方法

介绍了管理科学中新的分支工程失败学，提出了工程失败学的研究思路以及可采用的系统建模的方式和方法，确定了工程失败的路径和风险源因素的FTA(Fault Tree Analysis）分析方法，并给出了一个高层建筑深基坑工程支护结构体系FTA分析实例。     

A bandwidth latency tradeoff for broadcast and reduction

The “fractional tree” algorithm for broadcasting and reduction is introduced. Its communication pattern interpolates between two well known patterns—sequential pipeline and pipelined binary tree. The speedup over the best of these simple methods can approach two for large systems and messages of intermediate size. For networks which are not very densely connected the new algorithm seems to be the best known method for the important case that each processor has only a single (possibly bidirectional) channel into the communication network.     

Intersection of finitely generated congruences over term algebra

We show that it is decidable for any given ground term rewrite systems R and S if there is a ground term rewrite system U such that ↔_U^*=↔_R^*∩↔_S^*. If the answer is yes, then we can effectively construct such a ground term rewrite system U. In other words, for any given finitely generated congruences ρ and τ over the term algebra, it is decidable if ρ∩τ is a finitely generated congruence. If the answer is yes, then we can effectively construct a ground term rewrite system U such that ↔_U^*=ρ∩τ.     

基于故障树的贝叶斯网络建造方法与故障诊断应用

文章首先指出应用贝叶斯网络模型进行设备故障诊断具有的优势,提出了由常用的故障树模型建造贝叶斯网络的方法。然后详细比较了故障树与贝叶斯网络在诊断推理和模型表达方面的特点,并以实例进行说明。     

一种可扩展四叉树结构及其先序遍历算法

在图象处理领域,数据表达是一个核心问题。四叉树数据结构由于比空间占有树组方式使处理具有多分辨率能力而倍受青睐。文章提出并实现了一种可应用于多分辨率图象处理和地理信息数据表达的四叉树结构,该四叉树综合了循环链表和普通树结构的优点。具有较强的可扩展性和通用性,使得同一层次的结点之间可以顺利搜索,从而大大减少了查找和从子孙结点到父结点操作回溯的复杂度。该文对原先的四叉树结构做了相应改进,并给出了该四叉树数据结构的先根序遍历算法,是一种高效的数据结构。     

TTFS:一个倾向性文本过滤系统的设计与实现

以往文本过滤的研究主要集中于主题性过滤，然而随着网络的发展，倾向性文本过滤在网络信息安全方面的作用越来越大。论文阐述了一个倾向性文本过滤系统TTFS(Tenclency Text Filtering System)，能够对具有关于某个主题的特定倾向的文本进行过滤。该系统充分利用了领域知识，采用了语义模式分析等技术，实验表明其查全率和查准率高，速度较快。     

SPRINT算法的改进

连续值属性的处理方法是影响决策树构造的重要因素。该文介绍了SPRINT算法,针对其最佳分割点的计算量大的缺点,提出了一种改进的快速寻找方法。该方法采用区间评估、筛选和局部逐一搜索等策略,大幅度地缩小了搜索空间。     

eGiST:一种改进的通用搜索树

新型应用领域的出现,要求数据库系统提供支持数据类型和查询谓词可扩展的索引结构。该文首先介绍了具有这种可扩展性的通用搜索树结构(GiST),分析了GiST在结点溢出处理策略上的不足,并提出了一种改进的通用搜索树结构eGiST,提高了空间利用率和系统效率。     

Spanning tree-based genetic algorithm for bicriteria transportation problem

In this paper, we present a new approach which is spanning tree-based genetic algorithm for bicriteria transportation problem. The transportation problem have the special data structure in solution characterized as a spanning tree. In encoding transportation problem, we introduce one of node encoding which is adopted as it is capable of equally and uniquely representing all possible basic solutions. The crossover and mutation was designed based on this encoding. And we designed the criterion that chromosome always feasibility converted to a transportation tree. In the evolutionary process, the mixed strategy and roulette wheel selection is used. Numerical experiments will be shown the effectiveness and efficiency of the proposed algorithm.