Página 15 dos resultados de 2156 itens digitais encontrados em 0.006 segundos

XML Fuzzy Ranking

KOTSAKIS EVANGELOS
Fonte: SPRINGER-VERLAG BERLIN Publicador: SPRINGER-VERLAG BERLIN
Tipo: Contributions to Conferences Formato: Printed
ENG
Relevância na Pesquisa
27.08%
This paper proposes a method of ranking XML documents with respect to an Information Retrieval query by means of fuzzy logic. The proposed method allows imprecise queries to be evaluated against an XML document collection and it provides a model of ranking XML documents. In addition the proposed method enables sophisticated ranking of documents by employing proximity measures and the concept of editing (Levenshtein) distance between terms or XML paths.; JRC.G.2-Support to external security

Extending an XML environment definition language for spoken dialogue and web-based interfaces

Haya, Pablo A.; Montoro, Germán; Alamán, Xavier; Cabello, Rubén; Martínez Rodríguez, Javier
Fonte: Universidade Autônoma de Madrid Publicador: Universidade Autônoma de Madrid
Tipo: Conferência ou Objeto de Conferência
ENG
Relevância na Pesquisa
27.08%
This is an electronic version of the paper presented at the Workshop "Developing User Interfaces with XML: Advances on User Interface Description Languages", during the International Working Conference on Advanced Visual Interfaces (AVI), held in Gallipoli (Italy) on 2004; In this work we describe how we employ XML-compliant languages to define an intelligent environment. This language represents the environment, its entities and their relationships. The XML environment definition is transformed in a middleware layer that provides interaction with the environment. Additionally, this XML definition language has been extended to support two different user interfaces. A spoken dialogue interface is created by means of specific linguistic information. GUI interaction information is converted in a web-based interface.

Embedded XML DOM parser: an approach for XML data processing on networked embedded systems with real-time requirements

Mínguez Collado, Esther; Cavia Soto, María de los Ángeles; Pérez García, José A.; Delamer, Iván M.; Martínez Lastra, José Luis
Fonte: Hindawi Publishing Corporation-; SpringerOpen Publicador: Hindawi Publishing Corporation-; SpringerOpen
Tipo: info:eu-repo/semantics/article; publishedVersion
ENG
Relevância na Pesquisa
27.08%
Trends in control and automation show an increase in data processing and communication in embedded automation controllers. The eXtensible Markup Language (XML) is emerging as a dominant data syntax, fostering interoperability, yet little is still known about how to provide predictable real-time performance in XML processing, as required in the domain of industrial automation. This paper presents an XML processor that is designed with such real-time performance in mind. The publication attempts to disclose insight gained in applying techniques such as object pooling and reuse, and other methods targeted at avoiding dynamic memory allocation and its consequent memory fragmentation. Benchmarking tests are reported in order to illustrate the benefits of the approach.

XML Related Data Exchange from the Test Machine to a Web-Enabled MAT-DB

OVER HANS; NAGY Miklos; WOLFART ERIK
Fonte: Committee on Data for Science and Technology (CODATA) Publicador: Committee on Data for Science and Technology (CODATA)
Tipo: Articles in Journals Formato: Online
ENG
Relevância na Pesquisa
27.08%
One of the JRC Petten tasks is to support European Research and Development (R&D) projects in the material and energy related areas with the management and dissemination of research results. By using XML technology test data can be entered directly from the test machines into the Web-enabled 'Materials Database' (Mat-DB), which is an integral part of the On-line Data Information Network (ODIN On-line Data Information Network, 2004) that has been developed at JRC Petten. Test data, which are kept in XML format and sent by R&D project partners via the World Wide Web to the Petten Server are stored within the Mat-DB XML module. There they can be checked and updated on-line before they are uploaded into the database. After validation by the source administrator they can immediately be retrieved and evaluated by all project partners. A pilot test with the new XML related data exchange module from test machine into Mat-DB has currently been started within the European 'TMF Standard' R&D project.; JRC.F.4-Nuclear design safety

The busy coder's guide to Android development

Murphy, Mark L.
Fonte: United States : CommonsWare, 2008. Publicador: United States : CommonsWare, 2008.
Tipo: Livro Formato: application/pdf
ENG
Relevância na Pesquisa
27.08%
380 p. ; il. , Indice.; Libro Electrónico; If you are interested in programming for Android, you will need at least basic understanding of how to program in Java. Android programming is done using Java syntax, plus a class library that resembles a subset of the Java SE library (plus Android-specific extensions). If you have not programmed in Java before, you probably should quick learn how that works before attempting to dive into programming for Android. The book does not cover in any detail how to download or install the Android development tools, either the Eclipse IDE flavor or the standalone flavor. The Android Web site covers this quite nicely. The material in the book should be relevant whether you use the IDE or not. You should download, install, and test out the Android development tools from the Android Web site before trying any of the examples listed in this book.; Welcome to the Warescription!xiii Prefacexv Welcome to the Book!xv Prerequisitesxv Warescriptionxvi Book Bug Bountyxvii Source Code Licensexviii Creative Commons and the Four-to-Free (42F) Guaranteexviii The Big Picture1 What Androids Are Made Of3 Activities3 Content Providers4 Intents4 Services4 Stuff At Your Disposal5 Storage5 Network5 Multimedia5 GPS5 Phone Services6 Project Structure7 Root Contents7 The Sweat Off Your Brow8 iii Subscribe to updates at http://commonswarecom Special Creative Commons BY-NC-SA 30 License Edition And Now...

