WorldWideScience

Sample records for recursive xml views

  1. Updating Recursive XML Views of Relations

    Institute of Scientific and Technical Information of China (English)

    Byron Choi; Gao Cong; Wenfei Fan; Stratis D. Viglas

    2008-01-01

    This paper investigates the view update problem for XML views published from relational data. We consider XML views defined in terms of mappings directed by possibly recursive DTDs compressed into DAGs and stored in relations.We provide new techniques to efficiently support XML view updates specified in terms of Xpath expressions with recursion and complex filters. The interaction between Xpath recursion and DAG compression of XML views makes the analysis of the XML view update problem rather intriguing. Furthermore, many issues are still open even for relational view updates,and need to be explored. In response to these, on the XML side, we revise the notion of side effects and update semantics based on the semantics of XML views, and present efficient algorithms to translate XML updates to relational view updates.On the relational side, we propose a mild condition on SPJ views, and show that under this condition the analysis of deletions on relational views becomes PTIME while the insertion analysis is NP-complete. We develop an efficient algorithm to process relational view deletions, and a heuristic algorithm to handle view insertions. Finally, we present an experimental study to verify the effectiveness of our techniques.

  2. Updating Recursive XML Views of Relations

    DEFF Research Database (Denmark)

    Choi, Byron; Cong, Gao; Fan, Wenfei;

    2009-01-01

    that under this condition the analysis of deletions on relational views becomes PTIME while the insertion analysis is NP-complete. We develop an efficient algorithm to process relational view deletions, and a heuristic algorithm to handle view insertions. Finally, we present an experimental study to verify...

  3. Secure Querying of Recursive XML Views: A Standard XPath-based Technique

    CERN Document Server

    Mahfoud, Houari

    2011-01-01

    Most state-of-the art approaches for securing XML documents allow users to access data only through authorized views defined by annotating an XML grammar (e.g. DTD) with a collection of XPath expressions. To prevent improper disclosure of confidential information, user queries posed on these views need to be rewritten into equivalent queries on the underlying documents. This rewriting enables us to avoid the overhead of view materialization and maintenance. A major concern here is that query rewriting for recursive XML views is still an open problem. To overcome this problem, some works have been proposed to translate XPath queries into non-standard ones, called Regular XPath queries. However, query rewriting under Regular XPath can be of exponential size as it relies on automaton model. Most importantly, Regular XPath remains a theoretical achievement. Indeed, it is not commonly used in practice as translation and evaluation tools are not available. In this paper, we show that query rewriting is always possi...

  4. Materialized View Selection by Query Clustering in XML Data Warehouses

    CERN Document Server

    Mahboubi, Hadj; Darmont, Jérôme

    2008-01-01

    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.

  5. Efficient Integrity Checking for Databases with Recursive Views

    DEFF Research Database (Denmark)

    Martinenghi, Davide; Christiansen, Henning

    2005-01-01

    into incremental and optimized tests specialized for given update patterns. These tests may involve the introduction of new views, but for relevant cases of recursion, simplified integrity constraints are obtained that can be checked more efficiently than the original ones and without auxiliary views. Notably...

  6. Modeling views in the layered view model for XML using UML

    NARCIS (Netherlands)

    Rajugan, R.; Dillon, T.S.; Chang, E.; Feng, L.

    2006-01-01

    In data engineering, view formalisms are used to provide flexibility to users and user applications by allowing them to extract and elaborate data from the stored data sources. Conversely, since the introduction of Extensible Markup Language (XML), it is fast emerging as the dominant standard for st

  7. The ViP2P Platform: XML Views in P2P

    CERN Document Server

    Karanasos, Konstantinos; Manolescu, Ioana; Zoupanos, Spyros

    2011-01-01

    The growing volumes of XML data sources on the Web or produced by enterprises, organizations etc. raise many performance challenges for data management applications. In this work, we are concerned with the distributed, peer-to-peer management of large corpora of XML documents, based on distributed hash table (or DHT, in short) overlay networks. We present ViP2P (standing for Views in Peer-to-Peer), a distributed platform for sharing XML documents based on a structured P2P network infrastructure (DHT). At the core of ViP2P stand distributed materialized XML views, defined by arbitrary XML queries, filled in with data published anywhere in the network, and exploited to efficiently answer queries issued by any network peer. ViP2P allows user queries to be evaluated over XML documents published by peers in two modes. First, a long-running subscription mode, when a query can be registered in the system and receive answers incrementally when and if published data matches the query. Second, queries can also be asked...

  8. A General Approach for Securely Querying and Updating XML Data

    CERN Document Server

    Mahfoud, Houari

    2012-01-01

    Over the past years several works have proposed access control models for XML data where only read-access rights over non-recursive DTDs are considered. A few amount of works have studied the access rights for updates. In this paper, we present a general model for specifying access control on XML data in the presence of update operations of W3C XQuery Update Facility. Our approach for enforcing such updates specifications is based on the notion of query rewriting where each update operation defined over arbitrary DTD (recursive or not) is rewritten to a safe one in order to be evaluated only over XML data which can be updated by the user. We investigate in the second part of this report the secure of XML updating in the presence of read-access rights specified by a security views. For an XML document, a security view represents for each class of users all and only the parts of the document these users are able to see. We show that an update operation defined over a security view can cause disclosure of sensit...

  9. The XSD-Builder Specification Language—Toward a Semantic View of XML Schema Definition

    Science.gov (United States)

    Fong, Joseph; Cheung, San Kuen

    In the present database market, XML database model is a main structure for the forthcoming database system in the Internet environment. As a conceptual schema of XML database, XML Model has its limitation on presenting its data semantics. System analyst has no toolset for modeling and analyzing XML system. We apply XML Tree Model (shown in Figure 2) as a conceptual schema of XML database to model and analyze the structure of an XML database. It is important not only for visualizing, specifying, and documenting structural models, but also for constructing executable systems. The tree model represents inter-relationship among elements inside different logical schema such as XML Schema Definition (XSD), DTD, Schematron, XDR, SOX, and DSD (shown in Figure 1, an explanation of the terms in the figure are shown in Table 1). The XSD-Builder consists of XML Tree Model, source language, translator, and XSD. The source language is called XSD-Source which is mainly for providing an environment with concept of user friendliness while writing an XSD. The source language will consequently be translated by XSD-Translator. Output of XSD-Translator is an XSD which is our target and is called as an object language.

  10. Invisible XML

    NARCIS (Netherlands)

    Pemberton, S.

    2013-01-01

    What if you could see everything as XML? XML has many strengths for data exchange, strengths both inherent in the nature of XML markup and strengths that derive from the ubiquity of tools that can process XML. For authoring, however, other forms are preferred: no one writes CSS or Javascript in XML.

  11. A Dynamic XML-NS View Based Approach for the Extensible Integration of Web Data Sources

    Institute of Scientific and Technical Information of China (English)

    WU Wei; LU Zheng-ding; LI Rui-xuan; WANG Zhi-gang

    2004-01-01

    We propose a three-step technique to achieve this purpose.First, we utilize a collection of XML namespaces organized into hierarchical structure as a medium for expressing data semantics.Second, we define the format of resource descriptor for the information source discovery scheme so that we can dynamically register and/or deregister the Web data sources on the fly.Third, we employ an inverted-index mechanism to identify the subset of information sources that are relevant to a particular user query.We describe the design, architecture, and implementation of our approach--IWDS, and illustrate its use through case examples.

  12. XML Retrieval

    CERN Document Server

    Lalmas, Mounia

    2009-01-01

    Documents usually have a content and a structure. The content refers to the text of the document, whereas the structure refers to how a document is logically organized. An increasingly common way to encode the structure is through the use of a mark-up language. Nowadays, the most widely used mark-up language for representing structure is the eXtensible Mark-up Language (XML). XML can be used to provide a focused access to documents, i.e. returning XML elements, such as sections and paragraphs, instead of whole documents in response to a query. Such focused strategies are of particular benefit

  13. XML Transformations

    Directory of Open Access Journals (Sweden)

    Felician ALECU

    2012-04-01

    Full Text Available XSLT style sheets are designed to transform the XML documents into something else. The two most popular parsers of the moment are the Document Object Model (DOM and the Simple API for XML (SAX. DOM is an official recommendation of the W3C (available at http://www.w3.org/TR/REC-DOM-Level-1, while SAX is a de facto standard. A good parser should be fast, space efficient, rich in functionality and easy to use.

  14. Implementasi XML Encryption (XML Enc Menggunakan Java

    Directory of Open Access Journals (Sweden)

    Tenia Wahyuningrum

    2012-05-01

    Full Text Available Seiring dengan semakin luasnya penggunaan XML pada berbagai layanan di internet, yang penyebaran informasinya sebagian besar menggunakan infrastruktur jaringan umum, maka mulai muncul permasalahan mengenai kebutuhan akan keamanan data bagi informasi yang terkandung didalam sebuah dokumen XML. Salah satu caranya adalah dengan menggunakan teknologi XML Enc. Pada makalah ini akan dibahas mengenai cara menggunakan XML Enc menggunakan bahasa pemrograman java, khususnya menyandikan dokumen XML (enkripsi, dengan algoritma AES dan Tripple DES untuk menyandikan dokumen XML menggunakan kunci simetrik.

  15. Recursive analysis

    CERN Document Server

    Goodstein, R L

    2010-01-01

    Recursive analysis develops natural number computations into a framework appropriate for real numbers. This text is based upon primary recursive arithmetic and presents a unique combination of classical analysis and intuitional analysis. Written by a master in the field, it is suitable for graduate students of mathematics and computer science and can be read without a detailed knowledge of recursive arithmetic.Introductory chapters on recursive convergence and recursive and relative continuity are succeeded by explorations of recursive and relative differentiability, the relative integral, and

  16. Communicating with XML

    CERN Document Server

    Salminen, Airi

    2012-01-01

    This book provides extensive insight into the possibilities and challenges of XML in building new information management solutions in networked organizations. After a brief introduction to Web communication features and XML fundamentals, the book examines the benefits of adopting XML and illustrates various types of XML use: XML in document management; XML for data-centric and multimedia components; XML as a format for metadata, including metadata for the Semantic Web; and XML in support of data interchange between software applications and among organizations. The challenges of adopting XML i

  17. XML under the Hood.

    Science.gov (United States)

    Scharf, David

    2002-01-01

    Discusses XML (extensible markup language), particularly as it relates to libraries. Topics include organizing information; cataloging; metadata; similarities to HTML; organizations dealing with XML; making XML useful; a history of XML; the semantic Web; related technologies; XML at the Library of Congress; and its role in improving the…

  18. Thinking recursively

    CERN Document Server

    Roberts, Eric S

    1986-01-01

    Concentrating on the practical value of recursion, this text, the first of its kind, is essential to computer science students' education. In this text, students will learn the concept and programming applications of recursive thinking. This will ultimately prepare students for advanced topics in computer science such as compiler construction, formal language theory, and the mathematical foundations of computer science.

  19. XML for dummies

    CERN Document Server

    Dykes, Lucinda

    2005-01-01

    See how XML works for business needs and RSS feedsCreate consistency on the Web, or tag your data for different purposesTag -- XML is it! XML tags let you share your format as well as your data, and this handy guide will show you how. You''ll soon be using this markup language to create everything from Web sites to business forms, discovering schemas and DOCTYPES, wandering the Xpath, teaming up XML with Office 2003, and more.Discover how to* Make information portable* Use XML with Word 2003* Store different types of data* Convert HTML documents to XHTML* Add CSS to XML* Understand and use DTD

  20. On Recursion

    Directory of Open Access Journals (Sweden)

    Jeffrey eWatumull

    2014-01-01

    Full Text Available It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauser, Chomsky, and Fitch’s (2002 articulation. These authors put forward the hypothesis that what is uniquely human and unique to the faculty of language—the faculty of language in the narrow sense (FLN—is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded—existent or nonexistent. And to the extent that embedding is a sufficient, though not necessary, diagnostic of recursion, it has not been established that the apparent restriction on embedding in some languages is of any theoretical import. Misunderstanding of these facts has generated research that is often irrelevant to the FLN thesis as well as to other theories of language competence that focus on its generative power of expression. This essay is an attempt to bring conceptual clarity to such discussions as well as to future empirical investigations by explaining three criterial properties of recursion: computability (i.e., rules in intension rather than lists in extension; definition by induction (i.e., rules strongly generative of structure; and mathematical induction (i.e., rules for the principled—and potentially unbounded—expansion of strongly generated structure. By these necessary and sufficient criteria, the grammars of all natural

  1. The JSpecView Project: an Open Source Java viewer and converter for JCAMP-DX, and XML spectral data files.

    Science.gov (United States)

    Lancashire, Robert J

    2007-12-07

    The JSpecView Open Source project began with the intention of providing both a teaching and research tool for the display of JCAMP-DX spectra. The development of the Java source code commenced under license in 2001 and was released as Open Source in March 2006. The scope was then broadened to take advantage of the XML initiative in Chemistry and routines to read and write AnIML and CMLspect documents were added.JSpecView has the ability to display the full range of JCAMP-DX formats and protocols and to display multiple spectra simultaneously. As an aid for the interpretation of spectra it was found useful to offer routines such that if any part of the spectral display is clicked, that region can be highlighted and the (x, y) coordinates returned. This is conveniently handled using calls from JavaScript and the feedback results can be used to initiate links to other applets like Jmol, to generate a peak table, or even to load audio clips providing helpful hints.Whilst the current user base is still small, there are a number of sites that already feature the applet. A tutorial video showing how to examine NMR spectra using JSpecView has appeared on YouTube and was formatted for replay on iPods and it has been incorporated into a chemistry search engine.

  2. The JSpecView Project: an Open Source Java viewer and converter for JCAMP-DX, and XML spectral data files

    Directory of Open Access Journals (Sweden)

    Lancashire Robert J

    2007-12-01

    Full Text Available Abstract The JSpecView Open Source project began with the intention of providing both a teaching and research tool for the display of JCAMP-DX spectra. The development of the Java source code commenced under license in 2001 and was released as Open Source in March 2006. The scope was then broadened to take advantage of the XML initiative in Chemistry and routines to read and write AnIML and CMLspect documents were added. JSpecView has the ability to display the full range of JCAMP-DX formats and protocols and to display multiple spectra simultaneously. As an aid for the interpretation of spectra it was found useful to offer routines such that if any part of the spectral display is clicked, that region can be highlighted and the (x, y coordinates returned. This is conveniently handled using calls from JavaScript and the feedback results can be used to initiate links to other applets like Jmol, to generate a peak table, or even to load audio clips providing helpful hints. Whilst the current user base is still small, there are a number of sites that already feature the applet. A tutorial video showing how to examine NMR spectra using JSpecView has appeared on YouTube and was formatted for replay on iPods and it has been incorporated into a chemistry search engine.

  3. XML: Ejemplos de uso

    OpenAIRE

    Luján Mora, Sergio

    2011-01-01

    XML (eXtensible Markup Language, Lenguaje de marcas extensible) - Aplicación XML = Lenguaje de marcado = Vocabulario - Ejemplos: DocBook, Chemical Markup Language, Keyhole Markup Language, Mathematical Markup Language, Open Document, Open XML Format, Scalable Vector Graphics, Systems Byology Markup Language.

  4. Recursive Distinctioning

    CERN Document Server

    Isaacson, Joel

    2016-01-01

    Recursive distinctioning (RD) is a name coined by Joel Isaacson in his original patent document describing how fundamental patterns of process arise from the systematic application of operations of distinction and description upon themselves. Recursive distinctioning means just what it says. A pattern of distinctions is given in a space based on a graphical structure (such as a line of print or a planar lattice or given graph). Each node of the graph is occupied by a letter from some arbitrary alphabet. A specialized alphabet is given that can indicate distinctions about neighbors of a given node. The neighbors of a node are all nodes that are connected to the given node by edges in the graph. The letters in the specialized alphabet (call it SA) are used to describe the states of the letters in the given graph and at each stage in the recursion, letters in SA are written at all nodes in the graph, describing its previous state. The recursive structure that results from the iteration of descriptions is called ...

  5. XML Style Guide

    Science.gov (United States)

    2015-07-01

    TELEMETRY GROUP DOCUMENT 125-15 XML STYLE GUIDE DISTRIBUTION A: APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED...OMB control number. 1. REPORT DATE 01 JUL 2015 2. REPORT TYPE N/A 3. DATES COVERED 4. TITLE AND SUBTITLE XML Style Guide 5a. CONTRACT...standard was prepared by the Data Multiplex Committee of the Telemetry Group, Range Commanders Council. The XML Style Guide defines rules and guidelines

  6. Flux: FunctionaL Updates for XML (extended report)

    CERN Document Server

    Cheney, James

    2008-01-01

    XML database query languages have been studied extensively, but XML database updates have received relatively little attention, and pose many challenges to language design. We are developing an XML update language called Flux, which stands for FunctionaL Updates for XML, drawing upon ideas from functional programming languages. In prior work, we have introduced a core language for Flux with a clear operational semantics and a sound, decidable static type system based on regular expression types. Our initial proposal had several limitations. First, it lacked support for recursive types or update procedures. Second, although a high-level source language can easily be translated to the core language, it is difficult to propagate meaningful type errors from the core language back to the source. Third, certain updates are well-formed yet contain path errors, or ``dead'' subexpressions which never do any useful work. It would be useful to detect path errors, since they often represent errors or optimization opportu...

  7. RelaXML

    DEFF Research Database (Denmark)

    Knudsen, Steffen Ulsø; Pedersen, Torben Bach; Thomsen, Christian;

    exchange is cumbersome and must often be hand-coded, at considerable expense. This paper remedies the situation by proposing RELAXML, an automatic and effective approach to bidirectional XML-based exchange of relational data. RELAXML supports re-use through multiple inheritance, and handles both export...... of relational data to XML documents and (re-)import of XML documents with a large degree of flexibility in terms of the SQL statements and XML document structures supported. Import and export are formally defined so as to avoid semantic problems, and algorithms to implement both are given. A performance study...

  8. RelaXML

    DEFF Research Database (Denmark)

    Knudsen, Steffen Ulsø; Pedersen, Torben Bach; Thomsen, Christian;

    2005-01-01

    exchange is cumbersome and must often be hand-coded, at considerable expense. This paper remedies the situation by proposing RELAXML, an automatic and effective approach to bidirectional XML-based exchange of relational data. RELAXML supports re-use through multiple inheritance, and handles both export...... of relational data to XML documents and (re-)import of XML documents with a large degree of flexibility in terms of the SQL statements and XML document structures supported. Import and export are formally defined so as to avoid semantic problems, and algorithms to implement both are given. A performance study...

  9. The XML benchmark project

    NARCIS (Netherlands)

    Schmidt, A.R.; Waas, F.; Kersten, M.L.; Florescu, D.; Carey, M.J.

    2001-01-01

    With standardization efforts of a query language for XML documents drawing to a close, researchers and users increasingly focus their attention on the database technology that has to deliver on the new challenges that the sheer amount of XML documents produced by applications pose to data management

  10. Securing XML Documents

    Directory of Open Access Journals (Sweden)

    Charles Shoniregun

    2004-11-01

    Full Text Available XML (extensible markup language is becoming the current standard for establishing interoperability on the Web. XML data are self-descriptive and syntax-extensible; this makes it very suitable for representation and exchange of semi-structured data, and allows users to define new elements for their specific applications. As a result, the number of documents incorporating this standard is continuously increasing over the Web. The processing of XML documents may require a traversal of all document structure and therefore, the cost could be very high. A strong demand for a means of efficient and effective XML processing has posed a new challenge for the database world. This paper discusses a fast and efficient indexing technique for XML documents, and introduces the XML graph numbering scheme. It can be used for indexing and securing graph structure of XML documents. This technique provides an efficient method to speed up XML data processing. Furthermore, the paper explores the classification of existing methods impact of query processing, and indexing.

  11. Normalized Relational Storage for Extensible Markup Language (XML Schema

    Directory of Open Access Journals (Sweden)

    Kamsuriah Ahmad

    2011-01-01

    Full Text Available Problem statement: The use of XML as the common formats for representing, exchanging, storing, integrating and accessing data posses many new challenges to database systems. Most of application data are stored in relational databases due to its popularity and rich development experiences over it. Therefore, how to provide a proper mapping approach from XML model to relational model become the major research problems. Current techniques for managing XML in relational technology consider only the structure of an XML document and ignore its semantics as expressed by keys and functional dependencies. Approach: In this study we present an algorithm for generating an optimal design for XML in relational setting. The algorithm is based on computing a set of minimum covers for all functional dependencies on a universal relation when given XML Functional Dependencies (XFDs and the schema information. However we need to deal with the hierarchical nature of XML and to define XFDs in this structure. Results: We show that our algorithm is efficient in terms of reducing data redundancy and preserving semantic expression. Conclusion/Recommendations: Being able to infer XML functional dependencies constraints to relational views of XML data is a first step towards establishing a connection between XML and its relational representation at the semantic level.

  12. RelaXML

    DEFF Research Database (Denmark)

    Knudsen, Steffen Ulsø; Pedersen, Torben Bach; Thomsen, Christian;

    exchange is cumbersome and must often be hand-coded, at considerable expense. This paper remedies the situation by proposing RELAXML, an automatic and effective approach to bidirectional XML-based exchange of relational data. RELAXML supports re-use through multiple inheritance, and handles both export...... shows that the approach has a reasonable overhead compared to hand-coded programs.......In modern enterprises, almost all data is stored in relational databases. Additionally, most enterprises increasingly collaborate with other enterprises in long-running read-write workflows, primarily through XML-based data exchange technologies such as web services. However, bidirectional XML data...

  13. XML problem, design, solution

    CERN Document Server

    Amiano, Mitch; Ethier, Kay; Thomas, Michael D

    2006-01-01

    Offering a unique approach to learning XML, this book walks readers through the process of building a complete, functional, end-to-end XML solutionFeatured case study is an online business product catalog that includes reports, data input/output, workflow, stylesheet formatting, RSS feeds, and integration with external services like Google, eBay, and AmazonThe format of presenting a problem and working through the design to come up with a solution enables readers to understand how XML markup allows a business to share data across applications internally or with partners or customers even thoug

  14. Recursion Theory Week

    CERN Document Server

    Müller, Gert; Sacks, Gerald

    1990-01-01

    These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.

  15. Logics for XML

    CERN Document Server

    Geneves, Pierre

    2008-01-01

    This thesis describes the theoretical and practical foundations of a system for the static analysis of XML processing languages. The system relies on a fixpoint temporal logic with converse, derived from the mu-calculus, where models are finite trees. This calculus is expressive enough to capture regular tree types along with multi-directional navigation in trees, while having a single exponential time complexity. Specifically the decidability of the logic is proved in time 2^O(n) where n is the size of the input formula. Major XML concepts are linearly translated into the logic: XPath navigation and node selection semantics, and regular tree languages (which include DTDs and XML Schemas). Based on these embeddings, several problems of major importance in XML applications are reduced to satisfiability of the logic. These problems include XPath containment, emptiness, equivalence, overlap, coverage, in the presence or absence of regular tree type constraints, and the static type-checking of an annotated query....

  16. Resource Optimization Using XML

    Directory of Open Access Journals (Sweden)

    Gaurav Kumar

    2009-01-01

    Full Text Available Extensible Markup Language [XML] database is one of thehot areas of research now days. Number of developers andresearch organizations are working on the capabilities andefficiency of using Extensible Markup Language [XML]database because of its unique structure and processingspeed. In any web based database search, there is need of aserver side script as well as back-end RDBMS [RelationalDatabase Management System]. Generally SQL [StructuredQuery Language] is used for querying the database.Moreover, the web hosting cost is also very high in variousplans using these technologies. XML has an exceptionalfeature to be used as a database as well as a document. XMLdocument is generally formatted using CSS [Cascading StyleSheets] or XSL [Extensible Stylesheet Language.In this research work, we have compared the capability andefficiency of XML as a database rather than a simple webdocument. This work is dedicated to the competence of PHP[Hypertext Preprocessor] and XML over PHP and MYSQL.In our results, we have proved that XML is giving goodresults rather than MYSQL.

  17. Dual Syntax for XML Languages

    DEFF Research Database (Denmark)

    Brabrand, Claus; Møller, Anders; Schwartzbach, Michael Ignatieff

    2008-01-01

    XML is successful as a machine processable data interchange format, but it is often too verbose for human use. For this reason, many XML languages permit an alternative more legible non-XML syntax. XSLT stylesheets are often used to convert from the XML syntax to the alternative syntax; however......, such transformations are not reversible since no general tool exists to automatically parse the alternative syntax back into XML. We present XSugar, which makes it possible to manage dual syntax for XML languages. An XSugar specification is built around a context-free grammar that unifies the two syntaxes...... of a language. Given such a specification, the XSugar tool can translate from alternative syntax to XML and vice versa. Moreover, the tool statically checks that the transformations are reversible and that all XML documents generated from the alternative syntax are valid according to a given XML schema....

  18. Dual Syntax for XML Languages

    DEFF Research Database (Denmark)

    Brabrand, Claus; Møller, Anders; Schwartzbach, Michael Ignatieff

    2005-01-01

    XML is successful as a machine processable data interchange format, but it is often too verbose for human use. For this reason, many XML languages permit an alternative more legible non-XML syntax. XSLT stylesheets are often used to convert from the XML syntax to the alternative syntax; however......, such transformations are not reversible since no general tool exists to automatically parse the alternative syntax back into XML. We present XSugar, which makes it possible to manage dual syntax for XML languages. An XSugar specification is built around a context-free grammar that unifies the two syntaxes...... of a language. Given such a specification, the XSugar tool can translate from alternative syntax to XML and vice versa. Moreover, the tool statically checks that the transformations are reversible and that all XML documents generated from the alternative syntax are valid according to a given XML schema....

  19. XML Graphs in Program Analysis

    DEFF Research Database (Denmark)

    Møller, Anders; Schwartzbach, Michael I.

    2011-01-01

    XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar...

  20. Expressiveness considerations of XML signatures

    DEFF Research Database (Denmark)

    Jensen, Meiko; Meyer, Christopher

    2011-01-01

    more and more challenging. In this paper, we investigate this issue, describing how an attacker can still interfere with Web Services communication even in the presence of XML Signatures. Additionally, we discuss the interrelation of XML Signatures and XML Encryption, focussing on their security......XML Signatures are used to protect XML-based Web Service communication against a broad range of attacks related to man-in-the-middle scenarios. However, due to the complexity of the Web Services specification landscape, the task of applying XML Signatures in a robust and reliable manner becomes...

  1. Expressiveness considerations of XML signatures

    DEFF Research Database (Denmark)

    Jensen, Meiko; Meyer, Christopher

    2011-01-01

    XML Signatures are used to protect XML-based Web Service communication against a broad range of attacks related to man-in-the-middle scenarios. However, due to the complexity of the Web Services specification landscape, the task of applying XML Signatures in a robust and reliable manner becomes...... more and more challenging. In this paper, we investigate this issue, describing how an attacker can still interfere with Web Services communication even in the presence of XML Signatures. Additionally, we discuss the interrelation of XML Signatures and XML Encryption, focussing on their security...

  2. 基于关系数据库的XML数据管理%An Overview of XML Data Management Based on an RDBMS

    Institute of Scientific and Technical Information of China (English)

    万常选; 刘云生

    2003-01-01

    Currently,there are a great of research topics that focus on storing and querying XML data in an RDBMS,and publishing relational data as XML documents,and querying XML views of relational data. An overview of XMLdata management based on RDBMS is given in this paper. Some existing technologies of storing and querying XMLdata in relational databases ,publishing relational data as XML documents,and querying XML views of relational dataare sufficiently surveyed ,their advantages ,disadvantages ,and causes are analyzed.

  3. Distributed XML Design

    CERN Document Server

    Abiteboul, S; Manna, M; 10.1145/1559795.1559833

    2010-01-01

    A distributed XML document is an XML document that spans several machines. We assume that a distribution design of the document tree is given, consisting of an XML kernel-document T[f1,...,fn] where some leaves are "docking points" for external resources providing XML subtrees (f1,...,fn, standing, e.g., for Web services or peers at remote locations). The top-down design problem consists in, given a type (a schema document that may vary from a DTD to a tree automaton) for the distributed document, "propagating" locally this type into a collection of types, that we call typing, while preserving desirable properties. We also consider the bottom-up design which consists in, given a type for each external resource, exhibiting a global type that is enforced by the local types, again with natural desirable properties. In the article, we lay out the fundamentals of a theory of distributed XML design, analyze problems concerning typing issues in this setting, and study their complexity.

  4. Web geoprocessing services on GML with a fast XML database ...

    African Journals Online (AJOL)

    Web geoprocessing services on GML with a fast XML database. ... However, sometimes the users first have to process available spatial data to obtain the ... we proposed a suitable system prototype design combining the Model View Controller ...

  5. Textbook examples of recursion

    CERN Document Server

    Knuth, Donald E

    2008-01-01

    We discuss properties of recursive schemas related to McCarthy's ``91 function'' and to Takeuchi's triple recursion. Several theorems are proposed as interesting candidates for machine verification, and some intriguing open questions are raised.

  6. GraphXML: an XML based graph interchange format

    NARCIS (Netherlands)

    I. Herman (Ivan); M.S. Marshall (Scott)

    2000-01-01

    textabstractGraphXML is a graph description language in XML that can be used as an interchange format for graph drawing and visualization packages. The generality and rich features of XML make it possible to define an interchange format that not only supports the pure, mathematical description of a

  7. Usability of XML Query Languages

    NARCIS (Netherlands)

    Graaumans, J.P.M.

    2005-01-01

    The eXtensible Markup Language (XML) is a markup language which enables re-use of information. Specific query languages for XML are developed to facilitate this. There are large differences between history, design goal, and syntax of the XML query languages. However, in practice these languages are

  8. Storing XML Documents in Databases

    NARCIS (Netherlands)

    Schmidt, A.R.; Manegold, S.; Kersten, M.L.; Rivero, L.C.; Doorn, J.H.; Ferraggine, V.E.

    2005-01-01

    The authors introduce concepts for loading large amounts of XML documents into databases where the documents are stored and maintained. The goal is to make XML databases as unobtrusive in multi-tier systems as possible and at the same time provide as many services defined by the XML standards as pos

  9. Web Services Security Based on XML Signature and XML Encryption

    Directory of Open Access Journals (Sweden)

    Yue-sheng Gu

    2010-09-01

    Full Text Available With the development of web services application, some issues of web services security are increasingly prominent. As a platform-independent language, XML is widely used for its high expansibility. After analysis the traditional web services security technology, this paper formulates the XML signature and encryption as the core of web services security technology, and describes how to create and verify XML signature, how to encrypt and decrypt XML data. The application of XML signature and encryption in the Web services security is illustrated.

  10. Recursive Lexicographical Search

    DEFF Research Database (Denmark)

    Iskhakov, Fedor; Rust, John; Schjerning, Bertel

    2016-01-01

    (MPE) of these games, much less all of them. We propose a fast and robust generalization of backward induction we call state recursion that operates on a decomposition of the overall DDG into a finite number of more tractable stage games, which can be solved recursively. We provide conditions under...... which state recursion finds at least one MPE of the overall DDG and introduce a recursive lexicographic search (RLS) algorithm that systematically and efficiently uses state recursion to find all MPE of the overall game in a finite number of steps. We apply RLS to find all MPE of a dynamic model...

  11. On Modified Bar recursion

    DEFF Research Database (Denmark)

    Oliva, Paulo Borges

    2002-01-01

    Modified bar recursion is a variant of Spector's bar recursion which can be used to give a realizability interpretation of the classical axiom of dependent choice. This realizability allows for the extraction of witnesses from proofs of forall-exists-formulas in classical analysis. In this talk I...... shall report on results regarding the relationship between modified and Spector's bar recursion. I shall also show that a seemingly weak form of modified bar recursion is as strong as "full" modified bar recursion in higher types....

  12. Object XML Mappings

    NARCIS (Netherlands)

    Diepenmaat, J.H.B.

    2009-01-01

    Lots of things changed during the last decade in the behavior and needs of enterprise computer systems. The complexity of systems increased, and therefore the task of building systems gets harder. Many enterprises store their complex data in the popular XML format. This data usually grows both in st

  13. XML Based UIScript

    Institute of Scientific and Technical Information of China (English)

    CAI Bin; LIAO Jian-xin; SHEN Qi-wei

    2004-01-01

    In this paper, after the analyzing the UIScript mechanism in intelligent peripheral, a new approach of XML-based UIScript is put forward. The related issues such as the design of UIScript language, the execution environment and its relationship with other script languages are discussed.

  14. Data Caching for XML Query

    Institute of Scientific and Technical Information of China (English)

    SU Fei; CI Lin-lin; ZHU Li-ping; ZHAO Xin-xin

    2006-01-01

    In order to apply the technique of data cache to extensible markup language (XML) database system, the XML-cache system to support data cache for XQuery is presented. According to the character of XML, the queries with nesting are normalized to facilitate the following operation. Based on the idea of incomplete tree, using the document type definition (DTD) schema tree and conditions from normalized XQuery, the results of previous queries are maintained to answer new queries, at the same time, the remainder queries are sent to XML database at the back. The results of experiment show all applications supported by XML database can use this technique to cache data for future use.

  15. Document image representation using XML technologies

    Science.gov (United States)

    El-Kwae, Essam A.; Atmakuri, Kusuma H.

    2001-12-01

    Electronic documents have gained wide acceptance due to the ease of editing and sharing of information. However, paper documents are still widely used in many environments. Moving into a paperless and distributed office has become a major goal for document image research. A new approach for form document representation is presented. This approach allows for electronic document sharing over the World Wide Web (WWW) using Extensible Markup Language (XML) technologies. Each document is mapped into three different views, an XML view to represent the preprinted and filled-in data, an XSL (Extensible style Sheets) view to represent the structure of the document, and a DTD (Document Type Definition) view to represent the document grammar and field constraints. The XML and XSL views are generated from a document template, either automatically using image processing techniques, or semi-automatically with minimal user interaction. The DTD representation may be fixed for general documents or may be generated semi-automatically by mining a number of filled-in document examples. Document templates need to be entered once to create the proposed representation. Afterwards, documents may be displayed, updated, or shared over the web. The merits of this approach are demonstrated using a number of examples of widely used forms.

  16. Recursion theory computational aspects of definability

    CERN Document Server

    Chong, Chi Tat

    2015-01-01

    This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.

  17. System architecture with XML

    CERN Document Server

    Daum, Berthold

    2002-01-01

    XML is bringing together some fairly disparate groups into a new cultural clash: document developers trying to understand what a transaction is, database analysts getting upset because the relational model doesn''t fit anymore, and web designers having to deal with schemata and rule based transformations. The key to rising above the confusion is to understand the different semantic structures that lie beneath the standards of XML, and how to model the semantics to achieve the goals of the organization. A pure architecture of XML doesn''t exist yet, and it may never exist as the underlying technologies are so diverse. Still, the key to understanding how to build the new web infrastructure for electronic business lies in understanding the landscape of these new standards.If your background is in document processing, this book will show how you can use conceptual modeling to model business scenarios consisting of business objects, relationships, processes, and transactions in a document-centric way. Database des...

  18. Beginning XML, 5th Edition

    CERN Document Server

    Fawcett, Joe; Quin, Liam R E

    2012-01-01

    A complete update covering the many advances to the XML language The XML language has become the standard for writing documents on the Internet and is constantly improving and evolving. This new edition covers all the many new XML-based technologies that have appeared since the previous edition four years ago, providing you with an up-to-date introductory guide and reference. Packed with real-world code examples, best practices, and in-depth coverage of the most important and relevant topics, this authoritative resource explores both the advantages and disadvantages of XML and addresses the mo

  19. XML-Intensive software development

    OpenAIRE

    Ibañez Anfurrutia, Felipe

    2016-01-01

    168 p. 1. IntroducciónXML es un lenguaje de meta-etiquetas, es decir, puede ser utilizado fundamentalmentepara crear lenguajes de etiquetas . La presencia de XML es unfenómeno generalizado. Sin embargo, su juventud hace que los desarrolladores seenfrentan a muchos desafíos al utilizar XML en aplicaciones de vanguardia. Estatesis enfrenta XML a tres escenarios diferentes: intercambio de documentos,Líneas de Producto Software (LPS) y Lenguajes eSpecíficos de Dominio (LSD).El intercambio digi...

  20. Converting Relational Database Into Xml Document

    Directory of Open Access Journals (Sweden)

    Kanagaraj.S

    2012-03-01

    Full Text Available XML (Extensible Markup Language is emerging and gradually accepted as the standard for data interchange in the Internet world. Interoperation of relational database and XML database involves schema and data translations. Through EER (extended entity relationship model can convert the schema of relational database into XML. The semantics of the relational database, captured in EER diagram, are mapped to XML schema using stepwise procedures and mapped to XML document under the definitions of the XML schema. Converting Relational Database into XML Document is a process of converting the existing databases into XML file format. Existing conversion techniques convert a single database into xml. The proposed approach performs the conversion of databases like Ms-Access, MS-SQL to XML file format. Read the tables information from the corresponding database and generate code for the appropriate databases and convert the tables into XML flat file format. This converted XML file is been presented to the user.

  1. 实战XML

    Institute of Scientific and Technical Information of China (English)

    孙以义; 杜鹃

    2000-01-01

    如果您最近留意计算机新技术动态的话,那么必定会发现XML逐渐正在形成一股热潮。所谓XML(Extensible Markup Language)是一种通用的数据描述语言,与之相关的还有XSL(Extensible Style Language)以及DTD(Document Type Definition)等概念。这些概念的具体解释,读者可参考本文最后的资料部分。

  2. XML Model of Planning System in Foundry

    Directory of Open Access Journals (Sweden)

    A. Stawowy

    2007-07-01

    Full Text Available Contemporary enterprises (including those manufacturing iron castings have at their disposal advanced computer resources for the management of production processes. The disadvantage of these solutions is an incoherent language for writing production planning and scheduling problems. The lack of the standard for data exchange and model description makes the work on designing, development and implementation difficult. Various dialects of XML language, among others for production planning purposes, which may change this situation have been developed for the last several years. The paper describes a PSLX language, which can be viewed first of all as an ontology and communication protocol inside and outside of the Advanced Planning and Scheduling (APS system, as well as an XML standard for production planning and scheduling. This language has been then used to develop a model of planning system in a foundry. The model consists of customer’s order model, resources model and scheduling model.

  3. XML Graphs in Program Analysis

    DEFF Research Database (Denmark)

    Møller, Anders; Schwartzbach, Michael Ignatieff

    2007-01-01

    XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...

  4. XML Files: MedlinePlus

    Science.gov (United States)

    ... Health Terms: Vitamins XML (9 K) XML Schema Definition (XSD, 2 K) Health Services Vocabulary This file contains information on all of ... Local Web site. The file contains service terms definitions and see references service types for each service term The National Library ...

  5. Bulkloading and Maintaining XML Documents

    NARCIS (Netherlands)

    Schmidt, A.R.; Kersten, M.L.

    2002-01-01

    The popularity of XML as a exchange and storage format brings about massive amounts of documents to be stored, maintained and analyzed -- a challenge that traditionally has been tackled with Database Management Systems (DBMS). To open up the content of XML documents to analysis with declarative quer

  6. XML Multidimensional Modelling and Querying

    CERN Document Server

    Boucher, Serge; Zimányi, Esteban

    2009-01-01

    As XML becomes ubiquitous and XML storage and processing becomes more efficient, the range of use cases for these technologies widens daily. One promising area is the integration of XML and data warehouses, where an XML-native database stores multidimensional data and processes OLAP queries written in the XQuery interrogation language. This paper explores issues arising in the implementation of such a data warehouse. We first compare approaches for multidimensional data modelling in XML, then describe how typical OLAP queries on these models can be expressed in XQuery. We then show how, regardless of the model, the grouping features of XQuery 1.1 improve performance and readability of these queries. Finally, we evaluate the performance of query evaluation in each modelling choice using the eXist database, which we extended with a grouping clause implementation.

  7. Recursive Palindromic Smarandache Values

    OpenAIRE

    Earls, Jason

    2005-01-01

    In [1] Recursive Prime Numbers were studied and shown to be finite. This article deals with the same "recursive" topic, but applies the method to numbers whose Smarandache value, S(n), gives a palindromic number. Here, S(n) denotes the Smarandache function of least m such that n divides m!, and a palindrome is an integer that reads the same forwards and backwards (23432, for example). This sequence of recursive palindromic Smarandache values is shown to be finite...

  8. CSchema: A Downgrading Policy Language for XML Access Control

    Institute of Scientific and Technical Information of China (English)

    Dong-Xi Liu

    2007-01-01

    The problem of regulating access to XML documents has attracted much attention from both academic and industry communities.In existing approaches, the XML elements specified by access policies are either accessible or inac-cessible according to their sensitivity.However, in some cases, the original XML elements are sensitive and inaccessible, but after being processed in some appropriate ways, the results become insensitive and thus accessible.This paper proposes a policy language to accommodate such cases, which can express the downgrading operations on sensitive data in XML documents through explicit calculations on them.The proposed policy language is called calculation-embedded schema (CSchema), which extends the ordinary schema languages with protection type for protecting sensitive data and specifying downgrading operations.CSchema language has a type system to guarantee the type correctness of the embedded calcula-tion expressions and moreover this type system also generates a security view after type checking a CSchema policy.Access policies specified by CSchema are enforced by a validation procedure, which produces the released documents containing only the accessible data by validating the protected documents against CSchema policies.These released documents are then ready tobe accessed by, for instance, XML query engines.By incorporating this validation procedure, other XML processing technologies can use CSchema as the access control module.

  9. On finitely recursive programs

    CERN Document Server

    Baselice, Sabrina; Criscuolo, Giovanni

    2009-01-01

    Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable model semantics is highly undecidable. In this paper we prove that a larger class of programs, called finitely recursive programs, preserves most of the good properties of finitary programs under the stable model semantics, namely: (i) finitely recursive programs enjoy a compactness property; (ii) inconsistency checking and skeptical reasoning are semidecidable; (iii) skeptical resolution is complete for normal finitely recursive programs. Moreover, we show how to check inconsistency and answer skeptical queries using finite subsets of the ground program instantiation. We achieve this by extending the splitting sequence theorem by Lifschitz and Turner: We prove that if the input program P is finitely recursive, then the partial stable models determined by any smooth splittin...

  10. Recursive quantum repeater networks

    CERN Document Server

    Van Meter, Rodney; Horsman, Clare

    2011-01-01

    Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data transmission. Many scalability and management problems that arose during the development of the Internet might have been solved in a more uniform fashion, improving flexibility and reducing redundant engineering effort. Quantum repeater network development is currently at the stage where we risk similar duplication when separate systems are combined. We propose a unifying framework that can be used with all existing repeater designs. We introduce the notion of a Quantum Recursive Network Architecture, developed from the emerging classical concept of 'recursive networks', extending recursive mechanisms from a focus on data forwarding to a more general distributed computing request framework. Recursion abstracts independent transit networks as single relay nodes, unifies software layer...

  11. Conception et Evaluation de XQuery dans une architecture de m\\'ediation "Tout-XML"

    CERN Document Server

    Dang-Ngoc, Tuyet-Tram

    2008-01-01

    XML has emerged as the leading language for representing and exchanging data not only on the Web, but also in general in the enterprise. XQuery is emerging as the standard query language for XML. Thus, tools are required to mediate between XML queries and heterogeneous data sources to integrate data in XML. This paper presents the XMedia mediator, a unique tool for integrating and querying disparate heterogeneous information as unified XML views. It describes the mediator architecture and focuses on the unique distributed query processing technology implemented in this component. Query evaluation is based on an original XML algebra simply extending classical operators to process tuples of tree elements. Further, we present a set of performance evaluation on a relational benchmark, which leads to discuss possible performance enhancements.

  12. Recursion in pragmatics

    OpenAIRE

    2013-01-01

    There has been a recent spate of work on recursion as a central design feature of language. This short report points out that there is little evidence that unlimited recursion, understood as center-embedding, is typical of natural language syntax. Nevertheless, embedded pragmatic construals seem available in every language. Further, much deeper center-embedding can be found in dialogue or conversation structure than can be found in syntax. Existing accounts for the 'performance' limitations o...

  13. Cytometry metadata in XML

    Science.gov (United States)

    Leif, Robert C.; Leif, Stephanie H.

    2016-04-01

    Introduction: The International Society for Advancement of Cytometry (ISAC) has created a standard for the Minimum Information about a Flow Cytometry Experiment (MIFlowCyt 1.0). CytometryML will serve as a common metadata standard for flow and image cytometry (digital microscopy). Methods: The MIFlowCyt data-types were created, as is the rest of CytometryML, in the XML Schema Definition Language (XSD1.1). The datatypes are primarily based on the Flow Cytometry and the Digital Imaging and Communication (DICOM) standards. A small section of the code was formatted with standard HTML formatting elements (p, h1, h2, etc.). Results:1) The part of MIFlowCyt that describes the Experimental Overview including the specimen and substantial parts of several other major elements has been implemented as CytometryML XML schemas (www.cytometryml.org). 2) The feasibility of using MIFlowCyt to provide the combination of an overview, table of contents, and/or an index of a scientific paper or a report has been demonstrated. Previously, a sample electronic publication, EPUB, was created that could contain both MIFlowCyt metadata as well as the binary data. Conclusions: The use of CytometryML technology together with XHTML5 and CSS permits the metadata to be directly formatted and together with the binary data to be stored in an EPUB container. This will facilitate: formatting, data- mining, presentation, data verification, and inclusion in structured research, clinical, and regulatory documents, as well as demonstrate a publication's adherence to the MIFlowCyt standard, promote interoperability and should also result in the textual and numeric data being published using web technology without any change in composition.

  14. The quality of the XML web

    NARCIS (Netherlands)

    Grijzenhout, S.; Marx, M.; Berendt, B.; de Vries, A.; Fan, W.; Macdonald, C.; Ounis, I.; Ruthven, I.

    2011-01-01

    We collect evidence to answer the following question: Is the quality of the XML documents found on the web sufficient to apply XML technology like XQuery, XPath and XSLT? XML collections from the web have been previously studied statistically, but no detailed information about the quality of the XML

  15. The Cadmio XML healthcare record.

    Science.gov (United States)

    Barbera, Francesco; Ferri, Fernando; Ricci, Fabrizio L; Sottile, Pier Angelo

    2002-01-01

    The management of clinical data is a complex task. Patient related information reported in patient folders is a set of heterogeneous and structured data accessed by different users having different goals (in local or geographical networks). XML language provides a mechanism for describing, manipulating, and visualising structured data in web-based applications. XML ensures that the structured data is managed in a uniform and transparent manner independently from the applications and their providers guaranteeing some interoperability. Extracting data from the healthcare record and structuring them according to XML makes the data available through browsers. The MIC/MIE model (Medical Information Category/Medical Information Elements), which allows the definition and management of healthcare records and used in CADMIO, a HISA based project, is described in this paper, using XML for allowing the data to be visualised through web browsers.

  16. Adaptive XML to relational mapping: an integrated approach

    Institute of Scientific and Technical Information of China (English)

    Tian-lei HU; Gang CHEN

    2008-01-01

    Storing and querying XML (eXtensible Markup Language) data in relational form can exploit various services offered by modem relational database management systems (RDBMSs). Due to structural complexity of XML, there are many equivalent relational mapping schemes for the same XML data and queries. In this paper, we propose the adaptive XML to relational mapping (AX2RM) system, which considers finding optimal XML to relational (X2R) mapping as four separate but correlated procedures: logical database design, data scale estimation, workload transformation, and physical database design. We view the whole process as an autonomic computing problem and formalize the adaptive X2R mapping problem. Search spaces for each procedure are investigated individually, and five approaches for finding the optimal mapping are studied. We propose an integrated approach with greedy pruning (IT-GP), which views the mapping procedures as a whole and exploits heuristic rules in each procedure to prune impossible mappings as early as possible. Evaluation of these approaches shows the validity and high efficiency of IT-GP.

  17. Language and Recursion

    Science.gov (United States)

    Lowenthal, Francis

    2010-11-01

    This paper examines whether the recursive structure imbedded in some exercises used in the Non Verbal Communication Device (NVCD) approach is actually the factor that enables this approach to favor language acquisition and reacquisition in the case of children with cerebral lesions. For that a definition of the principle of recursion as it is used by logicians is presented. The two opposing approaches to the problem of language development are explained. For many authors such as Chomsky [1] the faculty of language is innate. This is known as the Standard Theory; the other researchers in this field, e.g. Bates and Elman [2], claim that language is entirely constructed by the young child: they thus speak of Language Acquisition. It is also shown that in both cases, a version of the principle of recursion is relevant for human language. The NVCD approach is defined and the results obtained in the domain of language while using this approach are presented: young subjects using this approach acquire a richer language structure or re-acquire such a structure in the case of cerebral lesions. Finally it is shown that exercises used in this framework imply the manipulation of recursive structures leading to regular grammars. It is thus hypothesized that language development could be favored using recursive structures with the young child. It could also be the case that the NVCD like exercises used with children lead to the elaboration of a regular language, as defined by Chomsky [3], which could be sufficient for language development but would not require full recursion. This double claim could reconcile Chomsky's approach with psychological observations made by adherents of the Language Acquisition approach, if it is confirmed by researches combining the use of NVCDs, psychometric methods and the use of Neural Networks. This paper thus suggests that a research group oriented towards this problematic should be organized.

  18. RECURSIVE SYSTEM IDENTIFICATION

    Institute of Scientific and Technical Information of China (English)

    Han-Fu Chen

    2009-01-01

    Most of existing methods in system identification with possible exception of those for linear systems are off-line in nature, and hence are nonrecursive.This paper demonstrates the recent progress in recursive system identification.The recursive identifi-cation algorithms are presented not only for linear systems (multivariate ARMAX systems) but also for nonlinear systems such as the Hammerstein and Wiener systems, and the non-linear ARX systems.The estimates generated by the algorithms are online updated and converge a.s.to the true values as time tends to infinity.

  19. A Join Index for XML Data Warehouses

    CERN Document Server

    Mahboubi, Hadj; Darmont, Jérôme

    2008-01-01

    XML data warehouses form an interesting basis for decision-support applications that exploit complex data. However, native-XML database management systems (DBMSs) currently bear limited performances and it is necessary to research for ways to optimize them. In this paper, we propose a new join index that is specifically adapted to the multidimensional architecture of XML warehouses. It eliminates join operations while preserving the information contained in the original warehouse. A theoretical study and experimental results demonstrate the efficiency of our join index. They also show that native XML DBMSs can compete with XML-compatible, relational DBMSs when warehousing and analyzing XML data.

  20. Accomplishing Deterministic XML Query Optimization

    Institute of Scientific and Technical Information of China (English)

    Dun-Ren Che

    2005-01-01

    As the popularity of XML (eXtensible Markup Language) keeps growing rapidly, the management of XML compliant structured-document databases has become a very interesting and compelling research area. Query optimization for XML structured-documents stands out as one of the most challenging research issues in this area because of the much enlarged optimization (search) space, which is a consequence of the intrinsic complexity of the underlying data model of XML data. We therefore propose to apply deterministic transformations on query expressions to most aggressively prune the search space and fast achieve a sufficiently improved alternative (if not the optimal) for each incoming query expression. This idea is not just exciting but practically attainable. This paper first provides an overview of our optimization strategy, and then focuses on the key implementation issues of our rule-based transformation system for XML query optimization in a database environment. The performance results we obtained from experimentation show that our approach is a valid and effective one.

  1. Recursive ultrasound imaging

    DEFF Research Database (Denmark)

    2000-01-01

    A method and an apparatus for recursive ultrasound imaging is presented. The method uses a Synthetic Transmit Aperture, but unlike previous approaches a new frame is created at every pulse emission. In receive, parallel beam forming is implemented. The beam formed RF data is added to the previously...

  2. Recursive ultrasound imaging

    DEFF Research Database (Denmark)

    2000-01-01

    A method and an apparatus for recursive ultrasound imaging is presented. The method uses a Synthetic Transmit Aperture, but unlike previous approaches a new frame is created at every pulse emission. In receive, parallel beam forming is implemented. The beam formed RF data is added to the previously...

  3. Recursive Programming: A Clarification

    NARCIS (Netherlands)

    Hove d'Ertsenryck, G.M.C. van den

    2012-01-01

    We show that the block concept, as it was introduced in ALGOL 60, and two of the three main techniques introduced by E. W. Dijkstra in his seminal article Recursive Programming to implement it, the so-called "static links" and "display", have been partly misunderstood. These misunderstandings may ha

  4. Relatively Recursive Rational Choice.

    Science.gov (United States)

    1981-11-01

    Rogers [19671, Ch.IX, pp.127-134 . tCf. Ch. 13 of Rogers [19671. **Gerald E. Sacks, Degrees of Unsolvability, Annals of Mathematics No. 55, Princeton...265. CI -17- References Kleene, Stephen Cole, and Enil L. Post [19541, "The Upper Semi-Lattice of Degrees of Recursive Unsolvability", Annals of Mathematics , Vol

  5. Recursive Advice for Coordination

    DEFF Research Database (Denmark)

    Terepeta, Michal Tomasz; Nielson, Hanne Riis; Nielson, Flemming

    2012-01-01

    makes analyzing such languages more difficult due to the fact that aspects can be recursive - advice from an aspect must itself be analyzed by aspects - as well as being simultaneously applicable in concurrent threads. Therefore the problem of reachability of various states of a system becomes much more...

  6. XWeB: The XML Warehouse Benchmark

    Science.gov (United States)

    Mahboubi, Hadj; Darmont, Jérôme

    With the emergence of XML as a standard for representing business data, new decision support applications are being developed. These XML data warehouses aim at supporting On-Line Analytical Processing (OLAP) operations that manipulate irregular XML data. To ensure feasibility of these new tools, important performance issues must be addressed. Performance is customarily assessed with the help of benchmarks. However, decision support benchmarks do not currently support XML features. In this paper, we introduce the XML Warehouse Benchmark (XWeB), which aims at filling this gap. XWeB derives from the relational decision support benchmark TPC-H. It is mainly composed of a test data warehouse that is based on a unified reference model for XML warehouses and that features XML-specific structures, and its associate XQuery decision support workload. XWeB's usage is illustrated by experiments on several XML database management systems.

  7. XWeB: the XML Warehouse Benchmark

    CERN Document Server

    Mahboubi, Hadj

    2011-01-01

    With the emergence of XML as a standard for representing business data, new decision support applications are being developed. These XML data warehouses aim at supporting On-Line Analytical Processing (OLAP) operations that manipulate irregular XML data. To ensure feasibility of these new tools, important performance issues must be addressed. Performance is customarily assessed with the help of benchmarks. However, decision support benchmarks do not currently support XML features. In this paper, we introduce the XML Warehouse Benchmark (XWeB), which aims at filling this gap. XWeB derives from the relational decision support benchmark TPC-H. It is mainly composed of a test data warehouse that is based on a unified reference model for XML warehouses and that features XML-specific structures, and its associate XQuery decision support workload. XWeB's usage is illustrated by experiments on several XML database management systems.

  8. Logging data representation based on XML

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    As an open standard of data representation, XML breathes new energy to the Web application and the network computing. The development, advantage and status of XML and some standards relating to XML are reviewed. In addition, the authors put forward a method representing logging data and using UML language to establish the conceptual and logical model of logging data; using a logging data, explain how to establish the model as well as how to use XML to display and process geology data.

  9. OWL Web Ontology Language XML Presentation Syntax

    OpenAIRE

    Hori, Masahiro; Euzenat, Jérôme; Patel-Schneider, Peter

    2003-01-01

    hori2003a; This document describes an XML presentation syntax and XML Schemas for OWL 1.0 sublanguages: OWL Lite, OWL DL, and OWL Full. This document has been written to meet the requirement that OWL 1.0 should have an XML serialization syntax (R15 in [OWL Requirement]). It is not intended to be a normative specification. Instead, it represents a suggestion of one possible XML presentation syntax for OWL.

  10. XML: a lingua franca for science?

    Science.gov (United States)

    Barillot, E; Achard, F

    2000-08-01

    XML is a new language designed to solve one of the biggest problems of the World Wide Web: its main language, HTML, is not extensible. In this article, the authors discuss the current successes and limitations of the World Wide Web, briefly explain the basics of XML and present the benefits of using XML as a data-exchange language. Finally, they discuss real-life applications that have been developed using XML, with a focus on biology.

  11. XML: De eend met de gouden eieren?

    NARCIS (Netherlands)

    Keulen, van Maurice

    2001-01-01

    XML is al een tijdje één van de hypes. Alles moet met XML. Als kritisch informaticus begint het dan bij mij te kriebelen. Hoezo alles moet met XML? Klinkt een beetje als ik heb een hamer en alles ziet er ineens uit als een spijker. Het kan toch niet waar zijn dat men werkelijk iets heeft uitgevonden

  12. Specifying OLAP Cubes On XML Data

    DEFF Research Database (Denmark)

    Jensen, Mikael Rune; Møller, Thomas Holmgren; Pedersen, Torben Bach

    . Extensible Markup Language (XML) is fast becoming the new standard for data representation and exchange on the World Wide Web. The rapid emergence of XML data on the web, e.g., business-to-business (B2B) ecommerce, is making it necessary for OLAP and other data analysis tools to handleXML data as well...

  13. XML content warehousing: Improving sociological studies of mailing lists and web data

    CERN Document Server

    Nguyen, Benjamin; Dudouet, François-Xavier; Colazzo, Dario; Manolescu, Ioana; Senellart, Pierre

    2011-01-01

    In this paper, we present the guidelines for an XML-based approach for the sociological study of Web data such as the analysis of mailing lists or databases available online. The use of an XML warehouse is a flexible solution for storing and processing this kind of data. We propose an implemented solution and show possible applications with our case study of profiles of experts involved in W3C standard-setting activity. We illustrate the sociological use of semi-structured databases by presenting our XML Schema for mailing-list warehousing. An XML Schema allows many adjunctions or crossings of data sources, without modifying existing data sets, while allowing possible structural evolution. We also show that the existence of hidden data implies increased complexity for traditional SQL users. XML content warehousing allows altogether exhaustive warehousing and recursive queries through contents, with far less dependence on the initial storage. We finally present the possibility of exporting the data stored in t...

  14. Stable Recursive Subhomogeneous Algebras

    CERN Document Server

    Liang, Hutian

    2011-01-01

    In this paper, we introduce stable recursive subhomogeneous algebras (SRSHAs), which is analogous to recursive subhomogeneous algebras (RSHAs) introduced by N. C. Phillips in the studies of free minimal integer actions on compact metric spaces. The difference between the stable version and the none stable version is that the irreducible representations of SRSHAs are infinite dimensional, but the irreducible representations of the RSHAs are finite dimensional. While RSHAs play an important role in the study of free minimal integer actions on compact metric spaces, SRSHAs play an analogous role in the study of free minimal actions by the group of the real numbers on compact metric spaces. In this paper, we show that simple inductive limits of SRSHAs with no dimension growth in which the connecting maps are injective and non-vanishing have topological stable rank one.

  15. Length Normalization in XML Retrieval

    NARCIS (Netherlands)

    Kamps, Jaap; Rijke, Maarten de; Sigurbjörnsson, Börkur

    2005-01-01

    The full paper appeared as: J. Kamps, M. de Rijke, and B. Sigurbj¨ornsson, “Length Normalization in XML Retrieval,” In: Proceedings 27th Annual International ACM SIGIR Conference (SIGIR 2004), pages 80-87, 2004.

  16. XML Docbook to Mediawiki Converter

    Directory of Open Access Journals (Sweden)

    Maria Chiara Pievatolo

    2013-05-01

    Full Text Available A Perl script, based on the work of Stefano Selleri, to migrate XML-Docbook 4.X documents to Wiki markup. I added some lines to meet my need to convert my Kant translations from Docbook to MediaWiki. A sample of the output can be...

  17. Recursion theory for metamathematics

    CERN Document Server

    Smullyan, Raymond M

    1993-01-01

    This work is a sequel to the author''s Godel''s Incompleteness Theorems, though it can be read independently by anyone familiar with Godel''s incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.

  18. Recursive Rational Choice.

    Science.gov (United States)

    1981-11-01

    Systems, Annals of Mathematics Studies, No.47, -10- Princeton University Press, [1961], finitary objects and discretized procedures, for the...Ph.D. Thesis, Yeshiva University. Church, Alonzo [1941], The Calculus of Lamda-Conversion, Annals of Mathematics Studies, No.6, Princeton University...Post, Emil L., and Stephen Cole Kleene, [1954], "The Upper Semi-Lattice of Degrees of Recursive Unsolvability", Annals of Mathematics , Vol.59, pp.379

  19. Using XML to encode TMA DES metadata

    Directory of Open Access Journals (Sweden)

    Oliver Lyttleton

    2011-01-01

    Full Text Available Background: The Tissue Microarray Data Exchange Specification (TMA DES is an XML specification for encoding TMA experiment data. While TMA DES data is encoded in XML, the files that describe its syntax, structure, and semantics are not. The DTD format is used to describe the syntax and structure of TMA DES, and the ISO 11179 format is used to define the semantics of TMA DES. However, XML Schema can be used in place of DTDs, and another XML encoded format, RDF, can be used in place of ISO 11179. Encoding all TMA DES data and metadata in XML would simplify the development and usage of programs which validate and parse TMA DES data. XML Schema has advantages over DTDs such as support for data types, and a more powerful means of specifying constraints on data values. An advantage of RDF encoded in XML over ISO 11179 is that XML defines rules for encoding data, whereas ISO 11179 does not. Materials and Methods: We created an XML Schema version of the TMA DES DTD. We wrote a program that converted ISO 11179 definitions to RDF encoded in XML, and used it to convert the TMA DES ISO 11179 definitions to RDF. Results: We validated a sample TMA DES XML file that was supplied with the publication that originally specified TMA DES using our XML Schema. We successfully validated the RDF produced by our ISO 11179 converter with the W3C RDF validation service. Conclusions: All TMA DES data could be encoded using XML, which simplifies its processing. XML Schema allows datatypes and valid value ranges to be specified for CDEs, which enables a wider range of error checking to be performed using XML Schemas than could be performed using DTDs.

  20. Using XML to encode TMA DES metadata.

    Science.gov (United States)

    Lyttleton, Oliver; Wright, Alexander; Treanor, Darren; Lewis, Paul

    2011-01-01

    The Tissue Microarray Data Exchange Specification (TMA DES) is an XML specification for encoding TMA experiment data. While TMA DES data is encoded in XML, the files that describe its syntax, structure, and semantics are not. The DTD format is used to describe the syntax and structure of TMA DES, and the ISO 11179 format is used to define the semantics of TMA DES. However, XML Schema can be used in place of DTDs, and another XML encoded format, RDF, can be used in place of ISO 11179. Encoding all TMA DES data and metadata in XML would simplify the development and usage of programs which validate and parse TMA DES data. XML Schema has advantages over DTDs such as support for data types, and a more powerful means of specifying constraints on data values. An advantage of RDF encoded in XML over ISO 11179 is that XML defines rules for encoding data, whereas ISO 11179 does not. We created an XML Schema version of the TMA DES DTD. We wrote a program that converted ISO 11179 definitions to RDF encoded in XML, and used it to convert the TMA DES ISO 11179 definitions to RDF. We validated a sample TMA DES XML file that was supplied with the publication that originally specified TMA DES using our XML Schema. We successfully validated the RDF produced by our ISO 11179 converter with the W3C RDF validation service. All TMA DES data could be encoded using XML, which simplifies its processing. XML Schema allows datatypes and valid value ranges to be specified for CDEs, which enables a wider range of error checking to be performed using XML Schemas than could be performed using DTDs.

  1. Feature Weight Tuning for Recursive Neural Networks

    OpenAIRE

    2014-01-01

    This paper addresses how a recursive neural network model can automatically leave out useless information and emphasize important evidence, in other words, to perform "weight tuning" for higher-level representation acquisition. We propose two models, Weighted Neural Network (WNN) and Binary-Expectation Neural Network (BENN), which automatically control how much one specific unit contributes to the higher-level representation. The proposed model can be viewed as incorporating a more powerful c...

  2. The Universal Kolyvagin Recursion Implies the Kolyvagin Recursion

    Institute of Scientific and Technical Information of China (English)

    Yi OUYANG

    2007-01-01

    Let (u)z be the universal norm distribution and M a fixed power of prime p. By using the double complex method employed by Anderson, we study the universal Kolyvagin recursion occurring in the canonical basis in the cohomology group H0(Gz,(u)z/M(u)z). We furthermore show that the universal Kolyvagin recursion implies the Kolyvagin recursion in the theory of Euler systems. One certainly hopes this could lead to a new way to find new Euler systems.

  3. XML for catalogers and metadata librarians

    CERN Document Server

    Cole, Timothy W

    2013-01-01

    How are today's librarians to manage and describe the everexpanding volumes of resources, in both digital and print formats? The use of XML in cataloging and metadata workflows can improve metadata quality, the consistency of cataloging workflows, and adherence to standards. This book is intended to enable current and future catalogers and metadata librarians to progress beyond a bare surfacelevel acquaintance with XML, thereby enabling them to integrate XML technologies more fully into their cataloging workflows. Building on the wealth of work on library descriptive practices, cataloging, and metadata, XML for Catalogers and Metadata Librarians explores the use of XML to serialize, process, share, and manage library catalog and metadata records. The authors' expert treatment of the topic is written to be accessible to those with little or no prior practical knowledge of or experience with how XML is used. Readers will gain an educated appreciation of the nuances of XML and grasp the benefit of more advanced ...

  4. Issues on efficiency of XML parsers

    Directory of Open Access Journals (Sweden)

    Codruţa Vancea

    2009-10-01

    Full Text Available Using XML (Extensible Markup Language processing can result into significant runtime overhead in a XML-based infrastructural middleware, such as multi-thread server application. Based on well-formed pairs of named-marking tags, XML element’s structure contribute to its cross-platform and vender neutrality characteristics, but require extra computation in processing. In this paper we analyze XML processing overhead for the most known XML parsers and decide what parser is most suited for a multi-thread server application that will process many streams of XML content, streams that can be very large. Based on the analysis that was carried on, we offer a solution for XML binding.

  5. XML-Glue application framework based on CAR component technology%基于CAR构件技术的XML-Glue应用框架

    Institute of Scientific and Technical Information of China (English)

    贺嘉; 陈榕

    2007-01-01

    模型-视图-控制器(model-view-controller)是一个经典设计模式,用来解决在Web应用开发中由于Web应用特殊性导致的各种问题.提出了基于CAR构件技术的XML-Glue应用框架的概念,来支持这个架构模式.提出了基于CAR构件技术的XML-Glue应用框架的概念,并简述了XML-Glue的工作原理,以一个简单的图形界面的完整应用为例,来说明XML-Glue应用框架是怎样工作的.

  6. PRIDEViewer: a novel user-friendly interface to visualize PRIDE XML files.

    Science.gov (United States)

    Medina-Aunon, J Alberto; Carazo, José M; Albar, Juan Pablo

    2011-01-01

    Current standardization initiatives have greatly contributed to share the information derived by proteomics experiments. One of these initiatives is the XML-based repository PRIDE (PRoteomics IDEntification database), although an XML-based document does not appear to present a user-friendly view at the first glance. PRIDEViewer is a novel Java-based application that presents the information available in a PRIDE XML file in a user-friendly manner, facilitating the interaction among end users as well as the understanding and evaluation of the compiled information. PRIDEViewer is freely available at: http://proteo.cnb.csic.es/prideviewer/.

  7. Recursive processing of cyclic graphs.

    Science.gov (United States)

    Bianchini, Monica; Gori, Marco; Sarti, Lorenzo; Scarselli, Franco

    2006-01-01

    Recursive neural networks are a powerful tool for processing structured data. According to the recursive learning paradigm, the input information consists of directed positional acyclic graphs (DPAGs). In fact, recursive networks are fed following the partial order defined by the links of the graph. Unfortunately, the hypothesis of processing DPAGs is sometimes too restrictive, being the nature of some real-world problems intrinsically cyclic. In this paper, a methodology is proposed, which allows us to process any cyclic directed graph. Therefore, the computational power of recursive networks is definitely established, also clarifying the underlying limitations of the model.

  8. Recursive principal components analysis.

    Science.gov (United States)

    Voegtlin, Thomas

    2005-10-01

    A recurrent linear network can be trained with Oja's constrained Hebbian learning rule. As a result, the network learns to represent the temporal context associated to its input sequence. The operation performed by the network is a generalization of Principal Components Analysis (PCA) to time-series, called Recursive PCA. The representations learned by the network are adapted to the temporal statistics of the input. Moreover, sequences stored in the network may be retrieved explicitly, in the reverse order of presentation, thus providing a straight-forward neural implementation of a logical stack.

  9. A browser-based tool for conversion between Fortran NAMELIST and XML/HTML

    Science.gov (United States)

    Naito, O.

    A browser-based tool for conversion between Fortran NAMELIST and XML/HTML is presented. It runs on an HTML5 compliant browser and generates reusable XML files to aid interoperability. It also provides a graphical interface for editing and annotating variables in NAMELIST, hence serves as a primitive code documentation environment. Although the tool is not comprehensive, it could be viewed as a test bed for integrating legacy codes into modern systems.

  10. XML Translator for Interface Descriptions

    Science.gov (United States)

    Boroson, Elizabeth R.

    2009-01-01

    A computer program defines an XML schema for specifying the interface to a generic FPGA from the perspective of software that will interact with the device. This XML interface description is then translated into header files for C, Verilog, and VHDL. User interface definition input is checked via both the provided XML schema and the translator module to ensure consistency and accuracy. Currently, programming used on both sides of an interface is inconsistent. This makes it hard to find and fix errors. By using a common schema, both sides are forced to use the same structure by using the same framework and toolset. This makes for easy identification of problems, which leads to the ability to formulate a solution. The toolset contains constants that allow a programmer to use each register, and to access each field in the register. Once programming is complete, the translator is run as part of the make process, which ensures that whenever an interface is changed, all of the code that uses the header files describing it is recompiled.

  11. Speed up of XML parsers with PHP language implementation

    Science.gov (United States)

    Georgiev, Bozhidar; Georgieva, Adriana

    2012-11-01

    In this paper, authors introduce PHP5's XML implementation and show how to read, parse, and write a short and uncomplicated XML file using Simple XML in a PHP environment. The possibilities for mutual work of PHP5 language and XML standard are described. The details of parsing process with Simple XML are also cleared. A practical project PHP-XML-MySQL presents the advantages of XML implementation in PHP modules. This approach allows comparatively simple search of XML hierarchical data by means of PHP software tools. The proposed project includes database, which can be extended with new data and new XML parsing functions.

  12. Recursive Concurrent Stochastic Games

    CERN Document Server

    Etessami, Kousha

    2008-01-01

    We study Recursive Concurrent Stochastic Games (RCSGs), extending our recent analysis of recursive simple stochastic games [16,17] to a concurrent setting where the two players choose moves simultaneously and independently at each state. For multi-exit games, our earlier work already showed undecidability for basic questions like termination, thus we focus on the important case of single-exit RCSGs (1-RCSGs). We first characterize the value of a 1-RCSG termination game as the least fixed point solution of a system of nonlinear minimax functional equations, and use it to show PSPACE decidability for the quantitative termination problem. We then give a strategy improvement technique, which we use to show that player 1 (maximizer) has \\epsilon-optimal randomized Stackless & Memoryless (r-SM) strategies for all \\epsilon > 0, while player 2 (minimizer) has optimal r-SM strategies. Thus, such games are r-SM-determined. These results mirror and generalize in a strong sense the randomized memoryless determinacy r...

  13. Integrating XQuery-enabled SCORM XML Metadata Repositories into an RDF-based E-Learning P2P Network

    Directory of Open Access Journals (Sweden)

    Wolfgang Nejdl

    2004-04-01

    Full Text Available Edutella is an RDF-based E-Learning P2P network that is aimed to accommodate heterogeneous learning resource metadata repositories in a P2P manner and further facilitate the exchange of metadata between these repositories based on RDF. Whereas Edutella provides RDF metadata repositories with a quite natural integration approach, XML metadata repositories have to overcome considerable incompatibility between XML’s tree-like hierarchical data model and RDF’s binary relational data model in order to be integrated into Edutella. In this paper we investigate a generic approach for integrating XML metadata repositories into Edutella in terms of an XQuery-enabled native XML database containing SCORM XML metadata. We first propose a triple-like XML-based common data view to cross incompatibility between arbitrary XML data model and RDF data model, then discuss the wrapper program implementation for XML metadata repositories based on the wrapper-like Edutella content provider integration architecture. At last, we propose a generic approach for querying complex XML data schemas in Edutella through QBE (Query by Example, and present the design of a QBE-based SCORM query GUI that can be used to query SCORM XML metadata in Edutella in the RDF syntax.

  14. Recursive Polynomial Remainder Sequence and its Subresultants

    OpenAIRE

    Terui, Akira

    2008-01-01

    We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," along with investigation of their properties. A recursive PRS is defined as, if there exists the GCD (greatest common divisor) of initial polynomials, a sequence of PRSs calculated "recursively" for the GCD and its derivative until a constant is derived, and recursive subresultants are defined by determinants representing the coefficients in recursive PRS as functions of coefficients of init...

  15. Subresultants in Recursive Polynomial Remainder Sequence

    OpenAIRE

    Terui, Akira

    2008-01-01

    We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," and investigate their properties. In calculating PRS, if there exists the GCD (greatest common divisor) of initial polynomials, we calculate "recursively" with new PRS for the GCD and its derivative, until a constant is derived. We call such a PRS a recursive PRS. We define recursive subresultants to be determinants representing the coefficients in recursive PRS by coefficients of initial po...

  16. Lambda calculus with explicit recursion

    NARCIS (Netherlands)

    Z.M. Ariola (Zena); J.W. Klop (Jan Willem)

    1996-01-01

    textabstractThis paper is concerned with the study of $lambda$-calculus with explicit recursion, namely of cyclic $lambda$-graphs. The starting point is to treat a $lambda$-graph as a system of recursion equations involving $lambda$-terms, and to manipulate such systems in an unrestricted manner,

  17. XML Entity Architecture for Efficient Software Integration

    OpenAIRE

    Patwardhan, Amol; Patwardhan, Rahul

    2016-01-01

    This paper proposed xml entities based architectural implementation to improve integration between multiple third party vendor software systems with incompatible xml schema. The xml entity architecture implementation showed that the lines of code change required for mapping the schema between in house software and three other vendor schema, decreased by 5.2%, indicating an improvement in quality. The schema mapping development time decreased by 3.8% and overall release time decreased by 5.3%,...

  18. XML Publishing with Adobe InDesign

    CERN Document Server

    Hoskins, Dorothy

    2010-01-01

    From Adobe InDesign CS2 to InDesign CS5, the ability to work with XML content has been built into every version of InDesign. Some of the useful applications are importing database content into InDesign to create catalog pages, exporting XML that will be useful for subsequent publishing processes, and building chunks of content that can be reused in multiple publications. In this Short Cut, we'll play with the contents of a college course catalog and see how we can use XML for course descriptions, tables, and other content. Underlying principles of XML structure, DTDs, and the InDesign namesp

  19. Recursivity in Lingua Cosmica

    Science.gov (United States)

    Ollongren, Alexander

    2011-02-01

    In a sequence of papers on the topic of message construction for interstellar communication by means of a cosmic language, the present author has discussed various significant requirements such a lingua should satisfy. The author's Lingua Cosmica is a (meta) system for annotating contents of possibly large-scale messages for ETI. LINCOS, based on formal constructive logic, was primarily designed for dealing with logic contents of messages but is also applicable for denoting structural properties of more general abstractions embedded in such messages. The present paper explains ways and means for achieving this for a special case: recursive entities. As usual two stages are involved: first the domain of discourse is enriched with suitable representations of the entities concerned, after which properties over them can be dealt with within the system itself. As a representative example the case of Russian dolls (Matrjoshka's) is discussed in some detail and relations with linguistic structures in natural languages are briefly exploited.

  20. Linear recursive distributed representations.

    Science.gov (United States)

    Voegtlin, Thomas; Dominey, Peter F

    2005-09-01

    Connectionist networks have been criticized for their inability to represent complex structures with systematicity. That is, while they can be trained to represent and manipulate complex objects made of several constituents, they generally fail to generalize to novel combinations of the same constituents. This paper presents a modification of Pollack's Recursive Auto-Associative Memory (RAAM), that addresses this criticism. The network uses linear units and is trained with Oja's rule, in which it generalizes PCA to tree-structured data. Learned representations may be linearly combined, in order to represent new complex structures. This results in unprecedented generalization capabilities. Capacity is orders of magnitude higher than that of a RAAM trained with back-propagation. Moreover, regularities of the training set are preserved in the new formed objects. The formation of new structures displays developmental effects similar to those observed in children when learning to generalize about the argument structure of verbs.

  1. Static Analysis for Dynamic XML

    DEFF Research Database (Denmark)

    Christensen, Aske Simon; Møller, Anders; Schwartzbach, Michael Ignatieff

    2002-01-01

    We describe the summary graph lattice for dataflow analysis of programs that dynamically construct XML documents. Summary graphs have successfully been used to provide static guarantees in the JWIG language for programming interactive Web services. In particular, the JWIG compiler is able to check...... validity of dynamically generated XHTML documents and to type check dynamic form data. In this paper we present summary graphs and indicate their applicability for various scenarios. We also show that the expressive power of summary graphs is similar to that of the regular expression types from XDuce......, but that the extra structure in summary graphs makes them more suitable for certain program analyses....

  2. Static Analysis for Dynamic XML

    DEFF Research Database (Denmark)

    Christensen, Aske Simon; Møller, Anders; Schwartzbach, Michael Ignatieff

    2002-01-01

    We describe the summary graph lattice for dataflow analysis of programs that dynamically construct XML documents. Summary graphs have successfully been used to provide static guarantees in the JWIG language for programming interactive Web services. In particular, the JWIG compiler is able to check...... validity of dynamically generated XHTML documents and to type check dynamic form data. In this paper we present summary graphs and indicate their applicability for various scenarios. We also show that the expressive power of summary graphs is similar to that of the regular expression types from XDuce...

  3. Virtual XML:a New Approach to an XML-based Virtualization of Data Resources

    Institute of Scientific and Technical Information of China (English)

    吴吉义

    2007-01-01

    Virtual XML is a new approach to virtualise data resources and thus enable applications to access both XML and non-XML sources,which can benefit a variety of general-purpose software products and tools and applica- tions dealing with stationary data and data streams.After the architectural components that enable virtual XML—a toolbox that includes a cursor model,Data Format Description Language(DFDL),and XML processing languages were illustrated,the architecture of virtual XML Documents was put forward.

  4. Bottom-up mining of XML query patterns to improve XML querying

    Institute of Scientific and Technical Information of China (English)

    Yi-jun BEI; Gang CHEN; Jin-xiang DONG; Ke CHEN

    2008-01-01

    Querying XML data is a computationally expensive process due to the complex nature of both the XML data and the XML queries. In this paper we propose an approach to expedite XML query processing by caching the results of frequent queries. We discover frequent query patterns from user-issued queries using an efficient bottom-up mining approach called VBUXMiner. VBUXMiner consists of two main steps. First, all queries are merged into a summary structure named "compressed global tree guide" (CGTG). Second, a bottom-up traversal scheme based on the CGTG is employed to generate frequent query patterns. We use the frequent query patterns in a cache mechanism to improve the XML query performance. Experimental results show that our proposed mining approach outperforms the previous mining algorithms for XML queries, such as XQPMinerTID and FastXMiner, and that by caching the results of frequent query patterns, XML query performance can be dramatically improved.

  5. On the effectiveness of XML schema validation for countering XML signature wrapping attacks

    DEFF Research Database (Denmark)

    Jensen, Meiko; Meyer, Christopher; Somorovsky, Juraj

    2011-01-01

    investigated closely enough to make any claims about their effectiveness. In this paper, we analyze the effectiveness of the specific countermeasure of XML Schema validation in terms of fending Signature Wrapping attacks. We investigate the problems of XML Schema validation for Web Services messages......In the context of security of Web Services, the XML Signature Wrapping attack technique has lately received increasing attention. Following a broad range of real-world exploits, general interest in applicable countermeasures rises. However, few approaches for countering these attacks have been......, and discuss the approach of Schema Hardening, a technique for strengthening XML Schema declarations. We conclude that XML Schema validation with a hardened XML Schema is capable of fending XML Signature Wrapping attacks, but bears some pitfalls and disadvantages as well. © 2011 IEEE....

  6. The OLAP-XML Federation System

    DEFF Research Database (Denmark)

    Yin, Xuepeng; Pedersen, Torben Bach

    2006-01-01

    We present the logical “OLAP-XML Federation System” that enables the external data available in XML format to be used as virtual dimensions. Unlike the complex and time-consuming physical integration of OLAP and external data in current OLAP systems, our system makes OLAP queries referencing fast...

  7. Achieving Adaptivity For OLAP-XML Federations

    DEFF Research Database (Denmark)

    Pedersen, D.; Pedersen, Torben Bach

    2003-01-01

    . Specifically, we describe techniques for handling {\\it changes} in external XML data sources. We also describe techniques for improving the reliability of external XML sources, e.g.\\, when these are found on the Internet, by dynamically trying to locate alternative sources during the evaluation of a query...

  8. How will XML impact industrial automation?

    CERN Multimedia

    Pinceti, P

    2002-01-01

    A working group of the World Wide Web Consortium (W3C) has overcome the limits of both HTML and SGML with the definition of the extensible markup language - XML. This article looks at how XML will affect industrial automation (2 pages).

  9. Modeling workflow using XML and Petri net

    Institute of Scientific and Technical Information of China (English)

    杨东; 温泉; 张申生

    2004-01-01

    Nowadays an increasing number of workflow products and research prototypes begin to adopt XML for representing workflow models owing to its easy use and well understanding for people and machines. However, most of workflow products and research prototypes provide the few supports for the verification of XML-based workflow model, such as free-deadlock properties, which is essential to successful application of workflow technology. In this paper, we tackle this problem by mapping the XML-based workflow model into Petri-net, a kind of well-known formalism for modeling,analyzing and verifying system. As a result, the XML-based workflow model can be automatically verified with the help of general Petri-net tools, such as DANAMICS. The presented approach not only enables end users to represent workflow model with XML-based modeling language, but also the correctness of model can be ensured, thus satisfying the needs of business processes.

  10. Type Checking with XML Schema in XACT

    DEFF Research Database (Denmark)

    Kirkegaard, Christian; Møller, Anders

    ACT is an extension of Java for making type-safe XML transformations. Unlike other approaches, XACT provides a programming model based on XML templates and XPath together with a type checker based on data-flow analysis. We show how to extend the data-flow analysis technique used in the XACT system...... to support XML Schema as type formalism. The technique is able to model advanced features, such as type derivations and overloaded local element declarations, and also datatypes of attribute values and character data. Moreover, we introduce optional type annotations to improve modularity of the type checking....... The resulting system supports a flexible style of programming XML transformations and provides static guarantees of validity of the generated XML data....

  11. XML-Data模式的一致性问题%On XML-Data Schema Consistency Problem

    Institute of Scientific and Technical Information of China (English)

    闫萍; 吕腾; 盛其荣

    2004-01-01

    This paper has studied the consistency problem for XML-Data schema in terms of XML-Data schema hedge as well as keys and foreign keys. The consistency problem is to check whether there exists an XML-Data schema hedge that both conforms to the schema and satisfies integrity constraints. Definitions of XML-Data schema and XML-Data schema hedge for the purpose of investigating this problem are proposed, moreover, an algorithm for constructing the XML-Data schema hedge from a given XML-Data schema is given. The undecidability of the consistency problem for XML-Data schema is also presented.%运用键、外键和XML-Data模式篱笆等概念研究了XML-Data模式的一致性问题.XML-Data模式的一致性问题就是判断是否存在一个既满足XML-Data模式又满足完整性约束的XML-Data模式篱笆.提出了XML-Data模式及XML-Data模式篱笆的概念.给出了如何从现有的XML-Data模式构造XML-Data模式篱笆的算法并且证明了XML-Data模式的一致性问题是不可判定的.

  12. Topological recursion and mirror curves

    CERN Document Server

    Bouchard, Vincent

    2012-01-01

    We study the constant contributions to the free energies obtained through the topological recursion applied to the complex curves mirror to toric Calabi-Yau threefolds. We show that the recursion reproduces precisely the corresponding Gromov-Witten invariants, which can be encoded in powers of the MacMahon function. As a result, we extend the scope of the "remodeling conjecture" to the full free energies, including the constant contributions. In the process we study how the pair of pants decomposition of the mirror curves plays an important role in the topological recursion. We also show that the free energies are not, strictly speaking, symplectic invariants, and that the recursive construction of the free energies does not commute with certain limits of mirror curves.

  13. Recursive Algorithm For Linear Regression

    Science.gov (United States)

    Varanasi, S. V.

    1988-01-01

    Order of model determined easily. Linear-regression algorithhm includes recursive equations for coefficients of model of increased order. Algorithm eliminates duplicative calculations, facilitates search for minimum order of linear-regression model fitting set of data satisfactory.

  14. Features and Recursive Structure

    Directory of Open Access Journals (Sweden)

    Kuniya Nasukawa

    2015-01-01

    Full Text Available Based on the cross-linguistic tendency that weak vowels are realized with a central quality such as ə, ɨ, or ɯ, this paper attempts to account for this choice by proposing that the nucleus itself is one of the three monovalent vowel elements |A|, |I| and |U| which function as the building blocks of melodic structure. I claim that individual languages make a parametric choice to determine which of the three elements functions as the head of a nuclear expression. In addition, I show that elements can be freely concatenated to create melodic compounds. The resulting phonetic value of an element compound is determined by the specific elements it contains and by the head-dependency relations between those elements. This concatenation-based recursive mechanism of melodic structure can also be extended to levels above the segment, thus ultimately eliminating the need for syllabic constituents. This approach reinterprets the notion of minimalism in phonology by opposing the string-based flat structure.

  15. Optimizing XML Information Retrieval Query Execution at the Physical Level

    NARCIS (Netherlands)

    Os, van R.

    2007-01-01

    XML is emerging as a standard format for information interchange and storage of structured information. The wide-spread use of XML has sparked the interest of both the database and information retrieval research communities. XML databases are designed to store and query large volumes of XML data. St

  16. The duality of XML Markup and Programming notation

    DEFF Research Database (Denmark)

    Nørmark, Kurt

    2003-01-01

    In web projects it is often necessary to mix XML notation and program notation in a single document or program. In mono-lingual situations, the XML notation is either subsumed in the program or the program notation is subsumed in the XML document. As an introduction we analyze XML notation and pr...

  17. The duality of XML Markup and Programming notation

    DEFF Research Database (Denmark)

    Nørmark, Kurt

    2003-01-01

    In web projects it is often necessary to mix XML notation and program notation in a single document or program. In mono-lingual situations, the XML notation is either subsumed in the program or the program notation is subsumed in the XML document. As an introduction we analyze XML notation and pr...

  18. Publishing with XML structure, enter, publish

    CERN Document Server

    Prost, Bernard

    2015-01-01

    XML is now at the heart of book publishing techniques: it provides the industry with a robust, flexible format which is relatively easy to manipulate. Above all, it preserves the future: the XML text becomes a genuine tactical asset enabling publishers to respond quickly to market demands. When new publishing media appear, it will be possible to very quickly make your editorial content available at a lower cost. On the downside, XML can become a bottomless pit for publishers attracted by its possibilities. There is a strong temptation to switch to audiovisual production and to add video and a

  19. Integrity Based Access Control Model for Multilevel XML Document

    Institute of Scientific and Technical Information of China (English)

    HONG Fan; FENG Xue-bin; HUANO Zhi; ZHENG Ming-hui

    2008-01-01

    XML's increasing popularity highlights the security demand for XML documents. A mandatory access control model for XML document is presented on the basis of investigation of the function dependency of XML documents and discussion of the integrity properties of multilevel XML document. Then, the algorithms for decomposition/recovery multilevel XML document into/from single level document are given, and the manipulation rules for typical operations of XQuery and XUpdate: QUERY, INSERT,UPDATE, and REMOVE, are elaborated. The multilevel XML document access model can meet the requirement of sensitive information processing application.

  20. Integrating and Processing XML Documents with JavaBeans Components

    Directory of Open Access Journals (Sweden)

    Yin-Wah Chiou

    2003-02-01

    Full Text Available The eXtensible Markup Language (XML and JavaBeans component model have gained wide popularity in the Object Web computing. This paper explores how JavaBeans components can be used to integrate and process the XML documents. It covers Bean Markup Language (BML, XML BeanMaker, XML Bean Suite, and Xbeans. The most powerful JavaBeans connection language is BML, which represents an integration of XML and JavaBeans components to provide a mechanism for implementing active content. XML BeanMaker is used to generate JavaBeans from XML DTD files. XML Bean Suite is a toolkit of JavaBeans components to provide a comprehensive set of functionality to manipulate XML content. The Xbean is a powerful paradigm to process XML-based distributed applications.

  1. InfoVis Interaction Techniques in Animation of Recursive Programs

    Directory of Open Access Journals (Sweden)

    Antonio Pérez-Carrasco

    2010-02-01

    Full Text Available Algorithm animations typically assist in educational tasks aimed simply at achieving understanding. Potentially, animations could assist in higher levels of cognition, such as the analysis level, but they usually fail in providing this support because they are not flexible or comprehensive enough. In particular, animations of recursion provided by educational systems hardly support the analysis of recursive algorithms. Here we show how to provide full support to the analysis of recursive algorithms. From a technical point of view, animations are enriched with interaction techniques inspired by the information visualization (InfoVis field. Interaction tasks are presented in seven categories, and deal with both static visualizations and dynamic animations. All of these features are implemented in the SRec system, and visualizations generated by SRec are used to illustrate the article.

  2. XML Format for SESAME and LEOS

    Energy Technology Data Exchange (ETDEWEB)

    Durrenberger, J K; Neely, J R; Sterne, P A

    2009-04-29

    The objective of this document is to describe the XML format used by LLNL and LANL to represent the equation-of-state and related material information in the LEOS and SESAME data libraries. The primary purpose of this document is to describe a specific XML format for representing EOS data that is tailored to the nature of the underlying data and is amenable to conversion to both legacy SESAME and LEOS binary formats. The secondary purpose is to describe an XML format that lends itself to a 'natural' representation in a binary file format of the SESAME, pdb or hdf5 form so that this format and related tools can be used for the rapid and efficient development and implementation of prototype data structures. This document describes the XML format only. A working knowledge of LEOS and SESAME formats is assumed.

  3. Paradoxical intention and recursive anxiety.

    Science.gov (United States)

    Ascher, L M; Schotte, D E

    1999-06-01

    The present study was designed to investigate a possible relationship between "recursive anxiety" and paradoxical intention. Groups of subjects were chosen from among individuals with public speaking concerns. and for whom fear of fear or recursive anxiety clearly represented an important element, or was completely absent from the clinical profile. These subjects were offered a standard in vivo treatment program for public speaking phobia with inclusion or exclusion of paradoxical intention. A 2 x 2 factorial design was employed. Those whose public speaking anxiety was complicated by recursive anxiety experienced greater improvement when paradoxical intention was included in the treatment program than when it was not employed. In contrast, individuals reporting simple public speaking phobia demonstrated greater success with a treatment program in which paradoxical intention was absent. Wegner's hypothesis of "ironic" cognitive processing was used to explain the proposed relationship between paradoxical intention and fear of fear.

  4. Recursion Relations for Conformal Blocks

    CERN Document Server

    Penedones, João; Yamazaki, Masahito

    2016-09-12

    In the context of conformal field theories in general space-time dimension, we find all the possible singularities of the conformal blocks as functions of the scaling dimension $\\Delta$ of the exchanged operator. In particular, we argue, using representation theory of parabolic Verma modules, that in odd spacetime dimension the singularities are only simple poles. We discuss how to use this information to write recursion relations that determine the conformal blocks. We first recover the recursion relation introduced in 1307.6856 for conformal blocks of external scalar operators. We then generalize this recursion relation for the conformal blocks associated to the four point function of three scalar and one vector operator. Finally we specialize to the case in which the vector operator is a conserved current.

  5. Utilizing RELAX NG Schemas in XML Editors

    OpenAIRE

    Schmied, Martin

    2008-01-01

    This thesis explores the possibilities of utilizing RELAX NG schemata in the process of editing XML documents. The ultimate goal of this thesis is to prototype a system supporting user while editing XML document with bound RELAX NG schema inside the Eclipse IDE. Such a system comprises two major components -- an integration of RELAX NG validator and an autocompletion engine. Design of the autocompletion engine represents the main contribution of this thesis, because similar systems are almost...

  6. Research on Heterogeneous Data Exchange based on XML

    Science.gov (United States)

    Li, Huanqin; Liu, Jinfeng

    Integration of multiple data sources is becoming increasingly important for enterprises that cooperate closely with their partners for e-commerce. OLAP enables analysts and decision makers fast access to various materialized views from data warehouses. However, many corporations have internal business applications deployed on different platforms. This paper introduces a model for heterogeneous data exchange based on XML. The system can exchange and share the data among the different sources. The method used to realize the heterogeneous data exchange is given in this paper.

  7. XML Flight/Ground Data Dictionary Management

    Science.gov (United States)

    Wright, Jesse; Wiklow, Colette

    2007-01-01

    A computer program generates Extensible Markup Language (XML) files that effect coupling between the command- and telemetry-handling software running aboard a spacecraft and the corresponding software running in ground support systems. The XML files are produced by use of information from the flight software and from flight-system engineering. The XML files are converted to legacy ground-system data formats for command and telemetry, transformed into Web-based and printed documentation, and used in developing new ground-system data-handling software. Previously, the information about telemetry and command was scattered in various paper documents that were not synchronized. The process of searching and reading the documents was time-consuming and introduced errors. In contrast, the XML files contain all of the information in one place. XML structures can evolve in such a manner as to enable the addition, to the XML files, of the metadata necessary to track the changes and the associated documentation. The use of this software has reduced the extent of manual operations in developing a ground data system, thereby saving considerable time and removing errors that previously arose in the translation and transcription of software information from the flight to the ground system.

  8. Recursive Definitions of Monadic Functions

    Directory of Open Access Journals (Sweden)

    Alexander Krauss

    2010-12-01

    Full Text Available Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's imperative programming extension, which results in a convenient definition principle for imperative programs, which were previously hard to define. For such monadic functions, the recursion equation can always be derived without preconditions, even if the function is partial. The construction is easy to automate, and convenient induction principles can be derived automatically.

  9. Recursive Definitions of Monadic Functions

    CERN Document Server

    Krauss, Alexander

    2010-01-01

    Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's imperative programming extension, which results in a convenient definition principle for imperative programs, which were previously hard to define. For such monadic functions, the recursion equation can always be derived without preconditions, even if the function is partial. The construction is easy to automate, and convenient induction principles can be derived automatically.

  10. XML Data Integrity Based on Concatenated Hash Function

    CERN Document Server

    Liu, Baolong; Yip, Jim

    2009-01-01

    Data integrity is the fundamental for data authentication. A major problem for XML data authentication is that signed XML data can be copied to another document but still keep signature valid. This is caused by XML data integrity protecting. Through investigation, the paper discovered that besides data content integrity, XML data integrity should also protect element location information, and context referential integrity under fine-grained security situation. The aim of this paper is to propose a model for XML data integrity considering XML data features. The paper presents an XML data integrity model named as CSR (content integrity, structure integrity, context referential integrity) based on a concatenated hash function. XML data content integrity is ensured using an iterative hash process, structure integrity is protected by hashing an absolute path string from root node, and context referential integrity is ensured by protecting context-related elements. Presented XML data integrity model can satisfy int...

  11. Desain Sistem Keamanan Distribusi Data Dengan Menerapkan XML Encryption Dan XML Signature Berbasis Teknologi Web Service

    Directory of Open Access Journals (Sweden)

    Slamet Widodo

    2012-01-01

    Full Text Available Development of information technologies is often misused by an organization or a person to take criminal acts, such as the ability to steal and modify information in the data distribution for evil criminal purpose. The Rural Bank of Boyolali is conducting online financial transactions rather intensively, thus it requiring a security system on the distribution of data and credit transactions for their customer among branches offices to head office. The purpose of this study was to build a security system in credit transactions in Rural Bank of Boyolali for their customers among branches offices to head office. One way in protecting data distribution was used XML encryption and XML signature. The application of encryption technique in XML and digital signature in XML by using web service by using the AES (Advanced Encryption Standard and RSA (Rivest-Shamir-Adleman algorithms. This study was resulted the SOAP (Simple Object Access Protocol message security system, with XML and WSDL (Web Services Description Language, over HTTP (Hypertext Transfer Protocol to protect the customers’ credit transactions from intruders. Analysis of examination indicated that the data size (bytes transferred as results of uncompressed XML encryption were larger than compressed XML Encryption, which leads to significant changes between the data transferred that was the processing time of the compressed data was faster than uncompressed XML encryption.

  12. Massive XML Data Mining in Cloud Computing Environment

    Directory of Open Access Journals (Sweden)

    Zhao Li

    2014-08-01

    Full Text Available This paper concentrates on how to mine useful information from massive XML documents in cloud computing environment. The structure of the Cloud computing and the corresponding tree data model of a XML document are analyzed in advance. Afterwards, structure of the proposed XML data mining system is illustrated, which is made up of three layers, such as “Application layer”, “Data processing layer”, and “XML Data converting layer”. In the XML Data converting layer, XML data are collected from databases and documents, and then the source data can be converted to XML file effectively. In the data processing layer, the process of data selection, cleaning and standardization for XML data set is implemented, moreover, a XML data set with higher degree of structure and rich semantics are obtained. In the application layer, “the results report module”, “data query module” and “results analysis module” are included. Next, massive XML data mining algorithm is proposed. The main innovations of this algorithm lie in that 1 the structure of a XML document is represented as an unordered tree, 2 the sub-structures of a XML document are modeled as sub-trees, and XML trees are regarded as a forest which is made up of all the sub-trees. Experimental results show that the proposed method can effectively mine useful information from massive XML documents in cloud computing environment with high efficiency.

  13. Recursive Ping-Pong Protocols

    DEFF Research Database (Denmark)

    Huttel, Hans; Srba, Jiri

    2004-01-01

    This paper introduces a process calculus with recursion which allows us to express an unbounded number of runs of the ping-pong protocols introduced by Dolev and Yao. We study the decidability issues associated with two common approaches to checking security properties, namely reachability analys...

  14. General Recursion and Formal Topology

    Directory of Open Access Journals (Sweden)

    Silvio Valentini

    2010-12-01

    Full Text Available It is well known that general recursion cannot be expressed within Martin-Loef's type theory and various approaches have been proposed to overcome this problem still maintaining the termination of the computation of the typable terms. In this work we propose a new approach to this problem based on the use of inductively generated formal topologies.

  15. A User's Version View of a Robustified, Bayesian Weighted Least-Squares Recursive Algorithm for Interpolating AVHRR-NDVI Data: Applications to an Animated Visualization of the Phenology of a Semi-Arid Study Area

    Science.gov (United States)

    Hermance, J. F.; Jacob, R. W.; Bradley, B. A.; Mustard, J. F.

    2005-12-01

    In studying vegetation patterns remotely, the objective is to draw inferences on the development of specific or general land surface phenology (LSP) as a function of space and time by determining the behavior of a parameter (in our case NDVI), when the parameter estimate may be biased by noise, data dropouts and obfuscations from atmospheric and other effects. We describe the underpinning concepts of a procedure for a robust interpolation of NDVI data that does not have the limitations of other mathematical approaches which require orthonormal basis functions (e.g. Fourier analysis). In this approach, data need not be uniformly sampled in time, nor do we expect noise to be Gaussian-distributed. Our approach is intuitive and straightforward, and is applied here to the refined modeling of LSP using 7 years of weekly and biweekly AVHRR NDVI data for a 150 x 150 km study area in central Nevada. This site is a microcosm of a broad range of vegetation classes, from irrigated agriculture with annual NDVIvalues of up to 0.7 to playas and alkali salt flats with annual NDVI values of only 0.07. Our procedure involves a form of parameter estimation employing Bayesian statistics. In utilitarian terms, the latter procedure is a method of statistical analysis (in our case, robustified, weighted least-squares recursive curve-fitting) that incorporates a variety of prior knowledge when forming current estimates of a particular process or parameter. In addition to the standard Bayesian approach, we account for outliers due to data dropouts or obfuscations because of clouds and snow cover. An initial "starting model" for the average annual cycle and long term (7 year) trend is determined by jointly fitting a common set of complex annual harmonics and a low order polynomial to an entire multi-year time series in one step. This is not a formal Fourier series in the conventional sense, but rather a set of 4 cosine and 4 sine coefficients with fundamental periods of 12, 6, 3 and 1

  16. Modeling business objects with XML schema

    CERN Document Server

    Daum, Berthold

    2003-01-01

    XML Schema is the new language standard from the W3C and the new foundation for defining data in Web-based systems. There is a wealth of information available about Schemas but very little understanding of how to use this highly formal specification for creating documents. Grasping the power of Schemas means going back to the basics of documents themselves, and the semantic rules, or grammars, that define them. Written for schema designers, system architects, programmers, and document authors, Modeling Business Objects with XML Schema guides you through understanding Schemas from the basic concepts, type systems, type derivation, inheritance, namespace handling, through advanced concepts in schema design.*Reviews basic XML syntax and the Schema recommendation in detail.*Builds a knowledge base model step by step (about jazz music) that is used throughout the book.*Discusses Schema design in large environments, best practice design patterns, and Schema''s relation to object-oriented concepts.

  17. Ensuring Query Compatibility with Evolving XML Schemas

    CERN Document Server

    Genevès, Pierre; Quint, Vincent

    2008-01-01

    During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validity of produced data. Nowadays, a challenge is to assess and accommodate the impact of theses changes in rapidly evolving XML applications. This article proposes a logical framework and tool for verifying forward/backward compatibility issues involving schemas and queries. First, it allows analyzing relations between schemas. Second, it allows XML designers to identify queries that must be reformulated in order to produce the expected results across successive schema versions. Third, it allows examining more precisely the impact of schema changes over queries, therefore facilitating their reformulation.

  18. XML Based Scientific Data Management Facility

    Science.gov (United States)

    Mehrotra, P.; Zubair, M.; Bushnell, Dennis M. (Technical Monitor)

    2002-01-01

    The World Wide Web consortium has developed an Extensible Markup Language (XML) to support the building of better information management infrastructures. The scientific computing community realizing the benefits of XML has designed markup languages for scientific data. In this paper, we propose a XML based scientific data management ,facility, XDMF. The project is motivated by the fact that even though a lot of scientific data is being generated, it is not being shared because of lack of standards and infrastructure support for discovering and transforming the data. The proposed data management facility can be used to discover the scientific data itself, the transformation functions, and also for applying the required transformations. We have built a prototype system of the proposed data management facility that can work on different platforms. We have implemented the system using Java, and Apache XSLT engine Xalan. To support remote data and transformation functions, we had to extend the XSLT specification and the Xalan package.

  19. An introduction to XML query processing and keyword search

    CERN Document Server

    Lu, Jiaheng

    2013-01-01

    This book systematically and comprehensively covers the latest advances in XML data searching. It presents an extensive overview of the current query processing and keyword search techniques on XML data.

  20. Recursions for statistical multiple alignment.

    Science.gov (United States)

    Hein, Jotun; Jensen, Jens Ledet; Pedersen, Christian N S

    2003-12-09

    Algorithms are presented that allow the calculation of the probability of a set of sequences related by a binary tree that have evolved according to the Thorne-Kishino-Felsenstein model for a fixed set of parameters. The algorithms are based on a Markov chain generating sequences and their alignment at nodes in a tree. Depending on whether the complete realization of this Markov chain is decomposed into the first transition and the rest of the realization or the last transition and the first part of the realization, two kinds of recursions are obtained that are computationally similar but probabilistically different. The running time of the algorithms is O(Pi id=1 Li), where Li is the length of the ith observed sequences and d is the number of sequences. An alternative recursion is also formulated that uses only a Markov chain involving the inner nodes of a tree.

  1. CXML: intérprete para XML

    OpenAIRE

    Concha Medina, Edgard José; Corro, Gonzalo Gabriel; Leiva, Mario

    2014-01-01

    El lenguaje XML, de creación relativamente reciente, está siendo muy utilizado en aplicaciones web y en las comunicaciones entre servidores web, y adquiriere importancia en el área de las bases de datos, no sólo como soporte para la transferencia de datos sino como formato de almacenamiento. Ya que el lenguaje XML es un estándar internacional y dado su importancia, en el año académico 2013 se solicitó a los alumnos de la asignatura Lenguajes de Programación y Compiladores de la Licenciatur...

  2. On the effectiveness of XML schema validation for countering XML signature wrapping attacks

    DEFF Research Database (Denmark)

    Jensen, Meiko; Meyer, Christopher; Somorovsky, Juraj

    2011-01-01

    In the context of security of Web Services, the XML Signature Wrapping attack technique has lately received increasing attention. Following a broad range of real-world exploits, general interest in applicable countermeasures rises. However, few approaches for countering these attacks have been...... investigated closely enough to make any claims about their effectiveness. In this paper, we analyze the effectiveness of the specific countermeasure of XML Schema validation in terms of fending Signature Wrapping attacks. We investigate the problems of XML Schema validation for Web Services messages...

  3. Towards the XML schema measurement based on mapping between XML and OO domain

    Science.gov (United States)

    Rakić, Gordana; Budimac, Zoran; Heričko, Marjan; Pušnik, Maja

    2017-07-01

    Measuring quality of IT solutions is a priority in software engineering. Although numerous metrics for measuring object-oriented code already exist, measuring quality of UML models or XML Schemas is still developing. One of the research questions in the overall research leaded by ideas described in this paper is whether we can apply already defined object-oriented design metrics on XML schemas based on predefined mappings. In this paper, basic ideas for mentioned mapping are presented. This mapping is prerequisite for setting the future approach to XML schema quality measuring with object-oriented metrics.

  4. 用继承扩展XML-RL%Extending XML-RL with Inheritance

    Institute of Scientific and Technical Information of China (English)

    张晓琳; 王国仁

    2005-01-01

    XML正在成为Internet上数据描述和交换的标准,用一些重要的面向对象的特征扩展基于高级数据模型上的以规则为基础的XML查询语言XML-RL.首先用元素层次,多重继承和多态扩展了XML-RL数据模型.然后扩展XML-RL以支持多态元素,多态引用,独占元素和独占引用.

  5. Recursive simulation of quantum annealing

    CERN Document Server

    Sowa, A P; Samson, J H; Savel'ev, S E; Zagoskin, A M; Heidel, S; Zúñiga-Anaya, J C

    2015-01-01

    The evaluation of the performance of adiabatic annealers is hindered by lack of efficient algorithms for simulating their behaviour. We exploit the analyticity of the standard model for the adiabatic quantum process to develop an efficient recursive method for its numerical simulation in case of both unitary and non-unitary evolution. Numerical simulations show distinctly different distributions for the most important figure of merit of adiabatic quantum computing --- the success probability --- in these two cases.

  6. XML in Projects GNU Gama and 3DGI

    DEFF Research Database (Denmark)

    Kolar, Jan; Soucek, Petr; Cepek, Ales

    2003-01-01

    This paper presents our practical experiences with XML in geodetic and geographical applications. The main concepts and ideas of XML are introduced in an example of a simple web based information system, which exploits the XHTML language. The article further describes how XML is used in GNU Gama...... of the project to GML and X3D is argued. The paper also aims at presenting our future plans with XML in our projects - namely the GNU Gama project, and the 3DGI project....

  7. A Space Surveillance Ontology: Captured in an XML Schema

    Science.gov (United States)

    2000-10-01

    The commercial industry is making significant investments in XML, especially in the area of electronic business . The Air Force can capitalize upon...registryrelease.htm, • Industry leaders, such as Microsoft, Sun Microsystems, International Business Machines (IBM), AT&T, and Oracle, • XML supported...one of the leading information technologies. The primary reason XML is receiving so much support is because of its key role in eCommerce . XML is making

  8. Storing and Querying Probabilistic XML Using a Probabilistic Relational DBMS

    NARCIS (Netherlands)

    Hollander, E.S.; Keulen, van M.

    2010-01-01

    This work explores the feasibility of storing and querying probabilistic XML in a probabilistic relational database. Our approach is to adapt known techniques for mapping XML to relational data such that the possible worlds are preserved. We show that this approach can work for any XML-to-relational

  9. XML: Ejemplos de uso (presentación)

    OpenAIRE

    Luján Mora, Sergio

    2011-01-01

    XML (eXtensible Markup Language, Lenguaje de marcas extensible) - Aplicación XML = Lenguaje de marcado = Vocabulario - Ejemplos: DocBook, Chemical Markup Language, Keyhole Markup Language, Mathematical Markup Language, Open Document, Open XML Format, Scalable Vector Graphics, Systems Byology Markup Language.

  10. A methodology for clustering XML documents by structure

    NARCIS (Netherlands)

    Dalamagas, Theodore; Cheng, Tao; Winkel, Klaas-Jan; Sellis, Timos

    2006-01-01

    The processing and management of XML data are popular research issues. However, operations based on the structure of XML data have not received strong attention. These operations involve, among others, the grouping of structurally similar XML documents. Such grouping results from the application of

  11. A Semantic Network Based Design Methodology for XML Documents

    NARCIS (Netherlands)

    Feng, L.; Chang, E.; Dillon, T.

    2002-01-01

    The eXtensible Markup Language (XML) is fast emerging as the dominant standard for describing and interchanging data among various systems and databases on the Internet. It offers the Document Type Definition (DTD) as a formalism for defining the syntax and structure of XML documents. The XML Schema

  12. Generando datos XML a partir de bases de datos relacionales

    OpenAIRE

    Migani, Silvina; Correa, Carlos; de Vera, Cristina; Romera, Liliana

    2012-01-01

    El lenguaje XML, los lenguajes que permiten manipular datos XML, y su impacto en el mundo de las bases de datos, es el área donde este proyecto se desarrolla. Surge como una iniciativa de docentes del área bases de datos, con la finalidad de profundizar en el estudio de XML y experimentar motores de bases de datos que lo soportan.

  13. A methodology for clustering XML documents by structure

    NARCIS (Netherlands)

    Dalamagas, Theodore; Cheng, Tao; Winkel, Klaas-Jan; Sellis, Timos

    2006-01-01

    The processing and management of XML data are popular research issues. However, operations based on the structure of XML data have not received strong attention. These operations involve, among others, the grouping of structurally similar XML documents. Such grouping results from the application of

  14. Generando datos XML a partir de bases de datos relacionales

    OpenAIRE

    Migani, Silvina; Correa, Carlos; Vera, Cristina; Romera, Liliana

    2012-01-01

    El lenguaje XML, los lenguajes que permiten manipular datos XML, y su impacto en el mundo de las bases de datos, es el área donde este proyecto se desarrolla. Surge como una iniciativa de docentes del área bases de datos, con la finalidad de profundizar en el estudio de XML y experimentar motores de bases de datos que lo soportan.

  15. Towards P2P XML Database Technology

    NARCIS (Netherlands)

    Y. Zhang (Ying)

    2007-01-01

    textabstractTo ease the development of data-intensive P2P applications, we envision a P2P XML Database Management System (P2P XDBMS) that acts as a database middle-ware, providing a uniform database abstraction on top of a dynamic set of distributed data sources. In this PhD work, we research which

  16. Static Analysis of XML Transformations in Java

    DEFF Research Database (Denmark)

    Kirkegaard, Christian; Møller, Anders; Schwartzbach, Michael I.

    2004-01-01

    Abstract--XML documents generated dynamically by programs are typically represented as text strings or DOM trees. This is a low-level approach for several reasons: 1) Traversing and modifying such structures can be tedious and error prone, 2) although schema languages, e.g., DTD, allow classes of...

  17. Achieving Adaptivity For OLAP-XML Federations

    DEFF Research Database (Denmark)

    Pedersen, D.; Pedersen, Torben Bach

    2003-01-01

    Motivated by the need for more flexible OLAP systems, this paper presents the results of work on logical integration of external data in OLAP databases, carried out in cooperation between the Danish OLAP client vendor \\targit and Aalborg University. Flexibility is ensured by supporting XML as the...

  18. Implementing XML Schema Naming and Design Rules

    Energy Technology Data Exchange (ETDEWEB)

    Lubell, Joshua [National Institute of Standards and Technology (NIST); Kulvatunyou, Boonserm [ORNL; Morris, Katherine [National Institute of Standards and Technology (NIST); Harvey, Betty [Electronic Commerce Connection, Inc.

    2006-08-01

    We are building a methodology and tool kit for encoding XML schema Naming and Design Rules (NDRs) in a computer-interpretable fashion, enabling automated rule enforcement and improving schema quality. Through our experience implementing rules from various NDR specifications, we discuss some issues and offer practical guidance to organizations grappling with NDR development.

  19. Recursively-regular subdivisions and applications

    Directory of Open Access Journals (Sweden)

    Rafel Jaume

    2016-05-01

    Full Text Available We generalize regular subdivisions (polyhedral complexes resulting from the projection of the lower faces of a polyhedron introducing the class of recursively-regular subdivisions. Informally speaking, a recursively-regular subdivision is a subdivision that can be obtained by splitting some faces of a regular subdivision by other regular subdivisions (and continue recursively. We also define the finest regular coarsening and the regularity tree of a polyhedral complex. We prove that recursively-regular subdivisions are not necessarily connected by flips and that they are acyclic with respect to the in-front relation. We show that the finest regular coarsening of a subdivision can be efficiently computed, and that whether a subdivision is recursively regular can be efficiently decided. As an application, we also extend a theorem known since 1981 on illuminating space by cones and present connections of recursive regularity to tensegrity theory and graph-embedding problems.     

  20. Adding Recursive Constructs to Bialgebraic Semantics

    DEFF Research Database (Denmark)

    Klin, Bartek

    2004-01-01

    This paper aims at fitting a general class of recursive equations into the framework of ‘well-behaved' structural operational semantics, formalized as bialgebraic semantics by Turi and Plotkin. Rather than interpreting recursive constructs by means of operational rules, separate recursive equations...... are added to semantic descriptions of languages. The equations, together with the remaining rules, are then interpreted in a suitable category and merged by means of certain fixpoint constructions. For a class of recursive equations called regular unfolding rules, this construction yields distributive laws...

  1. Instance-based XML data binding for mobile devices

    CERN Document Server

    Tamayo, Alain; Huerta, Joaquín

    2011-01-01

    XML and XML Schema are widely used in different domains for the definition of standards that enhance the interoperability between parts exchanging information through the Internet. The size and complexity of some standards, and their associated schemas, have been growing with time as new use case scenarios and data models are added to them. The common approach to deal with the complexity of producing XML processing code based on these schemas is the use of XML data binding generators. Unfortunately, these tools do not always produce code that ?ts the limitations of resource-constrained devices, such as mobile phones, in the presence of large schemas. In this paper we present Instance-based XML data binding, an approach to produce compact application-specific XML processing code for mobile devices. The approach utilises information extracted from a set of XML documents about how the application make use of the schemas.

  2. Enhancing XML Data Warehouse Query Performance by Fragmentation

    CERN Document Server

    Mahboubi, Hadj

    2009-01-01

    XML data warehouses form an interesting basis for decision-support applications that exploit heterogeneous data from multiple sources. However, XML-native database systems currently suffer from limited performances in terms of manageable data volume and response time for complex analytical queries. Fragmenting and distributing XML data warehouses (e.g., on data grids) allow to address both these issues. In this paper, we work on XML warehouse fragmentation. In relational data warehouses, several studies recommend the use of derived horizontal fragmentation. Hence, we propose to adapt it to the XML context. We particularly focus on the initial horizontal fragmentation of dimensions' XML documents and exploit two alternative algorithms. We experimentally validate our proposal and compare these alternatives with respect to a unified XML warehouse model we advocate for.

  3. On the Relation between Spector's Bar Recursion and Modified Bar Recursion

    DEFF Research Database (Denmark)

    Oliva, Paulo Borges

    2002-01-01

    We introduce a variant of Spector's Bar Recursion in finite types to give a realizability interpretation of the classical axiom of dependent choice allowing for the extraction of witnesses from proofs of Sigma_1 formulas in classical analysis. We also give a bar recursive definition of the fan...... functional and study the relationship of our variant of Bar Recursion with others....

  4. Helping Students with Recursion: Teaching Strategies. Part III: Teaching Students about Embedded Recursion.

    Science.gov (United States)

    Riordon, Tim

    1984-01-01

    Describes activities designed to teach students about embedded recursion. Topics cover providing intuitions about embedded recursions, predicting embedded recursions, seeing patterns and processes, presenting graphic designs containing embedded copies of themselves, and exploring graphics, numerical, and word examples. Parts I and II are in…

  5. Recursive Optimization of Digital Circuits

    Science.gov (United States)

    1990-12-14

    capability will become increasingly important as the application-specific integrated circuit (ASIC) market continues to meet its rapid growth projections... market (ASIC) continues to grow (18). The recursive optimization system presented in this thesis was developed to inves- tigate a new approach to global...f)) (narg (bar arg)) (fO (divide f narg)) (f1 (divide f arg)) (gO (divide g narg)) (gi (divide g arg)) ( productO (mult fO gO)) (producti (mult fl gl

  6. Evaluating functions using tail recursion and parameter substitution

    Directory of Open Access Journals (Sweden)

    Georges E. Alfaro Salazar

    2016-03-01

    Full Text Available This article shows a general way to implement recursive functions calculation by linear tail recursion. It emphasizes the use of tail recursion to perform computations efficiently.

  7. Using Spreadsheets to Help Students Think Recursively

    Science.gov (United States)

    Webber, Robert P.

    2012-01-01

    Spreadsheets lend themselves naturally to recursive computations, since a formula can be defined as a function of one of more preceding cells. A hypothesized closed form for the "n"th term of a recursive sequence can be tested easily by using a spreadsheet to compute a large number of the terms. Similarly, a conjecture about the limit of a series…

  8. Command Algebras, Recursion and Program Transformation

    NARCIS (Netherlands)

    Hesselink, Wim H.

    1990-01-01

    Dijkstra's language of guarded commands is extended with recursion and transformed into algebra. The semantics is expressed in terms of weakest preconditions and weakest liberal preconditions. Extreme fixed points are used to deal with recursion. Unbounded nondeterminacy is allowed. The algebraic

  9. NONLOCAL SYMMETRIES AND NONLOCAL RECURSION OPERATORS

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    An expose about covering method on differential equations was given. The general formulae to determine nonlocal symmetries were derived which are analogous to the prolongation formulae of generalized symmetries. In addition, a new definition of nonlocal recursion operators was proposed, which gave a satisfactory explalnation in covering theory for the integro-differcntial recursion operators.

  10. The Recursive Paradigm: Suppose We Already Knew.

    Science.gov (United States)

    Maurer, Stephen B.

    1995-01-01

    Explains the recursive model in discrete mathematics through five examples and problems. Discusses the relationship between the recursive model, mathematical induction, and inductive reasoning and the relevance of these concepts in the school curriculum. Provides ideas for approaching this material with students. (Author/DDD)

  11. Object Serialization and Deserialization Using XML

    CERN Document Server

    Le Goff, J M; Hassan, W; Kovács, Z; Martin, P; McClatchey, R; Stockinger, H E; Willers, Ian Malcolm

    2001-01-01

    Interoperability of potentially heterogeneous databases has been an ongoing research issue for a number of years in the database community. With the trend towards globalization of data location and data access and the consequent requirement for the coexistence of new data stores with legacy systems, the cooperation and data interchange between data repositories has become increasingly important. The emergence of the eXtensible Markup Language (XML) as a database independent representation for data offers a suitable mechanism for transporting data between repositories. This paper describes a research activity within a group at CERN (called CMS) towards identifying and implementing database serialization and deserialization methods that can be used to replicate or migrate objects across the network between CERN and worldwide centres using XML to serialize the contents of multiple objects resident in object-oriented databases.

  12. An exponentiation method for XML element retrieval.

    Science.gov (United States)

    Wichaiwong, Tanakorn

    2014-01-01

    XML document is now widely used for modelling and storing structured documents. The structure is very rich and carries important information about contents and their relationships, for example, e-Commerce. XML data-centric collections require query terms allowing users to specify constraints on the document structure; mapping structure queries and assigning the weight are significant for the set of possibly relevant documents with respect to structural conditions. In this paper, we present an extension to the MEXIR search system that supports the combination of structural and content queries in the form of content-and-structure queries, which we call the Exponentiation function. It has been shown the structural information improve the effectiveness of the search system up to 52.60% over the baseline BM25 at MAP.

  13. Internet-based data interchange with XML

    Science.gov (United States)

    Fuerst, Karl; Schmidt, Thomas

    2000-12-01

    In this paper, a complete concept for Internet Electronic Data Interchange (EDI) - a well-known buzzword in the area of logistics and supply chain management to enable the automation of the interactions between companies and their partners - using XML (eXtensible Markup Language) will be proposed. This approach is based on Internet and XML, because the implementation of traditional EDI (e.g. EDIFACT, ANSI X.12) is mostly too costly for small and medium sized enterprises, which want to integrate their suppliers and customers in a supply chain. The paper will also present the results of the implementation of a prototype for such a system, which has been developed for an industrial partner to improve the current situation of parts delivery. The main functions of this system are an early warning system to detect problems during the parts delivery process as early as possible, and a transport following system to pursue the transportation.

  14. KNOWLEDGE AND XML BASED CAPP SYSTEM

    Institute of Scientific and Technical Information of China (English)

    ZHANG Shijie; SONG Laigang

    2006-01-01

    In order to enhance the intelligent level of system and improve the interactivity with other systems, a knowledge and XML based computer aided process planning (CAPP) system is implemented. It includes user management, bill of materials(BOM) management, knowledge based process planning, knowledge management and database maintaining sub-systems. This kind of nesting knowledge representation method the system provided can represent complicated arithmetic and logical relationship to deal with process planning tasks. With the representation and manipulation of XML based technological file, the system solves some important problems in web environment such as information interactive efficiency and refreshing of web page. The CAPP system is written in ASP VBScript, JavaScript, Visual C++ languages and Oracle database. At present, the CAPP system is running in Shenyang Machine Tools. The functions of it meet the requirements of enterprise production.

  15. XML databases and the semantic web

    CERN Document Server

    Thuraisingham, Bhavani

    2002-01-01

    Efficient access to data, sharing data, extracting information from data, and making use of the information have become urgent needs for today''s corporations. With so much data on the Web, managing it with conventional tools is becoming almost impossible. New tools and techniques are necessary to provide interoperability as well as warehousing between multiple data sources and systems, and to extract information from the databases. XML Databases and the Semantic Web focuses on critical and new Web technologies needed for organizations to carry out transactions on the Web, to understand how to use the Web effectively, and to exchange complex documents on the Web.This reference for database administrators, database designers, and Web designers working in tandem with database technologists covers three emerging technologies of significant impact for electronic business: Extensible Markup Language (XML), semi-structured databases, and the semantic Web. The first two parts of the book explore these emerging techn...

  16. Conjugate gradient algorithms using multiple recursions

    Energy Technology Data Exchange (ETDEWEB)

    Barth, T.; Manteuffel, T.

    1996-12-31

    Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuffel gave necessary and sufficient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all possible recursions. This became evident when Jagels and Reichel used an algorithm of Gragg for unitary matrices to demonstrate that the class of matrices for which a practical conjugate gradient algorithm exists can be extended to include unitary and shifted unitary matrices. The implementation uses short double recursions for the direction vectors. This motivates the study of multiple recursion algorithms.

  17. The potential of XML encoding in geomatics converting raster images to XML and SVG

    Science.gov (United States)

    Antoniou, Byron; Tsoulos, Lysandros

    2006-03-01

    The evolution of open standards and especially those pertaining to the family of XML technologies, have a considerable impact on the way the Geomatics community addresses the acquisition, storage, analysis and display of spatial data. The most recent version of the GML specification enables the merging of vector and raster data into a single "open" format. The notion of "coverage" as described in GML 3.0 can be the equivalent of a raster multi-band dataset. In addition, vector data storage is also described in detail through the GML Schemas and XML itself can store the values of a raster dataset, as values of a multi-table dataset. Under these circumstances an issue that must be addressed is the transformation of raster data into XML format and their subsequent visualization through SVG. The objective of this paper is to give an overview of the steps that can be followed in order to embody open standards and XML technologies in the raster domain. The last part of the work refers to a case study that suggests a step by step methodology to accomplish classification, an important function in Cartography and Remote Sensing, using the XML-encoded images.

  18. XML和Web数据库的外模式%XML and Logical Mode of Web Database

    Institute of Scientific and Technical Information of China (English)

    殷锋

    2000-01-01

    提出了一个Web数据库系统的提携结构,采用XML作为数据模型Web数据库系统的用户视图通过例子说明如何在现有Web平台上用XML实现对Web和DBMS的集成,向用户提供XML模型的统一的用户视图.%This article raises one of guiding and supporting structure about the Web database.We use XML as user' s View of database in Web database system, through example to explainhow to realize the integration of Web and DBMS in existent Web balcony. A kind of unifieddatabase's Views in XML mode for user is supplied.

  19. Java ME Clients for XML Web Services

    Directory of Open Access Journals (Sweden)

    Paul POCATILU

    2008-01-01

    Full Text Available Using Web services in developing applications has many advantages like the existence of standards, multiple software platforms that support them, and many areas of usage. These advantages derive from the XML and Web technologies. This paper describes the stages in the development of a Web service client for Java ME platform and presents examples based on kSOAP and JSR 172.

  20. XML Interfaces to the Internet of Things

    OpenAIRE

    Pemberton, Steven

    2015-01-01

    htmlabstractThe internet of things is predicated on tiny, cheap, lower power computers being embedded in devices everywhere. However such tiny devices by definition have very little memory and computing power available to support user interfaces or extended servers, and so the user interface needs to be distributed over the network. This paper describes techniques using standard technologies based on XML for creating remote user interfaces for the Internet of Things

  1. XML Interfaces to the Internet of Things

    OpenAIRE

    Pemberton, Steven; Foster, C.

    2015-01-01

    The internet of things is predicated on tiny, cheap, lower power computers being embedded in devices everywhere. However such tiny devices by definition have very little memory and computing power available to support user interfaces or extended servers, and so the user interface needs to be distributed over the network. This paper describes techniques using standard technologies based on XML for creating remote user interfaces for the Internet of Things

  2. XML for Detector Description at GLAST

    Energy Technology Data Exchange (ETDEWEB)

    Bogart, Joanne

    2002-04-30

    The problem of representing a detector in a form which is accessible to a variety of applications, allows retrieval of information in ways which are natural to those applications, and is maintainable has been vexing physicists for some time. Although invented to address an entirely different problem domain, the document markup meta-language XML is well-suited to detector description. This paper describes its use for a GLAST detector.

  3. XML for Detector Description at GLAST

    Institute of Scientific and Technical Information of China (English)

    J.Bogart; D.Favretto; 等

    2001-01-01

    The problem of representing a detector in a form which is accessible to a variety of applications,allows retrieval of information in ways which are natural to those applications,and is maintainable has been vexing physicists for some time,Although invented to address an entirely different problem domain,the document markup metalanguage XML is well-suited to detector description.This paper describes its use for a GLAST detector.[7

  4. MVC Design Pattern for the multi framework distributed applications using XML, spring and struts framework

    OpenAIRE

    Praveen Gupta; Prof. M.C. Govil

    2010-01-01

    The model view controller (MVC) is a fundamental design pattern for the separation between user interface logic and business logic. Since applications are very large in size these days and the MVC designpattern can weak the coupling among the different application tiers of application. this paper presents a web application framework based on MVC in J2EE platform, and extends it with XML so that the framework is more flexible, expansible and easy to maintain. This is a multi tier system includ...

  5. XML相關技術與下一代Web出版趨勢之研究 A Study on XML-based Technologies and Next-Generation Web Publishing

    Directory of Open Access Journals (Sweden)

    Sinn-cheng Lin

    1999-12-01

    Full Text Available 無XML was completed in 1998 by the W3C. This paper focuses the attention on the issues of the XML-based Web publishing. First of all, the paper describes the essential primaries of the electronic documents, analyses the situation of the Web publishing, explore the difficulties and bottlenecks of HTML. Furthermore, based on the purposes of document access, integration, delivery, manipulation and display, the paper proposes a 3-tier distributed architecture for document management. Which maps the related technologies of XML family, such as DTD, XML Schema, XML Namespaces, RDF, XLink, DOM, CCS and XSL, etc., to the corresponding tiers. It also reflects that XML will plays an important role in the Web integration. If we say that the HTML was the first revolution of the Web, then the XML could be viewed as the second-generation. XML not only provides a new mechanism for data representation, but also has the potential to extend the Internet beyond information delivery to knowledge management. Expectably, XML will cut a generous swath across various application fields, such as electronic publishing, electronic commerce, electronic library, electronic data exchange, and distance learning, etc.

  6. Design of the XML Security System for Electronic Commerce Application

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    The invocation of World Wide Web (www) first triggered mass adoption of the Internet for public access to digital information exchanges across the globe. To get a big market on the Web, a special security infrastructure would need to be put into place transforming the wild-and-woolly Internet into a network with end-to-end protections. XML (extensible Markup Language) is widely accepted as powerful data representation standard for electronic documents, so a security mechanism for XML documents must be provided in the first place to secure electronic commerce over Internet. In this paper the authors design and implement a secure framework that provides XML signature function, XML Element-wise Encryption function, smart card based crypto API library and Public Key Infrastructure (PKI) security functions to achieve confidentiality, integrity, message authentication, and/or signer authentication services for XML documents and existing non-XML documents that are exchanged by Internet for E-commerce application.

  7. The curse of namespaces in the domain of XML signature

    DEFF Research Database (Denmark)

    Jensen, Meiko; Liao, Lijun; Schwenk, Jörg

    2009-01-01

    another way to perform signature wrapping attacks by using the XML namespace injection technique. We show that the interplay of XML Signature, XPath, and the XML namespace concept has severe flaws that can be exploited for an attack, and that XML namespaces in general pose real troubles to digital......The XML signature wrapping attack is one of the most discussed security issues of the Web Services security community during the last years. Until now, the issue has not been solved, and all countermeasure approaches proposed so far were shown to be insufficient. In this paper, we present yet...... signatures in the XML domain. Additionally, we present and discuss some new approaches in countering the proposed attack vector....

  8. An Extended Role Based Access Control Method for XML Documents

    Institute of Scientific and Technical Information of China (English)

    MENG Xiao-feng; LUO Dao-feng; OU Jian-bo

    2004-01-01

    As XML has been increasingly important as the Data-change format of Internet and Intranet, access-control-on-XML-properties rises as a new issue.Role-based access control (RBAC) is an access control method that has been widely used in Internet, Operation System and Relation Data Base these 10 years.Though RBAC is already relatively mature in the above fields, new problems occur when it is used in XML properties.This paper proposes an integrated model to resolve these problems, after the fully analysis on the features of XML and RBAC.

  9. A Semantic Cache Framework for Secure XML Queries

    Institute of Scientific and Technical Information of China (English)

    Jian-Hua Feng; Guo-Liang Li; Na Ta

    2008-01-01

    Secure XML query answering to protect data privacy and semantic cache to speed up XML query answering are two hot spots in current research areas of XML database systems. While both issues are explored respectively in depth,they have not been studied together, that is, the problem of semantic cache for secure XML query answering has not been addressed yet. In this paper, we present an interesting joint of these two aspects and propose an efficient framework of semantic cache for secure XML query answering, which can improve the performance of XML database systems under secure circumstances. Our framework combines access control, user privilege management over XML data and the state-of-the-art semantic XML query cache techniques, to ensure that data are presented only to authorized users in an efficient way. To the best of our knowledge, the approach we propose here is among the first beneficial efforts in a novel perspective of combining caching and security for XML database to improve system performance. The efficiency of our framework is verified by comprehensive experiments.

  10. Integrity Checking and Maintenance with Active Rules in XML Databases

    DEFF Research Database (Denmark)

    Christiansen, Henning; Rekouts, Maria

    2007-01-01

    for the purpose are still rather untested in XML databases. We present the first steps towards a methodology for design and verification of triggers that maintain integrity in XML databases. Starting from a specification of the integrity constraints plus a collection of XPath expressions describing the possible...... updates, the method indicates trigger conditions and correctness criteria to be met by the trigger code supplied by a developer or possibly automatic methods. We show examples developed in the Sedna XML database system which provides a running implementation of XML triggers....

  11. Representing User Navigation in XML Retrieval with Structural Summaries

    DEFF Research Database (Denmark)

    Ali, M. S.; Consens, Mariano P.; Larsen, Birger

    This poster presents a novel way to represent user navigation in XML retrieval using collection statistics from XML summaries. Currently, developing user navigation models in XML retrieval is costly and the models are specific to collected user assessments. We address this problem by proposing...... summary navigation models which describe user navigation in terms of XML summaries. We develop our proposal using assessments collected in the interactive track at INEX 2006. Our preliminary results suggest that summary navigation models can represent user navigation in a way that is e ective...

  12. Processing XML documents with Oracle JDeveloper 11g LITE

    CERN Document Server

    Vohra, Deepak

    2011-01-01

    Employing a comprehensive tutorial-based approach, this easy-to-follow book shows the reader various means of processing XML documents using the power of Oracle's JDeveloper 11g. The material has been carefully selected from Packt's fuller 384 page Processing XML documents with Oracle JDeveloper 11g. This book is for newcomer and intermediate Java developers who want to work with XML documents using JDeveloper 11g. No previous knowledge of JDeveloper is assumed but the reader will need to be comfortable in XML and Java environments.

  13. Declarative XML Update Language Based on a Higher Data Model

    Institute of Scientific and Technical Information of China (English)

    Guo-Ren Wang; Xiao-Lin Zhang

    2005-01-01

    With the extensive use of XML in applications over the Web, how to update XML data is becoming an important issue because the role of XML has expanded beyond traditional applications in which XML is used for information exchange and data representation over the Web. So far, several languages have been proposed for updating XML data, but they are all based on lower, so-called graph-based or tree-based data models. Update requests are thus expressed in a nonintuitive and unnatural way and update statements are too complicated to comprehend. This paper presents a novel declarative XML update language which is an extension of the XML-RL query language. Compared with other existing XML update languages, it has the following features. First, it is the only XML data manipulation language based on a higher data model. Second, this language can express complex update requests at multiple levels in a hierarchy in a simple and flat way. Third, this language directly supports the functionality of updating complex objects while all other update languages do not support these operations. Lastly, most of existing languages use rename to modify attribute and element names, which is a different way from updates on value. The proposed language modifies tag names, values, and objects in a unified way by the introduction of three kinds of logical binding variables: object variables, value variables, and name variables.

  14. XIDM: A Common Data Model Based on XML

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    Integration between file systems and multidatabase systems is anecess ary approach to support data sharing from distributed and heterogeneous data sou rces. We first analyses problems about data integration between f ile systems and multidatabase systems. Then, A common data model named XIDM(XML-based Integrating Dada Model), whi ch is XML-oriented, is presented. XIDM bases on a series of XML standards, espe c ially XML Schema, and can well describe semistructured data. So XIDM is powerful ly practicable and multipurpose.

  15. Recursive sequences in first-year calculus

    Science.gov (United States)

    Krainer, Thomas

    2016-02-01

    This article provides ready-to-use supplementary material on recursive sequences for a second-semester calculus class. It equips first-year calculus students with a basic methodical procedure based on which they can conduct a rigorous convergence or divergence analysis of many simple recursive sequences on their own without the need to invoke inductive arguments as is typically required in calculus textbooks. The sequences that are accessible to this kind of analysis are predominantly (eventually) monotonic, but also certain recursive sequences that alternate around their limit point as they converge can be considered.

  16. An XML-Enabled Data Mining Query Language XML-DMQL

    NARCIS (Netherlands)

    Feng, L.; Dillon, T.

    2005-01-01

    Inspired by the good work of Han et al. (1996) and Elfeky et al. (2001) on the design of data mining query languages for relational and object-oriented databases, in this paper, we develop an expressive XML-enabled data mining query language by extension of XQuery. We first describe some preliminari

  17. An XML-Enabled Data Mining Query Language XML-DMQL

    NARCIS (Netherlands)

    Feng, L.; Dillon, T.

    2005-01-01

    Inspired by the good work of Han et al. (1996) and Elfeky et al. (2001) on the design of data mining query languages for relational and object-oriented databases, in this paper, we develop an expressive XML-enabled data mining query language by extension of XQuery. We first describe some

  18. An XML-Enabled Data Mining Query Language XML-DMQL

    NARCIS (Netherlands)

    Feng, L.; Dillon, T.

    2005-01-01

    Inspired by the good work of Han et al. (1996) and Elfeky et al. (2001) on the design of data mining query languages for relational and object-oriented databases, in this paper, we develop an expressive XML-enabled data mining query language by extension of XQuery. We first describe some preliminari

  19. Denotational semantics of recursive types in synthetic guarded domain theory

    DEFF Research Database (Denmark)

    Møgelberg, Rasmus Ejlers; Paviotti, Marco

    2016-01-01

    Guarded recursion is a form of recursion where recursive calls are guarded by delay modalities. Previous work has shown how guarded recursion is useful for reasoning operationally about programming languages with advanced features including general references, recursive types, countable non...... typed lambda calculus with fixed points). This model was intensional in that it could distinguish between computations computing the same result using a different number of fixed point unfoldings. In this work we show how also programming languages with recursive types can be given denotational...... semantics in type theory with guarded recursion. More precisely, we give a computationally adequate denotational semantics to the language FPC (simply typed lambda calculus extended with recursive types), modelling recursive types using guarded recursive types. The model is intensional in the same way...

  20. Is recursion language-specific? Evidence of recursive mechanisms in the structure of intentional action.

    Science.gov (United States)

    Vicari, Giuseppe; Adenzato, Mauro

    2014-05-01

    In their 2002 seminal paper Hauser, Chomsky and Fitch hypothesize that recursion is the only human-specific and language-specific mechanism of the faculty of language. While debate focused primarily on the meaning of recursion in the hypothesis and on the human-specific and syntax-specific character of recursion, the present work focuses on the claim that recursion is language-specific. We argue that there are recursive structures in the domain of motor intentionality by way of extending John R. Searle's analysis of intentional action. We then discuss evidence from cognitive science and neuroscience supporting the claim that motor-intentional recursion is language-independent and suggest some explanatory hypotheses: (1) linguistic recursion is embodied in sensory-motor processing; (2) linguistic and motor-intentional recursions are distinct and mutually independent mechanisms. Finally, we propose some reflections about the epistemic status of HCF as presenting an empirically falsifiable hypothesis, and on the possibility of testing recursion in different cognitive domains.

  1. Simple Recursion Relations for General Field Theories

    CERN Document Server

    Cheung, Clifford; Trnka, Jaroslav

    2015-01-01

    On-shell methods offer an alternative definition of quantum field theory at tree-level, replacing Feynman diagrams with recursion relations and interaction vertices with a handful of seed scattering amplitudes. In this paper we determine the simplest recursion relations needed to construct a general four-dimensional quantum field theory of massless particles. For this purpose we define a covering space of recursion relations which naturally generalizes all existing constructions, including those of BCFW and Risager. The validity of each recursion relation hinges on the large momentum behavior of an n-point scattering amplitude under an m-line momentum shift, which we determine solely from dimensional analysis, Lorentz invariance, and locality. We show that all amplitudes in a renormalizable theory are 5-line constructible. Amplitudes are 3-line constructible if an external particle carries spin or if the scalars in the theory carry equal charge under a global or gauge symmetry. Remarkably, this implies the 3-...

  2. Gaussian process based recursive system identification

    Science.gov (United States)

    Prüher, Jakub; Šimandl, Miroslav

    2014-12-01

    This paper is concerned with the problem of recursive system identification using nonparametric Gaussian process model. Non-linear stochastic system in consideration is affine in control and given in the input-output form. The use of recursive Gaussian process algorithm for non-linear system identification is proposed to alleviate the computational burden of full Gaussian process. The problem of an online hyper-parameter estimation is handled using proposed ad-hoc procedure. The approach to system identification using recursive Gaussian process is compared with full Gaussian process in terms of model error and uncertainty as well as computational demands. Using Monte Carlo simulations it is shown, that the use of recursive Gaussian process with an ad-hoc learning procedure offers converging estimates of hyper-parameters and constant computational demands.

  3. Interpretations of Recursion under Unbounded Nondeterminacy

    NARCIS (Netherlands)

    Hesselink, Wim H.

    1988-01-01

    A language is constructed that supports arbitrary atomic statements, composition, alternatives, and mutual recursion in the presence of unbounded nondeterminacy. The concept of interpretation is defined axiomatically. By operational means a standard interpretation is constructed, which is proved to

  4. Certain Binomial Sums with recursive coefficients

    CERN Document Server

    Kilic, Emrah

    2010-01-01

    In this short note, we establish some identities containing sums of binomials with coefficients satisfying third order linear recursive relations. As a result and in particular, we obtain general forms of earlier identities involving binomial coefficients and Fibonacci type sequences.

  5. XVCL: XML-based Variant Configuration Language

    DEFF Research Database (Denmark)

    Jarzabek, Stan; Basset, Paul; Zhang, Hongyu;

    2003-01-01

    XVCL (XML-based Variant Configuration Language) is a meta-programming technique and tool that provides effective reuse mechanisms. XVCL is an open source software developed at the National University of Singapore. Being a modern and versatile version of Bassett's frames, a technology that has...... achieved substantial gains in industry, the underlying principles of the XVCL have been thoroughly tested in practice. We envision many other applications in software and non-software domains, as we can apply XVCL to any domain that can be represented as a collection of textual documents....

  6. IR and OLAP in XML document warehouses

    DEFF Research Database (Denmark)

    Perez, Juan Manuel; Pedersen, Torben Bach; Berlanga, Rafael

    2005-01-01

    In this paper we propose to combine IR and OLAP (On-Line Analytical Processing) technologies to exploit a warehouse of text-rich XML documents. In the system we plan to develop, a multidimensional implementation of a relevance modeling document model will be used for interactively querying...... the warehouse by allowing navigation in the structure of documents and in a concept hierarchy of query terms. The facts described in the relevant documents will be ranked and analyzed in a novel OLAP cube model able to represent and manage facts with relevance indexes....

  7. Recursive Inversion Of Externally Defined Linear Systems

    Science.gov (United States)

    Bach, Ralph E., Jr.; Baram, Yoram

    1992-01-01

    Technical memorandum discusses mathematical technique described in "Recursive Inversion by Finite-Impulse-Response Filters" (ARC-12247). Technique is recursive algorithm yielding finite-impulse-response approximation of unknown single-input/single-output, causal, time-invariant, linear, real system, response of which is sequence of impulses. Useful in such diverse applications as medical diagnoses, identification of military targets, geophysical exploration, and nondestructive testing.

  8. Solutions of the motivic ADHM recursion formula

    CERN Document Server

    Mozgovoy, Sergey

    2011-01-01

    We give an explicit solution of the ADHM recursion formula conjectured by Chuang, Diaconescu, and Pan. This solution is closely related to the formula for the Hodge polynomials of Higgs moduli spaces conjectured by Hausel and Rodriguez-Villegas. We solve also the twisted motivic ADHM recursion formula. As a byproduct we obtain a conjectural formula for the motives of twisted Higgs moduli spaces, which generalizes the conjecture of Hausel and Rodriguez-Villegas.

  9. Recursions for the Individual Risk Model

    Institute of Scientific and Technical Information of China (English)

    Jan Dhaene; Carmen Ribas; Raluca Vernic

    2006-01-01

    In the actuarial literature, several exact and approximative recursive methods have been proposed for calculating the distribution of a sum of mutually independent compound Bernoulli distributed random variables. In this paper, we give an overview of these methods. We compare their performance with the straightforward convolution technique by counting the number of dot operations involved in each method. It turns out that in many practicle situations, the recursive methods outperform the convolution method.

  10. An Agent Communication Framework Based on XML and SOAP Technique

    Institute of Scientific and Technical Information of China (English)

    李晓瑜

    2009-01-01

    This thesis introducing XML technology and SOAP technology,present an agent communication fi-amework based on XML and SOAP technique,and analyze the principle,architecture,function and benefit of it. At the end, based on KQML communication primitive lan- guages.

  11. A Runtime System for XML Transformations in Java

    DEFF Research Database (Denmark)

    Christensen, Aske Simon; Kirkegaard, Christian; Møller, Anders

    2004-01-01

    We show that it is possible to extend a general-purpose programming language with a convenient high-level data-type for manipulating XML documents while permitting (1) precise static analysis for guaranteeing validity of the constructed XML documents relative to the given DTD schemas, and (2...

  12. EquiX-A Search and Query Language for XML.

    Science.gov (United States)

    Cohen, Sara; Kanza, Yaron; Kogan, Yakov; Sagiv, Yehoshua; Nutt, Werner; Serebrenik, Alexander

    2002-01-01

    Describes EquiX, a search language for XML that combines querying with searching to query the data and the meta-data content of Web pages. Topics include search engines; a data model for XML documents; search query syntax; search query semantics; an algorithm for evaluating a query on a document; and indexing EquiX queries. (LRW)

  13. Streaming-based verification of XML signatures in SOAP messages

    DEFF Research Database (Denmark)

    Somorovsky, Juraj; Jensen, Meiko; Schwenk, Jörg

    2010-01-01

    approach for XML processing, the Web Services servers easily become a target of Denial-of-Service attacks. We present a solution for these problems: an external streaming-based WS-Security Gateway. Our implementation is capable of processing XML Signatures in SOAP messages using a streaming-based approach...

  14. Algebra-Based Optimization of XML-Extended OLAP Queries

    DEFF Research Database (Denmark)

    Yin, Xuepeng; Pedersen, Torben Bach

    2006-01-01

    In today’s OLAP systems, integrating fast changing data physically into a cube is complex and time-consuming. Our solution, the “OLAP-XML Federation System,” makes it possible to reference the fast changing data in XML format in OLAP queries without physical integration. In this paper, we introdu...

  15. An Expressive and Efficient Language for XML Information Retrieval.

    Science.gov (United States)

    Chinenyanga, Taurai Tapiwa; Kushmerick, Nicholas

    2002-01-01

    Discusses XML and information retrieval and describes a query language, ELIXIR (expressive and efficient language for XML information retrieval), with a textual similarity operator that can be used for similarity joins. Explains the algorithm for answering ELIXIR queries to generate intermediate relational data. (Author/LRW)

  16. The appropriateness of XML for diagnostic description

    Energy Technology Data Exchange (ETDEWEB)

    Neto, A. [Associacao Euratom/IST, Centro de Fusao Nuclear, Av. Rovisco Pais, P-1049-001 Lisboa (Portugal)], E-mail: andre.neto@cfn.ist.utl.pt; Lister, J.B. [CRPP-EPFL, Association EURATOM-Confederation Suisse, 1015 Lausanne (Switzerland); Fernandes, H. [Associacao Euratom/IST, Centro de Fusao Nuclear, Av. Rovisco Pais, P-1049-001 Lisboa (Portugal); Yonekawa, I. [JAEA, Japan Atomic Energy Agency Naka (Japan); Varandas, C.A.F. [Associacao Euratom/IST, Centro de Fusao Nuclear, Av. Rovisco Pais, P-1049-001 Lisboa (Portugal)

    2007-10-15

    A standard for the self-description of fusion plasma diagnostics will be required in the near future. The motivation is to maintain and organize the information on all the components of a laboratory experiment, from the hardware to the access security, to save time and money. Since there is no existing standard to organize this kind of information, every EU Association stores and organizes each experiment in different ways. This can lead to severe problems when the particular organization schema is poorly documented. Standardization is the key to solve these problems. From the commercial information on the diagnostic (component supplier; component price) to the hardware description (component specifications; drawings) to the operation of the equipment (finite state machines) through change control (who changed what and when) and internationalization (information at least in English and a local language). This problem will be met on the ITER project, for which a solution is essential. A strong candidate solution is the Extensible Markup Language (XML). In this paper, a review of the current status of XML related technologies will be presented.

  17. Data Mining-based Fragmentation of XML Data Warehouses

    CERN Document Server

    Mahboubi, Hadj

    2008-01-01

    With the multiplication of XML data sources, many XML data warehouse models have been proposed to handle data heterogeneity and complexity in a way relational data warehouses fail to achieve. However, XML-native database systems currently suffer from limited performances, both in terms of manageable data volume and response time. Fragmentation helps address both these issues. Derived horizontal fragmentation is typically used in relational data warehouses and can definitely be adapted to the XML context. However, the number of fragments produced by classical algorithms is difficult to control. In this paper, we propose the use of a k-means-based fragmentation approach that allows to master the number of fragments through its $k$ parameter. We experimentally compare its efficiency to classical derived horizontal fragmentation algorithms adapted to XML data warehouses and show its superiority.

  18. Distributed Learning over Massive XML Documents in ELM Feature Space

    Directory of Open Access Journals (Sweden)

    Xin Bi

    2015-01-01

    Full Text Available With the exponentially increasing volume of XML data, centralized learning solutions are unable to meet the requirements of mining applications with massive training samples. In this paper, a solution to distributed learning over massive XML documents is proposed, which provides distributed conversion of XML documents into representation model in parallel based on MapReduce and a distributed learning component based on Extreme Learning Machine for mining tasks of classification or clustering. Within this framework, training samples are converted from raw XML datasets with better efficiency and information representation ability and taken to distributed learning algorithms in Extreme Learning Machine (ELM feature space. Extensive experiments are conducted on massive XML documents datasets to verify the effectiveness and efficiency for both classification and clustering applications.

  19. X-RESTORE: Middleware for XML's Relational Storage and Retrieve

    Institute of Scientific and Technical Information of China (English)

    Wan Chang-xuan; Liu Yun-sheng

    2003-01-01

    We propose a new approach to store and query XML data in an RDBMS basing on the idea of the numbering scheme and inverted list. Our approach allows us to quickly determine the precedence, sibling and ancestor/descendant relationships between any pair of nodes in the hierarchy of XML, and utilize path index to speed up calculating of path expressions. Examples have demonstrated that our approach can effectively and efficiently support both XQuery queries and keyword searches. Our approach is also flexible enough to support XML documents both with Schema and without Schema, and applications both retrieval and update. We also present the architecture of middleware for application accessing XML documents stored in relations, and an algorithm translating a given XML document into relations effectively.

  20. X-RESTORE:Middleware for XML's Relational Storage and Retrieve

    Institute of Scientific and Technical Information of China (English)

    Wan; Chang-xuan; Liu; Yun-Sheng

    2003-01-01

    We propose a new approach to store and query XML data in an RDBMS basing on the idea of the numbering scheme and inverted list. Our approach allows us to quickly determine the precedence, sibling and ancestor/descendant relationships between any pair of nodes in the hierarchy of XML, and utilize path index to speed up calculating of path expressions. Examples have demonstrated that our approach can effectively and efficiently support both XQuery queries and keyword searches. our approach is also flexible enough to support XML documents both with Schema and without Schema, and applications both retrieval and update. We also present the architecture of middleware for application accessing XML documents stored in relations, and an algorithm translating a given XML document into relation effectively.

  1. xmlTRAM +:an XML-based tool for management of requirements and architectures

    Institute of Scientific and Technical Information of China (English)

    吴洁; 丁秋林

    2004-01-01

    Information systems have been increasingly used in all aspects of organization's business activities. These systems will inevitably evolve over time. The system development knowledge is a key to the understanding and evolution of these systems. As such, the system development knowledge is a part of the corporate knowledge that needs to be properly managed. In particular, the system requirements and architecture design are the most important system development knowledge. An XML-based tool for managing system requirements and architectures is introduced. The use of the XML technology allows the system requirements and architectures to be easily shared across the organization. The issues discussed include a conceptual model, a logical model and a physical model for the management of system requirements and architectures. In fact, this three-step development process provides a typical methodology for the development of XMLbased systems.

  2. The Language Faculty that Wasn't: A Usage-Based Account of Natural Language Recursion

    Directory of Open Access Journals (Sweden)

    Morten H Christiansen

    2015-08-01

    Full Text Available In the generative tradition, the language faculty has been shrinking—perhaps to include only the mechanism of recursion. This paper argues that even this view of the language faculty is too expansive. We first argue that a language faculty is difficult to reconcile with evolutionary considerations. We then focus on recursion as a detailed case study, arguing that our ability to process recursive structure does not rely on recursion as a property of the grammar, but instead emerge gradually by piggybacking on domain-general sequence learning abilities. Evidence from genetics, comparative work on non-human primates, and cognitive neuroscience suggests that humans have evolved complex sequence learning skills, which were subsequently pressed into service to accommodate language. Constraints on sequence learning therefore have played an important role in shaping the cultural evolution of linguistic structure, including our limited abilities for processing recursive structure. Finally, we re-evaluate some of the key considerations that have often been taken to require the postulation of a language faculty.

  3. The language faculty that wasn't: a usage-based account of natural language recursion.

    Science.gov (United States)

    Christiansen, Morten H; Chater, Nick

    2015-01-01

    In the generative tradition, the language faculty has been shrinking-perhaps to include only the mechanism of recursion. This paper argues that even this view of the language faculty is too expansive. We first argue that a language faculty is difficult to reconcile with evolutionary considerations. We then focus on recursion as a detailed case study, arguing that our ability to process recursive structure does not rely on recursion as a property of the grammar, but instead emerges gradually by piggybacking on domain-general sequence learning abilities. Evidence from genetics, comparative work on non-human primates, and cognitive neuroscience suggests that humans have evolved complex sequence learning skills, which were subsequently pressed into service to accommodate language. Constraints on sequence learning therefore have played an important role in shaping the cultural evolution of linguistic structure, including our limited abilities for processing recursive structure. Finally, we re-evaluate some of the key considerations that have often been taken to require the postulation of a language faculty.

  4. An XML-hierarchical data structure for ENSDF

    Energy Technology Data Exchange (ETDEWEB)

    Hurst, Aaron M. [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States)

    2016-03-15

    A data structure based on an eXtensible Markup Language (XML) hierarchy according to experimental nuclear structure data in the Evaluated Nuclear Structure Data File (ENSDF) is presented. A Python-coded translator has been developed to interpret the standard one-card records of the ENSDF datasets, together with their associated quantities defined according to field position, and generate corresponding representative XML output. The quantities belonging to this mixed-record format are described in the ENSDF manual. Of the 16 ENSDF records in total, XML output has been successfully generated for 15 records. An XML-translation for the Comment Record is yet to be implemented; this will be considered in a separate phase of the overall translation effort. Continuation records, not yet implemented, will also be treated in a future phase of this work. Several examples are presented in this document to illustrate the XML schema and methods for handling the various ENSDF data types. However, the proposed nomenclature for the XML elements and attributes need not necessarily be considered as a fixed set of constructs. Indeed, better conventions may be suggested and a consensus can be achieved amongst the various groups of people interested in this project. The main purpose here is to present an initial phase of the translation effort to demonstrate the feasibility of interpreting ENSDF datasets and creating a representative XML-structured hierarchy for data storage.

  5. A Scheme for Evaluating XML Engine on RDBMS

    Directory of Open Access Journals (Sweden)

    Guannan Si

    2011-03-01

    Full Text Available There are an increasing number of DBMS vendors thinking of integrating XML data management into traditional relational database, with wider use of XML. In this case, a comprehensive evaluation methodology is needed to evaluate the XML engine in RDBMS correctly. In this paper, we analyze the characteristics of XML engine and propose an evaluation strategy of XML engine in a RDBMS. We believe that the evaluation should include functional evaluation and performance evaluation, and cover several major aspects of DB such as storage, query and update. Then we designed an evaluation scheme for the XML engine in RDBMS according the strategy. The scheme describes an evaluation scene and contains a data set, workload and index set. The data set reflects the characteristics of both data-centric and document-centric XML data. The workload covers all of the requirements of XQuery in W3C. The index set covers the aspects of storage, indexing, query and update. In the end, we complete an experiment to test an actual computer system using the proposal. The result shows that the proposal is proper.

  6. Dynamically Generated Interfaces in XML Based Architecture

    CERN Document Server

    Gupta, Minit

    2009-01-01

    Providing on-line services on the Internet will require the definition of flexible interfaces that are capable of adapting to the user's characteristics. This is all the more important in the context of medical applications like home monitoring, where no two patients have the same medical profile. Still, the problem is not limited to the capacity of defining generic interfaces, as has been made possible by UIML, but also to define the underlying information structures from which these may be generated. The DIATELIC project deals with the tele-monitoring of patients under peritoneal dialysis. By means of XML abstractions, termed as "medical components", to represent the patient's profile, the application configures the customizable properties of the patient's interface and generates a UIML document dynamically. The interface allows the patient to feed the data manually or use a device which allows "automatic data acquisition". The acquired medical data is transferred to an expert system, which analyses the dat...

  7. Towards privacy-preserving XML transformation

    DEFF Research Database (Denmark)

    Jensen, Meiko; Kerschbaum, Florian

    2011-01-01

    In composite web services one can only either hide the identities of the participants or provide end-to-end confidentiality via encryption. For a designer of inter organizational business processes this implies that she either needs to reveal her suppliers or force her customers to reveal...... their information. In this paper we present a solution to the encrypted data modification problem and reconciliate this apparent conflict. Using a generic sender-transformer-recipient example scenario, we illustrate the steps required for applying XML transformations to encrypted data, present the cryptographic...... building blocks, and give an outlook on advantages and weaknesses of the proposed encryption scheme. The transformer is then able to offer composite services without itself learning the content of the messages. © 2011 IEEE....

  8. The version control service for ATLAS data acquisition configuration filesDAQ ; configuration ; OKS ; XML

    CERN Document Server

    Soloviev, Igor; The ATLAS collaboration

    2012-01-01

    To configure data taking session the ATLAS systems and detectors store more than 160 MBytes of data acquisition related configuration information in OKS XML files. The total number of the files exceeds 1300 and they are updated by many system experts. In the past from time to time after such updates we had experienced problems caused by XML syntax errors or inconsistent state of files from a point of view of the overall ATLAS configuration. It was not always possible to know who made a modification causing problems or how to go back to a previous version of the modified file. Few years ago a special service addressing these issues has been implemented and deployed on ATLAS Point-1. It excludes direct write access to XML files stored in a central database repository. Instead, for an update the files are copied into a user repository, validated after modifications and committed using a version control system. The system's callback updates the central repository. Also, it keeps track of all modifications providi...

  9. XML Database Researching%XML数据库技术研究

    Institute of Scientific and Technical Information of China (English)

    秦杰; 杨树强; 窦文华

    2003-01-01

    XML database is a new database technology. This paper gives an overview about the last research aboutXML database and its related productions,then comparing XML database with traditional RDBMS. We analyze andpoint out some weaknesses about XML database,and give out our viewpoint.

  10. DESIGN OF A SECURE FRAMEWORK TO SECURELYEXCHANGE(XML-BASED) DOCUMENTS OVER THE INTERNET

    Institute of Scientific and Technical Information of China (English)

    安南; 张申生

    2002-01-01

    This paper designed and implemented a secure framework that provides XML signature function, XML element-wise encryption function, smart card based crypto API library and Public Key Infrastructure (PKI) security functions to achieve confidentiality, integrity, message authentication, and/or signer authentication services for XML documents and existing non-XML documents that are exchanged by Internet for e-commerce application.

  11. Anharmonic resonances with recursive delay feedback

    Energy Technology Data Exchange (ETDEWEB)

    Goldobin, Denis S., E-mail: Denis.Goldobin@gmail.com [Department of Mathematics, University of Leicester, Leicester LE1 7RH (United Kingdom); Institute of Continuous Media Mechanics, UB RAS, Perm 614013 (Russian Federation)

    2011-09-12

    We consider application of time-delayed feedback with infinite recursion for control of anharmonic (nonlinear) oscillators subject to noise. In contrast to the case of a single delay feedback, recursive delay feedback exhibits resonances between feedback and nonlinear harmonics, leading to a resonantly strong or weak oscillation coherence even for a small anharmonicity. Remarkably, these small-anharmonicity induced resonances can be stronger than the harmonic ones. Analytical results are confirmed numerically for van der Pol and van der Pol-Duffing oscillators. -- Highlights: → We construct general theory of noisy limit-cycle oscillators with linear feedback. → We focus on coherence and 'reliability' of oscillators. → For recursive delay feedback control the theory shows importance of anharmonicity. → Anharmonic resonances are studied both numerically and analytically.

  12. Recursion and feedback in image algebra

    Science.gov (United States)

    Ritter, Gerhard X.; Davidson, Jennifer L.

    1991-04-01

    Recursion and feedback are two important processes in image processing. Image algebra, a unified algebraic structure developed for use in image processing and image analysis, provides a common mathematical environment for expressing image processing transforms. It is only recently that image algebra has been extended to include recursive operations [1]. Recently image algebra was shown to incorporate neural nets [2], including a new type of neural net, the morphological neural net [3]. This paper presents the relationship of the recursive image algebra to the field of fractions of the ring of matrices, and gives the two dimensional moving average filter as an example. Also, the popular multilayer perceptron with back propagation and a morphology neural network with learning rule are presented in image algebra notation. These examples show that image algebra can express these important feedback concepts in a succinct way.

  13. Estimating similarity of XML Schemas using path similarity measure

    Directory of Open Access Journals (Sweden)

    Veena Trivedi

    2012-07-01

    Full Text Available In this paper, an attempt has been made to develop an algorithm which estimates the similarity for XML Schemas using multiple similarity measures. For performing the task, the XML Schema element information has been represented in the form of string and four different similarity measure approaches have been employed. To further improve the similarity measure, an overall similarity measure has also been calculated. The approach used in this paper is a distinguished one, as it calculates the similarity between two XML schemas using four approaches and gives an integrated values for the similarity measure. Keywords-componen

  14. Functional Dependencies and Its Axiom System in XML

    Institute of Scientific and Technical Information of China (English)

    ZHAO Xiangguo; WANG Guoren; HOU Huan; DING Dabin

    2007-01-01

    According to the analysis of existing complicated functional dependencies constraint, we conclude the conditions of defining functional dependency in XML, and then we introduce the concept of the node value equality. Anew path language and a new definition of functional dependencies in XML (XFD) are proposed.XFD includes the relative XFD and the absolute XFD, in which absolute key and relative key are the particular cases. We focus on the logical implication and the closure problems, and propose a group of inference rules. Finally, some proofs of the correctness and completeness are given. XFD is powerful on expressing functional dependencies in XML causing data redundancy, and has a complete axiom system.

  15. Static Analysis for Event-Based XML Processing

    DEFF Research Database (Denmark)

    Møller, Anders

    2008-01-01

    Event-based processing of XML data - as exemplified by the popular SAX framework - is a powerful alternative to using W3C's DOM or similar tree-based APIs. The event-based approach is a streaming fashion with minimal memory consumption. This paper discusses challenges for creating program analyses...... for SAX applications. In particular, we consider the problem of statically guaranteeing the a given SAX program always produces only well-formed and valid XML output. We propose an analysis technique based on ecisting anglyses of Servlets, string operations, and XML graphs....

  16. Gestione del rischio valanghe e sue applicazioni XML

    Directory of Open Access Journals (Sweden)

    Igor Chiambretti

    2010-03-01

    Full Text Available Avalanche risk management and XML applicationsThe most powerful tool for early warning and mitigating the risk of an avalanche has arisen in the last few years. A standard application model has been already accepted at Open Geospatial Consortium. When CAAML, as model for structured electronic exchange of avalanche related information, will become also standard at European community, public avalanche bulletins and professional network observations could be shared at regional and national level among organizations promoting safety services and avalanche awareness such as AINEVA and METEOMONT. This system will create a common platform for professional and public information exchanges that will open doors to a wide array of opportunities for data sharing, viewing and analyzing based on WFS/WMS services.

  17. Recursively arbitrarily vertex-decomposable suns

    Directory of Open Access Journals (Sweden)

    Olivier Baudon

    2011-01-01

    Full Text Available A graph \\(G = (V,E\\ is arbitrarily vertex decomposable if for any sequence \\(\\tau\\ of positive integers adding up to \\(|V|\\, there is a sequence of vertex-disjoint subsets of \\(V\\ whose orders are given by \\(\\tau\\, and which induce connected graphs. The aim of this paper is to study the recursive version of this problem on a special class of graphs called suns. This paper is a complement of [O. Baudon, F. Gilbert, M. Woźniak, Recursively arbitrarily vertex-decomposable graphs, research report, 2010].

  18. On-shell recursion relations for gravity

    Science.gov (United States)

    Hall, Anthony

    2008-06-01

    We extend the argument presented by Benincasa, Boucher-Veronneau, and Cachazo to show that graviton tree amplitudes are well behaved under large complex deformations of the momenta of a pair of like-helicity gravitons. This shows that Britto-Cachazo-Feng-Witten recursion relations for gravity amplitudes can be constructed using such shifts, providing an alternative proof to the recent one by Arkani-Hamed and Kaplan. By using auxiliary recursion relations the cancellations which are hidden when using covariant Feynman diagrams become manifest.

  19. New recursive algorithm for matrix inversion

    Institute of Scientific and Technical Information of China (English)

    Cao Jianshu; Wang Xuegang

    2008-01-01

    To reduce the computational complexity of matrix inversion, which is the majority of processing in many practical applications, two numerically efficient recursive algorithms (called algorithms Ⅰ and Ⅱ, respectively)are presented. Algorithm Ⅰ is used to calculate the inverse of such a matrix, whose leading principal minors are all nonzero. Algorithm Ⅱ, whereby, the inverse of an arbitrary nonsingular matrix can be evaluated is derived via improving the algorithm Ⅰ. The implementation, for algorithm Ⅱ or Ⅰ, involves matrix-vector multiplications and vector outer products. These operations are computationally fast and highly parallelizable. MATLAB simulations show that both recursive algorithms are valid.

  20. Adaptable Iterative and Recursive Kalman Filter Schemes

    Science.gov (United States)

    Zanetti, Renato

    2014-01-01

    Nonlinear filters are often very computationally expensive and usually not suitable for real-time applications. Real-time navigation algorithms are typically based on linear estimators, such as the extended Kalman filter (EKF) and, to a much lesser extent, the unscented Kalman filter. The Iterated Kalman filter (IKF) and the Recursive Update Filter (RUF) are two algorithms that reduce the consequences of the linearization assumption of the EKF by performing N updates for each new measurement, where N is the number of recursions, a tuning parameter. This paper introduces an adaptable RUF algorithm to calculate N on the go, a similar technique can be used for the IKF as well.

  1. A Survey on Teaching and Learning Recursive Programming

    National Research Council Canada - National Science Library

    Christian RINDERKNECHT

    2014-01-01

    .... After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a review of textbooks and some...

  2. The recursion operator for a constrained CKP hierarchy

    CERN Document Server

    Li, Chuanzhong; He, Jingsong; Cheng, Yi

    2010-01-01

    This paper gives a recursion operator for a 1-constrained CKP hierarchy, and by the recursion operator it proves that the 1-constrained CKP hierarchy can be reduced to the mKdV hierarchy under condition $q=r$.

  3. The recursion operator for a constrained CKP hierarchy

    OpenAIRE

    Li, Chuanzhong; Tian, Kelei; He, Jingsong; Cheng, Yi

    2010-01-01

    This paper gives a recursion operator for a 1-constrained CKP hierarchy, and by the recursion operator it proves that the 1-constrained CKP hierarchy can be reduced to the mKdV hierarchy under condition $q=r$.

  4. XML-RPC技术及其应用分析%Analysis of XML-RPC Technology and Its Application

    Institute of Scientific and Technical Information of China (English)

    姚鹤岭

    2005-01-01

    为了说明XML-RPC技术在特定场合的应用价值,介绍了基于XML语言的XML-RPC分布式技术的概念与特点,在编写Meerkat客户端程序时,使用Python语言实现了类似ArcWeb服务的功能.研究表明:XML-RPC技术在一定条件下能够很好地满足不同应用间的通信与互操作的需求.

  5. Health Topic XML File Description: MedlinePlus

    Science.gov (United States)

    ... Here: Home → Health Topic XML File Description: MedlinePlus URL of this page: https://medlineplus.gov/xmldescription.html ... on MedlinePlus: Not used for the public site. url - the topic URL. The URL for the corresponding ...

  6. IMPROVED COMPRESSION OF XML FILES FOR FAST IMAGE TRANSMISSION

    Directory of Open Access Journals (Sweden)

    S. Manimurugan

    2011-02-01

    Full Text Available The eXtensible Markup Language (XML is a format that is widely used as a tool for data exchange and storage. It is being increasingly used in secure transmission of image data over wireless network and World Wide Web. Verbose in nature, XML files can be tens of megabytes long. Thus, to reduce their size and to allow faster transmission, compression becomes vital. Several general purpose compression tools have been proposed without satisfactory results. This paper proposes a novel technique using modified BWT for compressing XML files in a lossless fashion. The experimental results show that the performance of the proposed technique outperforms both general purpose and XML-specific compressors.

  7. Algebraic Modeling of Information Retrieval in XML Documents

    Science.gov (United States)

    Georgiev, Bozhidar; Georgieva, Adriana

    2009-11-01

    This paper presents an information retrieval approach in XML documents using tools, based on the linear algebra. The well-known transformation languages as XSLT (XPath) are grounded on the features of higher-order logic for manipulating hierarchical trees. The presented conception is compared to existing higher-order logic formalisms, where the queries are realized by both languages XSLT and XPath. The possibilities of the proposed linear algebraic model combined with hierarchy data models permit more efficient solutions for searching, extracting and manipulating semi-structured data with hierarchical structures avoiding the global navigation over the XML tree components. The main purpose of this algebraic model representation, applied to the hierarchical relationships in the XML data structures, is to make the implementation of linear algebra tools possible for XML data manipulations and to eliminate existing problems, related to regular grammars theory and also to avoid the difficulties, connected with higher -order logic (first-order logic, monadic second- order logic etc.).

  8. The XML approach to implementing space link extension service management

    Science.gov (United States)

    Tai, W.; Welz, G. A.; Theis, G.; Yamada, T.

    2001-01-01

    A feasibility study has been conducted at JPL, ESOC, and ISAS to assess the possible applications of the eXtensible Mark-up Language (XML) capabilities to the implementation of the CCSDS Space Link Extension (SLE) Service Management function.

  9. Investigating Soap and Xml Technologies in Web Service

    OpenAIRE

    Mehdi Zekriyapanah Gashti

    2012-01-01

    In this paper, Investigating SOAP and XML technologies in web service is studied. The reason for usingXML technology to transmit data and also the need for application of existing communicative structure inSOAP technology in web pages with WSDL technology are investigated uniquely. And also the need forsearchable address giving for web service which is available in UDDI technology and the advantages ofusing it are explained for programmers.

  10. The curse of namespaces in the domain of XML signature

    DEFF Research Database (Denmark)

    Jensen, Meiko; Liao, Lijun; Schwenk, Jörg

    2009-01-01

    The XML signature wrapping attack is one of the most discussed security issues of the Web Services security community during the last years. Until now, the issue has not been solved, and all countermeasure approaches proposed so far were shown to be insufficient. In this paper, we present yet...... signatures in the XML domain. Additionally, we present and discuss some new approaches in countering the proposed attack vector. Copyright 2009 ACM....

  11. Semi-automatic Citation Correction with Lemon8-XML

    Directory of Open Access Journals (Sweden)

    MJ Suhonos

    2009-03-01

    Full Text Available The Lemon8-XML software application, developed by the Public Knowledge Project (PKP, provides an open-source, computer-assisted interface for reliable citation structuring and validation. Lemon8-XML combines citation parsing algorithms with freely-available online indexes such as PubMed, WorldCat, and OAIster. Fully-automated markup of entire bibliographies may be a genuine possibility using this approach. Automated markup of citations would increase bibliographic accuracy while reducing copyediting demands.

  12. XML的显示%The Display of XML

    Institute of Scientific and Technical Information of China (English)

    程喜荣

    2002-01-01

    Tbe eXtensible Markup Language(XML)describes a document's structure and content, not the style of the elements on the page. The style can be added to a document with a style sheet. Both Cascading Style Sheet(CSS)and eXtensible Style Languange(XSL)can produce such a style sheet. The HyperText Markup Language(HTML) provides a markup that looks like , by which XML document can be easily bound to some HTML elements.

  13. Traceable Recursion with Graphical Illustration for Novice Programmers

    Science.gov (United States)

    Sa, Leonardo; Hsin, Wen-Jung

    2010-01-01

    Recursion is a concept that can be used to describe the phenomena and natural occurrences in many different fields. As many applications utilize computer software to model recursion, recursion is a particularly important concept in the computing discipline. However, it is a difficult concept for many undergraduate students to master. A Recursion…

  14. A Survey on Teaching and Learning Recursive Programming

    Science.gov (United States)

    Rinderknecht, Christian

    2014-01-01

    We survey the literature about the teaching and learning of recursive programming. After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a review of textbooks and some programming methodology, as well as the functional and imperative…

  15. Convergence of a Linear Recursive Sequence

    Science.gov (United States)

    Tay, E. G.; Toh, T. L.; Dong, F. M.; Lee, T. Y.

    2004-01-01

    A necessary and sufficient condition is found for a linear recursive sequence to be convergent, no matter what initial values are given. Its limit is also obtained when the sequence is convergent. Methods from various areas of mathematics are used to obtain the results.

  16. Recursive Filtering And Smoothing In Robot Dynamics

    Science.gov (United States)

    Rodriguez, Guillermo

    1992-01-01

    Techniques developed originally for electronic systems also useful for multibody mechanical systems. Report summarizes methods developed to solve nonlinear forward-dynamics problem for robot of multiple-link arms connected by joints. Primary objective to show equivalence between recursive methods of dynamical analysis and some filtering and smoothing techniques from state-estimation theory.

  17. Recursions for the Individual Risk Model

    NARCIS (Netherlands)

    Dhaene, J.; Ribas, C.; Vernic, R.

    2006-01-01

    In the actuarial literature, several exact and approximative recursive methods have been proposed for calculating the distribution of a sum of mutually independent compound Bernoulli distributed random variables. In this paper, we give an overview of these methods. We compare their performance with

  18. INTEGRATING XML DATA INTO MULTIPLE ROLAP DATA WAREHOUSE SCHEMAS

    Directory of Open Access Journals (Sweden)

    Soumya Sen

    2012-02-01

    Full Text Available Data Warehouse is one of the most common ways for analyzing large data for decision based system. Thesedata are often sourced from online transactional system. The transactional data are represented indifferent formats. XML is one of the worldwide standards to represent data in web based system. Numbersof organizations use XML for e-commerce and internet based applications. Integration of XML and datawarehouse for the innovation of business logic and to enhance decision making has therefore emerged as ademanding area of research interest. This paper focuses on integrating XML data based on multiple relatedXML schemas, to an equivalent data warehouse schemas based on relational online analytical processing(ROLAP. This work bears a high relevance towards standardizing of the ETL phase (Extraction,Transformation, and Loading of the OLAP projects. The novelty of the work is that more than one datawarehouse schemas could be identified from a single related XML schema and each of them could becategorized as star schema or snowflake schema. Moreover if the individual schemas are found to berelated according to the analysis, fact constellation could be identified. A new data structure, SchemaGraph has been proposed in the process.

  19. Container-component model and XML in ALMA ACS

    Science.gov (United States)

    Sommer, Heiko; Chiozzi, Gianluca; Zagar, Klemen; Voelter, Markus

    2004-09-01

    ALMA software, from high-level data flow applications down to instrument control, is built using the ACS framework. To meet the challenges of developing distributed software in distributed teams, ACS offers a container/component model that integrates the use of XML transfer objects. ACS containers are built on top of CORBA and are available for C++, Java, and Python, so that ALMA software can be written as components in any of these languages. The containers perform technical aspects of the software system, while components can focus on the implementation of functional requirements. Like Web services, components can use XML to exchange structured data by value. For Java components, the container seamlessly integrates the use of XML binding classes, which are Java classes that encapsulate access to XML data through type-safe methods. Binding classes are generated from XML schemas, allowing the Java compiler to enforce compliance of application code with the XML schemas. This presentation will explain the capabilities of the ACS container/component model, and how it relates to other middleware technologies that are popular in industry.

  20. Specifics on a XML Data Format for Scientific Data

    Science.gov (United States)

    Shaya, E.; Thomas, B.; Cheung, C.

    An XML-based data format for interchange and archiving of scientific data would benefit in many ways from the features standardized in XML. Foremost of these features is the world-wide acceptance and adoption of XML. Applications, such as browsers, XQL and XSQL advanced query, XML editing, or CSS or XSLT transformation, that are coming out of industry and academia can be easily adopted and provide startling new benefits and features. We have designed a prototype of a core format for holding, in a very general way, parameters, tables, scalar and vector fields, atlases, animations and complex combinations of these. This eXtensible Data Format (XDF) makes use of XML functionalities such as: self-validation of document structure, default values for attributes, XLink hyperlinks, entity replacements, internal referencing, inheritance, and XSLT transformation. An API is available to aid in detailed assembly, extraction, and manipulation. Conversion tools to and from FITS and other existing data formats are under development. In the future, we hope to provide object oriented interfaces to C++, Java, Python, IDL, Mathematica, Maple, and various databases. http://xml.gsfc.nasa.gov/XDF

  1. Definition of an XML markup language for clinical laboratory procedures and comparison with generic XML markup.

    Science.gov (United States)

    Saadawi, Gilan M; Harrison, James H

    2006-10-01

    Clinical laboratory procedure manuals are typically maintained as word processor files and are inefficient to store and search, require substantial effort for review and updating, and integrate poorly with other laboratory information. Electronic document management systems could improve procedure management and utility. As a first step toward building such systems, we have developed a prototype electronic format for laboratory procedures using Extensible Markup Language (XML). Representative laboratory procedures were analyzed to identify document structure and data elements. This information was used to create a markup vocabulary, CLP-ML, expressed as an XML Document Type Definition (DTD). To determine whether this markup provided advantages over generic markup, we compared procedures structured with CLP-ML or with the vocabulary of the Health Level Seven, Inc. (HL7) Clinical Document Architecture (CDA) narrative block. CLP-ML includes 124 XML tags and supports a variety of procedure types across different laboratory sections. When compared with a general-purpose markup vocabulary (CDA narrative block), CLP-ML documents were easier to edit and read, less complex structurally, and simpler to traverse for searching and retrieval. In combination with appropriate software, CLP-ML is designed to support electronic authoring, reviewing, distributing, and searching of clinical laboratory procedures from a central repository, decreasing procedure maintenance effort and increasing the utility of procedure information. A standard electronic procedure format could also allow laboratories and vendors to share procedures and procedure layouts, minimizing duplicative word processor editing. Our results suggest that laboratory-specific markup such as CLP-ML will provide greater benefit for such systems than generic markup.

  2. Citing geospatial feature inventories with XML manifests

    Science.gov (United States)

    Bose, R.; McGarva, G.

    2006-12-01

    Today published scientific papers include a growing number of citations for online information sources that either complement or replace printed journals and books. We anticipate this same trend for cartographic citations used in the geosciences, following advances in web mapping and geographic feature-based services. Instead of using traditional libraries to resolve citations for print material, the geospatial citation life cycle will include requesting inventories of objects or geographic features from distributed geospatial data repositories. Using a case study from the UK Ordnance Survey MasterMap database, which is illustrative of geographic object-based products in general, we propose citing inventories of geographic objects using XML feature manifests. These manifests: (1) serve as a portable listing of sets of versioned features; (2) could be used as citations within the identification portion of an international geospatial metadata standard; (3) could be incorporated into geospatial data transfer formats such as GML; but (4) can be resolved only with comprehensive, curated repositories of current and historic data. This work has implications for any researcher who foresees the need to make or resolve references to online geospatial databases.

  3. Optimized XML Storage in NXD Based on Tree-Structure Disassemble

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Independent XML storage based on XSD (XML Schema Document) is adopted in NXD(Native XML Database), XML storage structure based on tree-structure disassemble and the algorithm used in dynamically updating XML document are provided in this paper. The main idea is that in term of data model of XML document, XML document is parsed to Document Structure-Tree with Hierarchical Model and Leaf-Data with Relation Model for storage. Simultaneously Proxy node is imported in order to solve the problem that XML data store in cross-blocks. And with XSD model information, sparse index is constructed to save storage space. It is proved that this storage structure could improve efficiency of XML document operation.

  4. XML Based Business-to-Business E-Commerce Frameworks%基于XML的B2B电子商务构架

    Institute of Scientific and Technical Information of China (English)

    范国闯; 刘庆文; 李京; 钟华

    2002-01-01

    The B2B (Business-to-Business)e-commerce framework solves the key problem-interoperability between enterprise during e-commerce transactions.Firstly,this paper presents several key factors of B2B e-commerce framework by analyzing the role of frameworks.Moreover,this paper analyzeds and compares several international popular B2B frameworks from from the point of view of these factors.Finally,this paper proposes the design principles,objectives and e-commerce transaction language of cnXML (Chiese e-Commerce XML)frameworks.

  5. OrientX: An Integrated, Schema Based Native XML Database System

    Institute of Scientific and Technical Information of China (English)

    MENG Xiaofeng; WANG Xiaofeng; XIE Min; ZHANG Xin; ZHOU Junfeng

    2006-01-01

    The increasing number of XML repositories has stimulated the design of systems that can store and query XML data efficiently. OrientX, a native XML database system, is designed to meet this requirement. In this paper, we described the system structure and design of OrientX, an integrated, schema-based native XML database. The main contributions of OrientX are: a)We have implemented an integrated native XML database system, which supports native storage of XML data, and based on it we can handle XPath& XQuery efficiently; b)In our OrientX system, schema information is fully explored to guide the storage, optimization and query processing.

  6. Recursive double-size fixed precision arithmetic

    CERN Document Server

    Chabot, Christophe; Fousse, Laurent; Giorgi, Pascal

    2011-01-01

    This work is a part of the SHIVA (Secured Hardware Immune Versatile Architecture) project whose purpose is to provide a programmable and reconfigurable hardware module with high level of security. We propose a recursive double-size fixed precision arithmetic called RecInt. Our work can be split in two parts. First we developped a C++ software library with performances comparable to GMP ones. Secondly our simple representation of the integers allows an implementation on FPGA. Our idea is to consider sizes that are a power of 2 and to apply doubling techniques to implement them efficiently: we design a recursive data structure where integers of size 2^k, for k>k0 can be stored as two integers of size 2^{k-1}. Obviously for k<=k0 we use machine arithmetic instead (k0 depending on the architecture).

  7. Relativistic recursion relations for transition matrix elements

    CERN Document Server

    Martínez y Romero, R P; Salas-Brito, A L

    2004-01-01

    We review some recent results on recursion relations which help evaluating arbitrary non-diagonal, radial hydrogenic matrix elements of $r^\\lambda$ and of $\\beta r^\\lambda$ ($\\beta$ a Dirac matrix) derived in the context of Dirac relativistic quantum mechanics. Similar recursion relations were derived some years ago by Blanchard in the non relativistic limit. Our approach is based on a generalization of the second hypervirial method previously employed in the non-relativistic Schr\\"odinger case. An extension of the relations to the case of two potentials in the so-called unshifted case, but using an arbitrary radial function instead of a power one, is also given. Several important results are obtained as special instances of our recurrence relations, such as a generalization to the relativistic case of the Pasternack-Sternheimer rule. Our results are useful in any atomic or molecular calculation which take into account relativistic corrections.

  8. Supporting B2B Business Documents in XML Web Services

    Institute of Scientific and Technical Information of China (English)

    KIM Hyoungdo

    2004-01-01

    While XML web services become recognized as a solution to business-to-business transactions, there are many problems that should be solved. For example, it is not easy to manipulate business documents of existing standards such as RosettaNet and UN/EDIFACT EDI, traditionally regarded as an important resource for managing B2B relationships. As a starting point for the complete implementation of B2B web services, this paper deals with how to support B2B business documents in XML web services. In the first phase, basic requirements for driving XML web services by business documents are introduced. As a solution, this paper presents how to express B2B business documents in WSDL, a core standard for XML web services. This kind of approach facilitates the reuse of existing business documents and enhances interoperability between implemented web services. Furthermore, it suggests how to link with other conceptual modeling frameworks such as ebXML/UMM, built on a rich heritage of electronic business experience.

  9. Recursively arbitrarily vertex-decomposable graphs

    Directory of Open Access Journals (Sweden)

    Olivier Baudon

    2012-01-01

    Full Text Available A graph \\(G = (V;E\\ is arbitrarily vertex decomposable if for any sequence \\(\\tau\\ of positive integers adding up to \\(|V|\\, there is a sequence of vertex-disjoint subsets of \\(V\\ whose orders are given by \\(\\tau\\, and which induce connected graphs. The main aim of this paper is to study the recursive version of this problem. We present a solution for trees, suns, and partially for a class of 2-connected graphs called balloons.

  10. Geometric Modelling by Recursively Cutting Vertices

    Institute of Scientific and Technical Information of China (English)

    吕伟; 梁友栋; 等

    1989-01-01

    In this paper,a new method for curve and surface modelling is introduced which generates curves and surfaces by recursively cutting and grinding polygons and polyhedra.It is a generalization of the existing corner-cutting methods.A lot of properties,such as geometric continuity,representation,shape-preserving,and the algorithm are studied which show that such curves and surfaces are suitable for geometric designs in CAD,computer graphics and their application fields.

  11. Recursive formulae for the multiplicative partition function

    Directory of Open Access Journals (Sweden)

    Jun Kyo Kim

    1999-01-01

    Full Text Available For a positive integer n, let f(n be the number of essentially different ways of writing n as a product of factors greater than 1, where two factorizations of a positive integer are said to be essentially the same if they differ only in the order of the factors. This paper gives a recursive formula for the multiplicative partition function f(n.

  12. FRPA: A Framework for Recursive Parallel Algorithms

    Science.gov (United States)

    2015-05-01

    value of designing a programming language such as NESL from the ground up for its ability to be optimized for teaching and prototyping parallel...observations that communication costs often dominate computation costs. Previous work [1]–[3] demonstrates that carefully choosing which divide-and-conquer...pabilities, we present a detailed analysis of two al- gorithms: Strassen-Winograd [1] and Communication - Optimal Parallel Recursive Rectangular Matrix

  13. A NEW RECURSIVE ALGORITHM FOR MULTIUSER DETECTION

    Institute of Scientific and Technical Information of China (English)

    Wang Lei; Zheng Baoyu; Li Lei; Chen Chao

    2009-01-01

    Based on the synthesis and analysis of recursive receivers,a new algorithm,namely partial grouping maximization likelihood algorithm,is proposed to achieve satisfactory performance with moderate computational complexity.During the analysis,some interesting properties shared by the proposed procedures are described.Finally,the performance assessment shows that the new scheme is superior to the linear detector and ordinary grouping algorithm,and achieves a bit-error rate close to that of the optimum receiver.

  14. Type Inference for Guarded Recursive Data Types

    OpenAIRE

    Stuckey, Peter J.; Sulzmann, Martin

    2005-01-01

    We consider type inference for guarded recursive data types (GRDTs) -- a recent generalization of algebraic data types. We reduce type inference for GRDTs to unification under a mixed prefix. Thus, we obtain efficient type inference. Inference is incomplete because the set of type constraints allowed to appear in the type system is only a subset of those type constraints generated by type inference. Hence, inference only succeeds if the program is sufficiently type annotated. We present refin...

  15. Linearly recursive sequences and Dynkin diagrams

    CERN Document Server

    Reutenauer, Christophe

    2012-01-01

    Motivated by a construction in the theory of cluster algebras (Fomin and Zelevinsky), one associates to each acyclic directed graph a family of sequences of natural integers, one for each vertex; this construction is called a {\\em frieze}; these sequences are given by nonlinear recursions (with division), and the fact that they are integers is a consequence of the Laurent phenomenon of Fomin and Zelevinsky. If the sequences satisfy a linear recursion with constant coefficients, then the graph must be a Dynkin diagram or an extended Dynkin diagram, with an acyclic orientation. The converse also holds: the sequences of the frieze associated to an oriented Dynkin or Euclidean diagram satisfy linear recursions, and are even $\\mathbb N$-rational. One uses in the proof objects called $SL_2$-{\\em tilings of the plane}, which are fillings of the discrete plane such that each adjacent 2 by 2 minor is equal to 1. These objects, which have applications in the theory of cluster algebras, are interesting for themselves. S...

  16. A Recursive Framework for Automatic Face Tracking

    Institute of Scientific and Technical Information of China (English)

    ZHUANGYueting; CHENJiashi; WUFei; ZHUQiang

    2004-01-01

    Human face modeling and tracking has always been an important problem for user interfaces, gesture recognition and surveillance. Our approach lies in two key techniques: sum-of-squared-difference (SSD) tracking and a recursive framework including a clever motion representation: twist. The recursive framework plays a pivotal role in the whole system: First, it stably maintains the 3D pose of the face according to the 2D observations. In the mean time, it predicts the new state and projects 3D structure from object coordinates to the feature trajectory in 2D image plane, which indicates a good initial position for 2D tracking in the next frame. The core idea is to propose a recursive framework (i.e. Extended Kalman filter, EKF)that treats the individual 2D trackers as a global 3D rigid structure, consequently solving the problems inherent in pure 2D tracking and avoiding feature loss. In the end, we will present several experimental results to validate our approach.

  17. Weighted Laplacians, cocycles and recursion relations

    Science.gov (United States)

    Krasnov, Kirill; Scarinci, Carlos

    2013-11-01

    Hodge's formula represents the gravitational MHV amplitude as the determinant of a minor of a certain matrix. When expanded, this determinant becomes a sum over weighted trees, which is the form of the MHV formula first obtained by Bern, Dixon, Perelstein, Rozowsky and rediscovered by Nguyen, Spradlin, Volovich and Wen. The gravity MHV amplitude satisfies the Britto, Cachazo, Feng and Witten recursion relation. The main building block of the MHV amplitude, the so-called half-soft function, satisfies a different, Berends-Giele-type recursion relation. We show that all these facts are illustrations to a more general story. We consider a weighted Laplacian for a complete graph of n vertices. The matrix tree theorem states that its diagonal minor determinants are all equal and given by a sum over spanning trees. We show that, for any choice of a cocycle on the graph, the minor determinants satisfy a Berends-Giele as well as Britto-Cachazo-Feng-Witten type recursion relation. Our proofs are purely combinatorial.

  18. Consciousness as recursive, spatiotemporal self-location.

    Science.gov (United States)

    Peters, Frederic

    2010-07-01

    At the phenomenal level, consciousness arises in a consistently coherent fashion as a singular, unified field of recursive self-awareness (subjectivity) with explicitly orientational characteristics--that of a subject located both spatially and temporally in an egocentrically-extended domain. Understanding these twin elements of consciousness begins with the recognition that ultimately (and most primitively), cognitive systems serve the biological self-regulatory regime in which they subsist. The psychological structures supporting self-located subjectivity involve an evolutionary elaboration of the two basic elements necessary for extending self-regulation into behavioral interaction with the environment: an orientative reference frame which consistently structures ongoing interaction in terms of controllable spatiotemporal parameters, and processing architecture that relates behavior to homeostatic needs via feedback. Over time, constant evolutionary pressures for energy efficiency have encouraged the emergence of anticipative feedforward processing mechanisms, and the elaboration, at the apex of the sensorimotor processing hierarchy, of self-activating, highly attenuated recursively-feedforward circuitry processing the basic orientational schema independent of external action output. As the primary reference frame of active waking cognition, this recursive self-locational schema processing generates a zone of subjective self-awareness in terms of which it feels like something to be oneself here and now. This is consciousness-as-subjectivity.

  19. Recursive self-organizing network models.

    Science.gov (United States)

    Hammer, Barbara; Micheli, Alessio; Sperduti, Alessandro; Strickert, Marc

    2004-01-01

    Self-organizing models constitute valuable tools for data visualization, clustering, and data mining. Here, we focus on extensions of basic vector-based models by recursive computation in such a way that sequential and tree-structured data can be processed directly. The aim of this article is to give a unified review of important models recently proposed in literature, to investigate fundamental mathematical properties of these models, and to compare the approaches by experiments. We first review several models proposed in literature from a unifying perspective, thereby making use of an underlying general framework which also includes supervised recurrent and recursive models as special cases. We shortly discuss how the models can be related to different neuron lattices. Then, we investigate theoretical properties of the models in detail: we explicitly formalize how structures are internally stored in different context models and which similarity measures are induced by the recursive mapping onto the structures. We assess the representational capabilities of the models, and we shortly discuss the issues of topology preservation and noise tolerance. The models are compared in an experiment with time series data. Finally, we add an experiment for one context model for tree-structured data to demonstrate the capability to process complex structures.

  20. Application of XML database technology to biological pathway datasets.

    Science.gov (United States)

    Jiang, Keyuan; Nash, Christopher

    2006-01-01

    The study of biological systems has accumulated a significant amount of biological pathway data, which is evident through the continued growth in both the number of databases and amount of data available. The development of BioPAX standard leads to the increased availability of biological pathway datasets through the use of a special XML format, but the lack of standard storage mechanism makes the querying and aggregation of BioPAX compliant data challenging. To address this shortcoming, we have developed a storage mechanism leveraging the existing XML technologies: the XML database and XQuery. The goal of our project is to provide a generic and centralized store with efficient queries for the needs of biomedical research. A SOAP-based Web service and direct HTTP request methods have also developed to facilitate public consumption of the datasets online.

  1. Automatic Generation of OWL Ontology from XML Data Source

    CERN Document Server

    Yahia, Nora; Ahmed, AbdelWahab

    2012-01-01

    The eXtensible Markup Language (XML) can be used as data exchange format in different domains. It allows different parties to exchange data by providing common understanding of the basic concepts in the domain. XML covers the syntactic level, but lacks support for reasoning. Ontology can provide a semantic representation of domain knowledge which supports efficient reasoning and expressive power. One of the most popular ontology languages is the Web Ontology Language (OWL). It can represent domain knowledge using classes, properties, axioms and instances for the use in a distributed environment such as the World Wide Web. This paper presents a new method for automatic generation of OWL ontology from XML data sources.

  2. Utilizing the Structure and Content Information for XML Document Clustering

    Science.gov (United States)

    Tran, Tien; Kutty, Sangeetha; Nayak, Richi

    This paper reports on the experiments and results of a clustering approach used in the INEX 2008 document mining challenge. The clustering approach utilizes both the structure and content information of the Wikipedia XML document collection. A latent semantic kernel (LSK) is used to measure the semantic similarity between XML documents based on their content features. The construction of a latent semantic kernel involves the computing of singular vector decomposition (SVD). On a large feature space matrix, the computation of SVD is very expensive in terms of time and memory requirements. Thus in this clustering approach, the dimension of the document space of a term-document matrix is reduced before performing SVD. The document space reduction is based on the common structural information of the Wikipedia XML document collection. The proposed clustering approach has shown to be effective on the Wikipedia collection in the INEX 2008 document mining challenge.

  3. Discovering Frequent Subtrees from XML Data Using Neural Networks

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    By rapid progress of network and storage technologies, a huge amount of electronic data such as Web pages and XML has been available on Internet. In this paper, we study a data-mining problem of discovering frequent ordered sub-trees in a large collection of XML data, where both of the patterns and the data are modeled by labeled ordered trees. We present an efficient algorithm of Ordered Subtree Miner(OSTMiner) based on two- layer neural networks with Hebb rule, that computes all ordered sub-trees appearing in a collection of XML trees with frequent above a user-specified threshold using a special structure EM-tree. In this algorithm, EM-tree is used as an extended merging tree to supply scheme information for efficient pruning and mining frequent sub-trees. Experiments results showed that OSTMiner has good response time and scales well.

  4. Integration of XML and HTML%XML与HTML整合

    Institute of Scientific and Technical Information of China (English)

    陈银凤

    2011-01-01

    Both XML and HTML are the important network identifier languages, but each has its own ad- vantages and disadvantages. XML is focused on data description and HTML is focused on data display. If XML and HTML can be integrated, it can complement each other.%XML与HTML都是重要的网络标识语言,但各自具有优缺点,XML侧重于数据的描述,HTML侧重于数据的显示,若将两者整合则可以取长补短。主要介绍如何使用数据岛技术来实现XML与HTML的整合。

  5. PREFIX-BASED LABELING ANNOTATION FOR EFFECTIVE XML FRAGMENTATION

    Directory of Open Access Journals (Sweden)

    Kok-Leong Koong

    2015-05-01

    Full Text Available XML is gradually employed as a standard of data exchange in web environment since its inception in the 90s until present. It serves as a data exchange between systems and other applications. Meanwhile the data volume has grown substantially in the web and thus effective methods of storing and retrieving these data is essential. One recommended way is physically or virtually fragments the large chunk of data and distributes the fragments into different nodes. Fragmentation design of XML document contains of two parts: fragmentation operation and fragmentation method. The three fragmentation operations are Horizontal, Vertical and Hybrid. It determines how the XML should be fragmented. This paper aims to give an overview on the fragmentation design consideration and subsequently, propose a fragmentation technique using number addressing.

  6. Applying XML for designing and interchanging information for multidimensional model

    Institute of Scientific and Technical Information of China (English)

    Lu Changhui; Deng Su; Zhang Weiming

    2005-01-01

    In order to exchange and share information among the conceptual models of data warehouse, and to build a solid base for the integration and share of metadata, a new multidimensional concept model is presented based on XML and its DTD is defined, which can perfectly describe various semantic characteristics of multidimensional conceptual model. According to the multidimensional conceptual modeling technique which is based on UML, the mapping algorithm between the multidimensional conceptual model is described based on XML and UML class diagram, and an application base for the wide use of this technique is given.

  7. Groundwork for True XML-based Security Pattern Languages

    Institute of Scientific and Technical Information of China (English)

    TAWFIQ S.M.Barhoom; ZHANG Shen-sheng

    2005-01-01

    A pattern is used to describe best practices and principles. Patterns have been used successfully in architecture and in software design. We propose to apply the pattern method to XML-based security engineering. Organized collections of interrelated patterns (called pattern languages) can embody whole bodies of knowledge on specific topics. We will discuss patterns and security pattern, pattern languages and the requirements of the pattern languages proposing its essential requirement (the template), and lays the groundwork for our future development of a true XML-based security pattern language.

  8. Fast Discovering Frequent Patterns for Incremental XML Queries

    Institute of Scientific and Technical Information of China (English)

    PENG Dun-lu; QIU Yang

    2004-01-01

    It is nontrivial to maintain such discovered frequent query patterns in real XML-DBMS because the transaction database of queries may allow frequent updates and such updates may not only invalidate some existing frequent query patterns but also generate some new frequent query patterns.In this paper, two incremental updating algorithms, FUXQMiner and FUFXQMiner, are proposed for efficient maintenance of discovered frequent query patterns and generation the new frequent query patterns when new XML queries are added into the database.Experimental results from our implementation show that the proposed algorithms have good performance.

  9. Almacenamiento de datos XML en Oracle 11g

    OpenAIRE

    Migani, Silvina; de Vera, Cristina; Correa, Carlos; Romera, Liliana

    2013-01-01

    Sin duda la aparición del lenguaje de marcas extensible, XML (eXtensible Markup Language), generó muchos cambios en el mundo de la informática. Por un lado, la introducción de muchas tecnologías asociadas, y por otro, la transformación o adecuación de las ya existentes. El mundo de las bases de datos no quedó fuera de tal situación. Los fabricantes de los SGBDs tradicionales se vieron en la necesidad de extender sus estructuras habituales para poder manipular datos XML, dando origen a los SGB...

  10. Active XML Document Rewriting Based on Tree Automata Theory

    Institute of Scientific and Technical Information of China (English)

    MA Haitao; HAO Zhongxiao; ZHU Yan

    2006-01-01

    The problem of document rewriting is a fundamental problem in active XML(AXML) data exchange and usually has a higher complexity.Prior work was focused on string automaton theory.This paper tries to solve it by using tree automaton.More precisely, the paper firstly defines a new tree automaton, active XML tree automaton (AXTA),which can efficiently represent the set of AXML documents produced by an AXML document or AXML document schema.And then, an algorithm for constructing AXTA automaton is also proposed.Finally, a polynomial time(PTIME) determining algorithm for AXML document rewriting is presented based on AXTA automaton.

  11. Streaming-based verification of XML signatures in SOAP messages

    DEFF Research Database (Denmark)

    Somorovsky, Juraj; Jensen, Meiko; Schwenk, Jörg

    2010-01-01

    WS-Security is a standard providing message-level security in Web Services. Therewith, it ensures their integrity, confidentiality, and authenticity. However, using sophisticated security algorithms can lead to high memory consumptions and long evaluation times. In combination with the standard DOM...... approach for XML processing, the Web Services servers easily become a target of Denial-of-Service attacks. We present a solution for these problems: an external streaming-based WS-Security Gateway. Our implementation is capable of processing XML Signatures in SOAP messages using a streaming-based approach...

  12. Algebra-Based Optimization of XML-Extended OLAP Queries

    DEFF Research Database (Denmark)

    Yin, Xuepeng; Pedersen, Torben Bach

    is desirable. This report presents a complete foundation for such OLAP-XML federations. This includes a prototypical query engine, a simplified query semantics based on previous work, and a complete physical algebra which enables precise modeling of the execution tasks of an OLAP-XML query. Effective algebra......-based and cost-based query optimization and implementation are also proposed, as well as the execution techniques. Finally, experiments with the prototypical query engine w.r.t. federation performance, optimization effectiveness, and feasibility suggest that our approach, unlike the physical integration...

  13. Improved Undecidability Results for Reachability Games on Recursive Timed Automata

    Directory of Open Access Journals (Sweden)

    Shankara Narayanan Krishna

    2014-08-01

    Full Text Available We study reachability games on recursive timed automata (RTA that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clocks, while the problem is decidable for automata with only one clock. Ouaknine and Worrell recently proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. We revisited games on recursive timed automata with time-bounded restriction in the hope of recovering decidability. However, we found that the problem still remains undecidable for recursive timed automata with three or more clocks. Using similar proof techniques we characterize a decidability frontier for a generalization of RTA to recursive stopwatch automata.

  14. Recursive Polynomial Remainder Sequence and the Nested Subresultants

    OpenAIRE

    Terui, Akira

    2008-01-01

    We give two new expressions of subresultants, nested subresultant and reduced nested subresultant, for the recursive polynomial remainder sequence (PRS) which has been introduced by the author. The reduced nested subresultant reduces the size of the subresultant matrix drastically compared with the recursive subresultant proposed by the authors before, hence it is much more useful for investigation of the recursive PRS. Finally, we discuss usage of the reduced nested subresultant in approxima...

  15. Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas

    CERN Document Server

    Godlin, Benny; Makowsky, Johann A

    2008-01-01

    Many graph polynomials, such as the Tutte polynomial, the interlace polynomial and the matching polynomial, have both a recursive definition and a defining subset expansion formula. In this paper we present a general, logic-based framework which gives a precise meaning to recursive definitions of graph polynomials. We then prove that in this framework every recursive definition of a graph polynomial can be converted into a subset expansion formula.

  16. Rates of Convergence of Recursively Defined Sequences

    DEFF Research Database (Denmark)

    Lambov, Branimir Zdravkov

    2005-01-01

    This paper gives a generalization of a result by Matiyasevich which gives explicit rates of convergence for monotone recursively defined sequences. The generalization is motivated by recent developments in fixed point theory and the search for applications of proof mining to the field. It relaxes...... the requirement for monotonicity to the form xn+1 ≤ (1+an)xn+bn where the parameter sequences have to be bounded in sum, and also provides means to treat computational errors. The paper also gives an example result, an application of proof mining to fixed point theory, that can be achieved by the means discussed...

  17. Recursion equations in gauge field theories

    Science.gov (United States)

    Migdal, A. A.

    An approximate recursion equation is formulated, describing the scale transformation of the effective action of a gauge field. In two-dimensional space-time the equation becomes exact. In four-dimensional theories it reproduces asymptotic freedom to an accuracy of 30% in the coefficients of the β-function. In the strong-coupling region the β-function remains negative and this results in an asymptotic prison in the infrared region. Possible generalizations and applications to the quark-gluon gauge theory are discussed.

  18. Elimination and recursions in the scattering equations

    Directory of Open Access Journals (Sweden)

    Carlos Cardona

    2016-05-01

    Full Text Available We use the elimination theory to explicitly construct the (n−3! order polynomial in one of the variables of the scattering equations. The answer can be given either in terms of a determinant of Sylvester type of dimension (n−3! or a determinant of Bézout type of dimension (n−4!. We present a recursive formula for the Sylvester determinant. Expansion of the determinants yields expressions in terms of Plücker coordinates. Elimination of the rest of the variables of the scattering equations is also presented.

  19. Recursive backstepping control of chaotic Duffing oscillators

    Energy Technology Data Exchange (ETDEWEB)

    Harb, Ahmad M. [Jordan University of Science and Technology, EE Department, P.O. Box 3030, Irbid (Jordan)]. E-mail: aharb@just.edu.jo; Zaher, Ashraf A. [Oakland University, School of Engineering and Computer Science, ESE Department, DHE 137, Rochester, MI 48309 (United States); Al-Qaisia, Ahmad A. [University of Jordan, ME Department, Amman (Jordan); Zohdy, Mohammad A. [Oakland University, School of Engineering and Computer Science, ESE Department, DHE 137, Rochester, MI 48309 (United States)

    2007-10-15

    In this paper, the dynamics of a forced Duffing oscillator is studied by means of modern nonlinear, bifurcation and chaos theories and shows that the system is ultimately experiencing chaos. The main objective is to characterize and control chaotic behavior. A nonlinear recursive backstepping controller is proposed and the transient performance is investigated. Systematic following of a reference model is introduced. Robustness problems as well as ways to tune the controller parameters are examined. Simulation results are submitted for the uncontrolled and controlled cases, verifying the effectiveness of the proposed controller. Finally a discussion and conclusions are given with possible future extensions.

  20. Computability theory an introduction to recursion theory

    CERN Document Server

    Enderton, Herbert B

    2010-01-01

    Computability Theory:  An Introduction to Recursion Theory,  provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level.  The text includes both the standard material for a first course in computability and more advanced looks at degree str

  1. Recursive training of neural networks for classification.

    Science.gov (United States)

    Aladjem, M

    2000-01-01

    A method for recursive training of neural networks for classification is proposed. It searches for the discriminant functions corresponding to several small local minima of the error function. The novelty of the proposed method lies in the transformation of the data into new training data with a deflated minimum of the error function and iteration to obtain the next solution. A simulation study and a character recognition application indicate that the proposed method has the potential to escape from local minima and to direct the local optimizer to new solutions.

  2. X3-Miner: Mining Patterns from XML Database

    NARCIS (Netherlands)

    Tan, H.; Dillon, T.; Feng, L.; Chang, E.; Hadzic, F.

    2005-01-01

    An XML enabled framework for the representation of association rules in databases was first presented in [4]. In Frequent Structure Mining (FSM), one of the popular approaches is to use graph matching that use data structures such as the adjacency matrix [7] or adjacency list [8]. Another approach

  3. The Design Space of Type Checkers for XML Transformation Languages

    DEFF Research Database (Denmark)

    Møller, Anders; Schwartzbach, Michael Ignatieff

    2005-01-01

    transductions to domain-specific languages or integration of XML in general-purpose programming languages. Type annotations can be either explicit or implicit, and type checking ranges from exact decidability to pragmatic approximations. We characterize and evaluate existing tools in this design space...

  4. Home-grown CASE tools with XML and XSLT

    NARCIS (Netherlands)

    van Rein, H.; Brinkman, Richard; Bézevin, J.; Ernst, J.

    This paper demonstrates an approach to software generation where xml representations of models are transformed to implementations by XSLT style sheets. Although XSLT was not primarily intended for this use, it serves quite well. There are only few problems in this approach, and we identify these

  5. XIRAF: an XML Information Retrieval Approach to Digital Forensics

    NARCIS (Netherlands)

    Alink, W.

    2005-01-01

    This Master’s thesis addresses problems in current digital forensic investigations. It proposes the XIRAF system as a novel approach towards the integration of existing forensic analysis tools using XML technology. The concept of integrating these tools can be compared to the concept of concurrent X

  6. XML Schema of PaGE-OM: basictypes.xsd [

    Lifescience Database Archive (English)

    Full Text Available 1/XMLSchema xmlns:xs=http://www.w3.org/2001/XMLSchema> XML basic types (ht...tp://www.w3.org/TR/xmlschema-2). ...e=xs:anySimpleType /> ...e=xs:anyType /> e=xs:an...ySimpleType />

  7. IMPROVING THE VIRTUAL LEARNING DEVELOPMENT PROCESSES USING XML STANDARDS

    Directory of Open Access Journals (Sweden)

    Kurt Suss

    2002-06-01

    Full Text Available Distributed Icarning environments and content often lack a common basis for the cxchange of learning materials. This delays, or even hinders, both innovation and delivery of learning tecnology. Standards for platforms and authoring may provide a way to improve interoperability and cooperative development. This article provides an XML-based approach to this problem creaied by the IMS Global Learning Consortium.

  8. A Recent Review on XML data mining and FFP

    Directory of Open Access Journals (Sweden)

    Amit Kumar Mishra, Hitesh Gupta

    2013-01-01

    Full Text Available The goal of data mining is to extract or mine" knowledge from large amounts of data. Emerging technologies of semi-structured data have attracted wide attention of networks, e-commerce, information retrieval and databases.XML has become very popular for representing semi structured data and a standard for data exchange over the web. Mining XML data from the web is becoming increasingly important. However, the structure of the XML data can be more complex and irregular than that. Association Rule Mining plays a key role in the process of mining data for frequent pattern matching. First Frequent Patterngrowth, for mining the complete set of frequent patterns by pattern fragment growth. First Frequent Pattern-tree based mining adopts a pattern fragment growth method to avoid the costly generation of a large number of candidate sets and a partition-based, divideand-conquer method is used. This paper shows a complete review of XML data mining using Fast Frequent Pattern mining in various domains.

  9. XML Web Services技术在基本医疗保险系统中的应用%Application of XML Web Services in Basic Medical Insurance System

    Institute of Scientific and Technical Information of China (English)

    曾雪梅; 李志蜀

    2004-01-01

    讨论了如何采用XML Web Services技术构建一个基本医疗保险信息系统.首先描述系统的体系结构,然后介绍由ASP.NET创建的XML Web Services的工作原理,最后详细阐述了XML Web Services技术在系统中的实现及其安全解决方案.

  10. Java facilities in processing XML files - JAXB and generating PDF reports

    Directory of Open Access Journals (Sweden)

    Danut-Octavian SIMION

    2008-01-01

    Full Text Available The paper presents the Java programming language facilities in working with XML files using JAXB (The Java Architecture for XML Binding technology and generating PDF reports from XML files using Java objects. The XML file can be an existing one and could contain the data about an entity (Clients for example or it might be the result of a SELECT-SQL statement. JAXB generates JAVA classes through xs rules and a Marshalling, Unmarshalling compiler. The PDF file is build from a XML file and uses XSL-FO formatting file and a Java ResultSet object.

  11. Pattern tree-based XOLAP rollup operator for XML complex hierarchies

    CERN Document Server

    Hachicha, Marouane

    2011-01-01

    With the rise of XML as a standard for representing business data, XML data warehousing appears as a suitable solution for decision-support applications. In this context, it is necessary to allow OLAP analyses on XML data cubes. Thus, XQuery extensions are needed. To define a formal framework and allow much-needed performance optimizations on analytical queries expressed in XQuery, defining an algebra is desirable. However, XML-OLAP (XOLAP) algebras from the literature still largely rely on the relational model. Hence, we propose in this paper a rollup operator based on a pattern tree in order to handle multidimensional XML data expressed within complex hierarchies.

  12. Robust representation for conversion UML class into XML Document using DOM

    CERN Document Server

    GHERABI, Noreddine

    2012-01-01

    This paper presents a Framework for converting a class diagram into an XML structure and shows how to use Web files for the design of data warehouses based on the classification UML. Extensible Markup Language (XML) has become a standard for representing data over the Internet. We use XSD schema for define the structure of XML documents and validate XML documents. A prototype has been developed, which migrates successfully UML Class into XML document based on the formulation mathematics model. The experimental results were very encouraging, demonstrating that the proposed approach is feasible efficient and correct.

  13. Branching structure of uniform recursive trees

    Institute of Scientific and Technical Information of China (English)

    FENG; Qunqiang; SU; Chun; HU; Zhishui

    2005-01-01

    The branching structure of uniform recursive trees is investigated in this paper.Using the method of sums for a sequence of independent random variables, the distribution law of ηn, the number of branches of the uniform recursive tree of size n are given first. It is shown that the strong law of large numbers, the central limit theorem and the law of iterated logarithm for ηn follow easily from this method. Next it is shown that ηn and ξn, the depth of vertex n, have the same distribution, and the distribution law of ζn,m, the number of branches of size m, is also given, whose asymptotic distribution is the Poisson distribution with parameter λ = 1/m. In addition, the joint distribution and the asymptotic joint distribution of the numbers of various branches are given. Finally, it is proved that the size of the biggest branch tends to infinity almost sure as n -→∞.

  14. A recursive algorithm for Zernike polynomials

    Science.gov (United States)

    Davenport, J. W.

    1982-01-01

    The analysis of a function defined on a rotationally symmetric system, with either a circular or annular pupil is discussed. In order to numerically analyze such systems it is typical to expand the given function in terms of a class of orthogonal polynomials. Because of their particular properties, the Zernike polynomials are especially suited for numerical calculations. Developed is a recursive algorithm that can be used to generate the Zernike polynomials up to a given order. The algorithm is recursively defined over J where R(J,N) is the Zernike polynomial of degree N obtained by orthogonalizing the sequence R(J), R(J+2), ..., R(J+2N) over (epsilon, 1). The terms in the preceding row - the (J-1) row - up to the N+1 term is needed for generating the (J,N)th term. Thus, the algorith generates an upper left-triangular table. This algorithm was placed in the computer with the necessary support program also included.

  15. On-shell recursion in string theory

    Science.gov (United States)

    Boels, Rutger H.; Marmiroli, Daniele; Obers, Niels A.

    2010-10-01

    We prove that all open string theory disc amplitudes in a flat background obey Britto-Cachazo-Feng-Witten (BCFW) on-shell recursion relations, up to a possible reality condition on a kinematic invariant. Arguments that the same holds for tree level closed string amplitudes are given as well. Non-adjacent BCFW-shifts are related to adjacent shifts through monodromy relations for which we provide a novel CFT based derivation. All possible recursion relations are related by old-fashioned string duality. The field theory limit of the analysis for amplitudes involving gluons is explicitly shown to be smooth for both the bosonic string as well as the superstring. In addition to a proof a less rigorous but more powerful argument based on the underlying CFT is presented which suggests that the technique may extend to a much more general setting in string theory. This is illustrated by a discussion of the open string in a constant B-field background and the closed string on the level of the sphere.

  16. Recursive support vector machines for dimensionality reduction.

    Science.gov (United States)

    Tao, Qing; Chu, Dejun; Wang, Jue

    2008-01-01

    The usual dimensionality reduction technique in supervised learning is mainly based on linear discriminant analysis (LDA), but it suffers from singularity or undersampled problems. On the other hand, a regular support vector machine (SVM) separates the data only in terms of one single direction of maximum margin, and the classification accuracy may be not good enough. In this letter, a recursive SVM (RSVM) is presented, in which several orthogonal directions that best separate the data with the maximum margin are obtained. Theoretical analysis shows that a completely orthogonal basis can be derived in feature subspace spanned by the training samples and the margin is decreasing along the recursive components in linearly separable cases. As a result, a new dimensionality reduction technique based on multilevel maximum margin components and then a classifier with high accuracy are achieved. Experiments in synthetic and several real data sets show that RSVM using multilevel maximum margin features can do efficient dimensionality reduction and outperform regular SVM in binary classification problems.

  17. Empirical results and formal approaches to recursion in acquisition.

    NARCIS (Netherlands)

    Hollebrandse, Bartjan; Roeper, Thomas; Speas, Margareth; Roeper, Thomas

    2014-01-01

    We argue that the move from Direct recursion with conjunctive interpretation to Indirect recursion, where the Strong Minimalist Thesis requires that, at Phase boundaries, a semantic interpretation is necessary, provides the blueprint for the acquisition path. We provide an overview of experimental r

  18. Empirical results and formal approaches to recursion in acquisition.

    NARCIS (Netherlands)

    Hollebrandse, Bartjan; Roeper, Thomas; Speas, Margareth; Roeper, Thomas

    2014-01-01

    We argue that the move from Direct recursion with conjunctive interpretation to Indirect recursion, where the Strong Minimalist Thesis requires that, at Phase boundaries, a semantic interpretation is necessary, provides the blueprint for the acquisition path. We provide an overview of experimental r

  19. Language, Mind, Practice: Families of Recursive Thinking in Human Reasoning

    Science.gov (United States)

    Josephson, Marika

    2011-01-01

    In 2002, Chomsky, Hauser, and Fitch asserted that recursion may be the one aspect of the human language faculty that makes human language unique in the narrow sense--unique to language and unique to human beings. They also argue somewhat more quietly (as do Pinker and Jackendoff 2005) that recursion may be possible outside of language: navigation,…

  20. A recursive approach to mortality-linked derivative pricing

    NARCIS (Netherlands)

    Shang, Z.; Goovaerts, M.; Dhaene, J.

    2011-01-01

    In this paper, we develop a recursive method to derive an exact numerical and nearly analytical representation of the Laplace transform of the transition density function with respect to the time variable for time-homogeneous diffusion processes. We further apply this recursion algorithm to the pric

  1. Language, Mind, Practice: Families of Recursive Thinking in Human Reasoning

    Science.gov (United States)

    Josephson, Marika

    2011-01-01

    In 2002, Chomsky, Hauser, and Fitch asserted that recursion may be the one aspect of the human language faculty that makes human language unique in the narrow sense--unique to language and unique to human beings. They also argue somewhat more quietly (as do Pinker and Jackendoff 2005) that recursion may be possible outside of language: navigation,…

  2. Recursive definition of global cellular-automata mappings

    DEFF Research Database (Denmark)

    Feldberg, Rasmus; Knudsen, Carsten; Rasmussen, Steen

    1994-01-01

    A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping as...

  3. Recursive representation of Wronskians in confluent supersymmetric quantum mechanics

    Science.gov (United States)

    Contreras-Astorga, Alonso; Schulze-Halberg, Axel

    2017-03-01

    A recursive form of arbitrary-order Wronskian associated with transformation functions in the confluent algorithm of supersymmetric quantum mechanics (SUSY) is constructed. With this recursive form regularity conditions for the generated potentials can be analyzed. Moreover, as byproducts we obtain new representations of solutions to Schrödinger equations that underwent a confluent SUSY-transformation.

  4. Bivariate Recursive Equations on Excess-of-loss Reinsurance

    Institute of Scientific and Technical Information of China (English)

    Jing Ping YANG; Shi Hong CHENG; Xiao Qian WANG

    2007-01-01

    This paper investigates bivariate recursive equations on excess-of-loss reinsurance.For an insurance portfolio, under the assumptions that the individual claim severity distribution has bounded continuous density and the number of claims belongs to R1(a,b) family, bivariate recursive equations for the joint distribution of the cedent's aggregate claims and the reinsurer's aggre gate claims are obtained.

  5. A step-indexed Kripke model of hidden state via recursive properties on recursively defined metric spaces

    DEFF Research Database (Denmark)

    Birkedal, Lars; Schwinghammer, Jan; Støvring, Kristian

    2010-01-01

    for Chargu´eraud and Pottier’s type and capability system including frame and anti-frame rules, based on the operational semantics and step-indexed heap relations. The worlds are constructed as a recursively defined predicate on a recursively defined metric space, which provides a considerably simpler...

  6. XML: James Webb Space Telescope Database Issues, Lessons, and Status

    Science.gov (United States)

    Detter, Ryan; Mooney, Michael; Fatig, Curtis

    2003-01-01

    This paper will present the current concept using extensible Markup Language (XML) as the underlying structure for the James Webb Space Telescope (JWST) database. The purpose of using XML is to provide a JWST database, independent of any portion of the ground system, yet still compatible with the various systems using a variety of different structures. The testing of the JWST Flight Software (FSW) started in 2002, yet the launch is scheduled for 2011 with a planned 5-year mission and a 5-year follow on option. The initial database and ground system elements, including the commands, telemetry, and ground system tools will be used for 19 years, plus post mission activities. During the Integration and Test (I&T) phases of the JWST development, 24 distinct laboratories, each geographically dispersed, will have local database tools with an XML database. Each of these laboratories database tools will be used for the exporting and importing of data both locally and to a central database system, inputting data to the database certification process, and providing various reports. A centralized certified database repository will be maintained by the Space Telescope Science Institute (STScI), in Baltimore, Maryland, USA. One of the challenges for the database is to be flexible enough to allow for the upgrade, addition or changing of individual items without effecting the entire ground system. Also, using XML should allow for the altering of the import and export formats needed by the various elements, tracking the verification/validation of each database item, allow many organizations to provide database inputs, and the merging of the many existing database processes into one central database structure throughout the JWST program. Many National Aeronautics and Space Administration (NASA) projects have attempted to take advantage of open source and commercial technology. Often this causes a greater reliance on the use of Commercial-Off-The-Shelf (COTS), which is often limiting

  7. MVC Design Pattern for the multi framework distributed applications using XML, spring and struts framework

    Directory of Open Access Journals (Sweden)

    Praveen Gupta,

    2010-07-01

    Full Text Available The model view controller (MVC is a fundamental design pattern for the separation between user interface logic and business logic. Since applications are very large in size these days and the MVC designpattern can weak the coupling among the different application tiers of application. this paper presents a web application framework based on MVC in J2EE platform, and extends it with XML so that the framework is more flexible, expansible and easy to maintain. This is a multi tier system including presentation layer, business layer, data persistence layer and database layer. This separate codes, and improve maintainability and reusability of the application. In this paper, we implemented MVC using spring and struts framework. Our research study show that applying multiple framework to design theapplications using MVC concepts makes applications easier compare to a single framework.

  8. Online damage detection using recursive principal component analysis and recursive condition indicators

    Science.gov (United States)

    Krishnan, M.; Bhowmik, B.; Tiwari, A. K.; Hazra, B.

    2017-08-01

    In this paper, a novel baseline free approach for continuous online damage detection of multi degree of freedom vibrating structures using recursive principal component analysis (RPCA) in conjunction with online damage indicators is proposed. In this method, the acceleration data is used to obtain recursive proper orthogonal modes in online using the rank-one perturbation method, and subsequently utilized to detect the change in the dynamic behavior of the vibrating system from its pristine state to contiguous linear/nonlinear-states that indicate damage. The RPCA algorithm iterates the eigenvector and eigenvalue estimates for sample covariance matrices and new data point at each successive time instants, using the rank-one perturbation method. An online condition indicator (CI) based on the L2 norm of the error between actual response and the response projected using recursive eigenvector matrix updates over successive iterations is proposed. This eliminates the need for offline post processing and facilitates online damage detection especially when applied to streaming data. The proposed CI, named recursive residual error, is also adopted for simultaneous spatio-temporal damage detection. Numerical simulations performed on five-degree of freedom nonlinear system under white noise and El Centro excitations, with different levels of nonlinearity simulating the damage scenarios, demonstrate the robustness of the proposed algorithm. Successful results obtained from practical case studies involving experiments performed on a cantilever beam subjected to earthquake excitation, for full sensors and underdetermined cases; and data from recorded responses of the UCLA Factor building (full data and its subset) demonstrate the efficacy of the proposed methodology as an ideal candidate for real-time, reference free structural health monitoring.

  9. Convergence of recursive functions on computers

    Directory of Open Access Journals (Sweden)

    Erivelton Geraldo Nepomuceno

    2014-10-01

    Full Text Available A theorem is presented which has applications in the numerical computation of fixed points of recursive functions. If a sequence of functions {f(n} is convergent on a metric space I ⊆ ℝ, then it is possible to observe this behaviour on the set ⊂ ℚ of all numbers represented in a computer. However, as is not complete, the representation of f(n on is subject to an error. Then f(n and f(m are considered equal when its differences computed on are equal or lower than the sum of error of each f(n and f(m. An example is given to illustrate the use of the theorem.

  10. Reasoning about Assignments in Recursive Data Structures

    Science.gov (United States)

    Tamalet, Alejandro; Madlener, Ken

    This paper presents a framework to reason about the effects of assignments in recursive data structures. We define an operational semantics for a core language based on Meyer's ideas for a semantics for the object-oriented language Eiffel. A series of field accesses, e.g. f1 • f2 • ··· • fn , can be seen as a path on the heap. We provide rules that describe how these multidot expressions are affected by an assignment. Using multidot expressions to construct an abstraction of a list, we show the correctness of a list reversal algorithm. This approach does not require induction and the reasoning about the assignments is encapsulated in the mentioned rules. We also discuss how to use this approach when working with other data structures and how it compares to the inductive approach. The framework, rules and examples have been formalised and proven correct using the PVS proof assistant.

  11. Recursive identification for EIV ARMAX systems

    Institute of Scientific and Technical Information of China (English)

    CHEN HanFu

    2009-01-01

    The input ukand output yk of the multivariate ARMAX system A(z)y_k = B(z)u_k+C(z)w_k are observed with noises:u_k~(ob)(△=)+εu_k and y_k~(ob)(△=)+εy_k,where ε_k~u and ε_k~y denote the observation noises.Such kind of systems are called errors-in-variables (EIV) systems.In the paper,recursive algorithms based on observations are proposed for estimating coefficients of A(z),B(z),C(z),and the covariance matrix Rw of w_k without requiring higher than the second order statistics.The algorithms are convenient for computation and are proved to converge to the system coefficients under reasonable conditions.An Illustrative example is provided,and the simulation results are shown to be consistent with the theoretical analysis.

  12. Recursive Partitioning Method on Competing Risk Outcomes

    Science.gov (United States)

    Xu, Wei; Che, Jiahua; Kong, Qin

    2016-01-01

    In some cancer clinical studies, researchers have interests to explore the risk factors associated with competing risk outcomes such as recurrence-free survival. We develop a novel recursive partitioning framework on competing risk data for both prognostic and predictive model constructions. We define specific splitting rules, pruning algorithm, and final tree selection algorithm for the competing risk tree models. This methodology is quite flexible that it can corporate both semiparametric method using Cox proportional hazards model and parametric competing risk model. Both prognostic and predictive tree models are developed to adjust for potential confounding factors. Extensive simulations show that our methods have well-controlled type I error and robust power performance. Finally, we apply both Cox proportional hazards model and flexible parametric model for prognostic tree development on a retrospective clinical study on oropharyngeal cancer patients. PMID:27486300

  13. The Recursion Theorem and Infinite Sequences

    CERN Document Server

    Miller, Arnold W

    2008-01-01

    In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove that there exists an increasing sequence such that W_{e_n}={e_{n+1},e_{n+2},...} for every n. We call a nonempty computably enumerable set A self-constructing if W_e=A for every e in A. We show that every nonempty computable enumerable set which is disjoint from an infinite computable set is one-one equivalent to a self-constructing set

  14. On semantics and applications of guarded recursion

    DEFF Research Database (Denmark)

    Bizjak, Aleš

    2016-01-01

    chapter we study a simply typed calculus with additional "later" and "constant" modalities and a guarded fixed-point combinator. These are used for encoding and working with guarded recursive and coinductive types in a modular way. We develop a normalising operational semantics, provide an adequate...... denotational model and a logic for reasoning about program equivalence. In the last three chapters we study syntax and semantics of a dependent type theory with a family of later modalities indexed by the set of clocks, and clock quantifiers. In the fourth and fifth chapters we provide two model constructions......, one using a family of presheaf categories and one using a generalisation of the category of partial equilogical spaces. These model constructions are used to design the rules and prove consistency of the type theory presented in the last chapter. The type theory is a version of polymorphic dependent...

  15. Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind

    Science.gov (United States)

    Arslan, Burcu; Hohenberger, Annette; Verbrugge, Rineke

    2017-01-01

    In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6–6;5 years) and one older (6;7–8;10 years). Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children’s second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck. PMID:28072823

  16. 基于XML/Web Services的网络授课平台的研究%The Research of Network Teaching Platform Based on XML/Web Service

    Institute of Scientific and Technical Information of China (English)

    陈恒

    2010-01-01

    本文首先介绍了XML和Web Services技术,然后讨论了基于XML/Web Services的系统集成技术的特点和优势,最后,利用XML/Web Services技术提出了一个动态的网络授课平台模型.

  17. XML6185J13C Low Floor Articulated Puller Bus%XML6185J13C型低地板拉式铰接客车研制

    Institute of Scientific and Technical Information of China (English)

    陆军; 刘军鹏

    2012-01-01

    The development process, general layout, structure characterisitics and main technical parameters about XML6185J13C articulated puller bus are introduced.%介绍XML6185J13C型拉式铰接客车的研制过程、总体布置、结构特点及主要技术参数。

  18. QuakeML - An XML Schema for Seismology

    Science.gov (United States)

    Wyss, A.; Schorlemmer, D.; Maraini, S.; Baer, M.; Wiemer, S.

    2004-12-01

    We propose an extensible format-definition for seismic data (QuakeML). Sharing data and seismic information efficiently is one of the most important issues for research and observational seismology in the future. The eXtensible Markup Language (XML) is playing an increasingly important role in the exchange of a variety of data. Due to its extensible definition capabilities, its wide acceptance and the existing large number of utilities and libraries for XML, a structured representation of various types of seismological data should in our opinion be developed by defining a 'QuakeML' standard. Here we present the QuakeML definitions for parameter databases and further efforts, e.g. a central QuakeML catalog database and a web portal for exchanging codes and stylesheets.

  19. T:XML: A Tool Supporting User Interface Model Transformation

    Science.gov (United States)

    López-Jaquero, Víctor; Montero, Francisco; González, Pascual

    Model driven development of user interfaces is based on the transformation of an abstract specification into the final user interface the user will interact with. The design of transformation rules to carry out this transformation process is a key issue in any model-driven user interface development approach. In this paper, we introduce T:XML, an integrated development environment for managing, creating and previewing transformation rules. The tool supports the specification of transformation rules by using a graphical notation that works on the basis of the transformation of the input model into a graph-based representation. T:XML allows the design and execution of transformation rules in an integrated development environment. Furthermore, the designer can also preview how the generated user interface looks like after the transformations have been applied. These previewing capabilities can be used to quickly create prototypes to discuss with the users in user-centered design methods.

  20. Ontology-supported and XML-based knowledge description language

    Institute of Scientific and Technical Information of China (English)

    王向华; 覃征; 何坚; 王志敏

    2004-01-01

    Differences in the structure and semantics of knowledge that is created and maintained by the various actors on the World Wide Web make its exchange and utilization a problematic task. This is an important issue facing organizations undertaking knowledge management initiatives. An XML-based and ontology-supported knowledge description language (KDL) is presented, which has three-tier structure (core KDL, extended KDL and complex KDL), and takes advantages of strong point of ontology, XML, description logics, frame-based systems. And then, the framework and XMLbased syntax of KDL are introduced, and the methods of translating KDL into first order logic (FOL) are presented. At last, the implementation of KDL on the Web is described, and the reasoning ability of KDL proved by experiment is illustrated in detail.

  1. XML Labeling Schemes for Dynamic Updates: Strengths and Limitations

    Directory of Open Access Journals (Sweden)

    Samini Subramaniam

    2011-01-01

    Full Text Available The importance of XML processing has become a significant field at present days with the intention to support user queries in the most proficient way. In conjunction with this, many labeling schemes were proposed to identify the elements in XML document uniquely as well as preserve structural relationships among the nodes to cater queries with multiple combinations. On the other hand, due to the flexible structure of XML document, the data that is presented and communicated through this technology changes frequently. Therefore, labeling scheme must be able to support dynamic updates so that the existing labels do not require alteration. In this paper, we present some of the existing labeling techniques and their degree of support for structural relationship and dynamic updates.

  2. The Role of XML in the CMS Detector Description

    Institute of Scientific and Technical Information of China (English)

    M.Liendl; F.vanLingen; 等

    2001-01-01

    Offline Software such as Simulation,Reconstruction,Analysis,and Visualisation are all in need of a detector description.These applications have several common but also many specific requirements for the detector description in order to build up their internal representations.To achieve this in a consistent and coherent manner a common source of information,the detector description database,will be consulted by each of the applications.The role and suitability of XML in the design of the detector description database in the scope of the CMS detector at the LHC is discussed.Different aspects such as data modelling capabilities of XML,tool support,integration to C++ representations of data models are treated and recent results of prototype implementations are presented.

  3. Bioinformatics Data Distribution and Integration via Web Services and XML

    Institute of Scientific and Technical Information of China (English)

    Xiao Li; Yizheng Zhang

    2003-01-01

    It is widely recognized that exchange, distribution, and integration of biological data are the keys to improve bioinformatics and genome biology in post-genomic era. However, the problem of exchanging and integrating biological data is not solved satisfactorily. The eXtensible Markup Language (XML) is rapidly spreading as an emerging standard for structuring documents to exchange and integrate data on the World Wide Web (WWW). Web service is the next generation of WWW and is founded upon the open standards of W3C (World Wide Web Consortium)and IETF (Internet Engineering Task Force). This paper presents XML and Web Services technologies and their use for an appropriate solution to the problem of bioinformatics data exchange and integration.

  4. Regular Expression Subtyping for XML Query and Update Languages

    CERN Document Server

    Cheney, James

    2008-01-01

    XML database query languages such as XQuery employ regular expression types with structural subtyping. Subtyping systems typically have two presentations, which should be equivalent: a declarative version in which the subsumption rule may be used anywhere, and an algorithmic version in which the use of subsumption is limited in order to make typechecking syntax-directed and decidable. However, the XQuery standard type system circumvents this issue by using imprecise typing rules for iteration constructs and defining only algorithmic typechecking, and another extant proposal provides more precise types for iteration constructs but ignores subtyping. In this paper, we consider a core XQuery-like language with a subsumption rule and prove the completeness of algorithmic typechecking; this is straightforward for XQuery proper but requires some care in the presence of more precise iteration typing disciplines. We extend this result to an XML update language we have introduced in earlier work.

  5. AONBench: A Methodology for Benchmarking XML Based Service Oriented Applications

    Directory of Open Access Journals (Sweden)

    Abdul Waheed

    2007-09-01

    Full Text Available Service Oriented Architectures (SOA and applications increasingly rely on network infrastructure instead of back-end servers. Cisco system Application Oriented Networking (AON initiative exemplifies this trend. Benchmarking such infrastructure and their services is expected to play an important role in the networking industry. We present AONBech specifications and methodology to benchmark networked XML application servers and appliances. AONBench is not a benchmarking tool. It is a specification and methodology for performance measurements, which leverages from existing XML microbenchmarks and uses HTTP for end-to-end communication. We implement AONBench specifications for end-to-end performance measurements through public domain HTTP load generation tool ApacheBench and Apache web server. We present three case studies of using AONBench for architecting real application oriented networking products.

  6. XML-based product information processing method for product design

    Science.gov (United States)

    Zhang, Zhen Yu

    2012-01-01

    Design knowledge of modern mechatronics product is based on information processing as the center of the knowledge-intensive engineering, thus product design innovation is essentially the knowledge and information processing innovation. Analysis of the role of mechatronics product design knowledge and information management features, a unified model of XML-based product information processing method is proposed. Information processing model of product design includes functional knowledge, structural knowledge and their relationships. For the expression of product function element, product structure element, product mapping relationship between function and structure based on the XML model are proposed. The information processing of a parallel friction roller is given as an example, which demonstrates that this method is obviously helpful for knowledge-based design system and product innovation.

  7. XDANNG: XML based Distributed Artificial Neural Network with Globus Toolkit

    CERN Document Server

    Mahini, Hamidreza; Ghofrani, Javad

    2009-01-01

    Artificial Neural Network is one of the most common AI application fields. This field has direct and indirect usages most sciences. The main goal of ANN is to imitate biological neural networks for solving scientific problems. But the level of parallelism is the main problem of ANN systems in comparison with biological systems. To solve this problem, we have offered a XML-based framework for implementing ANN on the Globus Toolkit Platform. Globus Toolkit is well known management software for multipurpose Grids. Using the Grid for simulating the neuron network will lead to a high degree of parallelism in the implementation of ANN. We have used the XML for improving flexibility and scalability in our framework.

  8. John Cleland's The Dictionary of Love: An XML Edition

    OpenAIRE

    Davis, Emily Katherine

    2007-01-01

    Conducting and disseminating humanities research is fast becoming a highly technological endeavor. The variety of multimedia options for presenting information changes the questions we ask and the answers we find as well as the problems we encounter and the solutions we devise. The following essays provide an account of creating a digital edition of John Cleland's The Dictionary of Love using XML. The project utilizes traditional literary research methods while working toward an untraditio...

  9. Interactive Poster: Exploring Block Access Patterns of Native XML Storage

    OpenAIRE

    Janetzko, Halldór; Keim, Daniel A.; Kramis, Marc; Mansmann, Florian; Waldvogel, Marcel

    2006-01-01

    Recent block-based native XML storage systems such as IDEFIX touch blocks according to the XQuery engine s execution plan. The resulting access patterns are virtually unknown and potentially cause many expensive disk seeks. Visualization comes to the rescue when extensive log files must be analyzed a tedious and difficult task. The dynamic time-based block-touch animation as well as the static block-type information of VISUAL IDEFIX foster the insight into the performance-critical internals...

  10. XSemantic: An Extension of LCA Based XML Semantic Search

    Science.gov (United States)

    Supasitthimethee, Umaporn; Shimizu, Toshiyuki; Yoshikawa, Masatoshi; Porkaew, Kriengkrai

    One of the most convenient ways to query XML data is a keyword search because it does not require any knowledge of XML structure or learning a new user interface. However, the keyword search is ambiguous. The users may use different terms to search for the same information. Furthermore, it is difficult for a system to decide which node is likely to be chosen as a return node and how much information should be included in the result. To address these challenges, we propose an XML semantic search based on keywords called XSemantic. On the one hand, we give three definitions to complete in terms of semantics. Firstly, the semantic term expansion, our system is robust from the ambiguous keywords by using the domain ontology. Secondly, to return semantic meaningful answers, we automatically infer the return information from the user queries and take advantage of the shortest path to return meaningful connections between keywords. Thirdly, we present the semantic ranking that reflects the degree of similarity as well as the semantic relationship so that the search results with the higher relevance are presented to the users first. On the other hand, in the LCA and the proximity search approaches, we investigated the problem of information included in the search results. Therefore, we introduce the notion of the Lowest Common Element Ancestor (LCEA) and define our simple rule without any requirement on the schema information such as the DTD or XML Schema. The first experiment indicated that XSemantic not only properly infers the return information but also generates compact meaningful results. Additionally, the benefits of our proposed semantics are demonstrated by the second experiment.

  11. An XML Driven Framework for Test Control and Data Analysis

    OpenAIRE

    2001-01-01

    An extensible, component-based framework has been developed at Fermilab to promote software reuse and provide a common platform for developing a family of test and data analysis systems. The framework allows for configuring applications from components through the use of XML configurations. It can be easily extended by adding new components and many application independent components are already provided with the framework. The core of the system has been developed in Java which guarantees it...

  12. Toward a Normalized XML Schema for the GGP Data Archives

    Directory of Open Access Journals (Sweden)

    Alban Gabillon

    2013-04-01

    Full Text Available Since 1997, the Global Geodynamics Project (GGP stations have used a text-based data format. The main drawback of this type of data coding is the lack of data integrity during the data flow processing. As a result, metadata and even data must be checked by human operators. In this paper, we propose a new format for representing the GGP data. This new format is based on the eXtensible Markup Language (XML.

  13. Migration to Intermediate XML for Electronic Data(MIXED)

    Institute of Scientific and Technical Information of China (English)

    DIRK ROORDA

    2008-01-01

    MIXED is a digital preser vation project.It uses a strategy of converting data to intermediate XML.In this paperwe position this strategy with respect to the well-known emulation and migration strategies.Then we detail the MIXED strategy and explain why it is an optimized,economical way of migration.Finally,we describe how DANS is implementing a soft-ware tool that can perform the migrations needed for this strategy.

  14. Efficient Mining of Frequent Closed XML Query Pattern

    Institute of Scientific and Technical Information of China (English)

    Jian-Hua Feng; Qian Qian; Jian-Yong Wang; Li-Zhu Zhou

    2007-01-01

    Previous research works have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent but only the closed ones because the latter leads to not only more compact yet complete result set but also better efficiency. Upon discovery of frequent closed XML query patterns, indexing and caching can be effectively adopted for query performance enhancement. Most of the previous algorithms for finding frequent patterns basically introduced a straightforward generate-and-test strategy. In this paper, we present SOLARIA*, an efficient algorithm for mining frequent closed XML query patterns without candidate maintenance and costly tree-containment checking. Efficient algorithm of sequence mining is involved in discovering frequent tree-structured patterns, which aims at replacing expensive containment testing with cheap parent-child checking in sequences. SOLARIA* deeply prunes unrelated search space for frequent pattern enumeration by parent-child relationship constraint. By a thorough experimental study on various real-life data, we demonstrate the efficiency and scalability of SOLARIA* over the previous known alternative. SOLARIA* is also linearly scalable in terms of XML queries' size.

  15. Extracting TARs from XML for Efficient Query Answering

    Directory of Open Access Journals (Sweden)

    Dhanasree

    2012-12-01

    Full Text Available The massive amount of datasets expressed in different formats,such as relational, XML, and RDF, avail-able in several realapplications, may cause some difficulties to non-expert userstrying to access these datasets without having sufficientknowledge on their content and structure. Moreover, theprocesses of query composition, especially in the absence of aschema, and interpretation of the obtained answers may benon-trivial. The existing data mining process is often guided bythe designer, who determines the portion of a dataset whereuseful patterns can be extracted based on his/her deepknowledge of the application scenario. In this paper, wepropose efficient mining techniques to mine hiddeninformation from huge datasets, and then use it in order to gainuseful knowledge which helps inexperienced users to accesshuge XML datasets. We also describe XML mining tool whichimplemented using Java encompasses two main features 1 itmines all the frequent association rules from input documentswithout any a-priori specification of the desired results 2 itprovides quick, summarized, thus often approximate answersto user’s queries, by using the previously mined knowledge.

  16. Rock.XML - Towards a library of rock physics models

    Science.gov (United States)

    Jensen, Erling Hugo; Hauge, Ragnar; Ulvmoen, Marit; Johansen, Tor Arne; Drottning, Åsmund

    2016-08-01

    Rock physics modelling provides tools for correlating physical properties of rocks and their constituents to the geophysical observations we measure on a larger scale. Many different theoretical and empirical models exist, to cover the range of different types of rocks. However, upon reviewing these, we see that they are all built around a few main concepts. Based on this observation, we propose a format for digitally storing the specifications for rock physics models which we have named Rock.XML. It does not only contain data about the various constituents, but also the theories and how they are used to combine these building blocks to make a representative model for a particular rock. The format is based on the Extensible Markup Language XML, making it flexible enough to handle complex models as well as scalable towards extending it with new theories and models. This technology has great advantages as far as documenting and exchanging models in an unambiguous way between people and between software. Rock.XML can become a platform for creating a library of rock physics models; making them more accessible to everyone.

  17. Recursive estimation of prior probabilities using the mixture approach

    Science.gov (United States)

    Kazakos, D.

    1974-01-01

    The problem of estimating the prior probabilities q sub k of a mixture of known density functions f sub k(X), based on a sequence of N statistically independent observations is considered. It is shown that for very mild restrictions on f sub k(X), the maximum likelihood estimate of Q is asymptotically efficient. A recursive algorithm for estimating Q is proposed, analyzed, and optimized. For the M = 2 case, it is possible for the recursive algorithm to achieve the same performance with the maximum likelihood one. For M 2, slightly inferior performance is the price for having a recursive algorithm. However, the loss is computable and tolerable.

  18. Ward identity implies recursion relations in Yang-Mills theory

    Science.gov (United States)

    Chen, Gang

    2012-07-01

    The Ward identity in gauge theory constrains the behavior of the amplitudes. We discuss the Ward identity for amplitudes with a pair of shifted lines with complex momenta. This will induce a recursion relation identical to Britto-Cachazo-Feng-Witten recursion relations at the finite poles of the complexified amplitudes. Furthermore, according to the Ward identity, it is also possible to transform the boundary term into a simple form, which can be obtained by a new recursion relation. For the amplitude with one off-shell line in pure Yang-Mills theory, we find this technique is effective for obtaining the amplitude even when there are boundary contributions.

  19. On the symmetries of some classes of recursive circulant graphs

    Directory of Open Access Journals (Sweden)

    Seyed Morteza Mirafzal

    2014-03-01

    Full Text Available A recursive-circulant $G(n; d$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$G(n; d$ is vertex-transitive, and has some strong hamiltonianproperties. $G(n; d$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. In this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. In particular, wewill find that the automorphism group of $G(2^m; 4$ is isomorphicwith the group $D_{2 cdot 2^m}$, the dihedral group of order $2^{m+1}

  20. Spin-orbit coupling a recursion method approach

    CERN Document Server

    Huda, A U; Mookerjee, A; Paudyal, D

    2003-01-01

    Relativistic effects play a significant role in alloys of the heavier elements. The majority of earlier works on alloys had included the scalar relativistic corrections. We present here a methodology to take into account the spin-orbit coupling using the recursion method. The basis used for the representation of the Hamiltonian is the TB-LMTO, since its sparseness is an essential requirement for recursion. The recursion technique can then be extended to augmented space to deal with disordered alloys or rough surfaces.

  1. Diagonally loaded SMI algorithm based on inverse matrix recursion

    Institute of Scientific and Technical Information of China (English)

    Cao Jianshu; Wang Xuegang

    2007-01-01

    The derivation of a diagonally loaded sample-matrix inversion (LSMI) algorithm on the busis of inverse matrix recursion (i.e. LSMI-IMR algorithm) is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, acorresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings.Simulations show that the LSMI-IMR algorithm is valid.

  2. How to Build an XML Web Client for the Gold Rush Link Resolver’s XML Gateway Web Services Layer

    Directory of Open Access Journals (Sweden)

    Brian Kysela

    2009-03-01

    Full Text Available The Gold Rush link resolver (GRLR is part of a suite of programs developed by the Colorado Alliance of Research Libraries (CARL which help manage a library's electronic resources. It contains the essential features required to perform link resolution, and comes at a substantial discount compared to other commercial Link Resolvers. After a comprehensive review of the available options, the library at the University of Tennessee at Chattanooga (UTC chose to implement Gold Rush over the summer of 2008. The UTC library also decided to take advantage of the release of the Gold Rush XML Gateway Web Services Layer by the Colorado Alliance in the spring of 2008. This article is a case study of how the UTC XML Web client was built and the steps necessary to successfully deploy such a client.

  3. HiSC: A Hybrid XML Index Composing Structure-Encoded with Cluster

    Institute of Scientific and Technical Information of China (English)

    YANG Jincai; ZHANG Lin

    2007-01-01

    A new way of indexing and processing twig patterns in an XML documents is proposed in this paper. Every path in XML document can be transformed into a sequence of labels by Structure-Encoded that constructs a one-to-one correspondence between XML tree and sequence. Base on identifying characteristics of nodes in XML tree, the elements are classified and clustered. During query proceeding, the twig pattern is also transformed into its Structure-Encoded. By performing subsequence matching on the set of sequences in XML documents, all the occurrences of path in the XML documents are refined. Using the index, the numbers of elements retrieved are minimized. The search results with pertinent format provide more structure information without any false dismissals or false alarms. The index also supports keyword search.Experiment results indicate the index has significantly efficiency with high precision.

  4. Parallel Implementation of Riccati Recursion for Solving Linear-Quadratic Control Problems

    DEFF Research Database (Denmark)

    Frison, Gianluca; Jørgensen, John Bagterp

    2013-01-01

    In both Active-Set (AS) and Interior-Point (IP) algorithms for Model Predictive Control (MPC), sub-problems in the form of linear-quadratic (LQ) control problems need to be solved at each iteration. The solution of these sub-problems is usually the main computational effort. In this paper...... an alternative version of the Riccati recursion solver for LQ control problems is presented. The performance of both the classical and the alternative version is analyzed from a theoretical as well as a numerical point of view, and the alternative version is found to be approximately 50% faster than...

  5. On Fusing Recursive Traversals of K-d Trees

    Energy Technology Data Exchange (ETDEWEB)

    Rajbhandari, Samyam; Kim, Jinsung; Krishnamoorthy, Sriram; Pouchet, Louis-Noel; Rastello, Fabrice; Harrison, Robert J.; Sadayappan, Ponnuswamy

    2016-03-17

    Loop fusion is a key program transformation for data locality optimization that is implemented in production compilers. But optimizing compilers currently cannot exploit fusion opportunities across a set of recursive tree traversal computations with producer-consumer relationships. In this paper, we develop a compile-time approach to dependence characterization and program transformation to enable fusion across recursively specified traversals over k-ary trees. We present the FuseT source-to-source code transformation framework to automatically generate fused composite recursive operators from an input program containing a sequence of primitive recursive operators. We use our framework to implement fused operators for MADNESS, Multiresolution Adaptive Numerical Environment for Scientific Simulation. We show that locality optimization through fusion can offer more than an order of magnitude performance improvement.

  6. Recursively determined representing measures for bivariate truncated moment sequences

    CERN Document Server

    Curto, Raul E

    2012-01-01

    A theorem of Bayer and Teichmann implies that if a finite real multisequence \\beta = \\beta^(2d) has a representing measure, then the associated moment matrix M_d admits positive, recursively generated moment matrix extensions M_(d+1), M_(d+2),... For a bivariate recursively determinate M_d, we show that the existence of positive, recursively generated extensions M_(d+1),...,M_(2d-1) is sufficient for a measure. Examples illustrate that all of these extensions may be required to show that \\beta has a measure. We describe in detail a constructive procedure for determining whether such extensions exist. Under mild additional hypotheses, we show that M_d admits an extension M_(d+1) which has many of the properties of a positive, recursively generated extension.

  7. Average weighted receiving time in recursive weighted Koch networks

    Indian Academy of Sciences (India)

    DAI MEIFENG; YE DANDAN; LI XINGYI; HOU JIE

    2016-06-01

    Motivated by the empirical observation in airport networks and metabolic networks, we introduce the model of the recursive weighted Koch networks created by the recursive division method. As a fundamental dynamical process, random walks have received considerable interest in the scientific community. Then, we study the recursive weighted Koch networks on random walk i.e., the walker, at each step, starting from its current node, moves uniformly to any of itsneighbours. In order to study the model more conveniently, we use recursive division method again to calculate the sum of the mean weighted first-passing times for all nodes to absorption at the trap located in the merging node. It is showed that in a large network, the average weighted receiving time grows sublinearly with the network order.

  8. On Measuring Non-Recursive Trade-Offs

    Directory of Open Access Journals (Sweden)

    Hermann Gruber

    2009-07-01

    Full Text Available We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general. We also identify criteria which, in the spirit of abstract language theory, allow us to deduce non-recursive tradeoffs from effective closure properties of language families on the one hand, and differences in the decidability status of basic decision problems on the other. We develop a qualitative classification of non-recursive trade-offs in order to obtain a better understanding of this very fundamental behaviour of descriptional systems.

  9. A Recursive Receding Horizon Planning for Unmanned Vehicles

    Data.gov (United States)

    National Aeronautics and Space Administration — This paper proposes a recursive receding horizon path planning algorithm for unmanned vehicles in nonuniform environments. In the proposed algorithm, the map is...

  10. Recursion as a Human Universal and as a Primitive

    Directory of Open Access Journals (Sweden)

    Boban Arsenijevic

    2010-09-01

    Full Text Available This contribution asks, in an empirical rather than formal perspective, whether a range of descriptive phenomena in grammar usually characterized in terms of ‘recursion’ actually exhibit recursion. It is concluded that empirical evidence does not support this customary assumption. Language, while formally recursive, need not be recursive in the underlying generative mechanisms of its grammar. Hence, while recursion may well be one of the hallmarks of human nature, grammar may not be the cognitive domain where it is found. Arguments for this claim are briefly exposed and then discussed with respect to a selection of talks from the DGfS workshop on Foundations of Language Comparison: Human Universals as Constraints on Language Diversity that led to this special issue.

  11. A novel extended kernel recursive least squares algorithm.

    Science.gov (United States)

    Zhu, Pingping; Chen, Badong; Príncipe, José C

    2012-08-01

    In this paper, a novel extended kernel recursive least squares algorithm is proposed combining the kernel recursive least squares algorithm and the Kalman filter or its extensions to estimate or predict signals. Unlike the extended kernel recursive least squares (Ex-KRLS) algorithm proposed by Liu, the state model of our algorithm is still constructed in the original state space and the hidden state is estimated using the Kalman filter. The measurement model used in hidden state estimation is learned by the kernel recursive least squares algorithm (KRLS) in reproducing kernel Hilbert space (RKHS). The novel algorithm has more flexible state and noise models. We apply this algorithm to vehicle tracking and the nonlinear Rayleigh fading channel tracking, and compare the tracking performances with other existing algorithms.

  12. RECURSIVE CONVEYOR PROCESSES - THE MAIN PROPERTIES AND CHARACTERISTICS

    Directory of Open Access Journals (Sweden)

    Boris V. Kupriyanov

    2015-01-01

    Full Text Available In the article the formal model of recursive conveyor processes is considered. The main properties and characteristics ofthis type of processes are described andillustrated. Based on these properties splitting processes into classes is carried out.

  13. Implementing Marine XML for Observed CTD Data in a Marine Data Exchange Platform

    Institute of Scientific and Technical Information of China (English)

    JIANG Yongguo; FENG Yuan; CHE Zhaodong; ZHU Tieyi

    2008-01-01

    In order to archive,quality control and disseminate a large variety of marine data in a marine data exchange platform,a marine XML has been developed to encapsulate marine data,which provides an efficient means to store,transfer and display marine data.This paper first presents the details of the main marine XML elements and then gives an example showing how to transform CTD-observed data into Marine XML format,which illustrates the XML encapsulation process of marine observed data.

  14. HOPF ALGEBRAIC APPROACH TO THE n LINEARLY RECURSIVE SEQUENCES

    Institute of Scientific and Technical Information of China (English)

    LIANGGUI

    1994-01-01

    It is proved that a linearly recursive sequence of n indicea over field F(n≥1) is autorntatically a product of n lioearly recurplve sequencea of 1-lndex over F by the theory of Hopf algebras.By the way,the correspondence between the set of linearly recursive sequenoes of 1-index and F[X]0 is generalised to the case of n-index.

  15. CONDITIONAL RECURSIVE EQUATIONS ON EXCESS-OF-LOSS REINSURANCE

    Institute of Scientific and Technical Information of China (English)

    YANG Jing-ping; WANG Xiao-qian; CHENG Shi-hong

    2006-01-01

    The marginal recursive equations on excess-of-loss reinsurance treaty are investignted, under the assumption that the number of claims belongs to the family consisting of Poisson, binomial and negative binomial, and that the severity distribution has bounded continuous density function. On conditional of the numbers of claims associated with the reinsurer and the cedent, some recursive equations are obtained for the marginal distributions of the total payments of the reinsurer and the cedent.

  16. Recursive least squares background prediction of univariate syndromic surveillance data

    OpenAIRE

    Burkom Howard; Najmi Amir-Homayoon

    2009-01-01

    Abstract Background Surveillance of univariate syndromic data as a means of potential indicator of developing public health conditions has been used extensively. This paper aims to improve the performance of detecting outbreaks by using a background forecasting algorithm based on the adaptive recursive least squares method combined with a novel treatment of the Day of the Week effect. Methods Previous work by the first author has suggested that univariate recursive least squares analysis of s...

  17. Color-dressed recursive relations for multi-parton amplitudes

    CERN Document Server

    Duhr, C; Maltoni, F; Duhr, Claude; Hoeche, Stefan; Maltoni, Fabio

    2006-01-01

    Remarkable progress inspired by twistors has lead to very simple analytic expressions and to new recursive relations for multi-parton color-ordered amplitudes. We show how such relations can be extended to include color and present the corresponding color-dressed formulation for the Berends-Giele, BCF and a new kind of CSW recursive relations. A detailed comparison of the numerical efficiency of the different approaches to the calculation of multi-parton cross sections is performed.

  18. Recursive construction of perfect DNA molecules from imperfect oligonucleotides.

    Science.gov (United States)

    Linshiz, Gregory; Yehezkel, Tuval Ben; Kaplan, Shai; Gronau, Ilan; Ravid, Sivan; Adar, Rivka; Shapiro, Ehud

    2008-01-01

    Making faultless complex objects from potentially faulty building blocks is a fundamental challenge in computer engineering, nanotechnology and synthetic biology. Here, we show for the first time how recursion can be used to address this challenge and demonstrate a recursive procedure that constructs error-free DNA molecules and their libraries from error-prone oligonucleotides. Divide and Conquer (D&C), the quintessential recursive problem-solving technique, is applied in silico to divide the target DNA sequence into overlapping oligonucleotides short enough to be synthesized directly, albeit with errors; error-prone oligonucleotides are recursively combined in vitro, forming error-prone DNA molecules; error-free fragments of these molecules are then identified, extracted and used as new, typically longer and more accurate, inputs to another iteration of the recursive construction procedure; the entire process repeats until an error-free target molecule is formed. Our recursive construction procedure surpasses existing methods for de novo DNA synthesis in speed, precision, amenability to automation, ease of combining synthetic and natural DNA fragments, and ability to construct designer DNA libraries. It thus provides a novel and robust foundation for the design and construction of synthetic biological molecules and organisms.

  19. Recursive implementations of temporal filters for image motion computation.

    Science.gov (United States)

    Clifford, C W; Langley, K

    2000-05-01

    Efficient algorithms for image motion computation are important for computer vision applications and the modelling of biological vision systems. Intensity-based image motion computation proceeds in two stages: the convolution of linear spatiotemporal filter kernels with the image sequence, followed by the non-linear combination of the filter outputs. If the spatiotemporal extent of the filter kernels is large, then the convolution stage can be very intensive computationally. One effective means of reducing the storage required and computation involved in implementing the temporal convolutions is the introduction of recursive filtering. Non-recursive methods require the number of frames of the image sequence stored at any given time to be equal to the temporal extent of the slowest temporal filter. In contrast, recursive methods encode recent stimulus history implicitly in the values of a small number of variables updated through a series of feedback equations. Recursive filtering reduces the number of values stored in memory during convolution and the number of mathematical operations involved in computing the filters' outputs. This paper extends previous recursive implementations of gradient- and correlation-based motion analysis algorithms [Fleet DJ, Langley K (1995) IEEE PAMI 17: 61-67; Clifford CWG, Ibbotson MR, Langley K (1997) Vis Neurosci 14: 741-749], describing a recursive implementation of causal band-pass temporal filters suitable for use in energy- and phase-based algorithms for image motion computation. It is shown that the filters' temporal frequency tuning curves fit psychophysical estimates of the temporal properties of human visual filters.

  20. Recursive Construction of Operator Product Expansion Coefficients

    Science.gov (United States)

    Holland, Jan; Hollands, Stefan

    2015-06-01

    We derive a novel formula for the derivative of operator product expansion (OPE) coefficients with respect to a coupling constant. The formula involves just the OPE coefficients themselves but no further input, and is in this sense self-consistent. Furthermore, unlike other formal identities of this general nature in quantum field theory (such as the formal expression for the Lagrangian perturbation of a correlation function), our formula requires no further UV-renormalization, i.e., it is completely well-defined from the start. This feature is a result of a cancelation of UV- and IR-divergences between various terms in our identity. Our proof, and an analysis of the features of the identity, is given for the example of massive, Euclidean theory in 4 dimensional Euclidean space. It relies on the renormalization group flow equation method and is valid to arbitrary, but finite orders in perturbation theory. The final formula, however, makes neither explicit reference to the renormalization group flow, nor to perturbation theory, and we conjecture that it also holds non-perturbatively. Our identity can be applied constructively because it gives a novel recursive algorithm for the computation of OPE coefficients to arbitrary (finite) perturbation order in terms of the zeroth order coefficients corresponding to the underlying free field theory, which in turn are trivial to obtain. We briefly illustrate the relation of this method to more standard methods for computing the OPE in some simple examples.

  1. The loading problem for recursive neural networks.

    Science.gov (United States)

    Gori, Marco; Sperduti, Alessandro

    2005-10-01

    The present work deals with one of the major and not yet completely understood topics of supervised connectionist models. Namely, it investigates the relationships between the difficulty of a given learning task and the chosen neural network architecture. These relationships have been investigated and nicely established for some interesting problems in the case of neural networks used for processing vectors and sequences, but only a few studies have dealt with loading problems involving graphical inputs. In this paper, we present sufficient conditions which guarantee the absence of local minima of the error function in the case of learning directed acyclic graphs with recursive neural networks. We introduce topological indices which can be directly calculated from the given training set and that allows us to design the neural architecture with local minima free error function. In particular, we conceive a reduction algorithm that involves both the information attached to the nodes and the topology, which enlarges significantly the class of the problems with unimodal error function previously proposed in the literature.

  2. Recursion to food plants by free-ranging Bornean elephant

    Directory of Open Access Journals (Sweden)

    Megan English

    2015-08-01

    Full Text Available Plant recovery rates after herbivory are thought to be a key factor driving recursion by herbivores to sites and plants to optimise resource-use but have not been investigated as an explanation for recursion in large herbivores. We investigated the relationship between plant recovery and recursion by elephants (Elephas maximus borneensis in the Lower Kinabatangan Wildlife Sanctuary, Sabah. We identified 182 recently eaten food plants, from 30 species, along 14 × 50 m transects and measured their recovery growth each month over nine months or until they were re-browsed by elephants. The monthly growth in leaf and branch or shoot length for each plant was used to calculate the time required (months for each species to recover to its pre-eaten length. Elephant returned to all but two transects with 10 eaten plants, a further 26 plants died leaving 146 plants that could be re-eaten. Recursion occurred to 58% of all plants and 12 of the 30 species. Seventy-seven percent of the re-eaten plants were grasses. Recovery times to all plants varied from two to twenty months depending on the species. Recursion to all grasses coincided with plant recovery whereas recursion to most browsed plants occurred four to twelve months before they had recovered to their previous length. The small sample size of many browsed plants that received recursion and uneven plant species distribution across transects limits our ability to generalise for most browsed species but a prominent pattern in plant-scale recursion did emerge. Plant recovery time was a good predictor of time to recursion but varied as a function of growth form (grass, ginger, palm, liana and woody and differences between sites. Time to plant recursion coincided with plant recovery time for the elephant’s preferred food, grasses, and perhaps also gingers, but not the other browsed species. Elephants are bulk feeders so it is likely that they time their returns to bulk feed on these grass species when

  3. XML Database Storing Strategy Based on Schema Path Analysis%基于Schema路径分析的XML数据库存储策略

    Institute of Scientific and Technical Information of China (English)

    朱震; 左春

    2003-01-01

    With XML standards playing more and more important role at information exchanges in data management,the XML database storing strategy which supports huge amount XML data control from bottom layer of database hasbecome the key part of fields such as content management. This article proposes an efficiently XML storing strategyfrom the perspective of constraint schema of XML instance based on XML Schema path analysis.

  4. DEVELOPING FLEXIBLE APPLICATIONS WITH XML AND DATABASE INTEGRATION

    Directory of Open Access Journals (Sweden)

    Hale AS

    2004-04-01

    Full Text Available In recent years the most popular subject in Information System area is Enterprise Application Integration (EAI. It can be defined as a process of forming a standart connection between different systems of an organization?s information system environment. The incorporating, gaining and marriage of corporations are the major reasons of popularity in Enterprise Application Integration. The main purpose is to solve the application integrating problems while similar systems in such corporations continue working together for a more time. With the help of XML technology, it is possible to find solutions to the problems of application integration either within the corporation or between the corporations.

  5. An XML-based information model for archaeological pottery

    Institute of Scientific and Technical Information of China (English)

    LIU De-zhi; RAZDAN Anshuman; SIMON Arleyn; BAE Myungsoo

    2005-01-01

    An information model is defined to support sharing scientific information on Web for archaeological pottery. Apart from non-shape information, such as age, material, etc., the model also consists of shape information and shape feature information. Shape information is collected by Lasers Scanner and geometric modelling techniques. Feature information is generated from shape information via feature extracting techniques. The model is used in an integrated storage, archival, and sketch-based query and retrieval system for 3D objects, native American ceramic vessels. A novel aspect of the information model is that it is totally implemented with XML, and is designed for Web-based visual query and storage application.

  6. An XML Driven Framework for Test Control and Data Analysis

    CERN Document Server

    Nogiec, J M; Walbridge, D G C; Desavouret, E

    2001-01-01

    An extensible, component-based framework has been developed at Fermilab to promote software reuse and provide a common platform for developing a family of test and data analysis systems. The framework allows for configuring applications from components through the use of XML configurations. It can be easily extended by adding new components and many application independent components are already provided with the framework. The core of the system has been developed in Java which guarantees its portability and facilitates the use of object-oriented development technologies.

  7. Content Management von Leittexten mit XML Topic Maps

    Directory of Open Access Journals (Sweden)

    Johannes Busse

    2003-07-01

    Full Text Available Die Autoren definieren den Umgang mit internet- basierten Informations- und Kommunikationstechnologien als Schlüsselqualifikation für Studierende aller Fachrichtungen. Im vorliegenden Aufsatz beschreiben sie ein Projekt, das der Fachbereich Erziehungswissenschaften der Universität Heidelberg seit 2001 durchführt. Hier werden Studierende der Geistes- und Sozialwissenschaften zu "Lernberatern" ausgebildet, die als Multiplikatoren die notwendigen Kenntnisse erwerben. Die Teilnehmenden erarbeiten nach der "Leittextmethode" selbstgesteuert xml-basierte Contents. Dies setzt den Erwerb von informationstechnischen Kenntnissen voraus, der neben dem Aufbau eines (sowohl technischen als auch sozialen Netzwerks einen Schwerpunkt bildet.

  8. Chemical Markup, XML, and the World Wide Web. 7. CMLSpect, an XML vocabulary for spectral data.

    Science.gov (United States)

    Kuhn, Stefan; Helmus, Tobias; Lancashire, Robert J; Murray-Rust, Peter; Rzepa, Henry S; Steinbeck, Christoph; Willighagen, Egon L

    2007-01-01

    CMLSpect is an extension of Chemical Markup Language (CML) for managing spectral and other analytical data. It is designed to be flexible enough to contain a wide variety of spectral data. The paper describes the CMLElements used and gives practical examples for common types of spectra. In addition it demonstrates how different views of the data can be expressed and what problems still exist.

  9. Research of Web Data Mining Based on XML%基于XML的Web数据挖掘的研究

    Institute of Scientific and Technical Information of China (English)

    刘振岩; 王万森

    2003-01-01

    The paper advances a system framework of Web data mining based on XML. This system framework inte-grates Information Retrieval with Information Extraction, and utilizes traditional data mining methods to completeWeb data mining through XML.

  10. Evaluating XML-Extended OLAP Queries Based on a Physical Algebra

    DEFF Research Database (Denmark)

    Yin, Xuepeng; Pedersen, Torben Bach

    2006-01-01

    . In this paper, we extend previous work on the logical federation of OLAP and XML data sources by presenting a simplified query semantics, a physical query algebra and a robust OLAP-XML query engine as well as the query evaluation techniques. Performance experiments with a prototypical implementation suggest...

  11. Evaluating XML-Extended OLAP Queries Based on a Physical Algebra

    DEFF Research Database (Denmark)

    Yin, Xuepeng; Pedersen, Torben Bach

    2004-01-01

    is desirable. In this paper, we extend previous work on the logical federation of OLAP and XML data sources by presenting a simplified query semantics,a physical query algebra and a robust OLAP-XML query engine.Performance experiments with a prototypical implementation suggest that the performance for OLAP...

  12. Integrated Syntactic/Semantic XML Data Validation with a Reusable Software Component

    Science.gov (United States)

    Golikov, Steven

    2013-01-01

    Data integration is a critical component of enterprise system integration, and XML data validation is the foundation for sound data integration of XML-based information systems. Since B2B e-commerce relies on data validation as one of the critical components for enterprise integration, it is imperative for financial industries and e-commerce…

  13. Description of the ATLAS Hadronic End-Cap Calorimeter in XML

    CERN Document Server

    Karapetian, G V

    2000-01-01

    The geometry of the Atlas Hadronic end-cap calorimeter (HEC) is implemented in XML language. Geometry identifiers of sensitive parts of the detector are proposed. A program written in java prints out the essential parts of the geometrical data in XML.

  14. Managing XML Data to optimize Performance into Object-Relational Databases

    Directory of Open Access Journals (Sweden)

    Iuliana BOTHA

    2011-06-01

    Full Text Available This paper propose some possibilities for manage XML data in order to optimize performance into object-relational databases. It is detailed the possibility of storing XML data into such databases, using for exemplification an Oracle database and there are tested some optimizing techniques of the queries over XMLType tables, like indexing and partitioning tables.

  15. Evaluating XML-Extended OLAP Queries Based on a Physical Algebra

    DEFF Research Database (Denmark)

    Yin, Xuepeng; Pedersen, Torben Bach

    2004-01-01

    is desirable. In this paper, we extend previous work on the logical federation of OLAP and XML data sources by presenting a simplified query semantics,a physical query algebra and a robust OLAP-XML query engine.Performance experiments with a prototypical implementation suggest that the performance for OLAP...

  16. Integrated Syntactic/Semantic XML Data Validation with a Reusable Software Component

    Science.gov (United States)

    Golikov, Steven

    2013-01-01

    Data integration is a critical component of enterprise system integration, and XML data validation is the foundation for sound data integration of XML-based information systems. Since B2B e-commerce relies on data validation as one of the critical components for enterprise integration, it is imperative for financial industries and e-commerce…

  17. The Role of Efficient XML Interchange (EXI) in Navy Wide-Area Network (WAN) Optimization

    Science.gov (United States)

    2015-03-01

    Language (XML) (W3C, 2014). The rapid adoption of web applications and media-rich Internet applications has made XML a foundational pillar for data...side, Navy ships have the capability of connecting to WAN services provided over copper or possibly fiber optic connections. Once deployed, however

  18. Towards health care process description framework: an XML DTD design.

    Science.gov (United States)

    Staccini, P; Joubert, M; Quaranta, J F; Aymard, S; Fieschi, D; Fieschi, M

    2001-01-01

    The development of health care and hospital information systems has to meet users needs as well as requirements such as the tracking of all care activities and the support of quality improvement. The use of process-oriented analysis is of-value to provide analysts with: (i) a systematic description of activities; (ii) the elicitation of the useful data to perform and record care tasks; (iii) the selection of relevant decision-making support. But paper-based tools are not a very suitable way to manage and share the documentation produced during this step. The purpose of this work is to propose a method to implement the results of process analysis according to XML techniques (eXtensible Markup Language). It is based on the IDEF0 activity modeling language (Integration DEfinition for Function modeling). A hierarchical description of a process and its components has been defined through a flat XML file with a grammar of proper metadata tags. Perspectives of this method are discussed.

  19. Fuzzy-Based XML Knowledge Retrieval Methods in Edaphology

    Directory of Open Access Journals (Sweden)

    K. Naresh kumar

    2016-05-01

    Full Text Available In this paper, we propose a proficient method for knowledge management in Edaphology to assist the edaphologists and those related with agriculture in a big way. The proposed method mainly consists two sections of which the first one is to build the knowledge base using XML and the latter part deals with information retrieval by searching using fuzzy. Initially, the relational database is converted to the XML database. The paper discusses two algorithms, one is when the soil characteristics are inputted to have the plant list and in the other, plant names are inputted to have the soil characteristics suited for the plant. While retrieving the query result, the crisp numerical values are converted to fuzzy using the triangular fuzzy membership function and matched to those in database. And those which satisfy are added to the result list and subsequently the frequency is found out to rank the result list so as to obtain the final sorted list. Performance metrics used in order to evaluate the method and compare it to baseline paper are number of plants retrieved, ranking efficiency, and computation time and memory usage. Results obtained proved the validity of the method and the method obtained average computation time of 0.102 seconds and average memory usage of 2486 Kb, which all are far better than the previous method results.

  20. Related Axis: The Extension to XPath Towards Effective XML Search

    Institute of Scientific and Technical Information of China (English)

    Jun-Feng Zhou; Tok Wang Ling; Zhi-Feng Bao; Xiao-Feng Meng

    2012-01-01

    We investigate the limitations of existing XML search methods and propose a new semantics,related relationship,to effectively capture meaningful relationships of data elements from XML data in the absence of structural constraints.Then we make an extension to XPath by introducing a new axis,related axis,to specify the related relationship between query nodes so as to enhance the flexibility of XPath.We propose to reduce the cost of computing the related relationship by a new schema summary that summarizes the related relationship from the original schema without any loss.Based on this schema summary,we introduce two indices to improve the performance of query processing.Our algorithm shows that the evaluation of most queries can be equivalently transformed into just a few selection and value join operations,thus avoids the costly structural join operations.The experimental results show that our method is effective and efficient in terms of comparing the effectiveness of the related relationship with existing keyword search semantics and comparing the efficiency of our evaluation methods with existing query engines.

  1. 基于XML的Web信息存储解决方案%A XML-based Web Data Storage Solution

    Institute of Scientific and Technical Information of China (English)

    姚卿达; 陈宁琳

    2000-01-01

    The emergence of XML makes much developing chance for Internet data storage and data exchange.There are two main solutions for XML data storage:semistructure database and relational database.We compare these two main solutions and present the realization of XMLDBMS,a middleware for data transformation between database and XML files.As an application of XMLDBMS,we introduce the concept of virtual XML file system and its realization.

  2. Generování validačních schémat pro XML

    OpenAIRE

    Hložek, Bohuslav

    2015-01-01

    Projekt se zabývá analýzou XML LMF slovníku. Je tvořeno schéma pro schematron a XML s popisem hodnot atributů. Projekt je zpracován v jazyce Python 3.4. The project analyses XML LFM dictionary.  Schematron schema is created and XML with description of attribute values is created. The project is coded in Python 3.4. D

  3. Video game for learning and metaphorization of recursive algorithms

    Directory of Open Access Journals (Sweden)

    Ricardo Inacio Alvares Silva

    2013-09-01

    Full Text Available The learning of recursive algorithms in computer programming is problematic, because its execution and resolution is not natural to the thinking way people are trained and used to since young. As with other topics in algorithms, we use metaphors to make parallels between the abstract and the concrete to help in understanding the operation of recursive algorithms. However, the classic metaphors employed in this area, such as calculating factorial recursively and Towers of Hanoi game, may just confuse more or be insufficient. In this work, we produced a computer game to assist students in computer courses in learning recursive algorithms. It was designed to have regular video game characteristics, with narrative and classical gameplay elements, commonly found in this kind of product. Aiding to education occurs through metaphorization, or in other words, through experiences provided by game situations that refer to recursive algorithms. To this end, we designed and imbued in the game four valid metaphors related to the theory, and other minor references to the subject.

  4. Localized Recursive Estimation in Energy Constrained Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Bang Wang

    2006-06-01

    Full Text Available This paper proposes a localized recursive estimation scheme for parameter estimation in wireless sensor networks. Given any parameter of a target occurring at some location and time, a number of sensors recursively estimate the parameter by using their local measurements of the parameter that is attenuated with the distance between a sensor and the target location and corrupted by noise. Compared with centralized estimation schemes that transmit all encoded measurements to a sink (or a fusion center, the recursive scheme needs only to transmit the final estimate to a sink. When the sink is faraway from the sensors and multihop communications have to be used, using localized recursive estimation can help to reduce energy consumption and reduce network traffic load. A sensor sequence with the fastest convergence rate is identified, by which the variance of estimation error reduces faster than all other sequences. In the case of adjustable transmission power, a heuristic has been proposed to find a sensor sequence with the minimum total transmission power when performing the recursive estimation. Numerical examples have been used to compare the performance of the proposed scheme with that of a centralized estimation scheme and have also shown the effectiveness of the proposed heuristic.

  5. The redundancy of recursion and infinity for natural language.

    Science.gov (United States)

    Luuk, Erkki; Luuk, Hendrik

    2011-02-01

    An influential line of thought claims that natural language and arithmetic processing require recursion, a putative hallmark of human cognitive processing (Chomsky in Evolution of human language: biolinguistic perspectives. Cambridge University Press, Cambridge, pp 45-61, 2010; Fitch et al. in Cognition 97(2):179-210, 2005; Hauser et al. in Science 298(5598):1569-1579, 2002). First, we question the need for recursion in human cognitive processing by arguing that a generally simpler and less resource demanding process--iteration--is sufficient to account for human natural language and arithmetic performance. We argue that the only motivation for recursion, the infinity in natural language and arithmetic competence, is equally approachable by iteration and recursion. Second, we submit that the infinity in natural language and arithmetic competence reduces to imagining infinite embedding or concatenation, which is completely independent from the ability to implement infinite processing, and thus, independent from both recursion and iteration. Furthermore, we claim that a property of natural language is physically uncountable finity and not discrete infinity.

  6. XML Namespace與RDF的基本概念 | The Basic Concepts of XML Namespace and RDF

    Directory of Open Access Journals (Sweden)

    陳嵩榮 Sung-Jung Chen

    1999-04-01

    Full Text Available

    頁次:88-100

    XML Namespaces機制允許在XML文件中以一個URI 來限定元素名稱或屬性名稱,提供一種在Web上具有唯一性的命名方式,以解決不同的XML文件元素名稱與屬性名稱可能衝突的問題;RDF 主要是為Metadata在Web 上的各種應用提供一個基礎結構,使應用程式之間能夠在Web上交換Metadata,以促進網路資源的自動化處理。本文透過一連串的實例來介紹XML Namespace與RDF的資料模型及語法。

    XML namespaces provide a simple method for qualifying element and attribute names used in XML documents by associating them with namespaces identified by URI references. RDF is a foundation for processing metadata. It provides interoperability between

  7. Haydock's recursive solution of self-adjoint problems. Discrete spectrum

    Science.gov (United States)

    Moroz, Alexander

    2014-12-01

    Haydock's recursive solution is shown to underline a number of different concepts such as (i) quasi-exactly solvable models, (ii) exactly solvable models, (iii) three-term recurrence solutions based on Schweber's quantization criterion in Hilbert spaces of entire analytic functions, and (iv) a discrete quantum mechanics of Odake and Sasaki. A recurrent theme of Haydock's recursive solution is that the spectral properties of any self-adjoint problem can be mapped onto a corresponding sequence of polynomials {pn(E) } in energy variable E. The polynomials {pn(E) } are orthonormal with respect to the density of states n0(E) and energy eigenstate | E > is the generating function of {pn(E) } . The generality of Haydock's recursive solution enables one to see the different concepts from a unified perspective and mutually benefiting from each other. Some results obtained within the particular framework of any of (i) to (iv) may have much broader significance.

  8. Spin-1 Ising model on tetrahedron recursive lattices: Exact results

    Science.gov (United States)

    Jurčišinová, E.; Jurčišin, M.

    2016-11-01

    We investigate the ferromagnetic spin-1 Ising model on the tetrahedron recursive lattices. An exact solution of the model is found in the framework of which it is shown that the critical temperatures of the second order phase transitions of the model are driven by a single equation simultaneously on all such lattices. It is also shown that this general equation for the critical temperatures is equivalent to the corresponding polynomial equation for the model on the tetrahedron recursive lattice with arbitrary given value of the coordination number. The explicit form of these polynomial equations is shown for the lattices with the coordination numbers z = 6, 9, and 12. In addition, it is shown that the thermodynamic properties of all possible physical phases of the model are also completely driven by the corresponding single equations simultaneously on all tetrahedron recursive lattices. In this respect, the spontaneous magnetization, the free energy, the entropy, and the specific heat of the model are studied in detail.

  9. Recursive modular modelling methodology for lumped-parameter dynamic systems.

    Science.gov (United States)

    Orsino, Renato Maia Matarazzo

    2017-08-01

    This paper proposes a novel approach to the modelling of lumped-parameter dynamic systems, based on representing them by hierarchies of mathematical models of increasing complexity instead of a single (complex) model. Exploring the multilevel modularity that these systems typically exhibit, a general recursive modelling methodology is proposed, in order to conciliate the use of the already existing modelling techniques. The general algorithm is based on a fundamental theorem that states the conditions for computing projection operators recursively. Three procedures for these computations are discussed: orthonormalization, use of orthogonal complements and use of generalized inverses. The novel methodology is also applied for the development of a recursive algorithm based on the Udwadia-Kalaba equation, which proves to be identical to the one of a Kalman filter for estimating the state of a static process, given a sequence of noiseless measurements representing the constraints that must be satisfied by the system.

  10. Termination Casts: A Flexible Approach to Termination with General Recursion

    Directory of Open Access Journals (Sweden)

    Aaron Stump

    2010-12-01

    Full Text Available This paper proposes a type-and-effect system called Teqt, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambda calculus with general recursion and equality types. The central idea is to include a primitive type-form "Terminates t", expressing that term t is terminating; and then allow terms t to be coerced from possibly diverging to total, using a proof of Terminates t. We call such coercions termination casts, and show how to implement terminating recursion using them. For the meta-theory of the system, we describe a translation from Teqt to a logical theory of termination for general recursive, simply typed functions. Every typing judgment of Teqt is translated to a theorem expressing the appropriate termination property of the computational part of the Teqt term.

  11. Recursive Heaviside step functions and beginning of the universe

    Science.gov (United States)

    Shin, Changsoo; Kim, Seongjai

    2017-04-01

    This article introduces recursive Heaviside step functions, as a potential of the known universe, for the first time in the history of mathematics, science, and engineering. In modern cosmology, various bouncing models have been suggested based on the postulation that the current universe is the result of the collapse of a previous universe. However, all Big Bounce models leave unanswered the question of what powered inflation. Recursive Heaviside step functions are analyzed to represent the warpage of spacetime during the crunch-bounce transition. In particular, the time shift appeared during the transition is modeled in the form of recursive Heaviside step functions and suggested as a possible answer for the immeasurable energy appeared for the Big Bounce.

  12. Theoretical properties of recursive neural networks with linear neurons.

    Science.gov (United States)

    Bianchini, M; Gori, M

    2001-01-01

    Recursive neural networks are a powerful tool for processing structured data, thus filling the gap between connectionism, which is usually related to poorly organized data, and a great variety of real-world problems, where the information is naturally encoded in the relationships among the basic entities. In this paper, some theoretical results about linear recursive neural networks are presented that allow one to establish conditions on their dynamical properties and their capability to encode and classify structured information. A lot of the limitations of the linear model, intrinsically related to recursive processing, are inherited by the general model, thus establishing their computational capabilities and range of applicability. As a byproduct of our study some connections with the classical linear system theory are given where the processing is extended from sequences to graphs.

  13. Contextual processing of structured data by recursive cascade correlation.

    Science.gov (United States)

    Micheli, Alessio; Sona, Diego; Sperduti, Alessandro

    2004-11-01

    This paper propose a first approach to deal with contextual information in structured domains by recursive neural networks. The proposed model, i.e., contextual recursive cascade correlation (CRCC), a generalization of the recursive cascade correlation (RCC) model, is able to partially remove the causality assumption by exploiting contextual information stored in frozen units. We formally characterize the properties of CRCC showing that it is able to compute contextual transductions and also some causal supersource transductions that RCC cannot compute. Experimental results on controlled sequences and on a real-world task involving chemical structures confirm the computational limitations of RCC, while assessing the efficiency and efficacy of CRCC in dealing both with pure causal and contextual prediction tasks. Moreover, results obtained for the real-world task show the superiority of the proposed approach versus RCC when exploring a task for which it is not known whether the structural causality assumption holds.

  14. Probability properties and fractal properties of statistically recursive sets

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    In this paper we construct a class of statistically recursive sets K by statistical contraction operators and prove the convergence and the measurability of K. Many important sets are the special cases of K. Then we investigate the statistically self-similar measure (or set). We have found some sufficient conditions to ensure the statistically recursive set to be statistically self-similar. We also investigate the distribution PK-1. The zero-one laws and the support of PK-1 are obtained.Finally the Hausdorff dimension and Hausdorff exact measure function of a class of statistically recursive sets constructed by a collection of i.i.d. statistical contraction operators have been obtained.

  15. Creating preservation metadata from XML-metadata profiles

    Science.gov (United States)

    Ulbricht, Damian; Bertelmann, Roland; Gebauer, Petra; Hasler, Tim; Klump, Jens; Kirchner, Ingo; Peters-Kottig, Wolfgang; Mettig, Nora; Rusch, Beate

    2014-05-01

    Metadata Encoding and Transmission Standard (METS). To find datasets in future portals and to make use of this data in own scientific work, proper selection of discovery metadata and application metadata is very important. Some XML-metadata profiles are not suitable for preservation, because version changes are very fast and make it nearly impossible to automate the migration. For other XML-metadata profiles schema definitions are changed after publication of the profile or the schema definitions become inaccessible, which might cause problems during validation of the metadata inside the preservation system [2]. Some metadata profiles are not used widely enough and might not even exist in the future. Eventually, discovery and application metadata have to be embedded into the mdWrap-subtree of the METS-XML. [1] http://www.archivematica.org [2] http://dx.doi.org/10.2218/ijdc.v7i1.215

  16. On a (2,2-rational recursive sequence

    Directory of Open Access Journals (Sweden)

    Ben Rhouma Mohamed

    2005-01-01

    Full Text Available We investigate the asymptotic behavior of the recursive difference equation yn+1 = (α+βyn/(1+yn-1 when the parameters α < 0 and β ∈ ℝ. In particular, we establish the boundedness and the global stability of solutions for different ranges of the parameters α and β. We also give a summary of results and open questions on the more general recursive sequences yn+1 = (a + byn/(A + Byn-1, when the parameters a, b, A, B ∈ ℝ and abAB ≠ 0.

  17. Detection of small target using recursive higher order statistics

    Science.gov (United States)

    Hou, Wang; Sun, Hongyuan; Lei, Zhihui

    2014-02-01

    In this paper, a recursive higher order statistics algorithm is proposed for small target detection in temporal domain. Firstly, the background of image sequence is normalized. Then, the higher order statistics are recursively solved in image sequence to obtain the feature image. Finally, the feature image is segmented with threshold to detect the small target. To validate the algorithm proposed in this paper, five simulated and one semi-simulation image sequences are created. The ROC curves are employed for evaluation of experimental results. Experiment results show that our method is very effective for small target detection.

  18. Note on recursion relations for the Q -cut representation

    Science.gov (United States)

    Feng, Bo; He, Song; Huang, Rijun; Luo, Ming-xing

    2017-01-01

    In this note, we study the Q -cut representation by combining it with BCFW deformation. As a consequence, the one-loop integrand is expressed in terms of a recursion relation, i.e., n-point one-loop integrand is constructed using tree-level amplitudes and m-point one-loop integrands with m ≤ n - 1. By giving explicit examples, we show that the integrand from the recursion relation is equivalent to that from Feynman diagrams or the original Q -cut construction, up to scale free terms.

  19. THE PARALLEL RECURSIVE AP ADAPTIVE ALGORITHM BASED ON VOLTERRA SERIES

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    Aiming at the nonlinear system identification problem, a parallel recursive affine projection (AP) adaptive algorithm for the nonlinear system based on Volterra series is presented in this paper. The algorithm identifies in parallel the Volterra kernel of each order, recursively estimate the inverse of the autocorrelation matrix for the Volterra input of each order, and remarkably improve the convergence speed of the identification process compared with the NLMS and conventional AP adaptive algorithm based on Volterra series. Simulation results indicate that the proposed method in this paper is efficient.

  20. On-Shell Recursion Relations for Generic Theories

    CERN Document Server

    Cheung, Clifford

    2008-01-01

    We show that on-shell recursion relations hold for tree amplitudes in generic two derivative theories of multiple particle species and diverse spins. For example, in a gauge theory coupled to scalars and fermions, any amplitude with at least one gluon obeys a recursion relation. In (super)gravity coupled to scalars and fermions, the same holds for any amplitude with at least one graviton. This result pertains to a broad class of theories, including QCD, N=4 SYM, and N=8 supergravity.

  1. Recursion relations and branching rules for simple Lie algebras

    CERN Document Server

    Lyakhovsky, V D

    1995-01-01

    The branching rules between simple Lie algebras and its regular (maximal) simple subalgebras are studied. Two types of recursion relations for anomalous relative multiplicities are obtained. One of them is proved to be the factorized version of the other. The factorization property is based on the existence of the set of weights \\Gamma specific for each injection. The structure of \\Gamma is easily deduced from the correspondence between the root systems of algebra and subalgebra. The recursion relations thus obtained give rise to simple and effective algorithm for branching rules. The details are exposed by performing the explicit decomposition procedure for A_{3} \\oplus u(1) \\rightarrow B_{4} injection.

  2. Recursive generation of one-loop SM amplitudes

    Energy Technology Data Exchange (ETDEWEB)

    Actis, Stefano [Paul Scherrer Institut, Wuerenlingen (Switzerland); Paul Scherrer Institut, Villigen (Switzerland); Denner, Ansgar; Hofer, Lars; Scharf, Andreas [Universitaet Wuerzburg (Germany); Uccirati, Sandro [Universita di Torino, Turin (Italy)

    2013-07-01

    We introduce the computer code Recola for the recursive generation of tree-level and one-loop amplitudes in the full Standard Model, including electroweak corrections. The presented algorithm for the calculation of one-loop amplitudes uses Dyson-Schwinger recursion relations to determine the coefficients of the tensor integrals. As a first application of Recola we discuss Z+2jets production at the LHC and present results for the next-to-leading-order electroweak corrections to the dominant partonic channels.

  3. Topological recursion and a quantum curve for monotone Hurwitz numbers

    Science.gov (United States)

    Do, Norman; Dyer, Alastair; Mathews, Daniel V.

    2017-10-01

    Classical Hurwitz numbers count branched covers of the Riemann sphere with prescribed ramification data, or equivalently, factorisations in the symmetric group with prescribed cycle structure data. Monotone Hurwitz numbers restrict the enumeration by imposing a further monotonicity condition on such factorisations. In this paper, we prove that monotone Hurwitz numbers arise from the topological recursion of Eynard and Orantin applied to a particular spectral curve. We furthermore derive a quantum curve for monotone Hurwitz numbers. These results extend the collection of enumerative problems known to be governed by the paradigm of topological recursion and quantum curves, as well as the list of analogues between monotone Hurwitz numbers and their classical counterparts.

  4. 基于XML和XSD的通用GUI生成器研究%Generic GUI Generator Based on XML and XSD

    Institute of Scientific and Technical Information of China (English)

    姜劲松; 严坤; 倪桂强; 何明; 杨波

    2012-01-01

    为了满足应用软件对图形用户界面(graph user interface,GUI)快速变更的需求,提出了基于深度递归和广度递归思想的持久化和解析算法,设计了基于XML和XSD(XML schema description language)的GUI生成器.该生成器包括设计器和解析器,支持层次化的界面样式语义以及组、联合、枚举等数据模型语义.最后,给出了应用示例,使用Java和C#语言分别解析了采用该生成器定制的某网络入侵检测系统的路由器对象,同时可以验证用户输入数据是否符合约束语义.%The R-calculus, proposed by professor Li Wei, is a revision calculus for formal theories. It plays a key role in OPEN and GUINA logic. It can be considered as a tool to cut out the prerequisites of contradiction when a theory conflicts with some facts, hence resulting in a consistent sub-theory. In order to give a purely syntactic calculus, we make a deep exploration of the concept "necessary prerequisite", and characterize it in three different ways. Furthermore, R-terminated sets and the maximally consistent subsets are also studied. The first way is a logical consequence of original R-calculus. And the second one is based on maximally consistent subset. The third one is an inductive formalization of R-prerequisite. By comparing these ways, we claim that each way has its own advantages and disadvantages. We chose the last one as our approach to derive a sound and relatively complete calculus, namely R', which could be a better system for original purpose. The lower bound and upper bound of R-terminated sets are proposed. And we prove that deriving maximally consistent subsets of contradiction is not only non-recursive but even not recursive enumerable, which indicates that any purely syntactic system are not able to be both sound and complete.

  5. Real-time recursive hyperspectral sample and band processing algorithm architecture and implementation

    CERN Document Server

    Chang, Chein-I

    2017-01-01

    This book explores recursive architectures in designing progressive hyperspectral imaging algorithms. In particular, it makes progressive imaging algorithms recursive by introducing the concept of Kalman filtering in algorithm design so that hyperspectral imagery can be processed not only progressively sample by sample or band by band but also recursively via recursive equations. This book can be considered a companion book of author’s books, Real-Time Progressive Hyperspectral Image Processing, published by Springer in 2016. Explores recursive structures in algorithm architecture Implements algorithmic recursive architecture in conjunction with progressive sample and band processing Derives Recursive Hyperspectral Sample Processing (RHSP) techniques according to Band-Interleaved Sample/Pixel (BIS/BIP) acquisition format Develops Recursive Hyperspectral Band Processing (RHBP) techniques according to Band SeQuential (BSQ) acquisition format for hyperspectral data.

  6. Domain XML semantic integration based on extraction rules and ontology mapping

    Directory of Open Access Journals (Sweden)

    Huayu LI

    2016-08-01

    Full Text Available A plenty of XML documents exist in petroleum engineering field, but traditional XML integration solution can’t provide semantic query, which leads to low data use efficiency. In light of WeXML(oil&gas well XML data semantic integration and query requirement, this paper proposes a semantic integration method based on extraction rules and ontology mapping. The method firstly defines a series of extraction rules with which elements and properties of WeXML Schema are mapped to classes and properties in WeOWL ontology, respectively; secondly, an algorithm is used to transform WeXML documents into WeOWL instances. Because WeOWL provides limited semantics, ontology mappings between two ontologies are then built to explain class and property of global ontology with terms of WeOWL, and semantic query based on global domain concepts model is provided. By constructing a WeXML data semantic integration prototype system, the proposed transformational rule, the transfer algorithm and the mapping rule are tested.

  7. Simulation framework and XML detector description for the CMS experiment

    CERN Document Server

    Arce, P; Boccali, T; Case, M; de Roeck, A; Lara, V; Liendl, M; Nikitenko, A N; Schröder, M; Strässner, A; Wellisch, H P; Wenzel, H

    2003-01-01

    Currently CMS event simulation is based on GEANT3 while the detector description is built from different sources for simulation and reconstruction. A new simulation framework based on GEANT4 is under development. A full description of the detector is available, and the tuning of the GEANT4 performance and the checking of the ability of the physics processes to describe the detector response is ongoing. Its integration on the CMS mass production system and GRID is also currently under development. The Detector Description Database project aims at providing a common source of information for Simulation, Reconstruction, Analysis, and Visualisation, while allowing for different representations as well as specific information for each application. A functional prototype, based on XML, is already released. Also examples of the integration of DDD in the GEANT4 simulation and in the reconstruction applications are provided.

  8. Managing and Querying Image Annotation and Markup in XML.

    Science.gov (United States)

    Wang, Fusheng; Pan, Tony; Sharma, Ashish; Saltz, Joel

    2010-01-01

    Proprietary approaches for representing annotations and image markup are serious barriers for researchers to share image data and knowledge. The Annotation and Image Markup (AIM) project is developing a standard based information model for image annotation and markup in health care and clinical trial environments. The complex hierarchical structures of AIM data model pose new challenges for managing such data in terms of performance and support of complex queries. In this paper, we present our work on managing AIM data through a native XML approach, and supporting complex image and annotation queries through native extension of XQuery language. Through integration with xService, AIM databases can now be conveniently shared through caGrid.

  9. reutilizables con XML, UML e IMS-LD

    Directory of Open Access Journals (Sweden)

    José R. Hilera

    2005-01-01

    Full Text Available Se analiza la especificación IMS-Learning Design (LD, que permite el diseño de procesos de enseñanza-aprendizaje en forma de modelos registrados en archivos xml fácilmente reutilizables. Se valora la utilidad del estándar de modelado de sistemas denominado UML (Unified Modeling Language para establecer meta-modelos en la especificación IMS-LD, así como para elaborar modelos dinámicos que reflejen la organización de las actividades de un proceso de enseñanza-aprendizaje. Finalmente, se justifica la necesidad de disponer de herramientas informáticas para el diseño y ejecución de los procesos, de forma similar a como ocurre con los sistemas de workflow.

  10. Sécurisation d'une Passerelle XML - SNMP

    OpenAIRE

    Collet, Laurent; Cridlig, Vincent

    2004-01-01

    ESIAL 2A. Rapport de stage.; Ce rapport présente l'implémentation d'extensions de sécurité pour une passerelle XML/SNMP. Le travail effectué se base sur une implémentation existante d'une telle passerelle et y ajoute des fonctionnalités pour établir un "continuum" de sécurité depuis les administrateurs réseaux jusqu'aux agents SNMP. Plusieurs mécanismes de sécurité ont été ajoutés : contrôle d'accès basé sur les rôles, authentification et confidentialité.

  11. Teaching object concepts for XML-based representations.

    Energy Technology Data Exchange (ETDEWEB)

    Kelsey, R. L. (Robert L.)

    2002-01-01

    Students learned about object-oriented design concepts and knowledge representation through the use of a set of toy blocks. The blocks represented a limited and focused domain of knowledge and one that was physical and tangible. The blocks helped the students to better visualize, communicate, and understand the domain of knowledge as well as how to perform object decomposition. The blocks were further abstracted to an engineering design kit for water park design. This helped the students to work on techniques for abstraction and conceptualization. It also led the project from tangible exercises into software and programming exercises. Students employed XML to create object-based knowledge representations and Java to use the represented knowledge. The students developed and implemented software allowing a lay user to design and create their own water slide and then to take a simulated ride on their slide.

  12. An Efficient Middleware for Storing and Querying XML Data in Relational Database Management System

    Directory of Open Access Journals (Sweden)

    Mohammed A.I. Fakheraldien

    2011-01-01

    Full Text Available Problem statement: In this study, we propose a middleware that provides a transformation utility for storing and querying XML data in relational databases using model mapping method. Approach: To store XML documents in RDBMS, several mapping approaches can be used. We chose structure independent approach. In this middleware the model mapping method XParent and free of cost available technologies MYSQL, PhpMyAdmin and PHPclasses are used as examples. Results: This middleware stores XML tables and does not require a direct extension of SQL thus this middleware can be used with any relational databases management system with little changes in the middleware interface. The middleware offers two alternative methods -namely XParent and XReal- for storing XML in the database. Conclusion: The key to proposed middleware is to store XML document in a relational database through a user interface and with an XPath query processor. We present a comparative experimental study on the performance of insertion and retrieval of two types of XML documents with a set of XPath queries executed though the XPath. XML and Relational databases cannot be kept separately because XML is becoming the universal standard data format for the representation and exchanging the information whereas most existing data lies in RDBMS and their power of data capabilities cannot be degraded so the solution to this problem a middleware prototype is required. The proposed schema dependent solutions have a drawback that evens a small change in the logical structure of XML documents influence on the database schemas and several problems occur during the updating process. A new efficient data middleware is proposed in the study to face these issues.

  13. A recursive Formulation of the Inversion of symmetric positive defite matrices in packed storage data format

    DEFF Research Database (Denmark)

    Andersen, Bjarne Stig; Gunnels, John A.; Gustavson, Fred

    2002-01-01

    A new Recursive Packed Inverse Calculation Algorithm for symmetric positive definite matrices has been developed. The new Recursive Inverse Calculation algorithm uses minimal storage, \\$n(n+1)/2\\$, and has nearly the same performance as the LAPACK full storage algorithm using \\$n\\^2\\$ memory words....... New recursive packed BLAS needed for this algorithm have been developed too. Two transformation routines, from the LAPACK packed storage data format to the recursive storage data format were added to the package too....

  14. Data Hiding and Security for XML Database: A TRBAC- Based Approach

    Institute of Scientific and Technical Information of China (English)

    ZHANG Wan-song; SUN Wei; LIU Da-xin

    2005-01-01

    In order to cope with varying protection granularity levels of XML (eXtensible Markup Language) documents, we propose a TXAC (Two-level XML Access Control) framework, in which an extended TRBAC (Temporal Role-Based Access Control) approach is proposed to deal with the dynamic XML data. With different system components,TXAC algorithm evaluates access requests efficiently by appropriate access control policy in dynamic web environment.The method is a flexible and powerful security system offering a multi-level access control solution.

  15. XML and OpenDocument Format standards and their use in practice

    OpenAIRE

    Pluhař, Marek

    2016-01-01

    The bachelor thesis deals with XML and OpenDocument Format. The entire work is divided into theoretical and practical part. The theoretical part is divided into two separate sections. The first is devoted to the description of the XML format. The second is related to the OpenDocument Format. The work clearly explains the issues of studied topics. The practical part is also divided into two sections. The first one is devoted to the use of XML and the second to creation of ODF macro. In th...

  16. The carbohydrate sequence markup language (CabosML): an XML description of carbohydrate structures.

    Science.gov (United States)

    Kikuchi, Norihiro; Kameyama, Akihiko; Nakaya, Shuuichi; Ito, Hiromi; Sato, Takashi; Shikanai, Toshihide; Takahashi, Yoriko; Narimatsu, Hisashi

    2005-04-15

    Bioinformatics resources for glycomics are very poor as compared with those for genomics and proteomics. The complexity of carbohydrate sequences makes it difficult to define a common language to represent them, and the development of bioinformatics tools for glycomics has not progressed. In this study, we developed a carbohydrate sequence markup language (CabosML), an XML description of carbohydrate structures. The language definition (XML Schema) and an experimental database of carbohydrate structures using an XML database management system are available at http://www.phoenix.hydra.mki.co.jp/CabosDemo.html kikuchi@hydra.mki.co.jp.

  17. Secure combination of XML signature application with message aggregation in multicast settings

    DEFF Research Database (Denmark)

    Becker, Andreas; Jensen, Meiko

    2013-01-01

    The similarity-based aggregation of XML documents is a proven method for reducing network traffic. However, when used in conjunction with XML security standards, a lot of pitfalls, but also optimization potentials exist. In this paper, we investigate these issues, showing how to exploit similarity......-based aggregation for rapid distribution of digitally signed XML data. Using our own implementation in two different experimental settings, we provide both a thorough evaluation and a security proof for our approach. By this we prove both feasibility and security, and we illustrate how to achieve a network traffic...

  18. Un index de jointure pour les entrep\\^ots de donn\\'ees XML

    CERN Document Server

    Mahboubi, Hadj; Darmont, Jérôme

    2007-01-01

    XML data warehouses form an interesting basis for decision-support applications that exploit heterogeneous data from multiple sources. However, XML-native database systems currently bear limited performances and it is necessary to research ways to optimize them. In this paper, we propose a new index that is specifically adapted to the multidimensional architecture of XML warehouses and eliminates join operations, while preserving the information contained in the original warehouse. A theoretical study and experimental results demonstrate the efficiency of our index, even when queries are complex.

  19. A New Approach for Designing Multi InformationManagement System Using XML Technology

    Directory of Open Access Journals (Sweden)

    Dr. Suha Mohammed Hadi

    2005-01-01

    Full Text Available XML is being incorporated into the foundation of E-business data applications. This paper addresses the problem of the freeform information that stored in any organization and how XML with using this new approach will make the operation of the search very efficient and time consuming. This paper introduces new solution and methodology that has been developed to capture and manage such unstructured freeform information (multi information depending on the use of XML schema technologies, neural network idea and object oriented relational database, in order to provide a practical solution for efficiently management multi freeform information system.

  20. Teaching and Learning Recursive Programming: A Review of the Research Literature

    Science.gov (United States)

    McCauley, Renée; Grissom, Scott; Fitzgerald, Sue; Murphy, Laurie

    2015-01-01

    Hundreds of articles have been published on the topics of teaching and learning recursion, yet fewer than 50 of them have published research results. This article surveys the computing education research literature and presents findings on challenges students encounter in learning recursion, mental models students develop as they learn recursion,…

  1. Differential constraints for bounded recursive identification with multivariate splines

    NARCIS (Netherlands)

    De Visser, C.C.; Chu, Q.P.; Mulder, J.A.

    2011-01-01

    The ability to perform online model identification for nonlinear systems with unknown dynamics is essential to any adaptive model-based control system. In this paper, a new differential equality constrained recursive least squares estimator for multivariate simplex splines is presented that is able

  2. A Survey on Teaching and Learning Recursive Programming

    Directory of Open Access Journals (Sweden)

    Christian RINDERKNECHT

    2014-04-01

    Full Text Available We survey the literature about the teaching and learning of recursive programming. After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a review of textbooks and some programming methodology, as well as the functional and imperative paradigms and the distinction between control flow vs. data flow. We follow the researchers in stating the problem with base cases, noting the similarity with induction in mathematics, making concrete analogies for recursion, using games, visualizations, animations, multimedia environments, intelligent tutoring systems and visual programming. We cover the usage in schools of the Logo programming language and the associated theoretical didactics, including a brief overview of the constructivist and constructionist theories of learning; we also sketch the learners' mental models which have been identified so far, and non-classical remedial strategies, such as kinesthesis and syntonicity. We append an extensive and carefully collated bibliography, which we hope will facilitate new research.

  3. A nested recursive logit model for route choice analysis

    DEFF Research Database (Denmark)

    Mai, Tien; Frejinger, Emma; Fosgerau, Mogens

    2015-01-01

    We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link...

  4. Recursive Inversion By Finite-Impulse-Response Filters

    Science.gov (United States)

    Bach, Ralph E., Jr.; Baram, Yoram

    1991-01-01

    Recursive approximation gives least-squares best fit to exact response. Algorithm yields finite-impulse-response approximation of unknown single-input/single-output, causal, time-invariant, linear, real system, response of which is sequence of impulses. Applicable to such system-inversion problems as suppression of echoes and identification of target from its scatter response to incident impulse.

  5. Recursive inversion of externally defined linear systems by FIR filters

    Science.gov (United States)

    Bach, Ralph E., Jr.; Baram, Yoram

    1989-01-01

    The approximate inversion of an internally unknown linear system, given by its impulse response sequence, by an inverse system having a finite impulse response, is considered. The recursive least-squares procedure is shown to have an exact initialization, based on the triangular Toeplitz structure of the matrix involved. The proposed approach also suggests solutions to the problem of system identification and compensation.

  6. Knot Invariants from Topological Recursion on Augmentation Varieties

    CERN Document Server

    Gu, Jie; Klemm, Albrecht; Soroush, Masoud

    2014-01-01

    Using the duality between Wilson loop expectation values of SU(N) Chern-Simons theory on $S^3$ and topological open-string amplitudes on the local mirror of the resolved conifold, we study knots on $S^3$ and their invariants encoded in colored HOMFLY polynomials by means of topological recursion. In the context of the local mirror Calabi-Yau threefold of the resolved conifold, we generalize the topological recursion of the remodelled B-model in order to study branes beyond the class of toric Harvey-Lawson special Lagrangians -- as required for analyzing non-trivial knots on $S^3$. The basic ingredients for the proposed recursion are the spectral curve, given by the augmentation variety of the knot, and the calibrated annulus kernel, encoding the topological annulus amplitudes associated to the knot. We present an explicit construction of the calibrated annulus kernel for torus knots and demonstrate the validity of the topological recursion. We further argue that -- if an explicit form of the calibrated annulu...

  7. Recursive representation of the torus 1-point conformal block

    CERN Document Server

    Hadasz, Leszek; Suchanek, Paulina

    2009-01-01

    The recursive relation for the 1-point conformal block on a torus is derived and used to prove the identities between conformal blocks recently conjectured by R. Poghossian. As an illustration of the efficiency of the recurrence method the modular invariance of the 1-point Liouville correlation function is numerically analyzed.

  8. EVALUATION OF SOME PRODUCTION CHARACTERISTICS OF RECURSIVE CONVEYOR

    Directory of Open Access Journals (Sweden)

    Boris V. Kupriyanov

    2016-01-01

    Full Text Available We consider the two objectives of direct relevance to operational planning based on the model of recursive conveyor process. Calculate the Critical Operation of the conveyor and calculate the Load Factor of the equipment of the conveyor. 

  9. A nested recursive logit model for route choice analysis

    DEFF Research Database (Denmark)

    Mai, Tien; Frejinger, Emma; Fosgerau, Mogens

    2015-01-01

    We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link...

  10. A metric model of lambda calculus with guarded recursion

    DEFF Research Database (Denmark)

    Birkedal, Lars; Schwinghammer, Jan; Støvring, Kristian

    2010-01-01

    We give a model for Nakano’s typed lambda calculus with guarded recursive definitions in a category of metric spaces. By proving a computational adequacy result that relates the interpretation with the operational semantics, we show that the model can be used to reason about contextual equivalence....

  11. Velocity estimation using recursive ultrasound imaging and spatially encoded signals

    DEFF Research Database (Denmark)

    Nikolov, Svetoslav; Gammelmark, Kim; Jensen, Jørgen Arendt

    2000-01-01

    Previously we have presented a recursive beamforming algorithm for synthetic transmit aperture focusing. At every emission a beamformed low-resolution image is added to an existing high-resolution one, and the low-resolution image from the previous emission with the current active element is subt...

  12. RECURSIVE CLASSIFICATION OF MQAM SIGNALS BASED ON HIGHER ORDER CUMULANTS

    Institute of Scientific and Technical Information of China (English)

    Chen Weidong; Yang Shaoquan

    2002-01-01

    A new feature based on higher order cumulants is proposed for classification of MQAM signals. Theoretical analysis justify that the new feature is invariant with respect to translation (shift), scale and rotation transform of signal constellations, and can suppress color or white additive Gaussian noise. Computer simulation shows that the proposed recursive orderreduction based classification algorithm can classify MQAM signals with any order.

  13. Consumption-Portfolio Optimization with Recursive Utility in Incomplete Markets

    DEFF Research Database (Denmark)

    Kraft, Holger; Seifried, Frank Thomas; Steffensen, Mogens

    2013-01-01

    In an incomplete market, we study the optimal consumption-portfolio decision of an investor with recursive preferences of Epstein–Zin type. Applying a classical dynamic programming approach, we formulate the associated Hamilton–Jacobi–Bellman equation and provide a suitable verification theorem...

  14. Pedestrian Path Prediction with Recursive Bayesian Filters: A Comparative Study

    NARCIS (Netherlands)

    Schneider, N.; Gavrila, D.M.

    2013-01-01

    In the context of intelligent vehicles, we perform a comparative study on recursive Bayesian filters for pedestrian path prediction at short time horizons (< 2s). We consider Extended Kalman Filters (EKF) based on single dynamical models and Interacting Multiple Models (IMM) combining several such

  15. Virasoro Constraints and Topological Recursion for Grothendieck's Dessin Counting

    Science.gov (United States)

    Kazarian, Maxim; Zograf, Peter

    2015-08-01

    We compute the number of coverings of with a given monodromy type over and given numbers of preimages of 0 and 1. We show that the generating function for these numbers enjoys several remarkable integrability properties: it obeys the Virasoro constraints, an evolution equation, the KP (Kadomtsev-Petviashvili) hierarchy and satisfies a topological recursion in the sense of Eynard-Orantin.

  16. Recursivity: A Working Paper on Rhetoric and "Mnesis"

    Science.gov (United States)

    Stormer, Nathan

    2013-01-01

    This essay proposes the genealogical study of remembering and forgetting as recursive rhetorical capacities that enable discourse to place itself in an ever-changing present. "Mnesis" is a meta-concept for the arrangements of remembering and forgetting that enable rhetoric to function. Most of the essay defines the materiality of "mnesis", first…

  17. Accurate estimates of solutions of second order recursions

    NARCIS (Netherlands)

    Mattheij, R.M.M.

    1975-01-01

    Two important types of two dimensional matrix-vector and second order scalar recursions are studied. Both types possess two kinds of solutions (to be called forward and backward dominant solutions). For the directions of these solutions sharp estimates are derived, from which the solutions themselve

  18. Finite petri nets as models for recursive causal behaviour

    NARCIS (Netherlands)

    Goltz, Ursula; Rensink, Arend

    1994-01-01

    Goltz (1988) discussed whether or not there exist finite Petri nets (with unbounded capacities) modelling the causal behaviour of certain recursive CCS terms. As a representative example, the following term is considered: B=(a.nil | b.B)+c.nil. We will show that the answer depends on the chosen

  19. Pedestrian Path Prediction with Recursive Bayesian Filters: A Comparative Study

    NARCIS (Netherlands)

    Schneider, N.; Gavrila, D.M.

    2013-01-01

    In the context of intelligent vehicles, we perform a comparative study on recursive Bayesian filters for pedestrian path prediction at short time horizons (< 2s). We consider Extended Kalman Filters (EKF) based on single dynamical models and Interacting Multiple Models (IMM) combining several such b

  20. Exploring the Recursive Nature of Food and Family Communication

    Science.gov (United States)

    Manning, Linda D.

    2006-01-01

    Family meals act as a barometer to signify the changing nature of family life. The primary objective of this activity is to allow students to experience the many ways in which a recursive relationship exists between the food families eat and the patterns of communication families enact. Through this activity, students experience how food and…

  1. Recursive confidence band construction for an unknown distribution function.

    Science.gov (United States)

    Kiatsupaibul, Seksan; Hayter, Anthony J

    2015-01-01

    Given a sample X1,...,Xn of independent observations from an unknown continuous distribution function F, the problem of constructing a confidence band for F is considered, which is a fundamental problem in statistical inference. This confidence band provides simultaneous inferences on all quantiles and also on all of the cumulative probabilities of the distribution, and so they are among the most important inference procedures that address the issue of multiplicity. A fully nonparametric approach is taken where no assumptions are made about the distribution function F. Historical approaches to this problem, such as Kolmogorov's famous () procedure, represent some of the earliest inference methodologies that address the issue of multiplicity. This is because a confidence band at a given confidence level 1-α allows inferences on all of the quantiles of the distribution, and also on all of the cumulative probabilities, at that specified confidence level. In this paper it is shown how recursive methodologies can be employed to construct both one-sided and two-sided confidence bands of various types. The first approach operates by putting bounds on the cumulative probabilities at the data points, and a recursive integration approach is described. The second approach operates by providing bounds on certain specified quantiles of the distribution, and its implementation using recursive summations of multinomial probabilities is described. These recursive methodologies are illustrated with examples, and R code is available for their implementation.

  2. A Decidable Recursive Logic for Weighted Transition Systems

    DEFF Research Database (Denmark)

    Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian

    2014-01-01

    In this paper we develop and study the Recursive Weighted Logic (RWL), a multi-modal logic that expresses qualitative and quantitative properties of labelled weighted transition systems (LWSs). LWSs are transition systems labelled with actions and real-valued quantities representing the costs of ...

  3. Step-indexed Kripke models over recursive worlds

    DEFF Research Database (Denmark)

    Birkedal, Lars; Reus, Bernhard; Schwinghammer, Jan

    2011-01-01

    worlds that are recursively defined in a category of metric spaces. In this paper, we broaden the scope of this technique from the original domain-theoretic setting to an elementary, operational one based on step indexing. The resulting method is widely applicable and leads to simple, succinct models...

  4. Semantics Boosts Syntax in Artificial Grammar Learning Tasks with Recursion

    Science.gov (United States)

    Fedor, Anna; Varga, Mate; Szathmary, Eors

    2012-01-01

    Center-embedded recursion (CER) in natural language is exemplified by sentences such as "The malt that the rat ate lay in the house." Parsing center-embedded structures is in the focus of attention because this could be one of the cognitive capacities that make humans distinct from all other animals. The ability to parse CER is usually…

  5. Rapid Prototyping Method Based on XML%基于XML的快速原型方法

    Institute of Scientific and Technical Information of China (English)

    邓世垠

    2012-01-01

      为了充分有效地获取用户需求,软件工程过程中经常需要创建和评价原型,但是如果在原型中投入太多资源,可能会导致项目失去管理层和客户的支持,或给产品本身带来风险。该文建议,使用XML等网络标准语言,简单快速地开发原型,可以缩短开发周期,节约开发成本,有效地达到原型方法的目标和解决相关问题。%  In the software engineer process, to get the user’s requirements fully and effectively, we often need to create and re⁃view the software prototype, but it may cost too many resources, and cause the project to lose the support form manages or cus⁃tomers, or make the project at risk. This article suggests, with XML and other WEB standard language, you could construct soft⁃ware prototype rapidly, shorten the development cycle, and saved development cost. It may effectively achieve the goals and solve the problems.

  6. Encoding of Fundamental Chemical Entities of Organic Reactivity Interest using chemical ontology and XML.

    Science.gov (United States)

    Durairaj, Vijayasarathi; Punnaivanam, Sankar

    2015-09-01

    Fundamental chemical entities are identified in the context of organic reactivity and classified as appropriate concept classes namely ElectronEntity, AtomEntity, AtomGroupEntity, FunctionalGroupEntity and MolecularEntity. The entity classes and their subclasses are organized into a chemical ontology named "ChemEnt" for the purpose of assertion, restriction and modification of properties through entity relations. Individual instances of entity classes are defined and encoded as a library of chemical entities in XML. The instances of entity classes are distinguished with a unique notation and identification values in order to map them with the ontology definitions. A model GUI named Entity Table is created to view graphical representations of all the entity instances. The detection of chemical entities in chemical structures is achieved through suitable algorithms. The possibility of asserting properties to the entities at different levels and the mechanism of property flow within the hierarchical entity levels is outlined. Copyright © 2015 Elsevier Inc. All rights reserved.

  7. Visual Studio.NET中实现XML Web Services浅析

    Institute of Scientific and Technical Information of China (English)

    尹华成

    2003-01-01

    XML Web services是可以由潜在的异类系统通过Internet访问的可编程单元。XML Web services在很大程度上依赖于已经被广泛接受的支持互操作的XML、HTTP和其他Internet标准。XML Web services可以由单个应用程序在内部使用或通过Internet对外公开供多个应用程序使用。XML Web services可通过标准接口进行访问,允许异类的系统以同一种Web方式协同工作。

  8. OXML: an Object XML Database Supporting Rich Media Indexing and Retrieval

    Directory of Open Access Journals (Sweden)

    Qing Li

    2011-04-01

    Full Text Available There are countless animation movies available nowadays throughout the Internet.  Rich media (including Flash and PowerPoint presentations are increasingly gaining widespread usage, particularly in the domains of e-learning and digital entertainment.  In order to allow these animation movies to be queried efficiently, in this article we present OXML - an Object XML database for storing and retrieving animation movies. After converting the movies into XML format, OXML stores the resultant XML data into a native object-oriented database. To enhance the retrieval of such XML objects, an indexing technique known as Structural Join Index Hierarchy (SJIH is then applied to the OXML database.  A detailed cost model for query execution through SJIH is developed.  Our experimental studies on accessing Flash movies using SJIH has demonstrated performance advantageous when compared with other indexing techniques.

  9. Keyword Searches in Data-Centric XML Documents Using Tree Partitioning

    Institute of Scientific and Technical Information of China (English)

    LI Guoliang; FENG Jianhua; ZHOU Lizhu

    2009-01-01

    This paper presents an effective keyword search method for data-centric extensive markup language (XML) documents.The method divides an XML document into compact connected integral subtrees,called self-integral trees (Si-Trees),to capture the structural information in the XML document.The Si-Trees are generated based on a schema guide.Meaningful self-integral trees (MSI-Trees) are identified,which contain all or some of the input keywords for the keyword search in the XML documents.Indexing is used to accelerate the retrieval of MSI-Trees related to the input keywords.The MSI-Trees are ranked to identify the top-k results with the highest ranks.Extensive tests demonstrate that this method costs 10-100 ms to answer a keyword query,and outperforms existing approaches by 1-2 orders of magnitude.

  10. XML based tools for assessing potential impact of advanced technology space validation

    Science.gov (United States)

    Some, Raphael R.; Weisbin, Charles

    2004-01-01

    A hierarchical XML database and related analysis tools are being developed by the New Millennium Program to provide guidance on the relative impact, to future NASA missions, of advanced technologies under consideration for developmental funding.

  11. XML as a format of expression of Object-Oriented Petri Nets

    Directory of Open Access Journals (Sweden)

    Petr Jedlička

    2004-01-01

    Full Text Available A number of object-oriented (OO variants have so far been devised for Petri Nets (PN. However, none of these variants has ever been described using an open, independent format – such as XML. This article suggests several possibilities and advantages of such a description. The outlined XML language definition for the description of object-oriented Petri Nets (OOPN is based on XMI (description of UML object-oriented models, SOX (simple description of general OO systems and PNML (an XML-based language used for the description of structured and modular PN. For OOPN, the XML form of description represents a standard format for storing as well as for transfer between various OOPN-processing (analysis, simulation, ... tools.

  12. Implementation for Context-Sensitive XML Digital Signaturescheme%上下文关联敏感的 XML 数字签名实现

    Institute of Scientific and Technical Information of China (English)

    郭怡; 刘宝龙; 陈桦

    2014-01-01

    文中以前期研究成果上下文关联敏感的XM L数字签名方案为基础,结合光学测量标定报告管理系统对XM L数据安全的需求,以XM L原生数据库存储标定报告,根据应用流程阐述了XM L数据完整性保护在实际使用中的生成流程及方法,在此完整性结果基础上实现了上下文关联敏感的XM L数字签名的签名过程及验证过程。结果表明,文中提出的签名方案在实际应用中可行,并与现有的XM L 数字签名规范兼容,可有效阻止云计算中面临的XM L数字签名包装攻击。%Based on the previous research-the context-sensitive XML digital signature scheme ,the paper presents the approach to and procedure of XML data integrity protection combined with the security requirements of the calibration report management system for optical measurement . The calibration report is stored in the native XML database system .The detailed processes of signing and verifying the context-sensitive XML digital signature scheme are also described .The test results showthat the proposed scheme is workable in practice and compatible with the XML digital signature specification .It can prevent XML wrapping attack in the cloud computing .

  13. Automating Disk Forensic Processing with SleuthKit, XML and Python

    Science.gov (United States)

    2009-05-01

    document. The second is based on the SAX (Simple API for XML) and is implemented with Expat . This second approach is generally faster and uses less...both a DOM-based and an SAX-based interface for processing the fiwalk XML files: • fiwalk_using_sax() This interface uses the expat -based parser. The...of all the fileobject elements extracted into a single array. • fileobjects_using_sax() This interface uses the expat -based parser, but returns an

  14. XML-based information system for planetary sciences

    Science.gov (United States)

    Carraro, F.; Fonte, S.; Turrini, D.

    2009-04-01

    EuroPlaNet (EPN in the following) has been developed by the planetological community under the "Sixth Framework Programme" (FP6 in the following), the European programme devoted to the improvement of the European research efforts through the creation of an internal market for science and technology. The goal of the EPN programme is the creation of a European network aimed to the diffusion of data produced by space missions dedicated to the study of the Solar System. A special place within the EPN programme is that of I.D.I.S. (Integrated and Distributed Information Service). The main goal of IDIS is to offer to the planetary science community a user-friendly access to the data and information produced by the various types of research activities, i.e. Earth-based observations, space observations, modeling, theory and laboratory experiments. During the FP6 programme IDIS development consisted in the creation of a series of thematic nodes, each of them specialized in a specific scientific domain, and a technical coordination node. The four thematic nodes are the Atmosphere node, the Plasma node, the Interiors & Surfaces node and the Small Bodies & Dust node. The main task of the nodes have been the building up of selected scientific cases related with the scientific domain of each node. The second work done by EPN nodes have been the creation of a catalogue of resources related to their main scientific theme. Both these efforts have been used as the basis for the development of the main IDIS goal, i.e. the integrated distributed service. An XML-based data model have been developed to describe resources using meta-data and to store the meta-data within an XML-based database called eXist. A search engine has been then developed in order to allow users to search resources within the database. Users can select the resource type and can insert one or more values or can choose a value among those present in a list, depending on selected resource. The system searches for all

  15. Recursive Estimation of Gauss-Markov Random Fields Indexed over 1-D Space

    CERN Document Server

    Vats, Divyanshu

    2009-01-01

    This paper presents optimal recursive estimators for vector valued Gauss-Markov random \\emph{fields} taking values in $\\R^M$ and indexed by (intervals of) $\\R$ or $\\Z$. These 1-D fields are often called reciprocal processes. They correspond to two point boundary value fields, i.e., they have boundary conditions given at the end points of the indexing interval. To obtain the recursive estimators, we derive two classes of recursive representations for reciprocal processes. The first class transforms the Gaussian reciprocal process into a Gauss-Markov \\emph{process}, from which we derive forward and backwards recursive representations. The second representation folds the index set and transforms the original \\emph{field} taking values in $\\R^M$ into a Markov \\emph{process} taking values in $\\R^{2M}$. The folding corresponds to recursing the reciprocal process from the boundary points and telescoping inwards. From these recursive representations, Kalman filters and recursive smoothers are promptly derived.

  16. A NEW TOP-K CONDITIONAL XML PREFERENCE QUERIES

    Directory of Open Access Journals (Sweden)

    Shaikhah Alhazmi

    2014-09-01

    Full Text Available Preference querying technology is a very important issue in a variety of applications ranging from ecommerce to personalized search engines. Most of recent research works have been dedicated to this topic in the Artificial Intelligence and Database fields. Several formalisms allowing preference reasoning and specification have been proposed in the Artificial Intelligence domain. On the other hand, in the Database field the interest has been focused mainly in extending standard Structured Query Language (SQL and also eXtensible Markup Language (XML with preference facilities in order to provide personalized query answering. More precisely, the interest in the database context focuses on the notion of Top-k preference query and on the development of efficient methods for evaluating these queries. A Top-k preference query returns k data tuples which are the most preferred according to the user’s preferences. Of course, Top-k preference query answering is closely dependent on the particular preference model underlying the semantics of the operators responsible for selecting the best tuples. In this paper, we consider the Conditional Preference queries (CP-queries where preferences are specified by a set of rules expressed in a logical formalism. We introduce Top-k conditional preference queries (Top-k CP-queries, and the operators BestK-Match and Best-Match for evaluating these queries will be presented.

  17. Recursive utility in a Markov environment with stochastic growth.

    Science.gov (United States)

    Hansen, Lars Peter; Scheinkman, José A

    2012-07-24

    Recursive utility models that feature investor concerns about the intertemporal composition of risk are used extensively in applied research in macroeconomics and asset pricing. These models represent preferences as the solution to a nonlinear forward-looking difference equation with a terminal condition. In this paper we study infinite-horizon specifications of this difference equation in the context of a Markov environment. We establish a connection between the solution to this equation and to an arguably simpler Perron-Frobenius eigenvalue equation of the type that occurs in the study of large deviations for Markov processes. By exploiting this connection, we establish existence and uniqueness results. Moreover, we explore a substantive link between large deviation bounds for tail events for stochastic consumption growth and preferences induced by recursive utility.

  18. ETHICS AND KNOWLEDGE OF RECURSIVITY IN PSYCHOLOGISTS TRAINING

    Directory of Open Access Journals (Sweden)

    Ramón Sanz Ferramola

    2008-07-01

    Full Text Available This work deals with the characterization of psychology as a science and profession. Thisfeature is part of the Argentine academic tradition which goes from the origins of psychology as an undergraduate program by the end of the 1950s to the present day. In relation to this topic, four issues are analysed: a the knowledges of psychology showing the necessity of two epistemic dimensions closely related, namely the discursivity and recursivity, or knowledge and metaknowledge, b the role of psychology as a profession within the praxis, rather than in the poiesis, according to the Greek distinction between the implications of these two modalities of the “doing”, c the concurrence and difference of ethics and deontology, their roles, bounds and potentialities within the psychological field in general, and that of scientific-professional morality in particular, and d the definition and characterization of ethics and epistemology as knowledge of recursivity in psychologists’ training.

  19. On a (2,2-rational recursive sequence

    Directory of Open Access Journals (Sweden)

    Azza K. Khalifa

    2005-09-01

    Full Text Available We investigate the asymptotic behavior of the recursive difference equation yn+1=(α+βyn/(1+yn−1 when the parameters α<0 and β∈ℝ. In particular, we establish the boundedness and the global stability of solutions for different ranges of the parameters α and β. We also give a summary of results and open questions on the more general recursive sequences yn+1=(a+byn/(A+Byn−1, when the parameters a,b,A,B∈ℝ and abAB≠0.

  20. Recursive estimation of the conditional geometric median in Hilbert spaces

    CERN Document Server

    Cardot, Hervé; Zitt, Pierre-André

    2012-01-01

    A recursive estimator of the conditional geometric median in Hilbert spaces is studied. It is based on a stochastic gradient algorithm whose aim is to minimize a weighted L1 criterion and is consequently well adapted for robust online estimation. The weights are controlled by a kernel function and an associated bandwidth. Almost sure convergence and L2 rates of convergence are proved under general conditions on the conditional distribution as well as the sequence of descent steps of the algorithm and the sequence of bandwidths. Asymptotic normality is also proved for the averaged version of the algorithm with an optimal rate of convergence. A simulation study confirms the interest of this new and fast algorithm when the sample sizes are large. Finally, the ability of these recursive algorithms to deal with very high-dimensional data is illustrated on the robust estimation of television audience profiles conditional on the total time spent watching television over a period of 24 hours.