Residuation, Structural Rules and Context Freeness

The article presents proofs of the context freeness of a family of typelogical grammars, namely all grammars that are based on a uni- ormultimodal logic of pure residuation, possibly enriched with thestructural rules of Permutation and Expansion for binary modes.     

A Structural Proof of the Soundness of Rely/guarantee Rules

Various forms of rely/guarantee conditions have been used torecord and reason about interference in ways that provide compositionaldevelopment methods for concurrent programs. This article illustratessuch a set of rules and proves their soundness. The underlyingconcurrent language allows fine-grained interleaving and nestedconcurrency; it is defined by an operational semantics; theproof that the rely/guarantee rules are consistent with thatsemantics (including termination) is by a structural induction.A key lemma which relates the states which can arise from theextra interference that results from taking a portion of theprogram out of context makes it possible to do the proofs withouthaving to perform induction over the computation history. Thislemma also offers a way to think about expressibility issuesaround auxiliary variables in rely/guarantee conditions.     

包过滤防火墙相关规则的排序及向无关规则的转化

提出了防火墙规则排序的算法 .防火墙进行包过滤时 ,规则集中的规则是顺序匹配的 ,这样防火墙过滤效率不高 .为了应用快速的非顺序的规则匹配算法 ,则必须将相关的防火墙规则转化为无关的规则 ,本文为此提出了防火墙相关规则向无关规则的转化算法 .两个算法实现之后的应用效果明显     

关联规则和分类规则挖掘算法的改进与实现

对Apriori关联规则挖掘算法提出了一种改进方法,使其可以有效地压缩数据规模,提高了原Apriori算法的执行效率。此外,还对OCI分类规则挖掘算法提出了改进,扩展了该算法的适用范围。同时,该采用这两个改进算法实现了一个数据挖掘原型系统。     

丛林法则

现代主义建筑的倡导者瓦尔特·格罗皮乌斯（Walter Gropius）说：“创造建筑就是参与社会。”世事洞明的智慧与力学法则同样是对建筑师事业有力的支撑。     

网络规则

“有人就有恩怨，有恩怨就有江湖，人就是江湖，江湖无处不在”，我们沉身其中的网络世界莫不如此!江湖有侠骨柔情。道义气节，网络有什么?“绿色田园”园主“黑蜘蛛”在一场意外的网络“官司”后，开始反省……     

网络规则

“有人就有恩怨,有恩怨就有江湖,人就是江湖,江湖无处不在”,我们沉身其中的网络世界莫不如此!江湖有侠骨柔情,道义气节,网络有什么?“绿色田园”园主“黑蜘蛛”在一场意外的网络“官司”后,开始反省……IT业的迅猛发展,为我们开辟了一个前所未有的新天地。一批年轻有为的IT才俊在企业界异军突起,在给人们心灵震撼的同时,也强烈地刺激我们的校园文化,开办IT公司迅即成为校园里的一种时尚。学计算机软件专业的李宜和几个不愿错过潮流的同学也申请注册成立了一家绿色网络文化公司,经营“绿色田园”文化信息网站。由于版面设计新颖、内容丰…     

关于关联规则算法中规则遗失问题的研究

针对Apriori算法及ML-T2算法在应用时会造成规则遗失的问题,文章对关联规则进行了研究,并提供了可行的解决方案。其一为不改变原算法从顶到底的思想,充分利用预先设置的minSup值,通过在高层上预存可能会在底层上构成候选大项集的项集来保证有用规则的完全提取;其二则采用从底到顶的思想,运用不产生候选大项集方法,并把它扩展到由底层到顶层的各层建立各自的FP树,这样也不会造成有用规则的丢失。     

Consistency of Rules and Norms

This paper develops the theory that a set of rules is consistent if it is not possible that (1) the conditions of the rules in the set are all satisfied (2) there is no exception to either one of the rules, and (3) the consequences of the rules are incompatible. To this purpose the notion of consistency is generalised to make it cover rules and is relativised to a background of constraints. It is argued that a similar theory is also useful to characterise the consistency of deontic sentences of the ought-to-do type. The theory about rule consistency is formalised by means of Rule Logic, in which rules are treated as constraints on the possible worlds in which they exist. Rule Logic itself is introduced by giving a model-theory for it. It is characterised by means of constraints on worlds that are possible according to Rule Logic. The formal theory is refined by disallowing ungrounded exceptions to rules. To that purpose an additional constraint is imposed on worlds that are possible according to Rule Logic.     

Beyond Market Baskets: Generalizing Association Rules to Dependence Rules

One of the more well-studied problems in data mining is the search for association rules in market basket data. Association rules are intended to identify patterns of the type: A customer purchasing item A often also purchases item B. Motivated partly by the goal of generalizing beyond market basket data and partly by the goal of ironing out some problems in the definition of association rules, we develop the notion of dependence rules that identify statistical dependence in both the presence and absence of items in itemsets. We propose measuring significance of dependence via the chi-squared test for independence from classical statistics. This leads to a measure that is upward-closed in the itemset lattice, enabling us to reduce the mining problem to the search for a border between dependent and independent itemsets in the lattice. We develop pruning strategies based on the closure property and thereby devise an efficient algorithm for discovering dependence rules. We demonstrate our algorithm's effectiveness by testing it on census data, text data (wherein we seek term dependence), and synthetic data.     

