Matching subsequences in trees

Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new algorithms improving the previously best known time and space bounds.     

基于Web Services的移动通信综合网管系统

基于Web Services分布式原理，提出了一种新的移动通信综合网管系统的方案．该系统与目前国内传统的TMN网管系统相比，在匹配性、移植性、扩展性、安全性以及重用性等方面都具有明显的优越性．通过对Web Services体系结构分析研究，给出了Web Services到TMN网管系统的映射．并在试验环境中，实现和验证了这种基于Web Services分布式综合网管系统．最后对如何用，ETWeb服务来实现综合的网管的关键技术进行了阐述和分析。     

Schematization of networks

We study the problem of computing schematized versions of network maps, like railroad or highway maps. Every path of the schematized map has two or three links with restricted orientations, and the schematized map must be topologically equivalent to the input map. Our approach can handle several types of schematizations, and certain additional constraints can be added, such as a minimum vertical distance between two paths. Our algorithm runs in O(nlogn) time, and experimental results showing the quality of the output are given.     

An exploration of students’ errors in derivatives in a university of technology

This paper reports on an exploration of errors that were displayed by students who studied mathematics in chemical engineering in derivatives of various functions such as algebraic, exponential, logarithmic and trigonometric functions. The participants of this study were a group of twenty students who were at risk in an extended curriculum programme in a university of technology in Western Cape, South Africa. The researcher used a qualitative case study approach and collected data from students’ written work. This research uses action, process, object, and schema (APOS) theory to classify errors into categories and to analyse and interpret the data collected. The students displayed five different kinds of errors, namely, conceptual, interpretation, linear extrapolation, procedural and arbitrary. The use of APOS theory as a framework revealed that several students’ errors might be caused by over-generalisation of mathematical rules and properties such as the power rule of differentiation and distributive property in manipulation of algebraic expressions. This study suggests that teaching of the standard rules of differentiation should put emphasis on its restrictions to eliminate common errors that normally crop up due to over-generalisation of certain differentiation rules.     

基于XML扩展的Agent通信语言实现

KQML作为一种重要的Agent通信语言,其常用的内容层知识交换语言KIF表示能力存在不足,不能充分表达复杂语义信息。本文提出采用XML扩展KQML通信语言,以增强KQML表达复杂语义的能力,并给出了详细的实现步骤。     

电子词典软件系统中对维、哈、柯文进行自动判别技术的研究

本文以汉、维、哈、柯等具有多种书写方向的多文种电子词典软件系统开发为背景,针对语种相关的词语书写方向识别,词语的文种识别,提出了相应的解决方案:通过XML的标注属性和字母的Unicode区域从属关系来判断词语的书写方向;通过计算组成词语的各个字母来自不同语言的概率来判断词语的文种,应用结果表明该技术方案具有可行性和有效性.     

XML-Data模式的一致性问题

运用键、外键和XML-Data模式篱笆等概念研究了XM-Data模式的一致性问题，XML-Data模式的一致性问题就是判断是否存在一个既满足XML-Data模式又满足完整性约束的XML-Data模式篱笆．提出了XML-Data模式及XML-Data模式篱笆的概念．给出了如何从现有的XML-Data模式构造XML-Data模式篱笆的算法并且证明了XML-Data模式的一致性问题是不可判定的。     

基于AI-ESTATE标准的贝叶斯网络诊断模型研究

贝叶斯网络在解决复杂装备中不确定性和关联性引起的故障中具有很大优势,建立符合AI-ESTATE标准的贝叶斯网络模型,对实现其通用性至关重要;首先介绍了AI-ESTATE标准的主要内容、体系结构和六种信息模型;其次,在对贝叶斯网络进行分析的基础上,研究如何将公共元素模型扩展为贝叶斯网络模型,详细介绍了拓展过程并给出了拓展框图,同时对各实体和属性进行了说明;最后,针对标准中采用的EXPRESS描述语言编辑工具少、通用性差等问题,采用XML语言对其交换文件进行描述,使得诊断信息具备更好的可移植性和互操作性。     

基于XML的故障诊断虚拟训练描述模型研究

随着科学技术的迅猛发展,传统故障诊断训练存在的问题日益突出,越来越难以满足维修人员的故障诊断训练需求。提出了通过虚拟方式进行辅助训练,来提高维修人员的故障诊断能力和掌握故障诊断相关知识,满足故障诊断训练需求。为实现故障诊断虚拟训练,分析了故障诊断虚拟训练模型的描述要素和描述语言。运用诊断树分析方法,基于XML建立了故障诊断虚拟训练描述模型,为实现故障诊断虚拟训练提供模型支撑。最后,基于此模型对液压千斤顶回收不到位的故障进行了描述,验证了描述模型的正确性与实用性。