XML Mapping Research Articles

Fairness and efficiency in pedestrian emergency evacuation: Modeling and simulation

The goal of this paper is to study different algorithms for planning a large scale pedestrian evacuation process. A pedestrian (walking) mode of evacuation is an efficient mode of transportation that is often overlooked in the literature. Fairness in the evacuation process is another aspect that is rarely studied. In this paper, we study efficiency and fairness of pedestrian mode of emergency evacuation. We model the evacuation problem as a dynamic network flow problem, which captures the time-dependency of the network attributes such as edge and vertex capacities and edge travel times. To evaluate the efficiency of the algorithms, we consider the clearance time of the network. To investigate fairness, we consider the Gini coefficient and Lorenz curve that are popular indexes in economy to measure wealth distribution in a society. We compute the Gini coefficient and Lorenz curve to measure the fairness in travel time distribution of the evacuees in the emergency evacuation process. We develop a new algorithm called PEPA (Pedestrian Evacuation Planning Algorithm) to find the minimum clearance time of the network. PEPA is compared to two commonly studied graph algorithms in the literature, shortest path and maximum flow algorithms. We compared the algorithms in terms of computation time of the algorithm, clearance time of the network and Gini coefficient. Our results show that PEPA beats both shortest path and maximum flow in terms of efficiency and fairness, although it is slightly slower in terms of computation time. To implement PEPA, shortest path and maximum flow algorithms, we develop a new software named PEMSS (Pedestrian Evacuation Modeler, Solver, and Simulator). PEMSS is written in the Java programming language and is capable of reading and showing maps in open street map XML format.

Implementation of Pedestrian Path Navigation Algorithm Based on "We-Map" Platform

Abstract. In order to adapt to the information needs of the we media era, Haowen Yan and other scholars proposed a "grassroots" map for the civilian population – "We-Map". The mathematical foundations such as accuracy are not high, and the producers do not need to undergo strict professional training. Map users can participate in map production at any time, and can easily and quickly communicate and apply on personal electronic devices (such as computers and mobile phones). In the We-Map platform, it uses the Google Map SDK and XML technologies to implement the basic functions of the mobile platform-based We-Map application, including map editing (copy, rotate, zoom, pan, line drawing, coloring, etc.), path navigation, Real-time location, information query and We- Map storage, transmission and distribution. In this paper, we study and implement a landmark-based pedestrian path navigation algorithm, which is added to the We-Map platform for auxiliary navigation of pedestrian paths.

Sistem Informasi Geografis Pemetaan Kantor Polisi Wilayah Kota Pekanbaru Provinsi Riau

Abstract T his research discusses about the Geographical Information System (GIS) mapping of Police Station in the city of Pekanbaru in Riau province. The absence of information about the existence of digital spread Police Station in the city of Pekanbaru that makes people want to take care of these needs when police agencies Pekanbaru be hampered because it takes a long time to find the police station .. It is underlying this research. SIG provides information to the public regarding the location and type Police Station in the city of Pekanbaru, so as the public will more easily find the Police Station to take care of the police office purposes. Besides GIS also helps the police Pekanbaru in determining the crime- prone locations occur so police can take preventive measures or planning to build a new police station. The information systems using programming language HTML, CSS, JQuery, PHP, XML, and Google Maps, and then MySQL as a database. To design the system using System Flowchart, Data Flow Diagram, and Entity Relation Diagram. Keywords : Mapping of Police station, Geographical Information System,

A Formal Approach of Construction Fuzzy XML Data Model Based on OWL 2 Ontologies

With the rapid development of the Web, a large number of electronic resources have been generated. Currently, XML has been an important tool for data representation and exchange over the Web. The incompleteness of information in the real-world is inherent. To deal with imprecise and uncertain data, fuzzy XML and fuzzy ontology modeling recently receive more attention. In order to represent the fuzzy information, we concentrate on fuzzy information modeling in a fuzzy XML model and fuzzy OWL 2 ontology in this paper. Furthermore, we propose an approach of transforming fuzzy OWL 2 ontologies (including structures and instances) into fuzzy XML models. Then we prove that the sementics of this transformation approach are preserved and propose a transforming example to explain the transforming process. This paper provides a new approach for the fuzzy XML modeling and fuzzy XML mapping based on the fuzzy OWL 2 ontologies.

Quadratic Processing of Web Service Data

