基于启发式规则优化的网页元素提取方法

网页信息提取方法中的启发式规则,是识别网页标签信息、利用网页节点分析结果、针对网页不同内容、完成信息提取的重要手段。本研究在对现有启发式规则进行研究分析的基础上,提出了几种优化的启发式规则,实现对网页标题、发布时间、来源以及正文内容等元素信息的精准提取。本研究进一步提出了运用编辑距离算法实现正文内容提取准确率的判定,并提出阙值优化方法,克服了正文提取中噪声节点多、内容识别不完全的缺陷,大大提高了提取的准确度。     

基于地统计方法的二氧化碳浓度空间插值研究

克里格法（Kriging）是地质统计学的主要内容之一,从统计意义上说,是从变量关系和变异性出发,在有限区域内对区域化变量的取值进行无偏、最优估计的一种方法：从插值角度讲是对空间分布的数据求线性最优、无偏内插估计的一种方法。克里格法的适用条件是区域化变量存在空间相关性。将临安市内的二氧化碳作为区域化变量．根据不同的半变异函数理论模型,采用普通Kriging法,通过对比分析得到：基于地统计的插值方法。根据半变异函数云图和试验方差最小的原理．选择合适的半变异函数理论模型进行变量的空间插值．能够较好地模拟区域化变量的空间连续分布格局．并取得较好效果。     

最小支持度在教学质量评价系统中的数据挖掘应用

以当前的高职高专院校教育教学为平台,研究分析最小支持度关联规则挖掘技术与教学质量评价相结合的问题,针对教学质量评价结果中的盲目性、不易把握等问题,提出利用最小支持度来分析质量评价体系,获取以影响因素为条件,以评价分析为结论的关联规则来解决目前教学质量评价中的不合理性,使教学质量评价公平、公正、合理、高效,并给教学管理人员提供决策分析资料。     

制定规则实现邮件管理自动化

邮件管理自动化的实现,在提高邮件传递质量的同时,还能避免不必要的垃圾邮件。     

基于聚类分析的新书推荐

针对大多数图书馆管理系统中的个性化服务中的新书推荐只是定时将新到馆的图书罗列出来让读者浏览进行推荐,推荐效果差的问题。本文在比较三大常用的推荐技术的优缺点后,采用基于聚类分析的推荐算法推荐新书,并具体给出实现的方法。     

引入关联分析的用户行为信任评估在云计算平台中的研究

关联规则是数据挖掘的重要方法。随着国内外云计算应用及研究的不断推进,云计算的安全性成为云计算的核心问题之一。通过进行用户的状态行为关联分析,提取信任信息,结合可信云的思想,提出一个云计算下基于信任的防御系统模型。     

基于数据挖掘的复杂装备维修辅助决策研究

文章通过某装备维修信息框架分析,维修数据预处理,然后以维修记录为例,挖掘出了维修件之间关联规则,并采用决策树分类方法对维修件进行了分类,这些规则和分类结果可以为维修计划制定、器材采购、视情维修等方面提供决策依据。     

Modal logic as metalogic

The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory.     

Supporting inconsistent rules in database systems

When a set of rules generates (conflicting) values for a virtual attribute of some tuple, the system must resolve the inconsistency and decide on a unique value that is assigned to that attribute. In most current systems, the conflict is resolved based on criteria that choose one of the rules in the conflicting set and use the value that it generated. There are several applications, however, where inconsistencies of the above form arise, whose semantics demand a different form of resolution. We propose a general framework for the study of the conflict resolution problem, and suggest a variety of resolution criteria, which collectively subsume all previously known solutions. With several new criteria being introduced, the semantics of several applications are captured more accurately than in the past. We discuss how conflict resolution criteria can be specified at the schema or the rule-module level. Finally, we suggest some implementation techniques based on rule indexing, which allow conflicts to be resolved efficiently at compile time, so that at run time only a single rule is processed.An earlier version of this work appeared under the title Conflict Resolution of Rules Assigning Values to Virtual Attributes inProceedings of the 1989 ACM-Sigmod Conference, Portland, OR, June 1989, pp. 205–214.Partially supported by the National Science Foundation under Grant IRI-9157368 (PYI Award) and by grants from DEC, HP, and AT&T.Partially supported by the National Science Foundation under Grant IRI-9057573 (PYI Award), IBM, DEC, and the University of Maryland Institute for Advanced Computer Studies (UMIACS).