Countering Wrapping Attack on XML Signature in SOAP Message for Cloud Computing

Kouchaksaraei, Hadi Razzaghi; Chefranov, Alexander G.
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 01/10/2013
Relevância na Pesquisa
27.08%
It is known that the exchange of information between web applications is done by means of the SOAP protocol. Securing this protocol is obviously a vital issue for any computer network. However, when it comes to cloud computing systems, the sensitivity of this issue rises, as the clients of system, release their data to the cloud. XML signature is employed to secure SOAP messages. However, there are also some weak points that have been identified, named as XML signature wrapping attacks, which have been categorized into four major groups; Simple Ancestry Context Attack, Optional element context attacks, Sibling Value Context Attack, Sibling Order Context. In this paper, two existing methods, for referencing the signed part of SOAP Message, named as ID referencing and XPath method, are analyzed and examined. In addition, a new method is proposed and tested, to secure the SOAP message. In the new method, the XML any signature wrapping attack is prevented by employing the concept of XML digital signature on the SOAP message. The results of conducted experiments show that the proposed method is approximately three times faster than the XPath method and even a little faster than ID.; Comment: 6 pages, 10 figures

Materialized View Selection by Query Clustering in XML Data Warehouses

Mahboubi, Hadj; Aouiche, Kamel; Darmont, Jérôme
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 11/09/2008
Relevância na Pesquisa
27.08%
XML data warehouses form an interesting basis for decision-support applications that exploit complex data. However, native XML database management systems currently bear limited performances and it is necessary to design strategies to optimize them. In this paper, we propose an automatic strategy for the selection of XML materialized views that exploits a data mining technique, more precisely the clustering of the query workload. To validate our strategy, we implemented an XML warehouse modeled along the XCube specifications. We executed a workload of XQuery decision-support queries on this warehouse, with and without using our strategy. Our experimental results demonstrate its efficiency, even when queries are complex.

DescribeX: A Framework for Exploring and Querying XML Web Collections

Rizzolo, Flavio
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 18/07/2008
Relevância na Pesquisa
27.08%
This thesis introduces DescribeX, a powerful framework that is capable of describing arbitrarily complex XML summaries of web collections, providing support for more efficient evaluation of XPath workloads. DescribeX permits the declarative description of document structure using all axes and language constructs in XPath, and generalizes many of the XML indexing and summarization approaches in the literature. DescribeX supports the construction of heterogeneous summaries where different document elements sharing a common structure can be declaratively defined and refined by means of path regular expressions on axes, or axis path regular expression (AxPREs). DescribeX can significantly help in the understanding of both the structure of complex, heterogeneous XML collections and the behaviour of XPath queries evaluated on them. Experimental results demonstrate the scalability of DescribeX summary refinements and stabilizations (the key enablers for tailoring summaries) with multi-gigabyte web collections. A comparative study suggests that using a DescribeX summary created from a given workload can produce query evaluation times orders of magnitude better than using existing summaries. DescribeX's light-weight approach of combining summaries with a file-at-a-time XPath processor can be a very competitive alternative...

XRecursive: An Efficient Method to Store and Query XML Documents

Fakharaldien, Mohammed Adam Ibrahim; Zain, Jasni Mohamed; Sulaiman, Norrozila
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 29/03/2012
Relevância na Pesquisa
27.08%
Storing XML documents in a relational database is a promising solution because relational databases are mature and scale very well and they have the advantages that in a relational database XML data and structured data can coexist making it possible to build application that involve both kinds of data with little extra effort . In this paper, we propose an algorithm schema named XRecursive that translates XML documents to relational database according to the proposed storing structure. The steps and algorithm are given in details to describe how to use the storing structure to storage and query XML documents in relational database. Then we report our experimental results on a real database to show the performance of our method in some features.

Enhanced XML Validation using SRML

