计算机技术图书分类标引存在的问题及对策

从文献分类的实践出发，提出了对计算机技术图书分类标引工作存在的问题，分析了问题的原因，提出了解决问题的方法。     

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).     

图像中的文本定位技术研究综述

介绍了图像中文本定位技术的研究现状,依据定位所利用的特征进行分类,分析了其中几种典型算法,并对文本定位算法的性能评价标准进行了深入讨论。     

Semantic weak signal tracing

The weak signal concept according to Ansoff has the aim to advance strategic early warning. It enables to predict the appearance of events in advance that are relevant for an organization. An example is to predict the appearance of a new and relevant technology for a research organization. Existing approaches detect weak signals based on an environmental scanning procedure that considers textual information from the internet. This is because about 80% of all data in the internet are textual information. The texts are processed by a specific clustering approach where clusters that represent weak signals are identified. In contrast to these related approaches, we propose a new methodology that investigates a sequence of clusters measured at successive points in time. This enables to trace the development of weak signals over time and thus, it enables to identify relevant weak signal developments for organization’s decision making in strategic early warning environment.     

Text classification using genetic algorithm oriented latent semantic features

In this paper, genetic algorithm oriented latent semantic features (GALSF) are proposed to obtain better representation of documents in text classification. The proposed approach consists of feature selection and feature transformation stages. The first stage is carried out using the state-of-the-art filter-based methods. The second stage employs latent semantic indexing (LSI) empowered by genetic algorithm such that a better projection is attained using appropriate singular vectors, which are not limited to the ones corresponding to the largest singular values, unlike standard LSI approach. In this way, the singular vectors with small singular values may also be used for projection whereas the vectors with large singular values may be eliminated as well to obtain better discrimination. Experimental results demonstrate that GALSF outperforms both LSI and filter-based feature selection methods on benchmark datasets for various feature dimensions.     

TREOR多晶X射线衍射图指标化程序的适用性

多晶Ｘ射线衍射图指标化的ＴＲＥＯＲ程序已被普遍采用，特别是在硅酸盐矿物等材料的晶体结构研究工作中应用很多。然而，实际上它存在着一定的缺陷，有可能得出错误的结果。本文对这一程序作了详细的检验，发现即使在理想条件下它都不适用于低对称晶系的指标化。在对程序作改进以后，该程序可适用于高对称晶系多晶衍射的指标化     

低空间复杂度的LSH算法及其在图像检索中的应用

局部敏感哈希LSH算法是有效的高维数据索引方法,如何生成哈希函数是算法的关键部分。LSH算法的哈希函数是基于p-稳态分布随机生成的,为了提高算法性能就需要增加哈希表的数量,但这会增加算法的空间复杂度。改进后的LSH算法(I-LSH)在生成哈希函数时不需要有标记的训练样本,而是仅仅利用数据点的分布信息构造投影方向。实验结果表明,在不显著降低检索性能的情况下,ILSH有效地降低了内存的使用量,适合处理大规模数据。     

An efficient bit-based feature selection method

Feature selection is about finding useful (relevant) features to describe an application domain. Selecting relevant and enough features to effectively represent and index the given dataset is an important task to solve the classification and clustering problems intelligently. This task is, however, quite difficult to carry out since it usually needs a very time-consuming search to get the features desired. This paper proposes a bit-based feature selection method to find the smallest feature set to represent the indexes of a given dataset. The proposed approach originates from the bitmap indexing and rough set techniques. It consists of two-phases. In the first phase, the given dataset is transformed into a bitmap indexing matrix with some additional data information. In the second phase, a set of relevant and enough features are selected and used to represent the classification indexes of the given dataset. After the relevant and enough features are selected, they can be judged by the domain expertise and the final feature set of the given dataset is thus proposed. Finally, the experimental results on different data sets also show the efficiency and accuracy of the proposed approach.     

用于图像Hash的视觉相似度客观评价测度

由于评价图像Hash性能时,要求对两幅图像是否在感知上相似做出判断,因此针对这一需求,提出了一种衡量感知相似程度的评价测度。该测度的确定是先对图像进行低通滤波,再进行图像重叠分块;然后运用相关系数检测法计算每一对分块的相似程度,并对相似系数归一化,再分别计算若干个最小和最大的归一化相似系数的乘积;最后用最小相似系数乘积与最大相似系数乘积的比值作为感知相似性的测度。实验结果表明,该测度不仅可有效反映图像视觉质量的变化,而且能较好地区分两幅图像是否存在重要的视觉差异,其对感知相似进行评价的性能优于峰值信噪比。     

Case-Based Learning: Predictive Features in Indexing

Interest in psychological experimentation from the Artificial Intelligence community often takes the form of rigorous post-hoc evaluation of completed computer models. Through an example of our own collaborative research, we advocate a different view of how psychology and AI may be mutually relevant, and propose an integrated approach to the study of learning in humans and machines. We begin with the problem of learning appropriate indices for storing and retrieving information from memory. From a planning task perspective, the most useful indices may be those that predict potential problems and access relevant plans in memory, improving the planner's ability to predict and avoid planning failures. This predictive features hypothesis is then supported as a psychological claim, with results showing that such features offer an advantage in terms of the selectivity of reminding because they more distinctively characterize planning situations where differing plans are appropriate.We present a specific case-based model of plan execution, RUNNER, along with its indices for recognizing when to select particular plans—appropriateness conditions—and how these predictive indices serve to enhance learning. We then discuss how this predictive features claim as implemented in the RUNNER model is then tested in a second set of psychological studies. The results show that learning appropriateness conditions results in greater success in recognizing when a past plan is in fact relevant in current processing, and produces more reliable recall of the related information. This form of collaboration has resulted in a unique integration of computational and empirical efforts to create a model of case-based learning.