基于XML的SIPN表示与解析研究

基于XML设计了一种Petri网（SIPN）的交换格式。XML是具有数据描述功能、高度结构性及可验证性的语言,首先设计了SIPN的Schema文件,并根据该Schema文件将SIPN图形转化成XML格式文件,该文件包含了SIPN的图形和语义信息。利用DOM对该XML格式的SIPN模型进行解析,可以提取模型的关键信息,为应用程序提供一个接口,这可以推动基于Petri网的应用程序开发,实例证明该方法具有很好的实用性和可扩展性,可以用于其它扩展Petri网格式的设计。     

Android系统应用程序组件安全性分析

针对当前Android系统第三方应用程序组件中普遍存在的各种安全问题,分析了引起这种问题的原因。提出了一种基于静态分析Android应用程序中四种组件的属性信息和Java系统服务中的敏感API（Application Programming Interface）调用信息,通过构建Android应用程序的函数调用关系图,检测组件入口函数和和敏感API之间可能存在的不安全的静态可执行路径。该方案主要利用反编译、XML（extensible markup language）文件解析和正则表达式匹配技术以获取应用程序的组件和敏感API的调用信息。实验结果表明了该方案的可行性和有效性。     

一种基于XML的非结构化数据转换方法

XML作为半结构化的语言,因其能预先定义标记等优势被普遍应用于非结构化到结构化信息的转换中。利用POI技术把网络上繁杂的非结构化数据转化为XML半结构化数据,把半结构化数据转化为结构化数据,使用户能够简便地查询所需信息。通过实验对SAX,DOM的解析效率进行了对比,实验表明解析相同大小的XML文件,SAX比DOM效率更高,而且此种差距会随着XML文件的增大而逐渐增大。     

基于SAX的XML文档解析和存储技术应用

XML作为一种中间的数据接口，已经显示出其不可替代的重要性。SAX使得Web应用程序能方便地解析和利用XML文档，同时使用哈希表存储数据可以使外部程序方便地调用解析XML文档后的数据。文中首先分析了SAX编程接口，对XML文档的解析机制进行了较深入的探讨；然后提出了一种使用哈希表存储XML数据以供外部程序调用的实现技术。     

基于SAX的XML文档解析和存储技术应用

XML作为一种中间的数据接口,已经显示出其不可替代的重要性.SAX使得Web应用程序能方便地解析和利用XML文档,同时使用哈希表存储数据可以使外部程序方便地调用解析XML文档后的数据.文中首先分析了SAX编程接口,对XML文档的解析机制进行了较深入的探讨;然后提出了一种使用哈希表存储XML数据以供外部程序调用的实现技术.     

XML及GDI+在便携式电子相册中的应用

针对便携式电子相册的优越性,综合运用XML及GDI+技术在嵌入式移动设备上开发了电子相册系统.相册底层图片信息采用XML文件存储,图片文件单独放置在设定好的文件夹中进行管理,上层应用程序基于.NET平台使用C#编程,嵌入式移动设备以Windows CE 6.0作为软件开台,系统采用XML反序列化的方式获取XML文档数据,最后通过GDI+技术将图片信息显示到电子相册系统界面中,实现了图片的浏览和编辑.     

基于Web Services的电子文件归档研究

设计了一个电子政务系统的电子文件归档的解决方案．该方案结合Web Services这项新的应用程序开发技术．利用数字签名、DIME数据封装、SOAP协议、数据加密、XML等技术实现电子文件归档Web Services接口。该接口具有安全、平台无关性等特点。     

基于XML的Web信息数据库的建立

为了有效地从Web页面上提取数据信息,本文建立一种基于XML的Web信息收集数据库。利用开源工具JTidy将Web页面加以整理,利用XML良好的结构特性,使用Dom4j工具包解析XML文件;按照XML中的标签层次特点作为对数据进行储存的依据;最后使用Hibernate将数据持久化地储存于数据库中,方便数据的储存与查询。     

用XML文件保存应用程序的配置信息

随着XML在跨平台数据交换技术中的广泛应用,越来越多的软件采用XML文件作为配置文件的形式。本文通过一个实例讲述在C Builder中用XML文件保存应用程序的配置信息的实现过程。     

基于表格驱动的XML配置文件解析与生成技术

XML文件作为配置文件是很多系统的首选,但是目前针对XML文件的配置信息提取与配置文件的构造技术都缺乏通用性,效率较低,扩展性很差。针对这一问题,论文提出了一种通用的基于表格驱动的XML配置文件解析与构造技术。该技术具有如下几个特征:第一,采用表格驱动,用表格来表示XML的结构信息,可实现配置信息更加严格的验证;第二,利用表格中的槽(slot)结合函数回调来提取配置信息和生成配置文件,使数据和对数据的操作分开,降低了与配置文件的耦合性,同时也使解析和构造统一化,具有高效性。第三,采用基于插件的开放式架构,通过扩展插件可以解析、生成任何复杂的配置文件,具有易扩展性;实际应用表明,论文提出的XML配置文件解析与构造技术具有通用性、易扩展性和高效性。     

一种基于内容模型图的XML Schema Definition的提取方法

使用XML Schema能够对XML文档进行有效性验证以及对查询、转换等操作进行优化,但是实际应用中大量XML文档缺失关联的Schema.提出了一种根据XML文档自动提取对应的XML Schema Definition(XSD)的方法XSDInfer,先根据合并规则将XML解析过程中分析得到的模式信息记录在内容模型图中,再根据生成规则将其转化为内容模型表达式,进而得到XSD.XSDInfer能够在内存消耗比较少的情况下快速地处理超大规模、深度嵌套的XML文档,同时支持XSD的上下文相关的内容模型,提取出的XSD也具有更好的可读性.实验表明,与同类方法相比,XSDInfer具有更好的可扩展性和表达能力.     

