一个不需要候选集的挖掘关联规则算法的研究

挖掘关联规则是数据挖掘中的一个重要课题。针对挖掘关联规则典型算法中的某种不足，介绍了一个不需要产生候选集的挖掘关联规则的算法FP－tree。经过深入研究，对它进行了分析和评价。     

Fuzzy fault tree analysis of roller oscillating tooth gear drive

0　ＩＮＴＲＯＤＵＣＴＩＯＮＲＯＴＧＤｉｓａｎｅｗｔｙｐｅｏｆｌｅｓｓｔｅｅｔｈｄｉｆｆｅｒｅｎｃｅｐｌａｎｅ ｔａｒｙｇｅａｒｄｒｉｖｅ .Ｉｔｓｆｅａｔｕｒｅｓｉｎｃｌｕｄｅｓｍａｌｌｖｏｌｕｍｅ ,ｃｏｍ ｐａｃｔｓｔｒｕｃｔｕｒｅ ,ｈｉｇｈｌｏａｄｃａｐａｃｉｔｙ ,ｈｉｇｈｔｒａｎｓｍｉｓｓｉｏｎｅｆｆｉ ｃｉｅｎｃｙ .Ｔｈｅｒｅｆｏｒｅ ,ｉｔｉｓｅｘｐｅｃｔｅｄｔｏｂｅｗｉｄｅｌｙａｐｐｌｉｅｄｉｎｅｎｇｉｎｅｅｒｉｎｇｆｉｅｌｄｓ .Ｈｏｗｅｖｅｒ,ｄｅｓｉｇｎｍｅｔｈｏｄｏｆＲＯＴＧＤｉｓｃ…     

Efficient Internet Multicast Routing Using Anycast Path Selection

A novel efficient and dynamic multicast routing protocol based on anycast routing techniques is presented. The contributions of the protocol differ from well-known shared-tree systems in two aspects: (1) Off-tree anycast routing: The nodes in the shared tree are formed into a virtual anycast group and multicast sources use anycast routing to select a better path from the source to one router in the group to achieve short delay and fault-tolerance. (2) On-tree dynamic routing: The shared-tree approach is extended with capability of alternative path selections. If a node becomes absent from the shared tree, some predefined backup path(s) is (are) used to bypass the node and enable dynamic multicast routing to continue. The protocol requires only the routers near the faulty node to be reconfigured, thus reducing the runtime overhead as compared with global reconfiguration. The simulation data demonstrates the efficiency of our routing protocol.     

Shape Connectivity: Multiscale Analysis and Application to Generalized Granulometries

This paper develops a multiscale connectivity theory for shapes based on the axiomatic definition of new generalized connectivity measures, which are obtained using morphology-based nonlinear scale-space operators. The concept of connectivity-tree for hierarchical image representation is introduced and used to define generalized connected morphological operators. This theoretical framework is then applied to establish a class of generalized granulometries, implemented at a particular problem concerning soilsection image analysis and evaluation of morphological properties such as size distributions. Comparative results demonstrate the power and versatility of the proposed methodology with respect to the application of typical connected operators (such as reconstruction openings). This multiscale connectivity analysis framework aims at a more reliable evaluation of shape/size information within complex images, with particular applications to generalized granulometries, connected operators, and segmentation.     

A New Classification Method to Overcome Over—Branching

Classification is an important technique in data mining.The decision trees builty by most of the existing classification algorithms commonly feature over-branching,which will lead to poor efficiency in the subsequent classification period.In this paper,we present a new value-oriented classification method,which aims at building accurately proper-sized decision trees while reducing over-branching as much as possible,based on the concepts of frequent-pattern-node and exceptive-child-node.The experiments show that while using relevant anal-ysis as pre-processing ,our classification method,without loss of accuracy,can eliminate the over-branching greatly in decision trees more effectively and efficiently than other algorithms do.     

Efficient Algorithms to Detect and Restore Minimality, an Extension of the Regular Restriction of Resolution

A given binary resolution proof, represented as a binary tree, is said to be minimal if the resolutions cannot be reordered to generate an irregular proof. Minimality extends Tseitin"s regularity restriction and still retains completeness. A linear-time algorithm is introduced to decide whether a given proof is minimal. This algorithm can be used by a deduction system that avoids redundancy by retaining only minimal proofs and thus lessens its reliance on subsumption, a more general but more expensive technique.Any irregular binary resolution tree is made strictly smaller by an operation called Surgery, which runs in time linear in the size of the tree. After surgery the result proved by the new tree is nonstrictly more general than the original result and has fewer violations of the regular restriction. Furthermore, any nonminimal tree can be made irregular in linear time by an operation called Splay. Thus a combination of splaying and surgery efficiently reduces a nonminimal tree to a minimal one.Finally, a close correspondence between clause trees, recently introduced by the authors, and binary resolution trees is established. In that sense this work provides the first linear-time algorithms that detect minimality and perform surgery on clause trees.     

Fully Scalable Fault-Tolerant Simulations for BSP and CGM

In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The BSP (or CGM) machine is a parallel multicomputer consisting of p processors for which a memory of n words is evenly distributed and each processor can send and receive at most h messages in a superstep. The faults are deterministic (i.e., worst-case distributions of faults are considered) and static (i.e., they do not change in the course of computation). We assume that a constant fraction of processors are faulty.  We present two fault-tolerant simulation techniques for BSP and CGM:  1. A deterministic simulation that achieves O(1) slowdown for local computations and O((log_h p)²) slowdown for communications per superstep, provided that a preprocessing is done that requires O((log_h p)²) supersteps and linear (in h) computation per processor in each superstep.  2. A randomized simulation that achieves O(1) slowdown for local computations and O(log_h p) slowdown for communications per superstep with high probability, after the same (deterministic) preprocessing as above.  Our results are fully scalable over all values of p from Θ(1) to Θ(n). Furthermore, our results imply that if pn for 0<<1 and h=Θ((n/p)^δ) for 0<δ1 (which hold in almost all practical BSP and CGM computations), algorithms can be made resilient to a constant fraction of processor faults without any asymptotic slowdown.     

从命题逻辑的需求描述到状态转移图的形式规格

信息处理系统的规模和复杂化,需要有效设计高可靠性系统的形式化的规模描述方法,本文针对以上功能,提出了基于命题逻辑的信息处理系统的新的需求描述方法,描述了通过使用逻辑ＰｅｔｒｉＮｅｔ（ＬＰＮ）,把命题逻辑的需求描述变换成状态转移图的过程,并且给出了由ＬＰＮ自动生成状态的转换图的算法。     

考虑剪切变形时圆环和圆弧形曲杆的平衡和稳定

本文提出考虑剪切变形时圆弧形曲杆弯曲的一般理论,可用于求解圆环和圆弧形曲杆的平衡和稳定问题。     

电力系统拓朴可观测性和量测量配置的辅助分析

本文提出了一种简便、有效的电力系统可观测性和量测量配置的计算机辅助分析算法。相应的辅助分析软件可以为电力系统调度中心的工作人员在进行电网量测量的合理配置,或者为在远动装置检修、更新时进行量测量的调整补充,提供辅助分析的手段。该方法可以从在线实时数据库获得系统结构,开关状态和量测系统信息,通过网络结线分析和网络可观测生成树分析网络可观测性,保证电力系统状态估计软件的正常运行。