Search

Abstract: This document provides a common XML-based data representation of a chain-of-trust record to facilitate the exchange of Personal Identity Verification (PIV) Card enrollment data. The exchanged record is the basis to personalize a PIV Card for a transferred employee and also for service providers to personalize a PIV Card on behave of client federal agencies.

Summary: The Internet is already more widely deployed than any other computing system in history and continues to grow rapidly. New technologies, including high speed wide area network and improved software support for distribution, promise to make the Internet much more useful for general purpose distributed computing in the future. This book is dedicated to the new era of information systems on web environments, due to not only the growing popularity of the web technology but also the roles that web technology play in modern information systems. The major elements of web information systems include XML technologies, web mining and querying, web-based information systems, information extraction, and web semantics.

Sharing of spatial data using internet is getting common as seen in various developments in Spatial Data Infrastructure (SDI). Spatial data sharing requires standardized file format for interoperability which could be seen in different working groups in Geography Mark-up Language (GML) and CityGML where different level of details (LOD) is described in CityGML for 3D city. In order to solve the large dataset problem that arises due to XML describ-able advantage used in CityGML, a schema-aware encoder (CitySAC) is invented and achieved better compression ratio and required lesser time, compared to the novel Lemper-Zipf-Markov (LZMA) algorithm. Since geometries and semantics data are required in data transaction over the web services especially for analysis, the use case of the proprietor schema-aware encoder is defined. The advantage of the decoder is the availability for code-on-demand. This chapter discusses brief introduction of the schema-aware development background as well as the related works; the development of javascript decoder to solve the interoperability issue in implementing CitySAC over the open web environment as well as the example application. [ABSTRACT FROM AUTHOR]

With the strong ability of describing and transfer ring data, XML offers an applicable way for data exchange between different data sources. This paper introduces a model-drive method to exchange data in heterogeneous relational databases via XML documents. The relevant processes mainly involve establishing xml documents as a robust middle data source and realizing an effective bidirectional mapping between XML Schema and relational mode. [ABSTRACT FROM AUTHOR]

As we approach the ten-year anniversary of the first working draft of the XQuery language, one finds XML storage and query support in a number of commercial database systems. For many XML use cases, database vendors now recommend storing and indexing XML natively and using XQuery or SQL/XML to query and update XML directly. If the complexity of the XML data allows, shredding and reconstructing XML to/from relational tables is still an alternative as well, and might in fact outperform native XML processing. In this paper we report on an effort to evaluate these basic XML data management trade-offs for current commercial systems. We describe EXRT (Experimental XML Readiness Test), a simple micro-benchmark that methodically evaluates the impact of query characteristics on the comparison of shredded and native XML. We describe our experiences and preliminary results from EXRT΄ing pressure on the XML data management facilities offered by two relational databases and one XML database system. [ABSTRACT FROM AUTHOR]

For standards compliance achievement in model-based engineering of embedded real-time systems, model analyzers and code checkers are constituted in early development phases to lower error rates and to eliminate time-consuming quality reviews. However, solutions available today only address a single modeling language and examinations are localized to specific development environments. Fulfilling more advanced traceability examinations required by procedural and technical quality standards, compliance checking has to be applicable across different modeling tools and development workflows. Furthermore it should cover correlation analyses that include model-to-model, model-to-file and model-to-database comparisons on multiple artifacts. This chapter introduces a novel compliance solution Assessment Studio that supports universal guideline and traceability checking with automated analyses in multi-domain modeling environments. MESA, our meta-modeling approach for guideline checking, was enhanced to support multiple meta-models with associated artifacts. Therefore, we use a XML-based transformation and proof mechanism by automatically executing rules written in LINQ, adding auto-correction and metrics measurement capabilities. Several case studies demonstrate the feasibility of this approach at Volkswagen. [ABSTRACT FROM AUTHOR]