Contracts for cross-organizational workflows as timed Dynamic Condition Response Graphs

We conservatively extend the declarative Dynamic Condition Response (DCR) Graph process model, introduced in the PhD thesis of the second author, to allow for discrete time deadlines. We prove that safety and liveness properties can be verified by mapping finite timed DCR Graphs to finite state transition systems. We exemplify how deadlines can introduce time-locks and deadlocks and violate liveness. We then prove that the general technique for safe distribution of DCR Graphs provided in previous work can be extended to timed DCR Graphs. We exemplify the use of timed DCR Graphs and the distribution technique in praxis on a timed extension of a cross-organizational case management process arising from a previous case study. The example shows how a timed DCR Graph can be used to describe the global contract for a timed workflow process involving several organizations, which can then be distributed as a network of communicating timed DCR Graphs describing the local contract for each organization.     

基于决策图贝叶斯优化进化算法的图K-划分算法

图K-划分问题是一种组合优化问题,可以归结为NP难题.针对该问题本文提出了一种基于决策图贝叶斯优化算法(Bayesian Optimization Algorithm with Decision Graphs,简称DBOA)的图K-划分,该算法利用新的编码和解码方法以及适当的适应度函数来求解图K-划分问题.仿真结果表明了该算法的可行性和有效性.     

基于模式图的规范化XML模式设计

在给定关系模式的属性集及其函数依赖最小覆盖集的基础上,提出一种基于模式图的规范化XML模式设计方法。定义了模式图,在模式图中增加了Keys的描述信息,给出由函数依赖集构造模式图的算法。该模式图独立于具体的XML模式语言,经分析证明,所设计的模式满足XNF。     

Deduction Graphs with Universal Quantification

Deduction Graphs are meant to generalise both Gentzen-Prawitz style natural deductions and Fitch style flag deductions. They have the structure of acyclic directed graphs with boxes. In [Herman Geuvers and Iris Loeb. Natural Deduction via Graphs: Formal Definition and Computation Rules. Mathematical Structures in Computer Science (Special Issue on Theory and Applications of Term Graph Rewriting), Volume 17(03):485–526, 2007.] we have investigated the deduction graphs for minimal proposition logic. This paper studies the extension with first-order universal quantification, showing the robustness of the concept of deduction graphs.     

Concurrent Query Processing for Logic Inference Using the Connection Graph

Some logic program may have to process a sequence of asynchronously arriving concurrent queries. We provide a tagging scheme for resolution in the Connection Graph that allows later queries to reuse the work done for earlier or concurrent queries. The scheme can be used either by a sequential or a parallel logic inference system that uses the Connection Graph proof procedure. Our scheme is justified in terms of multiplexing multiple virtual Connection Graphs on one physical data structure. The tagging scheme is presented as a set of rules which are proved to be correct. An important characteristic of the Connection Graph procedure is the ability to delete clauses containing pure literals. In the proposed scheme, it is necessary to weaken it. Given some information about the form of incoming queries, we can strengthen this capability. If earlier links are allowed to be reconstructed, then the ability can be regained fully, via a caching scheme.     

Disease management research using event graphs.

Event Graphs, conditional representations of stochastic relationships between discrete events, simulate disease dynamics. In this paper, we demonstrate how Event Graphs, at an appropriate abstraction level, also extend and organize scientific knowledge about diseases. They can identify promising treatment strategies and directions for further research and provide enough detail for testing combinations of new medicines and interventions. Event Graphs can be enriched to incorporate and validate data and test new theories to reflect an expanding dynamic scientific knowledge base and establish performance criteria for the economic viability of new treatments. To illustrate, an Event Graph is developed for mastitis, a costly dairy cattle disease, for which extensive scientific literature exists. With only a modest amount of imagination, the methodology presented here can be seen to apply modeling to any disease, human, plant, or animal. The Event Graph simulation presented here is currently being used in research and in a new veterinary epidemiology course.     

基于XML元数据和Schema的Excel信息提取研究

针对地质工作单位中使用的复杂格式的Excel报表中的信息同数据库之间转储的困难,提出了采用XML语言描述的元数据模型来辅助表达Excel报表中的信息。使用XML Schema定义XML元数据语法,使得基于元数据的应用程序来提取Excel报表中信息变得更加灵活通用。     

Visio2003在计算机组成原理课件制作中的应用

制作计算机组成原理课件的关键问题是绘制大量的电路图、流程图和示意图。本文介绍了Visio2003在绘制相关图形方面的应用。实践证明,用Visio2003绘制的图形,既简单又方便,是一种理想的绘图软件。     

Translating relational schema into XML schema definition with data semantic preservation and XSD graph

Many legacy systems have been created by using relational database operating not for the Internet expression. Since the relational database is not an efficient way for data explosion, electronic transfer of data, and electronic business on the Web, we introduce a methodology in which a relational schema will be translated to an Extensible Markup Language (XML) schema definition for creating an XML database that is a simple and efficient format on the Web. We apply the Indirect Schema Translation Method that is a semantic-based methodology in this project. The mechanism is that the Relational Schema will be translated into the conceptual model, an Extended Entity Relationship (EER) Model using Reverse Engineering. Afterward, the EER model will be mapped to an XML Schema Definition Language (XSD) Graph as an XML conceptual schema using Semantic Transformation. Finally, the XSD Graph will be mapped into the XSD as an XML logical schema in the process of Forward Engineering, and the data semantics of participation, cardinality, generalization, aggregation, categorization, N-ary and U-ary relationship are preserved in the translated XML schema definition.