Web service based information integration scenario can achieve the functional integration of heterogeneous platforms. However, the information sharing also requires the integration of Web services data. Based on the analysis of the characteristics of XML, this paper studies the web service data quadratic processing of heterogeneous platform. It realizes the data integration based on the functional integration of heterogeneous platforms. All the data of web services are defined and described by XML Schema. So this study uses XML data binding technology to achieve the conversion of XML Schema data to relational database content objects. Then XML mapping technology is adapted to achieve the mapping of the database content object on the local specific database table. Local system can achieve the quadratic web service data processing based on the database table’s normal operation. Some applications are described to validate.

XAncestor: An efficient mapping approach for storing and querying XML documents in relational database using path-based technique

XML has become a common language for data exchange on the Web, so it needs to be managed effectively. There are four central problems in XML data management: capture, storage, retrieval, and exchange. Even though numerous database systems are available, the relational database (RDB) is often used to store and query the content of XML documents. Therefore the processes of mapping from XML to RDB and vice versa occur frequently. Numerous researchers have proposed approaches to map hierarchically structured XML documents into the tabular format of a RDB. However, the previously developed approaches have faced problems in terms of storage and query response time. If the design of a RDB is inefficient, the number of join operations between tables increases when a query is executed, which affects the query response time. To overcome this limitation, this paper proposes a new mapping approach, known as XAncestor, which consists of two algorithms: an XML mapping algorithm (XtoDB) and a query mapping algorithm (XtoSQL). XtoDB maps XML documents to a fixed RDB with less storage space. XtoSQL translates XPath queries into corresponding SQL queries based on the constructed RDB in order to reduce the query response time i.e., the time taken to execute the translated SQL query. XAncestor is then developed as a prototype in order to test its effectiveness. The results of XAncestor are compared with those produced by five similar approaches. The comparison proves that XAncestor performs better than the previously developed approaches in terms of effectiveness and scalability. The correctness of XAncestor is also verified. The paper concludes with some recommendations for further work.

Advantages of complex SQL types in storing XML documents

This contribution looks at and evaluates new ways to map XML documents to relational database systems preserving their hierarchical structure. In particular we take advantage of the advanced features available following the SQL:2003 standard, which defines complex structure and collection types. Starting out with a survey of existing methods, basic questions concerning appropriate and efficient forms of mapping XML documents to SQL-compliant data types are addressed. This leads to a reversible conversion method, which is subsequently implemented in a prototype application. The design of the mapping is geared towards existing, mature relational database management systems (DBMS). It turns out that among the products considered, IBM Informix seems to offer the best support for complex structure and collection types in the context of our application. To better assess the performance of the mapping process, the observed running time and the required in-memory and database storage of the implementation are measured and evaluated.

비정형 대용량 데이터 입력 및 출력 시스템 설계 및 구현

In recent years, the spread of computers is increasing, and efficient processing effort for unstructured Big Data is required. In this paper, we are proposed a system to extract the data typed in a word processor quickly by user creating and XML mapping file after converting XML data that has been entered in the office file(HWP, MS-office). In addition, we proposed a system is able to lookup the necessary data from a database by entered form in advance and convert word processor document to office files by the application program. The unstructured big data will be available to be used.

Research on XML-Based Exchanging System between Databases

In homogeneous or heterogeneous databases, the main direction of research on XML-based information interaction between databases is taking XML as middleware to realize the information exchange between data in the environment of small and medium-sized databases. Considering the insufficiency of the traditional text file-based information interaction method, the paper puts forward an XML-based method of information exchanging between databases, and the corresponding database exchanging system is developed. The utmost feature and advantage of the system is taking hibernate XML mapping table file for converting middleware to realize information interaction between databases. The experiment result shows that the system provides a certain reference value for data mining and data warehouse.

ScotlandsPlaces XML: bespoke XML or XML mapping?

PurposeThe purpose of this paper is to investigate web services (in the form of parameterised URLs), specifically in the context of the ScotlandsPlaces project. This involves cross‐domain querying, data retrieval and display via the development of a bespoke XML standard rather than existing XML formats and mapping between them.Design/methodology/approachIn looking at the different heritage domain datasets as well as the metadata formats used for storage and data exchange, the ScotlandsPlaces XML format is revealed as the most appropriate for this type of project. The nature of the project itself and the need for dynamic web services are in turn explored.FindingsIt was found that, due to the nature of the project, the combination of a bespoke ScotlandsPlaces XML format and a set of matching web services was the best choice in terms of the retrieval of different domain datasets, as well as the desired extensible nature of the project.Research limitations/implicationsIt may have proven useful to investigate the datasets of more ScotlandsPlaces partners, but as yet only a limited number of first phase partners' datasets could be studied, as the second phase of the project has yet to begin.Originality/valueRather than an information portal, the ScotlandsPlaces web site aggregates disparate types of record, whether site records, archival or otherwise, into a single web site and makes these records discoverable via geographical searching. Aggregated data are accessed through web service queries (using a bespoke XML format developed specifically for the project for data return) and allow partner organisations to add their datasets regardless of the organisational domain. The service also allows spatially referenced records to be plotted on to a geo‐browser via a KML file, which in turn lets users evaluate the results based on geographical location.