Structural recursion is a general graph traversing and restructuring operation. In [9][10] we extended structural recursions with not-isempty conditions and a limited form of registers in order to simulate a large fragment of XPath 1.0 and XSLT 1.0. In this paper we address the satisfiability and containment problem of structural recursions with not-isempty conditions. We examine two cases, when else-branches are allowed in the conditions and when they are not. In the second case it turns out that the satisfiability problem can be solved in quadratic time, while the question of containment is coNP-complete in general. In the first case both problems are PSPACE-complete in general. Our results have their theoretical importance of their own, however, we hope that they can also be used to fill in some of the gaps in the research of XPath and XSLT. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of evaluating a heavy load of subscribed queries (or simply multi-queries) over compressed XML data in a distributed service-oriented DaaS (Database as a Service) environment. We propose a holistic approach that evaluates complex queries over a compressed document and forwards the compressed results directly to the data requestor (DR). Firstly, we review the data management issues in DaaS, and then we will address the multi-queries optimization problem. Secondly, we introduce a new rewriting translation technique to decompose and reorganize a complex query into its corresponding Structure of complex XPath (SXP). Following this, multi-query evaluation is performed based on the containment relationships between the queries. The containment relationships are exploited by a global data structure, the Structural-Query-Index Tree (SQIT), which supports prefix sharing among the submitted queries. The experimental results demonstrate that the proposed approach obtains higher query processing efficiency than traditional ones. [ABSTRACT FROM AUTHOR]

Service Oriented Architecture is used to achieve loose coupling among diverse interacting software applications. SOA is used for reduction in development time and cost. Web services standards used for SOA are distributed software components that provide information to applications rather than to humans, through an application-oriented interface. SOA with web services standards provide greater interoperability. It also provides protection from lock-in to proprietary vendor software. Using XML based orchestration business process execution language (BPEL) enables task sharing across multiple enterprises using a combination of Web services. Web services combine the advantages of the component-oriented methods and web techniques. Maintaining Web service quality requires more effort to manage overall Web service framework than each of Web service. Web Services Manager is a security administrator΄s environment designed to secure access to Web services and monitor activities performed on protected Web services. Web services provide platform independence for the service oriented communication. This way data integration can be done providing the service as a request and service as provider. [ABSTRACT FROM AUTHOR]

The scenario of Tactical Internet simulative training can΄t be realized directly through the scenario systems and methods in existence. For solving this problem, firstly this paper introduced the new concept called digitized scenario, which can describe the meaning of scenario more exactly than the old simulation scenario. Secondly, this paper constructed the framework of digitized scenario, and it settled such issues as composition of digitized scenario system, scenario generating flow and data architecture. Thirdly, this paper built up the general data model for script situation, and it settled the problem of situation setting. Finally, this paper proposed the method of describing scenario files based on eXtensible Markup Language (XML), and it settled such problems as generation, verification and distribution of scenario files. The paper΄s work has been applied in the Tactical Internet simulative training system, and it also has good directive value to the developing of other communication network simulative training system. [ABSTRACT FROM AUTHOR]

At present, there are large quantities of heterogeneous agriculture database in the network. Agriculture information resources sharing are the tendency of modern agriculture development. Being aimed at the problem of ˵information island″, ˵duplication of similar projects″ and urgent need for agriculture information resources sharing existing in agriculture database construction, the feature of XML΄s suitable for information sharing is analyzed, some key techniques of information sharing are studied, and the implementation plan of agriculture information resources sharing system is provided based on XML in this paper. The system realizes the information sharing and integration of heterogeneous agriculture databases making full use of the advantages of the XML΄s independence with platform, easy extension and may format. The system has good extendibility. [ABSTRACT FROM AUTHOR]

Office applications such as OpenOffice.org and Microsoft office are widely used to do everything you expect from your needs. Because of more and more requirements of information exchange and retrieve, XML becomes a standard in doing this way. With the adoption of using XML in both office application groups, the abilities for efficient storing historical office documents are become a growing issue. This paper introduces an efficient way to process multi-version XML documents. It is not only effective storage space need but also keeping the integral of original documents. It minimizes the change of data values or structures transmutation of historical XML documents. The purpose is to well-managed electronic documents for enterprises and all the messages were involved in should be preserved. [ABSTRACT FROM AUTHOR]