时序规则挖掘

提出了新颖的时间序列模式和规则挖掘技术。该技术先把待挖掘的时间序列转换成子时间序列数据,然后利用子时间序列所隐藏的知识,来指导对原时间序列的挖掘,从中提取模式或规则。给出了时间序列模式和规则的挖掘算法,并举例说明该算法是有效和可行的。     

关联规则向Snort规则转换的应用研究

在入侵检测中的使用关联规则算法,在检测的时候需要重新计算一些统计数据,降低了检测的速度和准确度,所以它提出了一种把数据挖掘的关联规则转化成Snort规则库的方法,这样既提高了入侵检测的速度和准确率,也使得入侵检测具有了一定的自适应能力。     

When Robert Rules

The principles behind the sometimes weird Robert's Rule of Order that govern many formal assemblies in North America can be applied to the conduct of a wide range of meetings in software development.     

原关联规则及其应用

在大型数据库项目之间发现关联规则是一个重要的数据挖掘问题,而挖掘出的关联规则数目常常是巨大的.文中介绍了简单关联规则和原关联规则的概念,而传统算法挖掘出的关联规则集中的任何规则,均可以由原关联规则导出,并且原关联规则的数目远远小于传统算法挖掘出的关联规则数目.对简单关联规则和原关联规则进行了分析比较,给出了挖掘原关联规则算法,并举例说明算法的执行过程.     

原关联规则及其应用

在大型数据库项目之间发现关联规则是一个重要的数据挖掘问题,而挖掘出的关联规则数目常常是巨大的。文中介绍了简单关联规则和原关联规则的概念,而传统算法挖掘出的关联规则集中的任何规则,均可以由原关联规则导出,并且原关联规则的数目远远小于传统算法挖掘出的关联规则数目。对简单关联规则和原关联规则进行了分析比较,给出了挖掘原关联规则算法,并举例说明算法的执行过程。     

AGM Contraction and Revision of Rules

In this paper we study AGM contraction and revision of rules using input/output logical theories. We replace propositional formulas in the AGM framework of theory change by pairs of propositional formulas, representing the rule based character of theories, and we replace the classical consequence operator Cn by an input/output logic. The results in this paper suggest that, in general, results from belief base dynamics can be transferred to rule base dynamics, but that a similar transfer of AGM theory change to rule change is much more problematic. First, we generalise belief base contraction to rule base contraction, and show that two representation results of Hansson still hold for rule base contraction. Second, we show that the six so-called basic postulates of AGM contraction are consistent only for some input/output logics, but not for others. In particular, we show that the notorious recovery postulate can be satisfied only by basic output, but not by simple-minded output. Third, we show how AGM rule revision can be defined in terms of AGM rule contraction using the Levi identity. We highlight various topics for further research.     

关联规则的冗余删除与聚类

关联规则挖掘常常会产生大量的规则，这使得用户分析和利用这些规则变得十分困难，尤其是数据库中属性高度相关时，问题更为突出．为了帮助用户做探索式分析，可以采用各种技术来有效地减少规则数量，如约束性关联规则挖掘、对规则进行聚类或泛化等技术．本文提出一种关联规则冗余删除算法ADRR和一种关联规则聚类算法ACAR．根据集合具有的性质，证明在挖掘到的关联规则中存在大量可以删除的冗余规则，从而提出了算法ADRR；算法ACAR采用一种新的用项目间的相关性来定义规则间距离的方法，结合DBSCAN算法的思想对关联规则进行聚类．最后将本文提出的算法加以实现，实验结果表明该算法暑有数可行的．且具较高的效率。     

一种基于关联规则挖掘的分类规则挖掘算法

本文根据关联规则和分类规则的概念与表示形式,指出在关联规则挖掘过程中如果指定挖掘与一个确定的项相关联,那么就是分类规则挖掘了,论述了分类规则是特殊情况下的关联规则,并指出在这种特殊情况下,关联规则所具有的特征;然后根据这一论述,提出了一种在关联规则挖掘算法中利用限制条件概率分布来发现分类规则的算法。     

时态数据库中非数值型属性周期规律挖掘以及关联规则提取

时态数据库中数值型属性(项)的周期规律挖掘已经得到了研究,提出的方法能够计算时态数据库中某个非数值型属性的周期,并通过执行改造了的Apriori算法挖掘该属性的周期规律,与此同时,算法也能够提取时态数据库中其他属性的带时态信息的关联规则.提出的方法通过选取两个时间粒度,对时态数据库中的时间属性进行了两次划分和标记.通过划分和标记计算选出的某非数值型属性的周期;并用标记集合代替原时间区间,进行标记集合求交,根据求交的结果得到带时态信息的频繁项集.通过时间区间标记集合求交得到频繁项集的方法是一个特色.算法的这一特色使得Apriori算法的迭代过程迅速收敛,提高算法执行效率.