Kalman, Miklos; Havasi, Ferenc
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 16/11/2013
Relevância na Pesquisa
27.08%
Data validation is becoming more and more important with the ever-growing amount of data being consumed and transmitted by systems over the Internet. It is important to ensure that the data being sent is valid as it may contain entry errors, which may be consumed by different systems causing further errors. XML has become the defacto standard for data transfer. The XML Schema Definition language (XSD) was created to help XML structural validation and provide a schema for data type restrictions, however it does not allow for more complex situations. In this article we introduce a way to provide rule based XML validation and correction through the extension and improvement of our SRML metalanguage. We also explore the option of applying it in a database as a trigger for CRUD operations allowing more granular dataset validation on an atomic level allowing for more complex dataset record validation rules.; Comment: 18 pages

Proposed Specification of a Distributed XML-Query Network

Thiemann, Christian; Schlenker, Michael; Severiens, Thomas
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
27.08%
W3C's XML-Query language offers a powerful instrument for information retrieval on XML repositories. This article describes an implementation of this retrieval in a real world's scenario. Distributed XML-Query processing reduces load on every single attending node to an acceptable level. The network allows every participant to control their computing load themselves. Furthermore XML-repositories may stay at the rights holder, so every Data-Provider can decide, whether to process critical queries or not. If Data-Providers keep redundant information, this distributed network improves reliability of information with duplicates removed.

From XML Schema to JSON Schema: Translation with CHR

Nogatz, Falco; Frühwirth, Thom
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 09/06/2014
Relevância na Pesquisa
27.08%
Despite its rising popularity as data format especially for web services, the software ecosystem around the JavaScript Object Notation (JSON) is not as widely distributed as that of XML. For both data formats there exist schema languages to specify the structure of instance documents, but there is currently no opportunity to translate already existing XML Schema documents into equivalent JSON Schemas. In this paper we introduce an implementation of a language translator. It takes an XML Schema and creates its equivalent JSON Schema document. Our approach is based on Prolog and CHR. By unfolding the XML Schema document into CHR constraints, it is possible to specify the concrete translation rules in a declarative way.; Comment: Part of CHR 2014 proceedings (arXiv:1406.1510)

XTQ: A Declarative Functional XML Query Language

Li, Xuhui; Liu, Mengchi; Zhu, Shanfeng; Ghafoor, Arif
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 04/06/2014
Relevância na Pesquisa
27.08%
Various query languages have been proposed to extract and restructure information in XML documents. These languages, usually claiming to be declarative, mainly consider the conjunctive relationships among data elements. In order to present the operations where the hierarchical and the disjunctive relationships need to be considered, such as restructuring hierarchy and handling heterogeneity, the programs in these languages often exhibit a procedural style and thus the declarativeness in them is not so prominent as in conventional query languages like SQL. In this paper, we propose a declarative pattern-based functional XML query language named XML Tree Query (XTQ). XTQ adopts expressive composite patterns to present data extraction, meanwhile establishing the conjunctive, the disjunctive and the hierarchical relationships among data elements. It uses the matching terms, a composite structure of the variables bound to the matched data elements, to present a global sketch of the extracted data, and develops a deductive restructuring mechanism of matching terms to indicate data transformation, especially for restructuring hierarchy and handling heterogeneity. Based on matching terms, XTQ employs a coherent approach to function declaration and invocation to consistently extract and construct composite data structure...

The WebContent XML Store

Nguyen, Benjamin; Zoupanos, Spyros
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 27/01/2010
Relevância na Pesquisa
27.08%
In this article, we describe the XML storage system used in the WebContent project. We begin by advocating the use of an XML database in order to store WebContent documents, and we present two different ways of storing and querying these documents : the use of a centralized XML database and the use of a P2P XML database.; Comment: Must be compiled with pdflatex

Boosting XML Filtering with a Scalable FPGA-based Architecture

Mitra, Abhishek; Vieira, Marcos; Bakalov, Petko; Najjar, Walid; Tsotras, Vassilis
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 09/09/2009
Relevância na Pesquisa
27.08%
The growing amount of XML encoded data exchanged over the Internet increases the importance of XML based publish-subscribe (pub-sub) and content based routing systems. The input in such systems typically consists of a stream of XML documents and a set of user subscriptions expressed as XML queries. The pub-sub system then filters the published documents and passes them to the subscribers. Pub-sub systems are characterized by very high input ratios, therefore the processing time is critical. In this paper we propose a "pure hardware" based solution, which utilizes XPath query blocks on FPGA to solve the filtering problem. By utilizing the high throughput that an FPGA provides for parallel processing, our approach achieves drastically better throughput than the existing software or mixed (hardware/software) architectures. The XPath queries (subscriptions) are translated to regular expressions which are then mapped to FPGA devices. By introducing stacks within the FPGA we are able to express and process a wide range of path queries very efficiently, on a scalable environment. Moreover, the fact that the parser and the filter processing are performed on the same FPGA chip, eliminates expensive communication costs (that a multi-core system would need) thus enabling very fast and efficient pipelining. Our experimental evaluation reveals more than one order of magnitude improvement compared to traditional pub/sub systems.; Comment: CIDR 2009