Exchanging and sharing the heterogeneous data sources is the core of the information integration in virtual product development. Using the XML-based method to achieve the product information integration in CAD environment has the merits of clear structure and good interoperability. The article, aiming at the application background of the car mould virtual product development achieves the XML based information integration in CAD environment and provides the quick and effective method of accessing the product information for the other subsystems in car mould victual product development system. [ABSTRACT FROM AUTHOR]

This paper presents an approach to simplify the creation of spoken dialogue systems for information retrieval, by separating all the task dependent information, such as vocabulary, relationships, restrictions, dialogue structure, the minimal set of elements to construct a query, and all the information required by the Dialogue Manager (DM), Automatic Speech Recognition (ASR), Natural Language Processing (NLP), Natural Language Generation (NLG) and the application. The task related information is kept in XML files, which can be read by the different modules, depending on the kind of data each one requires to function, providing task independence and making the design of spoken dialogue systems much easier. [ABSTRACT FROM AUTHOR]

Accessibility is a growing concern in computer science. Since virtual information is mostly presented visually, it may seem that access for deaf people is not an issue. However, for prelingually deaf individuals, those who were deaf since before acquiring and formally learn a language, written information is often of limited accessibility than if presented in signing. Further, for this community, signing is their language of choice, and reading text in a spoken language is akin to using a foreign language. Sign language uses gestures and facial expressions and is widely used by deaf communities. To enabling efficient production of signed content on virtual environment, it is necessary to make written records of signs. Transcription systems have been developed to describe sign languages in written form, but these systems have limitations. Since they were not originally designed with computer animation in mind, in general, the recognition and reproduction of signs in these systems is an easy task only to those who deeply know the system. The aim of this work is to develop a transcription system to provide signed content in virtual environment. To animate a virtual avatar, a transcription system requires explicit enough information, such as movement speed, signs concatenation, sequence of each hold-and-movement and facial expressions, trying to articulate close to reality. Although many important studies in sign languages have been published, the transcription problem remains a challenge. Thus, a notation to describe, store and play signed content in virtual environments offers a multidisciplinary study and research tool, which may help linguistic studies to understand the sign languages structure and grammar. [ABSTRACT FROM AUTHOR]

