Transferring Case Knowledge To Adaptation Knowledge: An Approach for Case-Base Maintenance

In this article we propose a case-base maintenance methodology based on the idea of transferring knowledge between knowledge containers in a case-based reasoning (CBR) system. A machine-learning technique, fuzzy decision-tree induction, is used to transform the case knowledge to adaptation knowledge. By learning the more sophisticated fuzzy adaptation knowledge, many of the redundant cases can be removed. This approach is particularly useful when the case base consists of a large number of redundant cases and the retrieval efficiency becomes a real concern of the user. The method of maintaining a case base from scratch, as proposed in this article, consists of four steps. First, an approach to learning feature weights automatically is used to evaluate the importance of different features in a given case base. Second, clustering of cases is carried out to identify different concepts in the case base using the acquired feature-weights knowledge. Third, adaptation rules are mined for each concept using fuzzy decision trees. Fourth, a selection strategy based on the concepts of case coverage and reachability is used to select representative cases. In order to demonstrate the effectiveness of this approach as well as to examine the relationship between compactness and performance of a CBR system, experimental testing is carried out using the Traveling and the Rice Taste data sets. The results show that the testing case bases can be reduced by 36 and 39 percent, respectively, if we complement the remaining cases by the adaptation rules discovered using our approach. The overall accuracies of the two smaller case bases are 94 and 90 percent, respectively, of the originals.     

The structure of subword graphs and suffix trees of Fibonacci words

We use automata-theoretic approach to analyze properties of Fibonacci words. The directed acyclic subword graph (dawg) is a useful deterministic automaton accepting all suffixes of the word. We show that dawg's of Fibonacci words have particularly simple structure. Our main result is a unifying framework for a large collection of relatively simple properties of Fibonacci words. The simple structure of dawgs of Fibonacci words gives in many cases simplified alternative proofs and new interpretation of several well-known properties of Fibonacci words. In particular, the structure of lengths of paths corresponds to a number-theoretic characterization of occurrences of any subword. Using the structural properties of dawg's it can be easily shown that for a string w$w$ we can check if w$w$ is a subword of a Fibonacci word in time O(|w|)$\mathrm{O}(|w|)$ and O(1)$\mathrm{O}(1)$ space. Compact dawg's of Fibonacci words show a very regular structure of their suffix trees and show how the suffix tree for the Fibonacci word grows (extending the leaves in a very simple way) into the suffix tree for the next Fibonacci word.     

Efficient Regular Data Structures and Algorithms for Dilation, Location, and Proximity Problems

In this paper we investigate data structures obtained by a recursive partitioning of the multi- dimensional input domain into regions of equal size. One of the best known examples of such a structure is the quadtree . It is used here as a basis for more complex data structures. We also provide multidimensional versions of the stratified tree by van Emde Boas [vEB]. We show that under the assumption that the input points have limited precision (i.e., are drawn from the integer grid of size u ) these data structures yield efficient solutions to many important problems. In particular, they allow us to achieve O(log log u) time per operation for dynamic approximate nearest neighbor (under insertions and deletions) and exact on-line closest pair (under insertions only) in any constant number of dimensions. They allow O(log log u) point location in a given planar shape or in its expansion (dilation by a ball of a given radius). Finally, we provide a linear time (optimal) algorithm for computing the expansion of a shape represented by a region quadtree. This result shows that the spatial order imposed by this regular data structure is sufficient to optimize the operation of dilation by a ball. Received January 19, 1999; revised November 4, 1999.     

对表首HG排版语言的一个简化

华光 (HG)或方正 (BD)排版系统在社会上己广泛的应用到印刷行业和企事业的办公自动化 ,以其功能强、字体优美、字号齐全、排版规范、输出精度高等突出特点 ,赢得了人们的赞誉。但是与其它一些电子排版系统的形象化、直观性相比 ,HG(BD)排版语言的抽象性 ,也令一些初学者感到烦琐 ,难记忆 ,有些命令在还没有深入学习的情况下是很难接受的 ,表格中表首的排版语言就是一个例子 ,本文给出表首排版语言的一个简化 ,使其达到预期的效果 ,让人感到简单易懂 ,如表首 :项目年 份 1991年 1992年 1993年排版小样文件 (a)为 :【BG(!】【BHDFG3,FK…     

Balancing Misclassification Rates in Classification-Tree Models of Software Quality

Software product and process metrics can be useful predictorsof which modules are likely to have faults during operations.Developers and managers can use such predictions by softwarequality models to focus enhancement efforts before release.However, in practice, software quality modeling methods in theliterature may not produce a useful balance between the two kindsof misclassification rates, especially when there are few faultymodules.This paper presents a practical classificationrule in the context of classification tree models that allowsappropriate emphasis on each type of misclassification accordingto the needs of the project. This is especially important whenthe faulty modules are rare.An industrial case study using classification trees, illustrates the tradeoffs.The trees were built using the TREEDISC algorithm whichis a refinement of the CHAID algorithm. We examinedtwo releases of a very large telecommunications system, and builtmodels suited to two points in the development life cycle: theend of coding and the end of beta testing. Both trees had onlyfive significant predictors, out of 28 and 42 candidates, respectively.We interpreted the structure of the classification trees, andwe found the models had useful accuracy.     

On the spectral radius of H-shape trees

A H-shape is a tree with exactly two of its vertices having maximal degree 3. In this paper, we show that 2≤λ₁ (H)<√ 5, where λ₁ (H) is the spectral radius of H.     

An efficient algorithm for estimating rotation distance between two binary trees

There are a number of ways of measuring the difference in shape between two rooted binary trees with the same number of leaves. Pallo (Computer Journal, 9, 171–175, 1986) introduced a left weight sequence, which is a sequence of positive integers, to characterize the structure of a binary tree. By applying the AVL tree transformation on binary trees, we develop an algorithm for the efficient transformation of the left weight sequences between two binary trees.     

适应用户需求变化的前摄推荐模型

为了减少前摄推荐对用户当前活动可能产生的干扰,提出一种适应用户接受度变化的前摄推荐模型,感知用户对系统主动的信息推送是否有潜在需求以及需求的波动性,以提高用户体验。使用接受度向量来评估用户对信息推送的需求,应用决策树算法对用户历史上下文进行规则推理,形成用户对上下文推荐的接受度向量,并根据上下文变化和用户反馈来调整推荐接受度向量。试验结果表明,模型能够响应用户对推荐的动态变化,有助于改善用户体验。     

武都水库坝基深层抗滑稳定性评价中BD角的合理取值

针对武都水库大坝坝基深层抗滑稳定性分析过程中BD角合理取值问题,应用多种严格极限平衡法和极限分析法对该坝基深层抗滑稳定性评价中的BD角取值进行了分析论证,研究BD角在各种工况下变化趋势与合理取值。结果表明:BD角不等于0°,不考虑BD角会低估坝基的抗滑能力;潜在滑面稳定性较好时,BD角较小,潜在滑面稳定性较差时,BD角较大;对于武都水库大坝坝基加固工程及类似工程,采用规范中双滑面等安全系数法计算时,BD角取15°是合适的且留有安全裕度。武都水库大坝坝基加固工程的BD角取为15°,节约了大量加固费用。