Processing XML for Domain Specific Languages

Clark, Tony
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 10/06/2015
Relevância na Pesquisa
27.08%
XML is a standard and universal language for representing information. XML processing is supported by two key frameworks: DOM and SAX. SAX is efficient, but leaves the developer to encode much of the processing. This paper introduces a language for expressing XML-based languages via grammars that can be used to process XML documents and synthesize arbitrary values. The language is declarative and shields the developer from SAX implementation details. The language is specified and an efficient implementation is defined as an abstract machine.

A Flexible Structured-based Representation for XML Document Mining

Vercoustre, Anne-Marie; Fegas, Mounir; Gul, Saba; Lechevallier, Yves
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 05/07/2006
Relevância na Pesquisa
27.08%
This paper reports on the INRIA group's approach to XML mining while participating in the INEX XML Mining track 2005. We use a flexible representation of XML documents that allows taking into account the structure only or both the structure and content. Our approach consists of representing XML documents by a set of their sub-paths, defined according to some criteria (length, root beginning, leaf ending). By considering those sub-paths as words, we can use standard methods for vocabulary reduction, and simple clustering methods such as K-means that scale well. We actually use an implementation of the clustering algorithm known as "dynamic clouds" that can work with distinct groups of independent variables put in separate variables. This is useful in our model since embedded sub-paths are not independent: we split potentially dependant paths into separate variables, resulting in each of them containing independant paths. Experiments with the INEX collections show good results for the structure-only collections, but our approach could not scale well for large structure-and-content collections.; Comment: This is the authors' version. To access the final version go to the editor's site through the DOI

ELCA Evaluation for Keyword Search on Probabilistic XML Data

Zhou, Rui; Liu, Chengfei; Li, Jianxin; Yu, Jeffrey Xu
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 13/10/2011
Relevância na Pesquisa
27.08%
As probabilistic data management is becoming one of the main research focuses and keyword search is turning into a more popular query means, it is natural to think how to support keyword queries on probabilistic XML data. With regards to keyword query on deterministic XML documents, ELCA (Exclusive Lowest Common Ancestor) semantics allows more relevant fragments rooted at the ELCAs to appear as results and is more popular compared with other keyword query result semantics (such as SLCAs). In this paper, we investigate how to evaluate ELCA results for keyword queries on probabilistic XML documents. After defining probabilistic ELCA semantics in terms of possible world semantics, we propose an approach to compute ELCA probabilities without generating possible worlds. Then we develop an efficient stack-based algorithm that can find all probabilistic ELCA results and their ELCA probabilities for a given keyword query on a probabilistic XML document. Finally, we experimentally evaluate the proposed ELCA algorithm and compare it with its SLCA counterpart in aspects of result effectiveness, time and space efficiency, and scalability.; Comment: Technical Report

LiquidXML: Adaptive XML Content Redistribution

Camacho-Rodríguez, Jesús; Katsifodimos, Asterios; Manolescu, Ioana; Roatis, Alexandra
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Relevância na Pesquisa
27.08%
We propose to demonstrate LiquidXML, a platform for managing large corpora of XML documents in large-scale P2P networks. All LiquidXML peers may publish XML documents to be shared with all the network peers. The challenge then is to efficiently (re-)distribute the published content in the network, possibly in overlapping, redundant fragments, to support efficient processing of queries at each peer. The novelty of LiquidXML relies in its adaptive method of choosing which data fragments are stored where, to improve performance. The "liquid" aspect of XML management is twofold: XML data flows from many sources towards many consumers, and its distribution in the network continuously adapts to improve query performance.

Context-based Diversification for Keyword Queries over XML Data

Li, Jianxin; Liu, Chengfei; Yao, Liang; Yu, Jeffrey Xu
Fonte: Universidade Cornell Publicador: Universidade Cornell
Tipo: Artigo de Revista Científica
Publicado em 10/01/2013
Relevância na Pesquisa
27.08%
While keyword query empowers ordinary users to search vast amount of data, the ambiguity of keyword query makes it difficult to effectively answer keyword queries, especially for short and vague keyword queries. To address this challenging problem, in this paper we propose an approach that automatically diversifies XML keyword search based on its different contexts in the XML data. Given a short and vague keyword query and XML data to be searched, we firstly derive keyword search candidates of the query by a classifical feature selection model. And then, we design an effective XML keyword search diversification model to measure the quality of each candidate. After that, three efficient algorithms are proposed to evaluate the possible generated query candidates representing the diversified search intentions, from which we can find and return top-$k$ qualified query candidates that are most relevant to the given keyword query while they can cover maximal number of distinct results.At last, a comprehensive evaluation on real and synthetic datasets demonstrates the effectiveness of our proposed diversification model and the efficiency of our algorithms.