非交换BR0-代数与其上的Quantale

提出非交换BR₀-代数的概念,然后讨论了在完备非交换BR₀-代数和完备BR₀-代数上的Quantale性质,最后得出完备Boole代数、完备MV代数、完备R₀-代数以及完备BR₀-代数都是可换的Girard quantales的结论。     

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.     

双Quantales模中的张量积

在双Quantales模中引入了双Quantales模双同态的概念,在完备格张量积的基础上,得到了双Quantales模张量积的具体形式,讨论了双Quantales模张量积的一些重要性质。     

非交换BR0-代数与其上的Quantale

提出非交换BR₀-代数的概念,然后讨论了在完备非交换BR₀-代数和完备BR₀-代数上的Quantale性质,最后得出完备Boole代数、完备MV代数、完备R₀-代数以及完备BR₀-代数都是可换的Girard quantales的结论。     

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分类规则挖掘算法提出了改进，扩展了该算法的适用范围。同时，该采用这两个改进算法实现了一个数据挖掘原型系统。     

关联规则挖掘与分类规则挖掘的比较研究

关联规则挖掘与分类规则挖掘都是数据挖掘,领域中很重要的技术。本文首先简要介绍了关联规则挖掘和分类规则挖掘的基本知识,主要从挖掘目的、发现规则算法的方法、算法的设计思想等几个方面对它们进行了比较,最后介绍了它们之间的联系。     

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

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

丛林法则

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

网络规则

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

规则加权的文本关联分类

近年来,基于关联规则的文本分类方法受到普遍关注。虽然在一般情况下这种方法可获得较好的分类效果。但当样本特征词分布明显不均时,分类规则在各类别的分布也出现不均,从而导致分类准确率下降。本文设计和实现的基于规则权重调整的关联规则文本分类算法可有效地解决这一问题。该算法根据误分类训练样本的数量定义规则强度。对强规则通过乘以小于1 的调整因子降低其权重,而弱规则乘以大于1的调整因子提高其权重。实验结果表明经过规则权重的调整,分类质量显著提高。     

网络规则

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

粗糙集分类算法中的近似决策规则和规则匹配方法

粗糙集分类算法在应用标准决策规则进行新对象分类时,经常碰到决策规则与新对象不完全匹配的情况。因此,近似决策规则和部分匹配方法常用于提高决策规则与新对象匹配的可能性。本文在概述和比较两种近似决策规则生成算法的基础上,以一个文本分类系统为例,提出了一种综合的、更有效的近似决策规则生成算法。文章还介绍了几种通用的规则匹配方法,提出了一系列实用的完全匹配和部分匹配公式。实验表明,新提出的近似决策规则生成算法和规则匹配公式能够有效地提高决策规则与新对象的匹配可能性与准确性。     

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.