XPath queries are essentially composed of a succession of axes defining the navigation from a current context node. Among the XPath query axes family, child, descendant, parent can be optionally specified using the path notations {/,//,..} which have been commonly used. Axes such as following-sibling and preceding-sibling have unique functionalities which provide different required information that cannot be achieved by others. However, XPath query optimization using schema constraints does not yet consider these axes family. The performance of queries denoting the same result by means of different axes may significantly differ. The difference in performance can be affected by some axes, but this can be avoided. In this paper, we propose a semantic transformation typology and algorithms that transform XPath queries using axes, with no optional path operators, into semantic equivalent XPath queries in the presence of an XML schema. The goal of the transformation is to replace whenever possible the axes that unnecessarily impact upon performance. We show how, by using our semantic transformation, the accessing of the database using such queries can be avoided in order to boost performance. We implement the proposed algorithms and empirically evaluate their efficiency and effectiveness as semantic query optimization devices. [ABSTRACT FROM AUTHOR]

Commutative Replicated Data-Type (CRDT) is a new class of algorithms that ensures scalable consistency of replicated data. It has been successfully applied to collaborative editing of texts without complex concurrency control. In this paper, we present a CRDT to edit XML data. Compared to existing approaches for XML collaborative editing, our approach is more scalable and handles all the XML editing aspects : elements, contents, attributes and undo. Indeed, undo is recognized as an important feature for collaborative editing that allows to overcome system complexity through error recovery or collaborative conflict resolution. [ABSTRACT FROM AUTHOR]

The trustworthiness of any Public Key Infrastructure (PKI) rests upon the expectations for trust, and the degree to which those expectations are met. Policies, whether implicit as in PGP and SDSI/SPKI or explicitly required as in X.509, document expectations for trust in a PKI. The widespread use of X.509 in the context of global e-Science infrastructures, financial institutions, and the U.S. Federal government demands efficient, transparent, and reproducible policy decisions. Since current manual processes fall short of these goals, we designed, built, and tested computational tools to process the citation schemes of X.509 certificate policies defined in RFC 2527 and RFC 3647. Our PKI Policy Repository, PolicyBuilder, and PolicyReporter improve the consistency of certificate policy operations as actually practiced in compliance audits, grid accreditation, and policy mapping for bridging PKIs. Anecdotal and experimental evaluation of our tools on real-world tasks establishes their actual utility and suggests how machine-actionable policy might empower individuals to make informed trust decisions in the future. [ABSTRACT FROM AUTHOR]

The promise of SOA is being held back by a lack of rigor with XSD interchange files. Many developers focus on the design of individual services and pay little attention to how the services fit together and collectively evolve. Enterprise data modeling is the solution to this problem. A data model is essential for grasping the entirety of services and abstracting services properly. A data model also provides a guide for combining services in flexible ways. Several examples illustrate the benefits. [ABSTRACT FROM AUTHOR]

NIEM is the National Information Exchange Model strategy adopted in US government agencies to align their domain information exchanges. The aim is to provide government information exchanges that are consistent and interoperable by using the NIEM.gov approach that relies on repeatable and predictable patterns and techniques. This presents a range of challenges to implementers including mapping from domain vocabularies to NIEM and applying an appropriate rule validation framework. Also creating exchange schema structure definitions and generating testing data sample instances. How can rule engines assist in automating these processes? The methods NIEM advocates using have been criticized as being heavy-weight and cumbersome; how can rule-based techniques dramatically simplify the challenges that developers face in exploiting the NIEM-based approach? [ABSTRACT FROM AUTHOR]

Adaptivity and friendliness of user interface is currently discussed in the professional society. Users want a simple, intuitive and graphically attractive interface. On the other hand, it is necessary to change dynamically the user´s experience as they use what best viewing area of the device. The biomedical data are not all the latest knowledge in the area. Our work focuses on exploring the possibilities and the revelation of any deficiencies in the currently used procedures and technologies. The main area of interest of our Biotelemetric User Adaptive System is to provide solution which can be used in different areas of health care and which will be available through PDAs (Personal Digital Assistants), web browsers or desktop clients. In paper we deals with a problem of visualization of measured ECG signal on mobile devices in Real Time as well as with a solution how to solve a problem of unsuccessful data processing on desktop or server. The pre-processing in GSM module processor we choose as a solution of data processing problem. [ABSTRACT FROM AUTHOR]

We show a novel execution method of queries over structural data. We present the idea in detail on SBQL (a.k.a. AOQL)–a powerful language with clean semantics. SBQL stands for the Stack-Based Query Language. The stack used in its name and semantics is a heavy and centralised structure which makes parallel and stream processing unfeasible. We propose to process stack-based queries without a stack. The stack-less execution of stack-based queries is done by a network of components connected by streams. Source streams of the network are populated with necessary fragments of objects retrieved from the database. Output streams produce results of the query. This paper focuses on methods of construction, optimisation and effective execution of such a networks. Although this research was inspired by SBQL/AOQL, eventually we achieved a universal execution method for other object-oriented, object-relational and semi-structured language. Especially promising are the optimisation and parallelisation possibilities offered by the presented execution model. [ABSTRACT FROM AUTHOR]

An XML-based data model to represent moving points and moving regions is provided in this paper. The algorithms of two important types of queries are designed for the model. They are snapshot query and trajectory query. The moving object dataset stored in our XML-based model is generated, and experiments on the storage and query methods of spatio-temporal attributes are done on the basis of the dataset. The generation algorithm of moving regions is researched in details in this paper, and the shape change of regions is considered in the algorithm. Results show that using XML technology to store and query spatio-temporal data is especially efficient and flexible. [ABSTRACT FROM AUTHOR]

NC94 dataset is an agricultural dataset which consists of climate, crop, and soil data and is considered as a completely dataset available. The data is organized based on county and is treated as an object. It is adapted in interdisciplinary research and widely used in various research domains and once again has been exploited in our parametric database research. In this research work, we exploit the climate data of NC94 dataset to calculate the cumulative degree of coldness in Iowa in last 30 years. To demonstrate the degree of coldness, an xml based scheme is used considering blue as the base color with the notion that darker shade reflects higher degree of coldness. This work is a baby step towards the generation of climate atlas of North Central Region of USA in one single click. [ABSTRACT FROM AUTHOR]

Enterprise information integration (EII) requires an accurate, precise and complete understanding of the disparate data sources, the needs of the information consumers, and how these map to the business concepts of the enterprise. In practice, such integration takes place in context of any enterprise information system. In the paper we explain various approaches to EII, its architectures as well as its association to enterprise application integration. We justify why XML technology contributes to finding sufficiently powerful support for EII. We present some features of the XML technology, mainly its database part, and show how it is usable in EII. [ABSTRACT FROM AUTHOR]

Large scales of XML information comes continually from new Web applications, and SLCA (Smallest Lowest Common Ancestor)-based XML keyword search is one of the most important information retrieval approaches. Previous approaches focus on building index for XML documents. However in information dissemination scenario, it is impossible to build index in advance for continuous XML document streams. This paper addresses SLCA-based keyword search for continuous XML documents by Map-Reduce mechanism. We use parallel algorithms to process plenty of XML documents in Hadoop environment. A distributed SLCA computation method is designed, where each net node computes SLCA independently and just a little information needs be transmitted. A real Hadoop environment is built and we demonstrate the efficiency of our algorithms analytically and experimentally. [ABSTRACT FROM AUTHOR]

Beyond using XML as a message format, more and more companies are storing XML data permanently in a database. Database researchers and vendors alike have spent a lot of effort on designing, studying, and implementing XML database technology. In this paper we report our experiences from working with a broad variety of companies that have developed and deployed XML applications on top of DB2. We discuss three real-world XML database scenarios and their design considerations, and describe recurring patterns in XML applications. We highlight common concepts and observations, and document challenges that point to future work for the database community. [ABSTRACT FROM AUTHOR]

Computer-assisted interviewing systems have various benefits, as compared to paper-and-pencil surveys. The engine for processing questionnaires, however, should be reprogrammed when the questionnaire is changed since its processing logic is hard-coded in the system. As such, the engine for processing questionnaires depends on the questionnaires. This study makes the engine for processing questionnaires independent of questionnaires using an active document model. In this model, machines can process documents with rules specified in the documents. The active questionnaire, which is an active document, is composed of questions, control logic, and a knowledgebase. Among these, control logic expresses a method of processing questions in an executable XML. In this paper, we propose a framework for processing active questionnaires and describe its implementation. [ABSTRACT FROM AUTHOR]

We often use UML diagrams for our software development projects, and also for modeling XML DTDs and Schemas [1], finding that although UML diagrams can effectively be made to represent DTDs and Schemas (either using Class or Component diagrams), in real practice, complex DTDs and Schemas produce unreadable, unmanageable, complex UML diagrams. Recently we started exploring other types of diagrams and unconventional methods which can be both useful for designing and modeling semistructured data, and as teaching aids or thinking tools. This experience also served to open our minds to tools and methods other than the recognized mainstream practices. In this paper, we describe how we managed to use Mind Maps and a modified Freemind tool to successfully model, design, modify, import and export XML DTDs, XML Schemas (XSD and RNG) and also XML document instances, getting very manageable, easily comprehensible, folding diagrams. In this way, we converted a general purpose mind-mapping tool, into a very powerful tool for XML vocabulary design and simplification (and also for teaching XML markup, or for presentation purposes). [ABSTRACT FROM AUTHOR]

Keyword search is a friendly mechanism for the end user to identify interesting nodes in XML databases, and the SLCA (smallest lowest common ancestor)-based keyword search is a popular concept for locating the desirable subtrees corresponding to the given query keywords. However, it does not evaluate the importance of each node under those subtrees. Liu and Chen proposed a new concept contributor to output the relevant matches instead of all the keyword nodes. In this paper, we propose two methods, MinMap and SingleProbe, that improve the efficiency of searching the relevant matches by avoiding unnecessary index accesses. We analytically and empirically demonstrate the efficiency of our approaches. According to our experiments, both approaches work better than the existing one. Moreover, SingleProbe is generally better than MinMap if the minimum frequency and the maximum frequency of the query keywords are close. [ABSTRACT FROM AUTHOR]

This paper introduces a complementary extension to XML data binding enabling the (selective) protection of structured objects and members. By this contribution, an object can be transformed into a secured object which contains encrypted and/or signed parts according to an assigned security policy. The serialization of secured objects results in XML data which is protected by standard XML security means. Thus, this approach introduces a data-oriented security mechanism which seamlessly integrates into XML data binding and therefore enables cross-platform (de)serialization of secured objects without the need of programming against a specific XML security API. Distinct entities in a distributed processing environment then operate transparently either on plain or secured instances of a class. [ABSTRACT FROM AUTHOR]

Clustering of XML documents is an important data mining method, the aim of which is the grouping of similar XML documents. The issue of clustering XML documents by structure is being considered in this paper. Two different and independent methods of clustering XML documents by structure are being proposed. The first method represents a set of XML documents as a set of labels. The second method introduces a new representation of a set of XML documents, which is called the SuperTree. In this paper, it is suggested that the proposed methods may improve the accuracy of XML clustering by structure. Such thesis is based on the tests, the aim of which is to assess advantages of the proposals, as conducted respectively on the heterogeneous and homogenous sets of data. [ABSTRACT FROM AUTHOR]

E-learning content delivery through the Internet is nowadays a very active topic in academy, industry and research. Common tools used in presential learning are not adequate in the new context then new tools are required in order to produce, manage and deliver learning content in a way as much independent and flexible as possible. We present a set of tools that allows independent e-learning production and one-source-several-format delivery using vendor independent XML languages, particularly Docbook and SMIL. [ABSTRACT FROM AUTHOR]

Most type systems of statically typed XML processing languages are implemented based on regular expression types, where subtyping reduces to checking inclusion between tree automata, which is not efficient enough. The paper proposes the regular tree grammars with disjoint production rules and presents a subtyping method which is based on checking inclusion between regular expressions. The commonly used XML schema languages such as DTDs and XML Schemas can be described by the restricted grammars. The method works in a bottom-up way on the structures of type expressions. According to the regular expressions used in XML schema languages, different inclusion algorithms can be applied to this method. Experiments show the effectiveness of our method. [ABSTRACT FROM AUTHOR]

This paper describes the approach taken to the clustering task at INEX 2009 by a group at the Queensland University of Technology. The Random Indexing (RI) K-tree has been used with a representation that is based on the semantic markup available in the INEX 2009 Wikipedia collection. The RI K-tree is a scalable approach to clustering large document collections. This approach has produced quality clustering when evaluated using two different methodologies. [ABSTRACT FROM AUTHOR]

In this paper, we first employ the well known Cover-Coefficient Based Clustering Methodology (C3M) for clustering XML documents. Next, we apply index pruning techniques from the literature to reduce the size of the document vectors. Our experiments show that for certain cases, it is possible to prune up to 70% of the collection (or, more specifically, underlying document vectors) and still generate a clustering structure that yields the same quality with that of the original collection, in terms of a set of evaluation metrics. [ABSTRACT FROM AUTHOR]

XML Keyword Search is a user-friendly information discovery technique, which is well-suited to schema-free XML documents. We propose a novel scheme for XML keyword search called XKLUSTER, in which a novel semantic-distance model is proposed to specify the set of nodes contained in a result. Based on this model, we use clustering approaches to generate all meaningful results in XML keyword search. A ranking mechanism is also presented to sort the results. [ABSTRACT FROM AUTHOR]

In this paper, we develop tool for collecting spatial data based on Google Maps API. The tool is implemented using AJAX and XML technology. It helps marking the maps in various forms. Then, after the users define the regions in the maps, the associated data can be described and stored in the database. The data can be further analyzed and displayed in the GIS. The tool supports the KML and NMA files where the user specification can be export and the offline data in such a form can be imported to the system as well. We demonstrate a case of using the tool to collect the spatial data in agriculture area. [ABSTRACT FROM AUTHOR]

Competition in the today΄s global economy is intensifying the use of the new paradigm of mass customization. Such a paradigm is characterized by the need to deal with a very large variety of products determined by a substantial increase in customer specific product requirements. Implementing this paradigm requires agility and effectiveness in the customer-producer interaction and also in the order-production-delivery cycle. Web-based product configurators can provide an opportunity for improved interaction between producer and customer, and for a more formal, agile and effective process of both product and customer orders specification. In this paper, we propose architecture and describe the functionalities of a web based system for interactive product and customer order configuration. The proposed system can be also of value for supporting product data management and the production and delivery functions. [ABSTRACT FROM AUTHOR]

Effective processing of location axes is essential for fast XPath implementation. Direct approach can be quite inefficient and the performance of the whole XPath processor may suffer, since location axes are present in every location step of every location path. We propose axes optimizations, indices and algorithms that should improve performance in many situations. These algorithms are designed to accomodate features of nowadays processors and they can be implemented in parallel fashion without extensive modifications. [ABSTRACT FROM AUTHOR]

Interlocking tables are the functional specification defining the routes, on which the passage of the train is allowed. Associated with the route, the states and actions of all related signalling equipment are also specified. This paper formally models the interlocking tables using Coloured Petri Nets (CPN). The CPN model comprises two parts: Signaling Layout and Interlocking Control. The Signaling Layout part is used to simulate the passage of the train. It stores geographic information of the signalling layout in tokens. The Interlocking Control part models actions of the controller according to the functions specified in the interlocking tables. The arc inscriptions in the model represent the content of the interlocking tables. Following our modelling approach we can reuse the same CPN net structure to model any new or modified interlocking system regardless of its size. Experimental results are presented to provide increased confidence in the model correctness. [ABSTRACT FROM AUTHOR]

Publish-subscribe systems present the state of the art in information dissemination to multiple users. Such systems have evolved from simple topic-based to the current XML-enabled systems. Here, users pose complex queries (expressed in XPath) on the structure and content of the streaming documents. The parts of the documents that match the user queries are then returned to the users. This paper proposes a novel hardware architecture that would exploit the parallelism found in XPath filtering systems. Using an incoming XML stream, parsing and matching with thousands of user profiles are performed simultaneously on a single FPGA, thus yielding up to three orders of magnitude higher throughput when compared to conventional approaches bound by the sequential aspect of software computing. By converting XPath expressions into custom stacks, our architecture is the first providing full support for all structural XPath constructs, including parent-child and ancestor descendant relations, whilst allowing wildcarding and recursion. [ABSTRACT FROM AUTHOR]

According as XML data have been prevailing in many areas such as internet and public documentation, we need to research data mining algorithm to XML data. And many kinds of techniques have been researched to speed up the query performance about XML data. In this paper, therefore, as the method for speeding up the query performance we analyze the XML query pattern and propose Weighted- FP-growth algorithm extracting the similar XML query pattern fast. The proposed method is applied to XML query subtrees. And we experimented our method compared with the existing algorithm. And we showed the proposed method outperform the other methods and give the fast query result to the repeatedly occurring queries. [ABSTRACT FROM AUTHOR]

The design of Flash File system YAFFS aims at dealing with problems at start time, memory consumption and wear balance etc. It cannot manage great amount of complex, structural and semi-structural data. The key reason for these points exists in the fact that YAFFS file system treats data as bit stream without semantics. And YAFFS file system uses special applications to operate the inner structures and contents of files, which finally put the control of file to a bad grain level. We propose a structure-based XML storage method in YAFFS file system. The experiment on embedded Linux proved that, with our method, the XML structure-based information can be stored and managed effectively. [ABSTRACT FROM AUTHOR]

The ScotlandsPlaces project is an official, permanent website found at www.scotlandsplaces.gov.uk. It exhibits a very novel and exciting way of searching across cultural heritage information. It uses geography to discover relevant records and lets the public sift through the results using geographic-based technologies. The ScotlandsPlaces website has seen the development of innovative technologies including the redevelopment of open-source geo-middleware, the ScotlandsPlaces XML schema for data transfer and the use of dynamic map interfaces for user querying. Although these technologies that sit behind the site are innovative and cutting edge, the website itself has a simple design and is easy to use. System developments such as the digital volumes management system allow different partner organisations to include resources in a standard format, efficiently disseminating information to the public. [ABSTRACT FROM AUTHOR]

Current e-learning websites are built with different programming languages, data storage formats and system architectures, making it hard for data to be interoperable. Therefore, e-learning systems must have a standardized platform to allow teaching resources and system functions to be shared and reused. This issue can be effectively resolved using SOA (service-oriented architecture) concept and web service technology that has open standards and XML (extensible markup language), which allow e-learning systems developed using different programming languages to share resources, and significantly reduces the cost system developers need to spend in constructing and maintaining the system. This study uses web service components developed with Microsoft .NET and XML to construct a teaching platform with standard specifications under SOA, allowing system developers to rapidly construct an e-learning system based on web services. [ABSTRACT FROM AUTHOR]

Keyword search for XML documents has attracted much attention recently. Existing approaches mainly retrieve search results through identifying the Lowest Common Ancestor (LCA) of keyword match nodes. There are also techniques for removing redundant and irrelevant search results. However, the problem of whether a LCA fragment contains complete information has not been adequately investigated. To address this challenge, we first introduce the notion of Information Unit (IU). Its structural property ensures that it can provide complete information on topic to user. We then reason whether a search result is valid by analyzing the context of keyword match nodes. We propose that a meaningful returned result should be a Valid Lowest Information unit (VLIU), which is the lowest IU that contains all the keywords and is semantically valid. Finally, we conduct extensive experiments to demonstrate the effectiveness and efficiency of our approach. [ABSTRACT FROM AUTHOR]

XPath is a language to retrieve information in the XML documents, which is used to traverse their elements and attributes. At the present time there are a large number of optimization techniques on XML applications at home and abroad, including axis join queries, query rewriting, the semantic cache using in the client, redundancy elimination based on marked suffix tree (MST) and so on. However, these techniques are lack of research to eliminate redundancy in the network environments. In this paper, we reduce communication costs and computing costs over networks by rewriting the queries submitted by the client. Given a set of queries, we compute a minimal XML view that can answer all the original queries and eliminate possible redundancy. [ABSTRACT FROM AUTHOR]

XML is an important data form. The size of query results on XML data is very large in some applications and in the distributed XML data management system, the transmission of query results become the bottleneck. For the efficiency of XML management system, the compression method for XML query results is studied in this paper. By exploiting the properties of query results on XML data, two compression methods are proposed. One is a G-bitmap algorithm as a variant of bitmap index. The other is based on tree structure. The experiments on real and manual data demonstrate the effectiveness and efficiency of our compression methods. [ABSTRACT FROM AUTHOR]