C/C + +源代码风格检测工具的实现

文中给出了评价C／C 源代码风格的规则分类和检查工具的总体结构，阐述了代码检查工具的核心技术——扩展词法分析和扩展语法分析，给出了代码检测工具的应用实例。     

Manufacturing and structural safety evaluation of a composite train carbody

This paper explains the manufacturing process of a composite train carbody with a sandwich composite structure for bodyshell and a stainless steel structure for the under frame. In addition, the structural behavior and safety of the composite carbody of the Korean tilting train was investigated by the static load tests. From the test results, the stiffness of the composite carbody met the specified design. In the aspect of strength, the maximum stress of the composite bodyshell was of 12.2% of strength of CF1263 carbon/epoxy.     

Choosing OWA operator weights in the field of Social Choice

One of the most important issues in the theory of OWA operators is the determination of associated weights. This matter is essential in order to use the best-suited OWA operator in each aggregation process. Given that some aggregation processes can be seen as extensions of majority rules to the field of gradual preferences, it is possible to determine the OWA operator weights by taking into account the class of majority rule that we want to obtain when individuals do not grade their pairwise preferences. However, a difficulty with this approach is that the same majority rule can be obtained through a wide variety of OWA operators. For this reason, a model for selecting the best-suited OWA operators is proposed in this paper.     

An efficient algorithm for mining frequent inter-transaction patterns

In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent inter-transaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, called ITP-Miner (Inter-Transaction Patterns Miner), to mine all frequent inter-transaction patterns. By using the ITP-tree, the algorithm requires only one database scan and can localize joining, pruning, and support counting to a small number of dat-lists. The experiment results show that the ITP-Miner algorithm outperforms the FITI (First Intra Then Inter) algorithm by one order of magnitude.     

电梯交通系统(Ⅰ)──电梯交通配置现状及发展

本文对国内外电梯交通配置设计现状及发展趋势作了论述。指出了由统计特性描述进入到采用专家系统和模糊规则的动态特性描述这一总的发展趋势。     

Tree-based partitioning of date for association rule mining

The most computationally demanding aspect of Association Rule Mining is the identification and counting of support of the frequent sets of items that occur together sufficiently often to be the basis of potentially interesting rules. The task increases in difficulty with the scale of the data and also with its density. The greatest challenge is posed by data that is too large to be contained in primary memory, especially when high data density and/or low support thresholds give rise to very large numbers of candidates that must be counted. In this paper, we consider strategies for partitioning the data to deal effectively with such cases. We describe a partitioning approach which organises the data into tree structures that can be processed independently. We present experimental results that show the method scales well for increasing dimensions of data and performs significantly better than alternatives, especially when dealing with dense data and low support thresholds. Shakil Ahmed received a first class BSc (Hons) degree from Dhaka University, Bangladesh, in 1990; and an MSc (first class), also Dhaka University, in 1992. He received his PhD from The University of Liverpool, UK, in 2005. From 2000 onwards he is a member of the Data Mining Group at the Department of Computer Science of the University of Liverpool, UK. His research interests include data mining, Association Rule Mining and pattern recognition. Frans Coenen has been working in the field of Data Mining for many years and has written widely on the subject. He received his PhD from Liverpool Polytechnic in 1989, after which he took up a post as a RA within the Department of Computer Science at the University of Liverpool. In 1997, he took up a lecturing post within the same department. His current Data Mining research interests include Association rule Mining, Classification algorithms and text mining. He is on the programme committee for ICDM'05 and was the chair for the UK KDD symposium (UKKDD'05). Paul Leng is professor of e-Learning at the University of Liverpool and director of the e-Learning Unit, which is responsible for overseeing the University's online degree programmes, leading to degrees of MSc in IT and MBA. Along with e-Learning, his main research interests are in Data Mining, especially in methods of discovering Association Rules. In collaboration with Frans Coenen, he has developed efficient new algorithms for finding frequent sets and is exploring applications in text mining and classification.     

浅论建设项目投资控制的重点

建设项目控制的重点应放在投资决策和设计阶段中,否则会造成巨大的损失。这不仅需要人们改革组织结构和管理体制,更需要从根本上转变思想观念。     

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

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

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

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