XML for SAS®programmers

Abstract XML (the eXtensible Markup Language) is an open standard for the definition, transmission, validation and interpretation of data. The standard was developed by the Worldwide Web Consortium (W3C) in order to provide a simple and efficient way to manage self-documenting data files. SAS® software includes a number of useful tools for creating and parsing XML data. These include: (1) the XML libname engine, used to import and export documents in XML format into or from a SAS dataset, optionally using an XMLMap. The new XML92 engine now supports XML Maps on output as well as input; (2) the XML Mapper application is a graphical interface to analyse the structure of an XML document or an XML schema and generate XML syntax for the XMLMap; (3) the ODS MARKUP output destination is used to create XML from SAS output; ODS MARKUP creates but does not read XML documents. This paper will introduce these concepts and present some brief examples of each, including some of the new features available in SAS 9.2.

XML Data Binding for C++ Using Metadata

Mapping XML document schemas and Web Service interfaces to programming languages has an important role in effective creation of quality Web Service implementations. The authors present a novel way to map XML data to the C++ programming language. The proposed solution offers more flexibility and more compact code that makes it ideal for embedded environments. The article describes the concept and the architecture of the solution and compares it with existing solutions. This article is an extended version of the paper from ICWS 2006. The authors include a broader comparison with existing tools on Symbian and Linux platforms and evaluate the code size and performance.

XML mapping technology: Making connections in an XML-centric world

Extensible Markup Language (XML) has grown rapidly over the last decade to become the de facto standard for heterogeneous data exchange. Its popularity is due in large part to the ease with which diverse kinds of information can be represented as a result of the self-describing nature and extensibility of XML itself. The ease and speed with which information can be represented does not extend, however, to exchanging such information between autonomous sources. In the absence of controlling standards, such sources will typically choose differing XML representations for the same concept, and the actual exchange of information between them requires that the representation produced by one source be transformed into a representation understood by the other. Creating this information exchange “glue” is a tedious and error-prone process, whether expressed as Extensible Stylesheet Language Transformation (XSLT), XQuery, Java™, Structured Query Language (SQL), or some other format. In this paper, we present an extensible XML mapping architecture that elevates XML mapping technology to a fundamental integration component that promotes code generation, mapping reuse, and mapping as metadata.

AMaχoS—Abstract Machine for Xcerpt

Web query languages promise convenient and efficient access to Web data such as XML, RDF, or Topic Maps. Xcerpt is one such Web query language with strong emphasis on novel high-level constructs for effective and convenient query authoring, particularly tailored to versatile access to data in different Web formats such as XML or RDF. However, so far it lacks an efficient implementation to supplement the convenient language features. AMaχoS is an abstract machine implementation for Xcerpt that aims at efficiency and ease of deployment. It strictly separates compilation and execution of queries: Queries are compiled once to abstract machine code that consists in (1) a code segment with instructions for evaluating each rule and (2) a hint segment that provides the abstract machine with optimization hints derived by the query compilation. This article summarizes the motivation and principles behind AMaχoS and discusses how its current architecture realizes these principles.

Mapping DTDs to relational schemas with semantic constraints

XML is becoming a prevalent format and standard for data exchange in many applications. With the increase of XML data, there is an urgent need to research some efficient methods to store and manage XML data. As relational databases are the primary choices for this purpose considering their data management power, it is necessary to research the problem of mapping XML schemas to relational schemas. The semantics of XML schemas are crucial to design, query, and store XML documents and functional dependencies are very important representations of semantic information of XML schemas. As DTDs are one of the most frequently used schemas for XML documents in these days, we will use DTDs as schemas of XML documents here. This paper proposes the concept and the formal definition of XML functional dependencies over DTDs. A method to map XML DTDs to relational schemas with constraints such as functional dependencies, domain constraints, choice constraints, reference constraints, and cardinality constraints over DTDs is given, which can preserve the structures of DTDs as well as the semantics implied by the above constraints over DTDs. The concepts and method of mapping DTDs to relational schemas presented in the paper can be extended to the field of XML Schema just with some modifications in related formal definitions.