Science.gov

Sample records for updating recursive xml

  1. Update Wizardry: Automatically Generating Update and Import Wizards for Evolving XML-encoded GUIs

    E-print Network

    Petzold, Linda R.

    Update Wizardry: Automatically Generating Update and Import Wizards for Evolving XML-encoded GUIs their "problem sets" to the new GUI. What is needed is update wizards to assist in the process of migrating GUI

  2. Querying XML with Update Syntax University of Edinburgh & Bell Laboratories

    E-print Network

    Fan, Wenfei

    for transform queries. Categories and Subject Descriptors H.2.8 [Database Management]: Systems--Query Processing 11 db part part pname part subPart supplier part part supplier part Figure 1: An example XML document cision support, version management, active databases and integrity maintenance, among other things. While

  3. Efficient Processing of Updates in Dynamic XML Data Changqing Li

    E-print Network

    Ling, Tok Wang

    , the ancestor-descendant and parent-child relationships can be fast determined. If the XML is static operation is to efficiently determine the ancestor- descendant, parent-child, sibling and ordering, etc., are modeled as the nodes of a tree, and relationships are modeled as the edges to connect

  4. XML in Libraries.

    ERIC Educational Resources Information Center

    Tennant, Roy, Ed.

    This book presents examples of how libraries are using XML (eXtensible Markup Language) to solve problems, expand services, and improve systems. Part I contains papers on using XML in library catalog records: "Updating MARC Records with XMLMARC" (Kevin S. Clarke, Stanford University) and "Searching and Retrieving XML Records via the Web" (Theo van…

  5. A recursive method for updating apple firmness prediction models based on spectral scattering images

    NASA Astrophysics Data System (ADS)

    Peng, Yankun; Lu, Renfu

    2007-09-01

    Multispectral scattering is effective for nondestructive prediction of fruit firmness. However, the established prediction models for multispectral scattering are variety specific and may not perform appropriately for fruit harvested from different orchards or at different times. In this research, a recursive least squares method was proposed to update the existing prediction model by adding samples from a new population to assure good performance of the model for predicting fruit from the new population. Multispectral scattering images acquired by a multispectral imaging system from Golden Delicious apples that were harvested at the same time but had different postharvest storage time periods were used to develop the updating method. Radial scattering profiles were described by the modified Lorentzian distribution (MLD) function with four profile parameters for eight wavelengths. Multi-linear regression was performed on MLD parameters to establish prediction models for fruit firmness for each group. The prediction model established in the first group was then updated by using selected samples from the second group, and four different sampling methods were compared and validated with the rest apples. The prediction model corrected by the model-updating method gave good firmness predictions with the correlation coefficient (r) of 0.86 and the standard error of prediction (SEP) of 6.11 N. This model updating method is promising for implementing the spectral scattering technique for real-time prediction of apple fruit firmness.

  6. XML Files

    MedlinePLUS

    ... nlm.nih.gov/medlineplus/xml.html MedlinePlus XML Files To use the sharing features on this page, ... information on all English and Spanish topic groups. Files generated on December 01, 2015 MedlinePlus Health Topic ...

  7. RECURSIVE APPROACHES FOR ONLINE CONSISTENCY CHECKING AND O-D DEMAND UPDATING FOR REAL-

    E-print Network

    Zhou, Xuesong

    TRAFFIC ASSIGNMENT OPERATION Xuesong Zhou xszhou@umd.edu and Hani S. Mahmassani* masmah CONSISTENCY CHECKING AND O-D DEMAND UPDATING FOR REAL-TIME DYNAMIC TRAFFIC ASSIGNMENT OPERATION Xuesong Zhou traffic assignment operation. Both predictive and reactive approaches are proposed to minimize (1

  8. SU-E-T-327: The Update of a XML Composing Tool for TrueBeam Developer Mode

    SciTech Connect

    Yan, Y; Mao, W; Jiang, S

    2014-06-01

    Purpose: To introduce a major upgrade of a novel XML beam composing tool to scientists and engineers who strive to translate certain capabilities of TrueBeam Developer Mode to future clinical benefits of radiation therapy. Methods: TrueBeam Developer Mode provides the users with a test bed for unconventional plans utilizing certain unique features not accessible at the clinical mode. To access the full set of capabilities, a XML beam definition file accommodating all parameters including kV/MV imaging triggers in the plan can be locally loaded at this mode, however it is difficult and laborious to compose one in a text editor. In this study, a stand-along interactive XML beam composing application, TrueBeam TeachMod, was developed on Windows platforms to assist users in making their unique plans in a WYSWYG manner. A conventional plan can be imported in a DICOM RT object as the start of the beam editing process in which trajectories of all axes of a TrueBeam machine can be modified to the intended values at any control point. TeachMod also includes libraries of predefined imaging and treatment procedures to further expedite the process. Results: The TeachMod application is a major of the TeachMod module within DICOManTX. It fully supports TrueBeam 2.0. Trajectories of all axes including all MLC leaves can be graphically rendered and edited as needed. The time for XML beam composing has been reduced to a negligible amount regardless the complexity of the plan. A good understanding of XML language and TrueBeam schema is not required though preferred. Conclusion: Creating XML beams manually in a text editor will be a lengthy error-prone process for sophisticated plans. A XML beam composing tool is highly desirable for R and D activities. It will bridge the gap between scopes of TrueBeam capabilities and their clinical application potentials.

  9. XML under the Hood.

    ERIC Educational Resources Information Center

    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…

  10. XML for Bioinformatics XML for Bioinformatics

    E-print Network

    Richer, Jean-Michel

    XML for Bioinformatics XML for Bioinformatics Jean-Michel Richer jean-michel.richer@univ-angers.fr http://www.info.univ-angers.fr/pub/richer IBSS 2011 - Tanger, Maroc 1 / 82 #12;XML for Bioinformatics computer scientists develop treatments bioinformatics must be a partnership between different scientists

  11. Recursion Mathematics.

    ERIC Educational Resources Information Center

    Olson, Alton T.

    1989-01-01

    Discusses the use of the recursive method to permutations of n objects and a problem making c cents in change using pennies and nickels when order is important. Presents a LOGO program for the examples. (YP)

  12. On recursion

    E-print Network

    Watumull, Jeffrey

    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. ...

  13. XML Keyword Search Introduction

    E-print Network

    Ives, Zachary G.

    are universally available. T RDBMSs allow to mix XML data with other types of data. T RDBMSs have very high Markup Language) T Comparison of SGML and XML T http://www.w3.org/TR/NOTE-sgml-xml- 971215 #12;Sample XML;Contains predicate T Contains predicate is introduced to simplify queries. T contains (tag_name, attribute

  14. Semantically Interoperable XML Data

    PubMed Central

    Vergara-Niedermayr, Cristobal; Wang, Fusheng; Pan, Tony; Kurc, Tahsin; Saltz, Joel

    2013-01-01

    XML is ubiquitously used as an information exchange platform for web-based applications in healthcare, life sciences, and many other domains. Proliferating XML data are now managed through latest native XML database technologies. XML data sources conforming to common XML schemas could be shared and integrated with syntactic interoperability. Semantic interoperability can be achieved through semantic annotations of data models using common data elements linked to concepts from ontologies. In this paper, we present a framework and software system to support the development of semantic interoperable XML based data sources that can be shared through a Grid infrastructure. We also present our work on supporting semantic validated XML data through semantic annotations for XML Schema, semantic validation and semantic authoring of XML data. We demonstrate the use of the system for a biomedical database of medical image annotations and markups. PMID:25298789

  15. ScotlandsPlaces XML: Bespoke XML or XML Mapping?

    ERIC Educational Resources Information Center

    Beamer, Ashley; Gillick, Mark

    2010-01-01

    Purpose: The purpose of this paper is to investigate web services (in the form of parameterised URLs), specifically in the context of the ScotlandsPlaces project. This involves cross-domain querying, data retrieval and display via the development of a bespoke XML standard rather than existing XML formats and mapping between them.…

  16. XML Based Course Websites.

    ERIC Educational Resources Information Center

    Wollowski, Michael

    XML, the extensible markup language, is a quickly evolving technology that presents a viable alternative to courseware products and promises to ease the burden of Web authors, who edit their course pages directly. XML uses tags to label kinds of contents, rather than format information. The use of XML enables faculty to focus on providing…

  17. Compacting XML Data: Zhang, Dyreson, Dang Compacting XML Data

    E-print Network

    Dyreson, Curtis

    Compacting XML Data: Zhang, Dyreson, Dang Compacting XML Data Shuohao Zhang, Curtis Dyreson and Zhe XML Data: Zhang, Dyreson, Dang Book Data Doubleday The Da Vinci Code: Zhang, Dyreson, Dang Same Data, Different Structure Doubleday The Da

  18. XML-BASED REPRESENTATION

    SciTech Connect

    R. KELSEY

    2001-02-01

    For focused applications with limited user and use application communities, XML can be the right choice for representation. It is easy to use, maintain, and extend and enjoys wide support in commercial and research sectors. When the knowledge and information to be represented is object-based and use of that knowledge and information is a high priority, then XML-based representation should be considered. This paper discusses some of the issues involved in using XML-based representation and presents an example application that successfully uses an XML-based representation.

  19. XML and Free Text.

    ERIC Educational Resources Information Center

    Riggs, Ken Roger

    2002-01-01

    Discusses problems with marking free text, text that is either natural language or semigrammatical but unstructured, that prevent well-formed XML from marking text for readily available meaning. Proposes a solution to mark meaning in free text that is consistent with the intended simplicity of XML versus SGML. (Author/LRW)

  20. Adaptable Iterative and Recursive Kalman Filter Schemes

    NASA Technical Reports Server (NTRS)

    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. Exploring a striped XML world 

    E-print Network

    Makalias, Savvas

    2010-01-01

    EXtensible Markup Language, XML, was designed as a markup language for structuring, storing and transporting data on the World Wide Web. The focus of XML is on data content; arbitrary markup is used to describe data. ...

  2. XML and Better Web Searching.

    ERIC Educational Resources Information Center

    Jackson, Joe; Gilstrap, Donald L.

    1999-01-01

    Addresses the implications of the new Web metalanguage XML for searching on the World Wide Web and considers the future of XML on the Web. Compared to HTML, XML is more concerned with structure of data than documents, and these data structures should prove conducive to precise, context rich searching. (Author/LRW)

  3. Compacting XML Structures Using a Dynamic Labeling Scheme

    E-print Network

    Scholl, Marc H.

    . These numbers represent the relationships between nodes, playing a crucial role in ef- ficient query processing efficient techniques for stor- ing and querying XML documents has emerged. A common approach to achieve. Using our proposed approach, it is possible to support efficient query and update processing

  4. XML: An Introduction.

    ERIC Educational Resources Information Center

    Lewis, John D.

    1998-01-01

    Describes XML (extensible markup language), a new language classification submitted to the World Wide Web Consortium that is defined in terms of both SGML (Standard Generalized Markup Language) and HTML (Hypertext Markup Language), specifically designed for the Internet. Limitations of PDF (Portable Document Format) files for electronic journals…

  5. Recursion, Language, and Starlings

    ERIC Educational Resources Information Center

    Corballis, Michael C.

    2007-01-01

    It has been claimed that recursion is one of the properties that distinguishes human language from any other form of animal communication. Contrary to this claim, a recent study purports to demonstrate center-embedded recursion in starlings. I show that the performance of the birds in this study can be explained by a counting strategy, without any…

  6. XML Query Languages Martin Steffen

    E-print Network

    Steffen, Martin

    .0 recommendation (later various versions) · Feb. 2004: XML1.1 · 27. 1. 2007: official XQuery-semantics: [Draper et #12;Relational tables & XML trees people(firstname,lastname,age) John Joe Doe DowJane Jim Beam Dew 34 19 33 44 #12;Relational tables & XML trees John JoeDoe DowJane Jim BeamDew34 19 33 44 #12;Relational

  7. Prosody and recursion

    E-print Network

    Wagner, Michael, Ph. D. Massachusetts Institute of Technology

    2005-01-01

    This thesis proposes a recursive mapping of syntactic derivations to prosodic representations. I argue that the prosody of an expression, just like its meaning, is determined compositionally, as originally proposed in ...

  8. Recursive relational urban design

    E-print Network

    Hillman, Dessen

    2014-01-01

    This thesis proposes a methodology for the act of urban design that is recursive and centered around explicit relational operations, enabled by taking advantage of computation and parametric techniques. It contains iterative ...

  9. How Does XML Help Libraries?

    ERIC Educational Resources Information Center

    Banerjee, Kyle

    2002-01-01

    Discusses XML, how it has transformed the way information is managed and delivered, and its impact on libraries. Topics include how XML differs from other markup languages; the document object model (DOM); style sheets; practical applications for archival materials, interlibrary loans, digital collections, and MARC data; and future possibilities.…

  10. "The Wonder Years" of XML.

    ERIC Educational Resources Information Center

    Gazan, Rich

    2000-01-01

    Surveys the current state of Extensible Markup Language (XML), a metalanguage for creating structured documents that describe their own content, and its implications for information professionals. Predicts that XML will become the common language underlying Web, word processing, and database formats. Also discusses Extensible Stylesheet Language…

  11. XML Schema Languages: Beyond DTD.

    ERIC Educational Resources Information Center

    Ioannides, Demetrios

    2000-01-01

    Discussion of XML (extensible markup language) and the traditional DTD (document type definition) format focuses on efforts of the World Wide Web Consortium's XML schema working group to develop a schema language to replace DTD that will be capable of defining the set of constraints of any possible data resource. (Contains 14 references.) (LRW)

  12. Language and Recursion

    NASA Astrophysics Data System (ADS)

    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.

  13. The Recursion . . . Extended Rice . . .

    E-print Network

    Gallier, Jean

    The Recursion . . . Extended Rice . . . Creative and . . . Home Page Title Page Page 388 of 405 Go . . . Extended Rice . . . Creative and . . . Home Page Title Page Page 389 of 405 Go Back Full Screen Close Quit Rice . . . Creative and . . . Home Page Title Page Page 390 of 405 Go Back Full Screen Close Quit

  14. Recursion in Aphasia

    ERIC Educational Resources Information Center

    Banreti, Zoltan

    2010-01-01

    This study investigates how aphasic impairment impinges on syntactic and/or semantic recursivity of human language. A series of tests has been conducted with the participation of five Hungarian speaking aphasic subjects and 10 control subjects. Photographs representing simple situations were presented to subjects and questions were asked about…

  15. Recursive heuristic classification

    NASA Technical Reports Server (NTRS)

    Wilkins, David C.

    1994-01-01

    The author will describe a new problem-solving approach called recursive heuristic classification, whereby a subproblem of heuristic classification is itself formulated and solved by heuristic classification. This allows the construction of more knowledge-intensive classification programs in a way that yields a clean organization. Further, standard knowledge acquisition and learning techniques for heuristic classification can be used to create, refine, and maintain the knowledge base associated with the recursively called classification expert system. The method of recursive heuristic classification was used in the Minerva blackboard shell for heuristic classification. Minerva recursively calls itself every problem-solving cycle to solve the important blackboard scheduler task, which involves assigning a desirability rating to alternative problem-solving actions. Knowing these ratings is critical to the use of an expert system as a component of a critiquing or apprenticeship tutoring system. One innovation of this research is a method called dynamic heuristic classification, which allows selection among dynamically generated classification categories instead of requiring them to be prenumerated.

  16. A Join Index for XML Data Warehouses

    E-print Network

    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.

  17. XWeB: The XML Warehouse Benchmark

    NASA Astrophysics Data System (ADS)

    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.

  18. XWeB: the XML Warehouse Benchmark

    E-print Network

    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.

  19. Experincia de Utilizao de XML no SMS

    E-print Network

    Neshich, Goran

    -RPC ­­ Java API for XML based RPC, onde RPC significa Remote Procedure Call. 10 AIX-SDK - Java Development Kit para sistema operacional AIX Unix da IBM. 11 JROM - Java Record Object Model. 12 XDK - XML Development@cbi.cnptia.embrapa.br) 8 JAXP ­ Java API for XML Parsing, onde API significa Application Programming Interface. 9 JAX

  20. Setting the Standard: XML on Campus.

    ERIC Educational Resources Information Center

    Rawlins, Mike

    2001-01-01

    Explains what XML (Extensible Markup Language) is; where to find it in a few years (everywhere from Web pages, to database management systems, to common campus applications); issues that will make XML somewhat of an experimental strategy in the near term; and the importance of decision-makers being abreast of XML trends in standards, tools…

  1. A recursive technique for adaptive vector quantization

    NASA Technical Reports Server (NTRS)

    Lindsay, Robert A.

    1989-01-01

    Vector Quantization (VQ) is fast becoming an accepted, if not preferred method for image compression. The VQ performs well when compressing all types of imagery including Video, Electro-Optical (EO), Infrared (IR), Synthetic Aperture Radar (SAR), Multi-Spectral (MS), and digital map data. The only requirement is to change the codebook to switch the compressor from one image sensor to another. There are several approaches for designing codebooks for a vector quantizer. Adaptive Vector Quantization is a procedure that simultaneously designs codebooks as the data is being encoded or quantized. This is done by computing the centroid as a recursive moving average where the centroids move after every vector is encoded. When computing the centroid of a fixed set of vectors the resultant centroid is identical to the previous centroid calculation. This method of centroid calculation can be easily combined with VQ encoding techniques. The defined quantizer changes after every encoded vector by recursively updating the centroid of minimum distance which is the selected by the encoder. Since the quantizer is changing definition or states after every encoded vector, the decoder must now receive updates to the codebook. This is done as side information by multiplexing bits into the compressed source data.

  2. Using XML to encode TMA DES metadata

    PubMed Central

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

    2011-01-01

    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. PMID:21969921

  3. Recursive Objects--An Object Oriented Presentation of Recursion

    ERIC Educational Resources Information Center

    Sher, David B.

    2004-01-01

    Generally, when recursion is introduced to students the concept is illustrated with a toy (Towers of Hanoi) and some abstract mathematical functions (factorial, power, Fibonacci). These illustrate recursion in the same sense that counting to 10 can be used to illustrate a for loop. These are all good illustrations, but do not represent serious…

  4. Evolving Recursive Programs using Non-recursive Scaffolding

    E-print Network

    Kent, University of

    generally produces a completely wrong program. In this paper, we present a simple and general method problem above, as evolution does not search the space of recursive programs. We present promising with the evolution of recursive programs. One difficulty is that GP operators, are rarely successful when applied

  5. Capturing Chemistry in XML/CML

    E-print Network

    Townsend, Joseph A; Adams, Sam; Goodman, Jonathan M; Murray-Rust, Peter; Waudby, Chris A

    Capturing Chemistry in XML/CML ACS March 2004 The World The Agony Of Publication - Loss Capturing Chemistry in XML/CML ACS March 2004 The World Sad The Scientist The Lab Journals Web Pages The Vision-1 Capturing Chemistry in XML/CML ACS March 2004 XML/CML ACS March 2004 Coordinates Energy Levels Vibrations Coordinates Energy Level Vibration CML File CMLCore CMLCore CMLComp CMLSpect Input/jobControl General Parsers Display Process 1 Capturing Chemistry in XML/CML ACS March 2004 Comp...

  6. Presentation of XML content using WYSIWYG templates

    E-print Network

    Joarder, Arif

    2008-01-01

    TinyMCE was used. TinyMCE is an open source editor freely available on the World Wide Web and works on all major browsers. Figure 12 shows a snapshot of this editor. Each unique path from the root node to non- terminal nodes with atleast one... HTML web pages from XML data. Figure 1 shows an example of XML data and XSL style sheet description for rendering the data for presentation. 9 In order to view XML data we need an XML transformation mechanism to convert the XML data into a...

  7. Keys with Upward Wildcards for XML Wenfei Fan 1 , Peter Schwenzer 2 , and Kun Wu 3

    E-print Network

    Fan, Wenfei

    the semantics of the data, preserving information in data exchange and integration, preventing update anomalies an XML document that contains information about states, counties and cities in the U.S. The document Laboratories and Temple University wenfei@acm.org 2 Temple University Health System schwenp@tuhis.temple.edu 3

  8. Minimal Recursion Semantics An Introduction

    E-print Network

    Copestake, Ann

    Minimal Recursion Semantics An Introduction Ann Copestake Dan Flickinger Ivan A. Sag Carl Pollard: Research on Language and Computation, 3(2­3), pages 281-332, 2005 Abstract Minimal recursion semantics (MRS) is a framework for computational semantics that is suitable for parsing and generation and that can

  9. Recursive Feature Extraction in Graphs

    SciTech Connect

    2014-08-14

    ReFeX extracts recursive topological features from graph data. The input is a graph as a csv file and the output is a csv file containing feature values for each node in the graph. The features are based on topological counts in the neighborhoods of each nodes, as well as recursive summaries of neighbors' features.

  10. Speed up of XML parsers with PHP language implementation

    NASA Astrophysics Data System (ADS)

    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.

  11. Recursivity in Lingua Cosmica

    NASA Astrophysics Data System (ADS)

    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.

  12. Introduction inIntroduction in XQueryXQuery and XML query processingand XML query processing

    E-print Network

    Ghelli, Giorgio

    domains for XMLfor XML Data exchange on the WebData exchange on the Web e.g.HealthCare Level Sevene.g.Health processing: the big picture State of the artState of the art Open questions in XML query processing (Universal Resource Locator) Data + documents = information 1996 XML (Extended Markup Language) URI

  13. Tomcat, Oracle & XML Web Archive

    Energy Science and Technology Software Center (ESTSC)

    2008-01-01

    The TOX (Tomcat Oracle & XML) web archive is a foundation for development of HTTP-based applications using Tomcat (or some other servlet container) and an Oracle RDBMS. Use of TOX requires coding primarily in PL/SQL, JavaScript, and XSLT, but also in HTML, CSS and potentially Java. Coded in Java and PL/SQL itself, TOX provides the foundation for more complex applications to be built.

  14. XML Schema Representation of DICOM Structured Reporting

    PubMed Central

    Lee, K. P.; Hu, Jingkun

    2003-01-01

    Objective: The Digital Imaging and Communications in Medicine (DICOM) Structured Reporting (SR) standard improves the expressiveness, precision, and comparability of documentation about diagnostic images and waveforms. It supports the interchange of clinical reports in which critical features shown by images and waveforms can be denoted unambiguously by the observer, indexed, and retrieved selectively by subsequent reviewers. It is essential to provide access to clinical reports across the health care enterprise by using technologies that facilitate information exchange and processing by computers as well as provide support for robust and semantically rich standards, such as DICOM. This is supported by the current trend in the healthcare industry towards the use of Extensible Markup Language (XML) technologies for storage and exchange of medical information. The objective of the work reported here is to develop XML Schema for representing DICOM SR as XML documents. Design: We briefly describe the document type definition (DTD) for XML and its limitations, followed by XML Schema (the intended replacement for DTD) and its features. A framework for generating XML Schema for representing DICOM SR in XML is presented next. Measurements: None applicable. Results: A schema instance based on an SR example in the DICOM specification was created and validated against the schema. The schema is being used extensively in producing reports on Philips Medical Systems ultrasound equipment. Conclusion: With the framework described it is feasible to generate XML Schema using the existing DICOM SR specification. It can also be applied to generate XML Schemas for other DICOM information objects. PMID:12595410

  15. Recursive adaptive frame integration limited

    NASA Astrophysics Data System (ADS)

    Rafailov, Michael K.

    2006-05-01

    Recursive Frame Integration Limited was proposed as a way to improve frame integration performance and mitigate issues related to high data rate needed for conventional frame integration. The technique applies two thresholds - one tuned for optimum probability of detection, the other to manage required false alarm rate - and allows a non-linear integration process that, along with Signal-to-Noise Ratio (SNR) gain, provides system designers more capability where cost, weight, or power considerations limit system data rate, processing, or memory capability. However, Recursive Frame Integration Limited may have performance issues when single frame SNR is really low. Recursive Adaptive Frame Integration Limited is proposed as a means to improve limited integration performance with really low single frame SNR. It combines the benefits of nonlinear recursive limited frame integration and adaptive thresholds with a kind of conventional frame integration.

  16. Hopf algebras and topological recursion

    NASA Astrophysics Data System (ADS)

    Esteves, João N.

    2015-11-01

    We consider a model for topological recursion based on the Hopf algebra of planar binary trees defined by Loday and Ronco (1998 Adv. Math. 139 293-309 We show that extending this Hopf algebra by identifying pairs of nearest neighbor leaves, and thus producing graphs with loops, we obtain the full recursion formula discovered by Eynard and Orantin (2007 Commun. Number Theory Phys. 1 347-452).

  17. Recursive least-squares learning algorithms for neural networks

    SciTech Connect

    Lewis, P.S. ); Hwang, Jenq-Neng . Dept. of Electrical Engineering)

    1990-01-01

    This paper presents the development of a pair of recursive least squares (RLS) algorithms for online training of multilayer perceptrons, which are a class of feedforward artificial neural networks. These algorithms incorporate second order information about the training error surface in order to achieve faster learning rates than are possible using first order gradient descent algorithms such as the generalized delta rule. A least squares formulation is derived from a linearization of the training error function. Individual training pattern errors are linearized about the network parameters that were in effect when the pattern was presented. This permits the recursive solution of the least squares approximation, either via conventional RLS recursions or by recursive QR decomposition-based techniques. The computational complexity of the update is in the order of (N{sup 2}), where N is the number of network parameters. This is due to the estimation of the N {times} N inverse Hessian matrix. Less computationally intensive approximations of the RLS algorithms can be easily derived by using only block diagonal elements of this matrix, thereby partitioning the learning into independent sets. A simulation example is presented in which a neural network is trained to approximate a two dimensional Gaussian bump. In this example, RLS training required an order of magnitude fewer iterations on average (527) than did training with the generalized delta rule (6331). 14 refs., 3 figs.

  18. XML Specification of GUI Kongens Lyngby 2006

    E-print Network

    XML 2nd Edition Author: David Hunter, Kurt Cagle, Chris Dix, Roger Kovack, Jonatan Pinnock, Jeff Rafter ISBN 1-861005-59-8 [B] Professional XML 2nd Edition Author: Mark Birbeck, Jon Duckett, Oli Gauti behaviour, dynamic behaviour and transformation. The static behaviour contains a set of widgets for a GUI, e

  19. XML Classification Using Content and Structure

    E-print Network

    Kansas, University of

    XML Classification Using Content and Structure Swathy Giri, Aravind Chandramouli, and Susan GauchReport The University of Kansas ITR0225676 (Science Environment for Ecological Knowledge) #12;XML Classification Using Content and Structure Swathy Giri, Aravind Chandramouli & Susan Gauch University of Kansas Lawrence, KS

  20. A Novel Navigation Paradigm for XML Repositories.

    ERIC Educational Resources Information Center

    Azagury, Alain; Factor, Michael E.; Maarek, Yoelle S.; Mandler, Benny

    2002-01-01

    Discusses data exchange over the Internet and describes the architecture and implementation of an XML document repository that promotes a navigation paradigm for XML documents based on content and context. Topics include information retrieval and semistructured documents; and file systems as information storage infrastructure, particularly XMLFS.…

  1. Get It Together: Integrating Data with XML.

    ERIC Educational Resources Information Center

    Miller, Ron

    2003-01-01

    Discusses the use of XML for data integration to move data across different platforms, including across the Internet, from a variety of sources. Topics include flexibility; standards; organizing databases; unstructured data and the use of meta tags to encode it with XML information; cost effectiveness; and eliminating client software licenses.…

  2. ONYX: Towards an Internet-Scale XML

    E-print Network

    Ives, Zachary G.

    1 ONYX: Towards an Internet-Scale XML Dissemination Service Yanlei Diao, Shariq Rizvi, Michael J data volume by a large factor. #12;2 Here comes ONYX... ONYX: Operator Network Using YFilter for XML Distribution No Yes ONYX An example Data Source Broker 1 Broker 2 Broker 4 Broker 3 Broker 5 Broker 6 query

  3. Comparative Analysis of XML Compression Technologies

    E-print Network

    Ng, Wilfred Siu Hung

    Comparative Analysis of XML Compression Technologies Wilfred Ng Lam Wai Yeung James Cheng Department of Computer Science The Hong Kong University of Science and Technology Hong Kong Email: {wilfred applications related to mobile communication. In this paper, we survey a range of recently proposed XML

  4. Multi-Predicate Induction Schemes for Mutual Recursion 

    E-print Network

    Boulton, Richard

    Where mutually recursive data types are used in programming languages, etc., mutually recursive functions are usually required. Mutually recursive functions are also quite common for non-mutually recursive types. Reasoning ...

  5. Temporal XML Data Warehouses: Challenges and Solutions Kjetil Nrvag

    E-print Network

    Nørvåg, Kjetil

    Temporal XML Data Warehouses: Challenges and Solutions Kjetil Nørv°ag Department of Computer into an XML data warehouse. Often, we want to query historical document versions, or query changes between document versions. This can be facilitated by a temporal XML data warehouse (XML-DW). In this pa- per, we

  6. An Introduction to the Extensible Markup Language (XML).

    ERIC Educational Resources Information Center

    Bryan, Martin

    1998-01-01

    Describes Extensible Markup Language (XML), a subset of the Standard Generalized Markup Language (SGML) that is designed to make it easy to interchange structured documents over the Internet. Topics include Document Type Definition (DTD), components of XML, the use of XML, text and non-text elements, and uses for XML-coded files. (LRW)

  7. XML, TEI, and Digital Libraries in the Humanities.

    ERIC Educational Resources Information Center

    Nellhaus, Tobin

    2001-01-01

    Describes the history and major features of XML and TEI, discusses their potential utility for the creation of digital libraries, and focuses on XML's application in the humanities, particularly theater and drama studies. Highlights include HTML and hyperlinks; the impact of XML on text encoding and document access; and XML and academic…

  8. Recursion Relations for Conformal Blocks

    E-print Network

    João Penedones; Emilio Trevisani; Masahito Yamazaki

    2015-09-01

    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.

  9. Recursion in an iterated learning experiment 

    E-print Network

    Jackson, Tom

    2013-11-27

    In recent years there has been much debate concerning the human language faculty and the presence of a recursive mechanism in our mental grammar. In a similar vein, syntactic recursion (e.g. centre-embedded clauses: [the ...

  10. Type Theory and Recursion Extended Abstract 

    E-print Network

    Plotkin, Gordon

    2003-11-05

    At first sight, type theory and recursion are compatible: there are many models of the typed lambda calculus with a recursion operator at all types. However the situation changes as soon as one considers sums. By a theorem ...

  11. Generators, Recursion, and Fractals 1 Generators

    E-print Network

    Verschelde, Jan

    Generators, Recursion, and Fractals 1 Generators computing a list of Fibonacci numbers defining a generator with yield putting yield in the function fib 2 Recursive Functions computing factorials, 24 April 2015 Intro to Computer Science (MCS 260) generators and recursion L-41 24 April 2015 1 / 36

  12. Part and Appearance Sharing: Recursive Compositional Models

    E-print Network

    Oliva, Aude

    Part and Appearance Sharing: Recursive Compositional Models for Multi-View Multi-Object Detection) Hierarchical parts-based object representation #12;Recursive Compositional Models (RCMs) Recursive representation of objects as compositions of parts Edges encode parent-child relations of parts State variables

  13. XML Format for SESAME and LEOS

    SciTech Connect

    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.

  14. Safe software standards and XML schemas

    NASA Astrophysics Data System (ADS)

    Leif, Robert C.

    2010-02-01

    The goal of this work is to develop a safe software construction means for an XML based data standard for a class of medical devices, cytometry instruments. Unfortunately, the amount of empirical evidence to archive this goal is minimal. Therefore, technologies associated with high reliability were employed together with reuse of existing designs. The basis for a major part of the design was the Digital Imaging and Communications in Medicine (DICOM) standard and the Flow Cytometry Standard (FCS). Since the DICOM Standard is a Class II device, the safety of software should be maximized. The XML Schema Definition Language (XSDL) has been used to develop schemas that maximize readability, modularity, strong typing, and reuse. An instance and an instrument XML schema were created for data obtained with a microscope by importing multiple schemas that each consisted of a class that described one object. This design was checked by validating the schemas and creating XML pages from them.

  15. MedlinePlus XML Data Sources

    MedlinePLUS

    ... format. The Web service provides access to all English and Spanish MedlinePlus health topics and offers a ... Health Topic Group XML These files cover all English and Spanish health topics and can be found ...

  16. XML Flight/Ground Data Dictionary Management

    NASA Technical Reports Server (NTRS)

    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.

  17. Core Recursive Hierarchical Image Segmentation

    NASA Technical Reports Server (NTRS)

    Tilton, James

    2011-01-01

    The Recursive Hierarchical Image Segmentation (RHSEG) software has been repackaged to provide a version of the RHSEG software that is not subject to patent restrictions and that can be released to the general public through NASA GSFC's Open Source release process. Like the Core HSEG Software Package, this Core RHSEG Software Package also includes a visualization program called HSEGViewer along with a utility program HSEGReader. It also includes an additional utility program called HSEGExtract. The unique feature of the Core RHSEG package is that it is a repackaging of the RHSEG technology designed to specifically avoid the inclusion of the certain software technology. Unlike the Core HSEG package, it includes the recursive portions of the technology, but does not include processing window artifact elimination technology.

  18. Recursive simulation of quantum annealing

    E-print Network

    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.

  19. Recursive simulation of quantum annealing

    NASA Astrophysics Data System (ADS)

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

    2015-10-01

    The evaluation of the performance of adiabatic annealers is hindered by the 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.

  20. A Quantitative Summary of XML Structures , Bingsheng He2

    E-print Network

    Choi, Byron "Koon Kau"

    -to-many relation- ships, of XML documents. Our technique is different from the existing ones in that we generate and experimentations. 1 Introduction eXtensible Markup Language (xml) is known to be a flexible [33] medium for online

  1. Het ontwikkelen van XML-tools Johan Jeuring

    E-print Network

    Heeren, Bastiaan

    genealogische gegevens, het beschrijven van chemische structuren, en het doorgeven van financi¨ele transacties te publiceren, en om een chemische structuur beschreven in XML mee te presenteren. Veelgebruikte XML

  2. A Survey in Indexing and Searching XML Documents.

    ERIC Educational Resources Information Center

    Luk, Robert W. P.; Leong, H. V.; Dillon, Tharam S.; Chan, Alvin T. S.; Croft, W. Bruce; Allan, James

    2002-01-01

    Discussion of XML focuses on indexing techniques for XML documents, grouping them into flat-file, semistructured, and structured indexing paradigms. Highlights include searching techniques, including full text search and multistage search; search result presentations; database and information retrieval system integration; XML query languages; and…

  3. Visibly Pushdown Transducers for Approximate Validation of Streaming XML

    E-print Network

    Srinivasan, Venkatesh

    Markup Language (XML) is the lingua franca for data and doc- ument exchange on the Web and used in a variety of applications ranging from collaborative commerce to medical databases. One of the most streaming XML ([14]). In this work, it was shown that VPAs precisely capture the lan- guages of XML

  4. A Smart XML Access Right Controller for Mobile Applications

    E-print Network

    embedded in a cellular phone SIM card. 1 Introduction Chip-Secured XML Access (C-SXA) is a versatile XML Access (C-SXA) is a versatile XML-based Access Right Controller embedded in a smart card. C-SXA can- based Access Right Controller embedded in a smart card. C-SXA evaluates the user's privileges on on

  5. XML: How It Will Be Applied to Digital Library Systems.

    ERIC Educational Resources Information Center

    Kim, Hyun-Hee; Choi, Chang-Seok

    2000-01-01

    Shows how XML is applied to digital library systems. Compares major features of XML with those of HTML and describes an experimental XML-based metadata retrieval system, which is based on the Dublin Core and is designed as a subsystem of the Korean Virtual Library and Information System (VINIS). (Author/LRW)

  6. XML and E-Journals: The State of Play.

    ERIC Educational Resources Information Center

    Wusteman, Judith

    2003-01-01

    Discusses the introduction of the use of XML (Extensible Markup Language) in publishing electronic journals. Topics include standards, including DTDs (Document Type Definition), or document type definitions; aggregator requirements; SGML (Standard Generalized Markup Language); benefits of XML for e-journals; XML metadata; the possibility of…

  7. XML Research for Formal Language Theorists Wim Martens

    E-print Network

    Martens, Wim

    XML Research for Formal Language Theorists Wim Martens TU Dortmund Wim Martens (TU Dortmund) XML for Formal Language Theorists May 14, 2008 1 / 65 #12;Goal of this talk XML Research vs Formal Languages Wim patterns regular expressions Formal Language Theory has a nice algorithmic toolbox Wim Martens (TU

  8. XML Based Scientific Data Management Facility

    NASA Technical Reports Server (NTRS)

    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.

  9. Using Spreadsheets to Help Students Think Recursively

    ERIC Educational Resources Information Center

    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…

  10. Time-varying modal parameters identification of a spacecraft with rotating flexible appendage by recursive algorithm

    NASA Astrophysics Data System (ADS)

    Ni, Zhiyu; Mu, Ruinan; Xun, Guangbin; Wu, Zhigang

    2016-01-01

    The rotation of spacecraft flexible appendage may cause changes in modal parameters. For this time-varying system, the computation cost of the frequently-used singular value decomposition (SVD) identification method is high. Some control problems, such as the self-adaptive control, need the latest modal parameters to update the controller parameters in time. In this paper, the projection approximation subspace tracking (PAST) recursive algorithm is applied as an alternative method to identify the time-varying modal parameters. This method avoids the SVD by signal subspace projection and improves the computational efficiency. To verify the ability of this recursive algorithm in spacecraft modal parameters identification, a spacecraft model with rapid rotational appendage, Soil Moisture Active/Passive (SMAP) satellite, is established, and the time-varying modal parameters of the satellite are identified recursively by designing the input and output signals. The results illustrate that this recursive algorithm can obtain the modal parameters in the high signal noise ratio (SNR) and it has better computational efficiency than the SVD method. Moreover, to improve the identification precision of this recursive algorithm in the low SNR, the wavelet de-noising technology is used to decrease the effect of noises.

  11. Enhancing XML Data Warehouse Query Performance by Fragmentation

    E-print Network

    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.

  12. Using Structural Relationships for Focused XML Retrieval

    E-print Network

    de Vries, Arjen P.

    , The Netherlands {georgina, thijs, arjen}@cwi.nl Abstract. In focused XML retrieval, information retrieval systems retrieval systems use conventional information retrieval techniques to determine the order in which to best present results to the user, but, as opposed to traditional IR systems, they also choose the retrieval

  13. XTCE. XML Telemetry and Command Exchange Tutorial

    NASA Technical Reports Server (NTRS)

    Rice, Kevin; Kizzort, Brad; Simon, Jerry

    2010-01-01

    An XML Telemetry Command Exchange (XTCE) tutoral oriented towards packets or minor frames is shown. The contents include: 1) The Basics; 2) Describing Telemetry; 3) Describing the Telemetry Format; 4) Commanding; 5) Forgotten Elements; 6) Implementing XTCE; and 7) GovSat.

  14. XEM: XML Evolution Management Diane Kramer

    E-print Network

    of Department Professor Isabel Cruz, Thesis Reader #12;Abstract As information on the World Wide Web continues to DTDs and XML data and reloading them from scratch. In this vein, we put forth the first solution through the process of completing my thesis for my Master's degree, and to my reader, Professor Isabel

  15. XML-based resources for simulation

    SciTech Connect

    Kelsey, R. L.; Riese, J. M.; Young, G. A.

    2004-01-01

    As simulations and the machines they run on become larger and more complex the inputs and outputs become more unwieldy. Increased complexity makes the setup of simulation problems difficult. It also contributes to the burden of handling and analyzing large amounts of output results. Another problem is that among a class of simulation codes (such as those for physical system simulation) there is often no single standard format or resource for input data. To run the same problem on different simulations requires a different setup for each simulation code. The extensible Markup Language (XML) is used to represent a general set of data resources including physical system problems, materials, and test results. These resources provide a 'plug and play' approach to simulation setup. For example, a particular material for a physical system can be selected from a material database. The XML-based representation of the selected material is then converted to the native format of the simulation being run and plugged into the simulation input file. In this manner a user can quickly and more easily put together a simulation setup. In the case of output data, an XML approach to regression testing includes tests and test results with XML-based representations. This facilitates the ability to query for specific tests and make comparisons between results. Also, output results can easily be converted to other formats for publishing online or on paper.

  16. Shuttle-Data-Tape XML Translator

    NASA Technical Reports Server (NTRS)

    Barry, Matthew R.; Osborne, Richard N.

    2005-01-01

    JSDTImport is a computer program for translating native Shuttle Data Tape (SDT) files from American Standard Code for Information Interchange (ASCII) format into databases in other formats. JSDTImport solves the problem of organizing the SDT content, affording flexibility to enable users to choose how to store the information in a database to better support client and server applications. JSDTImport can be dynamically configured by use of a simple Extensible Markup Language (XML) file. JSDTImport uses this XML file to define how each record and field will be parsed, its layout and definition, and how the resulting database will be structured. JSDTImport also includes a client application programming interface (API) layer that provides abstraction for the data-querying process. The API enables a user to specify the search criteria to apply in gathering all the data relevant to a query. The API can be used to organize the SDT content and translate into a native XML database. The XML format is structured into efficient sections, enabling excellent query performance by use of the XPath query language. Optionally, the content can be translated into a Structured Query Language (SQL) database for fast, reliable SQL queries on standard database server computers.

  17. Flight Dynamic Model Exchange using XML

    NASA Technical Reports Server (NTRS)

    Jackson, E. Bruce; Hildreth, Bruce L.

    2002-01-01

    The AIAA Modeling and Simulation Technical Committee has worked for several years to develop a standard by which the information needed to develop physics-based models of aircraft can be specified. The purpose of this standard is to provide a well-defined set of information, definitions, data tables and axis systems so that cooperating organizations can transfer a model from one simulation facility to another with maximum efficiency. This paper proposes using an application of the eXtensible Markup Language (XML) to implement the AIAA simulation standard. The motivation and justification for using a standard such as XML is discussed. Necessary data elements to be supported are outlined. An example of an aerodynamic model as an XML file is given. This example includes definition of independent and dependent variables for function tables, definition of key variables used to define the model, and axis systems used. The final steps necessary for implementation of the standard are presented. Software to take an XML-defined model and import/export it to/from a given simulation facility is discussed, but not demonstrated. That would be the next step in final implementation of standards for physics-based aircraft dynamic models.

  18. Bayesian recursive data pattern tomography

    E-print Network

    Alexander Mikhalychev; Dmitri Mogilevtsev; Yong Siah Teo; Jaroslav Rehacek; Zdenek Hradil

    2015-11-05

    We present a simple and efficient Bayesian recursive algorithm for the data-pattern scheme for quantum state reconstruction, which is applicable to situations where measurement settings can be controllably varied efficiently. The algorithm predicts the best measurements required to accurately reconstruct the unknown signal state in terms of a fixed set of probe states. In each iterative step, this algorithm seeks the measurement setting that minimizes the variance of the data-pattern estimator, which essentially measures the reconstruction accuracy, with the help of a data-pattern bank that was acquired prior to the signal reconstruction. We show that with this algorithm, it is possible to minimize the number of measurement settings required to obtain a reasonably accurate state estimator by using just the optimal settings and, at the same time, increasing the numerical efficiency of the data-pattern reconstruction.

  19. Recursive Models of Theories with Few Bakhadyr Khoussainov

    E-print Network

    Shore, Richard A.

    Recursive Models of Theories with Few Models Bakhadyr Khoussainov Mathematics Department, Cornell by presenting some basic definitions from effective model theory. A recursive structure is one with a recursive structures. A basic question in recursive model theory is whether a given first order theory T has

  20. Experimental Evaluation of Processing Time for the Synchronization of XML-Based Business Objects

    NASA Astrophysics Data System (ADS)

    Ameling, Michael; Wolf, Bernhard; Springer, Thomas; Schill, Alexander

    Business objects (BOs) are data containers for complex data structures used in business applications such as Supply Chain Management and Customer Relationship Management. Due to the replication of application logic, multiple copies of BOs are created which have to be synchronized and updated. This is a complex and time consuming task because BOs rigorously vary in their structure according to the distribution, number and size of elements. Since BOs are internally represented as XML documents, the parsing of XML is one major cost factor which has to be considered for minimizing the processing time during synchronization. The prediction of the parsing time for BOs is an significant property for the selection of an efficient synchronization mechanism. In this paper, we present a method to evaluate the influence of the structure of BOs on their parsing time. The results of our experimental evaluation incorporating four different XML parsers examine the dependencies between the distribution of elements and the parsing time. Finally, a general cost model will be validated and simplified according to the results of the experimental setup.

  1. Method for implementation of recursive hierarchical segmentation on parallel computers

    NASA Technical Reports Server (NTRS)

    Tilton, James C. (Inventor)

    2005-01-01

    A method, computer readable storage, and apparatus for implementing a recursive hierarchical segmentation algorithm on a parallel computing platform. The method includes setting a bottom level of recursion that defines where a recursive division of an image into sections stops dividing, and setting an intermediate level of recursion where the recursive division changes from a parallel implementation into a serial implementation. The segmentation algorithm is implemented according to the set levels. The method can also include setting a convergence check level of recursion with which the first level of recursion communicates with when performing a convergence check.

  2. Quantification of Gas Mixtures with Active Recursive Estimation

    NASA Astrophysics Data System (ADS)

    Gosangi, Rakesh; Gutierrez-Osuna, Ricardo

    2011-09-01

    We present an active-sensing strategy to estimate the concentrations in a gas mixture using temperature modulation of metal-oxide (MOX) sensors. The approach is based on recursive Bayesian estimation and uses an information-theoretic criterion to select operating temperatures on-the-fly. Recursive estimation has been widely used in mobile robotics, e.g., for localization purposes. Here, we employ a similar approach to estimate the concentrations of the constituents in a gas mixture. In this formulation, we represent a concentration profile as a discrete state and maintain a `belief' distribution that represents the probability of each state. We employ a Bayes filter to update the belief distribution whenever new sensor measurements arrive, and a mutual-information criterion to select the next operating temperature. This allows us to optimize the temperature program in real time, as the sensor interacts with its environment. We validate our approach on a simulated dataset generated from temperature modulated responses of a MOX sensor exposed to a mixture of three analytes. The results presented here provide a preliminary proof of concept for an agile approach to quantifying gas mixtures.

  3. Using Heaps in Recursive Hierarchical Segmentation of Data

    NASA Technical Reports Server (NTRS)

    Tilton, James C.

    2006-01-01

    A modification to increase processing speed has been made in the algorithm and implementing software reported in Modified Recursive Hierarchical Segmentation of Data (GSC-14681-1), NASA Tech Briefs, Vol. 30, No. 6 (June 2006), page 51. That software performs recursive hierarchical segmentation of data having spatial characteristics (e.g., spectral-image data). The segmentation process includes an iterative subprocess, in each iteration of which it is necessary to determine a best pair of regions to merge [merges being justified by one or more measure(s) similarity of pixels in the regions]. In the previously reported version of the algorithm and software, the choice of a best pair of regions to merge involved the use of a fully sorted list of regions. That version was computationally inefficient because a fully sorted list is not needed: what is needed is only the identity of the pair of regions characterized by the smallest measure of dissimilarity. The present modification replaces the use of a fully sorted list with the use of data heaps, which are computationally more efficient for performing the required comparisons among dissimilarity measures. The modification includes the incorporation of standard and modified functions for creating and updating data heaps

  4. 78 FR 28732 - Revisions to Electric Quarterly Report Filing Process; Availability of Draft XML Schema

    Federal Register 2010, 2011, 2012, 2013, 2014

    2013-05-16

    ...Report Filing Process; Availability of Draft XML Schema AGENCY: Federal Energy Regulatory...gov), Extensible Mark-Up Language (XML) needed to make Electric Quarterly Report...Section below for details. DATES: The XML is now available at the links...

  5. FAITHFUL IDEAL MODELS FOR RECURSIVE POLYMORPHIC TYPES 

    E-print Network

    Abadi, Martin; Pierce, Benjamin; Plotkin, Gordon

    2003-11-03

    We explore ideal models for a programming language with recursive polymorphic types, variants of the model studied by MacQueen, Plotkin, and Sethi. The use of suitable ideals yields a close fit between models and programming ...

  6. A Recursive Techniques Editor for Prolog 

    E-print Network

    Bundy, Alan; Grosse, G.; Brna, Paul

    We describe an editor geared to recursive Prolog procedures. It is similar to the structure editors built for many programming languages, except that instead of just ensuring the correctness of the syntax of the procedures ...

  7. Machine Assisted Proofs of Recursion Implementation 

    E-print Network

    Cohn, Avra Jean

    1979-01-01

    Three studies in the machine assisted proof of recursion implementation are described. The verification system used is Edinburgh LCF (Logic for Computable Functions). Proofs are generated, in LCF, in a goal-oriented ...

  8. MITOSIS RECURSION FOR COEFFICIENTS OF SCHUBERT POLYNOMIALS

    E-print Network

    Miller, Ezra N.

    MITOSIS RECURSION FOR COEFFICIENTS OF SCHUBERT POLYNOMIALS EZRA MILLER Abstract.Mitosis is a rule introduced in [KM02a] for manipulating subsets proof of these properties of mitosis. 1. Introduction It has been

  9. A Simple XML Producer-Consumer Protocol

    NASA Technical Reports Server (NTRS)

    Smith, Warren; Gunter, Dan; Quesnel, Darcy

    2000-01-01

    This document describes a simple XML-based protocol that can be used for producers of events to communicate with consumers of events. The protocol described here is not meant to be the most efficient protocol, the most logical protocol, or the best protocol in any way. This protocol was defined quickly and it's intent is to give us a reasonable protocol that we can implement relatively easily and then use to gain experience in distributed event services. This experience will help us evaluate proposals for event representations, XML-based encoding of information, and communication protocols. The next section of this document describes how we represent events in this protocol and then defines the two events that we choose to use for our initial experiments. These definitions are made by example so that they are informal and easy to understand. The following section then proceeds to define the producer-consumer protocol we have agreed upon for our initial experiments.

  10. XML Based Scientific Data Management Facility

    NASA Technical Reports Server (NTRS)

    Mehrotra, Piyush; Zubair, M.; Ziebartt, John (Technical Monitor)

    2001-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 HTML 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.

  11. An Exponentiation Method for XML Element Retrieval

    PubMed Central

    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. PMID:24696643

  12. An exponentiation method for XML element retrieval.

    PubMed

    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. PMID:24696643

  13. Recursive Inversion Of Externally Defined Linear Systems

    NASA Technical Reports Server (NTRS)

    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.

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

    E-print Network

    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.

  15. Recursive Branching Simulated Annealing Algorithm

    NASA Technical Reports Server (NTRS)

    Bolcar, Matthew; Smith, J. Scott; Aronstein, David

    2012-01-01

    This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.

  16. Understanding Differences between Search Requests in XML Element Retrieval

    E-print Network

    Kamps, Jaap

    and Retrieval]: H.3.1 Content Analysis and Indexing; H.3.3 Information Search and Retrieval; H.3.4 Systems of Library and Information Science, Copenhagen, Denmark ABSTRACT XML retrieval, a very active branch of IR XML element retrieval in action: What do users expect from an element retrieval system? What kind

  17. Sound and Complete Relevance Assessment for XML Retrieval Benjamin Piwowarski

    E-print Network

    Lalmas, Mounia

    , University of London London, United Kingdom Abstract In information retrieval research, comparing retrieval of whole documents) in response to a user query [1; 2; 3; 16]. This means that XML retrieval systems must a single document. Evaluating the effectiveness of XML retrieval systems requires a test collection where

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

    ERIC Educational Resources Information Center

    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)

  19. Integrating Network-Bound XML Data Zachary G. Ives

    E-print Network

    Integrating Network-Bound XML Data Zachary G. Ives Alon Y. Halevy Daniel S. Weld ¡ zives, alon, weld¢ @cs.washington.edu University of Washington Seattle, WA USA Abstract Although XML was originally not as a format for "materialized" or document data, but as a "wire protocol" for exchanging data through virtual

  20. A Typed Text Retrieval Query Language for XML Documents.

    ERIC Educational Resources Information Center

    Colazzo, Dario; Sartiani, Carlo; Albano, Antonio; Manghi, Paolo; Ghelli, Giorgio; Lini, Luca; Paoli, Michele

    2002-01-01

    Discussion of XML focuses on a description of Tequyla-TX, a typed text retrieval query language for XML documents that can search on both content and structures. Highlights include motivations; numerous examples; word-based and char-based searches; tag-dependent full-text searches; text normalization; query algebra; data models and term language;…

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

    ERIC Educational Resources Information Center

    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)

  2. Adding XML to the MIS Curriculum: Lessons from the Classroom

    ERIC Educational Resources Information Center

    Wagner, William P.; Pant, Vik; Hilken, Ralph

    2008-01-01

    eXtensible Markup Language (XML) is a new technology that is currently being extolled by many industry experts and software vendors. Potentially it represents a platform independent language for sharing information over networks in a way that is much more seamless than with previous technologies. It is extensible in that XML serves as a "meta"…

  3. Data Quality of Native XML Databases in the Healthcare Domain

    E-print Network

    North, Siobhán

    are not foolproof. This report reviews work on data quality in both database and management research areas.0 [Database Management]: Security, integrity and protection; K.6.4 [System Management]: Quality assurance; J.3Data Quality of Native XML Databases in the Healthcare Domain Henry Addico As XML data is being

  4. The Long Road to JATS Paul Donohoe Senior XML Developer

    E-print Network

    Kaski, Samuel

    ...", "titleXml": "The toolbox of plant hormone reporters.", "hasImageAsset": {"id #12;Core Ontology #12;Content Hub { "article": { "id": "nplants20151", "titleXml": "Plant hormones: On-the-spot reporting", ... "hasContributor": { "id": "rainer-waadt-nplants20151

  5. Data Manipulation in an XML-Based Digital Image Library

    ERIC Educational Resources Information Center

    Chang, Naicheng

    2005-01-01

    Purpose: To help to clarify the role of XML tools and standards in supporting transition and migration towards a fully XML-based environment for managing access to information. Design/methodology/approach: The Ching Digital Image Library, built on a three-tier architecture, is used as a source of examples to illustrate a number of methods of data…

  6. Adaptive Hypermedia Educational System Based on XML Technologies.

    ERIC Educational Resources Information Center

    Baek, Yeongtae; Wang, Changjong; Lee, Sehoon

    This paper proposes an adaptive hypermedia educational system using XML technologies, such as XML, XSL, XSLT, and XLink. Adaptive systems are capable of altering the presentation of the content of the hypermedia on the basis of a dynamic understanding of the individual user. The user profile can be collected in a user model, while the knowledge…

  7. Does Being Technical Matter? XML, Single Source, and Technical Communication.

    ERIC Educational Resources Information Center

    Sapienza, Filipp

    2002-01-01

    Describes XML, a recent Web design language that will enable technical communicators to produce documentation that can reuse information and present it across multiple types of media for diverse audiences. Argues that XML requires more interdisciplinary approaches toward the teaching and research of technical communication, particularly with…

  8. StatiX: Making XML Count Juliana Freire

    E-print Network

    Freire, Juliana

    X is a novel XML Schema-aware statistics framework that exploits the structure derived by regular expressions and scalability of our approach and show an application of these statistics to cost-based XML stor- age design. 1 with quick feedback about their queries, to cost-based storage design and query optimization. Stati

  9. XML to Relational Conversion using Theory of Regular Tree Grammars

    E-print Network

    Lee, Dongwon

    be represented us- ing the features provided by XML, such as elements, attributes, parent-child relationships, ID in a given XML schema can be mapped to entities and relationships. For example, a parent-child relationship expressed using in- clusion dependencies in the relational model as parent- child relationships, as ID

  10. XML Database Engines Rakesh Malhotra and John Miller

    E-print Network

    Miller, John A.

    Abstract XML Database Engines Rakesh Malhotra and John Miller Department of Computer Science University of Georgia Athens, GA 30602 XML databases lie at the conjunction of two disparate themes and have to address issues related to both. On one hand there is the traditional database field of structured data

  11. LCA-based Selection for XML Document Collections Georgia Koloniari

    E-print Network

    Pitoura, Evaggelia

    LCA-based Selection for XML Document Collections Georgia Koloniari Department of Computer Science in the collection to the query. We consider keyword queries and support Lowest Common Ancestor (LCA) semantics of the LCA of those nodes in the XML docu- ment that contain the query keywords. To avoid evaluating queries

  12. Data Mining-based Fragmentation of XML Data Warehouses

    E-print Network

    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.

  13. QIS-XML: A metadata specification for Quantum Information Science

    E-print Network

    Pascal Heus; Richard Gomez

    2007-12-23

    While Quantum Information Science (QIS) is still in its infancy, the ability for quantum based hardware or computers to communicate and integrate with their classical counterparts will be a major requirement towards their success. Little attention however has been paid to this aspect of QIS. To manage and exchange information between systems, today's classic Information Technology (IT) commonly uses the eXtensible Markup Language (XML) and its related tools. XML is composed of numerous specifications related to various fields of expertise. No such global specification however has been defined for quantum computers. QIS-XML is a proposed XML metadata specification for the description of fundamental components of QIS (gates & circuits) and a platform for the development of a hardware independent low level pseudo-code for quantum algorithms. This paper lays out the general characteristics of the QIS-XML specification and outlines practical applications through prototype use cases.

  14. Concrete uses of XML in software development and data analysis

    E-print Network

    S. Patton

    2003-06-11

    XML is now becoming an industry standard for data description and exchange. Despite this there are still some questions about how or if this technology can be useful in High Energy Physics software development and data analysis. This paper aims to answer these questions by demonstrating how XML is used in the IceCube software development system, data handling and analysis. It does this by first surveying the concepts and tools that make up the XML technology. It then goes on to discuss concrete examples of how these concepts and tools are used to speed up software development in IceCube and what are the benefits of using XML in IceCube's data handling and analysis chain. The overall aim of this paper it to show that XML does have many benefits to bring High Energy Physics software development and data analysis.

  15. A Simple XML Producer-Consumer Protocol

    NASA Technical Reports Server (NTRS)

    Smith, Warren; Gunter, Dan; Quesnel, Darcy; Biegel, Bryan (Technical Monitor)

    2001-01-01

    There are many different projects from government, academia, and industry that provide services for delivering events in distributed environments. The problem with these event services is that they are not general enough to support all uses and they speak different protocols so that they cannot interoperate. We require such interoperability when we, for example, wish to analyze the performance of an application in a distributed environment. Such an analysis might require performance information from the application, computer systems, networks, and scientific instruments. In this work we propose and evaluate a standard XML-based protocol for the transmission of events in distributed systems. One recent trend in government and academic research is the development and deployment of computational grids. Computational grids are large-scale distributed systems that typically consist of high-performance compute, storage, and networking resources. Examples of such computational grids are the DOE Science Grid, the NASA Information Power Grid (IPG), and the NSF Partnerships for Advanced Computing Infrastructure (PACIs). The major effort to deploy these grids is in the area of developing the software services to allow users to execute applications on these large and diverse sets of resources. These services include security, execution of remote applications, managing remote data, access to information about resources and services, and so on. There are several toolkits for providing these services such as Globus, Legion, and Condor. As part of these efforts to develop computational grids, the Global Grid Forum is working to standardize the protocols and APIs used by various grid services. This standardization will allow interoperability between the client and server software of the toolkits that are providing the grid services. The goal of the Performance Working Group of the Grid Forum is to standardize protocols and representations related to the storage and distribution of performance data. These standard protocols and representations must support tasks such as profiling parallel applications, monitoring the status of computers and networks, and monitoring the performance of services provided by a computational grid. This paper describes a proposed protocol and data representation for the exchange of events in a distributed system. The protocol exchanges messages formatted in XML and it can be layered atop any low-level communication protocol such as TCP or UDP Further, we describe Java and C++ implementations of this protocol and discuss their performance. The next section will provide some further background information. Section 3 describes the main communication patterns of our protocol. Section 4 describes how we represent events and related information using XML. Section 5 describes our protocol and Section 6 discusses the performance of two implementations of the protocol. Finally, an appendix provides the XML Schema definition of our protocol and event information.

  16. A Recursive Method for Calculating Certain Partition Functions.

    ERIC Educational Resources Information Center

    Woodrum, Luther; And Others

    1978-01-01

    Describes a simple recursive method for calculating the partition function and average energy of a system consisting of N electrons and L energy levels. Also, presents an efficient APL computer program to utilize the recursion relation. (Author/GA)

  17. A Study of XML in the Library Science Curriculum in Taiwan and South East Asia

    ERIC Educational Resources Information Center

    Chang, Naicheng; Huang, Yuhui; Hopkinson, Alan

    2011-01-01

    This paper aims to investigate the current XML-related courses available in 96 LIS schools in South East Asia and Taiwan's 9 LIS schools. Also, this study investigates the linkage of library school graduates in Taiwan who took different levels of XML-related education (that is XML arranged as an individual course or XML arranged as a section unit…

  18. Using XML to Separate Content from the Presentation Software in eLearning Applications

    ERIC Educational Resources Information Center

    Merrill, Paul F.

    2005-01-01

    This paper has shown how XML (extensible Markup Language) can be used to mark up content. Since XML documents, with meaningful tags, can be interpreted easily by humans as well as computers, they are ideal for the interchange of information. Because XML tags can be defined by an individual or organization, XML documents have proven useful in a…

  19. Limits of Recursive Triangle and Polygon Tunnels

    E-print Network

    Florentin Smarandache

    2010-06-01

    In this paper we present unsolved problems that involve infinite tunnels of recursive triangles or recursive polygons, either in a decreasing or in an increasing way. The "nedians or order i in a triangle" are generalized to "nedians of ratio r" and "nedians of angle {\\alpha}" or "nedians at angle {\\beta}", and afterwards one considers their corresponding "nedian triangles" and "nedian polygons". This tunneling idea came from physics. Further research would be to construct similar tunnel of 3-D solids (and generally tunnels of n-D solids).

  20. Recursive Implementations of the Consider Filter

    NASA Technical Reports Server (NTRS)

    Zanetti, Renato; DSouza, Chris

    2012-01-01

    One method to account for parameters errors in the Kalman filter is to consider their effect in the so-called Schmidt-Kalman filter. This work addresses issues that arise when implementing a consider Kalman filter as a real-time, recursive algorithm. A favorite implementation of the Kalman filter as an onboard navigation subsystem is the UDU formulation. A new way to implement a UDU consider filter is proposed. The non-optimality of the recursive consider filter is also analyzed, and a modified algorithm is proposed to overcome this limitation.

  1. A recursive Meat-axe algorithm Stephen P. Glasby

    E-print Network

    Glasby, Stephen

    A recursive Meat-axe algorithm Stephen P. Glasby Central Washington University November 2009 S. P. Glasby (CWU) A recursive Meat-axe algorithm 1 / 17 #12;Overview 1 Four Meat-axe problems: Invar, Cent, Iso, Subfield 2 Non-recursive Meat-axe algorithm 3 Changing field: scaling up F E; scaling down E F 4

  2. A Survey on Teaching and Learning Recursive Programming

    ERIC Educational Resources Information Center

    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…

  3. The diagonalization method in quantum recursion theory Karl Svozil

    E-print Network

    Svozil, Karl

    The diagonalization method in quantum recursion theory Karl Svozil Institute for Theoretical, the diagonalization method of classical recursion theory has to be modified. Quantum diagonalization involves unitary information, quantum recursion theory, halting problem 1 #12;INTRODUCTION The reasoning in formal logic

  4. Exponential tail bounds for max-recursive sequences

    E-print Network

    Rüschendorf, Ludger

    Exponential tail bounds for max-recursive sequences Ludger R¨uschendorf and Eva-Maria Schopp University of Freiburg Abstract Exponential tail bounds are derived for solutions of max-recursive equa a characterization of exponential tail bounds due to Kasahara (1978). 1 Introduction Stochastic recursive equations

  5. IX-Cubes: Iceberg Cubes for Data Warehousing and OLAP on XML Data

    E-print Network

    Fu, Ada Waichee

    IX-Cubes: Iceberg Cubes for Data Warehousing and OLAP on XML Data Fianny Ming-fei Jian The Chinese is not available. In this paper, we introduce the IX-cube (Iceberg XML cube) over XML data to tackle the problem of supporting OLAP on XML data and develop an IX-Cube approach: we construct an iceberg data cube on an XML data

  6. A Data Parallel Algorithm for XML DOM Parsing

    NASA Astrophysics Data System (ADS)

    Shah, Bhavik; Rao, Praveen R.; Moon, Bongki; Rajagopalan, Mohan

    The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation performed on an XML document for it to be accessed and manipulated. This operation is known to cause performance bottlenecks in applications and systems that process large volumes of XML data. We believe that parallelism is a natural way to boost performance. Leveraging multicore processors can offer a cost-effective solution, because future multicore processors will support hundreds of cores, and will offer a high degree of parallelism in hardware. We propose a data parallel algorithm called ParDOM for XML DOM parsing, that builds an in-memory tree structure for an XML document. ParDOM has two phases. In the first phase, an XML document is partitioned into chunks and parsed in parallel. In the second phase, partial DOM node tree structures created during the first phase, are linked together (in parallel) to build a complete DOM node tree. ParDOM offers fine-grained parallelism by adopting a flexible chunking scheme - each chunk can contain an arbitrary number of start and end XML tags that are not necessarily matched. ParDOM can be conveniently implemented using a data parallel programming model that supports map and sort operations. Through empirical evaluation, we show that ParDOM yields better scalability than PXP [23] - a recently proposed parallel DOM parsing algorithm - on commodity multicore processors. Furthermore, ParDOM can process a wide-variety of XML datasets with complex structures which PXP fails to parse.

  7. TORTIS (Toddler's Own Recursive Turtle Interpreter System).

    ERIC Educational Resources Information Center

    Perlman, Radia

    TORTIS (Toddler's Own Recursive Turtle Interpreter System) is a device which can be used to study or nurture the cognitive development of preschool children. The device consists of a "turtle" which the child can control by use of buttons on a control panel. The "turtle" can be made to move in prescribed directions, to take a given number of paces,…

  8. Recursive Sparse, Spatiotemporal Coding Thomas Dean

    E-print Network

    Cortes, Corinna

    Recursive Sparse, Spatiotemporal Coding Thomas Dean Google Inc. tld@google.com Greg Corrado Stanford University gcorrado@stanford.edu Rich Washington Google Inc. rwashington@google.com Abstract We greater success using L1 regularized regression in a variation on Olshausen and Field's original SPARSENET

  9. Recursive inversion of externally defined linear systems

    NASA Technical Reports Server (NTRS)

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

    1988-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 problems of system identification and compensation.

  10. Recursive splicing in long vertebrate genes

    PubMed Central

    Blazquez, Lorea; Faro, Ana; Haberman, Nejc; Briese, Michael; Trabzuni, Daniah; Ryten, Mina; Weale, Michael E; Hardy, John; Modic, Miha; Curk, Tomaž; Wilson, Stephen W; Plagnol, Vincent; Ule, Jernej

    2015-01-01

    It is generally believed that splicing removes introns as single units from pre-mRNA transcripts. However, some long D. melanogaster introns contain a cryptic site, called a recursive splice site (RS-site), that enables a multi-step process of intron removal termed recursive splicing1,2. The extent to which recursive splicing occurs in other species and its mechanistic basis remain unclear. Here we identify highly conserved RS-sites in genes expressed in the mammalian brain that encode proteins functioning in neuronal development. Moreover, the RS-sites are found in some of the longest introns across vertebrates. We find that vertebrate recursive splicing requires initial definition of a “RS-exon” that follows the RS-site. The RS-exon is then excluded from the dominant mRNA isoform due to competition with a reconstituted 5? splice site formed at the RS-site after the first splicing step. Conversely, the RS-exon is included when preceded by cryptic exons or promoters that are prevalent in long introns, but which fail to reconstitute an efficient 5? splice site. Most RS-exons contain a premature stop codon such that their inclusion may decrease mRNA stability. Thus, by establishing a binary splicing switch, RS-sites demarcate different mRNA isoforms emerging from long genes by coupling inclusion of cryptic elements with RS-exons. PMID:25970246

  11. Ordinal Recursion Theory C. T. Chong

    E-print Network

    the basic concepts and techniques of this theory, putting particular emphasis on the main new ideas-admissible relative to X ? The reader will notice that Jensen's work on the fine structure theory of G a basic unity among various fields in recursion theory and fine structure theory. We touch briefly

  12. RECURSIVE PARAMETER ESTIMATION OF HYDROLOGIC MODELS

    EPA Science Inventory

    Proposed is a nonlinear filtering approach to recursive parameter estimation of conceptual watershed response models in state-space form. he conceptual model state is augmented by the vector of free parameters which are to be estimated from input-output data, and the extended Kal...

  13. From Relations to XML: Cleaning, Integrating and Securing Data 

    E-print Network

    Jia, Xibei

    2008-01-01

    While relational databases are still the preferred approach for storing data, XML is emerging as the primary standard for representing and exchanging data. Consequently, it has been increasingly important to provide a ...

  14. Integrating Natural Language Generation with XML Web Technology

    E-print Network

    transformation processors, an XML database, a Java servlet engine, the Cocoon web publishing framework and a Java be embedded in Java servlets and executed in a servlet engine such as Tomcat (Apache Jakarta Project, 2003

  15. A Lightweight Model Driven Development Process based on XML Technology

    E-print Network

    , 2009 Research Institute for Symbolic Computation (RISC), Johannes Kepler University, Linz, Aus- tria and a supporting XML-based MDD tool that we have developed and used in a real-life project. We explain them

  16. Extracting Relations from XML Documents Eugene Agichtein1

    E-print Network

    Agichtein, Eugene

    Extracting Relations from XML Documents Eugene Agichtein1 , C. T. Howard Ho2 , Vanja Josifovski2 , and Joerg Gerhardt2 1 Columbia University, New York, NY, USA eugene@cs.columbia.edu 2 IBM Almaden, San Jose

  17. XML DTD and Schemas for HDF-EOS

    NASA Technical Reports Server (NTRS)

    Ullman, Richard; Yang, Jingli

    2008-01-01

    An Extensible Markup Language (XML) document type definition (DTD) standard for the structure and contents of HDF-EOS files and their contents, and an equivalent standard in the form of schemas, have been developed.

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

    NASA Technical Reports Server (NTRS)

    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.

  19. 5Storage and Access Control Policies for XML George Pallis

    E-print Network

    Pallis, George

    1 5Storage and Access Control Policies for XML Documents George Pallis Aristotle University of Thessaloniki, Greece KonstantinaStoupa Aristotle University of Thessaloniki, Greece AthenaVakali Aristotle

  20. Structural Query Optimization in Native XML Databases: A Hybrid Approach

    NASA Astrophysics Data System (ADS)

    Haw, Su-Cheng; Lee, Chien-Sing

    As XML (eXtensible Mark-up Language) is gaining its popularity in data exchange over the Web, querying XML data has become an important issue to be addressed. In native XML databases (NXD), XML documents are usually modeled as trees and XML queries are typically specified in path expression. The primitive structural relationships are Parent-Child (P-C), Ancestor-Descendant (A-D), sibling and ordered query. Thus, a suitable and compact labeling scheme is crucial to identify these relationships and henceforth to process the query efficiently. We propose a novel labeling scheme consisting of < self-level:parent> to support all these relationships efficiently. Besides, we adopt the decomposition-matching-merging approach for structural query processing and propose a hybrid query optimization technique, TwigINLAB to process and optimize the twig query evaluation. Experimental results indicate that TwigINLAB can process all types of XML queries 15% better than the TwigStack algorithm in terms of execution time in most test cases.

  1. Path Query Processing in Large-Scale XML Databases

    NASA Astrophysics Data System (ADS)

    Haw, Su-Cheng; Radha Krishna Rao, G. S. V.

    With the ever-increasing popularity of XML (e-Xtensible Markup Language) as data representation and exchange on the Internet, querying XML data has become an important issue to be address. In Native XML Database (NXD), XML documents are usually modeled as trees and XML queries are typically specified in path expression. In path expression, the primitive structural relationships are Parent-Child (P-C) and Ancestor-Descendant (A-D). Thus, finding all occurrences of these relationships is crucial for XML query processing. Current methods for query processing on NXD usually employ either sequential traversing of tree-structured model or a decomposition-matching-merging processes. We adopt the later approach and propose a novel hybrid query optimization technique, INLAB comprising both indexing and labeling technologies. Furthermore, we also propose several algorithms to create INLAB encoding and analyze the path query. We implemented our technique and present performance results over several benchmarking datasets, which prove the viability of our approach.

  2. Specifics on a XML Data Format for Scientific Data

    NASA Astrophysics Data System (ADS)

    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

  3. The remarkable capabilities of recursive relations

    NASA Astrophysics Data System (ADS)

    Ignatovich, V. K.

    1989-10-01

    The recursive relations method is presented. To illustrate its capability a new way is presented to solve the one-dimensional Schrödinger equation with a stepwise or any periodic potential (semi-infinite or finite). The method is shown to be also applicable to other physical problems, for instance, to molecular gas diffusion in linear and branched guides and to the scattering of a quantum mechanical particle on a spherically symmetric nut-shell potential.

  4. 2004 IEEEWorkshop on Machine Learning for Signal Processing RECURSIVE PRINCIPALCOMPONENTS

    E-print Network

    Slatton, Clint

    2004 IEEEWorkshop on Machine Learning for Signal Processing RECURSIVE PRINCIPALCOMPONENTS ANALYSIS their true values. The performance is compared with traditional methods like Sanger and APEX algorithm

  5. Citing geospatial feature inventories with XML manifests

    NASA Astrophysics Data System (ADS)

    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.

  6. Detecting Changes on Unordered XML Documents Using Relational Databases: A Schema-Conscious Approach

    E-print Network

    Bhowmick, Sourav S.

    . In unordered XML, the parent-child relationship is significant, while the left-to-right order among siblings. In an ordered XML, both the parent-child re- Permission to make digital or hard copies of all or part

  7. A Programming Methodology for Designing Block Recursive Algorithms on Various Computer Networks

    E-print Network

    Chung, Yeh-Ching

    A Programming Methodology for Designing Block Recursive Algorithms on Various Computer Networks as the framework of a programming methodology for designing block recursive algorithms on various computer networks formulas using induction. Keywords: programming methodology, tensor product, block recursive algorithm

  8. Realization Of Algebraic Processor For XML Documents Processing

    SciTech Connect

    Georgiev, Bozhidar; Georgieva, Adriana

    2010-10-25

    In this paper, are presented some possibilities concerning the implementation of an algebraic method for XML hierarchical data processing which makes faster the XML search mechanism. Here is offered a different point of view for creation of advanced algebraic processor (with all necessary software tools and programming modules respectively). Therefore, this nontraditional approach for fast XML navigation with the presented algebraic processor may help to build an easier user-friendly interface provided XML transformations, which can avoid the difficulties in the complicated language constructions of XSL, XSLT and XPath. This approach allows comparatively simple search of XML hierarchical data by means of the following types of functions: specification functions and so named build-in functions. The choice of programming language Java may appear strange at first, but it isn't when you consider that the applications can run on different kinds of computers. The specific search mechanism based on the linear algebra theory is faster in comparison with MSXML parsers (on the basis of the developed examples with about 30%). Actually, there exists the possibility for creating new software tools based on the linear algebra theory, which cover the whole navigation and search techniques characterizing XSLT/XPath. The proposed method is able to replace more complicated operations in other SOA components.

  9. The SGML Standardization Framework and the Introduction of XML

    PubMed Central

    Grütter, Rolf

    2000-01-01

    Extensible Markup Language (XML) is on its way to becoming a global standard for the representation, exchange, and presentation of information on the World Wide Web (WWW). More than that, XML is creating a standardization framework, in terms of an open network of meta-standards and mediators that allows for the definition of further conventions and agreements in specific business domains. Such an approach is particularly needed in the healthcare domain; XML promises to especially suit the particularities of patient records and their lifelong storage, retrieval, and exchange. At a time when change rather than steadiness is becoming the faithful feature of our society, standardization frameworks which support a diversified growth of specifications that are appropriate to the actual needs of the users are becoming more and more important; and efforts should be made to encourage this new attempt at standardization to grow in a fruitful direction. Thus, the introduction of XML reflects a standardization process which is neither exclusively based on an acknowledged standardization authority, nor a pure market standard. Instead, a consortium of companies, academic institutions, and public bodies has agreed on a common recommendation based on an existing standardization framework. The consortium's process of agreeing to a standardization framework will doubtlessly be successful in the case of XML, and it is suggested that it should be considered as a generic model for standardization processes in the future. PMID:11720931

  10. 5. Introduction to SGML and XML 5-1 Chapter 5: Introduction to

    E-print Network

    Brass, Stefan

    (XML) 1.0, 1998. [http://www.w3.org/TR/REC-xml] See also: [http://www.w3.org/XML]. Stefan Brass syntax, e.g. in the HTML specifica- tion. Stefan Brass: Grundlagen des World Wide Web Universit¨at Halle. DOCTYPE, XML Declaration Stefan Brass: Grundlagen des World Wide Web Universit¨at Halle, 2006 #12

  11. 5. Introduction to SGML and XML 5-1 Chapter 5: Introduction to

    E-print Network

    Brass, Stefan

    (XML) 1.0, 1998. [http://www.w3.org/TR/REC-xml] See also: [http://www.w3.org/XML]. Stefan Brass syntax, e.g. in the HTML specifica- tion. Stefan Brass: Grundlagen des World Wide Web Universit¨at Halle. DOCTYPE, XML Declaration Stefan Brass: Grundlagen des World Wide Web Universit¨at Halle, 2003 #12

  12. 5. Introduction to SGML and XML 5-1 Chapter 5: Introduction to

    E-print Network

    Brass, Stefan

    (XML) 1.0, 1998. [http://www.w3.org/TR/REC-xml] See also: [http://www.w3.org/XML]. Stefan Brass syntax, e.g. in the HTML specifica- tion. Stefan Brass: Grundlagen des World Wide Web Universit¨at Halle. DOCTYPE, XML Declaration Stefan Brass: Grundlagen des World Wide Web Universit¨at Halle, 2004 #12

  13. 5. Introduction to SGML and XML 5-1 Chapter 5: Introduction to

    E-print Network

    Brass, Stefan

    (XML) 1.0, 1998. [http://www.w3.org/TR/REC-xml] See also: [http://www.w3.org/XML]. Stefan Brass syntax, e.g. in the HTML specifica- tion. Stefan Brass: Grundlagen des World Wide Web Universit¨at Halle. DOCTYPE, XML Declaration Stefan Brass: Grundlagen des World Wide Web Universit¨at Halle, 2011 #12

  14. IMAX: Incremental Maintenance of Schema-based XML Statistics Maya Ramanath1

    E-print Network

    Freire, Juliana

    IMAX: Incremental Maintenance of Schema-based XML Statistics Maya Ramanath1 Lingzhi Zhang2 Juliana of statistics on the repository. However, in practice, many XML-based applications are dynamic and involve. Several techniques for estimating XML query cardi- nalities have appeared in the recent literature

  15. Under consideration for publication in J. Functional Programming 1 A Typed Representation for HTML and XML

    E-print Network

    Thiemann, Peter

    Under consideration for publication in J. Functional Programming 1 A Typed Representation for HTML@informatik.uni-freiburg.de) Abstract We de#12;ne a family of embedded domain speci#12;c languages for generating HTML and XML documents to create and modify HTML/XML elements. The resulting HTML/XML code is guaranteed to be well

  16. An Efficient XML Node Identification and Indexing Scheme Jan-Marco Bremer and Michael Gertz

    E-print Network

    Gertz, Michael

    An Efficient XML Node Identification and Indexing Scheme Jan-Marco Bremer and Michael Gertz all XML query languages. Current index structures that sup- port an efficient evaluation in existing approaches to XML indexing. 1. INTRODUCTION Path and tree pattern matching plays a crucial role

  17. TEI P5 as an XML Standard for Treebank Encoding Adam Przepirkowski

    E-print Network

    such candidate standards, including TIGER-XML, SynAF and PAULA. 1 Introduction The need for text encoding at four standards: 1) the very specific and commonly used TIGER-XML schema, 2) SynAF, a more general model derived from TIGER-XML, currently under devel- opment as an ISO standard, 3) PAULA, a schema

  18. 77 FR 46986 - Revisions to Electric Quarterly Report Filing Process; Availability of Draft XML Schema

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-08-07

    ...Report Filing Process; Availability of Draft XML Schema AGENCY: Federal Energy Regulatory...www.ferc.gov) a draft of the XML schema that is being developed for use in...Section below for details. DATES: The draft XML Schema is now available at the links...

  19. Xregion: A New Approach to Storing XML Data in Relational Databases

    E-print Network

    Yuan, Li-Yan

    the parent-child relationships among nodes in the XML tree as tuples in relational tables, with each tuple structure of an XML document. Second, only parent-child binary re- lationships are stored in relation structure of an XML document is flattened to binary relationships scattered in the database tables. Although

  20. XML: A Language To Manage the World Wide Web. ERIC Digest.

    ERIC Educational Resources Information Center

    Davis-Tanous, Jennifer R.

    This digest provides an overview of XML (Extensible Markup Language), a markup language used to construct World Wide Web pages. Topics addressed include: (1) definition of a markup language, including comparison of XML with SGML (Standard Generalized Markup Language) and HTML (HyperText Markup Language); (2) how XML works, including sample tags,…

  1. Applying Analogical Reasoning Techniques for Teaching XML Document Querying Skills in Database Classes

    ERIC Educational Resources Information Center

    Mitri, Michel

    2012-01-01

    XML has become the most ubiquitous format for exchange of data between applications running on the Internet. Most Web Services provide their information to clients in the form of XML. The ability to process complex XML documents in order to extract relevant information is becoming as important a skill for IS students to master as querying…

  2. XML Schema Based Approach for Website Development of Indian Heritage Texts

    E-print Network

    1 XML Schema Based Approach for Website Development of Indian Heritage Texts A Report Submitted;2 Certificate Certified that the work contained in the report entitled "XML Schema Based Approach for Website submitted elsewhere for a degree. Dr. H. Karnick April, 2002 #12;3 XML Schema Based Approach for Website

  3. Recursive formula to compute Zernike radial polynomials.

    PubMed

    Honarvar Shakibaei, Barmak; Paramesran, Raveendran

    2013-07-15

    In optics, Zernike polynomials are widely used in testing, wavefront sensing, and aberration theory. This unique set of radial polynomials is orthogonal over the unit circle and finite on its boundary. This Letter presents a recursive formula to compute Zernike radial polynomials using a relationship between radial polynomials and Chebyshev polynomials of the second kind. Unlike the previous algorithms, the derived recurrence relation depends neither on the degree nor on the azimuthal order of the radial polynomials. This leads to a reduction in the computational complexity. PMID:23939089

  4. A short overview of the "Topological recursion"

    E-print Network

    B. Eynard

    2014-12-12

    This review is an extended version of the Seoul ICM 2014 proceedings.It is a short overview of the "topological recursion", a relation appearing in the asymptotic expansion of many integrable systems and in enumerative problems. We recall how computing large size asymptotics in random matrices, has allowed to discover some fascinating and ubiquitous geometric invariants. Specializations of this method recover many classical invariants, like Gromov--Witten invariants, or knot polynomials (Jones, HOMFLY,...). In this short review, we give some examples, give definitions, and review some properties and applications of the formalism.

  5. KAT: A Flexible XML-based Knowledge Authoring Environment

    PubMed Central

    Hulse, Nathan C.; Rocha, Roberto A.; Del Fiol, Guilherme; Bradshaw, Richard L.; Hanna, Timothy P.; Roemer, Lorrie K.

    2005-01-01

    As part of an enterprise effort to develop new clinical information systems at Intermountain Health Care, the authors have built a knowledge authoring tool that facilitates the development and refinement of medical knowledge content. At present, users of the application can compose order sets and an assortment of other structured clinical knowledge documents based on XML schemas. The flexible nature of the application allows the immediate authoring of new types of documents once an appropriate XML schema and accompanying Web form have been developed and stored in a shared repository. The need for a knowledge acquisition tool stems largely from the desire for medical practitioners to be able to write their own content for use within clinical applications. We hypothesize that medical knowledge content for clinical use can be successfully created and maintained through XML-based document frameworks containing structured and coded knowledge. PMID:15802477

  6. KAT: a flexible XML-based knowledge authoring environment.

    PubMed

    Hulse, Nathan C; Rocha, Roberto A; Del Fiol, Guilherme; Bradshaw, Richard L; Hanna, Timothy P; Roemer, Lorrie K

    2005-01-01

    As part of an enterprise effort to develop new clinical information systems at Intermountain Health Care, the authors have built a knowledge authoring tool that facilitates the development and refinement of medical knowledge content. At present, users of the application can compose order sets and an assortment of other structured clinical knowledge documents based on XML schemas. The flexible nature of the application allows the immediate authoring of new types of documents once an appropriate XML schema and accompanying Web form have been developed and stored in a shared repository. The need for a knowledge acquisition tool stems largely from the desire for medical practitioners to be able to write their own content for use within clinical applications. We hypothesize that medical knowledge content for clinical use can be successfully created and maintained through XML-based document frameworks containing structured and coded knowledge. PMID:15802477

  7. Development Life Cycle and Tools for XML Content Models

    SciTech Connect

    Kulvatunyou, Boonserm; Morris, Katherine; Buhwan, Jeong; Goyal, Puja

    2004-11-01

    Many integration projects today rely on shared semantic models based on standards represented using Extensible Mark up Language (XML) technologies. Shared semantic models typically evolve and require maintenance. In addition, to promote interoperability and reduce integration costs, the shared semantics should be reused as much as possible. Semantic components must be consistent and valid in terms of agreed upon standards and guidelines. In this paper, we describe an activity model for creation, use, and maintenance of a shared semantic model that is coherent and supports efficient enterprise integration. We then use this activity model to frame our research and the development of tools to support those activities. We provide overviews of these tools primarily in the context of the W3C XML Schema. At the present, we focus our work on the W3C XML Schema as the representation of choice, due to its extensive adoption by industry.

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

    NASA Astrophysics Data System (ADS)

    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.

  9. Automatic Generation of OWL Ontology from XML Data Source

    E-print Network

    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.

  10. Recursive Frame Analysis: A Practitioner's Tool for Mapping Therapeutic Conversation

    ERIC Educational Resources Information Center

    Keeney, Hillary; Keeney, Bradford; Chenail, Ronald J.

    2012-01-01

    Recursive frame analysis (RFA), both a practical therapeutic tool and an advanced qualitative research method that maps the structure of therapeutic conversation, is introduced with a clinical case vignette. We present and illustrate a means of mapping metaphorical themes that contextualize the performance taking place in the room, recursively

  11. Drawing fractal plants with recursive functions ECS 175 Spring 2012

    E-print Network

    California at Davis, University of

    Drawing fractal plants with recursive functions ECS 175 Spring 2012 These notes describe a version of L-systems, a recursive language used to describe plant structures. L-systems were introduced and Prezemyslaw Prusinkiewicz (know to everyone as Dr. P), The Algorithmic Beauty of Plants. 1 Fractals We can

  12. Parallel implementation of recursive spectral bisection on the Connection

    E-print Network

    Johnsson, S. Lennart

    To appear in Proceedings of Parallel CFD '93. #12; Parallel implementation of recursive spectral bisection of the Parallel CFD'93 conference 1. INTRODUCTION The recursive spectral bisection (RSB) algorithm was proposed by Pothen et al. [1] as the basis for computing small vertex separators for sparse matrices. Simon [2

  13. Recursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type

    E-print Network

    Kågström, Bo

    . In Table 1, a summary of the periodic matrix equations considered is displayed. The classification in oneRecursive Blocked Algorithms for Solving Periodic Triangular Sylvester-Type Matrix Equations Robert to solving periodic Sylvester-type matrix equations. Successive recursive splittings are performed on 3

  14. Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks

    E-print Network

    Bender, Ed

    Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks Edward A. Bender, 1997 Accepted: December 9, 1997 Abstract Let and be a partition of f1;:::;ng into two blocks. A merging of recursively constructed" merging networks and characterize those with delay dlog2 ne the best possible delay

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

    ERIC Educational Resources Information Center

    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,…

  16. A New Spectrum of Recursive Models Using An Amalgamation Construction

    E-print Network

    Andrews, Uri

    A New Spectrum of Recursive Models Using An Amalgamation Construction Uri Andrews September 1, 2010 presentable models are the prime and saturated models, adds a new spectrum to the list of known possible recursively presentable model is saturated, gives the second non-trivial example of a spectrum produced

  17. Extended Kalman Filter Using a Kernel Recursive Least Squares Observer

    E-print Network

    Slatton, Clint

    Extended Kalman Filter Using a Kernel Recursive Least Squares Observer Pingping Zhu, Badong Chen estimation problem combining the extended Kalman filter (EKF) with a kernel recursive least squares (KRLS Kalman filter, EKF and KRLS algorithms. Results demonstrate that the performance of the EKF

  18. XML-BSPM: an XML format for storing Body Surface Potential Map recordings

    PubMed Central

    2010-01-01

    Background The Body Surface Potential Map (BSPM) is an electrocardiographic method, for recording and displaying the electrical activity of the heart, from a spatial perspective. The BSPM has been deemed more accurate for assessing certain cardiac pathologies when compared to the 12-lead ECG. Nevertheless, the 12-lead ECG remains the most popular ECG acquisition method for non-invasively assessing the electrical activity of the heart. Although data from the 12-lead ECG can be stored and shared using open formats such as SCP-ECG, no open formats currently exist for storing and sharing the BSPM. As a result, an innovative format for storing BSPM datasets has been developed within this study. Methods The XML vocabulary was chosen for implementation, as opposed to binary for the purpose of human readability. There are currently no standards to dictate the number of electrodes and electrode positions for recording a BSPM. In fact, there are at least 11 different BSPM electrode configurations in use today. Therefore, in order to support these BSPM variants, the XML-BSPM format was made versatile. Hence, the format supports the storage of custom torso diagrams using SVG graphics. This diagram can then be used in a 2D coordinate system for retaining electrode positions. Results This XML-BSPM format has been successfully used to store the Kornreich-117 BSPM dataset and the Lux-192 BSPM dataset. The resulting file sizes were in the region of 277 kilobytes for each BSPM recording and can be deemed suitable for example, for use with any telemonitoring application. Moreover, there is potential for file sizes to be further reduced using basic compression algorithms, i.e. the deflate algorithm. Finally, these BSPM files have been parsed and visualised within a convenient time period using a web based BSPM viewer. Conclusions This format, if widely adopted could promote BSPM interoperability, knowledge sharing and data mining. This work could also be used to provide conceptual solutions and inspire existing formats such as DICOM, SCP-ECG and aECG to support the storage of BSPMs. In summary, this research provides initial ground work for creating a complete BSPM management system. PMID:20470392

  19. Towards rigorous analysis of the Levitov-Mirlin-Evers recursion

    E-print Network

    Yan. V. Fyodorov; Antti Kupiainen; Christian Webb

    2015-09-04

    This paper aims to develop a rigorous asymptotic analysis of an approximate renormalization group recursion for inverse participation ratios $P_q$ of critical powerlaw random band matrices. The recursion goes back to the work by Mirlin and Evers [37] and earlier works by Levitov [32, 33] and is aimed to describe the ensuing multifractality of the eigenvectors of such matrices. We point out both similarities and dissimilarities of LME recursion to those appearing in the theory of multiplicative cascades and branching random walks and show that the methods developed in those fields can be adapted to the present case. In particular the LME recursion is shown to exhibit a phase transition, which we expect is a freezing transition, where the role of temperature is played by the exponent $q$. However, the LME recursion has features that make its rigorous analysis considerably harder and we point out several open problems for further study

  20. A recursive algorithm for Zernike polynomials

    NASA Technical Reports Server (NTRS)

    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.

  1. Travaux Diriges de XML no Dans ce TP, toujours autour d'Ingrid Bergman, nous proposons une initiation a XSLT.

    E-print Network

    Blanc, Olivier

    Travaux Dirig´es de XML no 3 Dans ce TP, toujours autour d'Ingrid Bergman, nous proposons une://igm.univ-mlv.fr/~oblanc/XML/ 2 R´eorganisation On va r´eorganiser le document bergman.xml du pr´ec´edent TP `a l'aide d'une feuille de style XSLT, de mani`ere `a produire un nouveau document XML, bergman2.xml, qui contiendra les m

  2. Structural Features in XML Retrieval Speaker: Georgina Ramirez,

    E-print Network

    Baeza-Yates, Ricardo

    : The structure of documents provides a new source of information that retrieval systems may exploit to improveStructural Features in XML Retrieval Speaker: Georgina Ramirez, CWI, Nederlands Abstract retrieval. Our retrieval framework is based on the principle of polyrepresentation (Ingwersen,1994

  3. Link Detection in XML Documents: What about repeated links?

    E-print Network

    Kamps, Jaap

    Link Detection in XML Documents: What about repeated links? Junte Zhang University of Amsterdam kamps@uva.nl ABSTRACT Link detection is a special case of focused retrieval where potential links between documents have to be detected au- tomatically. The use case, as studied at INEX's Link the Wiki

  4. Personalization of XML Content Browsing Based on User Preferences

    ERIC Educational Resources Information Center

    Encelle, Benoit; Baptiste-Jessel, Nadine; Sedes, Florence

    2009-01-01

    Personalization of user interfaces for browsing content is a key concept to ensure content accessibility. In this direction, we introduce concepts that result in the generation of personalized multimodal user interfaces for browsing XML content. User requirements concerning the browsing of a specific content type can be specified by means of…

  5. Investigating the Use of Summarisation for Interactive XML Zoltan Szlavik

    E-print Network

    Tombros, Anastasios

    Investigating the Use of Summarisation for Interactive XML Retrieval Zolt´an Szl´avik Queen Mary University of London London, E1 4NS UK zolley@dcs.qmul.ac.uk Anastasios Tombros Queen Mary University of London London, E1 4NS UK tassos@dcs.qmul.ac.uk Mounia Lalmas Queen Mary University of London London, E1 4

  6. Theoretical Benchmarks of evaluation methodologies in XML Retrieval

    E-print Network

    Lalmas, Mounia

    Theoretical Benchmarks of evaluation methodologies in XML Retrieval Tobias Blanke Queen Mary College, University of London London, United Kingdom tobias@dcs.qmul.ac.uk Mounia Lalmas Queen Mary that specifically an- swer a query. This paper investigates the use of theoretical benchmarks to describe the INEX

  7. Boosting XML Filtering with a Scalable FPGA-based Architecture

    E-print Network

    Tsotras, Vassilis J.

    Boosting XML Filtering with a Scalable FPGA-based Architecture Abhishek Mitra, Marcos R. Vieira utilizes XPath query blocks on FPGA to solve the filtering problem. By utiliz- ing the high throughput that an FPGA provides for parallel pro- cessing, our approach achieves drastically better throughput than

  8. Management of XML Documents in an Integrated Digital Library

    E-print Network

    Smith, David A.

    Management of XML Documents in an Integrated Digital Library David A. Smith Anne Mahoney Jeffrey A in the context of a large, heterogeneous digital library. The system manages multiple DTDs through mappings from, heteroge- neous DL (digital library) is the necessity of managing documents with widely varying encodings

  9. Efficient Filtering of XML Documents for Selective Dissemination of

    E-print Network

    Ives, Zachary G.

    "NBA" will match all those news containing the keyword "NBA" Subscriber might also receive irrelevant information such as news with headline "Bill Gates love to watch NBA" Effectiveness of profiles is more model is based on XPath E.g. /sports/nba//newsIncoming documents are XML-encoded. Profiles are converted

  10. Castles Made of Sand: Building Sustainable Digitized Collections Using XML.

    ERIC Educational Resources Information Center

    Ragon, Bart

    2003-01-01

    Describes work at the University of Virginia library to digitize special collections. Discusses the use of XML (Extensible Markup Language); providing access to original source materials; DTD (Document Type Definition); TEI (Text Encoding Initiative); metadata; XSL (Extensible Style Language); and future possibilities. (LRW)

  11. Most Influential Paper Award An XML-Based Lightweight

    E-print Network

    Maletic, Jonathan I.

    marked using XML elements A document vs. data format #12;Code #include "rotate.hpp" // rotate three format, not as a data format/interchange (e.g., GXL) Preservation of all original source code text srcML Short paper on srcML format Session on benchmarks for fact extraction Talk of interchange

  12. Typechecking Top-Down XML Tranformations: Fixed Input or Output

    E-print Network

    Martens, Wim

    Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas Wim Martens a,, Frank-SIGMOD-SIGART Symposium on Principles of Database Systems, 2004. Corresponding author. Email addresses: wim.martens@udo.edu (Wim Martens), frank.neven@uhasselt.be (Frank Neven), marc.gyssens@uhasselt.be (Marc Gyssens). Preprint

  13. Extended XML Tree Pattern Matching: Theories and Algorithms

    E-print Network

    Lu, Jiaheng

    an XML tree pattern with parent-child (P-C) and ancestor-descendant (A-D) relationships, as it can-based algorithm to match binary structural relationship including parent- child (P-C) and ancestor-descendant (A, which may include P-C, A-D relationships, negation functions, wildcards, and order restriction. We

  14. On Reducing Redundancy and Improving Efficiency of XML Labeling Schemes

    E-print Network

    Lu, Jiaheng

    in XML query processing are ancestor-descendant (A-D), parent-child (P-C), sibling and ordering whether "5,6,3" is a child of this parent. The search of the parent needs a lot of parent-child {lichangq, lingtw, lujiahen, yutian}@comp.nus.edu.sg ABSTRACT The basic relationships to be determined

  15. A panoptic view of Databases, XML and IR David Hawking

    E-print Network

    de Vries, Arjen P.

    A panoptic view of Databases, XML and IR David Hawking CSIRO ICT Centre, Canberra, Australia david.hawking + Metadata/Structure ­ es.csiro.au/pubs/hawking_tr00b.pdf ­ Implement other components, "productize" Panoptic on databases and IR ­ "to be or not to be" ­ David.Hawking@csiro.au ­ "data* and *formation ret*" Metadata

  16. A Comparative Evaluation of XML Difference Algorithms with Genomic Data

    E-print Network

    Paton, Norman

    difference algorithms, namely X-Diff, JXyDiff and 3DM, can be used to identify and document genome changesA Comparative Evaluation of XML Difference Algorithms with Genomic Data Cornelia Hedeler and Norman, UK {chedeler,npaton}@cs.manchester.ac.uk Abstract. Genome sequence data and annotations are subject

  17. A Conversion Tool for Mathematical Expressions in Web XML Files.

    ERIC Educational Resources Information Center

    Ohtake, Nobuyuki; Kanahori, Toshihiro

    2003-01-01

    This article discusses the conversion of mathematical equations into Extensible Markup Language (XML) on the World Wide Web for individuals with visual impairments. A program is described that converts the presentation markup style to the content markup style in MathML to allow browsers to render mathematical expressions without other programs.…

  18. Generating Test Cases for XML-based Web Component

    E-print Network

    Offutt, Jeff

    -> test case exercises that part of the program code Computationally expensive if program is large Input Specification Model (ISM)Model (ISM) DTD structure S = (E, P, R), where: ­ E is a set of elements ­ P maps constraints defined: memberOf and lengthOf = a set of basic XML constraints expressed in LM ISM = (S, M

  19. TOWARD XML-BASED OFFICE DOCUMENTS (A BRIEF INTRODUCTION)

    E-print Network

    Polewczak, Jacek

    , that are vendor neutral, cross-platform interoperable, and non-binary (i.e., XML-based). Although the pressure modified · preserving format fidelity · offering cross-platform interoperability · supporting current word that encourage choice, interoperability, and vendor neutrality; · Accessible to the public; and · Kept under

  20. Improving the Virtual Learning Development Processes Using XML Standards.

    ERIC Educational Resources Information Center

    Suss, Kurt; Oberhofer, Thomas

    2002-01-01

    Suggests that distributed learning environments and content often lack a common basis for the exchange of learning materials, which can hinder or even delay innovation and delivery of learning technology. Standards for platforms and authoring may provide a way to improve interoperability and cooperative development. Provides an XML-based approach…

  1. MCN: A New Semantics towards Effective XML Keyword Search

    E-print Network

    Ling, Tok Wang

    of T does not. In particular, in tree data model, Lowest Common Ancestor (LCA) semantics [1] is first proposed, followed by SLCA (smallest LCA) [1] and MLCA [5] which apply additional constraints on LCA to the LCA semantics [1] where the LCA node are photos and site, respectively. If IDRefs in XML data

  2. New NED XML/VOtable Services and Client Interface Applications

    NASA Astrophysics Data System (ADS)

    Pevunova, O.; Good, J.; Mazzarella, J.; Berriman, G. B.; Madore, B.

    2005-12-01

    The NASA/IPAC Extragalactic Database (NED) provides data and cross-identifications for over 7 million extragalactic objects fused from thousands of survey catalogs and journal articles. The data cover all frequencies from radio through gamma rays and include positions, redshifts, photometry and spectral energy distributions (SEDs), sizes, and images. NED services have traditionally supplied data in HTML format for connections from Web browsers, and a custom ASCII data structure for connections by remote computer programs written in the C programming language. We describe new services that provide responses from NED queries in XML documents compliant with the international virtual observatory VOtable protocol. The XML/VOtable services support cone searches, all-sky searches based on object attributes (survey names, cross-IDs, redshifts, flux densities), and requests for detailed object data. Initial services have been inserted into the NVO registry, and others will follow soon. The first client application is a Style Sheet specification for rendering NED VOtable query results in Web browsers that support XML. The second prototype application is a Java applet that allows users to compare multiple SEDs. The new XML/VOtable output mode will also simplify the integration of data from NED into visualization and analysis packages, software agents, and other virtual observatory applications. We show an example SED from NED plotted using VOPlot. The NED website is: http://nedwww.ipac.caltech.edu.

  3. Integrating Keyword Search into XML Query Processing Daniela Florescu

    E-print Network

    Manolescu, Ioana

    to get information from several car dealers at once. The car dealers may store their data in different search on price even if the user knows exactly how each car dealer stores his/her data. Both regular data format, several query languagesfor XML have been proposed, specially devised to handle data whose

  4. Bayesian recursive data-pattern tomography

    NASA Astrophysics Data System (ADS)

    Mikhalychev, Alexander; Mogilevtsev, Dmitri; Teo, Yong Siah; ?ehá?ek, Jaroslav; Hradil, Zden?k

    2015-11-01

    We present a simple and efficient Bayesian recursive algorithm for the data-pattern scheme for quantum state reconstruction, which is applicable to situations where measurement settings can be controllably varied efficiently. The algorithm predicts the best measurements required to accurately reconstruct the unknown signal state in terms of a fixed set of probe states. In each iterative step, this algorithm seeks the measurement setting that minimizes the variance of the data-pattern estimator, which essentially measures the reconstruction accuracy, with the help of a data-pattern bank that was acquired prior to the signal reconstruction. We show that, with this algorithm, it is possible to minimize the number of measurement settings required to obtain a reasonably accurate state estimator by using just the optimal settings and, at the same time, increasing the numerical efficiency of the data-pattern reconstruction.

  5. Progress on an implementation of MIFlowCyt in XML

    NASA Astrophysics Data System (ADS)

    Leif, Robert C.; Leif, Stephanie H.

    2015-03-01

    Introduction: The International Society for Advancement of Cytometry (ISAC) Data Standards Task Force (DSTF) has created a standard for the Minimum Information about a Flow Cytometry Experiment (MIFlowCyt 1.0). The CytometryML schemas, are based in part upon the Flow Cytometry Standard and Digital Imaging and Communication (DICOM) standards. CytometryML has and will be extended and adapted to include MIFlowCyt, as well as to serve as a common 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). Individual major elements of the MIFlowCyt schema were translated into XML and filled with reasonable data. A small section of the code was formatted with HTML formatting elements. Results: The differences in the amount of detail to be recorded for 1) users of standard techniques including data analysts and 2) others, such as method and device creators, laboratory and other managers, engineers, and regulatory specialists required that separate data-types be created to describe the instrument configuration and components. A very substantial part of the MIFlowCyt element that describes the Experimental Overview part of the MIFlowCyt and substantial parts of several other major elements have been developed. Conclusions: The future use of structured XML tags and web technology should facilitate searching of experimental information, its presentation, and inclusion in structured research, clinical, and regulatory documents, as well as demonstrate in publications adherence to the MIFlowCyt standard. The use of CytometryML together with XML technology should also result in the textual and numeric data being published using web technology without any change in composition. Preliminary testing indicates that CytometryML XML pages can be directly formatted with the combination of HTML and CSS.

  6. Recursive estimation of prior probabilities using the mixture approach

    NASA Technical Reports Server (NTRS)

    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.

  7. Chapter 1. XML Security The eXtendible Markup Language (XML) allows organizations to agree on a common,

    E-print Network

    Herzberg, Amir

    to consumer (B2C) applications. Some examples include XML-EDI and eBX (for B2B) and OFX, IFX (for e- banking is widely used for electronic business and commerce protocols over insecure networks such as the Internet). Security is very important for many e-commerce applications. Recently, there have been multiple efforts

  8. Phase Response Design of Recursive All-Pass Digital Filters Using a Modified PSO Algorithm

    PubMed Central

    Chang, Wei-Der

    2015-01-01

    This paper develops a new design scheme for the phase response of an all-pass recursive digital filter. A variant of particle swarm optimization (PSO) algorithm will be utilized for solving this kind of filter design problem. It is here called the modified PSO (MPSO) algorithm in which another adjusting factor is more introduced in the velocity updating formula of the algorithm in order to improve the searching ability. In the proposed method, all of the designed filter coefficients are firstly collected to be a parameter vector and this vector is regarded as a particle of the algorithm. The MPSO with a modified velocity formula will force all particles into moving toward the optimal or near optimal solution by minimizing some defined objective function of the optimization problem. To show the effectiveness of the proposed method, two different kinds of linear phase response design examples are illustrated and the general PSO algorithm is compared as well. The obtained results show that the MPSO is superior to the general PSO for the phase response design of digital recursive all-pass filter. PMID:26366168

  9. XML does Real Programmers a Service

    SciTech Connect

    Gorton, Ian

    2008-09-01

    As the sun slowly sets of this first decade of the new millenium, it seems appropriate to update the sojourn of the real programmers as they adapt to their ever changing technical and business environment. Real Programmers were perfectly characterized and differentiated from their quiche-eating, Pascal programming brethren in Ed Post’s seminal “Real Programmers Don’t Use Pascal” (Datamation, 1983). My follow-up ("Real programmers do use Delphi," Software, IEEE , vol.12, no.6, pp.8, 10, 12-, Nov 1995) charted their evolution from FORTRAN-only programmers to embracing a wider range of mainstream languages and tools that still afforded ample opportunity for creativity, game-playing, irregular work hours, and importantly, long-term job security.

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

    NASA Technical Reports Server (NTRS)

    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. In our review of the database requirements and the COTS software available, only very expensive COTS software will meet 90% of requirements. Even with the high projected initial cost of COTS, the development and support for custom code over the 19-year mission period was forecasted to be higher than the total licensing costs. A group did look at reusing existing database tools and formats. If the JWST database was already in a mature state, the reuse made sense, but with the database still needing to handing the addition of different types of command and telemetry structures, defining new spacecraft systems, accept input and export to systems which has not been defined yet, XML provided the flexibility desired. It remains to be determined whether the XML database will reduce the over all cost for the JWST mission.

  11. On-Shell Recursion Relations for Effective Field Theories

    E-print Network

    Clifford Cheung; Karol Kampf; Jiri Novotny; Chia-Hsien Shen; Jaroslav Trnka

    2015-09-10

    We derive the first ever on-shell recursion relations for amplitudes in effective field theories. Based solely on factorization and the soft behavior of amplitudes, these recursion relations employ a new rescaling momentum shift to construct all tree-level scattering amplitudes in theories like the non- linear sigma model, Dirac-Born-Infeld theory, and the Galileon. Our results prove that all theories with enhanced soft behavior are on-shell constructible.

  12. Recursive Relations For Processes With n Photons Of Noncommutative QED

    E-print Network

    Abolfazl Jafari

    2006-08-10

    The recursion relations are derived for multi-photon processes of noncommutative QED. The relations concern purely photonic processes as well as the processes with two fermions involved, both for arbitrary number of photons at tree level. It is shown that despite of the dependence of noncommutative vertices on momentum, in contrast to momentum-independent color factors of QCD, the recursion relation method can be employed for multi-photon processes of noncommutative QED.

  13. Recursive construction of perfect DNA molecules from imperfect oligonucleotides

    PubMed Central

    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. PMID:18463615

  14. Recursive least squares estimation and its application to shallow trench isolation

    NASA Astrophysics Data System (ADS)

    Wang, Jin; Qin, S. Joe; Bode, Christopher A.; Purdy, Matthew A.

    2003-06-01

    In recent years, run-to-run (R2R) control technology has received tremendous interest in semiconductor manufacturing. One class of widely used run-to-run controllers is based on the exponentially weighted moving average (EWMA) statistics to estimate process deviations. Using an EWMA filter to smooth the control action on a linear process has been shown to provide good results in a number of applications. However, for a process with severe drifts, the EWMA controller is insufficient even when large weights are used. This problem becomes more severe when there is measurement delay, which is almost inevitable in semiconductor industry. In order to control drifting processes, a predictor-corrector controller (PCC) and a double EWMA controller have been developed. Chen and Guo (2001) show that both PCC and double-EWMA controller are in effect Integral-double-Integral (I-II) controllers, which are able to control drifting processes. However, since offset is often within the noise of the process, the second integrator can actually cause jittering. Besides, tuning the second filter is not as intuitive as a single EWMA filter. In this work, we look at an alternative way Recursive Least Squares (RLS), to estimate and control the drifting process. EWMA and double-EWMA are shown to be the least squares estimate for locally constant mean model and locally constant linear trend model. Then the recursive least squares with exponential factor is applied to shallow trench isolation etch process to predict the future etch rate. The etch process, which is a critical process in the flash memory manufacturing, is known to suffer from significant etch rate drift due to chamber seasoning. In order to handle the metrology delay, we propose a new time update scheme. RLS with the new time update method gives very good result. The estimate error variance is smaller than that from EWMA, and mean square error decrease more than 10% compared to that from EWMA.

  15. Analysing complexity of XML Schemas in geospatial web services

    E-print Network

    Tamayo, Alain; Huerta, Joaquín

    2011-01-01

    XML Schema is the language used to define the structure of messages exchanged between OGC-based web service clients and providers. The size of these schemas has been growing with time, reaching a state that makes its understanding and effective application a hard task. A first step to cope with this situation is to provide different ways to measure the complexity of the schemas. In this regard, we present in this paper an analysis of the complexity of XML schemas in OGC web services. We use a group of metrics found in the literature and introduce new metrics to measure size and/or complexity of these schemas. The use of adequate metrics allows us to quantify the complexity, quality and other properties of the schemas, which can be very useful in different scenarios.

  16. XTCE: XML Telemetry and Command Exchange Tutorial, XTCE Version 1

    NASA Technical Reports Server (NTRS)

    Rice, Kevin; Kizzort, Brad

    2008-01-01

    These presentation slides are a tutorial on XML Telemetry and Command Exchange (XTCE). The goal of XTCE is to provide an industry standard mechanism for describing telemetry and command streams (particularly from satellites.) it wiill lower cost and increase validation over traditional formats, and support exchange or native format.XCTE is designed to describe bit streams, that are typical of telemetry and command in the historic space domain.

  17. On the Termination Problem for Declarative XML Message Processing

    NASA Astrophysics Data System (ADS)

    Litak, Tadeusz; Helmer, Sven

    We define a formal syntax and semantics for the Rule Definition Language (RDL) of DemaqLite, which is a fragment of the declarative XML message processing system Demaq. Based on this definition, we prove that the termination problem for any practically useful sublanguage of DemaqLiteRDL is undecidable, as any such language can emulate a Single Register Machine—a Turing-complete model of computation proposed by Shepherdson and Sturgis.

  18. Enhance Reuse of Standard e-Business XML Schema Documents

    SciTech Connect

    Buhwan, Jeong; Kulvatunyou, Boonserm; Ivezic, Nenad; Jones, Albert

    2005-07-01

    Ideally, e-Business application interfaces would be built from highly reusable specifications of business document standards. Since many of these specifications are poorly understood, users often create new ones or customize existing ones every time a new integration problem arises. Consequently, even though there is a potential for reuse, the lack of a component discovery tool means that the cost of reuse is still prohibitively high. In this paper, we explore the potential of using similarity metrics to discover standard XML Schema documents. Our goal is to enhance reuse of XML Schema document/component standards in new integration contexts through the discovery process. We are motivated by the increasing access to the application interface specifications expressed in the form of XML Schema. These specifications are created to facilitate business documents exchange among software applications. Reuse can reduce both the proliferation of standards and the interoperability costs. To demonstrate these potential benefits, we propose and position our research based on an experimental scenario and a novel evaluation approach to qualify alternative similarity metrics on schema discovery. The edge equality in the evaluation method provides a conservative quality measure. We review a number of fundamental approaches to developing similarity metrics, and we organize these metrics into lexical, structural, and logical categories. For each of the metrics, we discuss its relevance and potential issues in its application to the XML Schema discovery task. We conclude that each of the similarity measures has its own strengths and weaknesses and each is expected to yield different results in different search situations. It is important, in the context of an application of these measures to e-Business standards that a schema discovery engine capable of assigning appropriate weights to different similarity measures be used when the search conditions change. This is a subject of our future experimental work.

  19. A Recursive Algorithm for Spatial Cluster Detection

    PubMed Central

    Jiang, Xia; Cooper, Gregory F.

    2007-01-01

    Spatial cluster detection involves finding spatial subregions of some larger region where clusters of some event are occurring. For example, in the case of disease outbreak detection, we want to find clusters of disease cases so as to pinpoint where the outbreak is occurring. When doing spatial cluster detection, we must first articulate the subregions of the region being analyzed. A simple approach is to represent the entire region by an n · n grid. Then we let every subset of cells in the grid represent a subregion. With this representation, the number of subregions is equal to 2n2 ?1. If n is not small, it is intractable to check every subregion. The time complexity of checking all the subregions that are rectangles is ?(n4). Neill et al.8 performed Bayesian spatial cluster detection by only checking every rectangle. In the current paper, we develop a recursive algorithm which searches a richer set of subregions. We provide results of simulation experiments evaluating the detection power and accuracy of the algorithm. PMID:18693860

  20. Recursive frame integration of limited data: RAFAIL

    NASA Astrophysics Data System (ADS)

    Rafailov, Michael K.; Soli, Robert A.

    2005-08-01

    Real time infrared imaging and tracking usually requires a high probability of target detection along with a low false alarm rate, achievable only with a high "Signal-to-Noise Ratio" (SNR). Frame integration--summing of non-correlated frames--is commonly used to improve the SNR. But conventional frame integration requires significant processing to store full frames and integrate intermediate results, normalize frame data, etc. It may drive acquisition of highly specialized hardware, faster processors, dedicated frame integration circuit cards and extra memory cards. Non-stationary noise, low frequency noise correlation, non-ergodic noise, scene dynamics, or pointing accuracy may also limit performance. Recursive frame integration of limited data--RAFAIL, is proposed as a means to improve frame integration performance and mitigate the issues. The technique applies two thresholds--one tuned for optimum probability of detection, the other to manage required false alarm rate--and allows a non-linear integration process that, along with optimal noise management, provides system designers more capability where cost, weight, or power considerations limit system data rate, processing, or memory capability.

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

    PubMed

    English, Megan; Gillespie, Graeme; Goossens, Benoit; Ismail, Sulaiman; Ancrenaz, Marc; Linklater, Wayne

    2015-01-01

    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 quantities have recovered sufficiently to meet their intake requirements. The implications for habitat and elephant management are discussed. PMID:26290779

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

    PubMed Central

    Gillespie, Graeme; Goossens, Benoit; Ismail, Sulaiman; Ancrenaz, Marc; Linklater, Wayne

    2015-01-01

    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 quantities have recovered sufficiently to meet their intake requirements. The implications for habitat and elephant management are discussed. PMID:26290779

  3. An XML Driven Graphical User Interface and Application Management Toolkit

    SciTech Connect

    White, Greg R

    2002-01-18

    In the past, the features of a user interface were limited by those available in the existing graphical widgets it used. Now, improvements in processor speed have fostered the emergence of interpreted languages, in which the appropriate method to render a given data object can be loaded at runtime. XML can be used to precisely describe the association of data types with their graphical handling (beans), and Java provides an especially rich environment for programming the graphics. We present a graphical user interface builder based on Java Beans and XML, in which the graphical screens are described textually (in files or a database) in terms of their screen components. Each component may be a simple text read back, or a complex plot. The programming model provides for dynamic data pertaining to a component to be forwarded synchronously or asynchronously, to the appropriate handler, which may be a built-in method, or a complex applet. This work was initially motivated by the need to move the legacy VMS display interface of the SLAC Control Program to another platform while preserving all of its existing functionality. However the model allows us a powerful and generic system for adding new kinds of graphics, such as Matlab, data sources, such as EPICS, middleware, such as AIDA[1], and transport, such as XML and SOAP. The system will also include a management console, which will be able to report on the present usage of the system, for instance who is running it where and connected to which channels.

  4. A Low-Storage-Consumption XML Labeling Method for Efficient Structural Information Extraction

    NASA Astrophysics Data System (ADS)

    Liang, Wenxin; Takahashi, Akihiro; Yokota, Haruo

    Recently, labeling methods to extract and reconstruct the structural information of XML data, which are important for many applications such as XPath query and keyword search, are becoming more attractive. To achieve efficient structural information extraction, in this paper we propose C-DO-VLEI code, a novel update-friendly bit-vector encoding scheme, based on register-length bit operations combining with the properties of Dewey Order numbers, which cannot be implemented in other relevant existing schemes such as ORDPATH. Meanwhile, the proposed method also achieves lower storage consumption because it does not require either prefix schema or any reserved codes for node insertion. We performed experiments to evaluate and compare the performance and storage consumption of the proposed method with those of the ORDPATH method. Experimental results show that the execution times for extracting depth information and parent node labels using the C-DO-VLEI code are about 25% and 15% less, respectively, and the average label size using the C-DO-VLEI code is about 24% smaller, comparing with ORDPATH.

  5. The Allan Technique of Programming Recursively Students have difficulty with recursion. I once had a professor who said that recursion would become

    E-print Network

    Allan, Vicki H.

    the recursion. Use the routines having the faith that they will work. (It is a self-esteem thing. Believe be coded as a function having the following prototype. FindBig(s,low,high) returns the biggest element of the array s between subscripts low and high. T FindBig(T s[], int low, int high) 3. One can find the biggest

  6. The limits on combining recursive horn rules with description logics

    SciTech Connect

    Levy, A.Y.; Rousset, M.C.

    1996-12-31

    Horn rule languages have formed the basis for many Artificial Intelligence application languages, but are not expressive enough to model domains with a rich hierarchical structure. Description logics have been designed especially to model rich hierarchies. Several applications would significantly benefit from combining the expressive power of both formalisms. This paper focuses on combining recursive function-free Horn rules with the expressive description logic ALCNR, and shows exactly when a hybrid language with decidable inference can be obtained. First, we show that several of the core constructors of description logics lead by themselves to undecidability of inference when combined with recursive function-free Horn rules. We then show that without these constructors we obtain a maximal subset of ALCNRR that yields a decidable hybrid language. Finally, we describe a restriction on the Horn rules that guarantees decidable inference when combined with all of ALCNR, and covers many of the common usages of recursive rules.

  7. Recursive Query Facilities in Relational Databases: A Survey

    NASA Astrophysics Data System (ADS)

    Przymus, Piotr; Boniewicz, Aleksandra; Burza?ska, Marta; Stencel, Krzysztof

    The relational model is the basis for most modern databases, while SQL is the most commonly used query language. However, there are data structures and computational problems that cannot be expressed using SQL-92 queries. Among them are those concerned with the bill-of-material and corporate hierarchies. A newer standard, called the SQL-99, introduced recursive queries which can be used to solve such tasks. Yet, only recently recursive queries have been implemented in most of the leading relational databases. In this paper we have reviewed and compared implementations of the recursive queries defined by SQL:1999 through SQL:2008 and offered by leading vendors of DBMSs. Our comparison concerns features, syntax and performance.

  8. Elucidating the stop bands of structurally colored systems through recursion

    NASA Astrophysics Data System (ADS)

    Amir, Ariel; Vukusic, Peter

    2013-04-01

    Interference is the source of some of the spectacular colors of animals and plants in nature. In some of these systems, the physical structure consists of an ordered array of layers with alternating high and low refractive indices. This periodicity leads to an optical band structure that is analogous to the electronic band structure encountered in semiconductor physics: specific bands of wavelengths (the stop bands) are perfectly reflected. Here, we present a minimal model for optical band structure in a periodic multilayer structure and solve it using recursion relations. The stop bands emerge in the limit of an infinite number of layers by finding the fixed point of the recursion. We compare to experimental data for various beetles, whose optical structure resembles the proposed model. Thus, using only the phenomenon of interference and the idea of recursion, we are able to elucidate the concept of band structure in the context of the experimentally observed high reflectance and iridescent appearance of structurally colored beetles.

  9. Recursive flexible multibody system dynamics using spatial operators

    NASA Technical Reports Server (NTRS)

    Jain, A.; Rodriguez, G.

    1992-01-01

    This paper uses spatial operators to develop new spatially recursive dynamics algorithms for flexible multibody systems. The operator description of the dynamics is identical to that for rigid multibody systems. Assumed-mode models are used for the deformation of each individual body. The algorithms are based on two spatial operator factorizations of the system mass matrix. The first (Newton-Euler) factorization of the mass matrix leads to recursive algorithms for the inverse dynamics, mass matrix evaluation, and composite-body forward dynamics for the systems. The second (innovations) factorization of the mass matrix, leads to an operator expression for the mass matrix inverse and to a recursive articulated-body forward dynamics algorithm. The primary focus is on serial chains, but extensions to general topologies are also described. A comparison of computational costs shows that the articulated-body, forward dynamics algorithm is much more efficient than the composite-body algorithm for most flexible multibody systems.

  10. Recursive computation of mutual potential between two polyhedra

    NASA Astrophysics Data System (ADS)

    Hirabayashi, Masatoshi; Scheeres, Daniel J.

    2013-11-01

    Recursive computation of mutual potential, force, and torque between two polyhedra is studied. Based on formulations by Werner and Scheeres (Celest Mech Dyn Astron 91:337-349, 2005) and Fahnestock and Scheeres (Celest Mech Dyn Astron 96:317-339, 2006) who applied the Legendre polynomial expansion to gravity interactions and expressed each order term by a shape-dependent part and a shape-independent part, this paper generalizes the computation of each order term, giving recursive relations of the shape-dependent part. To consider the potential, force, and torque, we introduce three tensors. This method is applicable to any multi-body systems. Finally, we implement this recursive computation to simulate the dynamics of a two rigid-body system that consists of two equal-sized parallelepipeds.

  11. Evaluation Effort, Reliability and Reusability in XML Sukomal Pal and Mandar Mitra

    E-print Network

    Kamps, Jaap

    components. As the num- ber of XML retrieval systems increases, so does the need to evaluateEvaluation Effort, Reliability and Reusability in XML Retrieval Sukomal Pal and Mandar Mitra Information Retrieval Lab, CVPR Unit, Indian Statistical Institute, 203 B T Road, Kolkata 700 108, India. E

  12. The simplest evaluation measures for XML information retrieval that could possibly work

    E-print Network

    Hiemstra, Djoerd

    reviews several evaluation measures developed for evaluating XML information retrieval (IR) systems. WeThe simplest evaluation measures for XML information retrieval that could possibly work Djoerd an infras- tructure and a framework for evaluating the performance of retrieval systems that offer effective

  13. The Use of Summaries in XML Retrieval Zoltan Szlavik, Anastasios Tombros, and Mounia Lalmas

    E-print Network

    Tombros, Tassos

    this question, an interactive information retrieval system was developed and a study using human searchers retrieval system can be supported in their search process, if at all, through sum- marisation. To answer of interactive XML retrieval systems. 1 Introduction As the eXtensible Markup Language (XML) is becoming

  14. Extensible Transcoder for HTML to VoiceXML Conversion Narayan Annamalai, B. Prabhakaran, and Gopal Gupta

    E-print Network

    Gupta, Gopal

    Extensible Transcoder for HTML to VoiceXML Conversion Narayan Annamalai, B. Prabhakaran, and Gopal. The data in the web is stored in HTML (Hyper Text Markup Language) format which cannot be delivered of audio. Thus it is imperative that a transcoder which converts HTML data to VoiceXML data is developed

  15. QIS-XML: An Extensible Markup Language for Quantum Information Science

    E-print Network

    Pascal Heus; Richard Gomez

    2011-06-14

    This Master thesis examines issues of interoperability and integration between the Classic Information Science (CIS) and Quantum Information Science (QIS). It provides a short introduction to the Extensible Markup Language (XML) and proceeds to describe the development steps that have lead to a prototype XML specification for quantum computing (QIS-XML). QIS-XML is a proposed framework, based on the widely used standard (XML) to describe, visualize, exchange and process quantum gates and quantum circuits. It also provides a potential approach to a generic programming language for quantum computers through the concept of XML driven compilers. Examples are provided for the description of commonly used quantum gates and circuits, accompanied with tools to visualize them in standard web browsers. An algorithmic example is also presented, performing a simple addition operation with quantum circuits and running the program on a quantum computer simulator. Overall, this initial effort demonstrates how XML technologies could be at the core of the architecture for describing and programming quantum computers. By leveraging a widely accepted standard, QIS-XML also builds a bridge between classic and quantum IT, which could foster the acceptance of QIS by the ICT community and facilitate the understanding of quantum technology by IT experts. This would support the consolidation of Classic Information Science and Quantum Information Science into a Complete Information Science, a challenge that could be referred to as the "Information Science Grand Unification Challenge".

  16. Agent Coordination Using Enterprise Java Beans and XML Web Services in a Battlefield Environment

    E-print Network

    Bayram, Zeki

    Agent Coordination Using Enterprise Java Beans and XML Web Services in a Battlefield Environment architecture that makes use of XML Web services, Enterprise Java Beans, and lightweight threads of JAVA Java Beans, and lightweight threads of JAVA, and use our architecture to simulate a battlefield

  17. SALT: An XML Application for Web-based Multimodal Dialog Kuansan Wang

    E-print Network

    SALT: An XML Application for Web-based Multimodal Dialog Management Kuansan Wang Speech Technology://research.microsoft.com/stg Abstract This paper describes the Speech Application Language Tags, or SALT, an XML based spoken dialog standard for multimodal or speech-only applications. A key premise in SALT design is that speech

  18. : A Holistic Path Join Algorithm for Path Query with Not-predicates on XML Data

    E-print Network

    Ling, Tok Wang

    -to-leaf paths in tree-structured XML documents that satisfy certain selection predicates is the basis of complex XML query processing. Such selection predicates are called path queries (i.e., twig queries without applications. As an example of a path query with a not-predicate, consider the XPath query: //supplier

  19. An XML Security Framework that Integrates NIST RBAC, MAC and DAC Policies

    E-print Network

    Demurjian, Steven A.

    An XML Security Framework that Integrates NIST RBAC, MAC and DAC Policies Alberto De la Rosa, data mining) and alternative standards (e.g., XML, RDF, OWL, JSON, etc.). Most such applications, collaborative software development, health informatics, etc. In such a situation, the security challenge

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

    ERIC Educational Resources Information Center

    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…

  1. Build a digital book with EPUB The open XML-based eBook format

    E-print Network

    Silber, Georges-André

    Build a digital book with EPUB The open XML-based eBook format Skill Level: Intermediate Liza Daly documentation, create an eBook, or just archive your favorite blog posts? EPUB is an open specification for digital books based on familiar technologies like XML, CSS, and XHTML, and EPUB files can be read

  2. A Practical Introduction to the XML, Extensible Markup Language, by Way of Some Useful Examples

    ERIC Educational Resources Information Center

    Snyder, Robin

    2004-01-01

    XML, Extensible Markup Language, is important as a way to represent and encapsulate the structure of underlying data in a portable way that supports data exchange regardless of the physical storage of the data. This paper (and session) introduces some useful and practical aspects of XML technology for sharing information in a educational setting…

  3. Reuse or Never Reuse the Deleted Labels in XML Query Processing Based on Labeling Schemes

    E-print Network

    Ling, Tok Wang

    , yet it can efficiently determine the ancestor-descendant (A-D) and parent-child (P-C) relationships have been proposed. Based on the labeling schemes, the ancestor- descendant and parent-child relationships in XML queries can be quickly de- termined without accessing the original XML file. Recently, more

  4. Labeling Scheme and Structural Joins for Graph-Structured XML Data

    E-print Network

    Lin, Xuemin

    the coding scheme, the structure relationship between any two elements (such as parent-child or ancestor-structured XML data. With this labeling scheme, the reachability relationship of two nodes can be judged effi" relationships and are essential in some applications, e.g., to avoid redundancy and anomalies. Such XML data

  5. OXONE: A Scalable Solution for Detecting Superior Quality Deltas on Ordered Large XML Documents

    E-print Network

    Bhowmick, Sourav S.

    scalable than the relational-based schema-oblivious approach. The performances of OXONE and XyDiff (C-based approaches (e.g., X-Diff, XyDiff). These approaches store the XML documents in the relational database quality compared to XyDiff (a main memory-based ordered XML change detection approach), its performance

  6. Prefix Path Streaming: a New Clustering Method for XML Twig Pattern Matching

    E-print Network

    Chan, Chee Yong

    can be represented as a node-labelled tree whose edges are either Parent-Child (P-C) or Ancestor-descendant and parent-child relationships. 1 Introduction XML data is often modelled as labelled and ordered tree are children of section elements having at least one child element title. Prior work on XML twig pattern

  7. ACXESS -Access Control for XML with Enhanced Security Specifications Sriram Mohan,Jonathan Klinginsmith

    E-print Network

    Wu, Yuqing Melanie

    ACXESS - Access Control for XML with Enhanced Security Specifications Sriram Mohan with security views. In SIGMOD, 2004. [2] S. Mohan, A. Sengupta, and Y. Wu. Access control for xml - a dynamic query rewriting approach. In CIKM, 2005. [3] S.Mohan, A.Sengupta, Y.Wu, and J.Klinginsmith. Access

  8. Utility-driven Load Shedding for XML Stream Processing Mingzhu Wei , Elke A. Rundensteiner and Murali Mani

    E-print Network

    Utility-driven Load Shedding for XML Stream Processing Mingzhu Wei , Elke A. Rundensteiner loss of data. Load shedding, the prevalent strategy for solving this overflow problem, has so far only been considered for relational stream processing, but not for XML. Shedding applied to XML stream

  9. Recursive Programming Model for Crop Production on the Texas High Plains 

    E-print Network

    Reneau, D. R.; Lacewell, R. D.; Ellis, J. R.

    1984-01-01

    A flexible, recursive programming model of crop production on the Texas High Plains was developed. Besides the linear programming (LP) Optimization routine and recursive feedback section, the model also includes a matrix ...

  10. THE CATEGORY THEORETIC SOLUTION OF RECURSIVE PROGRAM SCHEMES STEFAN MILIUS AND LAWRENCE S. MOSS

    E-print Network

    Moss, Lawrence S.

    THE CATEGORY THEORETIC SOLUTION OF RECURSIVE PROGRAM SCHEMES STEFAN MILIUS AND LAWRENCE S. MOSS;2 STEFAN MILIUS AND LAWRENCE S. MOSS 1. Introduction The theory of recursive program schemes (see [C, G, N

  11. Smooth Sigmoid Surrogate (SSS): An Alternative to Greedy Search in Recursive Partitioning

    E-print Network

    Stephan, Frank

    Smooth Sigmoid Surrogate (SSS): An Alternative to Greedy Search in Recursive Partitioning Xiaogang, Department of Preventive Medicine Northwestern University, Chicago, IL 60611 Qiong Yang, Department examine an alternative method by replacing the indicator threshold function involved in recursive

  12. Recursive multibody dynamics and discrete-time optimal control

    NASA Technical Reports Server (NTRS)

    Deleuterio, G. M. T.; Damaren, C. J.

    1989-01-01

    A recursive algorithm is developed for the solution of the simulation dynamics problem for a chain of rigid bodies. Arbitrary joint constraints are permitted, that is, joints may allow translational and/or rotational degrees of freedom. The recursive procedure is shown to be identical to that encountered in a discrete-time optimal control problem. For each relevant quantity in the multibody dynamics problem, there exists an analog in the context of optimal control. The performance index that is minimized in the control problem is identified as Gibbs' function for the chain of bodies.

  13. Recursive Implementations of the Schmidt-Kalman `Consider' Filter

    NASA Astrophysics Data System (ADS)

    Zanetti, Renato; D'Souza, Christopher

    2015-11-01

    One method to account for parameters errors in the Kalman filter is to `consider' their effect in the so-called Schmidt-Kalman filter. This paper addresses issues that arise when implementing a consider Kalman filter as a real-time, recursive algorithm. A favorite implementation of the Kalman filter as an onboard navigation subsystem is the UDU formulation. A new way to implement a UDU Schmidt-Kalman filter is proposed. The non-optimality of the recursive Schmidt-Kalman filter is also analyzed, and a modified algorithm is proposed to overcome this limitation.

  14. Higher Genus BMN Correlators: Factorization and Recursion Relations

    E-print Network

    Min-xin Huang

    2010-10-12

    We systematically study the factorization and recursion relations in higher genus correlation functions of BMN (Berenstein-Maldacena-Nastase) operators in free N=4 super Yang Mills theory. These properties were found in a previous paper by the author, and were conjectured to result from the correspondence with type IIB string theory on the infinitely curved pp-wave background, where the strings become effectively infinitely long. Here we push the calculations to higher genus, provide more clarifications and verifications of the factorization and recursion relations. Our calculations provide conjectural indirect tests of the AdS/CFT correspondence for multi-loop superstring amplitudes of stringy modes.

  15. A decoupled recursive approach for constrained flexible multibody system dynamics

    NASA Technical Reports Server (NTRS)

    Lai, Hao-Jan; Kim, Sung-Soo; Haug, Edward J.; Bae, Dae-Sung

    1989-01-01

    A variational-vector calculus approach is employed to derive a recursive formulation for dynamic analysis of flexible multibody systems. Kinematic relationships for adjacent flexible bodies are derived in a companion paper, using a state vector notation that represents translational and rotational components simultaneously. Cartesian generalized coordinates are assigned for all body and joint reference frames, to explicitly formulate deformation kinematics under small deformation kinematics and an efficient flexible dynamics recursive algorithm is developed. Dynamic analysis of a closed loop robot is performed to illustrate efficiency of the algorithm.

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

    E-print Network

    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.

  17. Research on Heterogeneous Data Exchange based on XML

    NASA Astrophysics Data System (ADS)

    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.

  18. An XML-Based Protocol for Distributed Event Services

    NASA Technical Reports Server (NTRS)

    Smith, Warren; Gunter, Dan; Quesnel, Darcy; Biegel, Bryan (Technical Monitor)

    2001-01-01

    A recent trend in distributed computing is the construction of high-performance distributed systems called computational grids. One difficulty we have encountered is that there is no standard format for the representation of performance information and no standard protocol for transmitting this information. This limits the types of performance analysis that can be undertaken in complex distributed systems. To address this problem, we present an XML-based protocol for transmitting performance events in distributed systems and evaluate the performance of this protocol.

  19. Eliminating Dead Code on Recursive Data ? Yanhong A. Liu, Scott D. Stoller

    E-print Network

    Cortesi, Tino

    Eliminating Dead Code on Recursive Data ? Yanhong A. Liu, Scott D. Stoller Computer Science@cs.sunysb.edu Abstract This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using liveness patterns based

  20. Limit theorems for depths and distances in weighted random b-ary recursive trees

    E-print Network

    Rüschendorf, Ludger

    Limit theorems for depths and distances in weighted random b-ary recursive trees G¨otz Olaf are established for some functionals of the distances between two nodes in weighted random b-ary recursive trees argument corresponding limit theorems for further classes of random trees as for plane-oriented recursive

  1. Limit Laws for Functions of Fringe trees for Binary Search Trees and Random Recursive Trees

    E-print Network

    Janson, Svante

    Limit Laws for Functions of Fringe trees for Binary Search Trees and Random Recursive Trees Cecilia for sums of functions of subtrees of (random) binary search trees and random recursive trees. The proofs that the number of fringe trees of size k = kn in the binary search tree or in the random recursive tree (of total

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

    ERIC Educational Resources Information Center

    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,…

  3. Updating Probabilities

    E-print Network

    Caticha, A; Caticha, Ariel; Giffin, Adom

    2006-01-01

    We show that Skilling's method of induction leads to a unique general theory of inductive inference, the method of Maximum relative Entropy (ME). The main tool for updating probabilities is the logarithmic relative entropy; other entropies such as those of Renyi or Tsallis are ruled out. We also show that Bayes updating is a special case of ME updating and thus, that the two are completely compatible.

  4. Travaux Diriges de XML no Dans ce TP autour de la filmographie d'Ingrid Bergman, nous verrons la conception de

    E-print Network

    Blanc, Olivier

    Travaux Dirig´es de XML no 1 Dans ce TP autour de la filmographie d'Ingrid Bergman, nous verrons la bergman.xml contient un certain nombre d'informations (en format XML) sur l'actrice Ingrid Bergman bergman.xml --noout Des messages d'erreurs sont alors affich´es indiquant la nature et la position des

  5. On recursive least-squares filtering algorithms and implementations. Ph.D. Thesis

    NASA Technical Reports Server (NTRS)

    Hsieh, Shih-Fu

    1990-01-01

    In many real-time signal processing applications, fast and numerically stable algorithms for solving least-squares problems are necessary and important. In particular, under non-stationary conditions, these algorithms must be able to adapt themselves to reflect the changes in the system and take appropriate adjustments to achieve optimum performances. Among existing algorithms, the QR-decomposition (QRD)-based recursive least-squares (RLS) methods have been shown to be useful and effective for adaptive signal processing. In order to increase the speed of processing and achieve high throughput rate, many algorithms are being vectorized and/or pipelined to facilitate high degrees of parallelism. A time-recursive formulation of RLS filtering employing block QRD will be considered first. Several methods, including a new non-continuous windowing scheme based on selectively rejecting contaminated data, were investigated for adaptive processing. Based on systolic triarrays, many other forms of systolic arrays are shown to be capable of implementing different algorithms. Various updating and downdating systolic algorithms and architectures for RLS filtering are examined and compared in details, which include Householder reflector, Gram-Schmidt procedure, and Givens rotation. A unified approach encompassing existing square-root-free algorithms is also proposed. For the sinusoidal spectrum estimation problem, a judicious method of separating the noise from the signal is of great interest. Various truncated QR methods are proposed for this purpose and compared to the truncated SVD method. Computer simulations provided for detailed comparisons show the effectiveness of these methods. This thesis deals with fundamental issues of numerical stability, computational efficiency, adaptivity, and VLSI implementation for the RLS filtering problems. In all, various new and modified algorithms and architectures are proposed and analyzed; the significance of any of the new method depends crucially on specific application.

  6. XML schemas and mark-up practices of taxonomic literature

    PubMed Central

    Penev, Lyubomir; Lyal, Christopher HC; Weitzman, Anna; Morse, David R.; King, David; Sautter, Guido; Georgiev, Teodor; Morris, Robert A.; Catapano, Terry; Agosti, Donat

    2011-01-01

    Abstract We review the three most widely used XML schemas used to mark-up taxonomic texts, TaxonX, TaxPub and taXMLit. These are described from the viewpoint of their development history, current status, implementation, and use cases. The concept of “taxon treatment” from the viewpoint of taxonomy mark-up into XML is discussed. TaxonX and taXMLit are primarily designed for legacy literature, the former being more lightweight and with a focus on recovery of taxon treatments, the latter providing a much more detailed set of tags to facilitate data extraction and analysis. TaxPub is an extension of the National Library of Medicine Document Type Definition (NLM DTD) for taxonomy focussed on layout and recovery and, as such, is best suited for mark-up of new publications and their archiving in PubMedCentral. All three schemas have their advantages and shortcomings and can be used for different purposes. PMID:22207808

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

    PubMed Central

    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. PMID:11825265

  8. XML-Based Visual Specification of Multidisciplinary Applications

    NASA Technical Reports Server (NTRS)

    Al-Theneyan, Ahmed; Jakatdar, Amol; Mehrotra, Piyush; Zubair, Mohammad

    2001-01-01

    The advancements in the Internet and Web technologies have fueled a growing interest in developing a web-based distributed computing environment. We have designed and developed Arcade, a web-based environment for designing, executing, monitoring, and controlling distributed heterogeneous applications, which is easy to use and access, portable, and provides support through all phases of the application development and execution. A major focus of the environment is the specification of heterogeneous, multidisciplinary applications. In this paper we focus on the visual and script-based specification interface of Arcade. The web/browser-based visual interface is designed to be intuitive to use and can also be used for visual monitoring during execution. The script specification is based on XML to: (1) make it portable across different frameworks, and (2) make the development of our tools easier by using the existing freely available XML parsers and editors. There is a one-to-one correspondence between the visual and script-based interfaces allowing users to go back and forth between the two. To support this we have developed translators that translate a script-based specification to a visual-based specification, and vice-versa. These translators are integrated with our tools and are transparent to users.

  9. Personalising e-learning modules: targeting Rasmussen levels using XML.

    PubMed

    Renard, J M; Leroy, S; Camus, H; Picavet, M; Beuscart, R

    2003-01-01

    The development of Internet technologies has made it possible to increase the number and the diversity of on-line resources for teachers and students. Initiatives like the French-speaking Virtual Medical University Project (UMVF) try to organise the access to these resources. But both teachers and students are working on a partly redundant subset of knowledge. From the analysis of some French courses we propose a model for knowledge organisation derived from Rasmussen's stepladder. In the context of decision-making Rasmussen has identified skill-based, rule-based and knowledge-based levels for the mental process. In the medical context of problem-solving, we apply these three levels to the definition of three students levels: beginners, intermediate-level learners, experts. Based on our model, we build a representation of the hierarchical structure of data using XML language. We use XSLT Transformation Language in order to filter relevant data according to student level and to propose an appropriate display on students' terminal. The model and the XML implementation we define help to design tools for building personalised e-learning modules. PMID:14664075

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

    E-print Network

    Leszek Hadasz; Zbigniew Jaskolski; Paulina Suchanek

    2009-11-22

    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.

  11. SoftMoW: Recursive and Reconfigurable Cellular WAN Architecture

    E-print Network

    Mao, Zhuoqing Morley

    SoftMoW: Recursive and Reconfigurable Cellular WAN Architecture Mehrdad Moradi Wenfei Wu Li Erran a major challenge to the scalability of the control plane. To address these problems, we present SoftMoW-wide, SoftMoW recur- sively builds up the hierarchical control plane with novel abstractions of both control

  12. STRUCTURE PRESERVING TRANSFORMATIONS ON NON-LEFT-RECURSIVE GRAMMARS

    E-print Network

    Theune, Mariët

    of the cases it is quite obvious to demand weak equivalence for these two grammars. Transformations on context semantic mapping. In case a context-free grammar G' covers a context-free grammar G we can use the originalSTRUCTURE PRESERVING TRANSFORMATIONS ON NON-LEFT-RECURSIVE GRAMMARS (preliminary version ) Anton

  13. Evolving Recursive Programs by Using Adaptive Grammar Based Genetic Programming

    E-print Network

    Fernandez, Thomas

    Page 1 Evolving Recursive Programs by Using Adaptive Grammar Based Genetic Programming Man Leung@ln.edu.hk Abstract Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software re- engineering, electrical

  14. Mathematics of Recursive Program Construction Henk Doornbos Roland Backhouse yz

    E-print Network

    Backhouse, Roland

    is the development of practical programming methodologies. Characteristic of a programming methodology arbitrary goto programs. In the same spirit, in the methodology for functional programs, arbitrary recursion that is an integration and extension of the two methodologies. The class of programs that can be developed using

  15. Recursion and the Competence/Performance Distinction in AGL Tasks

    ERIC Educational Resources Information Center

    Lobina, David J.

    2011-01-01

    The term "recursion" is used in at least four distinct theoretical senses within cognitive science. Some of these senses in turn relate to the different levels of analysis described by David Marr some 20 years ago; namely, the underlying competence capacity (the "computational" level), the performance operations used in real-time processing (the…

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

    ERIC Educational Resources Information Center

    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 tested by…

  17. The Rogers--Ramanujan recursion and intertwining operators

    E-print Network

    Stefano Capparelli; James Lepowsky; Antun Milas

    2004-02-10

    We use vertex operator algebras and intertwining operators to study certain substructures of standard $A_1^{(1)}$--modules, allowing us to conceptually obtain the classical Rogers--Ramanujan recursion. As a consequence we recover Feigin-Stoyanovsky's character formulas for the principal subspaces of the level 1 standard $A_1^{(1)}$--modules.

  18. A mathematical modeling of pure, recursive Yiannis. N. Moschovakis

    E-print Network

    Moschovakis, Yiannis N.

    Language of Re- cursion FLR and develops intensional (algorithmic) semantics for it: the intension) algorithm defined by t on A. Main results are the soundness of the reduction calculus of FLR (which models studied the formal language of recursion FLR which is the main technical tool for this work, we developed

  19. A note on recursive calculations of particular 9j coefficients

    E-print Network

    Jean-Christophe Pain

    2011-10-08

    The calculation of angular-momentum coupling transformation matrices can be very time consuming and alternative methods, even if they apply only in special cases, are helpful. We present a recursion relation for the calculation of particular 9j symbols used in the quantum theory of angular momentum.

  20. Controlling Internet Queue Dynamics using Recursively Identified Models

    E-print Network

    Gustafsson, Fredrik

    in amplitude until the queue saturates, which inevitably decreases performance, so a stabilizing con- trollerControlling Internet Queue Dynamics using Recursively Identified Models Frida Gunnarsson, Fredrik rate before the queue becomes full and hard drops of packets are nec- essary. State of the art

  1. Deep Recursive Neural Networks for Compositionality in Language

    E-print Network

    Cardie, Claire

    Deep Recursive Neural Networks for Compositionality in Language Ozan Irsoy Department of Computer representations. Even though these architectures are deep in structure, they lack the capacity for hierarchical representation that exists in conventional deep feed-forward networks as well as in recently investigated deep

  2. Recursive Protein Structure Jianlin Cheng, PhD

    E-print Network

    Cheng, Jianlin Jack

    -Based Modeling 100% TBM 100% FM50% TBM+50%FM Protein Modeling Spectrum #12;Region Decomposition from Alignment Aligned Aligned Unaligned Unaligned #12;Recursive Protein Modeling ­ Integrate TBM and FM Model aligned / certain regions by TBM Model unaligned / uncertain regions by FM + model selection Keep certain regions

  3. RECURSIVE TECHNIQUES FOR PASSIVE SOURCE LOCATION JOSE M. F. MOURA

    E-print Network

    Moura, José

    . 403 Many detection and tracking problems are based on passive receiving systems where the availableRECURSIVE TECHNIQUES FOR PASSIVE SOURCE LOCATION ABSTRACT JOSE M. F. MOURA CAPS, COMPLEXO is concerned with the loca- tion of passive sources. Conceptually, this is viewed as a time delay estimation

  4. A Scale-Invariant Treatment for Recursive Path Models.

    ERIC Educational Resources Information Center

    McDonald, Roderick P.; And Others

    1993-01-01

    A reparameterization is formulated that yields estimates of scale-invariant parameters in recursive path models with latent variables, and (asymptotically) correct standard errors, without the use of constrained optimization. The method is based on the logical structure of the reticular action model. (Author)

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

    ERIC Educational Resources Information Center

    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…

  6. Recursive Vocal Pattern Learning and Generalization in Starlings

    ERIC Educational Resources Information Center

    Bloomfield, Tiffany Corinna

    2012-01-01

    Among known communication systems, human language alone exhibits open-ended productivity of meaning. Interest in the psychological mechanisms supporting this ability, and their evolutionary origins, has resurged following the suggestion that the only uniquely human ability underlying language is a mechanism of recursion. This "Unique…

  7. Nonmonotonic Rule Systems with recursive sets of restraints

    E-print Network

    Marek, Victor W.

    Nonmonotonic Rule Systems with recursive sets of restraints V. Wiktor Marek1 Anil Nerode2 Jeffrey B systems with rules that admit infinitely many restraints. We concentrate on the case when the constraints that the theory developed for nonmonotnic rule systems admitting the rules with finite number of restraints can

  8. Exploring the Recursive Nature of Food and Family Communication

    ERIC Educational Resources Information Center

    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…

  9. A Tail-Recursive Machine with Stack Inspection

    E-print Network

    Tobin-Hochstadt, Sam

    A Tail-Recursive Machine with Stack Inspection JOHN CLEMENTS and MATTHIAS FELLEISEN Northeastern with a global tail call optimization policy; that an implementation of such a language must allocate memory for a source-code tail call, and a program that uses only tail calls (and no other memory- allocating construct

  10. A Java Reinforcement Learning Module for the Recursive Porous

    E-print Network

    Tesfatsion, Leigh

    A Java Reinforcement Learning Module for the Recursive Porous Agent Simulation Toolkit Facilitating Evaluation of free java-libraries for social- scientific agent based simulation, Tobias and Hoffman, 2004 in Repast Genetic Algorithm demo model OpenForecast demo model Java Object Oriented Neural Engine (JOONE

  11. Creating preservation metadata from XML-metadata profiles

    NASA Astrophysics Data System (ADS)

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

    2014-05-01

    Registration of dataset DOIs at DataCite makes research data citable and comes with the obligation to keep data accessible in the future. In addition, many universities and research institutions measure data that is unique and not repeatable like the data produced by an observational network and they want to keep these data for future generations. In consequence, such data should be ingested in preservation systems, that automatically care for file format changes. Open source preservation software that is developed along the definitions of the ISO OAIS reference model is available but during ingest of data and metadata there are still problems to be solved. File format validation is difficult, because format validators are not only remarkably slow - due to variety in file formats different validators return conflicting identification profiles for identical data. These conflicts are hard to resolve. Preservation systems have a deficit in the support of custom metadata. Furthermore, data producers are sometimes not aware that quality metadata is a key issue for the re-use of data. In the project EWIG an university institute and a research institute work together with Zuse-Institute Berlin, that is acting as an infrastructure facility, to generate exemplary workflows for research data into OAIS compliant archives with emphasis on the geosciences. The Institute for Meteorology provides timeseries data from an urban monitoring network whereas GFZ Potsdam delivers file based data from research projects. To identify problems in existing preservation workflows the technical work is complemented by interviews with data practitioners. Policies for handling data and metadata are developed. Furthermore, university teaching material is created to raise the future scientists awareness of research data management. As a testbed for ingest workflows the digital preservation system Archivematica [1] is used. During the ingest process metadata is generated that is compliant to the 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

  12. Teaching object concepts for XML-based representations.

    SciTech Connect

    Kelsey, R. 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.

  13. Using XML and Java Technologies for Astronomical Instrument Control

    NASA Technical Reports Server (NTRS)

    Ames, Troy; Case, Lynne; Powers, Edward I. (Technical Monitor)

    2001-01-01

    Traditionally, instrument command and control systems have been highly specialized, consisting mostly of custom code that is difficult to develop, maintain, and extend. Such solutions are initially very costly and are inflexible to subsequent engineering change requests, increasing software maintenance costs. Instrument description is too tightly coupled with details of implementation. NASA Goddard Space Flight Center, under the Instrument Remote Control (IRC) project, is developing a general and highly extensible framework that applies to any kind of instrument that can be controlled by a computer. The software architecture combines the platform independent processing capabilities of Java with the power of the Extensible Markup Language (XML), a human readable and machine understandable way to describe structured data. A key aspect of the object-oriented architecture is that the software is driven by an instrument description, written using the Instrument Markup Language (IML), a dialect of XML. IML is used to describe the command sets and command formats of the instrument, communication mechanisms, format of the data coming from the instrument, and characteristics of the graphical user interface to control and monitor the instrument. The IRC framework allows the users to define a data analysis pipeline which converts data coming out of the instrument. The data can be used in visualizations in order for the user to assess the data in real-time, if necessary. The data analysis pipeline algorithms can be supplied by the user in a variety of forms or programming languages. Although the current integration effort is targeted for the High-resolution Airborne Wideband Camera (HAWC) and the Submillimeter and Far Infrared Experiment (SAFIRE), first-light instruments of the Stratospheric Observatory for Infrared Astronomy (SOFIA), the framework is designed to be generic and extensible so that it can be applied to any instrument. Plans are underway to test the framework with other types of instruments, such as remote sensing earth science instruments.

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

    NASA Technical Reports Server (NTRS)

    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.

  15. Leveraging XML Technologies in Developing Program Analysis Tools Jonathan I. Maletic, Michael Collard, Huzefa Kagdi

    E-print Network

    Maletic, Jonathan I.

    Collard, Huzefa Kagdi Department of Computer Science Kent State University Kent Ohio 44242 330 672 9039 jmaletic@cs.kent.edu, collard@cs.kent.edu, hkagdi@cs.kent.edu Abstract XML technologies are quickly

  16. XML-based approaches for the integration of heterogeneous bio-molecular data

    PubMed Central

    Mesiti, Marco; Jiménez-Ruiz, Ernesto; Sanz, Ismael; Berlanga-Llavori, Rafael; Perlasca, Paolo; Valentini, Giorgio; Manset, David

    2009-01-01

    Background The today's public database infrastructure spans a very large collection of heterogeneous biological data, opening new opportunities for molecular biology, bio-medical and bioinformatics research, but raising also new problems for their integration and computational processing. Results In this paper we survey the most interesting and novel approaches for the representation, integration and management of different kinds of biological data by exploiting XML and the related recommendations and approaches. Moreover, we present new and interesting cutting edge approaches for the appropriate management of heterogeneous biological data represented through XML. Conclusion XML has succeeded in the integration of heterogeneous biomolecular information, and has established itself as the syntactic glue for biological data sources. Nevertheless, a large variety of XML-based data formats have been proposed, thus resulting in a difficult effective integration of bioinformatics data schemes. The adoption of a few semantic-rich standard formats is urgent to achieve a seamless integration of the current biological resources. PMID:19828083

  17. CDE Technical Report 2003-1 1 Developing XML Vocabularies for Web Services

    E-print Network

    Glushko, Robert J.

    CDE Technical Report 2003-1 1 Developing XML Vocabularies for Web Services Calvin Smith Patrick {calvins,pgarvey,glushko}@sims.berkeley.edu 4 January 2003 Center for Document Engineering Technical Report

  18. COMPLEXITY OF DECISION PROBLEMS FOR XML SCHEMAS AND CHAIN REGULAR EXPRESSIONS

    E-print Network

    Martens, Wim

    COMPLEXITY OF DECISION PROBLEMS FOR XML SCHEMAS AND CHAIN REGULAR EXPRESSIONS WIM MARTENS¶, FRANK: wim.martens@udo.edu (Wim Martens), thomas.schwentick@udo.edu (Thomas Schwentick) §Hasselt University

  19. Recursive utility in a Markov environment with stochastic growth.

    PubMed

    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. PMID:22778428

  20. EEG and MEG source localization using recursively applied (RAP) MUSIC

    SciTech Connect

    Mosher, J.C.; Leahy, R.M.

    1996-12-31

    The multiple signal characterization (MUSIC) algorithm locates multiple asynchronous dipolar sources from electroencephalography (EEG) and magnetoencephalography (MEG) data. A signal subspace is estimated from the data, then the algorithm scans a single dipole model through a three-dimensional head volume and computes projections onto this subspace. To locate the sources, the user must search the head volume for local peaks in the projection metric. Here we describe a novel extension of this approach which we refer to as RAP (Recursively APplied) MUSIC. This new procedure automatically extracts the locations of the sources through a recursive use of subspace projections, which uses the metric of principal correlations as a multidimensional form of correlation analysis between the model subspace and the data subspace. The dipolar orientations, a form of `diverse polarization,` are easily extracted using the associated principal vectors.

  1. Functional Dual Adaptive Control with Recursive Gaussian Process Model

    NASA Astrophysics Data System (ADS)

    Prüher, Jakub; Král, Ladislav

    2015-11-01

    The paper deals with dual adaptive control problem, where the functional uncertainties in the system description are modelled by a non-parametric Gaussian process regression model. Current approaches to adaptive control based on Gaussian process models are severely limited in their practical applicability, because the model is re-adjusted using all the currently available data, which keeps growing with every time step. We propose the use of recursive Gaussian process regression algorithm for significant reduction in computational requirements, thus bringing the Gaussian process-based adaptive controllers closer to their practical applicability. In this work, we design a bi-criterial dual controller based on recursive Gaussian process model for discrete-time stochastic dynamic systems given in an affine-in-control form. Using Monte Carlo simulations, we show that the proposed controller achieves comparable performance with the full Gaussian process-based controller in terms of control quality while keeping the computational demands bounded.

  2. Topological recursion for Gaussian means and cohomological field theories

    E-print Network

    Andersen, Jørgen Ellegaard; Norbury, Paul; Penner, Robert C

    2016-01-01

    We use the explicit relation between genus filtrated $s$-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich--Penner matrix model (KPMM), which is the generating function for volumes of discretized (open) moduli spaces $M_{g,s}^{disc}$ (discrete volumes), to express Gaussian means in all genera as polynomials in special times weighted by ancestor invariants of an underlying cohomological field theory. We translate topological recursion of the Gaussian model into recurrent relations for coefficients of this expansion proving their integrality and positivity. As an application, we find the coefficients in the first subleading order for ${\\mathcal M}_{g,1}$ for all $g$ in three ways: by using the refined Harer--Zagier recursion, by exploiting the Givental-type decomposition of KPMM, and by an explicit diagram counting.

  3. Development of a recursion RNG-based turbulence model

    NASA Technical Reports Server (NTRS)

    Zhou, YE; Vahala, George; Thangam, S.

    1993-01-01

    Reynolds stress closure models based on the recursion renormalization group theory are developed for the prediction of turbulent separated flows. The proposed model uses a finite wavenumber truncation scheme to account for the spectral distribution of energy. In particular, the model incorporates effects of both local and nonlocal interactions. The nonlocal interactions are shown to yield a contribution identical to that from the epsilon-renormalization group (RNG), while the local interactions introduce higher order dispersive effects. A formal analysis of the model is presented and its ability to accurately predict separated flows is analyzed from a combined theoretical and computational stand point. Turbulent flow past a backward facing step is chosen as a test case and the results obtained based on detailed computations demonstrate that the proposed recursion -RNG model with finite cut-off wavenumber can yield very good predictions for the backstep problem.

  4. NeXML: rich, extensible, and verifiable representation of comparative data and metadata.

    PubMed

    Vos, Rutger A; Balhoff, James P; Caravas, Jason A; Holder, Mark T; Lapp, Hilmar; Maddison, Wayne P; Midford, Peter E; Priyam, Anurag; Sukumaran, Jeet; Xia, Xuhua; Stoltzfus, Arlin

    2012-07-01

    In scientific research, integration and synthesis require a common understanding of where data come from, how much they can be trusted, and what they may be used for. To make such an understanding computer-accessible requires standards for exchanging richly annotated data. The challenges of conveying reusable data are particularly acute in regard to evolutionary comparative analysis, which comprises an ever-expanding list of data types, methods, research aims, and subdisciplines. To facilitate interoperability in evolutionary comparative analysis, we present NeXML, an XML standard (inspired by the current standard, NEXUS) that supports exchange of richly annotated comparative data. NeXML defines syntax for operational taxonomic units, character-state matrices, and phylogenetic trees and networks. Documents can be validated unambiguously. Importantly, any data element can be annotated, to an arbitrary degree of richness, using a system that is both flexible and rigorous. We describe how the use of NeXML by the TreeBASE and Phenoscape projects satisfies user needs that cannot be satisfied with other available file formats. By relying on XML Schema Definition, the design of NeXML facilitates the development and deployment of software for processing, transforming, and querying documents. The adoption of NeXML for practical use is facilitated by the availability of (1) an online manual with code samples and a reference to all defined elements and attributes, (2) programming toolkits in most of the languages used commonly in evolutionary informatics, and (3) input-output support in several widely used software applications. An active, open, community-based development process enables future revision and expansion of NeXML. PMID:22357728

  5. NeXML: Rich, Extensible, and Verifiable Representation of Comparative Data and Metadata

    PubMed Central

    Vos, Rutger A.; Balhoff, James P.; Caravas, Jason A.; Holder, Mark T.; Lapp, Hilmar; Maddison, Wayne P.; Midford, Peter E.; Priyam, Anurag; Sukumaran, Jeet; Xia, Xuhua; Stoltzfus, Arlin

    2012-01-01

    In scientific research, integration and synthesis require a common understanding of where data come from, how much they can be trusted, and what they may be used for. To make such an understanding computer-accessible requires standards for exchanging richly annotated data. The challenges of conveying reusable data are particularly acute in regard to evolutionary comparative analysis, which comprises an ever-expanding list of data types, methods, research aims, and subdisciplines. To facilitate interoperability in evolutionary comparative analysis, we present NeXML, an XML standard (inspired by the current standard, NEXUS) that supports exchange of richly annotated comparative data. NeXML defines syntax for operational taxonomic units, character-state matrices, and phylogenetic trees and networks. Documents can be validated unambiguously. Importantly, any data element can be annotated, to an arbitrary degree of richness, using a system that is both flexible and rigorous. We describe how the use of NeXML by the TreeBASE and Phenoscape projects satisfies user needs that cannot be satisfied with other available file formats. By relying on XML Schema Definition, the design of NeXML facilitates the development and deployment of software for processing, transforming, and querying documents. The adoption of NeXML for practical use is facilitated by the availability of (1) an online manual with code samples and a reference to all defined elements and attributes, (2) programming toolkits in most of the languages used commonly in evolutionary informatics, and (3) input–output support in several widely used software applications. An active, open, community-based development process enables future revision and expansion of NeXML. PMID:22357728

  6. Statistical models and recursive prediction of speech signals

    NASA Astrophysics Data System (ADS)

    Prokhorov, Iu. N.

    On the basis of Markovian filtering theory, regression analysis, and a renewal process method, recursive linear and nonlinear algorithms for adaptive prediction are presented. A simplified forecasting algorithm is obtained which can be adapted to the technical realization of digital elements for microcircuit technology. Consideration is given to algorithms for predicting and filtering speech signals as they are mixed with background noise. Prediction algorithms can be applied to the digital representation of signals in systems with adaptive differential PCM and in encoders.

  7. Recursive fragmentation model with quark spin. Application to quark polarimetry

    E-print Network

    Artru, X

    2010-01-01

    An elementary recursive model accounting for the quark spin in the fragmentation of a quark into mesons is presented. The quark spin degree of freedom is represented by a two-components spinor. Spin one meson can be included. The model produces Collins effect and jet handedness. The influence of the initial quark polarisation decays exponentially with the rank of the meson, at dierent rates for longitudinal and transverse polarisations

  8. Recursion formula for electron repulsion integrals over Hermite polynomials

    NASA Astrophysics Data System (ADS)

    Fletcher, G. D.

    A method for computing electron repulsion integrals over contracted Gaussian functions is described in which intermediate integrals over Hermite polynomials are generated by a "pre-Hermite" recursion (PHR) step before the conversion to regular integrals. This greatly reduces the floating-point operation counts inside the contraction loops, where only simple "scaling"-type operations are required, making the method efficient for contracted Gaussians, particularly of high angular momentum.

  9. Concurrency Theory Lecture 4: Hennessy-Milner Logic with Recursion

    E-print Network

    Ábrahám, Erika

    ://www-i2.informatik.rwth-aachen.de/i2/ct13/ Winter Semester 2013/14 #12;Exercise Class Next week: Tue 5 Nov 12:15-13:45 AH 6 ("Fachschafts-VV") Thu 7 Nov 14:15-15:45 AH 1 Concurrency Theory Winter Semester 2013/14 4.2 #12;Outline 1 Recap: Hennessy-Milner Logic 2 HML and Process Traces 3 Adding Recursion

  10. Recursion relations for AdS/CFT correlators

    SciTech Connect

    Raju, Suvrat

    2011-06-15

    We expand on the results of our recent letter [Phys. Rev. Lett. 106, 091601 (2011)], where we presented new recursion relations for correlation functions of the stress-tensor and conserved currents in conformal field theories with an AdS{sub d+1} dual for d{>=}4. These recursion relations are derived by generalizing the Britto-Cachazo-Feng-Witten (BCFW) relations to amplitudes in anti-de Sitter space (AdS) that are dual to boundary correlators, and are usually computed perturbatively by Witten diagrams. Our results relate vacuum-correlation functions to integrated products of lower-point transition amplitudes, which correspond to correlators calculated between states dual to certain normalizable modes. We show that the set of ''polarization vectors'' for which amplitudes behave well under the BCFW extension is smaller than in flat-space. We describe how transition amplitudes for more general external polarizations can be constructed by combining answers obtained by different pairs of BCFW shifts. We then generalize these recursion relations to supersymmetric theories. In AdS, unlike flat-space, even maximal supersymmetry is insufficient to permit the computation of all correlators of operators in the same multiplet as a stress-tensor or conserved current. Finally, we work out some simple examples to verify our results.

  11. Recursive linearization of multibody dynamics equations of motion

    NASA Technical Reports Server (NTRS)

    Lin, Tsung-Chieh; Yae, K. Harold

    1989-01-01

    The equations of motion of a multibody system are nonlinear in nature, and thus pose a difficult problem in linear control design. One approach is to have a first-order approximation through the numerical perturbations at a given configuration, and to design a control law based on the linearized model. Here, a linearized model is generated analytically by following the footsteps of the recursive derivation of the equations of motion. The equations of motion are first written in a Newton-Euler form, which is systematic and easy to construct; then, they are transformed into a relative coordinate representation, which is more efficient in computation. A new computational method for linearization is obtained by applying a series of first-order analytical approximations to the recursive kinematic relationships. The method has proved to be computationally more efficient because of its recursive nature. It has also turned out to be more accurate because of the fact that analytical perturbation circumvents numerical differentiation and other associated numerical operations that may accumulate computational error, thus requiring only analytical operations of matrices and vectors. The power of the proposed linearization algorithm is demonstrated, in comparison to a numerical perturbation method, with a two-link manipulator and a seven degrees of freedom robotic manipulator. Its application to control design is also demonstrated.

  12. An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems

    SciTech Connect

    Seal, Sudip K

    2014-01-01

    Block tridiagonal systems of linear equations arise in a wide variety of scientific and engineering applications. Recursive doubling algorithm is a well-known prefix computation-based numerical algorithm that requires O(M^3(N/P + log P)) work to compute the solution of a block tridiagonal system with N block rows and block size M on P processors. In real-world applications, solutions of tridiagonal systems are most often sought with multiple, often hundreds and thousands, of different right hand sides but with the same tridiagonal matrix. Here, we show that a recursive doubling algorithm is sub-optimal when computing solutions of block tridiagonal systems with multiple right hand sides and present a novel algorithm, called the accelerated recursive doubling algorithm, that delivers O(R) improvement when solving block tridiagonal systems with R distinct right hand sides. Since R is typically about 100 1000, this improvement translates to very significant speedups in practice. Detailed complexity analyses of the new algorithm with empirical confirmation of runtime improvements are presented. To the best of our knowledge, this algorithm has not been reported before in the literature.

  13. Validation and Simplification of the Radiation Therapy Oncology Group Recursive Partitioning Analysis Classification for Glioblastoma

    SciTech Connect

    Li Jing; Wang Meihua; Won, Minhee; Shaw, Edward G.; Coughlin, Christopher; Curran, Walter J.; Mehta, Minesh P.

    2011-11-01

    Purpose: Previous recursive partitioning analysis (RPA) of patients with malignant glioma (glioblastoma multiforme [GBM] and anaplastic astrocytoma [AA]) produced six prognostic groups (I-VI) classified by six factors. We sought here to determine whether the classification for GBM could be improved by using an updated Radiation Therapy Oncology Group (RTOG) GBM database excluding AA and by considering additional baseline variables. Methods and Materials: The new analysis considered 42 baseline variables and 1,672 GBM patients from the expanded RTOG glioma database. Patients receiving radiation only were excluded such that all patients received radiation+carmustine. 'Radiation dose received' was replaced with 'radiation dose assigned.' The new RPA models were compared with the original model by applying them to a test dataset comprising 488 patients from six other RTOG trials. Fitness of the original and new models was evaluated using explained variation. Results: The original RPA model explained more variations in survival in the test dataset than did the new models (20% vs. 15%) and was therefore chosen for further analysis. It was reduced by combining Classes V and VI to produce three prognostic classes (Classes III, IV, and V+VI), as Classes V and VI had indistinguishable survival in the test dataset. The simplified model did not further improve performance (explained variation 18% vs. 20%) but is easier to apply because it involves only four variables: age, performance status, extent of resection, and neurologic function. Applying this simplified model to the updated GBM database resulted in three distinct classes with median survival times of 17.1, 11.2, and 7.5 months for Classes III, IV, and V+VI, respectively. Conclusions: The final model, the simplified original RPA model combining Classes V and VI, resulted in three distinct prognostic groups defined by age, performance status, extent of resection, and neurologic function. This classification will be used in future RTOG GBM trials.

  14. A novel recursive Fourier transform for nonuniform sampled signals: application to heart rate variability spectrum estimation.

    PubMed

    Holland, Alexander; Aboy, Mateo

    2009-07-01

    We present a novel method to iteratively calculate discrete Fourier transforms for discrete time signals with sample time intervals that may be widely nonuniform. The proposed recursive Fourier transform (RFT) does not require interpolation of the samples to uniform time intervals, and each iterative transform update of N frequencies has computational order N. Because of the inherent non-uniformity in the time between successive heart beats, an application particularly well suited for this transform is power spectral density (PSD) estimation for heart rate variability. We compare RFT based spectrum estimation with Lomb-Scargle Transform (LST) based estimation. PSD estimation based on the LST also does not require uniform time samples, but the LST has a computational order greater than Nlog(N). We conducted an assessment study involving the analysis of quasi-stationary signals with various levels of randomly missing heart beats. Our results indicate that the RFT leads to comparable estimation performance to the LST with significantly less computational overhead and complexity for applications requiring iterative spectrum estimations. PMID:19247700

  15. Statistical recursive filtering for offset nonuniformity estimation in infrared focal-plane-array sensors

    NASA Astrophysics Data System (ADS)

    Martin, César San; Torres, Sergio; Pezoa, Jorge E.

    2008-10-01

    We have developed a recursive estimator for the offset nonuniformity (NU) present in infrared (IR) focal-plane-array (FPA) imaging systems. The estimator is optimal in the least-square error sense and estimates the offset NU using only the collected scene data. Our scene-based nonuniformity correction (NUC) method exploits Kalman's theory in order to estimate a constant in noise. The method is based upon two key assumptions: (i) the input irradiance at each detector is assumed to be a random variable uniformly distributed in a range that is common to all detectors in the IR-FPA; and (ii) the IR data sequences considered are temporally short enough such that the offset NU at each pixel of the array remains constant within the sequence. The proposed algorithm iterates over the frames in a pixel-by-pixel basis and updates two filter parameters for each pixel over the IR-FPA. Additionally, an on-line technique for ghosting artifacts cancellation is introduced to the NUC filter and an index to assess the artifact reduction is developed. The ability of the method to compensate for the offset NU is demonstrated by filtering video sequences from mid- and long-wave IR cameras.

  16. James Webb Space Telescope XML Database: From the Beginning to Today

    NASA Technical Reports Server (NTRS)

    Gal-Edd, Jonathan; Fatig, Curtis C.

    2005-01-01

    The James Webb Space Telescope (JWST) Project has been defining, developing, and exercising the use of a common eXtensible Markup Language (XML) for the command and telemetry (C&T) database structure. JWST is the first large NASA space mission to use XML for databases. The JWST project started developing the concepts for the C&T database in 2002. The database will need to last at least 20 years since it will be used beginning with flight software development, continuing through Observatory integration and test (I&T) and through operations. Also, a database tool kit has been provided to the 18 various flight software development laboratories located in the United States, Europe, and Canada that allows the local users to create their own databases. Recently the JWST Project has been working with the Jet Propulsion Laboratory (JPL) and Object Management Group (OMG) XML Telemetry and Command Exchange (XTCE) personnel to provide all the information needed by JWST and JPL for exchanging database information using a XML standard structure. The lack of standardization requires custom ingest scripts for each ground system segment, increasing the cost of the total system. Providing a non-proprietary standard of the telemetry and command database definition formation will allow dissimilar systems to communicate without the need for expensive mission specific database tools and testing of the systems after the database translation. The various ground system components that would benefit from a standardized database are the telemetry and command systems, archives, simulators, and trending tools. JWST has exchanged the XML database with the Eclipse, EPOCH, ASIST ground systems, Portable spacecraft simulator (PSS), a front-end system, and Integrated Trending and Plotting System (ITPS) successfully. This paper will discuss how JWST decided to use XML, the barriers to a new concept, experiences utilizing the XML structure, exchanging databases with other users, and issues that have been experienced in creating databases for the C&T system.

  17. A recursive method for updating apple firmness prediction models based on spectral scattering images

    Technology Transfer Automated Retrieval System (TEKTRAN)

    Multispectral scattering is effective for nondestructive prediction of fruit firmness. However, the established prediction models for multispectral scattering are variety specific and may not perform appropriately for fruit harvested from different orchards or at different times. In this research, a...

  18. The NITE XML Toolkit: flexible annotation for multimodal language data.

    PubMed

    Carletta, Jean; Evert, Stefan; Heid, Ulrich; Kilgour, Jonathan; Robertson, Judy; Voormann, Holger

    2003-08-01

    Multimodal corpora that show humans interacting via language are now relatively easy to collect. Current tools allow one either to apply sets of time-stamped codes to the data and consider their timing and sequencing or to describe some specific linguistic structure that is present in the data, built over the top of some form of transcription. To further our understanding of human communication, the research community needs code sets with both timings and structure, designed flexibly to address the research questions at hand. The NITE XML Toolkit offers library support that software developers can call upon when writing tools for such code sets and, thus, enables richer analyses than have previously been possible. It includes data handling, a query language containing both structural and temporal constructs, components that can be used to build graphical interfaces, sample programs that demonstrate how to use the libraries, a tool for running queries, and an experimental engine that builds interfaces on the basis of declarative specifications. PMID:14587542

  19. Using XML and Java for Astronomical Instrumentation Control

    NASA Technical Reports Server (NTRS)

    Ames, Troy; Koons, Lisa; Sall, Ken; Warsaw, Craig

    2000-01-01

    Traditionally, instrument command and control systems have been highly specialized, consisting mostly of custom code that is difficult to develop, maintain, and extend. Such solutions are initially very costly and are inflexible to subsequent engineering change requests, increasing software maintenance costs. Instrument description is too tightly coupled with details of implementation. NASA Goddard Space Flight Center is developing a general and highly extensible framework that applies to any kind of instrument that can be controlled by a computer. The software architecture combines the platform independent processing capabilities of Java with the power of the Extensible Markup Language (XML), a human readable and machine understandable way to describe structured data. A key aspect of the object-oriented architecture is software that is driven by an instrument description, written using the Instrument Markup Language (IML). ]ML is used to describe graphical user interfaces to control and monitor the instrument, command sets and command formats, data streams, and communication mechanisms. Although the current effort is targeted for the High-resolution Airborne Wideband Camera, a first-light instrument of the Stratospheric Observatory for Infrared Astronomy, the framework is designed to be generic and extensible so that it can be applied to any instrument.

  20. Glasses removal from facial image using recursive error compensation.

    PubMed

    Park, Jeong-Seon; Oh, You Hwa; Ahn, Sang Chul; Lee, Seong-Whan

    2005-05-01

    In this paper, we propose a new method of removing glasses from a human frontal facial image. We first detect the regions occluded by the glasses and generate a natural looking facial image without glasses by recursive error compensation using PCA reconstruction. The resulting image has no trace of the glasses frame or of the reflection and shade caused by the glasses. The experimental results show that the proposed method provides an effective solution to the problem of glasses occlusion and we believe that this method can also be used to enhance the performance of face recognition systems. PMID:15875801

  1. Recursive Method for Nekrasov partition function for classical Lie groups

    E-print Network

    Satoshi Nakamura; Futoshi Okazawa; Yutaka Matsuo

    2014-11-27

    Nekrasov partition function for the supersymmetric gauge theories with general Lie groups is not so far known in a closed form while there is a definition in terms of the integral. In this paper, as an intermediate step to derive it, we give a recursion formula among partition functions, which can be derived from the integral. We apply the method to a toy model which reflects the basic structure of partition functions for BCD type Lie groups and obtained a closed expression for the factor associated with the generalized Young diagram.

  2. Association-dissociation process with aging subunits: Recursive solution

    NASA Astrophysics Data System (ADS)

    Niedermayer, Thomas; Lipowsky, Reinhard

    2015-11-01

    The coupling of stochastic growth and shrinkage of one-dimensional structures to random aging of the constituting subunits defines the simple association-dissociation-aging process which captures the essential features of the nonequilibrium assembly of cytoskeletal filaments. Because of correlations, previously employed mean-field methods fail to correctly describe filament growth. We study an alternative formulation of the full master equation of the stochastic process. An ansatz for the steady-state solution leads to a recursion relation which allows for the calculation of all emergent quantities with increasing accuracy and in excellent agreement with stochastic simulations.

  3. Alternatives to relational database: comparison of NoSQL and XML approaches for clinical data storage.

    PubMed

    Lee, Ken Ka-Yin; Tang, Wai-Choi; Choi, Kup-Sze

    2013-04-01

    Clinical data are dynamic in nature, often arranged hierarchically and stored as free text and numbers. Effective management of clinical data and the transformation of the data into structured format for data analysis are therefore challenging issues in electronic health records development. Despite the popularity of relational databases, the scalability of the NoSQL database model and the document-centric data structure of XML databases appear to be promising features for effective clinical data management. In this paper, three database approaches--NoSQL, XML-enabled and native XML--are investigated to evaluate their suitability for structured clinical data. The database query performance is reported, together with our experience in the databases development. The results show that NoSQL database is the best choice for query speed, whereas XML databases are advantageous in terms of scalability, flexibility and extensibility, which are essential to cope with the characteristics of clinical data. While NoSQL and XML technologies are relatively new compared to the conventional relational database, both of them demonstrate potential to become a key database technology for clinical data management as the technology further advances. PMID:23177219

  4. A d-Sequence based Recursive Random Number Generator Abhishek Parakh

    E-print Network

    International Association for Cryptologic Research (IACR)

    A d-Sequence based Recursive Random Number Generator Abhishek Parakh Louisiana State University number generators (RNGs) [4] in a manner analogous to the iterative squaring done in the BBS method [5,6]. In this paper we propose a new recursive technique for the use of d-sequences to generate random numbers

  5. THE STRONG CONVERGENCE OF MAXIMAL DEGREES IN UNIFORM RANDOM RECURSIVE TREES AND DAGS

    E-print Network

    Devroye, Luc

    THE STRONG CONVERGENCE OF MAXIMAL DEGREES IN UNIFORM RANDOM RECURSIVE TREES AND DAGS Luc Devroye and Jiang Lu School of Computer Science and Department of Mathematics and Statistics McGill University Abstract. We show that the maximal degree in a uniform random recursive tree is almost surely (1 + o(1

  6. Round-off error propagation in four generally applicable, recursive, least-squares-estimation schemes

    NASA Technical Reports Server (NTRS)

    Verhaegen, M. H.

    1987-01-01

    The numerical robustness of four generally applicable, recursive, least-squares-estimation schemes is analyzed by means of a theoretical round-off propagation study. This study highlights a number of practical, interesting insights of widely used recursive least-squares schemes. These insights have been confirmed in an experimental study as well.

  7. Combining Flat and Structured Representations for Fingerprint Classification with Recursive Neural Networks

    E-print Network

    Yao, Yuan

    Combining Flat and Structured Representations for Fingerprint Classification with Recursive Neural fingerprint classification algorithms based on two machine learning ap- proaches: support vector machines (SVM), and recursive neural networks (RNN). RNN are trained on a structured representation of the fingerprint image

  8. SPEECH NOISE ESTIMATION USING ENHANCED MINIMA CONTROLLED RECURSIVE Ningping Fan, Justinian Rosca, Radu Balan

    E-print Network

    Balan, Radu V.

    SPEECH NOISE ESTIMATION USING ENHANCED MINIMA CONTROLLED RECURSIVE AVERAGING Ningping Fan.Balan}@siemens.com ABSTRACT Accurate noise power spectrum estimation in a noisy speech signal is a key challenge problem in speech enhancement. One state-of-the-art approach is the minima controlled recursive averaging (MCRA

  9. Microkernels Meet Recursive Virtual Machines Bryan Ford Mike Hibler Jay Lepreau Patrick Tullmann

    E-print Network

    Ford, Bryan

    Microkernels Meet Recursive Virtual Machines Bryan Ford Mike Hibler Jay Lepreau Patrick Tullmann on a synthesis of micro- kernel and virtual machine concepts. We have developed a software-based virtualizable architecture called Fluke that allows recursive virtual machines (virtual machines running on other virtual

  10. Microkernels Meet Recursive Virtual Machines Bryan Ford Mike Hibler Jay Lepreau Patrick Tullmann

    E-print Network

    Ford, Bryan

    Microkernels Meet Recursive Virtual Machines Bryan Ford Mike Hibler Jay Lepreau Patrick Tullmann on a synthesis of micro­ kernel and virtual machine concepts. We have developed a software­based virtualizable architecture called Fluke that allows recursive virtual machines (virtual machines running on other virtual

  11. Recursive Total Least Squares: An Alternative to Using the Discrete Kalman

    E-print Network

    Boley, Daniel

    Recursive Total Least Squares: An Alternative to Using the Discrete Kalman Filter in Robot to ob- tain the best estimate of the robot position. The discrete Kalman filter, com- monly used the Kalman filter. To this end, we propose the use of a Recursive Total Least Squares Filter. This filter

  12. Another Solution to Publish Distributed SGML/XML Documents onto Xu Jianliang, Institute of Artificial Intelligence, Zhejiang University

    E-print Network

    Xu, Jianliang

    delivered as printed manuals, in online help systems (or CD-ROM) and on the Web. Organizations that produce Publishing enterprise's on-line information is always done by making use of SGML/XML to express documents, to search, and to access distributed SGML/XML documents catering for the enterprise-wide heterogeneous

  13. A clustering method based on path similarities of XML data q Ilhwan Choi a,*, Bongki Moon b

    E-print Network

    Moon, Bongki

    A clustering method based on path similarities of XML data q Ilhwan Choi a,*, Bongki Moon b arrangement of objects, can be an important factor in improving the performance in this storage model more widely used in various Internet applications, and the importance of XML repository has increased

  14. Third Edition of the "XML and Information Retrieval" Workshop First Workshop on Integration of IR and DB (WIRD)

    E-print Network

    de Vries, Arjen P.

    Third Edition of the "XML and Information Retrieval" Workshop First Workshop on Integration of IR to the application of IR methods to XML data for querying, retrieval, navigating, etc. We have gone a long way since of this workshop has been to bring together researchers of the database (DB) and information retrieval (IR) fields

  15. This is the author version of an article published as: Woodley, Alan P. (2007) Formulating XML-IR Queries. In

    E-print Network

    Liang, Huizhi "Elly"

    2007-01-01

    This is the author version of an article published as: Woodley, Alan P. (2007) Formulating XML-IR http://eprints.qut.edu.au #12;Formulating XML-IR Queries Alan Woodley Faculty of Information Technology Language Queries, Query by Template 1. INTRODUCTION Traditional Information Retrieval (IR) systems respond

  16. From Revisiting the LCA-based Approach to a New Semantics-based Approach for XML Keyword Search

    E-print Network

    Ling, Tok Wang

    From Revisiting the LCA-based Approach to a New Semantics-based Approach for XML Keyword Search for data-centric XML documents are based on the compu- tation of Lowest Common Ancestors (LCA), such as SLCA and MLCA. In this paper, we show that the LCA is not always a correct search model for processing

  17. Efficient Execution of Recursive Programs on Commodity Vector Hardware

    SciTech Connect

    Ren, Bin; Jo, Youngjoon; Krishnamoorthy, Sriram; Agrawal, Kunal; Kulkarni, Milind

    2015-06-13

    The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly-wide vector units on commodity processors and accelerators. This hardware is designed to efficiently execute data-parallel computations in a vectorized manner. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations; in the absence of data parallelism, it seems that such algorithms are not well-suited to throughput-oriented architectures. This paper presents a set of novel code transformations that expose the data-parallelism latent in recursive, task-parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel's SSE4.2 vector units as well as accelerators using Intel's AVX512 units.

  18. Parsimonious extreme learning machine using recursive orthogonal least squares.

    PubMed

    Wang, Ning; Er, Meng Joo; Han, Min

    2014-10-01

    Novel constructive and destructive parsimonious extreme learning machines (CP- and DP-ELM) are proposed in this paper. By virtue of the proposed ELMs, parsimonious structure and excellent generalization of multiinput-multioutput single hidden-layer feedforward networks (SLFNs) are obtained. The proposed ELMs are developed by innovative decomposition of the recursive orthogonal least squares procedure into sequential partial orthogonalization (SPO). The salient features of the proposed approaches are as follows: 1) Initial hidden nodes are randomly generated by the ELM methodology and recursively orthogonalized into an upper triangular matrix with dramatic reduction in matrix size; 2) the constructive SPO in the CP-ELM focuses on the partial matrix with the subcolumn of the selected regressor including nonzeros as the first column while the destructive SPO in the DP-ELM operates on the partial matrix including elements determined by the removed regressor; 3) termination criteria for CP- and DP-ELM are simplified by the additional residual error reduction method; and 4) the output weights of the SLFN need not be solved in the model selection procedure and is derived from the final upper triangular equation by backward substitution. Both single- and multi-output real-world regression data sets are used to verify the effectiveness and superiority of the CP- and DP-ELM in terms of parsimonious architecture and generalization accuracy. Innovative applications to nonlinear time-series modeling demonstrate superior identification results. PMID:25291736

  19. Gibbs Recursive Sampler: finding transcription factor binding sites.

    PubMed

    Thompson, William; Rouchka, Eric C; Lawrence, Charles E

    2003-07-01

    The Gibbs Motif Sampler is a software package for locating common elements in collections of biopolymer sequences. In this paper we describe a new variation of the Gibbs Motif Sampler, the Gibbs Recursive Sampler, which has been developed specifically for locating multiple transcription factor binding sites for multiple transcription factors simultaneously in unaligned DNA sequences that may be heterogeneous in DNA composition. Here we describe the basic operation of the web-based version of this sampler. The sampler may be acces-sed at http://bayesweb.wadsworth.org/gibbs/gibbs.html and at http://www.bioinfo.rpi.edu/applications/bayesian/gibbs/gibbs.html. An online user guide is available at http://bayesweb.wadsworth.org/gibbs/bernoulli.html and at http://www.bioinfo.rpi.edu/applications/bayesian/gibbs/manual/bernoulli.html. Solaris, Solaris.x86 and Linux versions of the sampler are available as stand-alone programs for academic and not-for-profit users. Commercial licenses are also available. The Gibbs Recursive Sampler is distributed in accordance with the ISCB level 0 guidelines and a requirement for citation of use in scientific publications. PMID:12824370

  20. Fine tuning points of generating function construction for linear recursions

    NASA Astrophysics Data System (ADS)

    Yolcu, Bahar; Demiralp, Metin

    2014-10-01

    Recursions are quite important mathematical tools since many systems are mathematically modelled to ultimately take us to these equations because of their rather easy algebraic natures. They fit computer programming needs quite well in many circumstances to produce solutions. However, it is generally desired to find the asymptotic behaviour of the general term in the relevant sequence for convergence and therefore practicality issues. One of the general tendencies to find the general term asymptotic behaviour, when its ordering number grows unboundedly, is the integral representation over a generating function which does not depend on individual sequence elements. This is tried to be done almost for all types of recursions, even though the linear cases gain more importance than the others because they can be more effectively investigated by using many linear algebraic tools. Despite this may seem somehow to be rather trivial, there are a lot of theoretical fine tuning issues in the construction of true integral representations over true intervals on real axis or paths in complex domains. This work is devoted to focus on this issue starting from scratch for better understanding of the matter. The example cases are chosen to best illuminate the situations to get information for future generalization even though the work can be considered at somehow introductory level.

  1. Optimal Recursive Digital Filters for Active Bending Stabilization

    NASA Technical Reports Server (NTRS)

    Orr, Jeb S.

    2013-01-01

    In the design of flight control systems for large flexible boosters, it is common practice to utilize active feedback control of the first lateral structural bending mode so as to suppress transients and reduce gust loading. Typically, active stabilization or phase stabilization is achieved by carefully shaping the loop transfer function in the frequency domain via the use of compensating filters combined with the frequency response characteristics of the nozzle/actuator system. In this paper we present a new approach for parameterizing and determining optimal low-order recursive linear digital filters so as to satisfy phase shaping constraints for bending and sloshing dynamics while simultaneously maximizing attenuation in other frequency bands of interest, e.g. near higher frequency parasitic structural modes. By parameterizing the filter directly in the z-plane with certain restrictions, the search space of candidate filter designs that satisfy the constraints is restricted to stable, minimum phase recursive low-pass filters with well-conditioned coefficients. Combined with optimal output feedback blending from multiple rate gyros, the present approach enables rapid and robust parametrization of autopilot bending filters to attain flight control performance objectives. Numerical results are presented that illustrate the application of the present technique to the development of rate gyro filters for an exploration-class multi-engined space launch vehicle.

  2. Recursive dynamic mode decomposition of a transient cylinder wake

    E-print Network

    Noack, B R; Morzynski, M; Schmid, P J

    2015-01-01

    A novel data-driven modal decomposition of fluid flow is proposed comprising key features of POD and DMD. The first mode is the normalized real or imaginary part of the DMD mode which minimizes the time-averaged residual. The N-th mode is defined recursively in an analogous manner based on the residual of an expansion using the first N-1 modes. The resulting recursive DMD (RDMD) modes are orthogonal by construction, retain pure frequency content and aim at low residual. RDMD is applied to transient cylinder wake data and is benchmarked against POD and optimized DMD (Chen et al. 2012) for the same snapshot sequence. Unlike POD modes, RDMD structures are shown to have pure frequency content while retaining a residual of comparable order as POD. In contrast to DMD with exponentially growing or decaying oscillatory amplitudes, RDMD clearly identifies initial, maximum and final fluctuation levels. Intriguingly, RDMD outperforms both POD and DMD in the limit cycle resolution from the same snaphots. RDMD is proposed...

  3. REQUEST: A Recursive QUEST Algorithm for Sequential Attitude Determination

    NASA Technical Reports Server (NTRS)

    Bar-Itzhack, Itzhack Y.

    1996-01-01

    In order to find the attitude of a spacecraft with respect to a reference coordinate system, vector measurements are taken. The vectors are pairs of measurements of the same generalized vector, taken in the spacecraft body coordinates, as well as in the reference coordinate system. We are interested in finding the best estimate of the transformation between these coordinate system.s The algorithm called QUEST yields that estimate where attitude is expressed by a quarternion. Quest is an efficient algorithm which provides a least squares fit of the quaternion of rotation to the vector measurements. Quest however, is a single time point (single frame) batch algorithm, thus measurements that were taken at previous time points are discarded. The algorithm presented in this work provides a recursive routine which considers all past measurements. The algorithm is based on on the fact that the, so called, K matrix, one of whose eigenvectors is the sought quaternion, is linerly related to the measured pairs, and on the ability to propagate K. The extraction of the appropriate eigenvector is done according to the classical QUEST algorithm. This stage, however, can be eliminated, and the computation simplified, if a standard eigenvalue-eigenvector solver algorithm is used. The development of the recursive algorithm is presented and illustrated via a numerical example.

  4. Interactive, Secure Web-enabled Aircraft Engine Simulation Using XML Databinding Integration

    NASA Technical Reports Server (NTRS)

    Lin, Risheng; Afjeh, Abdollah A.

    2003-01-01

    This paper discusses the detailed design of an XML databinding framework for aircraft engine simulation. The framework provides an object interface to access and use engine data. while at the same time preserving the meaning of the original data. The Language independent representation of engine component data enables users to move around XML data using HTTP through disparate networks. The application of this framework is demonstrated via a web-based turbofan propulsion system simulation using the World Wide Web (WWW). A Java Servlet based web component architecture is used for rendering XML engine data into HTML format and dealing with input events from the user, which allows users to interact with simulation data from a web browser. The simulation data can also be saved to a local disk for archiving or to restart the simulation at a later time.

  5. Standardization of XML Database Exchanges and the James Webb Space Telescope Experience

    NASA Technical Reports Server (NTRS)

    Gal-Edd, Jonathan; Detter, Ryan; Jones, Ron; Fatig, Curtis C.

    2007-01-01

    Personnel from the National Aeronautics and Space Administration (NASA) James Webb Space Telescope (JWST) Project have been working with various standard communities such the Object Management Group (OMG) and the Consultative Committee for Space Data Systems (CCSDS) to assist in the definition of a common extensible Markup Language (XML) for database exchange format. The CCSDS and OMG standards are intended for the exchange of core command and telemetry information, not for all database information needed to exercise a NASA space mission. The mission-specific database, containing all the information needed for a space mission, is translated from/to the standard using a translator. The standard is meant to provide a system that encompasses 90% of the information needed for command and telemetry processing. This paper will discuss standardization of the XML database exchange format, tools used, and the JWST experience, as well as future work with XML standard groups both commercial and government.

  6. Recursive dynamics for flexible multibody systems using spatial operators

    NASA Technical Reports Server (NTRS)

    Jain, A.; Rodriguez, G.

    1990-01-01

    Due to their structural flexibility, spacecraft and space manipulators are multibody systems with complex dynamics and possess a large number of degrees of freedom. Here the spatial operator algebra methodology is used to develop a new dynamics formulation and spatially recursive algorithms for such flexible multibody systems. A key feature of the formulation is that the operator description of the flexible system dynamics is identical in form to the corresponding operator description of the dynamics of rigid multibody systems. A significant advantage of this unifying approach is that it allows ideas and techniques for rigid multibody systems to be easily applied to flexible multibody systems. The algorithms use standard finite-element and assumed modes models for the individual body deformation. A Newton-Euler Operator Factorization of the mass matrix of the multibody system is first developed. It forms the basis for recursive algorithms such as for the inverse dynamics, the computation of the mass matrix, and the composite body forward dynamics for the system. Subsequently, an alternative Innovations Operator Factorization of the mass matrix, each of whose factors is invertible, is developed. It leads to an operator expression for the inverse of the mass matrix, and forms the basis for the recursive articulated body forward dynamics algorithm for the flexible multibody system. For simplicity, most of the development here focuses on serial chain multibody systems. However, extensions of the algorithms to general topology flexible multibody systems are described. While the computational cost of the algorithms depends on factors such as the topology and the amount of flexibility in the multibody system, in general, it appears that in contrast to the rigid multibody case, the articulated body forward dynamics algorithm is the more efficient algorithm for flexible multibody systems containing even a small number of flexible bodies. The variety of algorithms described here permits a user to choose the algorithm which is optimal for the multibody system at hand. The availability of a number of algorithms is even more important for real-time applications, where implementation on parallel processors or custom computing hardware is often necessary to maximize speed.

  7. Data rate management and real time operation: recursive adaptive frame integration of limited data

    NASA Astrophysics Data System (ADS)

    Rafailov, Michael K.

    2006-08-01

    Recursive Limited Frame Integration was proposed as a way to improve frame integration performance and mitigate issues related to high data rate needed to support conventional frame integration. The technique uses two thresholds -one tuned for optimum probability of detection, the other to manage required false alarm rate, and places integration process between those thresholds. This configuration allows a non-linear integration process that, along with Signal-to-Noise Ratio (SNR) gain, provides system designers more capability where cost, weight, or power considerations limit system data rate, processing, or memory capability. However, Recursive Frame Integration Limited may have performance issues when single-frame SNR is really low. Recursive Adaptive Limited Frame Integration was proposed as a means to improve limited integration performance with really low single-frame SNR. It combines the benefits of nonlinear recursive limited frame integration and adaptive thresholds with a kind of conventional frame integration. Adding the third threshold may help in managing real time operations. In the paper the Recursive Frame Integration is presented in form of multiple parallel recursive integration. Such an approach can help not only in data rate management but in mitigation of low single frame SNR issue for Recursive Integration as well as in real time operations with frame integration.

  8. The uses of the refined matrix model recursion

    SciTech Connect

    Brini, Andrea; Marino, Marcos; Stevan, Sebastien

    2011-05-15

    We study matrix models in the {beta}-ensemble by building on the refined recursion relation proposed by Chekhov and Eynard. We present explicit results for the first {beta}-deformed corrections in the one-cut and the two-cut cases, as well as two applications to supersymmetric gauge theories: the calculation of superpotentials in N=1 gauge theories, and the calculation of vevs of surface operators in superconformal N=2 theories and their Liouville duals. Finally, we study the {beta}-deformation of the Chern-Simons matrix model. Our results indicate that this model does not provide an appropriate description of the {Omega}-deformed topological string on the resolved conifold, and therefore that the {beta}-deformation might provide a different generalization of topological string theory in toric Calabi-Yau backgrounds.

  9. Recursive Bayesian estimation of regularized and irregular quasar light curves

    NASA Astrophysics Data System (ADS)

    Hanif, A.; Protopapas, P.

    2015-03-01

    We investigate the efficacy of recursive Bayesian estimation of regularized and irregular astrophysical time series using particle filters to understand latent dynamics. We begin by regularizing a MACHO (massive compact halo object) quasar light curve using linear interpolation techniques. This is subsequently modelled using a variety of autoregressive and autoregressive-integrated moving average models. We find that we can learn regularized astrophysical time series using particle filters. Motivated by this result, we proceed by working on raw, irregular light curves. Accurately modelling the underlying dynamics as a continuous autoregressive stochastic process, calibrated using an MCMC we find that the scale variable, ?, is in fact first-order stable across 55 MACHO quasar light curves and thus not correlated with the black hole mass. We show that particle filters can be used to learn regularized and irregular astrophysical light curves. These results can be used to inform classification systems of stellar type and further study variability characteristics of quasars.

  10. Adaptive control of large space structures using recursive lattice filters

    NASA Technical Reports Server (NTRS)

    Sundararajan, N.; Goglia, G. L.

    1985-01-01

    The use of recursive lattice filters for identification and adaptive control of large space structures is studied. Lattice filters were used to identify the structural dynamics model of the flexible structures. This identification model is then used for adaptive control. Before the identified model and control laws are integrated, the identified model is passed through a series of validation procedures and only when the model passes these validation procedures is control engaged. This type of validation scheme prevents instability when the overall loop is closed. Another important area of research, namely that of robust controller synthesis, was investigated using frequency domain multivariable controller synthesis methods. The method uses the Linear Quadratic Guassian/Loop Transfer Recovery (LQG/LTR) approach to ensure stability against unmodeled higher frequency modes and achieves the desired performance.

  11. Adaptive control of large space structures using recursive lattice filters

    NASA Technical Reports Server (NTRS)

    Goglia, G. L.

    1985-01-01

    The use of recursive lattice filters for identification and adaptive control of large space structures was studied. Lattice filters are used widely in the areas of speech and signal processing. Herein, they are used to identify the structural dynamics model of the flexible structures. This identified model is then used for adaptive control. Before the identified model and control laws are integrated, the identified model is passed through a series of validation procedures and only when the model passes these validation procedures control is engaged. This type of validation scheme prevents instability when the overall loop is closed. The results obtained from simulation were compared to those obtained from experiments. In this regard, the flexible beam and grid apparatus at the Aerospace Control Research Lab (ACRL) of NASA Langley Research Center were used as the principal candidates for carrying out the above tasks. Another important area of research, namely that of robust controller synthesis, was investigated using frequency domain multivariable controller synthesis methods.

  12. Source localization using recursively applied and projected (RAP) MUSIC

    SciTech Connect

    Mosher, J.C.; Leahy, R.M.

    1998-03-01

    A new method for source localization is described that is based on a modification of the well known multiple signal classification (MUSIC) algorithm. In classical MUSIC, the array manifold vector is projected onto an estimate of the signal subspace, but errors in the estimate can make location of multiple sources difficult. Recursively applied and projected (RAP) MUSIC uses each successively located source to form an intermediate array gain matrix, and projects both the array manifold and the signal subspace estimate into its orthogonal complement. The MUSIC projection is then performed in this reduced subspace. Using the metric of principal angles, the authors describe a general form of the RAP-MUSIC algorithm for the case of diversely polarized sources. Through a uniform linear array simulation, the authors demonstrate the improved Monte Carlo performance of RAP-MUSIC relative to MUSIC and two other sequential subspace methods, S and IES-MUSIC.

  13. [Pharmacovigilance update].

    PubMed

    Fogarasi Szabo, Nathalie; Diezi, Léonore; Delenclos, Laurie; Renard, Delphine; Chtioui, Haithem; Rothuizen, Laura E; Buclin, Thierry; Livio, Françoise

    2015-01-14

    The main pharmacovigilance updates in 2014 are reviewed. Ivabradine: increased risk of cardiovascular death and myocardial infarction in patients with symptomatic angina treated with high dosages. Clopidogrel: rare observations of acquired hemophilia. Orlistat: may reduce the absorption of HIV antiretrovirals. Ponatinib: increased risk of arteriopathy and thrombosis. Axitinib: significant risk of heart failure (class effect). Tocilizumab: possible causal relationship with the emergence or aggravation of psoriasis. Lithium: hypercalcemia and hyperparathyroidism commonly observed. Sildenalfil: suspected causal association with melanoma, so far not proven, Methylphenidate: rare observations of priapism. St John's wort (Hypericum): reduced effectiveness of hormonal contraceptives, including implants. PMID:25799668

  14. Recursive least square vehicle mass estimation based on acceleration partition

    NASA Astrophysics Data System (ADS)

    Feng, Yuan; Xiong, Lu; Yu, Zhuoping; Qu, Tong

    2014-05-01

    Vehicle mass is an important parameter in vehicle dynamics control systems. Although many algorithms have been developed for the estimation of mass, none of them have yet taken into account the different types of resistance that occur under different conditions. This paper proposes a vehicle mass estimator. The estimator incorporates road gradient information in the longitudinal accelerometer signal, and it removes the road grade from the longitudinal dynamics of the vehicle. Then, two different recursive least square method (RLSM) schemes are proposed to estimate the driving resistance and the mass independently based on the acceleration partition under different conditions. A 6 DOF dynamic model of four In-wheel Motor Vehicle is built to assist in the design of the algorithm and in the setting of the parameters. The acceleration limits are determined to not only reduce the estimated error but also ensure enough data for the resistance estimation and mass estimation in some critical situations. The modification of the algorithm is also discussed to improve the result of the mass estimation. Experiment data on a sphalt road, plastic runway, and gravel road and on sloping roads are used to validate the estimation algorithm. The adaptability of the algorithm is improved by using data collected under several critical operating conditions. The experimental results show the error of the estimation process to be within 2.6%, which indicates that the algorithm can estimate mass with great accuracy regardless of the road surface and gradient changes and that it may be valuable in engineering applications. This paper proposes a recursive least square vehicle mass estimation method based on acceleration partition.

  15. Multiangle dynamic light scattering analysis using an improved recursion algorithm

    NASA Astrophysics Data System (ADS)

    Li, Lei; Li, Wei; Wang, Wanyan; Zeng, Xianjiang; Chen, Junyao; Du, Peng; Yang, Kecheng

    2015-10-01

    Multiangle dynamic light scattering (MDLS) compensates for the low information in a single-angle dynamic light scattering (DLS) measurement by combining the light intensity autocorrelation functions from a number of measurement angles. Reliable estimation of PSD from MDLS measurements requires accurate determination of the weighting coefficients and an appropriate inversion method. We propose the Recursion Nonnegative Phillips-Twomey (RNNPT) algorithm, which is insensitive to the noise of correlation function data, for PSD reconstruction from MDLS measurements. The procedure includes two main steps: 1) the calculation of the weighting coefficients by the recursion method, and 2) the PSD estimation through the RNNPT algorithm. And we obtained suitable regularization parameters for the algorithm by using MR-L-curve since the overall computational cost of this method is sensibly less than that of the L-curve for large problems. Furthermore, convergence behavior of the MR-L-curve method is in general superior to that of the L-curve method and the error of MR-L-curve method is monotone decreasing. First, the method was evaluated on simulated unimodal lognormal PSDs and multimodal lognormal PSDs. For comparison, reconstruction results got by a classical regularization method were included. Then, to further study the stability and sensitivity of the proposed method, all examples were analyzed using correlation function data with different levels of noise. The simulated results proved that RNNPT method yields more accurate results in the determination of PSDs from MDLS than those obtained with the classical regulation method for both unimodal and multimodal PSDs.

  16. Efficient design of two-dimensional recursive digital filters. Final report

    SciTech Connect

    Twogood, R.E.; Mitra, S.K.

    1980-01-01

    This report outlines the research progress during the period August 1978 to July 1979. This work can be divided into seven basic project areas. Project 1 deals with a comparative study of 2-D recursive and nonrecursive digital filters. The second project addresses a new design technique for 2-D half-plane recursive filters, and Projects 3 thru 5 deal with implementation issues. The sixth project presents our recent study of the applicability of array processors to 2-D digital signal processing. The final project involves our investigation into techniques for incorporating symmetry constraints on 2-D recursive filters in order to yield more efficient implementations.

  17. A Probabilistic XML Merging Tool Talel Abdessalem Mouhamadou Lamine BA Pierre Senellart

    E-print Network

    Senellart, Pierre

    A Probabilistic XML Merging Tool Talel Abdessalem Mouhamadou Lamine BA Pierre Senellart T) of the result of the merge ­Querying the probabilistic repository with a subset of the XPath query language Application domain: Wikipedia revisions The tool enables merging the revisions of a given Wikiepdia page with

  18. An XML-Based Distributed Metadata Server (DIMES) Supporting Earth Science Metadata

    E-print Network

    Wang, Xiaoyang "Sean"

    1 An XML-Based Distributed Metadata Server (DIMES) Supporting Earth Science Metadata Ruixin Yang With explosively increasing volumes of remote sensing, model and other Earth Science data available and retrieval of Earth science data. In this paper, we discuss the DIstributed MEtadata Server (DIMES) prototype

  19. Modelling vague content and structure querying in XML retrieval with a probabilistic

    E-print Network

    Lalmas, Mounia

    known in information retrieval that users of retrieval systems often find it difficult to express to capture the vagueness inher- ent to the information retrieval process. This relevance-oriented ranking uncertainty associated with the information retrieval process to allow for a relevance-oriented access to XML

  20. An interoperable XML encoding for the exchange of Spatial OLAP data cubes in SOA environments

    E-print Network

    Industrial Research Chair on Geospatial databases for Decision Support Université Laval Québec, Canada Phone Intelligence and Geo- graphic Information Systems domains. While Web Services specifications such as XML Geospatial Consortium (OGC) and International Organization for Standardization (ISO), along with Web Services

  1. A Semantic Analysis of XML Schema Matching for B2B Systems Integration

    ERIC Educational Resources Information Center

    Kim, Jaewook

    2011-01-01

    One of the most critical steps to integrating heterogeneous e-Business applications using different XML schemas is schema matching, which is known to be costly and error-prone. Many automatic schema matching approaches have been proposed, but the challenge is still daunting because of the complexity of schemas and immaturity of technologies in…

  2. Building a Web-Based Federated Simulation System with Jini and XML Xueqin Huang

    E-print Network

    Miller, John A.

    Building a Web-Based Federated Simulation System with Jini and XML Xueqin Huang John A. Miller 415 the process of building complex collaborative simulation systems, reuse of existing simulation models-Based federated simulation system, a group of simulation models residing on different machines attached

  3. Association Rule Extraction from XML Stream Data for Wireless Sensor Networks

    PubMed Central

    Paik, Juryon; Nam, Junghyun; Kim, Ung Mo; Won, Dongho

    2014-01-01

    With the advances of wireless sensor networks, they yield massive volumes of disparate, dynamic and geographically-distributed and heterogeneous data. The data mining community has attempted to extract knowledge from the huge amount of data that they generate. However, previous mining work in WSNs has focused on supporting simple relational data structures, like one table per network, while there is a need for more complex data structures. This deficiency motivates XML, which is the current de facto format for the data exchange and modeling of a wide variety of data sources over the web, to be used in WSNs in order to encourage the interchangeability of heterogeneous types of sensors and systems. However, mining XML data for WSNs has two challenging issues: one is the endless data flow; and the other is the complex tree structure. In this paper, we present several new definitions and techniques related to association rule mining over XML data streams in WSNs. To the best of our knowledge, this work provides the first approach to mining XML stream data that generates frequent tree items without any redundancy. PMID:25046017

  4. Web Ecology: Recycling HTML pages as XML documents using W4F

    E-print Network

    Pennsylvania, University of

    Web Ecology: Recycling HTML pages as XML documents using W4F Arnaud Sahuguet Department of Computer the World-Wide Web Wrapper Fac- tory (W4F), a Java toolkit to generate wrappers for Web data sources. Some by underlying databases and this proportion keeps increasing. But Web data sources also consist of stand

  5. Web Ecology: Recycling HTML pages as XML documents using W4F

    E-print Network

    Pennsylvania, University of

    Web Ecology: Recycling HTML pages as XML documents using W4F Arnaud Sahuguet Department of Computer present the World­Wide Web Wrapper Fac­ tory (W4F), a Java toolkit to generate wrappers for Web data by underlying databases and this proportion keeps increasing. But Web data sources also consist of stand

  6. The Hidden Web, XML and the Semantic Web: Scientific Data Management Perspectives

    E-print Network

    Senellart, Pierre

    , Performance Keywords Deep Web, Domain-Specific Markup Languages, Hidden Web, Multidisciplinary work than HTML pages. Much of its content lies in databases behind the Web. This content, called the hiddenThe Hidden Web, XML and the Semantic Web: Scientific Data Management Perspectives Fabian M

  7. XRL/Flower: Supporting Inter-Organizational Workflows Using XML/Petri-net Technology

    E-print Network

    van der Aalst, Wil

    XRL/Flower: Supporting Inter-Organizational Workflows Using XML/Petri-net Technology H.M.W. Verbeek. In this paper, we present the architecture of XRL/Flower. XRL/Flower is a software tool, which benefits from Changengine, Eastman, Flower, Domino Workflow, Forté Conductor, I-Flow, InConcert, MQ Series Workflow, R/3

  8. Generating Synthetic Complex-structured XML Data Ashraf Aboulnaga Jeffrey F. Naughton Chun Zhang

    E-print Network

    Aboulnaga, Ashraf

    Generating Synthetic Complex-structured XML Data Ashraf Aboulnaga Jeffrey F. Naughton Chun Zhang,naughton,czhang}@cs.wisc.edu Abstract Synthetically generated data has always been important for evaluating and understanding new ideas in database research. In this paper, we describe a data generator for generating synthetic complex

  9. XML and Bibliographic Data: The TVS (Transport, Validation and Services) Model.

    ERIC Educational Resources Information Center

    de Carvalho, Joaquim; Cordeiro, Maria Ines

    This paper discusses the role of XML in library information systems at three major levels: as are presentation language that enables the transport of bibliographic data in a way that is technologically independent and universally understood across systems and domains; as a language that enables the specification of complex validation rules…

  10. Strategic Industrial Alliances in Paper Industry: XML- vs Ontology-Based Integration Platforms

    ERIC Educational Resources Information Center

    Naumenko, Anton; Nikitin, Sergiy; Terziyan, Vagan; Zharko, Andriy

    2005-01-01

    Purpose: To identify cases related to design of ICT platforms for industrial alliances, where the use of Ontology-driven architectures based on Semantic web standards is more advantageous than application of conventional modeling together with XML standards. Design/methodology/approach: A comparative analysis of the two latest and the most obvious…

  11. The Promise and Shortcomings of XML as an Interchange Format for Computational Models of Biology

    E-print Network

    De Schutter, Erik

    is implemented consistently in every soft- ware package. The XML community has developed several schema lan for data types, procedures, or complex dependencies between elements. Therefore, the expressive power Institute of Science and Technology, Okinawa 904-0495, Japan Neuroinform (2012) 10:1­3 DOI 10.1007/s12021

  12. An XML-based document suite Dietmar Rosner and Manuela Kunze

    E-print Network

    ­ offers a formal- ism to annotate pieces of (natural language) texts. To be more precise: If a text is (as) then XML allows to associate arbitrary markup with arbitrary subsequences of contiguous char- acters. Many of our applications are domain experts (e.g. medical doctors, engineers, ...). They are interested

  13. XML3D and Xflow: combining declarative 3D for the Web with generic data flows.

    PubMed

    Klein, Felix; Sons, Kristian; Rubinstein, Dmitri; Slusallek, Philipp

    2013-01-01

    Researchers have combined XML3D, which provides declarative, interactive 3D scene descriptions based on HTML5, with Xflow, a language for declarative, high-performance data processing. The result lets Web developers combine a 3D scene graph with data flows for dynamic meshes, animations, image processing, and postprocessing. PMID:24808080

  14. XML-Based Static Type Checking and Dynamic Visualization for TCOZ

    E-print Network

    Dong, Jin Song

    XML-Based Static Type Checking and Dynamic Visualization for TCOZ Jin Song Dong, Yuan Fang Li, Jing Sun, Jun Sun, and Hai Wang School of Computing, National University of Singapore {dongjs 2495, pp. 311­322, 2002. c Springer-Verlag Berlin Heidelberg 2002 #12;312 Jin Song Dong et al

  15. Association rule extraction from XML stream data for wireless sensor networks.

    PubMed

    Paik, Juryon; Nam, Junghyun; Kim, Ung Mo; Won, Dongho

    2014-01-01

    With the advances of wireless sensor networks, they yield massive volumes of disparate, dynamic and geographically-distributed and heterogeneous data. The data mining community has attempted to extract knowledge from the huge amount of data that they generate. However, previous mining work in WSNs has focused on supporting simple relational data structures, like one table per network, while there is a need for more complex data structures. This deficiency motivates XML, which is the current de facto format for the data exchange and modeling of a wide variety of data sources over the web, to be used in WSNs in order to encourage the interchangeability of heterogeneous types of sensors and systems. However, mining XML data for WSNs has two challenging issues: one is the endless data flow; and the other is the complex tree structure. In this paper, we present several new definitions and techniques related to association rule mining over XML data streams in WSNs. To the best of our knowledge, this work provides the first approach to mining XML stream data that generates frequent tree items without any redundancy. PMID:25046017

  16. Using Web Services and XML Harvesting to Achieve a Dynamic Web Site. Computers in Small Libraries

    ERIC Educational Resources Information Center

    Roberts, Gary

    2005-01-01

    Exploiting and contextualizing free information is a natural part of library culture. In this column, Gary Roberts, the information systems and reference librarian at Herrick Library, Alfred University in Alfred, NY, describes how to use XML content on a Web site to link to hundreds of free and useful resources. He gives a general overview of the…

  17. Applying XML-Based Technologies to Developing Online Courses: The Case of a Prototype Learning Environment

    ERIC Educational Resources Information Center

    Jedrzejowicz, Joanna; Neumann, Jakub

    2007-01-01

    Purpose: This paper seeks to describe XML technologies and to show how they can be applied for developing web-based courses and supporting authors who do not have much experience with the preparation of web-based courses. Design/methodology/approach: When developing online courses the academic staff has to address the following problem--how to…

  18. Enhancing the Effectiveness of Description with Innovative Tools--The Example of MidosaXML, Germany

    ERIC Educational Resources Information Center

    Menne-Haritz, Angelika

    2005-01-01

    Online description using new Internet technologies, especially XML, is an interesting way to enhance the effectiveness and productivity of archival processing. Users and archivists benefit from the developments, making the achievement of their aims easier. The provenance-based structured presentation of finding aids can be supported with many new…

  19. Structural Joins: A Primitive for Efficient XML Query Pattern Matching Shurug Al-Khalifa

    E-print Network

    Wu, Yuqing Melanie

    tree structured relationships. The primitive tree structured re- lationships are parent-child- descendant relationship (book, author) and the parent-child relationships (book, title), (title, XML decom- posed into a set of basic parent-child and ancestor-descendantrela- tionships between pairs

  20. Finding Missing Answers due to Object Duplication in XML Keyword Search

    E-print Network

    Ling, Tok Wang

    to be related through parent-child relationships. However, if the relationship type between two object classes it is duplicated for each occurrence in the relationship. We refer such duplication as object duplication. Example 1 Consider an XML document in Figure 1 where the relationship type be- tween student and course

  1. XR-Tree: Indexing XML Data for Efficient Structural Joins Haifeng Jiang Hongjun Lu

    E-print Network

    Ooi, Beng Chin

    structural relationship, specifically parent-child or ancestor-descendant relationship, between XML element represents a parent-child relationship, for example "section/figure". To evaluate the query "paragraph the element-subelement (or parent-child) This work was conducted at the School of Computing, National Uni

  2. Efficient Processing of XML Twig Patterns with Parent Child Edges: A Look-ahead Approach

    E-print Network

    Lu, Jiaheng

    -descendant relationships below branching nodes. Further, even when queries contain parent-child relation- ship belowEfficient Processing of XML Twig Patterns with Parent Child Edges: A Look-ahead Approach Jiaheng Lu. But for queries with mixed ancestor-descendant and parent-child edges, the previous approaches still may pro- duce

  3. Efficient Evaluation of High-Selective XML Twig Patterns with Parent Child

    E-print Network

    Bhowmick, Sourav S.

    high-selective twig queries contain- ing only parent-child relationships in a tree-unaware relational of binary (parent-child and ancestor-descendant) relationships between pairs of nodes. Then, the twigEfficient Evaluation of High-Selective XML Twig Patterns with Parent Child Edges in Tree

  4. On Tree Pattern Constraints for XML Documents April Kwong and Michael Gertz

    E-print Network

    Gertz, Michael

    parent-child and sibling relationships in XML documents. For example, consider the case where it comes to the specification of complex structural relationships among patterns that go beyond admissible existing schema formalisms, such pattern relationships can only be added through either type

  5. Efficient Evaluation of Nearest Common Ancestor in XML Twig Queries Using Tree-Unaware RDBMS

    E-print Network

    Bhowmick, Sourav S.

    -twiglets having parent-child relationships. Our scheme is build on top of our SUCXENT++ system. We show significantly outperform tree-unaware approaches in evaluating struc- tural relationships in XML twig queries. In this paper, we present an efficient strat- egy to evaluate a specific class of structural relationship called

  6. XML Schema Design and Management for e-Government Data Interoperability Thomas Y. Lee1

    E-print Network

    Cheung, David Wai-lok

    the interoperability between different technical platforms, the data interoperability problem remains to be a bigXML Schema Design and Management for e-Government Data Interoperability Thomas Y. Lee1 C.T. Hon2 and data interoperability among the systems in different government agencies is a key of meeting

  7. Query Processing for Large-Scale XML Message Brokering Yanlei Diao

    E-print Network

    Diao, Yanlei

    on user-specified queries. In this dissertation, I present YFilter/ONYX, an XML brokering system. A third innovation is the design of a distributed system, called ONYX, that pushes declarative queries of extensive performance studies, demonstrating the efficiency and scalability of YFilter/ONYX under a wide

  8. Nijenhuis operator in contact homology and descendant recursion in symplectic field theory

    E-print Network

    Paolo Rossi

    2014-07-02

    In this paper we investigate the algebraic structure related to a new type of correlator associated to the moduli spaces of $S^1$-parametrized curves in contact homology and rational symplectic field theory. Such correlators are the natural generalization of the non-equivariant linearized contact homology differential (after Bourgeois-Oancea) and give rise to an invariant Nijenhuis (or hereditary) operator (\\`a la Magri-Fuchssteiner) in contact homology which recovers the descendant theory from the primaries. We also sketch how such structure generalizes to the full SFT Poisson homology algebra to a (graded symmetric) bivector. The descendant hamiltonians satisfy to recursion relations, analogous to bihamiltonian recursion, with respect to the pair formed by the natural Poisson structure in SFT and such bivector. In case the target manifold is the product stable Hamiltonian structure $S^1\\times M$, with $M$ a symplectic manifold, the recursion coincides with genus $0$ topological recursion relations in the Gromov-Witten theory of $M$.

  9. Logic and transistor circuit verification using regression testing and hierarchical recursive learning 

    E-print Network

    Shao, Li

    1996-01-01

    We describe a new approach for formal verification of combinational logic circuits, and their switch-level transistor implementation. Our approach CODibines regression testing, hierarchical recursive learning, and test generation techniques. A...

  10. Part and appearance sharing: Recursive compositional models for multi-view multi-object detection

    E-print Network

    Zhu, Long

    We propose Recursive Compositional Models (RCMs) for simultaneous multi-view multi-object detection and parsing (e.g. view estimation and determining the positions of the object subparts). We represent the set of objects ...

  11. THREE-DIMENSIONAL SIMULATIONS OF GASTRIC BIOMAGNETIC DIPOLES USING RECURSIVE LOCALIZATION ALGORITHMS

    E-print Network

    Wikswo, John

    THREE-DIMENSIONAL SIMULATIONS OF GASTRIC BIOMAGNETIC DIPOLES USING RECURSIVE LOCALIZATION University 6301 Stevenson Science Center Nashville, Tennessee, 37235, USA Biomagnetism Laboratory Department, Tennessee, 37204, USA Abstract The reconstruction of the stomach's biomagnetic field is a challenging

  12. Multi-Resolution Seismic Tomography Based on Recursive Tessellation Hierarchy

    SciTech Connect

    Simmons, N A; Myers, S C; Ramirez, A

    2009-07-01

    A 3-D global tomographic model that reconstructs velocity structure at multiple scales and incorporates laterally variable seismic discontinuities is currently being developed. The model parameterization is node-based where nodes are placed along vertices defined by triangular tessellations of a spheroidal surface. The triangular tessellation framework is hierarchical. Starting with a tetrahexahedron representing the whole globe (1st level of the hierarchy, 24 faces), they divide each triangle of the tessellation into daughter triangles. The collection of all daughter triangles comprises the 2nd level of the tessellation hierarchy and further recursion produces an arbitrary number of tessellation levels and arbitrarily fine node-spacing. They have developed an inversion procedure that takes advantage of the recursive properties of the tessellation hierarchies by progressively solving for shorter wavelength heterogeneities. In this procedure, we first perform the tomographic inversion using a tessellation level with coarse node spacing. They find that a coarse node spacing of approximately 8{sup o} is adequate to capture bulk regional properties. They then conduct the tomographic inversion on a 4{sup o} tessellation level using the residuals and inversion results from the 8{sup o} run. In practice they find that the progressive tomography approach is robust, providing an intrinsic regularization for inversion stability and avoids the issue of predefining resolution levels. Further, determining average regional properties with coarser tessellation levels enables long-wavelength heterogeneities to account for sparsely sampled regions (or regions of the mantle where longer wavelength patterns of heterogeneity suffice) while allowing shorter length-scale heterogeneities to emerge where necessary. They demonstrate the inversion approach with a set of synthetic test cases that mimic the complex nature of data arrangements (mixed-determined inversion) common to most tomographic problems. They also apply the progressive inversion approach with Pn waves traveling within the Middle East region and compare the results to simple tomographic inversions. As expected from synthetic testing, the progressive approach results in detailed structure where there is high data density and broader regional anomalies where seismic information is sparse. The ultimate goal is to use these methods to produce a seamless, multi-resolution global tomographic model with local model resolution determined by the constraints afforded by available data. They envisage this new technique as the general approach to be employed for future multi-resolution model development with complex arrangements of regional and teleseismic information.

  13. Development of the Plate Tectonics and Seismology markup languages with XML

    NASA Astrophysics Data System (ADS)

    Babaie, H.; Babaei, A.

    2003-04-01

    The Extensible Markup Language (XML) and its specifications such as the XSD Schema, allow geologists to design discipline-specific vocabularies such as Seismology Markup Language (SeismML) or Plate Tectonics Markup Language (TectML). These languages make it possible to store and interchange structured geological information over the Web. Development of a geological markup language requires mapping geological concepts, such as "Earthquake" or "Plate" into a UML object model, applying a modeling and design environment. We have selected four inter-related geological concepts: earthquake, fault, plate, and orogeny, and developed four XML Schema Definitions (XSD), that define the relationships, cardinalities, hierarchies, and semantics of these concepts. In such a geological concept model, the UML object "Earthquake" is related to one or more "Wave" objects, each arriving to a seismic station at a specific "DateTime", and relating to a specific "Epicenter" object that lies at a unique "Location". The "Earthquake" object occurs along a "Segment" of a "Fault" object, which is related to a specific "Plate" object. The "Fault" has its own associations with such things as "Bend", "Step", and "Segment", and could be of any kind (e.g., "Thrust", "Transform'). The "Plate" is related to many other objects such as "MOR", "Subduction", and "Forearc", and is associated with an "Orogeny" object that relates to "Deformation" and "Strain" and several other objects. These UML objects were mapped into XML Metadata Interchange (XMI) formats, which were then converted into four XSD Schemas. The schemas were used to create and validate the XML instance documents, and to create a relational database hosting the plate tectonics and seismological data in the Microsoft Access format. The SeismML and TectML allow seismologists and structural geologists, among others, to submit and retrieve structured geological data on the Internet. A seismologist, for example, can submit peer-reviewed and reliable data about a specific earthquake to a Java Server Page on our web site hosting the XML application. Other geologists can readily retrieve the submitted data, saved in files or special tables of the designed database, through a search engine designed with J2EE (JSP, servlet, Java Bean) and XML specifications such as XPath, XPointer, and XSLT. When extended to include all the important concepts of seismology and plate tectonics, the two markup languages will make global interchange of geological data a reality.

  14. Recursive recovery of Markov transition probabilities from boundary value data

    SciTech Connect

    Patch, S.K.

    1994-04-01

    In an effort to mathematically describe the anisotropic diffusion of infrared radiation in biological tissue Gruenbaum posed an anisotropic diffusion boundary value problem in 1989. In order to accommodate anisotropy, he discretized the temporal as well as the spatial domain. The probabilistic interpretation of the diffusion equation is retained; radiation is assumed to travel according to a random walk (of sorts). In this random walk the probabilities with which photons change direction depend upon their previous as well as present location. The forward problem gives boundary value data as a function of the Markov transition probabilities. The inverse problem requires finding the transition probabilities from boundary value data. Problems in the plane are studied carefully in this thesis. Consistency conditions amongst the data are derived. These conditions have two effects: they prohibit inversion of the forward map but permit smoothing of noisy data. Next, a recursive algorithm which yields a family of solutions to the inverse problem is detailed. This algorithm takes advantage of all independent data and generates a system of highly nonlinear algebraic equations. Pluecker-Grassmann relations are instrumental in simplifying the equations. The algorithm is used to solve the 4 {times} 4 problem. Finally, the smallest nontrivial problem in three dimensions, the 2 {times} 2 {times} 2 problem, is solved.

  15. Intervention-based multidimensional phase unwrapping using recursive orthogonal referring.

    PubMed

    Liu, Junmin; Drangova, Maria

    2012-10-01

    We present a new intervention-based phase unwrapping algorithm, which solves the inherent integration-path-dependent problem (typically resulting in streaks), by using a 2D recursive orthogonal referring (PUROR) approach. The streaks were removed by three consecutive procedures: intra-image phase unwrapping, inter-image cross-referring a "good-strip," and cross-referring line segments. The application of these procedures results in streak-free 2D phase images. The phase inconsistencies across slices in a 3D image were removed using a hybrid 3D PUROR algorithm: the two step approach involves stacking the individual slices, by using the mean phase values of each slice, then applying the 2D PUROR algorithm to reformatted 2D images that include the slice direction. The described approach was tested with in vivo multislice phase images acquired in the axial, sagittal, and coronal orientation. The results of the unwrapped phase volume recovered using the PUROR algorithm have equivalent quality to that achieved by using established methods, but the PUROR algorithm is about two orders of magnitude faster (between 1 and 5 s per 256×256 slice; independent of slice orientation and echo time). PMID:22231672

  16. Recursive dynamic programming for adaptive sequence and structure alignment.

    PubMed

    Thiele, R; Zimmer, R; Lengauer, T

    1995-01-01

    We propose a new alignment procedure that is capable of aligning protein sequences and structures in a unified manner. Recursive dynamic programming (RDP) is a hierarchical method which, on each level of the hierarchy, identifies locally optimal solutions and assembles them into partial alignments of sequences and/or structures. In contrast to classical dynamic programming, RDP can also handle alignment problems that use objective functions not obeying the principle of prefix optimality, e.g. scoring schemes derived from energy potentials of mean force. For such alignment problems, RDP aims at computing solutions that are near-optimal with respect to the involved cost function and biologically meaningful at the same time. Towards this goal, RDP maintains a dynamic balance between different factors governing alignment fitness such as evolutionary relationships and structural preferences. As in the RDP method gaps are not scored explicitly, the problematic assignment of gap cost parameters is circumvented. In order to evaluate the RDP approach we analyse whether known and accepted multiple alignments based on structural information can be reproduced with the RDP method. For this purpose, we consider the family of ferredoxins as our prime example. Our experiments show that, if properly tuned, the RDP method can outperform methods based on classical sequence alignment algorithms as well as methods that take purely structural information into account. PMID:7584462

  17. Topological recursion relations in non-equivariant cylindrical contact homology

    E-print Network

    Oliver Fabert; Paolo Rossi

    2010-12-16

    It was pointed out by Eliashberg in his ICM 2006 plenary talk that the integrable systems of rational Gromov-Witten theory very naturally appear in the rich algebraic formalism of symplectic field theory (SFT). Carefully generalizing the definition of gravitational descendants from Gromov-Witten theory to SFT, one can assign to every contact manifold a Hamiltonian system with symmetries on SFT homology and the question of its integrability arises. While we have shown how the well-known string, dilaton and divisor equations translate from Gromov-Witten theory to SFT, the next step is to show how genus-zero topological recursion translates to SFT. Compatible with the example of SFT of closed geodesics, it turns out that the corresponding localization theorem requires a non-equivariant version of SFT, which is generated by parametrized instead of unparametrized closed Reeb orbits. Since this non-equivariant version is so far only defined for cylindrical contact homology, we restrict ourselves to this special case. As an important result we show that, as in rational Gromov-Witten theory, all descendant invariants can be computed from primary invariants, i.e. without descendants.

  18. Topological recursion relations in non-equivariant cylindrical contact homology

    E-print Network

    Fabert, Oliver

    2010-01-01

    It was pointed out by Eliashberg in his ICM 2006 plenary talk that the integrable systems of rational Gromov-Witten theory very naturally appear in the rich algebraic formalism of symplectic field theory (SFT). Carefully generalizing the definition of gravitational descendants from Gromov-Witten theory to SFT, one can assign to every contact manifold a Hamiltonian system with symmetries on SFT homology and the question of its integrability arises. While we have shown how the well-known string, dilaton and divisor equations translate from Gromov-Witten theory to SFT, the next step is to show how genus-zero topological recursion translates to SFT. Compatibly with the example of SFT of closed geodesics, it turns out that the corresponding localization theorem requires a non-equivariant version of SFT, which is generated by parametrized instead of unparametrized closed Reeb orbits. Since this non-equivariant version is so far only defined for cylindrical contact homology, we restrict ourselves to this special cas...

  19. Cosmic Acceleration and Concordance from Causal Backreaction with Recursive Nonlinearities

    NASA Astrophysics Data System (ADS)

    Bochner, Brett

    2013-11-01

    We review the causal backreaction paradigm, in which the need for Dark Energy is eliminated via the generation of an apparent cosmic acceleration from the causal flow of inhomogeneity information coming in from distant structure-forming regions. The formalism detailed here incorporates the effects of "recursive nonlinearities": the process by which already-established metric perturbations will subsequently act to slow-down all future flows of inhomogeneity information. Despite such effects, we find viable cosmological models in which causal backreaction successfully serves as a replacement for Dark Energy, via the adoption of relatively large values for the dimensionless "strength" of the clustering evolution functions being modeled. These large values are justified by the hierarchical nature of clustering and virialization in the universe, which occurs on multiple cosmic length scales simultaneously; moreover, the clustering model amplitudes needed to match the apparent acceleration can be moderated via the incorporation of a model parameter representing the late-time slow-down of clustering due to astrophysical feedback processes. In summary, an alternative cosmic concordance can be achieved for a matter-only universe in which the apparent acceleration observed is generated entirely by causal backreaction effects. Lastly, considering the long-term fate of the universe, while the possibility of an "eternal" acceleration due to causal backreaction seems unlikely, this conclusion does not take into account the large-scale breakdown of cosmological isotropy in the far future, or the eventual ubiquity of gravitationally-nonlinear perturbations.

  20. Magnetic Reconnection: Recursive Current Sheet Collapse Triggered by “Ideal” Tearing

    NASA Astrophysics Data System (ADS)

    Tenerani, Anna; Velli, Marco; Rappazzo, Antonio Franco; Pucci, Fulvia

    2015-11-01

    We study, by means of MHD simulations, the onset and evolution of fast reconnection via the “ideal” tearing mode within a collapsing current sheet at high Lundquist numbers (S\\gg {10}4). We first confirm that as the collapse proceeds, fast reconnection is triggered well before a Sweet–Parker-type configuration can form: during the linear stage, plasmoids rapidly grow in a few Alfvén times when the predicted “ideal” tearing threshold S?1/3 is approached from above; after the linear phase of the initial instability, X-points collapse and reform nonlinearly. We show that these give rise to a hierarchy of tearing events repeating faster and faster on current sheets at ever smaller scales, corresponding to the triggering of “ideal” tearing at the renormalized Lundquist number. In resistive MHD, this process should end with the formation of sub-critical (S ? 104) Sweet–Parker sheets at microscopic scales. We present a simple model describing the nonlinear recursive evolution that explains the timescale of the disruption of the initial sheet.

  1. Implicit Learning of Recursive Context-Free Grammars

    PubMed Central

    Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

    2012-01-01

    Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning. PMID:23094021

  2. Recursive stochastic deconvolution in the estimation of earthquake source parameters: Synthetic waveforms

    NASA Astrophysics Data System (ADS)

    Qu, J.; Teng, T. L.

    1994-11-01

    In this paper, a method of the linear minimum mean-squares error (LMMSE) solution for source inversion is presented in terms of a recursive algorithm. A covariance matrix of estimation error, as well as a resolution matrix are also computed through recursion. It is shown that this recursive solution corresponds to a stationary Kalman filtering estimation for a linear dynamic system, which makes it possible to perform satisfactorily in an environment where complete knowledge of the relevant signal characteristics is not available. In a stationary environment, our recursive solution converges to the optimum Wiener solution. In a rather straightforward manner, the multichannel deconvolution problem is translated into a set of recursive expressions. The procedures have been tested using a number of synthetic data sets, including a point and a complex source, with satisfactory results. It is found that the solution is improved recursively with each addition of new data. We have found further that it is the error-covariance matrix, not the resolution matrix, that gives a measurement of the recursive performance. Since the recursive scheme of LMMSE runs in a manner based on either block-by-block or sample-by-sample operation, the memory requirement can be quite small. For problems involving sparse matrices, the recursive algorithm leads to fast and efficient computation. This method is tested by examining the Sierra Madre earthquake M(sub s) of 28 June 1991, California. This event is well-recorded by the broad-band TERRAscope array. The moment tensor inversion through the presented method indicates that the solution is improved recursively when new data become available. It was found that the later arrivals on the observed seismograms have very little influence on the solution while the inclusion of new data from different stations yields substantial improvement on the mechanism to a certain point where further addition of data will not make much difference to the resulting best double-couple decomposition. However, the content of double-couple components shows a striking increase from approximately 50 to 90% with the inclusion of more data from other stations. This result demonstrates clearly the robustness of our approach since the inadequacy of the source representation and the earth model in the moment-tensor inversion may be remedied by the inclusion of more data.

  3. Using XML Configuration-Driven Development to Create a Customizable Ground Data System

    NASA Technical Reports Server (NTRS)

    Nash, Brent; DeMore, Martha

    2009-01-01

    The Mission data Processing and Control Subsystem (MPCS) is being developed as a multi-mission Ground Data System with the Mars Science Laboratory (MSL) as the first fully supported mission. MPCS is a fully featured, Java-based Ground Data System (GDS) for telecommand and telemetry processing based on Configuration-Driven Development (CDD). The eXtensible Markup Language (XML) is the ideal language for CDD because it is easily readable and editable by all levels of users and is also backed by a World Wide Web Consortium (W3C) standard and numerous powerful processing tools that make it uniquely flexible. The CDD approach adopted by MPCS minimizes changes to compiled code by using XML to create a series of configuration files that provide both coarse and fine grained control over all aspects of GDS operation.

  4. Light at Night Markup Language (LANML): XML Technology for Light at Night Monitoring Data

    NASA Astrophysics Data System (ADS)

    Craine, B. L.; Craine, E. R.; Craine, E. M.; Crawford, D. L.

    2013-05-01

    Light at Night Markup Language (LANML) is a standard, based upon XML, useful in acquiring, validating, transporting, archiving and analyzing multi-dimensional light at night (LAN) datasets of any size. The LANML standard can accommodate a variety of measurement scenarios including single spot measures, static time-series, web based monitoring networks, mobile measurements, and airborne measurements. LANML is human-readable, machine-readable, and does not require a dedicated parser. In addition LANML is flexible; ensuring future extensions of the format will remain backward compatible with analysis software. The XML technology is at the heart of communicating over the internet and can be equally useful at the desktop level, making this standard particularly attractive for web based applications, educational outreach and efficient collaboration between research groups.

  5. A New Technique to Backup and Restore DBMS using XML and .NET Technologies

    E-print Network

    Kadry, Seifedine; Kassem, Hussam; Hayek, Hassan

    2011-01-01

    In this paper, we proposed a new technique for backing up and restoring different Database Management Systems (DBMS). The technique is enabling to backup and restore a part of or the whole database using a unified interface using ASP.NET and XML technologies. It presents a Web Solution allowing the administrators to do their jobs from everywhere, locally or remotely. To show the importance of our solution, we have taken two case studies, oracle 11g and SQL Server 2008.

  6. Interactive Search in XML Data Guoliang Li Jianhua Feng Lizhu Zhou

    E-print Network

    Li, Guoliang

    . In the case where the user has limited knowledge about the data, often the user feels "left in the dark" when and user-friendly query interface to access XML data in web and scientific appli- cations [4, 2, 8, 7, 5, 6 the user feels "left in the dark" when issuing queries, and has to use a try-and-see approach for finding

  7. XTCE and XML Database Evolution and Lessons from JWST, LandSat, and Constellation

    NASA Technical Reports Server (NTRS)

    Gal-Edd, Jonathan; Kreistle, Steven; Fatig. Cirtos; Jones, Ronald

    2008-01-01

    The database organizations within three different NASA projects have advanced current practices by creating database synergy between the various spacecraft life cycle stakeholders and educating users in the benefits of the Consultative Committee for Space Data Systems (CCSDS) XML Telemetry and Command Exchange (XTCE) format. The combination of XML for managing program data and CCSDS XTCE for exchange is a robust approach that will meet all user requirements using Standards and Non proprietary tools. COTS tools for XTCEKML are very wide and varied. To combine together various low cost and free tools can be more expensive in the long run than choosing a more expensive COTS tool that meets all the needs. This was especially important when deploying in 32 remote sites with no need for licenses. A common mission XTCEKML format between dissimilar systems is possible and is not difficult. Command XMLKTCE is more complex than telemetry and the use of XTCEKML metadata to describe pages and scripts is needed due to the proprietary nature of most current ground systems. Other mission and science products such as spacecraft loads, science image catalogs, and mission operation procedures can all be described with XML as well to increase there flexibility as systems evolve and change. Figure 10 is an example of a spacecraft table load. The word is out and the XTCE community is growing, The f sXt TCE user group was held in October and in addition to ESAESOC, SC02000, and CNES identified several systems based on XTCE. The second XTCE user group is scheduled for March 10, 2008 with LDMC and others joining. As the experience with XTCE grows and the user community receives the promised benefits of using XTCE and XML the interest is growing fast.

  8. WaterML: an XML Language for Communicating Water Observations Data

    NASA Astrophysics Data System (ADS)

    Maidment, D. R.; Zaslavsky, I.; Valentine, D.

    2007-12-01

    One of the great impediments to the synthesis of water information is the plethora of formats used to publish such data. Each water agency uses its own approach. XML (eXtended Markup Languages) are generalizations of Hypertext Markup Language to communicate specific kinds of information via the internet. WaterML is an XML language for water observations data - streamflow, water quality, groundwater levels, climate, precipitation and aquatic biology data, recorded at fixed, point locations as a function of time. The Hydrologic Information System project of the Consortium of Universities for the Advancement of Hydrologic Science, Inc (CUAHSI) has defined WaterML and prepared a set of web service functions called WaterOneFLow that use WaterML to provide information about observation sites, the variables measured there and the values of those measurments. WaterML has been submitted to the Open GIS Consortium for harmonization with its standards for XML languages. Academic investigators at a number of testbed locations in the WATERS network are providing data in WaterML format using WaterOneFlow web services. The USGS and other federal agencies are also working with CUAHSI to similarly provide access to their data in WaterML through WaterOneFlow services.

  9. DICOM-compatible format for analytical cytology data that can be expressed in XML

    NASA Astrophysics Data System (ADS)

    Leif, Robert C.; Leif, Suzanne B.

    2001-05-01

    Flow cytometry data can be directly mapped to the Digital Imaging and Communications in Medicine, DICOM standard. A preliminary mapping of list-mode data to the DICOM Waveform information Object will be presented. This mapping encompasses both flow and image list-mode data. Since list- mode data is also produced by digital slide microscopy, which has already been standardized under DICOM, both branches of Analytical Cytology can be united under the DICOM standard. This will result in the functionality of the present International Society for Analytical Cytology Flow Cytometry Standard, FCS, being significantly extended and the elimination of the previously reported FCS design deficiencies. Thus, the present Flow Cytometry Standard can and should be replaced by a Digital Imaging and Communications in Medicine, DICOM, standard. Expression of Analytical Cytology data in any other format, such as XML, can be made interoperable with DICOM by employing the DICOM data types. A fragment of an XML Schema has been created, which demonstrates the feasibility of expressing DICOM data types in XML syntax. The extension of DICOM to include Flow Cytometry will have the benefits of 1) retiring the present FCS, 2) providing a standard that is ubiquitous, internationally accepted, and backed by the medical profession, and 3) inter-operating with the existing medical informatics infrastructure.

  10. Multi-Layer and Recursive Neural Networks for Metagenomic Classification.

    PubMed

    Ditzler, Gregory; Polikar, Robi; Rosen, Gail

    2015-09-01

    Recent advances in machine learning, specifically in deep learning with neural networks, has made a profound impact on fields such as natural language processing, image classification, and language modeling; however, feasibility and potential benefits of the approaches to metagenomic data analysis has been largely under-explored. Deep learning exploits many layers of learning nonlinear feature representations, typically in an unsupervised fashion, and recent results have shown outstanding generalization performance on previously unseen data. Furthermore, some deep learning methods can also represent the structure in a data set. Consequently, deep learning and neural networks may prove to be an appropriate approach for metagenomic data. To determine whether such approaches are indeed appropriate for metagenomics, we experiment with two deep learning methods: i) a deep belief network, and ii) a recursive neural network, the latter of which provides a tree representing the structure of the data. We compare these approaches to the standard multi-layer perceptron, which has been well-established in the machine learning community as a powerful prediction algorithm, though its presence is largely missing in metagenomics literature. We find that traditional neural networks can be quite powerful classifiers on metagenomic data compared to baseline methods, such as random forests. On the other hand, while the deep learning approaches did not result in improvements to the classification accuracy, they do provide the ability to learn hierarchical representations of a data set that standard classification methods do not allow. Our goal in this effort is not to determine the best algorithm in terms accuracy-as that depends on the specific application-but rather to highlight the benefits and drawbacks of each of the approach we discuss and provide insight on how they can be improved for predictive metagenomic analysis. PMID:26316190

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

    PubMed

    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. PMID:26379567

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

    PubMed Central

    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. PMID:26379567

  13. Development of Updated ABsorption SIMulation Software (ABSIM)

    SciTech Connect

    Yang, Zhiyao; Tang, Xin; Qu, Ming; Abdelaziz, Omar; Gluesenkamp, Kyle R

    2014-01-01

    ABsorption SIMulation, ABSIM, was developed for the simulation of absorption systems by The Oak Ridge National Laboratory during 1980s and 1990s. ABSIM provides a platform for users to investigate various cycle configurations and working fluids, to calculate their operating parameters, to predict their performance, and to compare them with each other on a uniform basis. ABSIM is indeed a very useful and accurate tool for researchers to investigate various absorption systems. However, it has not been well maintained: it is incompatible with recent operating systems; the interface needs improved user-friendliness, and the system needs better parameter setting and debugging tools to help achieve convergence. Therefore, it is highly needed to update and improve ABSIM. The paper presents recent efforts to improve ABSIM s compatibility with current operating systems, user interface, and analysis capabilities. The paper details the features and functions of the newly updated ABSIM software. The new ABSIM still uses the previously validated calculation engine of the old ABSIM. The new graphic user interfaces (GUI) were developed in Qt, which is an open source license GUI software based on C++. XML was used as the database for data storage in the new ABSIM. The new ABSIM has been designed to be easily learned and used. It has enhanced editing and construction functions, plus enhanced analysis features including parametric tables, plotting, property plots, and master panels for debugging. A single effect water/LiBr absorption system is used as a case study in this paper to illustrate the features, capabilities, and functions of the new ABSIM. This case study was actually an example system available in the old ABSIM. The new version of ABSIM will be continuously developed to include additional subroutines for the components in liquid desiccant systems. The new ABSIM will be available to public for free. The ultimate goal of the new ABSIM is to allow it to become a simulation platform for both absorption heat pump and liquid desiccant systems.

  14. Extended recursion in operator space (EROS), a new impurity solver for the single impurity Anderson model

    SciTech Connect

    Albers, Robert C; Julien, Jean P

    2008-01-01

    We have developed a new efficient and accurate impurity solver for the single impurity Anderson model (SIAM), which is based on a non-perturbative recursion technique in a space of operators and involves expanding the self-energy as a continued fraction. The method has no special occupation number or temperature restrictions; the only approximation is the number of levels of the continued fraction retained in the expansion. We also show how this approach can be used as a new approach to Dynamical Mean Field Theory (DMTF) and illustrate this with the Hubbard model. The three lowest orders of recursion give the Hartree-Fock, Hubbard I, and Hubbard III approximations. A higher level of recursion is able to reproduce the expected 3-peak structure in the spectral function and Fermi liquid behavior.

  15. Recursive generation of one-loop amplitudes in the Standard Model

    NASA Astrophysics Data System (ADS)

    Actis, S.; Denner, A.; Hofer, L.; Scharf, A.; Uccirati, S.

    2013-04-01

    We introduce the computer code Recola for the recursive generation of tree-level and one-loop amplitudes in the Standard Model. Tree-level amplitudes are constructed using off-shell currents instead of Feynman diagrams as basic building blocks. One-loop amplitudes are represented as linear combinations of tensor integrals whose coefficients are calculated similarly to the tree-level amplitudes by recursive construction of loop off-shell currents. We introduce a novel algorithm for the treatment of colour, assigning a colour structure to each off-shell current which enables us to recursively construct the colour structure of the amplitude efficiently. Recola is interfaced with a tensor-integral library and provides complete one-loop Standard Model amplitudes including rational terms and counterterms. As a first application we consider Z + 2 jets production at the LHC and calculate with Recola the next-to-leading-order electroweak corrections to the dominant partonic channels.

  16. Recursion operators and bi-Hamiltonian structure of the general heavenly equation

    E-print Network

    Sheftel, M B; Yaz?c?, D

    2015-01-01

    We discover two additional Lax pairs and three nonlocal recursion operators for symmetries of the general heavenly equation introduced by Doubrov and Ferapontov. Converting the equation to a two-component form, we obtain Lagrangian and Hamiltonian structures of the two-component general heavenly system. We study all point symmetries of the two-component system and, using the inverse Noether theorem in the Hamiltonian form, obtain all the integrals of motion corresponding to each variational (Noether) symmetry. We discover that all the recursion operators coincide in the two-component form. Applying the recursion operator to the first Hamiltonian structure we obtain second Hamiltonian structure. We prove the Jacobi identities for the second Hamiltonian operator and compatibility of the two Hamiltonian structures. Thus, we demonstrate that the general heavenly equation in the two-component form is a bi-Hamiltonian system integrable in the sense of Magri. We demonstrate how to obtain nonlocal Hamiltonian flows g...

  17. Methods for assessing movement path recursion with application to African buffalo in South Africa

    USGS Publications Warehouse

    Bar-David, S.; Bar-David, I.; Cross, P.C.; Ryan, S.J.; Knechtel, C.U.; Getz, W.M.

    2009-01-01

    Recent developments of automated methods for monitoring animal movement, e.g., global positioning systems (GPS) technology, yield high-resolution spatiotemporal data. To gain insights into the processes creating movement patterns, we present two new techniques for extracting information from these data on repeated visits to a particular site or patch ("recursions"). Identification of such patches and quantification of recursion pathways, when combined with patch-related ecological data, should contribute to our understanding of the habitat requirements of large herbivores, of factors governing their space-use patterns, and their interactions with the ecosystem. We begin by presenting output from a simple spatial model that simulates movements of large-herbivore groups based on minimal parameters: resource availability and rates of resource recovery after a local depletion. We then present the details of our new techniques of analyses (recursion analysis and circle analysis) and apply them to data generated by our model, as well as two sets of empirical data on movements of African buffalo (Syncerus coffer): the first collected in Klaserie Private Nature Reserve and the second in Kruger National Park, South Africa. Our recursion analyses of model outputs provide us with a basis for inferring aspects of the processes governing the production of buffalo recursion patterns, particularly the potential influence of resource recovery rate. Although the focus of our simulations was a comparison of movement patterns produced by different resource recovery rates, we conclude our paper with a comprehensive discussion of how recursion analyses can be used when appropriate ecological data are available to elucidate various factors influencing movement. Inter alia, these include the various limiting and preferred resources, parasites, and topographical and landscape factors. ?? 2009 by the Ecological Society of America.

  18. The early acquisition of viable knowledge: A use of recursive model as an analytical devise (methodolosocial).

    PubMed

    Karstadt, Lyn; Thomas, Keith Robert; Abed, Shaymaa N

    2016-01-01

    In nurse education typically, information is presented to students within the classroom and then applied within a clinical situation. Acquisition of the knowledge required to inform the student's early practice is the focus of this research. This paper centres upon the construction of a cognitive model that is recursive in nature, and forms an integral part of a qualitative research study. The primary study investigated how first year student nurses use the information received in the classroom to underpin their early practice. Data were collected from 10 students and 4 of their lecturers, via blogs and interviews and used iteratively to create a model that is recursive in nature. Recursion is a process of repeatedly revisiting the same thing, in this case the data, which are considered in an iterative or progressive way. Recursion thus facilitated the development of a model, which was seen to change and develop in sophistication as more data were considered and evaluated. Visual devices were used throughout to bring clarity during the construction of the model. This visual process was pivotal to the analysis. This paper chronicles the development of an analytical device through the medium of the study presented. Viable knowledge is represented as the synthesis of concepts, as presented in the classroom, and practice, as experienced within the clinical area. It illustrates how conceptual material delivered within the classroom has become embedded within an individual student's consciousness and is used during a clinical placement to make sense of a specific situation. The study identifies how students use information and makes recommendations as to how appropriate curricula integrate all the facets of the recursive model. The process of recursive modelling is thus offered as an analytical devise, which may be applied by researchers to other qualitative data. PMID:26586185

  19. Modification of an amplification reaction in recursively dynamic compartments driven by stirring.

    PubMed

    Ichii, Tetsuo; Tanahashi, Genya; Suzuki, Hiroaki; Yomo, Tetsuya

    2013-12-17

    In living systems, biochemical reactions are confined to cellular or subcellular compartments, such as the plasma membrane and the organelles within a cell. These biological compartments are usually subjected to recursive changes, such as combinations of growth, fusion, and division, to constitute repeating cell cycles. In such recursively dynamic compartments, the encapsulated biochemical reaction may exhibit dynamics that differ from those of the static compartment (i.e., test tubes) used in conventional biochemistry experiments. To test this hypothesis in a simplified model, we mechanically stirred femtoliter-sized water-in-oil emulsion droplets so that individual droplets were subjected to repeated coalescence and breakage. We show that recursive dynamics appeared in the emulsion, which were measured by the exponential propagation of a water-soluble dye. The rate of the propagation, ?, was controlled by modulating the pulse-width of stirring in an electromagnetic stirrer. Within this system, we studied the dynamics of an RNA-amplification reaction in recursively increasing reaction compartments at various values of ?. We showed that there was an optimal value of ? that maximized RNA amplification. This effect was explained by the balance between the opposing effects of supply of substrate and the dilution of amplified RNA both resulting from coalescence. Moreover, when we mixed two RNA species with different kinetic properties, we found a preferential amplification for one of the species only in the recursively dynamic emulsion. This effect was partly explained by a separation effect which preferentially amplifies the number of compartments for the molecular specie that can better follow the breakage dynamics of the compartments. The present work demonstrated how the recursive dynamics of compartments modifies the internal biochemical reaction. PMID:24219119

  20. Methods for assessing movement path recursion with application to African buffalo in South Africa

    PubMed Central

    Bar-David, Shirli; Bar-David, Israel; Cross, Paul C.; Ryan, Sadie J.; Knechtel, Christiane U.; Getz, Wayne M.

    2011-01-01

    Recent developments of automated methods for monitoring animal movement, e.g., global positioning systems (GPS) technology, yield high-resolution spatiotemporal data. To gain insights into the processes creating movement patterns, we present two new techniques for extracting information from these data on repeated visits to a particular site or patch (“recursions”). Identification of such patches and quantification of recursion pathways, when combined with patch-related ecological data, should contribute to our understanding of the habitat requirements of large herbivores, of factors governing their space-use patterns, and their interactions with the ecosystem. We begin by presenting output from a simple spatial model that simulates movements of large-herbivore groups based on minimal parameters: resource availability and rates of resource recovery after a local depletion. We then present the details of our new techniques of analyses (recursion analysis and circle analysis) and apply them to data generated by our model, as well as two sets of empirical data on movements of African buffalo (Syncerus caffer): the first collected in Klaserie Private Nature Reserve and the second in Kruger National Park, South Africa. Our recursion analyses of model outputs provide us with a basis for inferring aspects of the processes governing the production of buffalo recursion patterns, particularly the potential influence of resource recovery rate. Although the focus of our simulations was a comparison of movement patterns produced by different resource recovery rates, we conclude our paper with a comprehensive discussion of how recursion analyses can be used when appropriate ecological data are available to elucidate various factors influencing movement. Inter alia, these include the various limiting and preferred resources, parasites, and topographical and landscape factors. PMID:19769125

  1. Application of Bayesian recursive estimation for seismic signal processing

    NASA Astrophysics Data System (ADS)

    Baziw, Erick

    2007-12-01

    Bayesian recursive estimation (BRE) requires that the posterior density function be estimated so that conditional mean estimates of desired parameters or states can be obtained. BRE has been referred to as a complete solution to the estimation problem since the posterior density function embodies all available statistical information (i.e., prior, likelihood and evidence). Until recent advances in BRE, most applications required that the system and measurement equations be linear, and that the process and measurement noise be Gaussian and white. A Kalman filter, KF, (closed form solution to the BRE) could be applied to systems that met these conditions. Previous applications of the KF to solve seismic signal processing problems (e.g., deconvolution) have had very limited success and acceptability in the geophysics signal processing community due to the restrictive nature of the KF. The recently new BRE development of sequential Monte Carlo (SMC) techniques for numerically solving non-stationary and non-linear problems has generated considerable interest and active research within the last decade. This thesis focuses upon the implementation of SMC techniques (e.g., particle filtering) for solving seismic signal processing problems. All the associated filters of BRE (hidden Markov model filter, KF, particle filter, Rao-Blackwellised particle filter, and jump Markov systems) and a new and highly robust and unique model of the seismic source wavelet are implemented in two innovative algorithms for solving the important problems of passive seismic event detection and blind seismic deconvolution. A ground-breaking concept in blind seismic deconvolution referred to as principle phase decomposition (PPD) is outlined and evaluated in this thesis. The PPD technique estimates and separates overlapping source wavelets instead of estimating high bandwidth reflection coefficients. It is shown that one can then easily generate reflection coefficients from the separated source wavelets. In this thesis many advantages of the PPD are outlined. Simulated seismogram data with low signal-to-noise ratios is blindly deconvolved where non-stationary, mixed-phase, and zero-phase source wavelets are present. I believe that there are currently no existing blind seismic deconvolution techniques which could obtain comparable performance results of the PPD technique. The work in this thesis has resulted in three IEEE publications and one peer reviewed conference publication.

  2. Recursive analytical solution describing artificial satellite motion perturbed by an arbitrary number of zonal terms

    NASA Technical Reports Server (NTRS)

    Mueller, A. C.

    1977-01-01

    An analytical first order solution has been developed which describes the motion of an artificial satellite perturbed by an arbitrary number of zonal harmonics of the geopotential. A set of recursive relations for the solution, which was deduced from recursive relations of the geopotential, was derived. The method of solution is based on Von-Zeipel's technique applied to a canonical set of two-body elements in the extended phase space which incorporates the true anomaly as a canonical element. The elements are of Poincare type, that is, they are regular for vanishing eccentricities and inclinations. Numerical results show that this solution is accurate to within a few meters after 500 revolutions.

  3. Backlund-Transformation-Related Recursion Operators: Application to the Self-Dual Yang-Mills Equation

    E-print Network

    C. J. Papachristou; B. Kent Harrison

    2009-06-20

    By using the self-dual Yang-Mills (SDYM) equation as an example, we study a method for relating symmetries and recursion operators of two partial differential equations connected to each other by a non-auto-Backlund transformation. We prove the Lie-algebra isomorphism between the symmetries of the SDYM equation and those of the potential SDYM (PSDYM) equation, and we describe the construction of the recursion operators for these two systems. Using certain known aspects of the PSDYM symmetry algebra, we draw conclusions regarding the Lie algebraic structure of the "potential symmetries" of the SDYM equation.

  4. Recursive surface impedance matrix methods for ultrasonic wave propagation in piezoelectric multilayers.

    PubMed

    Collet, B

    2004-04-01

    Two recursive surface impedance methods are described for acoustic wave propagation in multilayered piezoelectric structures. Both methods have the advantage of conceptual simplicity and flexibility brought about by the transfer matrix method. Moreover they do not have a priori computational limitations with respect to the total number of layers of the stratified structure nor with respect to the thickness of individual layers; nor is the computational stability limited by the frequency range. For both methods, numerical simulations were carried out in order to illustrate their performances and robustness when combined with suitable recursive numerical algorithms. PMID:15047285

  5. Development of a Bayesian recursive algorithm to find free-spaces for an intelligent wheelchair.

    PubMed

    Nguyen, Anh V; Su, Steven; Nguyen, Hung T

    2011-01-01

    This paper introduces a new shared control strategy for an intelligent wheelchair using a Bayesian recursive algorithm. Using the local environment information gathered by a laser range finder sensor and commands acquired through a user interface, a Bayesian recursive algorithm has been developed to find the most appropriate free-space, which corresponds to the highest posterior probability value. Then, an autonomous navigation algorithm will assist to manoeuvre the wheelchair in the chosen free-space. Experiment results demonstrate that the new method provides excellent performance with great flexibility and fast response. PMID:22256012

  6. Fast and stable recursive algorithms for continuous-time and discrete-time model conversions

    NASA Technical Reports Server (NTRS)

    Shieh, L. S.; Lian, S. R.; Park, C. B.; Coleman, N. P.

    1987-01-01

    Based on the Newton-Raphson method, this paper presents recursive algorithms that are rapidly convergent and more stable for modeling the equivalent continuous-time (discrete-time) model from the available discrete-time (continuous-time) model for a fixed sampling period. The newly developed recursive algorithms relax the constraints imposed upon the existing model conversion algorithms, and, thus, enhance the applications of microprocessors and associated microelectronics to digital control systems. A practical example is presented to demonstrate the effectiveness of the proposed procedures.

  7. Windows Update Page 1 of 4 Windows Update

    E-print Network

    Chin, Wei Ngan

    , or you can set Windows to automatically download updates, and then notify you so you can install themWindows Update Page 1 of 4 Windows Update #12;Windows Update Page 2 of 4 A. Introduction Windows Update is a service provided by Microsoft which provides

  8. XML&CORBA-based distributed system for information integration and dissemination in multimedia neuroimaging applications

    NASA Astrophysics Data System (ADS)

    Cao, Xinhua; Wong, Stephen T. C.; Hoo, Kent S., Jr.; Ching, Wan; Hawkins, Randall A.; Dillon, William P.

    2002-05-01

    Medical information systems based in different hospital departments face tremendous difficulty in information exchange and dissemination due to the multitudes of hardware and software platforms running these systems. In this paper, we describe a distributed information system for integrating various hospital systems in supporting clinical neuroimaging research and epilepsy surgical planning. Our distributed information system uses a three-tiered architecture consists of a user-interface tier, application logic tier and data store tier. Two system implementations based on this software architecture but using different integration technologies were developed and are discussed in this paper: the XML (extensible Mark Up Language)-based implementation and the CORBA (Common Object Request Broker Architecture)-based implementation. In the XML-based implementation, application logic tier communicates with user-interface tier and data store tier using HTTP and XML for data exchange. For the data exchange in CORBA-based implementation, the middleware uses IIOP (Internet inter-ORB protocol) to call CORBA objects in the data store tier then to return the results to the user-interface tier. For the user-interface tier of either implementation, the Web browsers are served as clients to invoke application components or agents in the middleware. The application of the proposed distributed system allows clinical users to access, search and retrieve the multimedia information in any underlying computer systems with commonly used Web browsers. Preliminary results show that the system is effective for information integration and data sharing among the different departmental systems in the hospital for neuroimaging applications.

  9. Lapin Data Interchange Among Database, Analysis and Display Programs Using XML-Based Text Files

    NASA Technical Reports Server (NTRS)

    2005-01-01

    The purpose of grant NCC3-966 was to investigate and evaluate the interchange of application-specific data among multiple programs each carrying out part of the analysis and design task. This has been carried out previously by creating a custom program to read data produced by one application and then write that data to a file whose format is specific to the second application that needs all or part of that data. In this investigation, data of interest is described using the XML markup language that allows the data to be stored in a text-string. Software to transform output data of a task into an XML-string and software to read an XML string and extract all or a portion of the data needed for another application is used to link two independent applications together as part of an overall design effort. This approach was initially used with a standard analysis program, Lapin, along with standard applications a standard spreadsheet program, a relational database program, and a conventional dialog and display program to demonstrate the successful sharing of data among independent programs. Most of the effort beyond that demonstration has been concentrated on the inclusion of more complex display programs. Specifically, a custom-written windowing program organized around dialogs to control the interactions have been combined with an independent CAD program (Open Cascade) that supports sophisticated display of CAD elements such as lines, spline curves, and surfaces and turbine-blade data produced by an independent blade design program (UD0300).

  10. Lapin Data Interchange Among Database, Analysis and Display Programs Using XML-Based Text Files

    NASA Technical Reports Server (NTRS)

    2004-01-01

    The purpose was to investigate and evaluate the interchange of application- specific data among multiple programs each carrying out part of the analysis and design task. This has been carried out previously by creating a custom program to read data produced by one application and then write that data to a file whose format is specific to the second application that needs all or part of that data. In this investigation, data of interest is described using the XML markup language that allows the data to be stored in a text-string. Software to transform output data of a task into an XML-string and software to read an XML string and extract all or a portion of the data needed for another application is used to link two independent applications together as part of an overall design effort. This approach was initially used with a standard analysis program, Lapin, along with standard applications a standard spreadsheet program, a relational database program, and a conventional dialog and display program to demonstrate the successful sharing of data among independent programs. See Engineering Analysis Using a Web-Based Protocol by J.D. Schoeffler and R.W. Claus, NASA TM-2002-211981, October 2002. Most of the effort beyond that demonstration has been concentrated on the inclusion of more complex display programs. Specifically, a custom-written windowing program organized around dialogs to control the interactions have been combined with an independent CAD program (Open Cascade) that supports sophisticated display of CAD elements such as lines, spline curves, and surfaces and turbine-blade data produced by an independent blade design program (UD0300).

  11. Applying an XML Warehouse to Social Network Analysis, Lessons from the WebStand Project

    E-print Network

    Nguyen, Benjamin; Dudouet, Francois-Xavier; Saint-Ghislain, Loic

    2009-01-01

    In this paper we present the state of advancement of the French ANR WebStand project. The objective of this project is to construct a customizable XML based warehouse platform to acquire, transform, analyze, store, query and export data from the web, in particular mailing lists, with the final intension of using this data to perform sociological studies focused on social groups of World Wide Web, with a specific emphasis on the temporal aspects of this data. We are currently using this system to analyze the standardization process of the W3C, through its social network of standard setters.

  12. Recursive Frame Analysis: Reflections on the Development of a Qualitative Research Method

    ERIC Educational Resources Information Center

    Keeney, Hillary; Keeney, Bradford

    2012-01-01

    The origin of recursive frame analysis (RFA) is revisited and discussed as a postmodern alternative to modernist therapeutic models and research methods that foster hegemony of a preferred therapeutic metaphor, narrative, or strategy. It encourages improvisational performance while enabling a means of scoring the change and movement of the…

  13. CSE 2315 -Discrete Structures Exam 1: Formal Logic, Proofs, and Recursion CSE 2315 -Discrete Structures

    E-print Network

    Huber, Manfred

    - Discrete Structures Exam 1: Formal Logic, Proofs, and Recursion O(x, y) is "x owns y" p is "Pluto" j is "John" to translate the following argument into predicate logic. ( 5 points ) John likes his dog Pluto and if Pluto owns a bone, Pluto eats it. All dogs like bones. Only if Pluto owns a bone does he like bones

  14. A METHOD FOR DETERMINING THE MOD2 k BEHAVIOUR OF RECURSIVE SEQUENCES, WITH APPLICATIONS TO SUBGROUP

    E-print Network

    Krattenthaler, Christian

    the behaviour of Catalan numbers Cat n modulo 64 can be compactly written in the form # # n=0 Cat n z n = 32z 5A METHOD FOR DETERMINING THE MOD­2 k BEHAVIOUR OF RECURSIVE SEQUENCES, WITH APPLICATIONS at obtaining congruences modulo higher prime powers was made in [29], where the behaviour of subgroup numbers

  15. Reasoning on a semantics of higher-order states using guarded recursion and forcing

    E-print Network

    Hyvernat, Pierre

    Reasoning on a semantics of higher-order states using guarded recursion and forcing Guilhem Jaber, ...) How to define a logic to reason about this semantics ? Extension of LSLR and LADR. How to prove its, 2011 2 / 27 #12;1 The Semantics: Realizability, Step-indexing and Worlds 2 A Logic to Reason about

  16. RECURSIVE FUNCTIONS P0R COMPUTATION OF NATURAL SECRET Jouko J. Sepp~nen

    E-print Network

    RECURSIVE FUNCTIONS P0R COMPUTATION OF NATURAL SECRET LANGUAGES Jouko J. Sepp~nen TeKoLa Computing types of natural secret languages such as Pig Latin etc. By a natural secret language, sometimes called- lore. As cryptological methods the natural secret l~age - 251 - #12;transformations are fairly simple

  17. COMPUTATIONAL AND APPLIED MATHEMATICS A Recursive Expanding Domain Method for the Solution of

    E-print Network

    Ferguson, Thomas S.

    UCLA COMPUTATIONAL AND APPLIED MATHEMATICS A Recursive Expanding Domain Method for the Solution of Laplace's Equation In Infinite Domains Christopher R. Anderson April 2014 CAM Report 14-45 Department of Mathematics University of California, Los Angeles Los Angeles, CA. 90095-1555 #12;Abstract In this paper we

  18. User's Guide for the Precision Recursive Estimator for Ephemeris Refinement (PREFER)

    NASA Technical Reports Server (NTRS)

    Gibbs, B. P.

    1982-01-01

    PREFER is a recursive orbit determination program which is used to refine the ephemerides produced by a batch least squares program (e.g., GTDS). It is intended to be used primarily with GTDS and, thus, is compatible with some of the GTDS input/output files.

  19. Recursive Blocked Algorithms for Solving Triangular Systems--Part II: Two-Sided

    E-print Network

    Kågström, Bo

    variable blocking, which has the potential of matching the memory hierarchies of today's high by the Swedish Research Council under grants TFR 98-604 and VR 621-2001-3284. Authors' address: Department systems with multilevel memory hierarchies. The hier- archical recursive blocking promotes good data

  20. Recursive subspace identification for in-flight modal analy-sis of airplanes

    E-print Network

    Recursive subspace identification for in-flight modal analy- sis of airplanes Katrien De Cock1 tool in this experimental modal analysis. A linear model for the airplane is estimated based-line tracking of the modal parameters of the airplane. At every time instant, the estimates of the parameters

  1. Split-remerge method for eliminating processing window artifacts in recursive hierarchical segmentation

    NASA Technical Reports Server (NTRS)

    Tilton, James C. (Inventor)

    2010-01-01

    A method, computer readable storage, and apparatus for implementing recursive segmentation of data with spatial characteristics into regions including splitting-remerging of pixels with contagious region designations and a user controlled parameter for providing a preference for merging adjacent regions to eliminate window artifacts.

  2. Y I ANN I S N . MOSCHOVAK I S THE LOGIC OF FUNCTIONAL RECURSION

    E-print Network

    Moschovakis, Yiannis N.

    , and it is formal­ ized in the Formal (or Functional) Language of Recursion FLR introduced During the preparation S in [5]. It is possible (and useful) to think of FLR as a very abstract program­ ming language, rich of this paper are: first, the introduction of a new class of least­fixed­point interpretations for FLR (and

  3. Recursive Trees for Practical ORAM Tarik Moataz1, Erik-Oliver Blass2 Guevara Noubir2

    E-print Network

    International Association for Cryptologic Research (IACR)

    Recursive Trees for Practical ORAM Tarik Moataz1, Erik-Oliver Blass2 Guevara Noubir2 1 Dept|noubir}@ccs.neu.edu Abstract--We present a general construction to reduce the communication cost of recent tree-based ORAMs. Contrary to trees with constant height and path lengths, our new construction r-ORAM provides varying

  4. Predicting Physical-Chemical Properties of Compounds from Molecular Structures by Recursive Neural Networks

    E-print Network

    Sperduti, Alessandro

    Predicting Physical-Chemical Properties of Compounds from Molecular Structures by Recursive Neural of a recently developed neural network for structures applied to the prediction of physical chemical properties. INTRODUCTION To predict the physical-chemical properties of com- pounds, starting from the molecular structure

  5. Disturbance Term Regression Test Procedures for Recursive and Nonrecursive Models: Solution from Intercorrelation Matrices.

    ERIC Educational Resources Information Center

    Lance, Charles E.

    1986-01-01

    The logic and procedures underlying a disturbance term regression test of logical consistency for structural models are reviewed for recursive and nonrecursive designs. It is shown that in a simple three-variable, complete mediational case the test procedure is mathematically equivalent to a part correlation. (Author/LMO)

  6. Recursive Compositional Models for Vision: description and review of recent work

    E-print Network

    Yuille, Alan L.

    structures following a design principle of recursive composition. Probabilities are defined over , Yuanhao Chen 1 , and Alan Yuille 1,2 , 1 Department of Statistics University of California at Los Angeles structures are represented in a hierarchical form where complex structures are composed of more elementary

  7. The recursive maximum likelihood proportion estimator: User's guide and test results

    NASA Technical Reports Server (NTRS)

    Vanrooy, D. L.

    1976-01-01

    Implementation of the recursive maximum likelihood proportion estimator is described. A user's guide to programs as they currently exist on the IBM 360/67 at LARS, Purdue is included, and test results on LANDSAT data are described. On Hill County data, the algorithm yields results comparable to the standard maximum likelihood proportion estimator.

  8. Improved bounds for the randomized decision tree complexity of recursive majority

    E-print Network

    Tardos, Gábor

    Improved bounds for the randomized decision tree complexity of recursive majority Fr for the two-sided-error randomized decision tree complexity of evaluating height h formulae with error [0, 1 zero-error randomized decision tree algorithm that has complexity at most (1.007) · 2.64944h

  9. The Recursive NanoBox Processor Grid: A Reliable System Architecture for Unreliable Nanotechnology Devices

    E-print Network

    Minnesota, University of

    The Recursive NanoBox Processor Grid: A Reliable System Architecture for Unreliable Nanotechnology, Minneapolis, MN 55455 Telephone: 612-625-5007 Fax: 612-625-4583 Abstract Advanced molecular nanotechnology designed for fabrication with unreliable nanotechnology devices. This architecture is composed of many

  10. Identification of the Givental Formula with the Spectral Curve Topological Recursion Procedure

    NASA Astrophysics Data System (ADS)

    Dunin-Barkowski, P.; Orantin, N.; Shadrin, S.; Spitz, L.

    2014-06-01

    We identify the Givental formula for the ancestor formal Gromov-Witten potential with a version of the topological recursion procedure for a collection of isolated local germs of the spectral curve. As an application we prove a conjecture of Norbury and Scott on the reconstruction of the stationary sector of the Gromov-Witten potential of via a particular spectral curve.

  11. Recursive Position Estimation in Sensor Networks Joe Albowicz, Alvin Chen, Lixia Zhang

    E-print Network

    California at Los Angeles, University of

    Recursive Position Estimation in Sensor Networks Joe Albowicz, Alvin Chen, Lixia Zhang UCLA a framework for extending position estimation throughout a sensor network. Given imprecise ranging and inter estimated positions join the reference set, capitalizing on the massive scale of sensor networks. The system

  12. Recursive Total Least Squares: An Alternative to the Discrete Kalman Filter

    E-print Network

    Boley, Daniel

    Recursive Total Least Squares: An Alternative to the Discrete Kalman Filter Daniel L. Boley The discrete Kalman lter, which is becoming a common tool for reducing uncertainty in robot navigation, su ers total least squares estimator (RTLS) as an alternative to the Kalman lter, and compare

  13. A Tail-Recursive Semantics for Stack Inspections John Clements, Matthias Felleisen

    E-print Network

    Strickland, Stevie

    A Tail-Recursive Semantics for Stack Inspections John Clements, Matthias Felleisen Northeastern inspection is incompatible with a global tail call optimization pol- icy. An implementation of such a language may have to allocate memory for a source-code tail call, and a program that uses only tail calls

  14. Use of XML and Java for collaborative petroleum reservoir modeling on the Internet

    USGS Publications Warehouse

    Victorine, J.; Watney, W.L.; Bhattacharya, S.

    2005-01-01

    The GEMINI (Geo-Engineering Modeling through INternet Informatics) is a public-domain, web-based freeware that is made up of an integrated suite of 14 Java-based software tools to accomplish on-line, real-time geologic and engineering reservoir modeling. GEMINI facilitates distant collaborations for small company and academic clients, negotiating analyses of both single and multiple wells. The system operates on a single server and an enterprise database. External data sets must be uploaded into this database. Feedback from GEMINI users provided the impetus to develop Stand Alone Web Start Applications of GEMINI modules that reside in and operate from the user's PC. In this version, the GEMINI modules run as applets, which may reside in local user PCs, on the server, or Java Web Start. In this enhanced version, XML-based data handling procedures are used to access data from remote and local databases and save results for later access and analyses. The XML data handling process also integrates different stand-alone GEMINI modules enabling the user(s) to access multiple databases. It provides flexibility to the user to customize analytical approach, database location, and level of collaboration. An example integrated field-study using GEMINI modules and Stand Alone Web Start Applications is provided to demonstrate the versatile applicability of this freeware for cost-effective reservoir modeling. ?? 2005 Elsevier Ltd. All rights reserved.

  15. Climate Action Plan 2013 Update

    E-print Network

    Rose, Michael R.

    UC Irvine Climate Action Plan 2013 Update #12;CLIMATE ACTION PLAN - 2013 UPDATE 1 TABLE OF CONTENTS CLIMATE PROTECTION GOALS...............................................................18 OPPORTUNITIES-2050 CLIMATE NEUTRALITY.........................................................29 MEDICALCENTER IMPLEMENTATION

  16. Infinitely many local higher symmetries without recursion operator or master symmetry: integrability of the Foursov--Burgers system revisited

    E-print Network

    Artur Sergyeyev

    2009-01-19

    We consider the Burgers-type system studied by Foursov, w_t &=& w_{xx} + 8 w w_x + (2-4\\alpha)z z_x, z_t &=& (1-2\\alpha)z_{xx} - 4\\alpha z w_x + (4-8\\alpha)w z_x - (4+8\\alpha)w^2 z + (-2+4\\alpha)z^3, (*) for which no recursion operator or master symmetry was known so far, and prove that the system (*) admits infinitely many local generalized symmetries that are constructed using a nonlocal {\\em two-term} recursion relation rather than from a recursion operator.

  17. BiSON Update

    NASA Astrophysics Data System (ADS)

    Allison, J.; Barnes, I.; Broomhall, A.-M.; Chaplin, W.; Davies, G.; Elsworth, Y.; Hale, S.; Jackson, B.; Miller, B.; New, R.; Fletcher, S.

    2009-12-01

    We present an update on the operation of the Birmingham Solar Oscillations Network (BiSON) network including our various running statistics such as duty cycle. We also give an update regarding our status and briefly outline the foreseeable future of the network.

  18. Country Update: Israel 2005

    ERIC Educational Resources Information Center

    Marar, Marianne Maurice

    2005-01-01

    Country Updates is a new section of "Intercultural Education." Starting in "Intercultural Education," Volume 16 No. 5, this column will focus on recent developments during the last two to three years in the field of intercultural education in one particular country. These updates can include recent policy decisions, the main results of important…

  19. “AQMEII Status Update

    EPA Science Inventory

    “AQMEII Status Update”This presentation provided an overview and status update of the Air Quality Model Evaluation International Initative (AQMEII) to participants of a workshop of the Task Force on Hemispheric Transport of Air Pollution (TF-HTAP) . In addition, the p...

  20. 2368 IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. 61, NO. 5, JUNE 2012 recursively updated Cholesky decomposition-based detector performs

    E-print Network

    Elkashlan, Maged

    Cholesky decomposition-based detector performs as well as [1] with a much reduced computational complexity. REFERENCES [1] T. Sartenaer and L. Vandendorpe, "Linear and DF joint detectors for DS-CDMA communication-CDMA systems employing Gold sequences," IEEE Trans. Veh. Technol., vol. 49, no. 6, pp. 2397­2404, Nov. 2000. [8

  1. Integrating XQuery-Enabled SCORM XML Metadata Repositories into an RDF-Based E-Learning P2P Network

    ERIC Educational Resources Information Center

    Qu, Changtao; Nejdl, Wolfgang

    2004-01-01

    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…

  2. 77 FR 28541 - Request for Comments on the Recommendation for the Disclosure of Sequence Listings Using XML...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-05-15

    ...presentation of nucleotide and/or amino acid sequences and the consequent changes...the filing of nucleotide and/or amino acid sequence listings in XML format...keys to describe nucleic acid and amino acid sequences, with a very limited...

  3. 77 FR 28541 - Request for Comments on the Recommendation for the Disclosure of Sequence Listings Using XML...

    Federal Register 2010, 2011, 2012, 2013, 2014

    2012-05-15

    ... the standard for the presentation of nucleotide and/or amino acid sequences and the consequent changes... standard for the filing of nucleotide and/or amino acid sequence listings in XML format (hereinafter...) Feature Keys and Qualifiers. ST.25 uses a controlled vocabulary of feature keys to describe nucleic...

  4. We propose an XML-based Computer Vision Markup Language for use in Cognitive Vision, to enable separate

    E-print Network

    Fisher, Bob

    Abstract We propose an XML-based Computer Vision Markup Language for use in Cognitive Vision, algorithms or even software. The Computer Vision Markup Language can communicate any type and amount a remarkable amount of progress in the abilities and usability of Computer Vision and one is left to wonder why

  5. XLive: An XML Light Integration Virtual Engine Tuyt-Trm Dang-Ngoc*, Clment Jamard**, Nicolas Travers**

    E-print Network

    Dang Ngoc, Tuyêt Trâm

    XLive: An XML Light Integration Virtual Engine Tuyêt-Trâm Dang-Ngoc*, Clément Jamard**, Nicolas@dept-info.u-cergy.fr ** PRiSM Laboratory University of Versailles 78035 Versailles CEDEX (nicolas.travers, clement.jamard)@prism XMLMedia. The XLive prototype is designed to be a light mediation system with high modularity and extension

  6. A Relational-XML data warehouse for data aggregation with SQL and XQuery Joseph Fong, Herbert Shiu and Davy Cheung

    E-print Network

    Fong, Shi Piu Joseph

    1 A Relational-XML data warehouse for data aggregation with SQL and XQuery Joseph Fong, Herbert makers fast access to various materialized views from data warehouses. However, many corporations have activities, a corporation needs to build a data warehouse on top of a middleware to aggregate summarized data

  7. Towards an XML and agent-based framework for the distributed management and analysis of active data archives

    E-print Network

    Walker, David W.

    Implementation and use of a prototype distributed active data archive system are outlined. This system is basedTowards an XML and agent-based framework for the distributed management and analysis of active data on the Synthetic Aperture Radar Atlas (SARA) and utilises cooperative software agents for data access and analysis

  8. Using Extensible Markup Language (XML) for the Single Source Delivery of Educational Resources by Print and Online: A Case Study

    ERIC Educational Resources Information Center

    Walsh, Lucas

    2007-01-01

    This article seeks to provide an introduction to Extensible Markup Language (XML) by looking at its use in a single source publishing approach to the provision of teaching resources in both hardcopy and online. Using the development of the International Baccalaureate Organisation's online Economics Subject Guide as a practical example, this…

  9. A Study of Moment Recursion Models for Tactical Planning of a Job Shop: Literature Survey and Research Opportunities

    E-print Network

    Teo, Chee Chong

    The Moment Recursion (MR) models are a class of models for tactical planning of job shops or other processing networks. The MR model can be used to determine or approximate the first two moments of production quantities ...

  10. Maneuvering target tracking using fuzzy logic-based recursive least squares filter

    NASA Astrophysics Data System (ADS)

    Fan, En; Xie, Wei-xin; Liu, Zong-xiang

    2014-12-01

    In this paper, a fuzzy logic-based recursive least squares filter (FLRLSF) is presented for maneuvering target tracking (MTT) in situations of observations with unknown random characteristics. In the proposed filter, fuzzy logic is applied in the standard recursive least squares filter (RLSF) by the design of a set of fuzzy if-then rules. Given the observation residual and the heading change in the current prediction, these rules are used to determine the magnitude of the fading factor of RLSF. The proposed filter has an advantage in which the restrictive assumptions of statistical models for process noise, measurement noise, and motion models are relaxed. Moreover, it does not need a maneuver detector when tracking a maneuvering target. The performance of FLRLSF is evaluated by using a simulation and real test experiment, and it is found to be better than those of the traditional RLSF, the fuzzy adaptive ?-? filter (FA?-?F), and the hybrid Kalman filter in tracking accuracy.

  11. An explicit algorithm for fully flexible unit cell simulation with recursive thermostat chains

    NASA Astrophysics Data System (ADS)

    Jung, Kwangsub; Cho, Maenghyo

    2008-10-01

    Through the combination of the recursive multiple thermostat (RMT) Nosé-Poincaré and Parrinello-Rahman methods, the recursive multiple thermostat chained fully flexible unit cell (RMT-N?T) molecular dynamics method is proposed for isothermal-isobaric simulation. The RMT method is known to have the advantage of achieving the ergodicity that is required for canonical sampling of the harmonic oscillator. Thus, an explicit time integration algorithm is developed for RMT-N?T. We examine the ergodicity for various parameters of RMT-N?T using bulk and thin film structures with different numbers of copper atoms and thicknesses in various environments. Through the numerical simulations, we conclude that the RMT-N?T method is advantageous in the cases of lower temperatures.

  12. A recursive vesicle-based model protocell with a primitive model cell cycle

    PubMed Central

    Kurihara, Kensuke; Okura, Yusaku; Matsuo, Muneyuki; Toyota, Taro; Suzuki, Kentaro; Sugawara, Tadashi

    2015-01-01

    Self-organized lipid structures (protocells) have been proposed as an intermediate between nonliving material and cellular life. Synthetic production of model protocells can demonstrate the potential processes by which living cells first arose. While we have previously described a giant vesicle (GV)-based model protocell in which amplification of DNA was linked to self-reproduction, the ability of a protocell to recursively self-proliferate for multiple generations has not been demonstrated. Here we show that newborn daughter GVs can be restored to the status of their parental GVs by pH-induced vesicular fusion of daughter GVs with conveyer GVs filled with depleted substrates. We describe a primitive model cell cycle comprising four discrete phases (ingestion, replication, maturity and division), each of which is selectively activated by a specific external stimulus. The production of recursive self-proliferating model protocells represents a step towards eventual production of model protocells that are able to mimic evolution. PMID:26418735

  13. A recursive vesicle-based model protocell with a primitive model cell cycle.

    PubMed

    Kurihara, Kensuke; Okura, Yusaku; Matsuo, Muneyuki; Toyota, Taro; Suzuki, Kentaro; Sugawara, Tadashi

    2015-01-01

    Self-organized lipid structures (protocells) have been proposed as an intermediate between nonliving material and cellular life. Synthetic production of model protocells can demonstrate the potential processes by which living cells first arose. While we have previously described a giant vesicle (GV)-based model protocell in which amplification of DNA was linked to self-reproduction, the ability of a protocell to recursively self-proliferate for multiple generations has not been demonstrated. Here we show that newborn daughter GVs can be restored to the status of their parental GVs by pH-induced vesicular fusion of daughter GVs with conveyer GVs filled with depleted substrates. We describe a primitive model cell cycle comprising four discrete phases (ingestion, replication, maturity and division), each of which is selectively activated by a specific external stimulus. The production of recursive self-proliferating model protocells represents a step towards eventual production of model protocells that are able to mimic evolution. PMID:26418735

  14. A Note on Local Stability Conditions for Two Types of Monetary Models with Recursive Utility

    NASA Astrophysics Data System (ADS)

    Miyazaki, Kenji; Utsunomiya, Hitoshi

    2009-09-01

    This note explores local stability conditions for money-in-utility-function (MIUF) and transaction-costs (TC) models with recursive utility. Although Chen et al. [Chen, B.-L., M. Hsu, and C.-H. Lin, 2008, Inflation and growth: impatience and a qualitative equivalent, Journal of Money, Credit, and Banking, Vol. 40, No. 6, 1310-1323] investigated the relationship between inflation and growth in MIUF and TC models with recursive utility, they conducted only a comparative static analysis in a steady state. By establishing sufficient conditions for local stability, this note proves that impatience should be increasing in consumption and real balances. Increasing impatience, although less plausible from an empirical point of view, receives more support from a theoretical viewpoint.

  15. A recursive vesicle-based model protocell with a primitive model cell cycle

    NASA Astrophysics Data System (ADS)

    Kurihara, Kensuke; Okura, Yusaku; Matsuo, Muneyuki; Toyota, Taro; Suzuki, Kentaro; Sugawara, Tadashi

    2015-09-01

    Self-organized lipid structures (protocells) have been proposed as an intermediate between nonliving material and cellular life. Synthetic production of model protocells can demonstrate the potential processes by which living cells first arose. While we have previously described a giant vesicle (GV)-based model protocell in which amplification of DNA was linked to self-reproduction, the ability of a protocell to recursively self-proliferate for multiple generations has not been demonstrated. Here we show that newborn daughter GVs can be restored to the status of their parental GVs by pH-induced vesicular fusion of daughter GVs with conveyer GVs filled with depleted substrates. We describe a primitive model cell cycle comprising four discrete phases (ingestion, replication, maturity and division), each of which is selectively activated by a specific external stimulus. The production of recursive self-proliferating model protocells represents a step towards eventual production of model protocells that are able to mimic evolution.

  16. CAMORRA: a C++ library for recursive computation of particle scattering amplitudes

    E-print Network

    Ronald Kleiss; Gijs van den Oord

    2010-06-29

    We present a new Monte Carlo tool that computes full tree-level matrix elements in high-energy physics. The program accepts user-defined models and has no restrictions on the process multiplicity. To achieve acceptable performance, CAMORRA evaluates the matrix elements in a recursive way by combining off-shell currents. Furthermore, CAMORRA can be used to compute amplitudes involving continuous color and helicity final states.

  17. An XML-Based Manipulation and Query Language for Rule-Based Information

    NASA Astrophysics Data System (ADS)

    Mansour, Essam; Höpfner, Hagen

    Rules are utilized to assist in the monitoring process that is required in activities, such as disease management and customer relationship management. These rules are specified according to the application best practices. Most of research efforts emphasize on the specification and execution of these rules. Few research efforts focus on managing these rules as one object that has a management life-cycle. This paper presents our manipulation and query language that is developed to facilitate the maintenance of this object during its life-cycle and to query the information contained in this object. This language is based on an XML-based model. Furthermore, we evaluate the model and language using a prototype system applied to a clinical case study.

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

    PubMed

    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. PMID:26188793

  19. Haydock’s recursive solution of self-adjoint problems. Discrete spectrum

    SciTech Connect

    Moroz, Alexander

    2014-12-15

    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 (p{sub n}(E)) in energy variable E. The polynomials (p{sub n}(E)) are orthonormal with respect to the density of states n{sub 0}(E) and energy eigenstate |E? is the generating function of (p{sub n}(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.

  20. Convergence of direct recursive algorithm for identification of Preisach hysteresis model with stochastic input

    E-print Network

    D. Rachinskii; M. Ruderman

    2015-03-06

    We consider a recursive iterative algorithm for identification of parameters of the Preisach model, one of the most commonly used models of hysteretic input-output relationships. The classical identification algorithm due to Mayergoyz defines explicitly a series of test inputs that allow one to find parameters of the Preisach model with any desired precision provided that (a) such input time series can be implemented and applied; and, (b) the corresponding output data can be accurately measured and recorded. Recursive iterative identification schemes suitable for a number of engineering applications have been recently proposed as an alternative to the classical algorithm. These recursive schemes do not use any input design but rather rely on an input-output data stream resulting from random fluctuations of the input variable. Furthermore, only recent values of the input-output data streams are available for the scheme at any time instant. In this work, we prove exponential convergence of such algorithms, estimate explicitly the convergence rate, and explore which properties of the stochastic input and the algorithm affect the guaranteed convergence rate.