Proposed modification to the CIECAM02 colour appearance model to include the simultaneous contrast effects

A modified CIECAM02 colour appearance model, named CIECAM02‐m2, is proposed to enable CIECAM02 to predict the simultaneous contrast effect. The structure of the CIECAM02‐m2 is a development from CIECAM02, and contains two different procedures for modifying the reference white; one is for lightness and the other is for hue. The model was tested using a data set accumulated in this study and the LUTCHI data. The CV values for three colour attributes between predictions and experimental data were used to evaluate the accuracy of the model. The low CV values obtained show the performance of the CIECAM02‐m2 model to predict the simultaneous contrast effect satisfactorily. © 2007 Wiley Periodicals, Inc. Col Res Appl, 32, 121 – 129, 2007     

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.     

车辆扭杆弹簧疲劳载荷谱的编制

该文讨论了编制车辆悬挂扭杆弹簧结构疲劳载荷谱的原则、方法和程序。该文结合某中型车辆使用情况,确定了车辆任务剖面、结构载荷环境、结构载荷情况以及载荷简化原则和方法。最近,阐述了结构疲劳试验谱的编制过程。为扭杆弹簧结构寿命估算提供了编谱方法。     

巡航导弹机动地形相关系统

研究了一种适用于巡航导弹辅助导航的机动地形相关系统(MTCS)。介绍了 MTCS的工作原理、相关定位算法以及提高定位概率的技术途径,指出了系统设计中的关键技术。另外还讨论了 MTCS 的计算机运算,研究结论对地形辅助系统的设计有参考价值。     

Finding approximate matches in large lexicons

Approximate string matching is used for spelling correction and personal name matching. In this paper we show how to use string matching techniques in conjunction with lexicon indexes to find approximate matches in a large lexicon. We test several lexicon indexing techniques, including n-grams and permuted lexicons, and several string matching techniques, including string similarity measures and phonetic coding. We propose methods for combining these techniques, and show experimentally that these combinations yield good retrieval effectiveness while keeping index size and retrieval time low. Our experiments also suggest that, in contrast to previous claims, phonetic codings are markedly inferior to string distance measures, which are demonstrated to be suitable for both spelling correction and personal name matching.     

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

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

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

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

基于OPNET的高速列车控制网络负载平衡研究

随着工业以太网应用于高速列车并成为其控制网络,将可能出现带宽、吞吐量等一系列技术问题。采用基于流水线R—R的负载平衡调度算法,通过OPNET软件建模并调用该算法进行仿真。仿真结果表明,该算法在列车控制网络中的应用是可行的,能较好地解决列车控制网络的负载平衡问题。     

波谱匹配支持的遥感专题地物自适应提取

为贴合地物表现的多样性和复杂性,提出一种波谱匹配支持下的遥感影像专题地物自适应提取方法,经过专题地物端元选取、波谱匹配、影像自动分割、"整体-局部"的空间转换,以及局部针对性、精细化地迭代逼近等一系列相互衔接的算法,全面、准确地提取遥感影像上的专题地物。通过在ETM+影像上水体和裸地的提取实验,并与最大似然法和SVM分类结果比较,证明了该方法对多样性专题地物提取的有效性和普适性。